Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes

In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum en...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2014-06, Vol.60 (6), p.3104-3116
1. Verfasser: Ashikhmin, Alexei
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 3116
container_issue 6
container_start_page 3104
container_title IEEE transactions on information theory
container_volume 60
creator Ashikhmin, Alexei
description In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum enumerators for obtaining lower bounds on the average fidelity of these ensembles. We further improve the fidelity bounds by estimating the quantum enumerators of expurgated ensembles of stabilizer and CSS codes. Finally, we derive fidelity bounds in the asymptotic regime when the code length tends to infinity. These results tell us which code rate we can afford for achieving a target fidelity with codes of a given length. The results also show that in symmetric depolarizing channel a typical stabilizer code has better performance, in terms of fidelity and code rate, compared with a typical CSS codes, and that balanced CSS codes significantly outperform other CSS codes. Asymptotic results demonstrate that CSS codes have a fundamental performance loss compared with stabilizer codes.
doi_str_mv 10.1109/TIT.2014.2303801
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1531094875</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6763069</ieee_id><sourcerecordid>3321775651</sourcerecordid><originalsourceid>FETCH-LOGICAL-c354t-4e98717a348aaf478728032c8330b66baec0ce7e44d48bd43aa8b117498eaf663</originalsourceid><addsrcrecordid>eNpdkMFLwzAUh4MoOKd3wUtBBC-dSZMmqTcdTgcDkc1zeG1fIaNrZtIi8683Y8ODp5C87_fey0fINaMTxmjxsJqvJhllYpJxyjVlJ2TE8lylhczFKRlRynRaCKHPyUUI63gVOctG5HFma2xtv0sW7ht98uyGrg5J43yy7KG0rf2Jr9DVyXS5TD4G6Pphk0xdjeGSnDXQBrw6nmPyOXtZTd_SxfvrfPq0SCueiz4VWGjFFHChARqhtMo05VmlOaellCVgRStUKEQtdFkLDqBLxpQoNEIjJR-T-0PfrXdfA4bebGyosG2hQzcEE79ZxAGZ5BG9_Yeu3eC7uF2keNQktMojRQ9U5V0IHhuz9XYDfmcYNXuZJso0e5nmKDNG7o6NIVTQNh66yoa_XKYl5UqqyN0cOIuIf2WpJKey4L8Mj3pB</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1531094875</pqid></control><display><type>article</type><title>Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes</title><source>IEEE Electronic Library (IEL)</source><creator>Ashikhmin, Alexei</creator><creatorcontrib>Ashikhmin, Alexei</creatorcontrib><description>In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum enumerators for obtaining lower bounds on the average fidelity of these ensembles. We further improve the fidelity bounds by estimating the quantum enumerators of expurgated ensembles of stabilizer and CSS codes. Finally, we derive fidelity bounds in the asymptotic regime when the code length tends to infinity. These results tell us which code rate we can afford for achieving a target fidelity with codes of a given length. The results also show that in symmetric depolarizing channel a typical stabilizer code has better performance, in terms of fidelity and code rate, compared with a typical CSS codes, and that balanced CSS codes significantly outperform other CSS codes. Asymptotic results demonstrate that CSS codes have a fundamental performance loss compared with stabilizer codes.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2014.2303801</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Arrays ; Asymptotic methods ; Asymptotic properties ; Balancing ; Cascading style sheets ; Channels ; Codes ; Comparative analysis ; Estimates ; Exact sciences and technology ; Infinity ; Information theory ; Information, signal and communications theory ; Linear codes ; Lower bounds ; Mathematical analysis ; Quantum computing ; Quantum mechanics ; Telecommunications and information theory ; Vectors</subject><ispartof>IEEE transactions on information theory, 2014-06, Vol.60 (6), p.3104-3116</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c354t-4e98717a348aaf478728032c8330b66baec0ce7e44d48bd43aa8b117498eaf663</citedby><cites>FETCH-LOGICAL-c354t-4e98717a348aaf478728032c8330b66baec0ce7e44d48bd43aa8b117498eaf663</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6763069$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6763069$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=28603767$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Ashikhmin, Alexei</creatorcontrib><title>Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum enumerators for obtaining lower bounds on the average fidelity of these ensembles. We further improve the fidelity bounds by estimating the quantum enumerators of expurgated ensembles of stabilizer and CSS codes. Finally, we derive fidelity bounds in the asymptotic regime when the code length tends to infinity. These results tell us which code rate we can afford for achieving a target fidelity with codes of a given length. The results also show that in symmetric depolarizing channel a typical stabilizer code has better performance, in terms of fidelity and code rate, compared with a typical CSS codes, and that balanced CSS codes significantly outperform other CSS codes. Asymptotic results demonstrate that CSS codes have a fundamental performance loss compared with stabilizer codes.</description><subject>Applied sciences</subject><subject>Arrays</subject><subject>Asymptotic methods</subject><subject>Asymptotic properties</subject><subject>Balancing</subject><subject>Cascading style sheets</subject><subject>Channels</subject><subject>Codes</subject><subject>Comparative analysis</subject><subject>Estimates</subject><subject>Exact sciences and technology</subject><subject>Infinity</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Linear codes</subject><subject>Lower bounds</subject><subject>Mathematical analysis</subject><subject>Quantum computing</subject><subject>Quantum mechanics</subject><subject>Telecommunications and information theory</subject><subject>Vectors</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkMFLwzAUh4MoOKd3wUtBBC-dSZMmqTcdTgcDkc1zeG1fIaNrZtIi8683Y8ODp5C87_fey0fINaMTxmjxsJqvJhllYpJxyjVlJ2TE8lylhczFKRlRynRaCKHPyUUI63gVOctG5HFma2xtv0sW7ht98uyGrg5J43yy7KG0rf2Jr9DVyXS5TD4G6Pphk0xdjeGSnDXQBrw6nmPyOXtZTd_SxfvrfPq0SCueiz4VWGjFFHChARqhtMo05VmlOaellCVgRStUKEQtdFkLDqBLxpQoNEIjJR-T-0PfrXdfA4bebGyosG2hQzcEE79ZxAGZ5BG9_Yeu3eC7uF2keNQktMojRQ9U5V0IHhuz9XYDfmcYNXuZJso0e5nmKDNG7o6NIVTQNh66yoa_XKYl5UqqyN0cOIuIf2WpJKey4L8Mj3pB</recordid><startdate>20140601</startdate><enddate>20140601</enddate><creator>Ashikhmin, Alexei</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7U5</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20140601</creationdate><title>Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes</title><author>Ashikhmin, Alexei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c354t-4e98717a348aaf478728032c8330b66baec0ce7e44d48bd43aa8b117498eaf663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Applied sciences</topic><topic>Arrays</topic><topic>Asymptotic methods</topic><topic>Asymptotic properties</topic><topic>Balancing</topic><topic>Cascading style sheets</topic><topic>Channels</topic><topic>Codes</topic><topic>Comparative analysis</topic><topic>Estimates</topic><topic>Exact sciences and technology</topic><topic>Infinity</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Linear codes</topic><topic>Lower bounds</topic><topic>Mathematical analysis</topic><topic>Quantum computing</topic><topic>Quantum mechanics</topic><topic>Telecommunications and information theory</topic><topic>Vectors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ashikhmin, Alexei</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ashikhmin, Alexei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2014-06-01</date><risdate>2014</risdate><volume>60</volume><issue>6</issue><spage>3104</spage><epage>3116</epage><pages>3104-3116</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum enumerators for obtaining lower bounds on the average fidelity of these ensembles. We further improve the fidelity bounds by estimating the quantum enumerators of expurgated ensembles of stabilizer and CSS codes. Finally, we derive fidelity bounds in the asymptotic regime when the code length tends to infinity. These results tell us which code rate we can afford for achieving a target fidelity with codes of a given length. The results also show that in symmetric depolarizing channel a typical stabilizer code has better performance, in terms of fidelity and code rate, compared with a typical CSS codes, and that balanced CSS codes significantly outperform other CSS codes. Asymptotic results demonstrate that CSS codes have a fundamental performance loss compared with stabilizer codes.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2014.2303801</doi><tpages>13</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 2014-06, Vol.60 (6), p.3104-3116
issn 0018-9448
1557-9654
language eng
recordid cdi_proquest_journals_1531094875
source IEEE Electronic Library (IEL)
subjects Applied sciences
Arrays
Asymptotic methods
Asymptotic properties
Balancing
Cascading style sheets
Channels
Codes
Comparative analysis
Estimates
Exact sciences and technology
Infinity
Information theory
Information, signal and communications theory
Linear codes
Lower bounds
Mathematical analysis
Quantum computing
Quantum mechanics
Telecommunications and information theory
Vectors
title Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T05%3A13%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fidelity%20Lower%20Bounds%20for%20Stabilizer%20and%20CSS%20Quantum%20Codes&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Ashikhmin,%20Alexei&rft.date=2014-06-01&rft.volume=60&rft.issue=6&rft.spage=3104&rft.epage=3116&rft.pages=3104-3116&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2014.2303801&rft_dat=%3Cproquest_RIE%3E3321775651%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1531094875&rft_id=info:pmid/&rft_ieee_id=6763069&rfr_iscdi=true