Parallel quantum computation and quantum codes

SIAM Journal on Computing

Volumn 31, Issue 3, 2002, Pages 799-815

  Moore, Cristopher ^a   Nilsson, Martin ^a  

^a SANTA FE INSTITUTE   (United States)

Author keywords

Group theory; Parallel computation; Quantum circuits; Quantum complexity classes; Quantum error correcting codes

Indexed keywords

DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; FOURIER TRANSFORMS; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS;

QUANTUM CODES; QUANTUM FOURIER TRANSFORMS;

QUANTUM ELECTRONICS;

EID: 0036308317     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799355053     Document Type: Article

References (26)

1. Elementary gates for quantum computation
2. On relating time and space to size and depth
3. Fast parallel circuits for the quantum Fourier transform
4. An approximate fourier transform useful in quantum factoring
5. A scalable reversible computer in silicon
6. Bulk spin resonance quantum computation
7. On the complexity of quantum ACC
8. Counting, fanout, and the complexity of quantum ACC
9. Semiclassical Fourier transform for quantum computation
10. Perfect quantum error correction code
11. Quantum automata and quantum grammars
12. Randomization and derandomization in space-bounded computation
13. Algorithms for quantum computation: Discrete logarithms and factoring
14. Multiple particle interference and quantum error correction
15. Relationships between quantum and classical space-bounded complexity classes
16. A single quantum cannot be cloned