Instantaneous Quantum Computation

Instantaneous Quantum Computation

We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using the theory of binary matroids, we argue that the paradigm i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2009-01
Hauptverfasser: Shepherd, Dan, Bremner, Michael J
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Computation
Physics - Quantum Physics
Quantum theory
Qubits (quantum computing)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Shepherd, Dan
Bremner, Michael J
description We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using the theory of binary matroids, we argue that the paradigm is rich enough to enable sampling from probability distributions that cannot, classically, be sampled from efficiently and accurately. This paradigm also admits simple interactive proof games that may convince a skeptic of the existence of truly quantum effects. Furthermore, these effects can be created using significantly fewer qubits than are required for running Shor's Algorithm.
doi_str_mv 10.48550/arxiv.0809.0847
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0809_0847</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2087509869</sourcerecordid><originalsourceid>FETCH-LOGICAL-a519-d83ae333b1e4c706c9bce5eebec8b537f5206e489737b1e348bab41ee7e408fe3</originalsourceid><addsrcrecordid>eNotj81LAzEQxYMgWGrvnqTieetsJtkkR1nUFgoi9B6SdRa2uB8mG9H_3tQKj3nv8GN4j7GbEjZCSwkPLnx3XxvQYPIR6oItOGJZaMH5FVvFeAQAXikuJS7Y3W6IsxuyaExx_ZZyTv26HvspzW7uxuGaXbbuI9Lq35fs8Px0qLfF_vVlVz_uCydLU7xrdISIviTRKKga4xuSRJ4a7SWqVnKoSGijUGUGhfbOi5JIkQDdEi7Z7fntX307ha534ceeZtjTjAzcn4EpjJ-J4myPYwpDrmQ5aCXB6MrgL7OkSjM</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2087509869</pqid></control><display><type>article</type><title>Instantaneous Quantum Computation</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Shepherd, Dan ; Bremner, Michael J</creator><creatorcontrib>Shepherd, Dan ; Bremner, Michael J</creatorcontrib><description>We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using the theory of binary matroids, we argue that the paradigm is rich enough to enable sampling from probability distributions that cannot, classically, be sampled from efficiently and accurately. This paradigm also admits simple interactive proof games that may convince a skeptic of the existence of truly quantum effects. Furthermore, these effects can be created using significantly fewer qubits than are required for running Shor's Algorithm.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0809.0847</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Computation ; Physics - Quantum Physics ; Quantum theory ; Qubits (quantum computing)</subject><ispartof>arXiv.org, 2009-01</ispartof><rights>2009. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.1098/rspa.2008.0443$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.0809.0847$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Shepherd, Dan</creatorcontrib><creatorcontrib>Bremner, Michael J</creatorcontrib><title>Instantaneous Quantum Computation</title><title>arXiv.org</title><description>We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using the theory of binary matroids, we argue that the paradigm is rich enough to enable sampling from probability distributions that cannot, classically, be sampled from efficiently and accurately. This paradigm also admits simple interactive proof games that may convince a skeptic of the existence of truly quantum effects. Furthermore, these effects can be created using significantly fewer qubits than are required for running Shor's Algorithm.</description><subject>Algorithms</subject><subject>Computation</subject><subject>Physics - Quantum Physics</subject><subject>Quantum theory</subject><subject>Qubits (quantum computing)</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj81LAzEQxYMgWGrvnqTieetsJtkkR1nUFgoi9B6SdRa2uB8mG9H_3tQKj3nv8GN4j7GbEjZCSwkPLnx3XxvQYPIR6oItOGJZaMH5FVvFeAQAXikuJS7Y3W6IsxuyaExx_ZZyTv26HvspzW7uxuGaXbbuI9Lq35fs8Px0qLfF_vVlVz_uCydLU7xrdISIviTRKKga4xuSRJ4a7SWqVnKoSGijUGUGhfbOi5JIkQDdEi7Z7fntX307ha534ceeZtjTjAzcn4EpjJ-J4myPYwpDrmQ5aCXB6MrgL7OkSjM</recordid><startdate>20090104</startdate><enddate>20090104</enddate><creator>Shepherd, Dan</creator><creator>Bremner, Michael J</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>GOX</scope></search><sort><creationdate>20090104</creationdate><title>Instantaneous Quantum Computation</title><author>Shepherd, Dan ; Bremner, Michael J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a519-d83ae333b1e4c706c9bce5eebec8b537f5206e489737b1e348bab41ee7e408fe3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Computation</topic><topic>Physics - Quantum Physics</topic><topic>Quantum theory</topic><topic>Qubits (quantum computing)</topic><toplevel>online_resources</toplevel><creatorcontrib>Shepherd, Dan</creatorcontrib><creatorcontrib>Bremner, Michael J</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shepherd, Dan</au><au>Bremner, Michael J</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Instantaneous Quantum Computation</atitle><jtitle>arXiv.org</jtitle><date>2009-01-04</date><risdate>2009</risdate><eissn>2331-8422</eissn><abstract>We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using the theory of binary matroids, we argue that the paradigm is rich enough to enable sampling from probability distributions that cannot, classically, be sampled from efficiently and accurately. This paradigm also admits simple interactive proof games that may convince a skeptic of the existence of truly quantum effects. Furthermore, these effects can be created using significantly fewer qubits than are required for running Shor's Algorithm.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0809.0847</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2009-01
issn 2331-8422
language eng
recordid cdi_arxiv_primary_0809_0847
source arXiv.org; Free E- Journals
subjects Algorithms
Computation
Physics - Quantum Physics
Quantum theory
Qubits (quantum computing)
title Instantaneous Quantum Computation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T20%3A41%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Instantaneous%20Quantum%20Computation&rft.jtitle=arXiv.org&rft.au=Shepherd,%20Dan&rft.date=2009-01-04&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0809.0847&rft_dat=%3Cproquest_arxiv%3E2087509869%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2087509869&rft_id=info:pmid/&rfr_iscdi=true