Fetching the paper…
Reading the bibliography…
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 by industry and academia.
J. Močkus, in Optimization Techniques IFIP Technical Conference Novosibirsk, July 1–7, 1974 (Springer Berlin Heidelberg, Berlin, Heidelberg, 1975) pp. 400–404
1975
Earlier work this paper cites.
R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
M. Suzuki, Fractal decomposition of exponential operators with applications to many-body theories and monte carlo simulations, Physics Letters A 146
1990
Earlier work this paper cites.
P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
A. Kitaev, Quantum computations: algorithms and error correction, Russian Mathematical Surveys 52
1997
Earlier work this paper cites.
E. Knill and R. Laflamme, Power of one bit of quantum information, Physical Review Letters 81
1998
Earlier work this paper cites.
M. Horodecki, P. Horodecki, and R. Horodecki, General teleportation channel, singlet fraction, and quasidistillation, Physical Review A 60
1999
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2000)
2000
Earlier work this paper cites.
M. A. Nielsen, A simple formula for the average gate fidelity of a quantum dynamical operation, Physics Letters A 303
2002
Earlier work this paper cites.
F. Vatan and C. Williams, Optimal quantum circuits for general two-qubit gates, Physical Review A 69
2004
Earlier work this paper cites.
B. Rosgen and J. Watrous, in 20th Annual IEEE Conference on Computational Complexity (CCC’05) (2005) pp. 344–354
2005
Earlier work this paper cites.
C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm, Quantum Information and Compututation 6
2006
Earlier work this paper cites.
P. B. M. Sousa and R. V. Ramos, Universal quantum circuit for n n -qubit quantum gate: A programmable quantum gate, Quantum Information and Computation 7
2007
Earlier work this paper cites.
D. Maslov, G. W. Dueck, D. M. Miller, and C. Negrevergne, Quantum circuit simplification and level compaction, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27
2008
Earlier work this paper cites.
P. W. Shor and S. P. Jordan, Estimating jones polynomials is a complete problem for one clean qubit, Quantum Information & Computation 8
2008
Earlier work this paper cites.
A. Gepp and P. Stocks, A review of procedures to evolve quantum algorithms, Genetic Programming and Evolvable Machines 10
2009
Earlier work this paper cites.
M. A. Osborne, R. Garnett, and S. J. Roberts, in 3rd International Conference on Learning and Intelligent Optimization (LION3) 2009 (2009)
2009
Earlier work this paper cites.
X. Glorot and Y. Bengio, in In Proceedings of the International Conference on Artificial Intelligence and Statistics (2010) pp. 249–256
2010
Earlier work this paper cites.
A. G. Fowler, Constructing arbitrary Steane code single logical qubit fault-tolerant gates, Quantum Information and Computation 11
2011
Earlier work this paper cites.
X.-Q. Zhou, T. C. Ralph, P. Kalasuwan, M. Zhang, A. Peruzzo, B. P. Lanyon, and J. L. O’Brien, Adding control to arbitrary unknown quantum operations, Nature Communications 2
2011
Cited alongside, same era.
J. Preskill, Quantum computing and the entanglement frontier, arXiv:1203.5813 (2012)
2012
Cited alongside, same era.
J. Booth Jr, Quantum compiler optimizations, arXiv:1206.3348 (2012)
2012
Cited alongside, same era.
T. T. Pham, R. Van Meter, and C. Horsman, Optimization of the Solovay-Kitaev algorithm, Physical Review A 87
2013
Cited alongside, same era.
V. Kliuchnikov, D. Maslov, and M. Mosca, Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits, Physical Review Letters 110
2018
Closest in time.
L. Cincio, Y. Subaşı, A. T. Sornborger, and P. J. Coles, Learning the quantum algorithm for state overlap, New Journal of Physics 20
2018
Closest in time.
Y. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov, Automated optimization of large quantum circuits with continuous parameters, npj Quantum Information 4
2018
Closest in time.
L. E. Heyfron and E. T. Campbell, An efficient quantum compiler that reduces T count, Quantum Science and Technology 4
2018
Closest in time.
T. Häner, D. S. Steiger, K. Svore, and M. Troyer, A software methodology for compiling quantum programs, Quantum Science and Technology 3
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
J. C. Garcia-Escartin and P. Chamorro-Posada, Swap test and Hong-Ou-Mandel effect are equivalent, Physical Review A 87
2013
Cited alongside, same era.
2014
Cited alongside, same era.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor, Nature Communications 5
2014
Cited alongside, same era.
V. Kliuchnikov, A. Bocharov, and K. M. Svore, Asymptotically optimal topological quantum compiling, Physical Review Letters 112
2014
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
F. T. Chong, D. Franklin, and M. Martonosi, Programming languages and compiler design for realistic quantum hardware, Nature 549
2017
Cited alongside, same era.
2018
Closest in time.
A. Oddi and R. Rasconi, in International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Springer, 2018) pp. 446–461
2018
Closest in time.
K. Mitarai, M. Negoro, M. Kitagawa, and K. Fujii, Quantum circuit learning, Physical Review A 98
2018
Closest in time.
2018
Closest in time.
J. Romero, J. P. Olson, and A. Aspuru-Guzik, Quantum autoencoders for short depth quantum circuit synthesis, GitHub article (2018)
2018
Closest in time.
B. Dive, A. Pitchford, F. Mintert, and D. Burgarth, In situ upgrade of quantum simulators to universal computers, Quantum 2
2018
Closest in time.
K. Fujii, H. Kobayashi, T. Morimae, H. Nishimura, S. Tamate, and S. Tani, Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error, Physical Review Letters 120
2018
Closest in time.
Y. Zhiyenbayev, V. M. Akulin, and A. Mandilara, Quantum compiling with diffusive sets of gates, Physical Review A 98
2018
Closest in time.
2018
Closest in time.
Rigetti 8Q-Agave specification v.2.0.0.dev0, (2018)
2018
Closest in time.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, Barren plateaus in quantum neural network training landscapes, Nature Communications 9
2018
Closest in time.
2018
Closest in time.
A. Kandala, K. Temme, A. D. Corcoles, A. Mezzacapo, J. M. Chow, and J. M. Gambetta, Extending the computational reach of a noisy superconducting quantum processor, Nature 567
2018
Closest in time.
A. G. R. Day, M. Bukov, P. Weinberg, P. Mehta, and D. Sels, Glassy phase of optimal quantum control, Physical Review Letters 122
2019
Closest in time.