Automated optimization of large quantum circuits with continuous parameters
暂无分享,去创建一个
Dmitri Maslov | Yun Seong Nam | Neil J. Ross | Yuan Su | Andrew M. Childs | D. Maslov | Yuan Su | Y. Nam | N. J. Ross
[1] Thomas G. Draper. Addition on a Quantum Computer , 2000, quant-ph/0008033.
[2] Igor L. Markov,et al. Synthesis and optimization of reversible circuits—a survey , 2011, CSUR.
[3] Peter Stevenhagen,et al. The number field sieve , 2008 .
[4] R. V. Meter,et al. Fast quantum modular exponentiation , 2004, quant-ph/0408006.
[5] V. Rich. Personal communication , 1989, Nature.
[6] Earl T. Campbell,et al. An efficient quantum compiler that reduces T count , 2017, Quantum Science and Technology.
[7] R. Feynman. Simulating physics with computers , 1999 .
[8] Gerhard W. Dueck,et al. Quantum Circuit Simplification and Level Compaction , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[9] S. Debnath,et al. Demonstration of a small programmable quantum computer with atomic qubits , 2016, Nature.
[10] Dmitri Maslov,et al. Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[11] R. Cleve,et al. Efficient Quantum Algorithms for Simulating Sparse Hamiltonians , 2005, quant-ph/0508139.
[12] Dmitri Maslov,et al. Optimal and asymptotically optimal NCT reversible circuits by the gate types , 2016, Quantum Inf. Comput..
[13] George Rajna,et al. Practical Quantum Computers , 2016 .
[14] Earl T. Campbell,et al. Quantum computation with realistic magic-state factories , 2016, 1605.07197.
[15] M. Mosca,et al. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[16] Seth Lloyd,et al. Universal Quantum Simulators , 1996, Science.
[17] Barenco,et al. Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[18] D. Coppersmith. An approximate Fourier transform useful in quantum factoring , 2002, quant-ph/0201067.
[19] R. Blumel,et al. Scaling laws for Shor's algorithm with a banded quantum Fourier transform , 2013, 1302.5844.
[20] Pawel Wocjan,et al. "Identity check" is QMA-complete , 2003 .
[21] John P. Hayes,et al. Data structures and algorithms for simplifying reversible circuits , 2006, JETC.
[22] A. Kitaev,et al. Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages) , 2004, quant-ph/0403025.
[23] Neil J. Ross,et al. Optimal ancilla-free Clifford+T approximation of z-rotations , 2014, Quantum Inf. Comput..
[24] Benoît Valiron,et al. Quipper: a scalable quantum programming language , 2013, PLDI.
[25] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[26] Dmitri Maslov,et al. Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates , 2012, Quantum Inf. Comput..
[27] A. Fowler,et al. A bridge to lower overhead quantum computation , 2012, 1209.0510.
[28] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[29] Elizabeth Gibney,et al. Europe’s billion-euro quantum project takes shape , 2017, Nature.