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 operation
(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!
=== Statement of the theorem === '''Theorem'''.<ref>This theorem is proved in {{harvp|Nielsen|Chuang|2010}}, Theorems 8.1 and 8.3.</ref> Let <math>\mathcal H</math> and <math>\mathcal G</math> be Hilbert spaces of dimension <math>n</math> and <math>m</math> respectively, and <math>\Phi</math> be a quantum operation between <math>\mathcal H</math> and <math>\mathcal G</math>. Then, there are matrices <math display="block">\{ B_i \}_{1 \leq i \leq nm}</math> mapping <math>\mathcal H</math> to <math>\mathcal G</math> such that, for any state <math> \rho </math>, <math display="block"> \Phi(\rho) = \sum_i B_i \rho B_i^*.</math> Conversely, any map <math> \Phi </math> of this form is a quantum operation provided <math display="inline">\sum_k B_k^* B_k \leq \mathbf{1}</math>. The matrices <math>\{ B_i \}</math> are called ''Kraus operators''. (Sometimes they are known as ''noise operators'' or ''error operators'', especially in the context of [[quantum information processing]], where the quantum operation represents the noisy, error-producing effects of the environment.) The [[Stinespring factorization theorem]] extends the above result to arbitrary separable Hilbert spaces ''H'' and ''G''. There, ''S'' is replaced by a trace class operator and <math>\{ B_i \}</math> by a sequence of bounded operators.
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)