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.
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 fast reversals
We present methods for implementing arbitrary permutations of qubits under interaction constraints.