Fetching the paper…
Reading the bibliography…
In some physical implementations of quantum computers, 2-qubit operations can be applied only on certain pairs of qubits.
“Routing permutations on graphs via matchings”
Noga Alon, F. R. K. Chung, and R. L. Graham · 1994
Earlier work this paper cites.
“Routing on trees via matchings”
Alan Roberts, Antonis Symvonis, and Louxin Zhang · 1995
Earlier work this paper cites.
“A fast quantum mechanical algorithm for database search”
Lov K Grover · 1996
Earlier work this paper cites.
“Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer”
Peter W Shor · 1999
Earlier work this paper cites.
“Optimal bounds for matching routing on trees”
Louxin Zhang · 1999
Earlier work this paper cites.
“Addition spectrum of a lateral dot from coulomb and spin-blockade spectroscopy”
M Ciorga, AS Sachrajda, Pawel Hawrylak, C Gould, Piotr Zawadzki, S Jullian, Y Feng, and Zbigniew Wasilewski · 2000
Earlier work this paper cites.
“Few-electron quantum dot circuit with integrated charge read out”
JM Elzerman, R Hanson, JS Greidanus, LH Willems Van Beveren, S De Franceschi, LMK Vandersypen, S Tarucha, and LP Kouwenhoven · 2003
Earlier work this paper cites.
“Manipulation of a single charge in a double quantum dot”
JR Petta, AC Johnson, CM Marcus, MP Hanson, and AC Gossard · 2004
Earlier work this paper cites.
“A geometric approach to quantum circuit lower bounds”
MA Nielsen · 2006
Earlier work this paper cites.
“Quantum computation as geometry”
M.A. Nielsen, M.R. Dowling, M. Gu, and A.C. Doherty · 2006
Earlier work this paper cites.
“Electrostatically defined serial triple quantum dot charged with few electrons”
D Schröer, AD Greentree, L Gaudreau, K Eberl, LCL Hollenberg, JP Kotthaus, and S Ludwig · 2007
Earlier work this paper cites.
“Quantum coherence and entanglement with ultracold atoms in optical lattices”
Immanuel Bloch · 2008
Earlier work this paper cites.
“Quantum circuit placement”
Dmitri Maslov, Sean M. Falconer, and Michele Mosca · 2008
Earlier work this paper cites.
“Computational complexity: a modern approach”
Sanjeev Arora and Boaz Barak · 2009
Earlier work this paper cites.
“Routing numbers of cycles, complete bipartite graphs, and hypercubes”
Wei-Tian Li, Linyuan Lu, and Yiting Yang · 2010
Cited alongside, same era.
“Natural and artificial atoms for quantum computation”
Iulia Buluta, Sahel Ashhab, and Franco Nori · 2011
Cited alongside, same era.
“Quantum-state preparation with universal gate decompositions”
Martin Plesch and Caslav Brukner · 2011
Cited alongside, same era.
“Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures”
Alireza Shafaei, Mehdi Saeedi, and Massoud Pedram · 2013
Cited alongside, same era.
“Qubit placement to minimize communication overhead in 2d quantum architectures”
Alireza Shafaei, Mehdi Saeedi, and Massoud Pedram · 2014
Cited alongside, same era.
“Paqcs: Physical design-aware fault-tolerant quantum circuit synthesis”
Chia-Chun Lin, Susmita Sur-Kolay, and Niraj K. Jha · 2015
“Quantum computing in the NISQ era and beyond”
John Preskill · 2018
Later among the works it cites.
“Propagation and localization of collective excitations on a 24-qubit superconducting processor”
Yangsen Ye, Zi-Yong Ge, Yulin Wu, Shiyu Wang, Ming Gong, Yu-Ran Zhang, et al · 2019
Later among the works it cites.
“Quantum supremacy using a programmable superconducting processor”
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, et al · 2019
Later among the works it cites.
“Circuit transformations for quantum architectures”
Andrew M Childs, Eddie Schoute, and Cem M Unsal · 2019
Later among the works it cites.
“Tackling the qubit mapping problem for nisq-era quantum devices”
Gushu Li, Yufei Ding, and Yuan Xie · 2019
Later among the works it cites.
“Sorting networks on restricted topologies”
Indranil Banerjee, Dana Richards, and Igor Shinkar · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Fast qubit placement in 2d architecture using nearest neighbor realization”
Ritu Ranjan Shrivastwa, Kamalika Datta, and Indranil Sengupta · 2015
Cited alongside, same era.
“State preservation by repetitive error detection in a superconducting quantum circuit”
Julian Kelly, Rami Barends, Austin G Fowler, Anthony Megrant, Evan Jeffrey, Theodore C White, et al · 2015
Cited alongside, same era.
“Scalable gate architecture for a one-dimensional array of semiconductor spin qubits”
DM Zajac, TM Hazard, Xiao Mi, E Nielsen, and Jason R Petta · 2016
Cited alongside, same era.
“A heuristic for linear nearest neighbor realization of quantum circuits by swap gate insertion using n n -gate lookahead”
Abhoy Kole, Kamalika Datta, and Indranil Sengupta · 2016
Cited alongside, same era.
“Probing many-body dynamics on a 51-atom quantum simulator”
Hannes Bernien, Sylvain Schwartz, Alexander Keesling, Harry Levine, Ahmed Omran, Hannes Pichler, et al · 2017
Cited alongside, same era.
“New results on routing via matchings on graphs”
Indranil Banerjee and Dana Richards · 2017
Cited alongside, same era.
Later among the works it cites.
“A book of abstract algebra: second edition”
Charles C Pinter · 2019
Later among the works it cites.
“Variational quantum algorithms”
Marco Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C Benjamin, Suguru Endo, Keisuke Fujii, et al · 2021
Later among the works it cites.
“Quantum walks on a programmable two-dimensional 62-qubit superconducting processor”
Ming Gong, Shiyu Wang, Chen Zha, Ming-Cheng Chen, He-Liang Huang, Yulin Wu, et al · 2021
Later among the works it cites.
“Quantum approximate optimization of non-planar graph problems on a planar superconducting processor”
Matthew P Harrigan, Kevin J Sung, Matthew Neeley, et al · 2021
Later among the works it cites.
“Routing permutations on spectral expanders via matchings”
Rajko Nenadov · 2023
Later among the works it cites.
“Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis”
Xiaoming Sun, Guojing Tian, Shuai Yang, Pei Yuan, and Shengyu Zhang · 2023
Later among the works it cites.
“Does qubit connectivity impact quantum circuit complexity?”
Pei Yuan, Jonathan Allcock, and Shengyu Zhang · 2024
Closest in time.