A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits

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

Cited by in corpus (8)

• Simulating chemistry efficiently on fault-tolerant quantum computers
• Efficient synthesis of universal Repeat-Until-Success circuits
• Efficient synthesis of probabilistic quantum circuits with fallback
• Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
• Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
• Genetic braid optimization: A heuristic approach to compute quasiparticle braids
• A framework for exact synthesis
• Resource optimization for fault-tolerant quantum computing