Fetching the paper…
Reading the bibliography…
We show that the depth of quantum circuits in the realistic architecture where a classical controller determines which local interactions to apply on the kD grid Z^k where k >= 2 is the same (up to a constant factor) as in the standard model where arbitrary interactions are allowed.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters · 1993
Earlier work this paper cites.
Algorithms for quantum computation: Discrete logarithms and factoring
P. W. Shor · 1994
Earlier work this paper cites.
Limitations of Noisy Reversible Computation
D. Aharonov, M. Ben-Or, R. Impagliazzo, and N. Nisan · 1996
Earlier work this paper cites.
Quantum Circuits: Fanout, Parity, and Counting
C. Moore · 1999
Earlier work this paper cites.
A one-way quantum computer
R. Raussendorf and H. J. Briegel · 2001
Earlier work this paper cites.
The one-way quantum computer–a non-network model of quantum computation
R. Raussendorf, D. E. Browne, and H. J. Briegel · 2002
Earlier work this paper cites.
Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
B. M. Terhal and D. P. DiVincenzo · 2002
Cited alongside, same era.
Implementation of Shor’s Algorithm on a Linear Nearest Neighbour Qubit Array
A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg · 2004
Cited alongside, same era.
Quantum fan-out is powerful
P. Høyer and R. Špalek · 2005
Cited alongside, same era.
Fast quantum modular exponentiation
R. Van Meter and K. M. Itoh · 2005
Cited alongside, same era.
Shor’s algorithm on a nearest-neighbor machine
S. A. Kutin · 2006
Cited alongside, same era.
Translation techniques between quantum circuit architectures
D. Cheung, D. Maslov, and S. Severini · 2007
Cited alongside, same era.
Linear depth stabilizer and quantum Fourier transformation circuits with no auxiliary qubits in finite-neighbor quantum architectures
D. Maslov · 2007
Later among the works it cites.
Computational depth complexity of measurement-based quantum computation
D. E. Browne, E. Kashefi, and S. Perdrix · 2010
Later among the works it cites.
An Θ ( n ) \Theta(\sqrt{n}) -depth quantum adder on a 2D NTC quantum computer architecture
B.-S. Choi and R. Van Meter · 2010
Later among the works it cites.
On the effect of quantum interaction distance on quantum addition circuits
B.-S. Choi and R. Van Meter · 2011
Later among the works it cites.
Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions
Y. Takahashi and S. Tani · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A 2D Nearest-Neighbor Quantum Architecture for Factoring
P. Pham and K. M. Svore · 2012
Closest in time.