Article

Free access

Quantum complexity theory

Authors:

Ethan Bernstein,

Umesh VaziraniAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 11 - 20

https://doi.org/10.1145/167088.167097

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

L.Babai and S.Moran. "Arthur- Merlin games: a randomized proof system, and a. hierarchy of complexit, y classes " dourhal of Comp#tler and System Sciences, Vol. 36, 1988, pp. 254-276.

Digital Library

Google Scholar

[2]

C.Bennett. "Logical reversibility of comput, ation "" IBM J. Res. De'#,elop., Vol. 17. 1973, pp. 525-532.

Digital Library

Google Scholar

[3]

A.Berthiaume a,nd G.Brassard. "The quantum challenge to structural complexit.y theory.'" Proceedings of 7th IEEE CoT@rencc o7# Structure t# Complexzty Theory, 1992.

Google Scholar

[4]

A.Berthia,ume and G.Bra.ssard. "Oracle quantum computing '" Proceed#gs of th# Physzcs of Computations, Dallas, 1992.

Google Scholar

[5]

D.Deutsch. "'Qua.ntuna theory, the Church- Turing principle and the universa.1 quant, um comput.er" Proc. R. Soc. Lond., Vol. A400, 1985, pp. 97-117.

Crossref

Google Scholar

[6]

D.Deut.sch. "Quantum computa.tional networks." Proc. R. Soc. Lond., Vol. A425. 1989, pp. 73-90.

Google Scholar

[7]

D.Deutsch and R.Jozsa. "'Rapid solution of problems by quant, um computation '" Proc. R. Soc. Lond. Vol. A439. 1992, pp. 55.3-558.

Google Scholar

[8]

R.Feynman. "Simula.t, ing physics with computers "' International Journal of Theoretical Phys.lcs, Vol. 21, nos. 6/7, 1982, pp. 467-488.

Crossref

Google Scholar

[9]

R.Jozsa. "Characterizing classes of functions comput, able by quantum pa.rallelism "" Proc. R. Soc. Lond. Vol. A435, 1991, pp. 563-574.

Crossref

Google Scholar

[10]

L.Valiant. Personal communication, 1992.

Google Scholar

Cited By

View all

Laakkonen TMeichanetzidis KCoecke B(2024)Quantum Algorithms for Compositional Text ProcessingElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.406.8406(153-187)Online publication date: 10-Aug-2024
https://doi.org/10.4204/EPTCS.406.8
Alexei K(2024)Estimation of quantum entropiesi-manager’s Journal on Mathematics10.26634/jmat.13.1.2038713:1(1)Online publication date: 2024
https://doi.org/10.26634/jmat.13.1.20387
Oliveira MBarbosa LGalvão E(2024)Quantum advantage in temporally flat measurement-based quantum computationQuantum10.22331/q-2024-04-09-13128(1312)Online publication date: 9-Apr-2024
https://doi.org/10.22331/q-2024-04-09-1312
Show More Cited By

Index Terms

Quantum complexity theory
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Models of computation
    1. Computability
      1. Turing machines
    2. Probabilistic computation

Recommendations

Quantum Complexity Theory

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 ...
Quantum Hamiltonian Complexity
Quantum Kolmogorov complexity based on classical descriptions

We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum domain retaining classical descriptions. Quantum Kolmogorov complexity coincides with ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

221
Total Citations
View Citations
6,307
Total Downloads

Downloads (Last 12 months)1,537
Downloads (Last 6 weeks)150

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Laakkonen TMeichanetzidis KCoecke B(2024)Quantum Algorithms for Compositional Text ProcessingElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.406.8406(153-187)Online publication date: 10-Aug-2024
https://doi.org/10.4204/EPTCS.406.8
Alexei K(2024)Estimation of quantum entropiesi-manager’s Journal on Mathematics10.26634/jmat.13.1.2038713:1(1)Online publication date: 2024
https://doi.org/10.26634/jmat.13.1.20387
Oliveira MBarbosa LGalvão E(2024)Quantum advantage in temporally flat measurement-based quantum computationQuantum10.22331/q-2024-04-09-13128(1312)Online publication date: 9-Apr-2024
https://doi.org/10.22331/q-2024-04-09-1312
Klug F(2024)Quantum Optimization Algorithms in Operations Research: Methods, Applications, and ImplicationsSSRN Electronic Journal10.2139/ssrn.4854668Online publication date: 2024
https://doi.org/10.2139/ssrn.4854668
Trummer I(2024)Towards Out-of-Core Simulators for Quantum ComputingProceedings of the 1st Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications10.1145/3665225.3665441(1-1)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3665225.3665441
Yamakawa TZhandry M(2024)Verifiable Quantum Advantage without StructureJournal of the ACM10.1145/365866571:3(1-50)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3658665
Montanaro AShao CMohar BShinkar IO'Donnell R(2024)Quantum and Classical Query Complexities of Functions of MatricesProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649665(573-584)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649665
Wadhia VChancellor NKendon V(2024)Cycle discrete-time quantum walks on a noisy quantum computerThe European Physical Journal D10.1140/epjd/s10053-023-00795-278:3Online publication date: 25-Mar-2024
https://doi.org/10.1140/epjd/s10053-023-00795-2
Vedrukov PIvlev ALiniov AMeyerov IIvanchenko M(2024)Quantum Process Tomography on Cloud-accessible Quantum Computing PlatformsLobachevskii Journal of Mathematics10.1134/S199508022401052945:1(119-129)Online publication date: 6-May-2024
https://doi.org/10.1134/S1995080224010529
Dasgupta SHumble T(2024)Improving Probabilistic Error Cancellation in the Presence of Nonstationary NoiseIEEE Transactions on Quantum Engineering10.1109/TQE.2024.34357575(1-14)Online publication date: 2024
https://doi.org/10.1109/TQE.2024.3435757
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Quantum Complexity Theory

Quantum Hamiltonian Complexity

Quantum Kolmogorov complexity based on classical descriptions