Loading…
Entanglement-assisted quantum error correction codes with length $$n=q^2+1
In this paper, by investigating q2-cyclotomic coset modulo rn in detail, where q is a prime power, n=q2+1 and r∣(q+1), series of entanglement-assisted quantum error correction (EAQEC) codes with flexible parameters of length n are constructed from constacyclic codes (including cyclic codes). Most of...
Saved in:
Published in: | Quantum information processing 2019-09, Vol.18 (9), p.1-21, Article 292 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c1181-97c15530899a3cd77b827122a3c80c4b7e8d105e04ce29b4d2edc4cb94448843 |
---|---|
cites | cdi_FETCH-LOGICAL-c1181-97c15530899a3cd77b827122a3c80c4b7e8d105e04ce29b4d2edc4cb94448843 |
container_end_page | 21 |
container_issue | 9 |
container_start_page | 1 |
container_title | Quantum information processing |
container_volume | 18 |
creator | Wang, Junli Li, Ruihu Lv, Jingjie Guo, Guanmin Liu, Yang |
description | In this paper, by investigating q2-cyclotomic coset modulo rn in detail, where q is a prime power, n=q2+1 and r∣(q+1), series of entanglement-assisted quantum error correction (EAQEC) codes with flexible parameters of length n are constructed from constacyclic codes (including cyclic codes). Most of our EAQEC codes are new and have large minimum distance. As to EAQEC codes constructed from cyclic codes, their all possible parameters are determined completely. When minimum distance d≤n+22, all of our constructed EAQEC codes are entanglement-assisted quantum MDS (EAQMDS) codes. Those previously known EAQMDS codes with the same length in Fan et al. (Quantum Inf Comput 16:423–434, 2016), Chen et al. (Quantum Inf Process 16(303):1–22, 2017), Lu et al. (Finite Fields Their Appl 53:309–325, 2018), Mustafa and Emre (Comput Appl Math 38(75):1–13, 2019) and Qian and Zhang (Quantum Inf Process 18(71):1–12, 2019) are special cases of ours. Besides, some maximum entanglement EAQEC codes and maximum entanglement EAQMDS codes are derived as well. |
doi_str_mv | 10.1007/s11128-019-2409-0 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2272761851</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2272761851</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1181-97c15530899a3cd77b827122a3c80c4b7e8d105e04ce29b4d2edc4cb94448843</originalsourceid><addsrcrecordid>eNotkE1LAzEYhIMoWKs_wNuCvUn0ffPRZA8eROoXBS89G3azb-uWNtsmWcR_79Z6mhkYZuBh7BrhDgHMfUJEYTlgyYWCksMJG6E2kqOU4vTPAwej9Tm7SGkNIHBqpyP2Pgu5CqsNbSlkXqXUpkxNse-rkPttQTF2sfBdjORz24XBNpSK7zZ_FRsKq0Emk_Cw_xS3eMnOltUm0dW_jtniebZ4euXzj5e3p8c594gWeWk8ai3BlmUlfWNMbYVBIYZgwavakG0QNIHyJMpaNYIar3xdKqWsVXLMbo6zu9jte0rZrbs-huHRCWGEmaLVOLTw2PKxSynS0u1iu63ij0NwB2LuSMwNxNyBmAP5C3ggXOY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2272761851</pqid></control><display><type>article</type><title>Entanglement-assisted quantum error correction codes with length $$n=q^2+1</title><source>Springer Link</source><creator>Wang, Junli ; Li, Ruihu ; Lv, Jingjie ; Guo, Guanmin ; Liu, Yang</creator><creatorcontrib>Wang, Junli ; Li, Ruihu ; Lv, Jingjie ; Guo, Guanmin ; Liu, Yang</creatorcontrib><description>In this paper, by investigating q2-cyclotomic coset modulo rn in detail, where q is a prime power, n=q2+1 and r∣(q+1), series of entanglement-assisted quantum error correction (EAQEC) codes with flexible parameters of length n are constructed from constacyclic codes (including cyclic codes). Most of our EAQEC codes are new and have large minimum distance. As to EAQEC codes constructed from cyclic codes, their all possible parameters are determined completely. When minimum distance d≤n+22, all of our constructed EAQEC codes are entanglement-assisted quantum MDS (EAQMDS) codes. Those previously known EAQMDS codes with the same length in Fan et al. (Quantum Inf Comput 16:423–434, 2016), Chen et al. (Quantum Inf Process 16(303):1–22, 2017), Lu et al. (Finite Fields Their Appl 53:309–325, 2018), Mustafa and Emre (Comput Appl Math 38(75):1–13, 2019) and Qian and Zhang (Quantum Inf Process 18(71):1–12, 2019) are special cases of ours. Besides, some maximum entanglement EAQEC codes and maximum entanglement EAQMDS codes are derived as well.</description><identifier>ISSN: 1570-0755</identifier><identifier>EISSN: 1573-1332</identifier><identifier>DOI: 10.1007/s11128-019-2409-0</identifier><language>eng</language><publisher>Dordrecht: Springer Nature B.V</publisher><subject>Binary system ; Codes ; Entanglement ; Error correction ; Error correction & detection ; Fields (mathematics) ; Parameters</subject><ispartof>Quantum information processing, 2019-09, Vol.18 (9), p.1-21, Article 292</ispartof><rights>Copyright Springer Nature B.V. 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1181-97c15530899a3cd77b827122a3c80c4b7e8d105e04ce29b4d2edc4cb94448843</citedby><cites>FETCH-LOGICAL-c1181-97c15530899a3cd77b827122a3c80c4b7e8d105e04ce29b4d2edc4cb94448843</cites><orcidid>0000-0003-2416-0669</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,786,790,27957,27958</link.rule.ids></links><search><creatorcontrib>Wang, Junli</creatorcontrib><creatorcontrib>Li, Ruihu</creatorcontrib><creatorcontrib>Lv, Jingjie</creatorcontrib><creatorcontrib>Guo, Guanmin</creatorcontrib><creatorcontrib>Liu, Yang</creatorcontrib><title>Entanglement-assisted quantum error correction codes with length $$n=q^2+1</title><title>Quantum information processing</title><description>In this paper, by investigating q2-cyclotomic coset modulo rn in detail, where q is a prime power, n=q2+1 and r∣(q+1), series of entanglement-assisted quantum error correction (EAQEC) codes with flexible parameters of length n are constructed from constacyclic codes (including cyclic codes). Most of our EAQEC codes are new and have large minimum distance. As to EAQEC codes constructed from cyclic codes, their all possible parameters are determined completely. When minimum distance d≤n+22, all of our constructed EAQEC codes are entanglement-assisted quantum MDS (EAQMDS) codes. Those previously known EAQMDS codes with the same length in Fan et al. (Quantum Inf Comput 16:423–434, 2016), Chen et al. (Quantum Inf Process 16(303):1–22, 2017), Lu et al. (Finite Fields Their Appl 53:309–325, 2018), Mustafa and Emre (Comput Appl Math 38(75):1–13, 2019) and Qian and Zhang (Quantum Inf Process 18(71):1–12, 2019) are special cases of ours. Besides, some maximum entanglement EAQEC codes and maximum entanglement EAQMDS codes are derived as well.</description><subject>Binary system</subject><subject>Codes</subject><subject>Entanglement</subject><subject>Error correction</subject><subject>Error correction & detection</subject><subject>Fields (mathematics)</subject><subject>Parameters</subject><issn>1570-0755</issn><issn>1573-1332</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNotkE1LAzEYhIMoWKs_wNuCvUn0ffPRZA8eROoXBS89G3azb-uWNtsmWcR_79Z6mhkYZuBh7BrhDgHMfUJEYTlgyYWCksMJG6E2kqOU4vTPAwej9Tm7SGkNIHBqpyP2Pgu5CqsNbSlkXqXUpkxNse-rkPttQTF2sfBdjORz24XBNpSK7zZ_FRsKq0Emk_Cw_xS3eMnOltUm0dW_jtniebZ4euXzj5e3p8c594gWeWk8ai3BlmUlfWNMbYVBIYZgwavakG0QNIHyJMpaNYIar3xdKqWsVXLMbo6zu9jte0rZrbs-huHRCWGEmaLVOLTw2PKxSynS0u1iu63ij0NwB2LuSMwNxNyBmAP5C3ggXOY</recordid><startdate>201909</startdate><enddate>201909</enddate><creator>Wang, Junli</creator><creator>Li, Ruihu</creator><creator>Lv, Jingjie</creator><creator>Guo, Guanmin</creator><creator>Liu, Yang</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-2416-0669</orcidid></search><sort><creationdate>201909</creationdate><title>Entanglement-assisted quantum error correction codes with length $$n=q^2+1</title><author>Wang, Junli ; Li, Ruihu ; Lv, Jingjie ; Guo, Guanmin ; Liu, Yang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1181-97c15530899a3cd77b827122a3c80c4b7e8d105e04ce29b4d2edc4cb94448843</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Binary system</topic><topic>Codes</topic><topic>Entanglement</topic><topic>Error correction</topic><topic>Error correction & detection</topic><topic>Fields (mathematics)</topic><topic>Parameters</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Junli</creatorcontrib><creatorcontrib>Li, Ruihu</creatorcontrib><creatorcontrib>Lv, Jingjie</creatorcontrib><creatorcontrib>Guo, Guanmin</creatorcontrib><creatorcontrib>Liu, Yang</creatorcontrib><collection>CrossRef</collection><jtitle>Quantum information processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Junli</au><au>Li, Ruihu</au><au>Lv, Jingjie</au><au>Guo, Guanmin</au><au>Liu, Yang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Entanglement-assisted quantum error correction codes with length $$n=q^2+1</atitle><jtitle>Quantum information processing</jtitle><date>2019-09</date><risdate>2019</risdate><volume>18</volume><issue>9</issue><spage>1</spage><epage>21</epage><pages>1-21</pages><artnum>292</artnum><issn>1570-0755</issn><eissn>1573-1332</eissn><abstract>In this paper, by investigating q2-cyclotomic coset modulo rn in detail, where q is a prime power, n=q2+1 and r∣(q+1), series of entanglement-assisted quantum error correction (EAQEC) codes with flexible parameters of length n are constructed from constacyclic codes (including cyclic codes). Most of our EAQEC codes are new and have large minimum distance. As to EAQEC codes constructed from cyclic codes, their all possible parameters are determined completely. When minimum distance d≤n+22, all of our constructed EAQEC codes are entanglement-assisted quantum MDS (EAQMDS) codes. Those previously known EAQMDS codes with the same length in Fan et al. (Quantum Inf Comput 16:423–434, 2016), Chen et al. (Quantum Inf Process 16(303):1–22, 2017), Lu et al. (Finite Fields Their Appl 53:309–325, 2018), Mustafa and Emre (Comput Appl Math 38(75):1–13, 2019) and Qian and Zhang (Quantum Inf Process 18(71):1–12, 2019) are special cases of ours. Besides, some maximum entanglement EAQEC codes and maximum entanglement EAQMDS codes are derived as well.</abstract><cop>Dordrecht</cop><pub>Springer Nature B.V</pub><doi>10.1007/s11128-019-2409-0</doi><tpages>21</tpages><orcidid>https://orcid.org/0000-0003-2416-0669</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1570-0755 |
ispartof | Quantum information processing, 2019-09, Vol.18 (9), p.1-21, Article 292 |
issn | 1570-0755 1573-1332 |
language | eng |
recordid | cdi_proquest_journals_2272761851 |
source | Springer Link |
subjects | Binary system Codes Entanglement Error correction Error correction & detection Fields (mathematics) Parameters |
title | Entanglement-assisted quantum error correction codes with length $$n=q^2+1 |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-21T10%3A00%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Entanglement-assisted%20quantum%20error%20correction%20codes%20with%20length%20$$n=q%5E2+1&rft.jtitle=Quantum%20information%20processing&rft.au=Wang,%20Junli&rft.date=2019-09&rft.volume=18&rft.issue=9&rft.spage=1&rft.epage=21&rft.pages=1-21&rft.artnum=292&rft.issn=1570-0755&rft.eissn=1573-1332&rft_id=info:doi/10.1007/s11128-019-2409-0&rft_dat=%3Cproquest_cross%3E2272761851%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1181-97c15530899a3cd77b827122a3c80c4b7e8d105e04ce29b4d2edc4cb94448843%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2272761851&rft_id=info:pmid/&rfr_iscdi=true |