Quantum-assisted quantum compiling
作者： Andrew T. Sornborger , Lukasz Cincio , Patrick J. Coles , Sumeet Khatri , Sumeet Khatri
DOI: 10.22331/Q-2019-05-13-140
关键词:
摘要: Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both …
quantum-journal.org
arxiv-vanity.com参考文章(56)
Tien Trung Pham, Rodney Van Meter, Clare Horsman, Optimization of the Solovay-Kitaev algorithm Physical Review A. ,vol. 87, pp. 052332- ,(2013) , 10.1103/PHYSREVA.87.052332
Jeffrey Booth Jr, Quantum Compiler Optimizations arXiv: Quantum Physics. ,(2012)
Juan Carlos Garcia-Escartin, Pedro Chamorro-Posada, swap test and Hong-Ou-Mandel effect are equivalent Physical Review A. ,vol. 87, pp. 052330- ,(2013) , 10.1103/PHYSREVA.87.052330
Jeffrey Goldstone, Sam Gutmann, Edward Farhi, A Quantum Approximate Optimization Algorithm arXiv: Quantum Physics. ,(2014)
Peter W. Shor, Stephen P. Jordan, Estimating Jones polynomials is a complete problem for one clean qubit Quantum Information & Computation. ,vol. 8, pp. 681- 714 ,(2008) , 10.5555/2017011.2017012
Isaac L. Chuang, Michael A. Nielsen, Quantum Computation and Quantum Information ,(2000)
R. V. Ramos, P. B. M. Sousa, Universal quantum circuit for N-qubit quantum gate: a programmable quantum gate Quantum Information & Computation. ,vol. 7, pp. 228- 242 ,(2007) , 10.26421/QIC7.3-4
Christopher M. Dawson, Michael A. Nielsen, The Solovay-Kitaev algorithm Quantum Information & Computation. ,vol. 6, pp. 81- 95 ,(2006) , 10.5555/2011679.2011685
E. Knill, R. Laflamme, Power of One Bit of Quantum Information Physical Review Letters. ,vol. 81, pp. 5672- 5675 ,(1998) , 10.1103/PHYSREVLETT.81.5672
John Preskill, Quantum computing and the entanglement frontier arXiv: Quantum Physics. ,(2012)