Quantum computing and quadratically signed weight enumerators
References (19)
Algorithms for quantum computation: Discrete logarithms and factoring
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
SIAM J. Comput.
(1997)Fault-tolerant quantum computation
Quantum computations: algorithms and error correction
Uspekhi Mat. Nauk
(1997)- et al.
Resilient quantum computation
Science
(1998) - et al.
Fault-tolerant quantum computation with constant error
- et al.
Fault-tolerant quantum computation with constant error
- et al.
Quantum complexity theory
SIAM J. Comput.
(1997) - et al.
On the power of one bit of quantum information
Phys. Rev. Lett.
(1998)
There are more references available in the full text version of this article.
Cited by (29)
Sumcheck-based delegation of quantum computing to rational server
2022, Theoretical Computer ScienceQuasi-probability representations of quantum theory with applications to quantum information science
2011, Reports on Progress in PhysicsQuantum discord and quantum computing - An appraisal
2011, International Journal of Quantum InformationOn the quantum computational complexity of the Ising spin glass partition function and of knot invariants
2004, New Journal of PhysicsEstimating distinguishability measures on quantum computers
2023, Physical Review A
Copyright © 2001 Elsevier Science B.V. All rights reserved.