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.
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.
Quantum routing with fast reversals
We present methods for implementing arbitrary permutations of qubits under interaction constraints.
Design and Optimization in Near-Term Quantum Computation
My PhD thesis.
Entanglement bounds on the performance of quantum computing architectures
In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states.
Unitary entanglement construction in hierarchical networks
We present numerical and analytical results on the speed at which large entangled states can be created on nearest-neighbor grids and hierarchy graphs. We also present a scheme for performing circuit placement on hierarchical quantum architectures.