Automated optimization of large quantum circuits with continuous parameters

[1]  Earl T. Campbell,et al.  An efficient quantum compiler that reduces T count , 2017, Quantum Science and Technology.

[2]  Elizabeth Gibney,et al.  Europe’s billion-euro quantum project takes shape , 2017, Nature.

[3]  Earl T. Campbell,et al.  Quantum computation with realistic magic-state factories , 2016, 1605.07197.

[4]  George Rajna,et al.  Practical Quantum Computers , 2016 .

[5]  S. Debnath,et al.  Demonstration of a small programmable quantum computer with atomic qubits , 2016, Nature.

[6]  Dmitri Maslov,et al.  Optimal and asymptotically optimal NCT reversible circuits by the gate types , 2016, Quantum Inf. Comput..

[7]  Neil J. Ross,et al.  Optimal ancilla-free Clifford+T approximation of z-rotations , 2014, Quantum Inf. Comput..

[8]  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.

[9]  Benoît Valiron,et al.  Quipper: a scalable quantum programming language , 2013, PLDI.

[10]  R. Blumel,et al.  Scaling laws for Shor's algorithm with a banded quantum Fourier transform , 2013, 1302.5844.

[11]  Dmitri Maslov,et al.  Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates , 2012, Quantum Inf. Comput..

[12]  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.

[13]  Igor L. Markov,et al.  Synthesis and optimization of reversible circuits—a survey , 2011, CSUR.

[14]  A. Fowler,et al.  A bridge to lower overhead quantum computation , 2012, 1209.0510.

[15]  Peter Stevenhagen,et al.  The number field sieve , 2008 .

[16]  Gerhard W. Dueck,et al.  Quantum Circuit Simplification and Level Compaction , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[18]  R. Cleve,et al.  Efficient Quantum Algorithms for Simulating Sparse Hamiltonians , 2005, quant-ph/0508139.

[19]  John P. Hayes,et al.  Data structures and algorithms for simplifying reversible circuits , 2006, JETC.

[20]  R. V. Meter,et al.  Fast quantum modular exponentiation , 2004, quant-ph/0408006.

[21]  A. Kitaev,et al.  Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages) , 2004, quant-ph/0403025.

[22]  D. Janzing,et al.  "Identity check" is QMA-complete , 2003, quant-ph/0305050.

[23]  Thomas G. Draper.  Addition on a Quantum Computer , 2000, quant-ph/0008033.

[24]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[25]  Seth Lloyd,et al.  Universal Quantum Simulators , 1996, Science.

[26]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[27]  D. Coppersmith.  An approximate Fourier transform useful in quantum factoring , 2002, quant-ph/0201067.

[28]  R. Feynman.  Simulating physics with computers , 1999 .