Fetching the paper…
Reading the bibliography…
The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not.
The complexity of theorem proving procedures
S. Cook · 1971
Earlier work this paper cites.
Universal search problems
L. Levin · 1973
Earlier work this paper cites.
Probabilistic algorithms for sparse polynomials
R. Zippel · 1979
Earlier work this paper cites.
Equivalence of free boolean graphs can be decided probabilistically in polynomial time
M. Blum, A. K. Chandra, and M. N. Wegman · 1980
Earlier work this paper cites.
Fast probabilistic algorithms for verification of polynomial identities
J. T. Schwartz · 1980
Earlier work this paper cites.
Quantum circuit complexity
A. C.-C. Yao · 1993
Earlier work this paper cites.
Quantum computations: algorithms and error correction
A. Y. Kitaev · 1997
Earlier work this paper cites.
Quantum circuits with mixed states
D. Aharonov, A. Kitaev, and N. Nisan · 1998
Earlier work this paper cites.
Quantum information and precision measurement
A. M. Childs, J. Preskill, and J. Renes · 2000
Earlier work this paper cites.
Fast parallel circuits for the quantum fourier transform
R. Cleve and J. Watrous · 2000
Earlier work this paper cites.
Quantum NP - A Survey, 2002
D. Aharonov and T. Naveh · 2002
Earlier work this paper cites.
Efficient discrete approximations of quantum gates
A. Harrow, B. Recht, and I. L. Chuang · 2002
Cited alongside, same era.
Classical and Quantum Computation
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
Parallel quantum computation and quantum codes
C. Moore and M. Nilsson · 2002
Cited alongside, same era.
3-Local Hamiltonian is QMA-Complete
J. Kempe and O. Regev · 2003
Cited alongside, same era.
The Complexity of the Local Hamiltonian Problem
J. Kempe, A. Kitaev, and O. Regev · 2004
Cited alongside, same era.
Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games
B. M. Terhal and D. P. DiVincenzo · 2004
Cited alongside, same era.
Consistency of Local Density Matrices is QMA-complete
Y.-K. Liu · 2006
Later among the works it cites.
Entanglement is not necessary for perfect discrimination between unitary operations
R. Duan, Y. Feng, and M. Ying · 2007
Later among the works it cites.
N-representability is QMA-complete
Y.-K. Liu, M. Christandl, and F. Verstraete · 2007
Later among the works it cites.
The complexity of quantum spin systems on a two-dimensional square lattice
R. Oliveira and B. M. Terhal · 2008
Later among the works it cites.
Distinguishing short quantum computations
B. Rosgen · 2008
Later among the works it cites.
Lecture Notes of CS798: Theory of Quantum Information, 2008
J. Watrous · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. M. Dawson and M. A. Nielsen · 2005
Cited alongside, same era.
Bounds on the power of constant-depth quantum circuits
S. Fenner, F. Green, S. Homer, and Y. Zhang · 2005
Cited alongside, same era.
Non-Identity Check is QMA-Complete
D. Janzing, P. Wocjan, and T. Beth · 2005
Cited alongside, same era.
On the hardness of distinguishing mixed-state quantum computations
B. Rosgen and J. Watrous · 2005
Cited alongside, same era.
D. Aharonov, D. Gottesman, S. Irani, and J. Kempe · 2009
Closest in time.
Parallelizing quantum circuits
A. Broadbent and E. Kashefi · 2009
Closest in time.
Interacting boson problems are QMA-hard, 2009
T.-C. Wei, M. Mosca, and A. Nayak · 2009
Closest in time.
On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels
S. Beigi and P. W. Shor · 2090
Closest in time.