Fetching the paper…
Reading the bibliography…
We study several problems related to properties of non-negative matrices that arise at the boundary between quantum and classical probabilistic computation.
J. Hetherington, “Observations on the statistical iteration of matrices”
1984
Earlier work this paper cites.
L. Babai. “Trading group theory for randomness”
1985
Earlier work this paper cites.
L. Valiant and V. Vazirani, “NP is as easy as detecting unique solutions”
1985
Earlier work this paper cites.
N. Trivedi and D. Ceperley, “Green-function Monte-Carlo study of quantum antiferromagnets”
1989
Earlier work this paper cites.
“On completeness and soundness in Interactive Proof Systems”
M. Furer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos, · 1989
Earlier work this paper cites.
M. Buonaura and S. Sorella, “Numerical study of the two-dimensional Heisenberg model using a Green’s function Monte-Carlo technique with a fixed number of walkers”
1998
Earlier work this paper cites.
A. Kitaev, A. Shen, and M. Vyalyi, “Classical and Quantum Computation”
2002
Earlier work this paper cites.
A.M. Childs, E. Farhi, J. Goldstone and S. Gutmann, “Finding cliques by quantum adiabatic evolution”
2002
Cited alongside, same era.
“Error-bounded probabilistic computations between MA and AM”
E. Böhler, C. Glaßer, and D. Meister, · 2003
Cited alongside, same era.
D. Aharonov and A. Ta-Shma, “Adiabatic Quantum State Generation and Statistical Zero Knowledge”
2003
Cited alongside, same era.
S. Aaronson, “Quantum Computing, Postselection, and Probabilistic Polynomial-Time”
2005
Cited alongside, same era.
J. Kempe, A. Kitaev, and O. Regev, “The Complexity of the Local Hamiltonian Problem”
2006
Cited alongside, same era.
F. Verstraete, M. Wolf, D. Perez-Garcia, and J.I. Cirac, “Criticality, the area law, and the computational power of PEPS”
D. Aharonov, W. van Dam, Z. Landau, S. Lloyd, J. Kempe, and O. Regev, “Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation”
2007
Later among the works it cites.
The power of quantum systems on a line,
D. Aharonov, D. Gottesman, S. Irani, and J. Kempe, · 2007
Later among the works it cites.
D. Nagaj and S. Mozes, “A new construction for a QMA-complete 3-local Hamiltonian”
2007
Later among the works it cites.
R.D. Somma, C.D. Batista, and G. Ortiz, “A Quantum Approach to Classical Statistical Mechanics”
2007
Later among the works it cites.
R. Santhanam, “Circuit lower bounds for Merlin-Arthur classes”
2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
I. Dinur, “The PCP Theorem by gap amplification”
2006
Cited alongside, same era.
R. Oliveira and B.M. Terhal, “The complexity of quantum spin systems on a two-dimensional square lattice”
Cited in the paper.
S. Bravyi, “Efficient algorithm for a quantum analogue of 2-SAT”
Cited in the paper.
S. Bravyi, A.J. Bessen, and B.M. Terhal, “Merlin-Arthur Games and Stoquastic Complexity”
Cited in the paper.
Yi-Kai Liu, “The Local Consistency Problem for Stoquastic and 1-D Quantum Systems”
Cited in the paper.
P. Deift, M. Ruskai, W. Spitzer, “Improved Gap Estimates for Simulating Quantum Circuits by Adiabatic Evolution”
Cited in the paper.
2008
Closest in time.