Efficient quantum computation with probabilistic quantum gates

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability \(p\). The required computational overhead scales efficiently both wi...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2005-02
Main Authors: L -M Duan, Raussendorf, R
Format: Article
Language:English
Subjects:
Computational efficiency
Qubits (quantum computing)
Statistical analysis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator L -M Duan
Raussendorf, R
description With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability \(p\). The required computational overhead scales efficiently both with \(1/p\) and \(n\), where \(n\) is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability \(1-p\) far beyond any threshold requirement.
doi_str_mv 10.48550/arxiv.0502120
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2090065506</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2090065506</sourcerecordid><originalsourceid>FETCH-proquest_journals_20900655063</originalsourceid><addsrcrecordid>eNqNjrEOgjAURRsTE4myOjdxBh8tRVxcDMYPcCeFFH0EWqCt-vkyGGenM9xzk0PINoE4zYWAvZze-IxBAEsYLEjAOE-iPGVsRUJrWwBg2YEJwQNyKpoGa1Ta0dFL7XxPa9MP3kmHRtMXugcdJlPJCju0DuufdpdO2Q1ZNrKzKvxyTXaX4na-RvNn9Mq6sjV-0vNUMjgCZHNexv-zPn8nPt4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2090065506</pqid></control><display><type>article</type><title>Efficient quantum computation with probabilistic quantum gates</title><source>ProQuest - Publicly Available Content Database</source><creator>L -M Duan ; Raussendorf, R</creator><creatorcontrib>L -M Duan ; Raussendorf, R</creatorcontrib><description>With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability \(p\). The required computational overhead scales efficiently both with \(1/p\) and \(n\), where \(n\) is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability \(1-p\) far beyond any threshold requirement.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0502120</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computational efficiency ; Qubits (quantum computing) ; Statistical analysis</subject><ispartof>arXiv.org, 2005-02</ispartof><rights>Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the associated terms available at http://arxiv.org/abs/quant-ph/0502120.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2090065506?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,27925,37012,44590</link.rule.ids></links><search><creatorcontrib>L -M Duan</creatorcontrib><creatorcontrib>Raussendorf, R</creatorcontrib><title>Efficient quantum computation with probabilistic quantum gates</title><title>arXiv.org</title><description>With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability \(p\). The required computational overhead scales efficiently both with \(1/p\) and \(n\), where \(n\) is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability \(1-p\) far beyond any threshold requirement.</description><subject>Computational efficiency</subject><subject>Qubits (quantum computing)</subject><subject>Statistical analysis</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNjrEOgjAURRsTE4myOjdxBh8tRVxcDMYPcCeFFH0EWqCt-vkyGGenM9xzk0PINoE4zYWAvZze-IxBAEsYLEjAOE-iPGVsRUJrWwBg2YEJwQNyKpoGa1Ta0dFL7XxPa9MP3kmHRtMXugcdJlPJCju0DuufdpdO2Q1ZNrKzKvxyTXaX4na-RvNn9Mq6sjV-0vNUMjgCZHNexv-zPn8nPt4</recordid><startdate>20050218</startdate><enddate>20050218</enddate><creator>L -M Duan</creator><creator>Raussendorf, R</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></search><sort><creationdate>20050218</creationdate><title>Efficient quantum computation with probabilistic quantum gates</title><author>L -M Duan ; Raussendorf, R</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20900655063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Computational efficiency</topic><topic>Qubits (quantum computing)</topic><topic>Statistical analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>L -M Duan</creatorcontrib><creatorcontrib>Raussendorf, R</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest - 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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>L -M Duan</au><au>Raussendorf, R</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Efficient quantum computation with probabilistic quantum gates</atitle><jtitle>arXiv.org</jtitle><date>2005-02-18</date><risdate>2005</risdate><eissn>2331-8422</eissn><abstract>With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability \(p\). The required computational overhead scales efficiently both with \(1/p\) and \(n\), where \(n\) is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability \(1-p\) far beyond any threshold requirement.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0502120</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2005-02
issn 2331-8422
language eng
recordid cdi_proquest_journals_2090065506
source ProQuest - Publicly Available Content Database
subjects Computational efficiency
Qubits (quantum computing)
Statistical analysis
title Efficient quantum computation with probabilistic quantum gates
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T14%3A15%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Efficient%20quantum%20computation%20with%20probabilistic%20quantum%20gates&rft.jtitle=arXiv.org&rft.au=L%20-M%20Duan&rft.date=2005-02-18&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0502120&rft_dat=%3Cproquest%3E2090065506%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20900655063%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2090065506&rft_id=info:pmid/&rfr_iscdi=true