Bounds on the Power of Constant-Depth Quantum Circuits

Bounds on the Power of Constant-Depth Quantum Circuits

We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 is contained in P, where EQNC^0 is the constant-depth analog of the cla...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Fenner, Stephen, Green, Frederic, Homer, Steven, Zhang, Yong
Format: Artikel
Sprache:eng
Schlagworte:
Physics - Quantum Physics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Fenner, Stephen
Green, Frederic
Homer, Steven
Zhang, Yong
description We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 is contained in P, where EQNC^0 is the constant-depth analog of the class EQP. On the other hand, we adapt and extend ideas of Terhal and DiVincenzo (quant-ph/0205133) to show that, for any family F of quantum gates including Hadamard and CNOT gates, computing the acceptance probabilities of depth-five circuits over F is just as hard as computing these probabilities for circuits over F. In particular, this implies that NQNC^0 = NQACC = NQP = coC=P where NQNC^0 is the constant-depth analog of the class NQP. This essentially refutes a conjecture of Green et al. that NQACC is contained in TC^0 (quant-ph/0106017).
doi_str_mv 10.48550/arxiv.quant-ph/0312209
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_quant_ph_0312209</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>quant_ph_0312209</sourcerecordid><originalsourceid>FETCH-LOGICAL-a799-52ea8be8584bbe24a0c375d4b5f7779b37e06b98434c00d7dfd765d5b7dc66ed3</originalsourceid><addsrcrecordid>eNotj8tuwjAURL3poqJ8Q71hGTDx49rLNgWKhEQrsY_s-EaJBHHqOC38fcVjNZuZozmEvC7ZXGgp2cLGc_s7_xltl7K-WTC-zHNmnol6D2PnBxo6mhqkX-EPIw01LUI3pGv5A_vU0O_rcDzRoo3V2KbhhTzV9jjg9JETclivDsVntttvtsXbLrNgTCZztNqhllo4h7mwrOIgvXCyBgDjOCBTzmjBRcWYB197UNJLB75SCj2fkNkde7tf9rE92Xgpbxpl35QPDf4P0iFF4w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Bounds on the Power of Constant-Depth Quantum Circuits</title><source>arXiv.org</source><creator>Fenner, Stephen ; Green, Frederic ; Homer, Steven ; Zhang, Yong</creator><creatorcontrib>Fenner, Stephen ; Green, Frederic ; Homer, Steven ; Zhang, Yong</creatorcontrib><description>We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 is contained in P, where EQNC^0 is the constant-depth analog of the class EQP. On the other hand, we adapt and extend ideas of Terhal and DiVincenzo (quant-ph/0205133) to show that, for any family F of quantum gates including Hadamard and CNOT gates, computing the acceptance probabilities of depth-five circuits over F is just as hard as computing these probabilities for circuits over F. In particular, this implies that NQNC^0 = NQACC = NQP = coC=P where NQNC^0 is the constant-depth analog of the class NQP. This essentially refutes a conjecture of Green et al. that NQACC is contained in TC^0 (quant-ph/0106017).</description><identifier>DOI: 10.48550/arxiv.quant-ph/0312209</identifier><language>eng</language><subject>Physics - Quantum Physics</subject><creationdate>2003-12</creationdate><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,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/quant-ph/0312209$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.quant-ph/0312209$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Fenner, Stephen</creatorcontrib><creatorcontrib>Green, Frederic</creatorcontrib><creatorcontrib>Homer, Steven</creatorcontrib><creatorcontrib>Zhang, Yong</creatorcontrib><title>Bounds on the Power of Constant-Depth Quantum Circuits</title><description>We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 is contained in P, where EQNC^0 is the constant-depth analog of the class EQP. On the other hand, we adapt and extend ideas of Terhal and DiVincenzo (quant-ph/0205133) to show that, for any family F of quantum gates including Hadamard and CNOT gates, computing the acceptance probabilities of depth-five circuits over F is just as hard as computing these probabilities for circuits over F. In particular, this implies that NQNC^0 = NQACC = NQP = coC=P where NQNC^0 is the constant-depth analog of the class NQP. This essentially refutes a conjecture of Green et al. that NQACC is contained in TC^0 (quant-ph/0106017).</description><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tuwjAURL3poqJ8Q71hGTDx49rLNgWKhEQrsY_s-EaJBHHqOC38fcVjNZuZozmEvC7ZXGgp2cLGc_s7_xltl7K-WTC-zHNmnol6D2PnBxo6mhqkX-EPIw01LUI3pGv5A_vU0O_rcDzRoo3V2KbhhTzV9jjg9JETclivDsVntttvtsXbLrNgTCZztNqhllo4h7mwrOIgvXCyBgDjOCBTzmjBRcWYB197UNJLB75SCj2fkNkde7tf9rE92Xgpbxpl35QPDf4P0iFF4w</recordid><startdate>20031228</startdate><enddate>20031228</enddate><creator>Fenner, Stephen</creator><creator>Green, Frederic</creator><creator>Homer, Steven</creator><creator>Zhang, Yong</creator><scope>GOX</scope></search><sort><creationdate>20031228</creationdate><title>Bounds on the Power of Constant-Depth Quantum Circuits</title><author>Fenner, Stephen ; Green, Frederic ; Homer, Steven ; Zhang, Yong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a799-52ea8be8584bbe24a0c375d4b5f7779b37e06b98434c00d7dfd765d5b7dc66ed3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Fenner, Stephen</creatorcontrib><creatorcontrib>Green, Frederic</creatorcontrib><creatorcontrib>Homer, Steven</creatorcontrib><creatorcontrib>Zhang, Yong</creatorcontrib><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fenner, Stephen</au><au>Green, Frederic</au><au>Homer, Steven</au><au>Zhang, Yong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bounds on the Power of Constant-Depth Quantum Circuits</atitle><date>2003-12-28</date><risdate>2003</risdate><abstract>We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 is contained in P, where EQNC^0 is the constant-depth analog of the class EQP. On the other hand, we adapt and extend ideas of Terhal and DiVincenzo (quant-ph/0205133) to show that, for any family F of quantum gates including Hadamard and CNOT gates, computing the acceptance probabilities of depth-five circuits over F is just as hard as computing these probabilities for circuits over F. In particular, this implies that NQNC^0 = NQACC = NQP = coC=P where NQNC^0 is the constant-depth analog of the class NQP. This essentially refutes a conjecture of Green et al. that NQACC is contained in TC^0 (quant-ph/0106017).</abstract><doi>10.48550/arxiv.quant-ph/0312209</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.quant-ph/0312209
ispartof
issn
language eng
recordid cdi_arxiv_primary_quant_ph_0312209
source arXiv.org
subjects Physics - Quantum Physics
title Bounds on the Power of Constant-Depth Quantum Circuits
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T12%3A50%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Bounds%20on%20the%20Power%20of%20Constant-Depth%20Quantum%20Circuits&rft.au=Fenner,%20Stephen&rft.date=2003-12-28&rft_id=info:doi/10.48550/arxiv.quant-ph/0312209&rft_dat=%3Carxiv_GOX%3Equant_ph_0312209%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true