CSE 599d - Quantum Computing Mixed Quantum States and Open Quantum Systems

نویسنده

  • Dave Bacon
چکیده

So far we have been dealing with quantum states which are what are known as pure quantum states. Here pure refers to the fact that our description of the system is entirely quantum mechanical. But we saw when we were discussing our information processing machines, that there were these equally valid probabilistic machines that had their own equally valid formulation. Is there a way to include the latter within the confines of the former and in particular to mix quantum descriptions with classical descriptions? This leads us to what are known as mixed quantum states which we will discuss in this lecture. Another reason to care about mixed quantum states is to deal with the case where we have only part of a quantum system. Thus, for instance, we may have the entangle two qubit state 1 √ 2 (|00〉+ |11〉). Now of course we can always figure out what quantum theory predict for our half of this quantum system by just acknowledging that this is the true description of the quantum system. But often it is convenient to discuss just one half of this quantum state, i.e. we are looking for a description of one of the two qubits for this state. It is important to realize that we must always use such descriptions appropriately: just because our description of one half is different than that of the whole does not mean that the state has changed in any way! It will turn out that the appropriate way to discuss quantum systems like this is to again consider mixed quantum states.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CSE 599d - Quantum Computing Introduction to Quantum Error Correction

In the last lecture we saw that open quantum systems could interact with an environment and that this coupling could turn pure states into mixed states. As we have argued before, this is a bad process, because it can lessen or destroy the interference effects which are vital to distinguishing a quantum from a classical computer. This is called the decoherence problem. In this lecture we will be...

متن کامل

CSE 599d - Quantum Computing When Quantum Computers Fall Apart

In this lecture we are going to begin discussing what happens to quantum computers when we move away from the closed system view of quantum theory and encounter the reality that real quantum system are open quantum systems. Open quantum systems interact with their environment and decohere. When we try to control real quantum systems, we aren’t able to perfectly control them. When we try to perf...

متن کامل

CSE 599d - Quantum Computing Fault-Tolerant Quantum Computation and the Threshold Theorem

The theory of quantum error correcting codes was designed to deal with a setting where we can encode our quantum information perfectly, then subject the qubits in our codes to noise, and then we can perfectly decode the quantum information. This model is, in some ways, fine for talking about the transmission of quantum information but is clearly not adequate for building a quantum computer. Let...

متن کامل

CSE 599d - Quantum Computing Grover’s Algorithm

After Peter Shor demonstrated that quantum computers could efficiently factor, great interest arose in finding other problems for which quantum algorithms could outperform the best known classical algorithms. One of the early offshoots of this work was an algorithm invented by Lov Grover in 1996. Here we will describe Grover’s algorithm and show that it is, in a query complexity manner, the opt...

متن کامل

CSE 599d - Quantum Computing Quantum Entanglement and Bell’s Theorem

...contemporary physicists come in two varieties. Type 1 physicists are bothered by EPR and Bell’s Theorem. Type 2 (the majority) are not, but one has to distinguish two subvarieties. Type 2a physicists explain why they are not bothered. Their explanations tend either to miss the point entirely (like Born’s to Einstein) or to contain physical assertions that can be shown to be false. Type 2b ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006