Fetching the paper…
Reading the bibliography…
This paper addresses the problem of qubit routing in first-generation and other near-term quantum computers.
R. Bellman, Dynamic Programming , 1st ed. Princeton, NJ, USA: Princeton University Press, 1957
1957
Earlier work this paper cites.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science , vol. 220, no. 4598, pp. 671–680, 1983. [Online]. Available: http://science.sciencemag.org/content/220/4598/671
1983
Earlier work this paper cites.
D. Deutsch, “Quantum theory, the church–turing principle and the universal quantum computer,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 400, no. 1818, pp. 97–117, 1985. [Online]. Available: http://rspa.royalsocietypublishing.org/content/400/1818/97
1985
Earlier work this paper cites.
D. Deutsch, “Quantum computational networks,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 425, no. 1868, pp. 73–90, 1989. [Online]. Available: http://rspa.royalsocietypublishing.org/content/425/1868/73
1989
Earlier work this paper cites.
C. J. C. H. Watkins and P. Dayan, “Q-learning,” Machine Learning , vol. 8, no. 3, pp. 279–292, May 1992. [Online]. Available: https://doi.org/10.1007/BF00992698
1992
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Phys. Rev. A , vol. 52, pp. 3457–3467, Nov 1995. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.52.3457
1995
Earlier work this paper cites.
R. Spanagel and F. Weiss, “Spanagel r, weiss f. the dopamine hypothesis of reward: past and current status (review) (67 refs). trends neurosci 22: 521-527,” Trends in neurosciences , vol. 22, pp. 521–7, 12 1999
1999
Earlier work this paper cites.
M. H. Freedman, A. Kitaev, M. J. Larsen, and Z. Wang, “Topological Quantum Computation,” ArXiv e-prints , pp. quant–ph/0 101 025, Jan. 2001
2001
Earlier work this paper cites.
M. H. Devoret, A. Wallraff, and J. M. Martinis, “Superconducting Qubits: A Short Review,” eprint arXiv:cond-mat/0411174 , Nov. 2004
2004
Earlier work this paper cites.
D. Cheung, D. Maslov, and S. Severini, “Translation techniques between quantum circuit architectures,” 2007
2007
Earlier work this paper cites.
M. Steffen, D. P. DiVincenzo, J. M. Chow, T. N. Theis, and M. B. Ketchen, “Quantum computing: An IBM perspective,” IBM Journal of Research and Development , vol. 55, no. 5, pp. 13:1–13:11, Sept 2011
2011
Earlier work this paper cites.
J. Kober and J. Peters, Reinforcement Learning in Robotics: A Survey . Berlin, Germany: Springer, 2012, vol. 12, pp. 579–610
2012
Earlier work this paper cites.
R. Beals, S. Brierley, O. Gray, A. W. Harrow, S. Kutin, N. Linden, D. Shepherd, and M. Stather, “Efficient distributed quantum computing,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 469, no. 2153, 2013. [Online]. Available: http://rspa.royalsocietypublishing.org/content/469/2153/20120686
2013
Cited alongside, same era.
V. Mnih, K. Kavukcuoglu, D. Silver, A. Graves, I. Antonoglou, D. Wierstra, and M. Riedmiller, “Playing Atari with Deep Reinforcement Learning,” ArXiv e-prints , Dec. 2013
2013
Cited alongside, same era.
N. H. Nickerson, J. F. Fitzsimons, and S. C. Benjamin, “Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links,” Phys. Rev. X , vol. 4, p. 041041, Dec 2014. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevX.4.041041
2014
Cited alongside, same era.
S. Brierley, “Efficient implementation of Quantum circuits with limited qubit interactions,” ArXiv e-prints , Jul. 2015
J. He, M. Ostendorf, X. He, J. Chen, J. Gao, L. Li, and L. Deng, “Deep reinforcement learning with a combinatorial action space for predicting popular reddit threads,” in Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing . Association for Computational Linguistics, 2016, pp. 1838–1848. [Online]. Available: http://www.aclweb.org/anthology/D16-1189
2016
Later among the works it cites.
L. S. Bishop, S. Bravyi, A. Cross, J. M. Gambetta, , and J. Smolin, “Quantum volume,” 2017. [Online]. Available: https://dal.objectstorage.open.softlayer.com/v1/AUTH_039c3bf6e6e54d76b8e66152e2f87877/community-documents/quatnum-volumehp08co1vbo0cc8fr.pdf
2017
Later among the works it cites.
Z. Zhou, X. Li, and R. N. Zare, “Optimizing chemical reactions with deep reinforcement learning,” ACS Central Science , vol. 3, no. 12, pp. 1337–1344, 2017. [Online]. Available: https://doi.org/10.1021/acscentsci.7b00492
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
T. P. Lillicrap, J. J. Hunt, A. Pritzel, N. Heess, T. Erez, Y. Tassa, D. Silver, and D. Wierstra, “Continuous control with deep reinforcement learning,” ArXiv e-prints , Sep. 2015
2015
Cited alongside, same era.
M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin, S. Ghemawat, I. Goodfellow, A. Harp, G. Irving, M. Isard, Y. Jia, R. Jozefowicz, L. Kaiser, M. Kudlur, J. Levenberg, D. Mané, R. Monga, S. Moore, D. Murray, C. Olah, M. Schuster, J. Shlens, B. Steiner, I. Sutskever, K. Talwar, P. Tucker, V. Vanhoucke, V. Vasudevan, F. Viégas, O. Vinyals, P. Warden, M. Wattenberg, M. Wicke, Y. Yu, and X. Zheng, “TensorFlow: Large-scale machine learning on heterogeneous systems,” 2015, software available from tensorflow.org. [Online]. Available: https://www.tensorflow.org/
2015
Cited alongside, same era.
F. Chollet et al. , “Keras,” https://keras.io, 2015
2015
Cited alongside, same era.
H. van Hasselt, A. Guez, and D. Silver, “Deep Reinforcement Learning with Double Q-learning,” ArXiv e-prints , Sep. 2015
2015
Cited alongside, same era.
R. Nigmatullin, C. J. Ballance, N. de Beaudrap, and S. C. Benjamin, “Minimally complex ion traps as modules for quantum communication and computing,” New Journal of Physics , vol. 18, no. 10, p. 103028, 2016. [Online]. Available: http://stacks.iop.org/1367-2630/18/i=10/a=103028
2016
Cited alongside, same era.
D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. van den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot, S. Dieleman, D. Grewe, J. Nham, N. Kalchbrenner, I. Sutskever, T. Lillicrap, M. Leach, K. Kavukcuoglu, T. Graepel, and D. Hassabis, “Mastering the game of Go with deep neural networks and tree search,” Nature , vol. 529, no. 7587, pp. 484–489, Jan. 2016
2016
Cited alongside, same era.
H. Mao, M. Alizadeh, I. Menache, and S. Kandula, “Resource management with deep reinforcement learning,” in Proceedings of the 15th ACM Workshop on Hot Topics in Networks , ser. HotNets ’16. New York, NY, USA: ACM, 2016, pp. 50–56. [Online]. Available: http://doi.acm.org/10.1145/3005745.3005750
2016
Cited alongside, same era.
D. S. Steiger, T. Häner, and M. Troyer, “ProjectQ: An Open Source Software Framework for Quantum Computing,” ArXiv e-prints , Dec. 2016
2016
Cited alongside, same era.
2017
Later among the works it cites.
R. Shu, “Amortized optimisation.” [Online]. Available: http://ruishu.io/2017/11/07/amortized-optimization/
2017
Later among the works it cites.
“A preview of Bristlecone, Google’s new quantum processor.” [Online]. Available: https://research.googleblog.com/2018/03/a-preview-of-bristlecone-googles-new.html
2018
Closest in time.
J. Preskill, “Quantum Computing in the NISQ era and beyond,” ArXiv e-prints , Jan. 2018
2018
Closest in time.
S. Herbert, “On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity,” ArXiv e-prints , May 2018
2018
Closest in time.
D. Venturelli, M. Do, E. Rieffel, and J. Frank, “Compiling quantum circuits to realistic hardware architectures using temporal planners,” Quantum Science and Technology , vol. 3, no. 2, p. 025004, feb 2018. [Online]. Available: https://doi.org/10.1088%2F2058-9565%2Faaa331
2018
Closest in time.
2018
Closest in time.
——, “Advantages of a modular high-level quantum programming framework,” ArXiv e-prints , Jun. 2018
2018
Closest in time.