By Topic

Information rates achievable with algebraic codes on quantum discrete memoryless channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hamada, M. ; Tamagawa Univ. Res. Inst., Tokyo

The highest information rate at which quantum error-correction schemes work reliably on a channel is called the quantum capacity. Here this is proven to be lower-bounded by the limit of coherent information maximized over the set of input density operators which are proportional to the projections onto the code spaces of symplectic stabilizer codes. The quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a completely positive linear map on a Hilbert space of finite dimension. The codes that are proven to have the desired performance are symplectic stabilizer codes. On the depolarizing channel, the bound proven here is actually the highest possible rate at which symplectic stabilizer codes work reliably

Published in:

Information Theory, IEEE Transactions on  (Volume:51 ,  Issue: 12 )