Fetching the paper…
Reading the bibliography…
We propose an efficient heuristic for mapping the logical qubits of quantum algorithms to the physical qubits of connectivity-limited devices, adding a minimal number of connectivity-compliant SWAP gates.
P. Murali, J. M. Baker, A. J. Abhari, F. T. Chong, and M. Martonosi · 1901
Earlier work this paper cites.
Circuit transformations for quantum architectures, 2019, arXiv:1902.09102
A. M. Childs, E. Schoute, and C. M. Unsal · 1902
Earlier work this paper cites.
On the qubit routing problem, 2019, arXiv:1902.08091
A. Cowtan, S. Dilkes, R. Duncan, A. Krajenbrink, W. Simmons, and S. Sivarajah · 1902
Earlier work this paper cites.
Optimal linear labelings and eigenvalues of graphs
M. Juvan and B. Mohar · 1992
Earlier work this paper cites.
Quantum mechanics helps in searching for a needle in a haystack
L. K. Grover · 1997
Earlier work this paper cites.
Approximation heuristics and benchmarkings for the minla problem
J. P. i Silvestre and J. G. Salgado · 1998
Earlier work this paper cites.
The complexity of the matrix eigenproblem
V. Y. Pan and Z. Q. Chen · 1999
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P. W. Shor · 1999
Earlier work this paper cites.
On spectral graph drawing
Y. Koren · 2003
Earlier work this paper cites.
Experiments on the minimum linear arrangement problem
J. Petit · 2003
Cited alongside, same era.
Translation techniques between quantum circuit architectures
D. Cheung, D. Maslov, and S. Severini · 2007
Cited alongside, same era.
Quantum circuit placement
D. Maslov, S. M. Falconer, and M. Mosca · 2008
Cited alongside, same era.
RevLib: An online resource for reversible functions and reversible circuits
R. Wille, D. Große, L. Teuber, G. W. Dueck, and R. Drechsler · 2008
Cited alongside, same era.
A. Chakrabarti, S. Sur-Kolay, and A. Chaudhury · 2011
Cited alongside, same era.
Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures
Approximation and hardness for token swapping, 2016, arXiv:1602.05150
T. Miltzow, L. Narins, Y. Okamoto, G. Rote, A. Thomas, and T. Uno · 2016
Later among the works it cites.
Layout optimization for quantum circuits with linear nearest neighbor architectures
M. Pedram and A. Shafaei · 2016
Later among the works it cites.
Quantum information and computation for chemistry, 2017, arXiv:1706.05413
J. Olson, Y. Cao, J. Romero, P. Johnson, P.-L. Dallaire-Demers, N. Sawaya, P. Narang, I. Kivlichan, M. Wasielewski, and A. Aspuru-Guzik · 2017
Later among the works it cites.
Qubit allocation for noisy intermediate-scale quantum computers, 2018, arXiv:1810.08291
W. Finigan, M. Cubeddu, T. Lively, J. Flick, and P. Narang · 2018
Later among the works it cites.
Automated optimization of large quantum circuits with continuous parameters
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Shafaei, M. Saeedi, and M. Pedram · 2013
Cited alongside, same era.
A quantum approximate optimization algorithm, 2014, arXiv:1411.4028
E. Farhi, J. Goldstone, and S. Gutmann · 2014
Cited alongside, same era.
Optimal swap gate insertion for nearest neighbor quantum circuits
R. Wille, A. Lye, and R. Drechsler · 2014
Cited alongside, same era.
Y. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov · 2018
Later among the works it cites.
Qubit allocation
M. Y. Siraichi, V. F. d. Santos, S. Collange, and F. M. Q. Pereira · 2018
Later among the works it cites.
An efficient methodology for mapping quantum circuits to the IBM QX architectures
A. Zulehner, A. Paler, and R. Wille · 2018
Later among the works it cites.
Tackling the qubit mapping problem for NISQ-era quantum devices
G. Li, Y. Ding, and Y. Xie · 2019
Closest in time.