• Register
PhysicsOverflow is a next-generation academic platform for physicists and astronomers, including a community peer review system and a postgraduate-level discussion forum analogous to MathOverflow.

Welcome to PhysicsOverflow! PhysicsOverflow is an open platform for community peer review and graduate-level Physics discussion.

Please help promote PhysicsOverflow ads elsewhere if you like it.


PO is now at the Physics Department of Bielefeld University!

New printer friendly PO pages!

Migration to Bielefeld University was successful!

Please vote for this year's PhysicsOverflow ads!

Please do help out in categorising submissions. Submit a paper to PhysicsOverflow!

... see more

Tools for paper authors

Submit paper
Claim Paper Authorship

Tools for SE users

Search User
Reclaim SE Account
Request Account Merger
Nativise imported posts
Claim post (deleted users)
Import SE post

Users whose questions have been imported from Physics Stack Exchange, Theoretical Physics Stack Exchange, or any other Stack Exchange site are kindly requested to reclaim their account and not to register as a new user.

Public \(\beta\) tools

Report a bug with a feature
Request a new functionality
404 page design
Send feedback


(propose a free ad)

Site Statistics

205 submissions , 163 unreviewed
5,064 questions , 2,215 unanswered
5,347 answers , 22,728 comments
1,470 users with positive rep
818 active unimported users
More ...

  Quantum capacity for ensemble of Pauli channels

+ 5 like - 0 dislike

In Preskill's quantum computing notes Chapter 7 approximate page 82, he shows that a Pauli channel has capacity $Q \geq 1-H(p_I,p_X,p_Y,p_Z)$ where $H$ is Shannon entropy and $p_I, p_X, p_Y, p_Z$ are the probabilities of the channel acting like the appropriate Pauli matrix. In particular this gives us the 'hashing bound' or 'random coding bound' for the quantum capacity of the depolarizing channel $Q(p) \geq 1-H(p,1-p)-p\log_23$.

He then describes work of Shor and Smolin [1]: if you take a $m$-repetition code and concatenate it with a suitable random code you can do better than the hashing bound. The argument for this is that taking $m-1$ measurements the inner repetition code thought of as a super channel is a Pauli channel with entropy $H_i$. Then averaging over the $2^{m-1}$ possible classical measurements you can find the average entropy of the superchannel $\langle H \rangle$.

[1] P.W. Shor and J.A. Smolin, “Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome” quant-ph/9604006; D.P. DiVincen, P.W. Shor, and J.A. Smolin, “Quantum Channel Capacity of Very Noisy Channels,” quant-ph/9706061.

Then by random coding on this new channel you can achieve a rate $R=\frac{1-\langle H \rangle}{m}$ (dividing by $m$ to get this rate in bits/original channel use).

I don't see how random coding works. You have a random code which is optimal for each particular channel but how do you decide which one to use? By the time you know the classical measurements for your channel you have already sent the codeword.

So two questions:

1) If you have an ensemble of Pauli channels with average entropy $\langle H\rangle$, can you by using random coding achieve a rate $1-\langle H \rangle$?

2) If you can't do this, am I misinterpreting the results of Shor and Smolin or Preskill's exposition?

This post has been migrated from (A51.SE)
asked Feb 20, 2012 in Theoretical Physics by Martin Leslie (25 points) [ no revision ]

1 Answer

+ 3 like - 0 dislike

For your question (1), the answer is yes. The 'hashing construction' for quantum encoding is independent of the quantum channel you use, so if you use this construction for encoding, you can send information over an ensemble of Pauli channels at the right rate. (Actually, this is slightly incorrect ... you do need that the input state you use in the formula for coherent information is the same for all the channels, but in the construction discussed by Preskill it is.)

The original paper Shor and Smolin does not mention an ensemble of channels. If you take a depolarizing channel near the quantum-capacity threshold you can achieve a larger quantum capacity by considering a new superchannel where one signal of the superchannel is five consecutive uses of the original channel. When you apply the 'hashing bound' to this superchannel (acting on a 32-dimensional quantum space rather than a 2-dimensional one), you find that the formula for quantum capacity is larger than five times the formula for the original channel. There is only one channel being considered here: the superchannel composed of five uses of the original channel, and not an ensemble of channels. The ensemble of channels comes in when Preskill gives the intuition for what is happening in Shor-Smolin.

(And of course you should replace five in the above paragraph with the appropriate value of $m$, which is only five for some of these constructions.)

This post has been migrated from (A51.SE)
answered Feb 21, 2012 by Peter Shor (790 points) [ no revision ]
Oh, you're using the same type of random code for each channel anyway so there should exist a random code that is good for all the channels. I'll have to think a little bit about it but I'm pretty sure that's the answer. Thanks! As for your second paragraph I'm not sure if I'm putting words into Preskill's mouth or if he means to explain it the same way you do. But I think thanks to your answer the way I was trying to understand it does work.

This post has been migrated from (A51.SE)

Your answer

Please use answers only to (at least partly) answer questions. To comment, discuss, or ask for clarification, leave a comment instead.
To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL.
Please consult the FAQ for as to how to format your post.
This is the answer box; if you want to write a comment instead, please use the 'add comment' button.
Live preview (may slow down editor)   Preview
Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:
Then drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds).
Please complete the anti-spam verification

user contributions licensed under cc by-sa 3.0 with attribution required

Your rights