Andrew Chi-Chih Yao  Home/Search
Context Related
Links: DBLP | imsc.ernet.in/tcsweb/quantum/yao.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: imsc.ernet.in/tcsweb/quantu...qcc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines than that considered by Bernstein and Vazirani [BV93], thus answering an open question raised in [BV93]. ... (Update)
Cited by: More
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (Correct)
Quantum Entanglement and the Communication Complexity of the .. - Richard Cleve Wim (Correct)
quant-ph/9708019 - Mar Quantum Entanglement (Correct)
Active bibliography (related documents): More All
0.2: Quantum Complexity Theory - Bernstein, Vazirani (1997) (Correct)
0.2: Models to Reduce the Complexity of Simulating a Quantum Computer - Obenland, Despain (1997) (Correct)
0.2: A Parallel Quantum Computer Simulator - Obenland, Despain (1997) (Correct)
Similar documents based on text: More All
0.0: Kinetic Collision Detection Between Two Simple Polygons - Basch, Erickson, Guibas, .. (1999) (Correct)
0.0: Modeling Contention Effects in Clustered Environments - Figueira, Berman (1996) (Correct)
0.0: Area-Universal Circuits with Constant Slowdown - Bhatt, Bilardi, Pucci (1999) (Correct)
Related documents from co-citation: More All
53: Quantum complexity theory - Bernstein, Vazirani - 1993
45: Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
41: the power of quantum computation - Simon - 1994
BibTeX entry: (Update)
A.C.-C. Yao. Quantum circuit complexity. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pages 352--361, 1993. http://citeseer.ist.psu.edu/yao93quantum.html More
@inproceedings{ yao93quantum,
author = "A.~Yao",
title = "Quantum Circuit Complexity",
booktitle = "Proceedings of the 34th Annual Symposium on Foundations of Computer Science",
publisher = "Institute of Electrical and Electronic Engineers Computer Society Press",
address = "Los Alamitos, CA",
pages = "352--361",
year = "1993",
url = "citeseer.ist.psu.edu/yao93quantum.html" }
Citations (may not include all citations):175 Logical reversibility of computation (context) - Bennett - 1973
173 Quantum complexity theory - Bernstein, Vazirani - 1993 ACM DBLP
116 Simulating physics with computers - Feynman - 1982 ACM
82 Monotone circuits for connectivity require super-logarithmic.. (context) - Karchmer, Wigderson - 1990 ACM DBLP
70 Quantum computational networks (context) - Deutsch - 1989
61 Relations among complexity measures (context) - Pippenger, Fischer - 1979 ACM DBLP
48 Quantum theory, the Church-Turing principle and the universa.. - Deutsch - 1985
42 The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992 DBLP
37 Multi-party protocols (context) - Chandra, Furst et al. - 1983 ACM DBLP
36 A quantum bit commitment scheme provably unbreakable by both.. - Brassard, Cr'epeau et al. - 1993 ACM DBLP
11 The network complexity and Turing machine complexity of fini.. (context) - Schnorr - 1976
8 Characterizing classes of functions computable by quantum pa.. (context) - Jozsa - 1991
5 Bicontinuous extensions of invertible combinatorial function.. - Toffoli - 1981 DBLP
1 Cryptology column - quantum cryptology: a bibliography (context) - Brassard - 1993
1 Computational work and time on finite functions (context) - Savage - 1972
1 Lengths of formulas and elimination of quantifiers (context) - Hodes, Specker - 1968
1 Bounds for the quantity of information transmitted by a quan.. (context) - Kholevo - 1973
1 Information from quantum measurements (context) - Schumacher - 1990
1 Some questions on the complexity of distributive computing (context) - Yao - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.imsc.ernet.in/tcsweb/quantum/qcc.html): More
Elementary Gates for Quantum Computation - Barenco, Bennett, Cleve, Di.. (1995) (Correct)
Decoherence and a Simple Quantum Computer - Isaac Chuang Raymond (Correct)
Simulating Physics with Computers - Feynman (1982) (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