Fetching the paper…
Reading the bibliography…
In measurement-based quantum computation, quantum algorithms are implemented via sequences of measurements.
Foundations of quantum mechanics
J. M. Jauch · 1968
Earlier work this paper cites.
Quantum theory of open systems
E. Davies · 1976
Earlier work this paper cites.
The computer as a physical system: A microscopic quantum mechanical model of computers as represented by Turing machines
P. Benioff · 1980
Earlier work this paper cites.
Quantum mechanical computers
R. Feynman · 1985
Earlier work this paper cites.
Parallel quantum computation
N. Margolus · 1990
Earlier work this paper cites.
Two-qubit gates are universal for quantum computation
D. DiVincenzo · 1995
Earlier work this paper cites.
Eigenspaces of graphs
D. Cvetkovic · 1997
Earlier work this paper cites.
Quantum computing via measurements only
R. Raussendorf and H. Briegel · 2000
Earlier work this paper cites.
Generation of eigenstates using the phase-estimation algorithm
B. Travaglione and G. Milburn · 2001
Earlier work this paper cites.
Classical and Quantum Computation
A. Kitaev, A. Shen, and M. Vyalyi · 2002
Cited alongside, same era.
D. Aharonov and A. Ta-Shma. Adiabatic quantum state generation and statistical zero knowledge. In Proc. 35th Annual ACM Symp. on Theory of Computing
2003
Cited alongside, same era.
3-local Hamiltonian is QMA-complete
J. Kempe and O. Regev · 2003
Cited alongside, same era.
Quantum information processing in continuous time
A. Childs · 2004
Cited alongside, same era.
Unified derivations of measurement-based schemes for quantum computation
A. Childs, D. Leung, and M. Nielsen · 2004
Cited alongside, same era.
The complexity of the local Hamiltonian problem
J. Kempe, A. Kitaev, and O. Regev · 2004
Cited alongside, same era.
On promise problems
O. Goldreich · 2005
Later among the works it cites.
Ergodic quantum computing
D. Janzing and P. Wocjan · 2005
Later among the works it cites.
Computer Science Approach to Quantum Control
D. Janzing · 2006
Later among the works it cites.
A universally programmable quantum cellular automaton
D. Shepherd, T. Franz, and R. Werner · 2006
Later among the works it cites.
D. Aharonov, D. Gottesman, and J. Kempe, The power of quantum systems on a line, arXiv:quant-ph/0705.4077, 2007
2007
Closest in time.
Efficient quantum algorithms for simulating sparse Hamiltonians
D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders · 2007
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Wocjan, D. Janzing, Th. Decker, and Th. Beth · 2004
Cited alongside, same era.
Unified derivations of measurement-based schemes for quantum computation
A. M. Childs, D. W. Leung, and M. A. Nielsen · 2005
Cited alongside, same era.
BQP-complete problems concerning mixing properties of classical random walks on sparse graphs
D. Janzing and P. Wocjan
Cited in the paper.
A PromiseBQP-complete string rewriting problem
D. Janzing and P. Wocjan
Cited in the paper.
The complexity of quantum spin systems on a two-dimensional square lattice
R. Oliveira and B. Terhal
Cited in the paper.
Quantum simulators, continuous-time automata, and translationally invariant systems
K. Vollbrecht and I. Cirac
Cited in the paper.
Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer
D. Janzing · 2007
Closest in time.
A simple PromiseBQP matrix problem
D. Janzing and Wocjan P · 2007
Closest in time.