The leading paradigm for performing a computation on quantum memories can be encapsulated as distill-then-synthesize. Initially, one performs several rounds of distillation to create high-fidelity magic states that provide one good T gate, an essential quantum logic gate. Subsequently, gate synthesis intersperses many T gates with Clifford gates to realize a desired circuit. We introduce a unified framework that implements one round of distillation and multiquibit gate synthesis in a single step. Typically, our method uses the same number of T gates as conventional synthesis but with the added benefit of quadratic error suppression. Because of this, one less round of magic state distillation needs to be performed, leading to significant res...
For universal quantum computation, a major challenge to overcome for practical implementation is the...
Quantum computers can solve certain problems much faster than classical computers. However, in order...
Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of n...
The standard approach to fault-tolerant quantum computation is to store information in a quantum err...
A practical quantum computer must not merely store information, but also process it. To prevent erro...
We propose a family of error-detecting stabilizer codes with an encoding rate of 1/3 that permit a t...
Magic state distillation is a fundamental technique for realizing fault-tolerant universal quantum c...
Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a t...
Standard error correction techniques only provide a quantum memory and need extra gadgets to perform...
Magic states are eigenstates of non-Pauli operators. One way of suppressing errors present in magic ...
Fault-tolerant protocols enable large and precise quantum algorithms. Many such protocols rely on a ...
We propose families of protocols for magic-state distillation—important components of fault-toleranc...
Magic state distillation is one of the leading candidates for implementing universal fault-tolerant ...
The development of a framework for quantifying ‘non-stabilizerness’ of quantum operations is motivat...
Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, ca...
For universal quantum computation, a major challenge to overcome for practical implementation is the...
Quantum computers can solve certain problems much faster than classical computers. However, in order...
Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of n...
The standard approach to fault-tolerant quantum computation is to store information in a quantum err...
A practical quantum computer must not merely store information, but also process it. To prevent erro...
We propose a family of error-detecting stabilizer codes with an encoding rate of 1/3 that permit a t...
Magic state distillation is a fundamental technique for realizing fault-tolerant universal quantum c...
Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a t...
Standard error correction techniques only provide a quantum memory and need extra gadgets to perform...
Magic states are eigenstates of non-Pauli operators. One way of suppressing errors present in magic ...
Fault-tolerant protocols enable large and precise quantum algorithms. Many such protocols rely on a ...
We propose families of protocols for magic-state distillation—important components of fault-toleranc...
Magic state distillation is one of the leading candidates for implementing universal fault-tolerant ...
The development of a framework for quantifying ‘non-stabilizerness’ of quantum operations is motivat...
Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, ca...
For universal quantum computation, a major challenge to overcome for practical implementation is the...
Quantum computers can solve certain problems much faster than classical computers. However, in order...
Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of n...