CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Dualities and identities for entanglement-assisted quantum codes
Authors
Todd A. Brun
Ching Yi Lai
Mark M. Wilde
Publication date
19 November 2013
Publisher
LSU Digital Commons
Doi
Cite
View
on
arXiv
Abstract
The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from exchanging the original code\u27s information qubits with its ebits. To introduce this notion, we show how entanglement-assisted repetition codes and accumulator codes are dual to each other, much like their classical counterparts, and we give an explicit, general quantum shift-register circuit that encodes both classes of codes. We later show that our constructions are optimal, and this result completes our understanding of these dual classes of codes. We also establish the Gilbert-Varshamov bound and the Plotkin bound for EAQEC codes, and we use these to examine the existence of some EAQEC codes. Finally, we provide upper bounds on the block error probability when transmitting maximal-entanglement EAQEC codes over the depolarizing channel, and we derive variations of the hashing bound for EAQEC codes, which is a lower bound on the maximum rate at which reliable communication over Pauli channels is possible with the use of pre-shared entanglement. © 2013 Springer Science+Business Media New York
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Louisiana State University
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.lsu.edu:physics...
Last time updated on 26/10/2023