|
Quantum Operation
In quantum mechanics, a quantum operation (also known as quantum dynamical map or quantum process) is a mathematical formalism used to describe a broad class of transformations that a quantum mechanical system can undergo. This was first discussed as a general stochastic transformation for a density matrix by George Sudarshan. The quantum operation formalism describes not only unitary time evolution or symmetry transformations of isolated systems, but also the effects of measurement and transient interactions with an environment. In the context of quantum computation, a quantum operation is called a quantum channel. Note that some authors use the term "quantum operation" to refer specifically to completely positive (CP) and non-trace-increasing maps on the space of density matrices, and the term "quantum channel" to refer to the subset of those that are strictly trace-preserving. Quantum operations are formulated in terms of the density operator description of a quantum mechanica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Mechanics
Quantum mechanics is a fundamental theory in physics that provides a description of the physical properties of nature at the scale of atoms and subatomic particles. It is the foundation of all quantum physics including quantum chemistry, quantum field theory, quantum technology, and quantum information science. Classical physics, the collection of theories that existed before the advent of quantum mechanics, describes many aspects of nature at an ordinary (macroscopic) scale, but is not sufficient for describing them at small (atomic and subatomic) scales. Most theories in classical physics can be derived from quantum mechanics as an approximation valid at large (macroscopic) scale. Quantum mechanics differs from classical physics in that energy, momentum, angular momentum, and other quantities of a bound system are restricted to discrete values ( quantization); objects have characteristics of both particles and waves ( wave–particle duality); and there ar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Choi Matrix
Choi may refer to: * Choi (Korean surname), a Korean surname * Choi, Macau Cantonese transliteration of the Chinese surname Cui (崔) and Xu (徐) * Choi, Cantonese romanisation of Cai (surname) (蔡), a Chinese surname * CHOI-FM, a radio station in Quebec City, Canada * Choi Bounge, a character from the ''King of Fighters'' video game series *Children's Hospital of Illinois OSF HealthCare Children's Hospital of Illinois known simply as Children's Hospital of Illinois is a nationally ranked pediatric acute care children's hospital located within OSF Saint Francis Medical Center in Peoria, Illinois. The hospital has 14 ... See also * Choy (other) {{disambiguation, callsign ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ancilla (quantum Computing)
Ancilla bits are some extra bits being used to achieve some specific goals in computation (e.g. reversible computation). In classical computation, any memory bit can be turned on or off at will, requiring no prior knowledge or extra complexity. However, this is not the case in quantum computing or classical reversible computing. In these models of computing, all operations on computer memory must be reversible, and toggling a bit on or off would lose the information about the initial value of that bit. For this reason, in a quantum algorithm there is no way to deterministically put bits in a specific prescribed state unless one is given access to bits whose original state is known in advance. Such bits, whose values are known ''a priori'', are known as ancilla bits in a quantum or reversible computing task. A trivial use for ancilla bits is downgrading complicated quantum gates into simple gates. For example, by placing controls on ancilla bits, a Toffoli gate can be use ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cholesky Factorization
In linear algebra, the Cholesky decomposition or Cholesky factorization (pronounced ) is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions, e.g., Monte Carlo simulations. It was discovered by André-Louis Cholesky for real matrices, and posthumously published in 1924. When it is applicable, the Cholesky decomposition is roughly twice as efficient as the LU decomposition for solving systems of linear equations. Statement The Cholesky decomposition of a Hermitian positive-definite matrix A, is a decomposition of the form : \mathbf = \mathbf^*, where L is a lower triangular matrix with real and positive diagonal entries, and L* denotes the conjugate transpose of L. Every Hermitian positive-definite matrix (and thus also every real-valued symmetric positive-definite matrix) has a unique Cholesky decomposition. The converse holds trivially: if A can ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stinespring Factorization Theorem
In mathematics, Stinespring's dilation theorem, also called Stinespring's factorization theorem, named after W. Forrest Stinespring, is a result from operator theory that represents any completely positive map on a C*-algebra ''A'' as a composition of two completely positive maps each of which has a special form: #A *-representation of ''A'' on some auxiliary Hilbert space ''K'' followed by #An operator map of the form ''T'' ↦ ''V*TV''. Moreover, Stinespring's theorem is a structure theorem from a C*-algebra into the algebra of bounded operators on a Hilbert space. Completely positive maps are shown to be simple modifications of *-representations, or sometimes called *-homomorphisms. Formulation In the case of a unital C*-algebra, the result is as follows: :Theorem. Let ''A'' be a unital C*-algebra, ''H'' be a Hilbert space, and ''B''(''H'') be the bounded operators on ''H''. For every completely positive ::\Phi : A \to B(H), :there exists a Hilbert space ''K'' and a uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Information Processing
Quantum information science is an interdisciplinary field that seeks to understand the analysis, processing, and transmission of information using quantum mechanics principles. It combines the study of Information science with quantum effects in physics. It includes theoretical issues in computational models and more experimental topics in quantum physics, including what can and cannot be done with quantum information. The term quantum information theory is also used, but it fails to encompass experimental research, and can be confused with a subfield of quantum information science that addresses the processing of quantum information. Scientific and engineering studies To understand quantum teleportation, quantum entanglement and the manufacturing of quantum computer hardware requires a thorough understanding of quantum physics and engineering. Since 2010s, there has been remarkable progress in manufacturing quantum computers, with companies like Google and IBM investing heavily ... [...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 * Po ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
C*-algebra
In mathematics, specifically in functional analysis, a C∗-algebra (pronounced "C-star") is a Banach algebra together with an involution satisfying the properties of the adjoint. A particular case is that of a complex algebra ''A'' of continuous linear operators on a complex Hilbert space with two additional properties: * ''A'' is a topologically closed set in the norm topology of operators. * ''A'' is closed under the operation of taking adjoints of operators. Another important class of non-Hilbert C*-algebras includes the algebra C_0(X) of complex-valued continuous functions on ''X'' that vanish at infinity, where ''X'' is a locally compact Hausdorff space. C*-algebras were first considered primarily for their use in quantum mechanics to model algebras of physical observables. This line of research began with Werner Heisenberg's matrix mechanics and in a more mathematically developed form with Pascual Jordan around 1933. Subsequently, John von Neumann attempted to es ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Choi's Theorem On Completely Positive Maps
In mathematics, Choi's theorem on completely positive maps is a result that classifies completely positive maps between finite-dimensional (matrix) C*-algebras. An infinite-dimensional algebraic generalization of Choi's theorem is known as Belavkin's " Radon–Nikodym" theorem for completely positive maps. Statement Choi's theorem. Let \Phi : \mathbb^ \to \mathbb^ be a linear map. The following are equivalent: :(i) is -positive (i.e. \left (\operatorname_n\otimes\Phi \right )(A)\in\mathbb^\otimes\mathbb^ is positive whenever A\in\mathbb^\otimes\mathbb^ is positive). :(ii) The matrix with operator entries ::C_\Phi= \left (\operatorname_n\otimes\Phi \right ) \left (\sum_E_\otimes E_ \right ) = \sum_E_\otimes\Phi(E_) \in \mathbb ^ :is positive, where E_ \in \mathbb^ is the matrix with 1 in the -th entry and 0s elsewhere. (The matrix ''C''Φ is sometimes called the ''Choi matrix'' of .) :(iii) is completely positive. Proof (i) implies (ii) We observe that if :E=\sum_E_\ot ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trace Class
In mathematics, specifically functional analysis, a trace-class operator is a linear operator for which a trace may be defined, such that the trace is a finite number independent of the choice of basis used to compute the trace. This trace of trace-class operators generalizes the trace of matrices studied in linear algebra. All trace-class operators are compact operators. In quantum mechanics, mixed states are described by density matrices, which are certain trace class operators. Trace-class operators are essentially the same as nuclear operators, though many authors reserve the term "trace-class operator" for the special case of nuclear operators on Hilbert spaces and use the term "nuclear operator" in more general topological vector spaces (such as Banach spaces). Note that the trace operator studied in partial differential equations is an unrelated concept. Definition Suppose H is a Hilbert space and A : H \to H a bounded linear operator on H which is non-negative ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
