Shannon–Fano coding: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Monkbot
en>Barraki
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
{{See also|Quantum statistical mechanics}}
It is time to address the slow computer issues whether or not we do not understand how. Just considering the computer is functioning thus slow or keeps freezing up; does not signify that you can not address the problem and fix it. You may or can not be aware which any computer owner should recognize that there are certain aspects which a computer needs to maintain the number one performance. The sad truth is the fact that thus many persons whom own a system have no idea which it needs routine maintenance only like their vehicles.<br><br>Registry is not equally important to rapid computer boot up, but also crucial to the performance of the computer. If you have a registry error, you may face blue screen, freezing or crash. It's necessary to frequently clean up the invalid, missing, junk registry keys to keep the computer healthy and running quick.<br><br>Your PC may have a fragmented difficult drive or the windows registry may have been corrupted. It could equally be due to the dust plus dirt which must be cleaned. Whatever the problem, you are able to always find a solution. Here are certain strategies on how to make your PC run quicker.<br><br>If you feel we don't have enough cash at the time to upgrade, then the number one way is to free up some area by deleting a few of the unwanted files and folders.<br><br>The 2nd step to fixing these errors is to employ a program called a "[http://bestregistrycleanerfix.com/fix-it-utilities fix it utilities]" to scan from a computer plus fix any of the registry errors which can furthermore be leading to the error. A registry cleaner is a software program which will scan from a computer plus repair some of the issues that Windows has inside, permitting your computer to "remember" all the settings it has whenever it loads up. Although the registry is continually being utilized to aid load up a big number of programs on your PC, it's continually being saved incorrectly - leading to a large amount of errors to be formed. To fix this issue, it's suggested we download a registry cleaner within the Internet and install it on the Pc, permitting Windows to run smoother again.<br><br>The main reason why I could not make my PC run quicker was the system registry plus it being fragmented. So software to defragment or clean the registry are needed. Such software are called registry cleaners. Like all different software, there are paid ones and free ones with their advantages plus disadvantages. To choose between the 2 is the user's choice.<br><br>We want an option to automatically delete unwanted registry keys. This can conserve you hours of laborious checking by a registry keys. Automatic deletion is a key element when we compare registry cleaners.<br><br>Fortunately, there's a simple technique to fix most a computer mistakes. You only have to be able to fix corrupt registry files on a computer. And to do which, we can just utilize a tool termed as a registry cleaner. These simple pieces of software actually scan through the PC and fix every corrupt file that may result a issue to Windows. This enables the computer to use all files it wants, that not only speeds it up - and stops all the errors on the program as well.
{{Quantum mechanics|cTopic=Advanced topics}}
A '''density matrix''' is a [[matrix (math)|matrix]] that describes a [[quantum system]] in a ''mixed state'', a [[statistical ensemble]] of several [[quantum state]]s, in contrast to a ''pure state'', described by a single [[quantum state|state vector]]. The density matrix is the quantum-mechanical analogue to a [[phase space|phase-space]] [[probability measure]] (probability distribution of position and momentum) in classical [[statistical mechanics]]. Explicitly, suppose a quantum system may be found in state <math>| \psi_1 \rangle</math> with probability ''p''<sub>1</sub>, or it may be found in state <math>| \psi_2 \rangle </math> with probability ''p''<sub>2</sub>, or it may be found in state <math>| \psi_3 \rangle</math> with probability ''p''<sub>3</sub>, and so on. The '''density operator''' for this system is<ref name="sakurai">{{citation|last1=Sakurai|first1=J|title=Modern Quantum Mechanics|edition=2nd|page=181|isbn=9780321503367}}</ref>
: <math> \hat\rho = \sum_i p_i |\psi_i \rangle \langle \psi_i|.</math>
By choosing a basis <math>\{|u_m\rangle\}</math> (which need not be orthogonal), one may resolve the density operator into the density matrix, whose elements are<ref name="sakurai" />
: <math> \rho_{mn} = \sum_i p_i \langle u_{m} | \psi_i \rangle \langle \psi_i | u_{n} \rangle.</math>
For an operator <math>\hat A</math>, the [[expectation value (quantum mechanics)|expectation value]] <math>\langle A \rangle</math> is given by<ref name="sakurai" />
: <math> \langle A \rangle  = \sum_i p_i \langle \psi_i | \hat{A} | \psi_i \rangle = \sum_n \langle u_{n} | \hat\rho \hat{A} | u_{n} \rangle = \operatorname{tr}(\hat\rho \hat{A}).</math>
In words, the expectation value of ''A'' for the mixed state is the sum of the expectation values of ''A'' for each of the pure states <math>|\psi_i\rangle</math> weighted by the probabilities ''p<sub>i</sub>''.
 
Mixed states arise in situations where the experimenter does not know which particular states are being manipulated. Examples include a [[canonical ensemble|system in thermal equilibrium]] (or [[grand canonical ensemble|additionally chemical equilibrium]]) or a system with an uncertain or randomly varying preparation history (so one does not know which pure state the system is in). Also, if a quantum system has two or more subsystems that are [[Quantum entanglement|entangled]], then each subsystem must be treated as a mixed state even if the complete system is in a pure state.<ref>{{citation | last = Hall |first = B.C. |title = Quantum Theory for Mathematicians | page = 419 | year = 2013}}</ref> The density matrix is also a crucial tool in [[quantum decoherence]] theory.
 
The density matrix is a representation of a [[linear operator]] called the ''density operator''. The close relationship between matrices and operators is a basic concept in [[linear algebra]]. In practice, the terms ''density matrix'' and ''density operator'' are often used interchangeably. Both matrix and operator are [[self-adjoint]] (or [[Hermitian matrix|Hermitian]]),  [[positive-semidefinite matrix|positive semi-definite]], of [[trace class|trace]] one, and  may
be [[Dimension (vector space)|infinite-dimensional]].<ref>{{Citation | last =  Fano | first = Ugo | authorlink = Ugo Fano | year = 1957 | title = Description of States in Quantum Mechanics by Density Matrix and Operator Techniques | journal =  Reviews of Modern Physics | volume = 29 | pages = 74&ndash;93| doi =10.1103/RevModPhys.29.74 | postscript =  . | bibcode=1957RvMP...29...74F}}</ref>  The formalism was introduced by [[John von Neumann]]<ref>{{Citation | last = von Neumann | first = John  | year = 1927 | authorlink = John von Neumann  |title=Wahrscheinlichkeitstheoretischer Aufbau der Quantenmechanik | journal = Göttinger Nachrichten | volume = 1|pages= 245&ndash;272}}</ref> in 1927 and independently, but less systematically by [[Lev Landau]]<ref name="PT">{{Citation | url=http://www.physicstoday.org/resource/1/phtoad/v35/i2/p36_s1 | title=Density functional theory | author=Schlüter, Michael and Lu Jeu Sham | journal=Physics Today | year=1982 | volume=35 | pages=36 | doi=10.1063/1.2914933 | issue=2|bibcode = 1982PhT....35b..36S }}</ref> and [[Felix Bloch]]<ref name="Ugo ">{{Citation | url=http://link.springer.com/article/10.1007%2FBF03001661?LI=true | title=Density matrices as polarization vectors | author=Ugo Fano | journal=Rendiconti Lincei |date=June 1995 | volume=6 | issue=2 | pages=123–130 | doi=10.1007/BF03001661}}</ref> in 1927 and 1946 respectively.
 
==Pure and mixed states==
In [[mathematical formulation of quantum mechanics#Mathematical structure of quantum mechanics|quantum mechanics]], a quantum system is represented by a [[quantum state|state vector]] (or [[bra-ket notation|ket]]) <math>| \psi \rangle </math>. A quantum system with a state vector <math>| \psi \rangle </math> is called a ''pure state''. However, it is also possible for a system to be in a [[statistical ensemble]] of different state vectors: For example, there may be a 50% probability that the state vector is <math>| \psi_1 \rangle </math> and a 50% chance that the state vector is <math>| \psi_2 \rangle </math>. This system would be in a ''mixed state''. The density matrix is especially useful for mixed states, because any state, pure or mixed, can be characterized by a single density matrix.
 
A mixed state is different from a [[quantum superposition]]. In fact, a quantum superposition of pure states is another pure state, for example <math>| \psi \rangle = (| \psi_1 \rangle + | \psi_2 \rangle)/\sqrt{2} </math>.
 
===Example: Light polarization===
[[FILE:vertical_polarization.svg|right|thumb|200px|The incandescent light bulb (1) emits completely random polarized  photons (2)  with mixed state density matrix<BR/><center><math>\begin{bmatrix}
0.5 & 0  \\
0 & 0.5  \\
\end{bmatrix}
</math> <span style="vertical-align:bottom">。</span></center><BR/>After passing through vertical plane polarizer (3), the remaining photons are all vertically polarized (4) and have pure state density matrix<BR/><center><math>\begin{bmatrix}
1 & 0  \\
0 & 0  \\
\end{bmatrix}
</math> <span style="vertical-align:bottom">。</center></span>]]
An example of pure and mixed states is [[light polarization]]. Photons can have two [[circular polarization|helicities]], corresponding to two orthogonal quantum states, <math>|R\rangle</math> (right [[circular polarization]]) and <math>|L\rangle</math> (left [[circular polarization]]). A photon can also be in a superposition state, such as <math>(|R\rangle+|L\rangle)/\sqrt{2}</math> (vertical polarization) or <math>(|R\rangle-|L\rangle)/\sqrt{2}</math> (horizontal polarization). More generally, it can be in any state <math>\alpha|R\rangle+\beta|L\rangle</math>, corresponding to [[linear polarization|linear]], [[circular polarization|circular]], or [[elliptical polarization]]. If we pass <math>(|R\rangle+|L\rangle)/\sqrt{2}</math> polarized light through a [[circular polarizer]] which allows either only <math>|R\rangle</math> polarized light, or only <math>|L\rangle</math> polarized light, intensity would be reduced by half in both cases. This may make it ''seem'' like half of the photons are in state <math>|R\rangle</math> and the other half in state <math>|L\rangle</math>. But this is not correct: Both <math>|R\rangle</math> and <math>|L\rangle</math> photons are partly absorbed by a vertical [[linear polarizer]], but the <math>(|R\rangle+|L\rangle)/\sqrt{2}</math> light will pass through that polarizer with no absorption whatsoever.
 
However, [[unpolarized light]] (such as the light from an [[incandescent light bulb]]) is different from any state like <math>\alpha|R\rangle+\beta|L\rangle</math> (linear, circular, or elliptical polarization). Unlike linearly or elliptically polarized light, it passes through a polarizer with 50% intensity loss whatever the orientation of the polarizer; and unlike circularly polarized light, it cannot be made linearly polarized with any [[wave plate]]. Indeed, unpolarized light cannot be described as ''any'' state of the form <math>\alpha|R\rangle+\beta|L\rangle</math>. However, unpolarized light ''can'' be described perfectly by assuming that each photon is either <math>| R \rangle </math> with 50% probability or <math>| L \rangle </math> with 50% probability. The same behavior would occur if each photon was either vertically polarized with 50% probability or horizontally polarized with 50% probability.
 
Therefore, unpolarized light cannot be described by any pure state, but can be described as a [[statistical ensemble]] of pure states in at least two ways (the ensemble of half left and half right circularly polarized, or the ensemble of half vertically and half horizontally linearly polarized). These two ensembles are completely indistinguishable experimentally, and therefore they are considered the same mixed state. One of the advantages of the density matrix is that there is just one density matrix for each mixed state, whereas there are many statistical ensembles of pure states for each mixed state. Nevertheless, the density matrix contains all the information necessary to calculate any measurable property of the mixed state.
 
Where do mixed states come from? To answer that, consider how to generate unpolarized light. One way is to use a system in [[thermal equilibrium]], a statistical mixture of enormous numbers of [[Microstate (statistical mechanics)|microstates]], each with a certain probability (the [[Boltzmann factor]]), switching rapidly from one to the next due to [[thermal fluctuations]]. Thermal randomness explains why an [[incandescent light bulb]], for example, emits unpolarized light. A second way to generate unpolarized light is to introduce uncertainty in the preparation of the system, for example, passing it through a [[birefringent crystal]] with a rough surface, so that slightly different parts of the beam acquire different polarizations. A third way to generate unpolarized light uses an [[EPR paradox|EPR]] setup: A radioactive decay can emit two photons traveling in opposite directions, in the quantum state <math>(|R,L\rangle+|L,R\rangle)/\sqrt{2}</math>. The two photons ''together'' are in a pure state, but if you only look at one of the photons and ignore the other, the photon behaves just like unpolarized light.
 
More generally, mixed states commonly arise from a statistical mixture of the starting state (such as in thermal equilibrium), from uncertainty in the preparation procedure (such as slightly different paths that a photon can travel), or from looking at a subsystem entangled with something else.
 
===Mathematical description===
The [[quantum state|state vector]] <math>| \psi \rangle </math> of a pure state completely determines the statistical behavior of a measurement. For concreteness, take an observable quantity, and let ''A'' be the associated [[observable|observable operator]]  that has a representation on the [[Hilbert space]] <math> \mathcal{H} </math> of the quantum system.  For any real-valued, analytical function ''F'' defined on the real numbers,<ref>Technically, ''F'' must be a Borel function</ref> suppose that ''F''(''A'') is the result of applying ''F'' to the outcome of a measurement. The expectation value of ''F''(''A'') is
:<math> \langle \psi | F(A) | \psi \rangle\, . </math>
 
Now consider a mixed state prepared by statistically combining two different pure states <math> | \psi \rangle </math> and <math> |\phi\rangle </math>, with  the associated probabilities ''p'' and {{nowrap|1 &minus; ''p''}}, respectively. The associated probabilities mean that the preparation process for the quantum system ends in the state <math>|\psi\rangle</math> with probability ''p'' and in the state <math> |\phi\rangle </math> with probability {{nowrap|1 &minus; ''p''}}.
 
It is not hard to show that the statistical properties of the observable for the system prepared in such a mixed state are completely determined. However, there is no state vector <math> |\xi\rangle </math> which determines this statistical behavior in the sense that the expectation value of ''F''(''A'') is
:<math> \langle \xi | F(A) | \xi \rangle \, . </math>
 
Nevertheless, there ''is'' a unique operator ''ρ'' such that the expectation value of ''F(A)'' can be written as
:<math> \operatorname{tr}[\rho F(A)]\, ,  </math>
 
where the operator ''ρ'' is the density operator of the mixed system.  A simple calculation shows that the operator ''ρ'' for the above discussion is given by
 
:<math> \rho = p | \psi\rangle \langle \psi | + (1-p) | \phi\rangle \langle \phi |\,. </math>
 
For the above example of unpolarized light, the density operator is
:<math> \rho = \tfrac{1}{2} | R \rangle \langle R | + \tfrac{1}{2} | L \rangle \langle L |. </math>
 
==Formulation==
For a finite dimensional function space, the most general density operator is of the form
 
:<math> \rho = \sum_j p_j |\psi_j \rang \lang \psi_j| </math>
 
where the coefficients ''p''<sub>''j''</sub> are non-negative and add up to one.  This represents a statistical mixture of pure states. If the given system is closed, then one can think of a mixed state as representing a single system with an uncertain preparation history, as explicitly detailed above; ''or'' we can regard the mixed state as representing an [[Statistical ensemble (mathematical physics)|ensemble]] of systems, i.e. a large number of copies of the system in question, where ''p''<sub>''j''</sub> is the proportion of the ensemble being in the state <math>\textstyle |\psi_j \rang </math>. An ensemble is described by a pure state if every copy of the system in that ensemble is in the same state, i.e. it is a ''pure ensemble''. If the system is not closed, however, then it is simply not correct to claim that it has some definite but unknown state vector, as the density operator may record physical entanglements to other systems.
 
Consider a quantum ensemble of size ''N'' with occupancy numbers ''n''<sub>1</sub>, ''n''<sub>2</sub>,...,''n<sub>k</sub>'' corresponding to the orthonormal states <math>\textstyle |1\rang,...,|k\rang</math>, respectively, where ''n''<sub>1</sub>+...+''n<sub>k</sub>'' = ''N'', and, thus, the coefficients ''p<sub>j</sub>'' = ''n<sub>j</sub>'' /''N''. For a pure ensemble, where all ''N'' particles are in state <math>\textstyle |i\rang </math>, we have ''n<sub>j</sub>'' = 0, for all ''j'' ≠ ''i'', from which we recover the corresponding density operator <math>\textstyle\rho = |i\rang\lang i|</math>. However, the density operator of a mixed state does not capture all the information about a mixture; in particular, the coefficients ''p''<sub>''j''</sub> and the kets ψ<sub>''j''</sub> are not recoverable from the operator ρ without additional information.  This non-uniqueness implies that different ensembles or mixtures may correspond to the same density operator. Such equivalent ensembles or mixtures cannot be distinguished by measurement of observables alone.  This equivalence can be characterized precisely. Two ensembles ψ,  ψ' define the same density operator [[if and only if]] there is a matrix U with
 
:<math> U^*U=I</math>
 
i.e., U is [[Unitary operator|unitary]] and such that
 
:<math> | \psi_i'\rangle \sqrt {p_i'} = \sum_{j} u_{ij} | \psi_j\rangle \sqrt {p_j}.</math>
 
This is simply a restatement of the following fact from linear algebra: for two square matrices ''M'' and ''N'', ''M M''<sup>*</sup> = ''N N''<sup>*</sup> if and only if ''M'' = ''NU'' for some unitary ''U''. (See [[square root of a matrix]] for more details.) Thus there is a unitary freedom in the ket mixture or ensemble that gives the same density operator.  However if the kets in the mixture are [[orthonormal]] then the original probabilities ''p''<sub>''j''</sub> are recoverable as the eigenvalues of the density matrix.
 
In operator language, a density operator is a [[positive-definite matrix|positive semidefinite]], [[hermitian]] operator  of [[trace class operator|trace 1]] acting on the state space.<ref>{{citation | last = Hall |first = B.C. |title = Quantum Theory for Mathematicians | page = 423 |publisher = Springer | year = 2013}}</ref> A density operator describes a [[Purity (quantum mechanics)|pure]] state if it is a [[Rank_(linear_algebra)|rank]] one projection. Equivalently, a density operator ρ is a [[Purity (quantum mechanics)|pure]] state if and only if
: <math>\; \rho = \rho^2</math>,
i.e. the state is [[idempotent]]. This is true regardless of whether ''H'' is finite dimensional or not.
 
Geometrically, when the state is not expressible as a [[convex combination]] of other states, it is a pure state.<ref>{{citation | last = Hall |first = B.C. |title = Quantum Theory for Mathematicians | page = 439 |publisher = Springer | year = 2013}}</ref>  The family of mixed states is a convex set and a state is pure if it is an [[extremal point]] of that set.
 
It follows from the [[compact operator on Hilbert space|spectral theorem for compact self-adjoint operators]] that every mixed state is an infinite convex combination of pure states.  This representation is not unique. Furthermore, a theorem of [[Andrew Gleason]] states that certain functions defined on the family of projections and taking values in [0,1] (which can be regarded as quantum analogues of probability measures) are determined by unique mixed states. See [[Quantum logic#Statistical structure|quantum logic]] for more details.
 
==Measurement==
Let ''A'' be an [[observable]] of the system, and suppose the ensemble is in a mixed state such that each of the pure states <math>\textstyle |\psi_j\rang</math> occurs with probability ''p<sub>j</sub>''. Then the corresponding density operator is:
 
:<math>\rho = \sum_j p_j |\psi_j \rang \lang \psi_j| .</math>
 
The [[Expectation value (quantum mechanics)|expectation value]] of the measurement can be calculated by extending from the case of pure states (see [[Measurement in quantum mechanics]]):
 
:<math> \lang A \rang = \sum_j p_j \lang \psi_j|A|\psi_j \rang = \sum_j p_j \operatorname{tr}\left(|\psi_j \rang \lang \psi_j|A \right) = \sum_j  \operatorname{tr}\left(p_j |\psi_j \rang \lang \psi_j|A\right)  =  \operatorname{tr}\left(\sum_j p_j |\psi_j \rang \lang \psi_j|A\right) = \operatorname{tr}(\rho A),</math>
 
where <math>\operatorname{tr}</math> denotes [[trace (linear algebra)|trace]]. Moreover, if ''A'' has spectral resolution
 
:<math>A = \sum_i a_i |a_i \rang \lang a_i| = \sum _i a_i P_i,</math>
 
where <math>P_i = |a_i \rang \lang a_i|</math>, the corresponding density operator after the measurement is given by:
 
:<math>\; \rho ' = \sum_i P_i \rho P_i.</math>
 
Note that the above density operator describes the full ensemble after measurement. The sub-ensemble for which the measurement result was the particular value ''a<sub>i</sub>'' is described by the different density operator
 
:<math>\rho_i' = \frac{P_i \rho P_i}{\operatorname{tr}[\rho P_i]}.</math>
 
This is true assuming that <math>\textstyle |a_i\rang</math> is the only eigenket (up to [[phase factor|phase]]) with [[eigenvalue]] ''a<sub>i</sub>''; more generally, ''P<sub>i</sub>'' in this expression would be replaced by the [[projection operator]] into the [[eigenspace|eigen''space'']] corresponding to eigenvalue ''a<sub>i</sub>''.
 
==Entropy==
The [[von Neumann entropy]] <math>S</math> of a mixture can be expressed in terms of the eigenvalues of <math>\rho</math> or in terms of the [[Trace (linear algebra)|trace]] and [[Matrix logarithm|logarithm]] of the density operator <math>\rho</math>. Since <math> \rho </math> is a positive semi-definite operator, it has a spectral decomposition such that <math> \rho= \sum_i \lambda_i |\varphi_i\rangle\langle\varphi_i| </math> where <math> |\varphi_i\rangle </math> are orthonormal vectors. Therefore the entropy of a quantum system with density matrix <math> \rho </math> is
 
: <math>S = -\sum_i \lambda_i \ln \,\lambda_i = -\operatorname{tr}(\rho \ln \rho)\quad. </math>
 
Also it can be shown that
:<math>S\left(\rho=\sum_i p_i\rho_i\right)= H(p_i) + \sum_i p_iS(\rho_i)</math>
when <math>\rho_i</math> have orthogonal support, where <math>H(p)</math> is the [[Shannon entropy]].
This entropy can increase but never decrease with a projective measurement, however generalised measurements can decrease entropy.<ref>{{Citation | last1=Nielsen | first1=Michael | last2=Chuang | first2=Isaac | title=Quantum Computation and Quantum Information | publisher=[[Cambridge University Press]] | isbn=978-0-521-63503-5 | year=2000}}. Chapter 11:  Entropy and information, Theorem 11.9, "Projective measurements cannot decrease entropy"</ref><ref name="everett56">{{Citation | last1=Everett | first1=Hugh | author1-link=Hugh Everett | title=The Many-Worlds Interpretation of Quantum Mechanics | publisher=[[Princeton University Press]] | series=Princeton Series in Physics | isbn=978-0-691-08131-1  | year=1973 | chapter=The Theory of the Universal Wavefunction (1956) Appendix I. "Monotone decrease of information for stochastic processes"  | pages=128–129}}
</ref>  The entropy of a pure state is zero, while that of a proper mixture always greater than zero.  Therefore a pure state may be converted into a mixture by a measurement, but a proper mixture can ''never'' be converted into a pure state.  Thus the act of measurement induces a fundamental [[irreversible process|irreversible]] change on the density matrix; this is analogous to the "collapse" of the state vector, or [[wavefunction collapse]]. Perhaps counterintuitively, the measurement actually ''decreases information'' by erasing quantum interference in the composite system—cf. [[quantum entanglement]], [[einselection]], and [[quantum decoherence]].
 
(A subsystem of a larger system can be turned from a mixed to a pure state, but only by increasing the von Neumann entropy elsewhere in the system. This is analogous to how the entropy of an object can be lowered by putting it in a refrigerator: The air outside the refrigerator's heat-exchanger warms up, gaining even more entropy than was lost by the object in the refrigerator. See [[second law of thermodynamics]]. See [[Entropy in thermodynamics and information theory]].)
 
==The Von Neumann equation for time evolution==
{{See also|Liouville's theorem (Hamiltonian)#Quantum Liouville equation}}
Just as the [[Schrödinger equation]] describes how pure states evolve in time, the '''von Neumann equation''' (also known as the '''Liouville-von Neumann equation''') describes how a density operator evolves in time (in fact, the two equations are equivalent, in the sense that either can be derived from the other.) The von Neumann equation dictates that<ref>{{citation |title=The theory of open quantum systems|last1= Breuer |first1=Heinz|last2= Petruccione|first2=Francesco|page=110|isbn=9780198520634|url=http://books.google.com/books?id=0Yx5VzaMYm8C&pg=PA110 |year=2002}}</ref><ref>{{Citation|url=http://books.google.com/books?id=o-HyHvRZ4VcC&pg=PA16 |title=Statistical mechanics|last=Schwabl|first=Franz|page=16|isbn=9783540431633|year=2002}}</ref>
 
:<math> i \hbar \frac{\partial \rho}{\partial t} = [H,\rho]~, </math>
 
where the brackets denote a [[commutator]].
 
Note that this equation only holds when the density operator is taken to be in the [[Schrödinger picture]], even though this equation seems at first look to emulate the Heisenberg equation of motion in the [[Heisenberg picture]], with a crucial sign difference:
 
:<math> i \hbar \frac{dA^{(H)}}{dt}=-[H,A^{(H)}] ~,</math>
 
where <math>A^{(H)}(t)</math> is some ''Heisenberg picture'' operator; but in this picture the density matrix is ''not time-dependent'', and the relative sign ensures that the time derivative of the expected value <math>\langle A \rangle</math> comes out ''the same as in the Schrödinger picture''.
 
Taking the density operator to be in the Schrödinger picture makes sense, since it is composed of 'Schrödinger' kets and bras evolved in time, as per the Schrödinger picture.
If the Hamiltonian is time-independent, this differential equation can be easily solved to yield
 
:<math>\rho(t) = e^{-i H t/\hbar} \rho(0) e^{i H t/\hbar}.</math>
 
=="Quantum Liouville", Moyal's equation==
The density matrix operator may also be realized in [[phase space]]. Under the [[Wigner_quasi-probability_distribution#The_Wigner.E2.80.93Weyl_transformation|Wigner map]], the density matrix  transforms into the equivalent [[Wigner quasi-probability distribution|Wigner function]],
:<math> W(x,p)\stackrel{\mathrm{def}}{=}\frac{1}{\pi\hbar}\int_{-\infty}^\infty \psi^*(x+y)\psi(x-y)e^{2ipy/\hbar}\,dy ~.</math>
The equation for the time-evolution of the Wigner function is then the Wigner-transform of the above von Neumann equation,
:::<math>\frac{\partial W(q,p,t)}{\partial t} = -\{\{W(q,p,t) , H(q,p )\}\}~,</math>
where ''H(q,p)'' is the Hamiltonian, and { { •,• } } is  the [[Moyal bracket]], the transform of the quantum [[commutator]].
 
The evolution equation for the Wigner function is then analogous to that of its classical limit, the [[Liouville's theorem (Hamiltonian)#Liouville_equations|Liouville equation]] of [[classical physics]].  In the limit of vanishing Planck's constant ħ, ''W(q,p,t)'' reduces to the classical Liouville probability density function in [[phase space]].
 
The classical Liouville equation can be solved using the [[method of characteristics]] for partial differential equations, the characteristic equations being  Hamilton's equations. The Moyal equation in quantum mechanics similarly admits formal solutions in terms of  [[method of quantum characteristics|quantum characteristics]],  predicated on the [[Moyal product|∗−product]] of phase space, although, in actual practice, solution-seeking follows different methods.
 
==Composite Systems==
The joint density matrix of a composite system of two systems A and B is described by <math> \rho_{AB} </math>. Then the subsystems are described by their [[Reduced_density_matrix#Reduced_density_matrices|reduced density operator]].
:<math>\rho_A=\operatorname{tr}_B\rho_{AB}</math>
<math>\operatorname{tr}_B</math> is called ''[[partial trace]]'' over system B.
If A and B are two distinct and independent systems then <math>\rho_{AB}=\rho_{A}\otimes\rho_{B}</math> which is a ''product state''.
 
==C*-algebraic formulation of states==
It is now generally accepted that the description of quantum mechanics in which all self-adjoint operators represent observables is untenable.<ref>See appendix,  {{Citation | last1=Mackey | first1=George Whitelaw | author1-link=George Mackey | title=Mathematical Foundations of Quantum Mechanics | publisher=[[Dover Publications]] | location=New York | series=Dover Books on Mathematics | isbn=978-0-486-43517-6 | year=1963}}</ref><ref>{{Citation | last1=Emch | first1=Gerard G. | title=Algebraic methods in statistical mechanics and quantum field theory | publisher=[[Wiley-Interscience]] | isbn=978-0-471-23900-0 | year=1972}}</ref> For this reason, observables are identified with elements of an abstract [[C*-algebra]] ''A'' (that is one without a distinguished representation as an algebra of operators) and [[state (functional analysis)|states]] are positive [[linear functional]]s on ''A''. However, by using the [[GNS construction]], we can recover Hilbert spaces which realize ''A'' as a subalgebra of operators.
 
Geometrically, a pure state on a C*-algebra ''A''  is a state which is an extreme point of the set of all states on ''A''.  By properties of the GNS construction these states correspond to [[irreducible representation]]s of ''A''.
 
The states of the C*-algebra of [[compact operator]]s ''K''(''H'') correspond exactly to the density operators, and therefore the pure states  of ''K''(''H'') are exactly the pure states in the sense of quantum mechanics.
 
The C*-algebraic formulation can be seen to include both classical and quantum systems. When the system is classical, the algebra of observables become an abelian C*-algebra.  In that case the states become probability measures, as noted in the introduction.
 
==See also==
{{Div col}}
*[[Quantum state]]
*[[Wave function]]
*[[Born rule]]
*[[Gleason's theorem]]
*[[Density functional theory]]
*[[Green's function (many-body theory)]]
*[[Lindblad equation]]
*[[Green–Kubo relations]]
*[[Purification of quantum state]]
*[[POVM]] Generalized measurement of density states
*[[Wigner quasi-probability distribution]]
{{Div col end}}
 
==Notes and references==
{{Reflist}}
 
{{DEFAULTSORT:Density Matrix}}
[[Category:Quantum mechanics]]
[[Category:Functional analysis]]
[[Category:Quantum information science]]
[[Category:Statistical mechanics]]

Latest revision as of 15:47, 30 May 2014

It is time to address the slow computer issues whether or not we do not understand how. Just considering the computer is functioning thus slow or keeps freezing up; does not signify that you can not address the problem and fix it. You may or can not be aware which any computer owner should recognize that there are certain aspects which a computer needs to maintain the number one performance. The sad truth is the fact that thus many persons whom own a system have no idea which it needs routine maintenance only like their vehicles.

Registry is not equally important to rapid computer boot up, but also crucial to the performance of the computer. If you have a registry error, you may face blue screen, freezing or crash. It's necessary to frequently clean up the invalid, missing, junk registry keys to keep the computer healthy and running quick.

Your PC may have a fragmented difficult drive or the windows registry may have been corrupted. It could equally be due to the dust plus dirt which must be cleaned. Whatever the problem, you are able to always find a solution. Here are certain strategies on how to make your PC run quicker.

If you feel we don't have enough cash at the time to upgrade, then the number one way is to free up some area by deleting a few of the unwanted files and folders.

The 2nd step to fixing these errors is to employ a program called a "fix it utilities" to scan from a computer plus fix any of the registry errors which can furthermore be leading to the error. A registry cleaner is a software program which will scan from a computer plus repair some of the issues that Windows has inside, permitting your computer to "remember" all the settings it has whenever it loads up. Although the registry is continually being utilized to aid load up a big number of programs on your PC, it's continually being saved incorrectly - leading to a large amount of errors to be formed. To fix this issue, it's suggested we download a registry cleaner within the Internet and install it on the Pc, permitting Windows to run smoother again.

The main reason why I could not make my PC run quicker was the system registry plus it being fragmented. So software to defragment or clean the registry are needed. Such software are called registry cleaners. Like all different software, there are paid ones and free ones with their advantages plus disadvantages. To choose between the 2 is the user's choice.

We want an option to automatically delete unwanted registry keys. This can conserve you hours of laborious checking by a registry keys. Automatic deletion is a key element when we compare registry cleaners.

Fortunately, there's a simple technique to fix most a computer mistakes. You only have to be able to fix corrupt registry files on a computer. And to do which, we can just utilize a tool termed as a registry cleaner. These simple pieces of software actually scan through the PC and fix every corrupt file that may result a issue to Windows. This enables the computer to use all files it wants, that not only speeds it up - and stops all the errors on the program as well.