A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
arXiv:1206.3223 · doi:10.1103/PhysRevLett.109.190501
Abstract
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit quantum circuits, and the corresponding rules for exactly reducing an arbitrary single-qubit circuit to this canonical form. We focus on the single-qubit universal H,T basis due to its role in fault-tolerant quantum computing, and show how our formalism might be extended to other universal bases. We then extend our canonical representation to the family of Solovay-Kitaev decomposition algorithms, in order to find an ε-approximation to the single-qubit circuit in polylogarithmic time. For a given single-qubit operation, we find significantly lower-depth ε-approximation circuits than previous state-of-the-art implementations. In addition, the implementation of our algorithm requires significantly fewer resources, in terms of computation memory, than previous approaches.
10 pages, 3 figures
References in corpus (2)
Cited by in corpus (38)
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Simulating chemistry efficiently on fault-tolerant quantum computers
- Efficient synthesis of universal Repeat-Until-Success circuits
- Topological Quantum Compiling with Reinforcement Learning
- Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis
- Efficient synthesis of probabilistic quantum circuits with fallback
- Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
- Comparing the Overhead of Topological and Concatenated Quantum Error Correction
- Multi-Neutrino Entanglement and Correlations in Dense Neutrino Systems
- Normal form for single-qutrit Clifford+T operators and synthesis of single-qutrit gates
- On quantum circuits employing roots of the Pauli matrices
- Super-Golden-Gates for PU(2)
- Coherent control of a qubit is trap-free
- Optimising the Solovay-Kitaev algorithm
- The block-ZXZ synthesis of an arbitrary quantum circuit
- QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
- Complex instruction set computing architecture for performing accurate quantum rotations with less magic
- Product Formulas for Exponentials of Commutators
- Remarks on Matsumoto and Amano's normal form for single-qubit Clifford+T operators
- Heuristics for Quantum Compiling with a Continuous Gate Set
- Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
- Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
- Optimizing Clifford gate generation for measurement-only topological quantum computation with Majorana zero modes
- Quantum compiling with diffusive sets of gates
- Quantum Error Correction During 50 Gates
- Quantum Error Correction Implementation after Multiple Gates
- Genetic braid optimization: A heuristic approach to compute quasiparticle braids
- A framework for exact synthesis
- Cost-optimal single-qubit gate synthesis in the Clifford hierarchy
- Pseudo-Random Circuits from Clifford Plus T-Gates
- Resource optimization for fault-tolerant quantum computing
- Quantum Computing's Classical Problem, Classical Computing's Quantum Problem
- Weighted Quantum Channel Compiling through Proximal Policy Optimization
- Error Crafting in Mixed Quantum Gate Synthesis
- Symmetric channel verification for purifying noisy quantum channels
- Quantum Theory from Principles, Quantum Software from Diagrams