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