|
Quantum Relative Entropy
In quantum information theory, quantum relative entropy is a measure of distinguishability between two density matrix, quantum states. It is the quantum mechanical analog of relative entropy. Motivation For simplicity, it will be assumed that all objects in the article are finite-dimensional. We first discuss the classical case. Suppose the probabilities of a finite sequence of events is given by the probability distribution ''P'' = , but somehow we mistakenly assumed it to be ''Q'' = . For instance, we can mistake an unfair coin for a fair one. According to this erroneous assumption, our uncertainty about the ''j''-th event, or equivalently, the amount of information provided after observing the ''j''-th event, is :\; - \log q_j. The (assumed) average uncertainty of all possible events is then :\; - \sum_j p_j \log q_j. On the other hand, the Shannon entropy of the probability distribution ''p'', defined by :\; - \sum_j p_j \log p_j, is the real amount of uncertainty befor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Information Theory
Quantum information is the information of the quantum state, state of a quantum system. It is the basic entity of study in quantum information theory, and can be manipulated using quantum information processing techniques. Quantum information refers to both the technical definition in terms of Von Neumann entropy and the general computational term. It is an interdisciplinary field that involves quantum mechanics, computer science, information theory, philosophy and cryptography among other fields. Its study is also relevant to disciplines such as cognitive science, psychology and neuroscience. Its main focus is in extracting information from matter at the microscopic scale. Observation in science is one of the most important ways of acquiring information and measurement is required in order to quantify the observation, making this crucial to the scientific method. In quantum mechanics, due to the uncertainty principle, non-commuting Observable, observables cannot be precisely mea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trace Inequalities
In mathematics, there are many kinds of inequalities involving matrices and linear operators on Hilbert spaces. This article covers some important operator inequalities connected with traces of matrices.E. Carlen, Trace Inequalities and Quantum Entropy: An Introductory Course, Contemp. Math. 529 (2010) 73–140 B. Simon, Trace Ideals and their Applications, Cambridge Univ. Press, (1979); Second edition. Amer. Math. Soc., Providence, RI, (2005). Basic definitions Let H''n'' denote the space of Hermitian × matrices, H''n''+ denote the set consisting of positive semi-definite × Hermitian matrices and H''n''++ denote the set of positive definite Hermitian matrices. For operators on an infinite dimensional Hilbert space we require that they be trace class and self-adjoint, in which case similar definitions apply, but we discuss only matrices, for simplicity. For any real-valued function on an interval ⊂ ℝ, one may define a matrix function for any operator with eigenvalue ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1504
__NOTOC__ Year 1504 (MDIV) was a leap year starting on Monday (link will display the full calendar) of the Julian calendar. Events January–June * January 1 – French troops of King Louis XII surrender Gaeta to the Spanish, under Gonzalo Fernández de Córdoba. * January 21 – After the death of Sten Sture the Elder on December 14 the year before, Svante Nilsson is elected the new Regent of Sweden. * January 31 – Treaty of Lyon: France cedes Naples to Ferdinand II of Aragon, who becomes King of Naples as Ferdinand III. * February 29 – Christopher Columbus uses his knowledge of a lunar eclipse this night, to convince the indigenous Jamaican people to provide him with supplies. * April 1 – English guilds become subject to state control. * April 23 – Maximilian I, Holy Roman Emperor, routes troops to Bavaria. July–December * September 8 – Michelangelo's sculpture of ''David'' is completed in Florence. * September 13 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Conditional Entropy
The conditional quantum entropy is an entropy measure used in quantum information theory. It is a generalization of the conditional entropy of classical information theory. For a bipartite state \rho^, the conditional entropy is written S(A, B)_\rho, or H(A, B)_\rho, depending on the notation being used for the von Neumann entropy. The quantum conditional entropy was defined in terms of a conditional density operator \rho_ by Nicolas Cerf and Chris Adami, who showed that quantum conditional entropies can be negative, something that is forbidden in classical physics. The negativity of quantum conditional entropy is a sufficient criterion for quantum non-separability. In what follows, we use the notation S(\cdot) for the von Neumann entropy, which will simply be called "entropy". Definition Given a bipartite quantum state \rho^, the entropy of the joint system AB is S(AB)_\rho \ \stackrel\ S(\rho^), and the entropies of the subsystems are S(A)_\rho \ \stackrel\ S(\rho^ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Mutual Information
In quantum information theory, quantum mutual information, or von Neumann mutual information, after John von Neumann, is a measure of correlation between subsystems of quantum state. It is the quantum mechanical analog of Shannon mutual information. Motivation For simplicity, it will be assumed that all objects in the article are finite-dimensional. The definition of quantum mutual entropy is motivated by the classical case. For a probability distribution of two variables ''p''(''x'', ''y''), the two marginal distributions are :p(x) = \sum_ p(x,y), \qquad p(y) = \sum_ p(x,y). The classical mutual information ''I''(''X'':''Y'') is defined by :I(X:Y) = S(p(x)) + S(p(y)) - S(p(x,y)) where ''S''(''q'') denotes the Shannon entropy of the probability distribution ''q''. One can calculate directly :\begin S(p(x)) + S(p(y)) &= - \left (\sum_x p_x \log p(x) + \sum_y p_y \log p(y) \right ) \\ &= -\left (\sum_x \left ( \sum_ p(x,y') \log \sum_ p(x,y') \right ) + \sum_y \left ( \s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Entanglement
Quantum entanglement is the phenomenon that occurs when a group of particles are generated, interact, or share spatial proximity in a way such that the quantum state of each particle of the group cannot be described independently of the state of the others, including when the particles are separated by a large distance. The topic of quantum entanglement is at the heart of the disparity between classical and quantum physics: entanglement is a primary feature of quantum mechanics not present in classical mechanics. Measurements of physical properties such as position, momentum, spin, and polarization performed on entangled particles can, in some cases, be found to be perfectly correlated. For example, if a pair of entangled particles is generated such that their total spin is known to be zero, and one particle is found to have clockwise spin on a first axis, then the spin of the other particle, measured on the same axis, is found to be anticlockwise. However, this behavior gives ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Separable State
In quantum mechanics, separable states are quantum states belonging to a composite space that can be factored into individual states belonging to separate subspaces. A state is said to be entangled if it is not separable. In general, determining if a state is separable is not straightforward and the problem is classed as NP-hard. Separability of bipartite systems Consider first composite states with two degrees of freedom, referred to as ''bipartite states''. By a postulate of quantum mechanics these can be described as vectors in the tensor product space H_1\otimes H_2. In this discussion we will focus on the case of the Hilbert spaces H_1 and H_2 being finite-dimensional. Pure states Let \_^n\subset H_1 and \_^m \subset H_2 be orthonormal bases for H_1 and H_2, respectively. A basis for H_1 \otimes H_2 is then \, or in more compact notation \. From the very definition of the tensor product, any vector of norm 1, i.e. a pure state of the composite system, can be written a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Göran Lindblad (physicist)
Göran Lindblad (9 July 1940 - 30 November 2022) was a Swedish theoretical physicist and a professor at the KTH Royal Institute of Technology, Stockholm. He made major foundational contributions in mathematical physics and quantum information theory, having to do with open quantum systems, entropy inequalities, and quantum measurements. Personal life Lindblad was born in Boden, Sweden on July 9, 1940 and grew up in Örebro, Sweden. Besides physics, he took an interest in history. He died on November 30, 2022 near his home in Johanneshov, Sweden. Career Lindblad spent his entire career, starting from his undergraduate days, at the KTH Royal Institute of Technology. He defended his PhD thesis, entitled "The concepts of information and entropy applied to the measurement process in quantum theory and statistical mechanics," on May 29, 1974. His PhD thesis summarized the contents of some important contributions to quantum information theory, including his proof of the data-pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trace (linear Algebra)
In linear algebra, the trace of a square matrix , denoted , is defined to be the sum of elements on the main diagonal (from the upper left to the lower right) of . The trace is only defined for a square matrix (). It can be proved that the trace of a matrix is the sum of its (complex) eigenvalues (counted with multiplicities). It can also be proved that for any two matrices and . This implies that similar matrices have the same trace. As a consequence one can define the trace of a linear operator mapping a finite-dimensional vector space into itself, since all matrices describing such an operator with respect to a basis are similar. The trace is related to the derivative of the determinant (see Jacobi's formula). Definition The trace of an square matrix is defined as \operatorname(\mathbf) = \sum_^n a_ = a_ + a_ + \dots + a_ where denotes the entry on the th row and th column of . The entries of can be real numbers or (more generally) complex numbers. The trace is not de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Completely Positive Map
In mathematics a positive map is a map between C*-algebras that sends positive elements to positive elements. A completely positive map is one which satisfies a stronger, more robust condition. Definition Let A and B be C*-algebras. A linear map \phi: A\to B is called positive map if \phi maps positive elements to positive elements: a\geq 0 \implies \phi(a)\geq 0. Any linear map \phi:A\to B induces another map :\textrm \otimes \phi : \mathbb^ \otimes A \to \mathbb^ \otimes B in a natural way. If \mathbb^\otimes A is identified with the C*-algebra A^ of k\times k-matrices with entries in A, then \textrm\otimes\phi acts as : \begin a_ & \cdots & a_ \\ \vdots & \ddots & \vdots \\ a_ & \cdots & a_ \end \mapsto \begin \phi(a_) & \cdots & \phi(a_) \\ \vdots & \ddots & \vdots \\ \phi(a_) & \cdots & \phi(a_) \end. We say that \phi is k-positive if \textrm_ \otimes \phi is a positive map, and \phi is called completely positive if \phi is k-positive for all k. Properties * Positi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Strong Subadditivity Of Quantum Entropy
In quantum information theory, strong subadditivity of quantum entropy (SSA) is the relation among the von Neumann entropies of various quantum subsystems of a larger quantum system consisting of three subsystems (or of one quantum system with three degrees of freedom). It is a basic theorem in modern quantum information theory. It was conjectured by D. W. Robinson and D. Ruelle in 1966 and O. E. Lanford III and D. W. Robinson in 1968 and proved in 1973 by E.H. Lieb and M.B. Ruskai, building on results obtained by Lieb in his proof of the Wigner-Yanase-Dyson conjecture. The classical version of SSA was long known and appreciated in classical probability theory and information theory. The proof of this relation in the classical case is quite easy, but the quantum case is difficult because of the non-commutativity of the reduced density matrices describing the quantum subsystems. Some useful references here include: *"Quantum Computation and Quantum Information" *"Quantum Entr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Quantum Information Theory")
