# What is the Holevo-Schumacher-Westmoreland capacity of a Pauli channel?

+ 10 like - 0 dislike
178 views

Suppose you are given an $n$-qubit quantum channel defined as $\mathcal{E}(\rho) = \sum_{i} p_i X_i \rho X_i^\dagger$, where $X_i$ denotes an $n$-fold tensor product of Pauli matrices and $\{p_i\}$ is a probability distribution. The Holevo-Schumacher-Westmoreland capacity of the channel is defined by $$\chi(\mathcal{E}) = \max_{\{q_j, \rho_j\}} \left[S\left(\sum_j q_j \rho_j\right) -\sum_j q_j S\left(\rho_j\right) \right],$$ where $S$ denotes the von Neumann entropy of a density matrix (see, for example, http://theory.physics.helsinki.fi/~kvanttilaskenta/Lecture13.pdf). Is it known how to calculate this number as a function of $p_i$ and $n$?

This post has been migrated from (A51.SE)
asked Oct 26, 2011

Finding the HSW capacity is an optimization problem which I believe is moderately tractable. There is an iterative numerical method outlined in this paper of mine ("Capacities of quantum channels and how to find them."). A different, although somewhat similar, method was detailed in the paper "Qubit channels which require four inputs to achieve capacity: implications for additivity conjectures" by Masahito Hayashi, Hiroshi Imai, Keiji Matsumoto, Mary Beth Ruskai and Toshiyuki Shimono. If the number of qubits $n$ is not quite small, however, the high dimensionality of the space is going to keep these techniques from working.
 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): Email me at this address if my answer is selected or commented on: 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:p$\hbar$ysic$\varnothing$OverflowThen 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). To avoid this verification in future, please log in or register.