Fetching the paper…
Reading the bibliography…
Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation.
On computing the determinant in small parallel time using a small number of processors
Stuart J. Berkowitz · 1984
Earlier work this paper cites.
Parallel computation for well-endowed rings and space-bounded probabilistic machines
A Borodin, S Cook, and N Pippenger · 1984
Earlier work this paper cites.
A taxonomy of problems with fast parallel algorithms
Stephen A. Cook · 1985
Earlier work this paper cites.
Logarithmic depth circuits for algebraic functions
John H. Reif · 1986
Earlier work this paper cites.
Counting hierarchies: polynomial time and constant depth circuits
Eric W. Allender and Klaus W. Wagner · 1993
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh V. Vazirani · 1997
Earlier work this paper cites.
Space-bounded quantum complexity
John Watrous · 1999
Earlier work this paper cites.
Quantum Information and Computation
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Earlier work this paper cites.
Classical simulation of noninteracting-fermion quantum circuits
Barbara M. Terhal and David P. DiVincenzo · 2002
Earlier work this paper cites.
Quantum circuits that can be simulated classically in polynomial time
Leslie G. Valiant · 2002
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov and Amnon Ta-Shma · 2003
Earlier work this paper cites.
3-local Hamiltonian is QMA-complete
Julia Kempe and Oded Regev · 2003
Earlier work this paper cites.
Both Toffoli and controlled-NOT need little help to do universal quantum computing
Yaoyun Shi · 2003
Cited alongside, same era.
On the complexity of simulating space-bounded quantum computations
John Watrous · 2003
Cited alongside, same era.
Renormalization algorithms for quantum-many body systems in two and higher dimensions
F. Verstraete and J. I. Cirac · 2004
Cited alongside, same era.
Quantum computing, postselection, and probabilistic polynomial-time
Scott Aaronson · 2005
Cited alongside, same era.
Quantum computing and polynomial equations over the finite field Z2
Christopher M. Dawson, Andrew P. Hines, Duncan Mortimer, Henry L. Haselgrove, Michael A. Nielsen, and Tobias Osborne · 2005
Cited alongside, same era.
Quantum Arthur-Merlin games
Chris Marriott and John Watrous · 2005
Cited alongside, same era.
Matchgate and space-bounded quantum computations are equivalent
Richard Jozsa, Barbara Kraus, Akimasa Miyake, and John Watrous · 2010
Later among the works it cites.
Fast amplification of QMA
Daniel Nagaj, Pawel Wocjan, and Yong Zhang · 2011
Later among the works it cites.
Quantum interactive proofs with weak error bounds
Tsuyoshi Ito, Hirotada Kobayashi, and John Watrous · 2012
Later among the works it cites.
Time-space efficient simulations of quantum computations
Dieter van Melkebeek and Thomas Watson · 2012
Later among the works it cites.
Quantum 3-SAT is QMA1-complete
David Gosset and Daniel Nagaj · 2013
Later among the works it cites.
Inverting well conditioned matrices in quantum logspace
Amnon Ta-Shma · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Efficient algorithm for a quantum analogue of 2-sat
Sergey Bravyi · 2006
Cited alongside, same era.
Computational complexity of projected entangled pair states
Norbert Schuch, Michael M. Wolf, Frank Verstraete, and J. Ignacio Cirac · 2007
Cited alongside, same era.
Matchgates and classical simulation of quantum circuits
Richard Jozsa and Akimasa Miyake · 2008
Cited alongside, same era.
Computational Complexity: A Modern Approach
Sanjeev Arora and Boaz Barak · 2009
Cited alongside, same era.
Quantum algorithm for linear systems of equations
Aram W Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Cited alongside, same era.
Quantum computational complexity
John Watrous · 2009
Cited alongside, same era.
Exponential improvement in precision for simulating sparse Hamiltonians
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma · 2014
Later among the works it cites.
Simulating Hamiltonian dynamics with a truncated Taylor series
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma · 2015
Later among the works it cites.
Hamiltonian simulation with nearly optimal dependence on all parameters
Dominic W. Berry, Andrew M. Childs, and Robin Kothari · 2015
Later among the works it cites.
On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace
Dean Doron and Amnon Ta-Shma · 2015
Later among the works it cites.
On approximating the eigenvalues of stochastic matrices in probabilistic logspace
Dean Doron, Amir Sarid, and Amnon Ta-Shma · 2016
Closest in time.
Space-efficient error reduction for unitary quantum computations
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, and Harumichi Nishimura · 2016
Closest in time.
Solving Laplacian systems in logarithmic space
François Le Gall · 2016
Closest in time.