Efficient synthesis of probabilistic quantum circuits with fallback
Open Access
- 18 May 2015
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 91 (5)
- https://doi.org/10.1103/physreva.91.052317
Abstract
Repeat-until-success (RUS) circuits can approximate a given single-qubit unitary with an expected number of gates of about of what is required by optimal, deterministic, ancilla-free decompositions over the Clifford + gate set. In this work, we introduce a more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols that probabilistically implement quantum circuits over several universal gate sets including, but not restricted to, the Clifford + gate set. The protocol, which we call probabilistic quantum circuits with fallback (PQF), implements a walk on a discrete Markov chain in which the target unitary is an absorbing state and in which transitions are induced by multiqubit unitaries followed by measurements. In contrast to RUS protocols, the presented PQF protocols are guaranteed to terminate after a finite number of steps. Specifically, we apply our method to the Clifford + , Clifford + , and Clifford + gate sets to achieve decompositions with expected gate counts of , where is a quantity related to the expansion property of the underlying universal gate set.
Keywords
Other Versions
This publication has 10 references indexed in Scilit:
- Reducing the quantum-computing overhead with complex gate distillationPhysical Review A, 2015
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T CircuitsIEEE Transactions on Computers, 2015
- Efficient Synthesis of Universal Repeat-Until-Success Quantum CircuitsPhysical Review Letters, 2015
- Distillation of nonstabilizer states for universal quantum computationPhysical Review A, 2013
- Efficient decomposition of single-qubit gates intobasis circuitsPhysical Review A, 2013
- Exact synthesis of multiqubit Clifford+circuitsPhysical Review A, 2013
- Magic-state distillation with low overheadPhysical Review A, 2012
- Resource-Optimal Single-Qubit Quantum CircuitsPhysical Review Letters, 2012
- Universal quantum computation with ideal Clifford gates and noisy ancillasPhysical Review A, 2005
- Introduction to Cyclotomic FieldsGraduate Texts in Mathematics, 1997