Unifying gate-synthesis and magic state distillation

Abstract

The leading paradigm for performing 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 realise a desired circuit. We introduce a unified framework that implements one round of distillation and multi-qubit 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 resource savings.

Authors' final copy (Accepted to Phys. Rev. Lett). 5 pages. This is one of a pair of companion papers. The more detailed page paper is entitled "A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost"

References in corpus (10)

• Surface codes: Towards practical large-scale quantum computation
• Topological fault-tolerance in cluster state quantum computation
• Magic state distillation with low overhead
• Novel constructions for the fault-tolerant Toffoli gate
• Efficient synthesis of universal Repeat-Until-Success circuits
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• Distilling one-qubit magic states into Toffoli states
• Reducing the quantum computing overhead with complex gate distillation
• Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links

Cited by in corpus (33)

• Building a fault-tolerant quantum computer using concatenated cat codes
• Magic State Distillation: Not as Costly as You Think
• Quantum computation with realistic magic state factories
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Measuring magic on a quantum processor
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Applying quantum algorithms to constraint satisfaction problems
• On the CNOT-complexity of CNOT-PHASE circuits
• Fundamental limitations on distillation of quantum channel resources
• On Optimality of CSS Codes for Transversal $T$
• Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures
• Pseudomagic Quantum States
• Morphing quantum codes
• Phase transition in Stabilizer Entropy and efficient purity estimation
• Qutrit and Ququint Magic States
• Verifying the Smallest Interesting Colour Code with Quantomatic
• Constraints on magic state protocols from the statistical mechanics of Wigner negativity
• Lattice Surgery on the Raussendorf Lattice
• Quantum Pin Codes
• Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates
• Magic state distillation with punctured polar codes
• Geometric structure and transversal logic of quantum Reed-Muller codes
• Rigorous noise reduction with quantum autoencoders
• Classical Coding Approaches to Quantum Applications
• Low Overhead Qutrit Magic State Distillation
• Non-stabilizerness and entanglement from cat-state injection
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
• Quantifying magic via quantum $(\alpha ,\beta )$ Jensen-Shannon divergence
• Machine learning logical gates for quantum error correction
• RESCQ: Realtime Scheduling for Continuous Angle Quantum Error Correction Architectures