|
Holevo's Theorem
Holevo's theorem is an important limitative theorem in quantum computing, an interdisciplinary field of physics and computer science. It is sometimes called Holevo's bound, since it establishes an upper bound to the amount of information that can be known about a quantum state (accessible information). It was published by Alexander Holevo in 1973. Accessible information As for several concepts in quantum information theory, accessible information is best understood in terms of a 2-party communication. So we introduce two parties, Alice and Bob. Alice has a ''classical'' random variable ''X'', which can take the values with corresponding probabilities . Alice then prepares a quantum state, represented by the density matrix ''ρX'' chosen from a set , and gives this state to Bob. Bob's goal is to find the value of ''X'', and in order to do that, he performs a measurement on the state ''ρ''''X'', obtaining a classical outcome, which we denote with ''Y''. In this context, the amount ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Computing
Quantum computing is a type of computation whose operations can harness the phenomena of quantum mechanics, such as superposition, interference, and entanglement. Devices that perform quantum computations are known as quantum computers. Though current quantum computers may be too small to outperform usual (classical) computers for practical applications, larger realizations are believed to be capable of solving certain computational problems, such as integer factorization (which underlies RSA encryption), substantially faster than classical computers. The study of quantum computing is a subfield of quantum information science. There are several models of quantum computation with the most widely used being quantum circuits. Other models include the quantum Turing machine, quantum annealing, and adiabatic quantum computation. Most models are based on the quantum bit, or "qubit", which is somewhat analogous to the bit in classical computation. A qubit can be in a 1 or 0 quantum s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Instrument
In physics, a quantum instrument is a mathematical abstraction of a quantum measurement, capturing both the classical and quantum outputs. It combines the concepts of measurement and quantum operation. It can be equivalently understood as a quantum channel that takes as input a quantum system and has as its output two systems: a classical system containing the outcome of the measurement and a quantum system containing the post-measurement state. Definition Let X be a countable set describing the outcomes of a measurement, and let \_ denote a collection of trace-non-increasing completely positive maps, such that the sum of all \mathcal_x is trace-preserving, i.e. \operatorname\left(\sum_x\mathcal_x(\rho)\right)=\operatorname(\rho) for all positive operators \rho . Now for describing a quantum measurement by an instrument \mathcal , the maps \mathcal_x are used to model the mapping from an input state \rho to the output state of a measurement conditioned on a classica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Mechanical Entropy
In physics, a quantum (plural quanta) is the minimum amount of any physical entity (physical property) involved in an interaction. The fundamental notion that a physical property can be "quantized" is referred to as "the hypothesis of quantization". This means that the magnitude of the physical property can take on only discrete values consisting of integer multiples of one quantum. For example, a photon is a single quantum of light (or of any other form of electromagnetic radiation). Similarly, the energy of an electron bound within an atom is quantized and can exist only in certain discrete values. (Atoms and matter in general are stable because electrons can exist only at discrete energy levels within an atom.) Quantization is one of the foundations of the much broader physics of quantum mechanics. Quantization of energy and its influence on how energy and matter interact (quantum electrodynamics) is part of the fundamental framework for understanding and describing nature. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Computation And Quantum Information (book)
''Quantum Computation and Quantum Information'' is a textbook about quantum information science written by Michael Nielsen and Isaac Chuang, regarded as a standard text on the subject. It is informally known as "Mike and Ike", after the candies of that name. The book assumes minimal prior experience with quantum mechanics and with computer science, aiming instead to be a self-contained introduction to the relevant features of both. (Lov Grover recalls a postdoc disparaging it with the remark, "The book is too elementary – it starts off with the assumption that the reader does not even know quantum mechanics.") The focus of the text is on theory, rather than the experimental implementations of quantum computers, which are discussed more briefly. , the book has been cited over 39,000 times on Google Scholar. In 2019, Nielsen adapted parts of the book for his ''Quantum Country'' project. Table of Contents (Tenth Anniversary Edition) * Chapter 1: Introduction and Overview ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Superdense Coding
In quantum information theory, superdense coding (also referred to as ''dense coding'') is a quantum communication protocol to communicate a number of classical bits of information by only transmitting a smaller number of qubits, under the assumption of sender and receiver pre-sharing an entangled resource. In its simplest form, the protocol involves two parties, often referred to as Alice and Bob in this context, which share a pair of maximally entangled qubits, and allows Alice to transmit two bits (''i.e.'', one of 00, 01, 10 or 11) to Bob by sending only one qubit. This protocol was first proposed by Charles H. Bennett and Stephen Wiesner in 1970 Memorial blog post by Or Sattath, with scan of Bennett's handwritten notes from 1970. See als [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a + bi, where and are real numbers. Because no real number satisfies the above equation, was called an imaginary number by René Descartes. For the complex number a+bi, is called the , and is called the . The set of complex numbers is denoted by either of the symbols \mathbb C or . Despite the historical nomenclature "imaginary", complex numbers are regarded in the mathematical sciences as just as "real" as the real numbers and are fundamental in many aspects of the scientific description of the natural world. Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers. More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Qubit
In quantum computing, a qubit () or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state (or two-level) quantum-mechanical system, one of the simplest quantum systems displaying the peculiarity of quantum mechanics. Examples include the spin of the electron in which the two levels can be taken as spin up and spin down; or the polarization of a single photon in which the two states can be taken to be the vertical polarization and the horizontal polarization. In a classical system, a bit would have to be in one state or the other. However, quantum mechanics allows the qubit to be in a coherent superposition of both states simultaneously, a property that is fundamental to quantum mechanics and quantum computing. Etymology The coining of the term ''qubit'' is attributed to Benjamin Schumacher. In the acknowledgments of his 1995 paper, Schumacher states that the term ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joint Probability Distribution
Given two random variables that are defined on the same probability space, the joint probability distribution is the corresponding probability distribution on all possible pairs of outputs. The joint distribution can just as well be considered for any given number of random variables. The joint distribution encodes the marginal distributions, i.e. the distributions of each of the individual random variables. It also encodes the conditional probability distributions, which deal with how the outputs of one random variable are distributed when given information on the outputs of the other random variable(s). In the formal mathematical setup of measure theory, the joint distribution is given by the pushforward measure, by the map obtained by pairing together the given random variables, of the sample space's probability measure. In the case of real-valued random variables, the joint distribution, as a particular multivariate distribution, may be expressed by a multivariate cumulativ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Trace
In linear algebra and functional analysis, the partial trace is a generalization of the trace. Whereas the trace is a scalar valued function on operators, the partial trace is an operator-valued function. The partial trace has applications in quantum information and decoherence which is relevant for quantum measurement and thereby to the decoherent approaches to interpretations of quantum mechanics, including consistent histories and the relative state interpretation. Details Suppose V, W are finite-dimensional vector spaces over a field, with dimensions m and n, respectively. For any space A, let L(A) denote the space of linear operators on A. The partial trace over W is then written as \operatorname_W: \operatorname(V \otimes W) \to \operatorname(V). It is defined as follows: For T\in \operatorname(V \otimes W), let e_1, \ldots, e_m , and f_1, \ldots, f_n , be bases for ''V'' and ''W'' respectively; then ''T'' has a matrix representation : \ \quad 1 \leq k, i \leq m, ... [...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] |
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 Channel
In quantum information theory, a quantum channel is a communication channel which can transmit quantum information, as well as classical information. An example of quantum information is the state of a qubit. An example of classical information is a text document transmitted over the Internet. More formally, quantum channels are completely positive (CP) trace-preserving maps between spaces of operators. In other words, a quantum channel is just a quantum operation viewed not merely as the reduced dynamics of a system but as a pipeline intended to carry quantum information. (Some authors use the term "quantum operation" to also include trace-decreasing maps while reserving "quantum channel" for strictly trace-preserving maps.) Memoryless quantum channel We will assume for the moment that all state spaces of the systems considered, classical or quantum, are finite-dimensional. The memoryless in the section title carries the same meaning as in classical information theory: the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Quantum Computing")
