Efficient Decomposition of Single-Qubit Gates into Basis Circuits
arXiv:1303.1411 · doi:10.1103/PhysRevA.88.012313
Abstract
We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal basis. The basis is an alternative universal basis to the more commonly studied basis. We propose two classical algorithms for quantum circuit compilation: the first algorithm has expected polynomial time (in precision ) and offers a depth/precision guarantee that improves upon state-of-the-art methods for compiling into the basis by factors ranging from 1.86 to . The second algorithm is analogous to direct search and yields circuits a factor of 3 to 4 times shorter than our first algorithm, and requires time exponential in ; however, we show that in practice the runtime is reasonable for an important range of target precisions.
arXiv comment13 pages
References in corpus (8)
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Novel constructions for the fault-tolerant Toffoli gate
- Improved magic states distillation for quantum universality
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Efficient Discrete Approximations of Quantum Gates
- Scalability of Shor's algorithm with a limited set of rotation gates
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- Distilling one-qubit magic states into Toffoli states
Cited by in corpus (34)
- 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
- Topological Quantum Compiling with Reinforcement Learning
- The Complexity Geometry of a Single Qubit
- Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
- Efficient synthesis of probabilistic quantum circuits with fallback
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- Variational quantum compiling with double Q-learning
- Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- Floating Point Representations in Quantum Circuit Synthesis
- T-count and T-depth of any multi-qubit unitary
- Shorter quantum circuits via single-qubit gate approximation
- Criteria for universality of quantum gates
- Canonical forms for single-qutrit Clifford+T operators
- Parallelizing quantum circuit synthesis
- Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits
- Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
- Logic Synthesis for Fault-Tolerant Quantum Computers
- Optimal Ancilla-free Pauli+V Circuits for Axial Rotations
- How to check universality of quantum gates?
- Distillation protocols for Fourier states in quantum computing
- A framework for exact synthesis
- Multi-objective evolutionary algorithms for quantum circuit discovery
- Calculable lower bounds on the efficiency of universal sets of quantum gates
- Small Codes for Magic State Distillation
- Resource optimization for fault-tolerant quantum computing
- Matrix concentration inequalities and efficiency of random universal sets of quantum gates
- Ancilla Approximable Quantum State Transformations
- Resource comparison of two surface code implementations of small angle Z rotations
- Weighted Quantum Channel Compiling through Proximal Policy Optimization
- Compiling universal quantum circuits
- Synthesis of Single Qutrit Circuits from Clifford+R