Ethan Bernstein, Umesh Vazirani  Home/Search
Context Related
Links: ACM DBLP | siam.org/sambin/getfile/S...30092.ps.Z From: siam.org/sambin/dbq/arti...30092 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch's model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97-117]. This construction is substantially more complicated than the corresponding construction for classical Turing machines (TMs); in fact, even simple primitives such as looping, branching, and composition are not straightforward ... (Update)
Cited by: More
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (Correct)
Quantum Fourier transforms for extracting hidden - Linear Structures In (Correct)
Quantum Entanglement and the Communication Complexity of the .. - Richard Cleve Wim (Correct)
Similar documents (at the sentence level):
55.8%: Quantum Complexity Theory - Bernstein, Vazirani (1997) (Correct)
Active bibliography (related documents): More All
2.2: Learning DNF Over The Uniform Distribution Using A Quantum.. - Bshouty, Jackson (1999) (Correct)
0.2: Alternative Computational Models: A Comparison of Biomolecular and .. - Reif (1998) (Correct)
0.2: Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985) (Correct)
Similar documents based on text: More All
0.2: On One-Dimensional Quantum Cellular Automata - Watrous (1995) (Correct)
0.2: Strengths and Weaknesses of Quantum Computing - Bennett, Bernstein, Brassard, .. (1994) (Correct)
0.2: Bibliography - Athas Low-Power Vlsi (Correct)
Related documents from co-citation: More All
50: the power of quantum computation - Simon - 1994
47: Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
35: Oracle quantum computing - Berthiaume, Brassard - 1992
BibTeX entry: (Update)
Bernstein, E. and U. Vazirani, Quantum complexity theory. In Proceedings of the 25th ACM Symposium on the Theory of Computation. New York: ACM Press, pp. 11-20, (1993). http://citeseer.ist.psu.edu/bernstein97quantum.html More
@article{ bernstein97quantum,
author = "Ethan Bernstein and Umesh Vazirani",
title = "Quantum complexity theory",
journal = "SIAM J. Comput.",
volume = "26";
number = "5",
pages = "1411--1473",
year = "1997",
url = "citeseer.ist.psu.edu/bernstein97quantum.html" }
Citations (may not include all citations):173 Proof verification and intractability of approximation<F (context) - Arora, Lund et al. - 1992
118 the Church--Turing principle and the universal quantum compu.. (context) - Deutsch, Quantum - 1985
57 Algorithms for quantum computation: Discrete log and<F - Shor - 1994
14 Learning DNF over uniform distribution using a quantum examp.. - Bshouty, Jackson - 1995
7 Quantum computers (context) - Chuang, LaFlamme et al. - 1995
7 A decision procedure for unitary linear quantum cellular<F (context) - urr, Santha et al. - 1996
6 Random polynomial time is equal to semi-random polynomial<F (context) - Vazirani, Vazirani - 1985
5 Bicontinuous extensions of invertible combinatorial<F - Toffoli - 1981
5 Personal communication (context) - Lipton - 1994
5 Personal communication (context) - Valiant - 1992
3 Quantum Complexity<F (context) - Bernstein - 1997
3 Quantum complexity<F (context) - Bernstein, Vazirani - 1993
2 The quantum challenge to structural complexity<F (context) - Berthiaume, Brassard - 1992
2 Rapid solution of problems by quantum<F (context) - Deutsch, Jozsa - 1992
2 Quantum circuit<F (context) - Yao - 1993
1 Weak Random<F (context) - Zuckerman - 1990
1 Is quantum mechanics<F (context) - Landauer - 1995
1 A potentially realizable quantum<F (context) - Lloyd - 1993
1 the Role of the Cook-Levin Theorem in Complexity<F (context) - Arora, Impagliazzo et al. - 1993
1 i and S.<F4.039e+05> Moran,<F4.112e+05> Arthur--Merlin<F4.03.. (context) - Baba - 1988
1 Elementary gates for quantum<F (context) - Barenco, Bennett et al. - 1995
1 Maintaining coherence in quantum<F (context) - Unruh - 1995
1 Quantum Hamiltonian models of Turing<F (context) - Benioff - 1982
1 Logical reversibility of (context) - Bennett - 1973
1 The stabilisation of quantum<F (context) - Berthiaume, Deutsch et al. - 1994
1 space tradeo#s for reversible<F (context) - Bennett, Time - 1989
1 Quantum computational<F (context) - Deutsch - 1989
1 Strengths and weaknesses of quantum<F (context) - Bennett, Bernstein et al. - 1997
1 Phase Information in Quantum Oracle<F (context) - Machta - 1996
1 Good quantum error correcting codes<F (context) - Calderbank, Shor - 1996
1 Two-bit gates are universal for quantum<F (context) - DiVincenzo - 1995
1 symbol reversible Turing<F (context) - Morita, Shirasaki et al. - 1989
1 Quantum computation using trapped cold<F (context) - Cirac, Zoller - 1995
1 Quantum Computers and<F (context) - Palma, Suominen et al. - 1996
1 Simulating physics with<F (context) - Feynman - 1982
1 Longman Scientific & Technical (context) - Cohen-Tannoudji, Diu et al. - 1977
1 On one dimensional quantum cellular<F (context) - Watrous - 1995
1 A fast quantum mechanical algorithm for database<F (context) - Grover - 1996
1 Fault-tolerant quantum<F (context) - Shor - 1996
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC