A framework for exact synthesis
arXiv:1504.04350
Abstract
Exact synthesis is a tool used in algorithms for approximating an arbitrary qubit unitary with a sequence of quantum gates from some finite set. These approximation algorithms find asymptotically optimal approximations in probabilistic polynomial time, in some cases even finding the optimal solution in probabilistic polynomial time given access to an oracle for factoring integers. In this paper, we present a common mathematical structure underlying all results related to the exact synthesis of qubit unitaries known to date, including Clifford+T, Clifford-cyclotomic and V-basis gate sets, as well as gates sets induced by the braiding of Fibonacci anyons in topological quantum computing. The framework presented here also provides a means to answer questions related to the exact synthesis of unitaries for wide classes of other gate sets, such as Clifford+T+V and SU(2) level k anyons.
40 pages, preliminary version
References in corpus (16)
- Simulating chemistry efficiently on fault-tolerant quantum computers
- Efficient synthesis of universal Repeat-Until-Success circuits
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Asymptotically Optimal Topological Quantum Compiling
- A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
- Efficient Decomposition of Single-Qubit Gates into Basis Circuits
- 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
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- Universal Gates via Fusion and Measurement Operations on SU Anyons
- Remarks on Matsumoto and Amano's normal form for single-qubit Clifford+T operators
- Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
- Optimal Ancilla-free Pauli+V Circuits for Axial Rotations
- An algorithm for the T-count
- Distillation protocols for Fourier states in quantum computing