|
Glossary Of Quantum Computing
This glossary of quantum computing is a list of definitions of terms and concepts used in quantum computing, its sub-disciplines, and related fields. Notes References Further reading Textbooks * * * * * * * * * * * * * * * * * * Academic papers * * * * Table 1 lists switching and dephasing times for various systems. * * * * {{Glossaries of science and engineering Models of computation Quantum cryptography Information theory Computational complexity theory Classes of computers Theoretical computer science Open problems Computer-related introductions in 1980 Emerging technologies Glossaries of technology ... [...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] |
Logarithm
In mathematics, the logarithm is the inverse function to exponentiation. That means the logarithm of a number to the base is the exponent to which must be raised, to produce . For example, since , the ''logarithm base'' 10 of is , or . The logarithm of to ''base'' is denoted as , or without parentheses, , or even without the explicit base, , when no confusion is possible, or when the base does not matter such as in big O notation. The logarithm base is called the decimal or common logarithm and is commonly used in science and engineering. The natural logarithm has the number as its base; its use is widespread in mathematics and physics, because of its very simple derivative. The binary logarithm uses base and is frequently used in computer science. Logarithms were introduced by John Napier in 1614 as a means of simplifying calculations. They were rapidly adopted by navigators, scientists, engineers, surveyors and others to perform high-a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simulators
A simulation is the imitation of the operation of a real-world process or system over time. Simulations require the use of models; the model represents the key characteristics or behaviors of the selected system or process, whereas the simulation represents the evolution of the model over time. Often, computers are used to execute the simulation. Simulation is used in many contexts, such as simulation of technology for performance tuning or optimizing, safety engineering, testing, training, education, and video games. Simulation is also used with scientific modelling of natural systems or human systems to gain insight into their functioning, as in economics. Simulation can be used to show the eventual real effects of alternative conditions and courses of action. Simulation is also used when the real system cannot be engaged, because it may not be accessible, or it may be dangerous or unacceptable to engage, or it is being designed but not yet built, or it may simply not ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Emulators
In computing, an emulator is hardware or software that enables one computer system (called the ''host'') to behave like another computer system (called the ''guest''). An emulator typically enables the host system to run software or use peripheral devices designed for the guest system. Emulation refers to the ability of a computer program in an electronic device to emulate (or imitate) another program or device. Many printers, for example, are designed to emulate HP LaserJet printers because so much software is written for HP printers. If a non-HP printer emulates an HP printer, any software written for a real HP printer will also run in the non-HP printer emulation and produce equivalent printing. Since at least the 1990s, many video game enthusiasts and hobbyists have used emulators to play classic arcade games from the 1980s using the games' original 1980s machine code and data, which is interpreted by a current-era system, and to emulate old video game consoles. A hard ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cloud-based Quantum Computing
Cloud-based quantum computing is the invocation of quantum emulators, simulators or processors through the cloud. Increasingly, cloud services are being looked on as the method for providing access to quantum processing. Quantum computers achieve their massive computing power by initiating quantum physics into processing power and when users are allowed access to these quantum-powered computers through the internet it is known as quantum computing within the cloud. In 2016, IBM connected a small quantum computer to the cloud and it allows for simple programs to be built and executed on the cloud. In early 2017, researchers from Rigetti Computing demonstrated the first programmable cloud access using the pyQuil Python library. Many people from academic researchers and professors to schoolkids, have already built programs that run many different quantum algorithms using the program tools. Some consumers hoped to use the fast computing to model financial markets or to build more ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Entropy Of Entanglement
The entropy of entanglement (or entanglement entropy) is a measure of the degree of quantum entanglement between two subsystems constituting a two-part composite quantum system. Given a pure bipartite quantum state of the composite system, it is possible to obtain a reduced density matrix describing knowledge of the state of a subsystem. The entropy of entanglement is the Von Neumann entropy of the reduced density matrix for any of the subsystems. If it is non-zero, i.e. the subsystem is in a mixed state, it indicates the two subsystems are entangled. More mathematically; if a state describing two subsystems ''A'' and ''B'' , \Psi_\rangle=, \phi_A\rangle, \phi_B\rangleis a separable state, then the reduced density matrix \rho_A=\operatorname_B, \Psi_\rangle\langle\Psi_, =, \phi_A\rangle\langle\phi_A, is a pure state. Thus, the entropy of the state is zero. Similarly, the density matrix of ''B'' would also have 0 entropy. A reduced density matrix having a non-zero entropy is there ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Correlation Function (statistical Mechanics)
In statistical mechanics, the correlation function is a measure of the order in a system, as characterized by a mathematical correlation function. Correlation functions describe how microscopic variables, such as spin and density, at different positions are related. More specifically, correlation functions quantify how microscopic variables co-vary with one another on average across space and time. A classic example of such spatial correlations is in ferro- and antiferromagnetic materials, where the spins prefer to align parallel and antiparallel with their nearest neighbors, respectively. The spatial correlation between spins in such materials is shown in the figure to the right. Definitions The most common definition of a correlation function is the canonical ensemble (thermal) average of the scalar product of two random variables, s_1 and s_2, at positions R and R+r and times t and t+\tau: C (r,\tau) = \langle \mathbf(R,t) \cdot \mathbf(R+r,t+\tau)\rangle\ - \langle \mathbf( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fidelity Of Quantum States
In quantum mechanics, notably in quantum information theory, fidelity is a measure of the "closeness" of two quantum states. It expresses the probability that one state will pass a test to identify as the other. The fidelity is not a metric on the space of density matrices, but it can be used to define the Bures metric on this space. Given two density operators \rho and \sigma, the fidelity is generally defined as the quantity F(\rho, \sigma) = \left(\operatorname \sqrt\right)^2. In the special case where \rho and \sigma represent pure quantum states, namely, \rho=, \psi_\rho\rangle\!\langle\psi_\rho, and \sigma=, \psi_\sigma\rangle\!\langle\psi_\sigma, , the definition reduces to the squared overlap between the states: F(\rho, \sigma)=, \langle\psi_\rho, \psi_\sigma\rangle, ^2. While not obvious from the general definition, the fidelity is symmetric: F(\rho,\sigma)=F(\sigma,\rho). Motivation Given two random variables X,Y with values (1, ..., n) ( categorical random variab ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Expectation Value (quantum Mechanics)
In quantum mechanics, the expectation value is the probabilistic expected value of the result (measurement) of an experiment. It can be thought of as an average of all the possible outcomes of a measurement as weighted by their likelihood, and as such it is not the ''most'' probable value of a measurement; indeed the expectation value may have zero probability of occurring (e.g. measurements which can only yield integer values may have a non-integer mean). It is a fundamental concept in all areas of quantum physics. Operational definition Consider an operator A. The expectation value is then \langle A \rangle = \langle \psi , A , \psi \rangle in Dirac notation with , \psi \rangle a normalized state vector. Formalism in quantum mechanics In quantum theory, an experimental setup is described by the observable A to be measured, and the state \sigma of the system. The expectation value of A in the state \sigma is denoted as \langle A \rangle_\sigma. Mathematically, A is a ... [...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] |
Observable
In physics, an observable is a physical quantity that can be measured. Examples include position and momentum. In systems governed by classical mechanics, it is a real-valued "function" on the set of all possible system states. In quantum physics, it is an operator, or gauge, where the property of the quantum state can be determined by some sequence of operations. For example, these operations might involve submitting the system to various electromagnetic fields and eventually reading a value. Physically meaningful observables must also satisfy transformation laws that relate observations performed by different observers in different frames of reference. These transformation laws are automorphisms of the state space, that is bijective transformations that preserve certain mathematical properties of the space in question. Quantum mechanics In quantum physics, observables manifest as linear operators on a Hilbert space representing the state space of quantum states. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Clifford Gates
In quantum computing and quantum information theory, the Clifford gates are the elements of the Clifford group, a set of mathematical transformations which normalize the ''n''-qubit Pauli group, i.e., map tensor products of Pauli matrices to tensor products of Pauli matrices through conjugation. The notion was introduced by Daniel Gottesman and is named after the mathematician William Kingdon Clifford. Quantum circuits that consist of only Clifford gates can be efficiently simulated with a classical computer due to the Gottesman–Knill theorem. Clifford group Definition The Pauli matrices, : \sigma_0=I=\begin 1 & 0 \\ 0 & 1 \end, \quad \sigma_1=X=\begin 0 & 1 \\ 1 & 0 \end, \quad \sigma_2=Y=\begin 0 & -i \\ i & 0 \end, \text \sigma_3=Z=\begin 1 & 0 \\ 0 & -1 \end provide a basis for the density operators of a single qubit, as well as for the unitaries that can be applied to them. For the n-qubit case, one can construct a group, known as the Pauli group, according to : ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Quantum Computing")
