Fetching the paper…
Reading the bibliography…
We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic quantum computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing's tket compiler.
The complexity of finding minimum-length generator sequences
Mark R. Jerrum · 1985
Earlier work this paper cites.
Hamilton cycles and paths in butterfly graphs
Stephen A Wong · 1995
Earlier work this paper cites.
Cycles in butterfly graphs
Shien-Ching Hwang and Gen-Huey Chen · 2000
Earlier work this paper cites.
An efficient conversion of quantum circuits to a linear nearest neighbor architecture
Yuichi Hirata, Masaki Nakanishi, Shigeru Yamashita, and Yasuhiko Nakashima · 2011
Earlier work this paper cites.
Efficient distributed quantum computing
Robert Beals, Stephen Brierley, Oliver Gray, Aram W. Harrow, Samuel Kutin, Noah Linden, Dan Shepherd, and Mark Stather · 2013
Earlier work this paper cites.
Swapping labeled tokens on graphs
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno · 2014
Earlier work this paper cites.
Efficient implementation of quantum circuits with limited qubit interactions
Stephen Brierley · 2015
Cited alongside, same era.
A practical quantum instruction set architecture
Robert S. Smith, Michael J. Curtis, and William Zeng · 2016
Cited alongside, same era.
Unsupervised machine learning on a hybrid quantum computer
J. S. Otterbach, R. Manenti, N. Alidoust, A. Bestwick, M. Block, B. Bloom, S. Caldwell, N. Didier, E. Schuyler Fried, S. Hong, P. Karalekas, C. B. Osborn, A. Papageorge, E. C. Peterson, G. Prawiroatmodjo, N. Rubin, Colm A. Ryan, D. Scarabelli, M. Scheer, E. A. Sete, P. Sivarajah, Robert S. Smith, A. Staley, N. Tezak, W. J. Zeng, A. Hudson, Blake R. Johnson, M. Reagor, M. P. da Silva, and C. Rigetti · 2017
Cited alongside, same era.
An efficient methodology for mapping quantum circuits to the ibm qx architectures
Alwin Zulehner, Alexandru Paler, and Robert Wille · 2017
Cited alongside, same era.
Using reinforcement learning to find efficient qubit routing policies for deployment in near-term quantum computers
Steven Herbert and Akash Sengupta · 2018
Later among the works it cites.
Fluctuations of energy-relaxation times in superconducting qubits
P. V. Klimov, J. Kelly, Z. Chen, M. Neeley, A. Megrant, B. Burkett, R. Barends, K. Arya, B. Chiaro, Yu Chen, A. Dunsworth, A. Fowler, B. Foxen, C. Gidney, M. Giustina, R. Graff, T. Huang, E. Jeffrey, Erik Lucero, J. Y. Mutus, O. Naaman, C. Neill, C. Quintana, P. Roushan, Daniel Sank, A. Vainsencher, J. Wenner, T. C. White, S. Boixo, R. Babbush, V. N. Smelyanskiy, H. Neven, and John M. Martinis · 2018
Later among the works it cites.
Quantum Computing in the NISQ era and beyond
John Preskill · 2018
Later among the works it cites.
Qubit allocation
Marcos Yukio Siraichi, Vinícius Fernandes dos Santos, Sylvain Collange, and Fernando Magno Quintão Pereira · 2018
Later among the works it cites.
A case for variability-aware policies for nisq-era quantum computers
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Complexity of token swapping and its variants
Édouard Bonnet, Tillmann Miltzow, and Paweł Rzążewski · 2018
Cited alongside, same era.
Steven Herbert · 2018
Cited alongside, same era.
https://www.research.ibm.com/ibm-q/
IBM Q
Cited in the paper.
Project Q: Powerful open source software for quantum computing
Damian Steiger and Thomas Häner
Cited in the paper.
Swamit S. Tannu and Moinuddin K.Qureshi · 2018
Later among the works it cites.
Compiling su(4) quantum circuits to ibm qx architectures
Alwin Zulehner and Robert Wille · 2018
Later among the works it cites.