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...
Springer US
Copyright © 2015 by Springer Science+Business Media New York
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
Publisher site
See Article on Publisher Site


  • 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 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

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

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.



billed annually
Start Free Trial

14-day Free Trial