A patent filing for our fast reversal sorting protocol.
Advantages and limitations of quantum routing
We lower bound the circuit depth or time required for quantum routing in terms of spectral properties of graphs representing the architecture interaction constraints, and give a generalized upper bound for all simple connected $n$-vertex graphs.
Performing state reversal on a quantum spin chain
Patent for our spin chain reversal protocol.
Estimating gate complexities for the site-by-site preparation of fermionic vacua
In this paper, we study the scaling of the overlap between an $N$- and $(N+1)$-site ground state, as a function of the number of sites $N$, for a range of quadratic fermionic Hamiltonians.
Quantum routing with teleportation
We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC).
Nearly optimal time-independent reversal of a spin chain
We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of $N$ spins.