Quantum Computational Complexity
Glossary Definition of the Subject Introduction The Quantum Circuit Model Polynomial‐Time Quantum Computations Quantum Proofs Quantum Interactive Proof Systems Other Selected Notions in Quantum Complexity Future Directions Bibliography
Saved in:
Published in | Computational Complexity pp. 2361 - 2387 |
---|---|
Main Author | |
Format | Book Chapter |
Language | English |
Published |
United States
Springer New York
2011
|
Subjects | |
Online Access | Get full text |
ISBN | 1461417996 9781461417996 |
DOI | 10.1007/978-1-4614-1800-9_147 |
Cover
Abstract | Glossary
Definition of the Subject
Introduction
The Quantum Circuit Model
Polynomial‐Time Quantum Computations
Quantum Proofs
Quantum Interactive Proof Systems
Other Selected Notions in Quantum Complexity
Future Directions
Bibliography |
---|---|
AbstractList | Glossary
Definition of the Subject
Introduction
The Quantum Circuit Model
Polynomial‐Time Quantum Computations
Quantum Proofs
Quantum Interactive Proof Systems
Other Selected Notions in Quantum Complexity
Future Directions
Bibliography |
Author | Watrous, John |
Author_xml | – sequence: 1 givenname: John surname: Watrous fullname: Watrous, John organization: Institute for Quantum Computing and School of Computer Science, University of Waterloo, Waterloo, Canada |
BookMark | eNo1j9tKxDAQhiMe0F33EYR9geikOTWXUnQVFkTQ65BTtdpta5OCvr3prs7N8P_wDfMt0EnXdwGhKwLXBEDeKFligpkgDJMSACtNmDxCCzJXc0OP_4NUSpzlAIVgnIlCnKNVjB-QhysuSnWB1s-T6dK0W1f9bpiSSU3fmXaf2vDdpJ9LdFqbNobV316i1_u7l-oBb582j9XtFg8FBYkdE94oVztmPSVQMiccM74wEkxtgqXCEksZJ8pK7wMH8IFaJamnYEoFdIno4W4cxqZ7C6O2ff8ZNQE9a-usrYmetfQsqffameIHahj7rynEpMOMudCl0bTu3QwpjFGL_BIXGeFcFwwY_QW_KlwV |
ContentType | Book Chapter |
Copyright | Springer-Verlag 2012 |
Copyright_xml | – notice: Springer-Verlag 2012 |
DBID | FFUUA |
DEWEY | 003.54 |
DOI | 10.1007/978-1-4614-1800-9_147 |
DatabaseName | ProQuest Ebook Central - Book Chapters - Demo use only |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Applied Sciences Mathematics Computer Science |
EISBN | 1461418003 9781461418009 |
Editor | Meyers, Robert A |
Editor_xml | – sequence: 1 fullname: Meyers, Robert A |
EndPage | 2387 |
ExternalDocumentID | EBC6310569_155_2404 |
GroupedDBID | -EI .RY 089 0D6 0DA 0E8 A4J AABBV ABFCV ABMNI ADWNV AEJLV AEKFX AETDV AEZAY AFSBW ALMA_UNASSIGNED_HOLDINGS AZZ BBABE FFUUA IEZ JJU LMIIW MA. NDFEG PH7 PI1 SBO TGCOT TPJZQ Z7R Z83 Z85 Z88 AAJYQ AATVQ ABBUY ABCYT ACDTA ACDUY AEHEY AHNNE ATJMZ |
ID | FETCH-LOGICAL-p2307-c46da9cfc4bd31084c6c4ad2a70afaeb36b1b34519b7dde500de3b973d30a8903 |
ISBN | 1461417996 9781461417996 |
IngestDate | Tue Jul 29 20:10:30 EDT 2025 Thu May 29 17:51:27 EDT 2025 |
IsPeerReviewed | false |
IsScholarly | false |
LCCallNum | QA76.9.C65 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-p2307-c46da9cfc4bd31084c6c4ad2a70afaeb36b1b34519b7dde500de3b973d30a8903 |
OCLC | 1026454626 |
PQID | EBC6310569_155_2404 |
PageCount | 27 |
ParticipantIDs | springer_books_10_1007_978_1_4614_1800_9_147 proquest_ebookcentralchapters_6310569_155_2404 |
PublicationCentury | 2000 |
PublicationDate | 2011 2012 |
PublicationDateYYYYMMDD | 2011-01-01 2012-01-01 |
PublicationDate_xml | – year: 2011 text: 2011 |
PublicationDecade | 2010 |
PublicationPlace | United States |
PublicationPlace_xml | – name: United States – name: New York, NY |
PublicationSubtitle | Theory, Techniques, and Applications |
PublicationTitle | Computational Complexity |
PublicationYear | 2011 2012 |
Publisher | Springer New York |
Publisher_xml | – name: Springer New York |
SSID | ssj0000595689 |
Score | 1.473797 |
Snippet | Glossary
Definition of the Subject
Introduction
The Quantum Circuit Model
Polynomial‐Time Quantum Computations
Quantum Proofs
Quantum Interactive Proof Systems... |
SourceID | springer proquest |
SourceType | Publisher |
StartPage | 2361 |
SubjectTerms | Interactive Proof Quantum Circuit Quantum Operation Toffoli Gate Turing Machine |
Title | Quantum Computational Complexity |
URI | http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=6310569&ppg=2404 http://link.springer.com/10.1007/978-1-4614-1800-9_147 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLZgXIADMECMl3rgNjK1a9LHEaahaWJISBvaLcqjvTEQ7Q7w63G6ZqUbQhqXqrHSKLWj-LMT2wA3Uguh4pARVAcuMbGMRDKFQC5KPZZ6Siph_JCjp2AwocMpm1ZVMYvoklx21NevcSX_kSrSUK4mSnYDyS4HRQK-o3zxiRLG5wr4rbtZF3kFinoM1pdnWia3Zf75cxE8z5Fx89f2n3115cSs2fzW59e2qZ1qRqGp1G3qii0qxa5tkdWtCDQesSfxEDOSGG2AsNIJ9hwc9T2tUwvV17_vBYgLWYCfMcZNr23YDiPagJ27_vDxZenmQvTGgiguQurstGymLdu2gVVlvt-1adXA_8p5dQEDxoewb0JDHBOzgfM8gq1k1oSDEsg75TaZIcnWyrC0JuyNlvlxs2NwSsE4NcE4lWBOYPLQH_cGpKxVQd7NVXqiaKBFrFJFpUbORFQFigrdFaErUpFIP5Ce9E0uHxmiRmGuqxNfxqGvfVdEseufQmP2NkvOwOlq5ouAIhBG4z2hWtJIuwyBLI7cTVXcgo5lBy9O1MtrvGrx8xlfFU0Lbi3TuOmfcZurGtnNPW7YzQ27ecHu803Hv4DdapFeQiP_mCdXCNVyeV0uh2_6CTdS |
linkProvider | Library Specific Holdings |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Computational+Complexity&rft.atitle=Quantum+Computational+Complexity&rft.date=2011-01-01&rft.pub=Springer+New+York&rft.isbn=9781461417996&rft_id=info:doi/10.1007%2F978-1-4614-1800-9_147&rft.externalDBID=2404&rft.externalDocID=EBC6310569_155_2404 |
thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F6310569-l.jpg |