Ethan Bernstein, Umesh Vazirani  Home/Search
Context Related
| berkeley.edu/~vazirani/bv.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~vazirani/ (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 [20]. This construction is substantially more complicated than the corresponding construction for classical Turing Machines - in fact, even simple primitives such as looping, branching and composition are not straightforward in the context of quantum Turing Machines. We establish... (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.5%: Quantum Complexity Theory - Bernstein, Vazirani (1997) (Correct)
Active bibliography (related documents): More All
1.1: Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985) (Correct)
1.1: Alternative Computational Models: A Comparison of Biomolecular and .. - Reif (1998) (Correct)
0.6: Quantum Computation - Aharonov (1998) (Correct)
Similar documents based on text: More All
0.2: Strengths and Weaknesses of Quantum Computing - Bennett, Bernstein, Brassard, .. (1996) (Correct)
0.2: Bibliography - Athas Low-Power Vlsi (Correct)
0.2: Efficient Checking of Polynomials and Proofs and the Hardness of.. - Sudan (1992) (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/article/bernstein97quantum.html More
@inproceedings{ bernstein93quantum,
author = "Ethan Bernstein and Umesh Vazirani",
title = "Quantum complexity theory",
pages = "11--20",
year = "1993",
url = "citeseer.ist.psu.edu/article/bernstein97quantum.html" }
Citations (may not include all citations):175 Logical reversibility of computation (context) - Bennett - 1973
173 Quantum complexity theory - Bernstein
173 Proof verification and intractability of approximation probl.. (context) - Arora, Lund et al. - 1992
173 Quantum complexity theory - Bernstein, Vazirani - 1993
144 the power of quantum computation - Simon - 1994
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
124 Elementary gates for quantum computation - Barenco, Bennett et al. - 1995
118 the Church-Turing principle and the universal quantum comput.. (context) - Deutsch - 1985
116 Simulating physics with computers - Feynman - 1982
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al.
87 Arthur--Merlin games: a randomized proof system (context) - Babai, Moran - 1988
86 Conservative Logic (context) - Fredkin, Toffoli - 1982
85 Quantum circuit complexity - Yao - 1993
70 Quantum computational networks (context) - Deutsch - 1989
57 Algorithms for quantum computation: Discrete log and factori.. - Shor - 1994
52 Good quantum error correcting codes exist - Calderbank, Shor
49 Two-bit gates are universal for quantum computation - DiVincenzo - 1995
45 Fault-tolerant quantum computation - Shor - 1996
42 The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992
37 A potentially realizable quantum computer (context) - Lloyd - 1993
36 Oracle quantum computing - Berthiaume, Brassard - 1994
26 space tradeoffs for reversible computation (context) - Bennett - 1989
23 Maintaining coherence in quantum computers (context) - Unruh - 1995
21 Quantum mechanics (context) - Cohen-Tannoudji, Diu et al. - 1977
15 Quantum computability (context) - Adleman, DeMarrais et al. - 1994
14 Learning DNF over uniform distribution using a quantum examp.. - Bshouty, Jackson - 1995
13 On one dimensional quantum cellular automata - Watrous - 1995
11 Is quantum mechanics useful (context) - Landauer
8 A decision procedure for well-formed linear quantum cellular.. - urr, Santha et al. - 1995
8 The stabilisation of quantum computation - Berthiaume, Deutsch et al. - 1994
7 Quantum computers and dissipation - Palma, Suominen et al. - 1995
6 the Role of the Cook-Levin Theorem in Complexity Theory (context) - Arora, Impagliazzo et al. - 1993
6 Random polynomial time is equal to semi-random polynomial ti.. (context) - Vazirani, Vazirani - 1985
5 Personal communication (context) - Lipton - 1994
5 tape 2-symbol reversible Turing Machine (context) - Morita, Shirasaki et al. - 1989
5 Bicontinuous extensions of invertible combinatorial function.. - Toffoli - 1981
5 Personal communication (context) - Valiant - 1992
4 factoring and decoherence (context) - Chuang, LaFlamme et al. - 1995
3 Phase information in quantum oracle computing (context) - Machta - 1996
1 Quantum Hamiltonian models of Turing machines Journal of Sta.. (context) - Benioff - 1982
1 and Yao (context) - Solovay - 1996
1 Searching for a needle in a haystack -- a fast quantum mecha.. (context) - Grover - 1995
1 Weak Random Sources (context) - Zuckerman - 1990
1 Quantum computation using trapped cold ions (context) - Zoller - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://http.cs.berkeley.edu/~vazirani/): More
On the Power of Quantum Computation - Vazirani (1998) (Correct)
Dense Quantum Coding and a Lower Bound for 1-way.. - Ambainis, Nayak.. (1999) (Correct)
Quantum Bit Escrow - Aharonov, Ta-Shma, al. (2000) (Correct)
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