• Publications
  • Influence
Topological quantum memory
We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, andExpand
Perfect state transfer in quantum spin networks.
It is shown that 2log3N is the maximal perfect communication distance for hypercube geometries if one allows fixed but different couplings between the qubits, then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. Expand
Perfect Transfer of Arbitrary States in Quantum Spin Networks
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitraryExpand
Quantum computing by color-code lattice surgery
We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods.Expand
Continuous quantum error correction via quantum feedback control
We describe a protocol for continuously protecting unknown quantum states from decoherence that incorporates design principles from both quantum error correction and quantum feedback control. OurExpand
Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
A complex instruction set computing (\textsc{cisc}) architecture is developed whose instruction set includes stabilizer operations and preparation of magic states from which Z(\pi/2^k) gates can be teleported, for a substantial overall reduction in the number of gates required to achieve a desired gate accuracy for $Z$ rotations. Expand
Fault-tolerant quantum computing with color codes
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We furtherExpand
Quantum algorithms for the ordered search problem via semidefinite programming
One of the most basic computational problems is the task of finding a desired item in an ordered list of $N$ items. While the best classical algorithm for this problem usesExpand
Two-Atom Rydberg Blockade using Direct 6S to nP Excitation
We explore a single-photon approach to Rydberg state excitation and Rydberg blockade. Using detailed theoretical models, we show the feasibility of direct excitation, predict the effect of backgroundExpand
Quantum search by measurement
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution,Expand