Building a fault-tolerant quantum computer using concatenated cat codes
We present a comprehensive architectural analysis for a proposed fault-tolerant quantum
computer based on cat codes concatenated with outer quantum error-correcting codes. For …
computer based on cat codes concatenated with outer quantum error-correcting codes. For …
Application of a resource theory for magic states to fault-tolerant quantum computing
Motivated by their necessity for most fault-tolerant quantum computation schemes, we
formulate a resource theory for magic states. First, we show that robustness of magic is a …
formulate a resource theory for magic states. First, we show that robustness of magic is a …
Universal quantum computing with twist-free and temporally encoded lattice surgery
Lattice-surgery protocols allow for the efficient implementation of universal gate sets with two-
dimensional topological codes where qubits are constrained to interact with one another …
dimensional topological codes where qubits are constrained to interact with one another …
Magic state distillation: Not as costly as you think
D Litinski - Quantum, 2019 - quantum-journal.org
Despite significant overhead reductions since its first proposal, magic state distillation is
often considered to be a very costly procedure that dominates the resource cost of fault …
often considered to be a very costly procedure that dominates the resource cost of fault …
Measuring magic on a quantum processor
Magic states are the resource that allows quantum computers to attain an advantage over
classical computers. This resource consists in the deviation from a property called …
classical computers. This resource consists in the deviation from a property called …
Quantum computation with realistic magic-state factories
J O'Gorman, ET Campbell - Physical Review A, 2017 - APS
Leading approaches to fault-tolerant quantum computation dedicate a significant portion of
the hardware to computational factories that churn out high-fidelity ancillas called magic …
the hardware to computational factories that churn out high-fidelity ancillas called magic …
Poking holes and cutting corners to achieve Clifford gates with the surface code
The surface code is currently the leading proposal to achieve fault-tolerant quantum
computation. Among its strengths are the plethora of known ways in which fault-tolerant …
computation. Among its strengths are the plethora of known ways in which fault-tolerant …
Fundamental limitations on distillation of quantum channel resources
Quantum channels underlie the dynamics of quantum systems, but in many practical settings
it is the channels themselves that require processing. We establish universal limitations on …
it is the channels themselves that require processing. We establish universal limitations on …
Applying quantum algorithms to constraint satisfaction problems
Quantum algorithms can deliver asymptotic speedups over their classical counterparts.
However, there are few cases where a substantial quantum speedup has been worked out …
However, there are few cases where a substantial quantum speedup has been worked out …
On the CNOT-complexity of CNOT-PHASE circuits
We study the problem of CNOT-optimal quantum circuit synthesis over gate sets consisting
of CNOT and Z-basis rotations of arbitrary angles. We show that the circuit-polynomial …
of CNOT and Z-basis rotations of arbitrary angles. We show that the circuit-polynomial …