Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity
Authors:
Top Cited Papers
- 26 April 2017
- journal article
- research article
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 56 (7) , 2350-2361
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61303039)
- the Science and Technology Research Project of Chongqiong Education Commission (KJ1713339)
This publication has 35 references indexed in Scilit:
- Synthesis and optimization of reversible circuits—a surveyACM Computing Surveys, 2013
- An Efficient Exact Quantum Algorithm for the Integer Square-free Decomposition ProblemScientific Reports, 2012
- Recent progress in quantum algorithmsCommunications of the ACM, 2010
- Quantum Algorithm for Linear Systems of EquationsPhysical Review Letters, 2009
- Efficient Toffoli gates using quditsPhysical Review A, 2007
- Efficient Decomposition of Quantum GatesPhysical Review Letters, 2004
- Simple quantum error-correcting codesPhysical Review A, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum computational networksProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1989