Maximal entanglement entanglement-assisted quantum codes constructed from linear codes

Maximal entanglement entanglement-assisted quantum codes constructed from linear codes An entanglement-assisted quantum error-correcting code (EAQECC) is a generalization of standard stabilizer quantum code. Maximal entanglement EAQECCs can achieve the EA-hashing bound asymptotically. In this work, the construction of quaternary zero radical codes is discussed, including the construction of low- dimensional quaternary codes for all code lengths and higher- dimensional quaternary codes for short lengths. Using the obtained quaternary codes, we construct many maximal entanglement EAQECCs with very good parameters. Some of these EAQECCs are optimal codes, and some of them are better than previously known ones. Combining these results with known bounds, we formulate a table of upper and lower bounds on the minimum distance of any maximal entanglement EAQECCs with length up to 20 channel qubits. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Maximal entanglement entanglement-assisted quantum codes constructed from linear codes

Loading next page...
 
/lp/springer_journal/maximal-entanglement-entanglement-assisted-quantum-codes-constructed-fLpIfiH6a4
Publisher
Springer Journals
Copyright
Copyright © 2014 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-014-0830-y
Publisher site
See Article on Publisher Site

Abstract

An entanglement-assisted quantum error-correcting code (EAQECC) is a generalization of standard stabilizer quantum code. Maximal entanglement EAQECCs can achieve the EA-hashing bound asymptotically. In this work, the construction of quaternary zero radical codes is discussed, including the construction of low- dimensional quaternary codes for all code lengths and higher- dimensional quaternary codes for short lengths. Using the obtained quaternary codes, we construct many maximal entanglement EAQECCs with very good parameters. Some of these EAQECCs are optimal codes, and some of them are better than previously known ones. Combining these results with known bounds, we formulate a table of upper and lower bounds on the minimum distance of any maximal entanglement EAQECCs with length up to 20 channel qubits.

Journal

Quantum Information ProcessingSpringer Journals

Published: Sep 26, 2014

References

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