Search results
Results from the WOW.Com Content Network
Common quantum logic gates by name (including abbreviation), circuit form(s) and the corresponding unitary matrices. In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate (or simply quantum gate) is a basic quantum circuit operating on a small number of qubits.
In gate-based quantum computing, various sets of quantum logic gates are commonly used to express quantum operations. The following tables list several unitary quantum logic gates, together with their common name, how they are represented, and some of their properties.
Other examples of quantum logic gates derived from classical ones are the Toffoli gate and the Fredkin gate. However, the Hilbert-space structure of the qubits permits many quantum gates that are not induced by classical ones. For example, a relative phase shift is a 1 qubit gate given by multiplication by the phase shift operator:
A quantum gate array decomposes computation into a sequence of few-qubit quantum gates. A quantum computation can be described as a network of quantum logic gates and measurements. However, any measurement can be deferred to the end of quantum computation, though this deferment may come at a computational cost, so most quantum circuits depict a ...
The quantum harmonic oscillator; The quantum harmonic oscillator with an applied uniform field [1] The Inverse square root potential [2] The periodic potential The particle in a lattice; The particle in a lattice of finite length [3] The Pöschl–Teller potential; The quantum pendulum; The three-dimensional potentials The rotating system The ...
The classical analog of the CNOT gate is a reversible XOR gate. How the CNOT gate can be used (with Hadamard gates) in a computation.. In computer science, the controlled NOT gate (also C-NOT or CNOT), controlled-X gate, controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a quantum logic gate that is an essential component in the construction of a gate-based quantum computer.
A quantum circuit consists of simple quantum gates, each of which acts on some finite number of qubits. Quantum algorithms may also be stated in other models of quantum computation, such as the Hamiltonian oracle model. [7] Quantum algorithms can be categorized by the main techniques involved in the algorithm.
Modern philosophers reject quantum logic as a basis for reasoning, because it lacks a material conditional; a common alternative is the system of linear logic, of which quantum logic is a fragment. Mathematically, quantum logic is formulated by weakening the distributive law for a Boolean algebra, resulting in an orthocomplemented lattice .