Distinguishing short quantum computations

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 597-608

  Rosgen, Bill ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Computational complexity; Quantum circuits; Quantum information; Quantum interactive proof systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; QUANTUM COMPUTERS; QUANTUM OPTICS;

COMPLETE PROBLEMS; CONSTANT-DEPTH CIRCUITS; DISTINGUISHABILITY; PARALLELIZATION TECHNIQUES; QUANTUM ALGORITHMS; QUANTUM CIRCUIT; QUANTUM INFORMATION; QUANTUM INTERACTIVE PROOF SYSTEMS;

QUANTUM THEORY;

EID: 45749138391     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. D. Aharonov, A. Kitaev, N. Nisan. Quantum circuits with mixed states. In Proc. 30th ACM Symposium on the Theory of Computing, pp. 20-30, 1998.
2. A. Broadbent, E. Kashefi. Parallelizing quantum circuits. arXiv:0704.1736v1 [quant-ph].
3. R. Cleve, J. Watrous. Fast parallel circuits for the quantum fourier transform. In Proc 41st ACM Symposium on the Theory of Computing, pp. 526-536, 2000.
4. S. Fenner, F. Green, S. Homer, Y. Zhang. Bounds on the power of constant-depth quantum circuits. In Proc. 15th International Symposium on Fundamentals of Computation Theory, pp. 44-55, 2005.
5. C. A. Fuchs, J. van de Graaf. Cryptographic distinguishability measures for quantum-mechanical states. IEEE Transactions on Information Theory, 45(4): 1216-1227, 1999.
6. F. Green, S. Homer, C. Moore, C. Pollett. Counting, fanout and the complexity of quantum ACC. Quantum Information and Computation, 2(1):35-65, 2002.
7. P. Høyer, R. Špalek. Quantum circuits with unbounded fan-out. Theory of Computing, 1:81-103, 2005.
8. A. Kitaev, J. Watrous. Parallelization, amplification and exponential time simulation of quantum interactive proof systems. In Proc. 32nd ACM Symp. Theory of Computing, pp. 608-617, 2000.
9. A. Y. Kitaev, A. H. Shen, M. N. Vyalyi. Classical and Quantum Computation, volume 47 of Graduate Studies in Mathematics. American Mathematical Society, 2002.
10. C. Moore, M. Nilsson. Parallel quantum computation and quantum codes. SIAM Journal on Computing, 31(3):799-815, 2002.
11. M. A. Nielsen, I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
12. B. Rosgen, J. Watrous. On the hardness of distinguishing mixed-state quantum computations. In Proc. 20th Conference on Computational Complexity, pp. 344-354, 2005.
13. B. M. Terhal, D. P. DiVincenzo. Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games. Quantum Information and Computation, 4(2):134-145, 2004.