Glossary

Revision as of 07:46, 10 March 2019 by Shraddha (talk | contribs) (Created page with "Quantum computation is marked by a set of unitary matrices (quantum gates) acting on qubit states followed by measurement. The most used representation is the circuit model of...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Quantum computation is marked by a set of unitary matrices (quantum gates) acting on qubit states followed by measurement. The most used representation is the circuit model of computation, comprising straight lines and boxes. The horizontal lines represent qubits and boxes represent single qubit unitary gates. A two qubit unitary gate links one qubit from another via vertical lines. Some useful notations are given below.

Quantum States

  •  
  • Bell/ EPR pairs:
  • GHZ States:
  • W States:

Unitary Operations

  • X (NOT gate):  
  • Z (Phase gate):  

Thus,  ,   are eigenstates of Z gate and Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle |+\rangle} ,   are eigenstates of X gate.

  • H (Hadamard gate):   or  

 

  • Controlled-U(CU): uses two inputs, control qubit and target qubit. It operates U on the second(target) qubit only when the first (source) qubit is 1. C-U gates are used to produce entangled states, when the target qubit is   and control qubit is not an eigenstate of U. In the given equation 'i' denotes the source qubit and 'j', the target qubit. Following are two important C-U gates.

 
 

The commutation relations for the above gates are as follows:
 
 

Hierarchy of Quantum Gates

There are different class of quantum gates as follows,

  • Pauli Gates(U): Single Qubit Gates I (Identity), X, Y, Z. All the gates in this set follow  
  • Clifford Gates(C): Pauli Gates, Phase Gate, C-NOT. This set of gates can be simulated on classical computer. All the gates in this set follow CU=U'C, where U and U' are two different Pauli gates depending on C
  • Universal Set of gates: This set consists of all Clifford gates and one Non-Clifford gate (T gate). If a model can realise Universal Set of gates, it can imlement any quantum computation efficiently. T gates follow  , where P is the phase gate and U, U' are any two Pauli gates depending on C. Parameter   is obtained from U, such that  ,  .

To summarize, if  P,  C,  T, then  

Magic States

Eigen states of T gates

Universal Resource

A set of \ket{+_\theta} states on which applying Clifford operations is enough for universal quantum computation.

Classical Quantum State

Density Matrices

Fidelity

Superposition

Discrete Variables and Continuous Variables

Entanglement

Measurement