On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound

On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer formalism. Any quaternary (or binary) linear code can be used to construct EAQECCs under the entanglement-assisted (EA) formalism. We derive an EA-Griesmer bound for linear EAQECCs, which is a quantum analog of the Griesmer bound for classical codes. This EA-Griesmer bound is tighter than known bounds for EAQECCs in the literature. For a given quaternary linear code $$\mathcal {C}$$ C , we show that the parameters of the EAQECC that EA-stabilized by the dual of $$\mathcal {C}$$ C can be determined by a zero radical quaternary code induced from $$\mathcal {C}$$ C , and a necessary condition under which a linear EAQECC may achieve the EA-Griesmer bound is also presented. We construct four families of optimal EAQECCs and then show the necessary condition for existence of EAQECCs is also sufficient for some low-dimensional linear EAQECCs. The four families of optimal EAQECCs are degenerate codes and go beyond earlier constructions. What is more, except four codes, our $$[[n,k,d_{ea};c]]$$ [ [ n , k , d e a ; c ] ] codes are not equivalent to any $$[[n+c,k,d]]$$ [ [ n + c , k , d ] ] standard QECCs and have better error-correcting ability than any $$[[n+c,k,d]]$$ [ [ n + c , k , d ] ] QECCs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound

Loading next page...
 
/lp/springer_journal/on-entanglement-assisted-quantum-codes-achieving-the-entanglement-86Y8J3saUV
Publisher
Springer Journals
Copyright
Copyright © 2015 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-015-1143-5
Publisher site
See Article on Publisher Site

Abstract

The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer formalism. Any quaternary (or binary) linear code can be used to construct EAQECCs under the entanglement-assisted (EA) formalism. We derive an EA-Griesmer bound for linear EAQECCs, which is a quantum analog of the Griesmer bound for classical codes. This EA-Griesmer bound is tighter than known bounds for EAQECCs in the literature. For a given quaternary linear code $$\mathcal {C}$$ C , we show that the parameters of the EAQECC that EA-stabilized by the dual of $$\mathcal {C}$$ C can be determined by a zero radical quaternary code induced from $$\mathcal {C}$$ C , and a necessary condition under which a linear EAQECC may achieve the EA-Griesmer bound is also presented. We construct four families of optimal EAQECCs and then show the necessary condition for existence of EAQECCs is also sufficient for some low-dimensional linear EAQECCs. The four families of optimal EAQECCs are degenerate codes and go beyond earlier constructions. What is more, except four codes, our $$[[n,k,d_{ea};c]]$$ [ [ n , k , d e a ; c ] ] codes are not equivalent to any $$[[n+c,k,d]]$$ [ [ n + c , k , d ] ] standard QECCs and have better error-correcting ability than any $$[[n+c,k,d]]$$ [ [ n + c , k , d ] ] QECCs.

Journal

Quantum Information ProcessingSpringer Journals

Published: Oct 19, 2015

References

  • General entanglement-assisted quantum error-correcting codes
    Hsieh, MH; Devetak, I; Brun, T
  • High performance entanglement-assisted quantum LDPC codes need little entanglement
    Hsieh, MH; Yen, WT; Hsu, LY
  • Linear Plotkin bound for entanglement-assisted quantum codes
    Guo, L; Li, R
  • Quantum error correction via less noisy qubits
    Fujiwara, Y
  • Nonlocal quantum information in bipartite quantum error correction
    Wilde, Mark M; Fattal, David

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off