A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations

Abstract

An important task required to build a scalable, fault-tolerant quantum computer is to efficiently represent an arbitrary single-qubit rotation by fault-tolerant quantum operations. Traditionally, the method for decomposing a single-qubit unitary into a discrete set of gates is Solovay-Kitaev decomposition, which in practice produces a sequence of depth O(\log^c(1/ε)), where c~3.97 is the state-of-the-art. The proven lower bound is c=1, however an efficient algorithm that saturates this bound is unknown. In this paper, we present an alternative to Solovay-Kitaev decomposition employing state distillation techniques which reduces c to between 1.12 and 2.27, depending on the setting. For a given single-qubit rotation, our protocol significantly lowers the length of the approximating sequence and the number of required resource states (ancillary qubits). In addition, our protocol is robust to noise in the resource states.

10 pages, 18 figures, 5 tables

References in corpus (7)

• Instantaneous non-local computation of low T-depth quantum circuits
• Magic state distillation with low overhead
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Multilevel distillation of magic states for quantum computing
• Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Introduction to Quantum Computation

Cited by in corpus (33)

• Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes
• Application of a resource theory for magic states to fault-tolerant quantum computing
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Magic State Distillation: Not as Costly as You Think
• Quantum computation with realistic magic state factories
• Efficient synthesis of universal Repeat-Until-Success circuits
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits
• Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
• Efficient synthesis of probabilistic quantum circuits with fallback
• Solovay-Kitaev Decomposition Strategy for Single-Qubit Channels
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Unifying gate-synthesis and magic state distillation
• Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
• Reducing the quantum computing overhead with complex gate distillation
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• Universal limitations on implementing resourceful unitary evolutions
• Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
• Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
• Logic Synthesis for Fault-Tolerant Quantum Computers
• Fractional Chern insulator edges and layer-resolved lattice contacts
• Quantum Error Correction During 50 Gates
• Efficient Clifford+T approximation of single-qubit operators
• A framework for exact synthesis
• Distillation protocols for Fourier states in quantum computing
• Code switching revisited: Low-overhead magic state preparation using color codes
• Small Codes for Magic State Distillation
• Resource optimization for fault-tolerant quantum computing
• Pseudo-Random Circuits from Clifford Plus T-Gates
• Ancilla Approximable Quantum State Transformations
• From Magic State Distillation to Dynamical Systems
• Efficient simulation of logical magic state preparation protocols