Quantum computing and quadratically signed weight enumerators

Information Processing Letters

Volumn 79, Issue 4, 2001, Pages 173-179

  Knill, E ^a   Laflamme, R ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Combinatorial problems; Computational complexity; Quantum computing; Theory of computing

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

QUADRATICALLY SIGNED WEIGHT ENUMERATORS; QUANTUM COMPUTING;

QUANTUM THEORY;

EID: 0035882582     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00222-2     Document Type: Article

References (19)

1. Algorithms for quantum computation: Discrete logarithms and factoring
2. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
3. Fault-tolerant quantum computation
4. Quantum computations: Algorithms and error correction
5. Resilient quantum computation
6. Fault-tolerant quantum computation with constant error
7. Quantum complexity theory
8. On the power of one bit of quantum information
9. Quantum computation
10. Promise problems complete for complexity classes
11. Promises and fault-tolerant database access
12. Bycycle dimension and special points of the Tutte polynomial
13. Quantum computability
14. Time/space trade-offs for reversible computation