Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Quantum channel
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== The cb-norm of a channel === Before giving the definition of channel capacity, the preliminary notion of the '''norm of complete boundedness''', or '''cb-norm''' of a channel needs to be discussed. When considering the capacity of a channel <math>\Phi</math>, we need to compare it with an "ideal channel" <math>\Lambda</math> . For instance, when the input and output algebras are identical, we can choose <math>\Lambda</math> to be the identity map. Such a comparison requires a [[metric (mathematics)|metric]] between channels. Since a channel can be viewed as a linear operator, it is tempting to use the natural [[operator norm]]. In other words, the closeness of <math>\Phi</math> to the ideal channel <math>\Lambda</math> can be defined by :<math>\| \Phi - \Lambda \| = \sup \{ \| (\Phi - \Lambda)(A)\| \;|\; \|A\| \leq 1 \}.</math> However, the operator norm may increase when we tensor <math>\Phi</math> with the identity map on some ancilla. To make the operator norm even a more undesirable candidate, the quantity :<math>\| \Phi \otimes I_n \|</math> may increase without bound as <math>n \rightarrow \infty.</math> The solution is to introduce, for any linear map <math>\Phi</math> between C*-algebras, the cb-norm :<math>\| \Phi \|_{cb} = \sup _n \| \Phi \otimes I_n \|.</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)