A Depth-Aware Swap Insertion Scheme for the Qubit Mapping Problem

P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proceedings 35th annual symposium on foundations of computer science . Ieee, 1994, pp. 124–134

1994

Earlier work this paper cites.

L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing , ser. STOC ’96. New York, NY, USA: ACM, 1996, pp. 212–219. [Online]. Available: http://doi.acm.org/10.1145/237814.237866

1996

Earlier work this paper cites.

M. A. Nielsen and I. Chuang, “Quantum computation and quantum information,” 2002

2002

Earlier work this paper cites.

R. Wille, D. Große, L. Teuber, G. W. Dueck, and R. Drechsler, “Revlib: An online resource for reversible functions and reversible circuits,” in 38th International Symposium on Multiple Valued Logic (ismvl 2008) . IEEE, 2008, pp. 220–225

2008

Earlier work this paper cites.

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,” in Nature Communications , vol. 5, no. 1, 2014, p. 4213. [Online]. Available: https://doi.org/10.1038/ncomms5213

2014

Earlier work this paper cites.

A. JavadiAbhari, S. Patil, D. Kudrow, J. Heckey, A. Lvov, F. T. Chong, and M. Martonosi, “Scaffcc: a framework for compilation and analysis of quantum computing programs,” in Proceedings of the 11th ACM Conference on Computing Frontiers . ACM, 2014, p. 1

2014

Earlier work this paper cites.

W. Knight, “IBM Raises the Bar with a 50-Qubit Quantum Computer,” https://www.technologyreview.com/s/609451/ibm-raises-the-bar-with-a-50-qubit-quantum-computer, 2017

2017

Earlier work this paper cites.

A. Zulehner, S. Gasser, and R. Wille, “Exact global reordering for nearest neighbor quantum circuits using A ∗ * ,” in International Conference on Reversible Computation . Springer, 2017, pp. 185–201

2017

Cited alongside, same era.

A. W. Cross, L. S. Bishop, J. A. Smolin, and J. M. Gambetta, “Open quantum assembly language,” arXiv preprint arXiv:1707.03429 , 2017

Original

2017

Cited alongside, same era.

J. Preskill, “Quantum computing in the nisq era and beyond,” Quantum , vol. 2, p. 79, 2018

2018

Cited alongside, same era.

J. Kelly, “A Preview of Bristlecone, Google’s New Quantum Processor,” https://ai.googleblog.com/2018/03/a-preview-of-bristlecone-googles-new.html, 2018

2018

Cited alongside, same era.

J. Hsu, “Intel’s 49-Qubit Chip Shoots for Quantum Supremacy,” https://spectrum.ieee.org/tech-talk/computing/hardware/intels-49qubit-chip-aims-for-quantum-supremacy, 2018

M. Y. Siraichi, V. F. d. Santos, S. Collange, and F. M. Q. Pereira, “Qubit allocation,” in Proceedings of the 2018 International Symposium on Code Generation and Optimization . ACM, 2018, pp. 113–125

2018

Later among the works it cites.

A. W. Cross, L. S. Bishop, S. Sheldon, P. D. Nation, and J. M. Gambetta, “Validating quantum computers using randomized model circuits,” Physical Review A , vol. 100, no. 3, Sep 2019. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.100.032328

2019

Later among the works it cites.

G. Li, Y. Ding, and Y. Xie, “Tackling the qubit mapping problem for nisq-era quantum devices,” in Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems . ACM, 2019, pp. 1001–1014

2019

Later among the works it cites.

R. Wille, L. Burgholzer, and A. Zulehner, “Mapping quantum circuits to ibm qx architectures using the minimal number of swap and h operations,” in Proceedings of the 56th Annual Design Automation Conference 2019 . ACM, 2019, p. 142