# Glossary

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.

## Contents

- 1 Quantum States
- 2 Unitary Operations
- 3 Hierarchy of Quantum Gates
- 4 Magic States
- 5 Universal Resource
- 6 Superposition
- 7 Entangled States
- 8 EPR Pairs
- 9 Bell States
- 10 Bell State Measurement
- 11 Fidelity
- 12 Density Matrix, Pure and Mixed states
- 13 Unitary transformation
- 14 Monogomy of entanglement
- 15 Ancilla or Ancillary states
- 16 Bloch Sphere
- 17 Quantum One Way Function
- 18 Gate Teleportation
- 19 Graph states
- 20 Measurement Based Quantum Computation (MBQC)
- 21 Quantum SWAP test
- 22 Quantum Capable Homomorphic Encryption
- 23 References

### Quantum States[edit]

**X basis/Diagonal basis/x basis:****Z basis/Rectilinear basis/+ basis:**

### Unitary Operations[edit]

- :
- :

Thus, , are eigenstates of Z gate and , are eigenstates of X gate.

- : or
- : Gates in this class operate on a single qubit. They are represented by 2 x 2 matrices of the form , as shown below. Here is the phase shift.

- : 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[edit]

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[edit]

It is any state that, if you have an unlimited supply of them, can be used to give you universal quantum computation when used in conjunction with perfect Clifford operations. The standard example is that if you can produce the state , then you can combine this with Clifford operations in order to apply a T gate, and we know that T+Clifford is universal.

### Universal Resource[edit]

A set of states on which applying Clifford operations is enough for universal quantum computation.

### Superposition[edit]

Superposition is a fundamental concept in quantum mechanics which states if two states and are representing two valid state in a Hilbert space, their linear combination exist in the same Hilbert space as well and refer to another valid states. We call state a superposition of the two states. This property leads to most of the non-classical properties of quantum mechanics such as entanglement.

### Entangled States[edit]

An entangled state is the quantum state of a group of particled (or a two party or multiparty system) that cannot be described as the independent states of these particles (or subsystems). The subsystems of such a quantum state, have quantum correlation even over a long distance. Mathematically, a multiparty entangled state cannot be written in following way:

The states that can be written in the above from, are called separable states.

### EPR Pairs[edit]

EPR pairs refer to the pairs of particles with a conjugate physical property such as angular momentum. This concept has been introduced for the first time by the EPR (Einstein–Podolsky–Rosen) paradox which is a thought experiment challenging the explanation of physical reality provided by Quantum Mechanics.
The particles that have been used in the EPR paradox had perfect correlation in such a way that measuring a quantity of a particle A will cause the conjugated quantity of particle B to become undetermined, even if there was no contact, no classical disturbance. A two party quantum state with above property can be described with the following state:

This is one of the Bell states.

### Bell States[edit]

Bell states are maximally-entangled two-qubit states. These are the states that violate the Bell's inequality with maximal value of . These states make a compelete basis for the two-qubit (4 dimensional) Hilbert space:

### Bell State Measurement[edit]

Bell state measurement is termed as the projection of two qubits into one of the four Bell States as described above. It is done operating a Hadamard gate on one qubit and then, operating a C-NOT gate with this qubit as control and the other qubit as target. More on BSM can be found in [1]

### Fidelity[edit]

The Fidelity is a quantum distance measure between two quantum states. For two general state $\rho$ and $\sigma$ it is defined as followes:

The definition reduces to the squared overlap between the pure states :

### Density Matrix, Pure and Mixed states[edit]

A density matrix is the matrix representation of a statistical state in quantum mechanics. This is a useful representation for mixed states. The mixed states are the states which cannot be described with a single vector $|\psi\rangle$ in Hilbert space. Instead, they are statistical mixture of several pure states. These states are also useful for describing the quantum state of a subsystem of a multi-party or larger quantum sysytem where the overall state can be shown as pure states. a density matrix in general can be shown as:

where are pure states and are the relative probabilities. For a pure quantum state the density matrix representation will be:

### Unitary transformation[edit]

A unitary transformation is an isomorphism between two Hilbert spaces, These transformation preserve the inner products of the vector states and can be shown as matrices where .

### Monogomy of entanglement[edit]

Monogamy is one of the most fundamental properties of entanglement and can, in its extremal form, be expressed as follows: If two qubits A and B are maximally quantumly correlated they cannot be correlated at all with a third qubit C. In general, there is a trade-off between the amount of entanglement between qubits A and B and the same qubit A and qubit C. This is mathematically expressed as:

where is a measure for entanglement.

### Ancilla or Ancillary states[edit]

Ancillary states are extra states used in some quantum algorithms and are usually measured or discarded at the end of the procedure or they represent the state of an extra quantum system that is used for computation or etc.

### Bloch Sphere[edit]

In quantum mechanics, the Bloch sphere is a geometrical representation of the pure state space of a two-level quantum mechanical system (qubit). The Bloch sphere is a unit 2-sphere, with antipodal points corresponding to a pair of mutually orthogonal state vectors. The north and south poles of the Bloch sphere are typically chosen to correspond to the standard basis vectors , respectively, which in turn might correspond e.g. to the spin-up and spin-down states of an electron. This choice is arbitrary, however. The points on the surface of the sphere correspond to the pure states of the system, whereas the interior points correspond to the mixed states.

### Quantum One Way Function[edit]

**Classical To Quantum QOWF**

Based on the fundamental principles of quantum mechanics, QOWF was proposed by Gottesman and Chuang [2] and its definition is presented as follows.

**Definition 1** Let k, be classical bits string of length , quantum state of qubits, respectively. A function , where satisfies for , is called a QOWF under physical mechanics if

- Easy to compute: The mapping is easy to compute by a quantum polynomial-time algorithm.
- Hard to invert: Given , it is impossible to invert k by virtue of fundamental quantum information theory.

### Gate Teleportation[edit]

The idea comes from one-qubit teleporation. This means that one can transfer an unknown qubit |ψi without actually sending it via a quantum channel. The underlying equations explain the notion. See Figure 1 for circuit.

Similarly if we have the input state rotated by a gate the circuit would look like Figure 2a. As the rotation gate commutes with Controlled-Phase gate. Hence, Figure 2b is justified.

This shows that for a pair of entangled qubits, if the second qubit is in state (not an eigen value of ) then one can teleport (transfer) the first qubit state operated by any unitary gate to the second qubit by performing operations only on the first qubit and measuring it. Next, we would need to make certain Pauli corrections (in this case ) to obtain . In other words, we can say the operated state is teleported to the second qubit by a rotated basis measurement of the first qubit with additional Pauli corrections.

### Graph states[edit]

The above operation can also be viewed as a graph state with two nodes and one edge. The qubit 1 is measured in a rotated basis , thus leaving qubit 2 in desired state and Pauli Correction , where is the measurement outcome of qubit 1. See Figure 3

Now, suppose we need to operate the state with two unitary gates and . This can be done by taking the output state of gate as the input state of gate and then repeating gate teleportation for this setup, as described above. Thus, following the same pattern for graph states we have now three nodes (two measurement qubits for two operators and one output qubit) with two edges, entangled as one dimensional chain (See Figure 4).

The measurement on qubit will operate on qubits and . If qubit when measured in the given basis yields outcome , qubit results in the following state . Using the relation we shift all the Pauli corrections to one end i.e. qubit becomes (). This method of computation requires sequential measurement of states i.e. all the states should not be measured simultaneously. As outcome of qubit can be used to choose sign of . This technique is also known as adaptive measurement. With each measurement, the qubits before the one measured at present have been destroyed by measurement. It is a feed-forward mechanism, hence known as one way quantum computation.

### Measurement Based Quantum Computation (MBQC)[edit]

MBQC is a formalism used for quantum computation by operating only single qubit measurements on a fixed set of entangled states, also known as graph states. Graph states denote any graph where each node represents a quantum state, and the edges denote entanglement between any two vertices. The measurement on successive layers of qubits is decided by previous measurement outcomes. Outcomes of last qubit layer gives the result of concerned computation. Following, we illustrate certain primitives necessary to understand the working of MBQC.

#### Cluster States[edit]

In case of multi-qubit quatum circuits, one needs a 2-dimensional graph state. Cluster State is a square lattice used as substrate for such computation. All the nodes are in entangled by indicated by the edges. It is known to be universal i.e. it can simulate any quatum gate.

Each row would thus represent the teleporation of starting qubit in that row horizontally. On the other hand, vertical edges indicate different input qubits linked with multi-qubit gates (same as circuit model). For example, see Figure Figure 6 to understand the conversion from circuit model to graph state model. As the computation relation follows , thus, Figure Figure 6a represents Circuit diagram for gate in terms of gate and Single Qubit Gate .

Figure 6b shows implementation of the first Hadamard gate on the second input state as measurement on qubit . Then gate is implemented by the entangled qubits and in the graph state. Qubit is entangled to another qubit to record the output while measurement on qubit implements the second Hadamard gate. Finally, the states to which qubits and are reduced to determine the output states of the two input qubits after gate operation.

It is evident that one needs to remove certain nodes from the cluster state in order to implement the above shown graph state. This can be done by Z-basis measurements. Such measurements would leave the remaining qubits in the cluster state with extra Pauli corrections. This can be explained as follows. Consider a two-dimesional graph state . If qubit is to be eliminated, we operate with as target and as control.

Thus, if measurement on yields , qubit would be in the state . Hence, such Z-basis measurements invoke an extra Pauli correction on all the neighbouring sites of 1 with 1 eliminated, in the resulting graph state.
Thus, to summarise, we design a measurement pattern from gate teleportation circuit of the desired computation as shown above. The cluster state is converted into the required graph state by Z-basis measurement on extraneous sites. Measuring all the qubits in the required basis and we get the required computation in the form of classical outcome register from measurement of the last layer of qubits. If it is a quantum function, the last layer of qubits is the output quantum register.

#### Brickwork States[edit]

Although cluster states are universal for MBQC, yet we need to tailor these to the specific computation by performing some computational (Z) basis measurements. If we were to use this principle for blind quantum computing, Client would have to reveal information about the structure of the underlying graph state. Thus, for the UBQC protocol, we introduce a new family of states called the Brickwork states which are universal for X − Y plane measurements and thus do not require the initial computational basis measurements. It was later shown that the Z-basis measurements can be dropped for cluster states and hence cluster states are also universal in X-Y measurements.

**Definition 1** *A brickwork state Gn×m, where m ≡ 5 (mod 8), is an entangled state of n × m qubits constructed as follows (see also Figure 7):*

*Prepare all qubits in state |+i and assign to each qubit an index (i,j), i being a column (i ∈ [n]) and j being a row (j ∈ [m]).**For each row, apply the operator c-Z on qubits (i,j) and (i,j + 1) where 1 ≤ j ≤ m − 1.**For each column j ≡ 3 (mod 8) and each odd row i, apply the operator c-Z on qubits (i,j) and (i + 1,j) and also on qubits (i,j + 2) and (i + 1,j + 2).**For each column j ≡ 7 (mod 8) and each even row i, apply the operator c-Z on qubits (i,j) and (i + 1,j) and also on qubits (i,j + 2) and (i + 1,j + 2).*

#### Cylinder Brickwork States[edit]

The cylinder brickwork state is a modification of the brickwork state of size , for even n, where the first and the last rows are connected such that the regular brickwork structure is preserved while introducing rotational symmetry. A tape , shown in Fig 8.3, present in a cylinder brickwork graph is the subgraph which includes all the states in the random rows and .

If all the nodes in of the graph are prepared in the dummy qubit state, where and the rest of the nodes are prepared in the state , then after entangling according to the cylinder brickwork state, the nodes are completely disentangled from the rest of the graph. The final obtained graph would be .

The steps to perform single trap verifiable universal blind quantum computing are:

- A random qubit is chosen to be the trap qubit (red node in Fig 8.1)
- All other vertices in the tape containing the trap qubit (solid black nodes in Fig 8.2), are set to be dummy qubits
- This results in an isolated trap qubit in the state together with many dummy qubits after entanglement operations (Fig 8.3)
- The net result, after discarding the dummy qubits, is a disentangled trap qubit in a product state with a brickwork state (Fig 8.4)

#### Flow Construction-Determinism[edit]

Measurement outcomes of qubits is not certain, hence it renders MBQC a non-deterministic model. This can still be rectified by invoking Pauli corrections based on the previous outcomes, as evident from above. For example, to implement Hadamard gate on input state , we consider the case of a two qubit graph state .

If one measures qubit i in basis and gets outcome s, qubit j reduces to,

As, the two possible output states are different, it shows this method is non-deterministic. One could end up with any of the two states and there is no certainty. Nevertheless, we observe that if X gate is operated on the second qubit after measurement if outcome is 1, both the equations would be same and hence, obtained state is .

Flow construction is the semanticism to construct the measurement pattern for a given graph state. It gives the Pauli corrections for a particular qubit in the graph state, called X and Z dependencies. In simpler words, it records the effect of shifting all Pauli X and Z corrections to the left of (after performing) Entanglement and Entanglement operations, respectively, for each qubit. The result is recorded as sets of X, Z corrections required for each site. These sets depend on the graph state and not the computation or measurement results. Hence, it can be computed while choosing the graph state for a required computation. Following we illustrate how to construct such models with ease using Measurement Calculus to invoke determinism in One-Way Quantum Computation(MBQC).

Choose a unitary gate for the circuit and hence, its measurement pattern. In order to implement this pattern on a graph state, there are four basic steps: Preparation, Entanglement, Measurement, Corrections.

**Preparation**prepares all input qubits in the required state, generally represented as where .**Entanglement**entangles all the qubits according to the required graph state. This operation is denoted by , where C-Z is operated with i as control qubit and j as target qubit.**Measurement**assigns measurement angle in X-Y plane for each qubit. Measurement operator is notated as : the qubit ’i’ would be measured in basis i.e. if the state is one gets outcome 0 and if the state is , the outcome is 1.**Correction**calculates all Pauli corrections to be applied on a given qubit in the pattern. The set of such parameters are called Dependencies for X and Z operators individually. To calculate all the Pauli Corrections on a given qubit, one needs to take into account the measurement outcomes of previous qubits as well as commutation relations. Both affect the Pauli corrections for a given qubit. Below is a formalism to explain the process with an example.

The effect of X gate on a measurement angle () in X-Y plane is to change its sign and Z gate is to add a phase .

We shall denote measurement in X-basis () as and Y-basis () as

Commutation relations:

The last second equation is implied from the fact that for , . Thus, X gate has no effect on measurement in X-basis for the given states. Using above notations we express the equation for circuit model of C-NOT from Figure 6 with two inputs and two outputs: Qubits: 1,2,3,4

Outcomes:

Circuit Operation:

Hence, we obtain a measurement pattern to implement C-NOT gate with a T-shaped graph state with three qubits entangled chain and 1 entangled to 3. X dependency sets for qubit , , , . Z dependency sets for qubit , , , . The measurements are independent of any outcome so they can all be performed in parallel. In the end, Pauli corrections are performed as such. Parity (modulo 2 sum) of all the previous outcomes in the dependency set is calculated for each qubit (i), for X () and Z (), separately. Thus, is operated on qubit i.

### Quantum SWAP test[edit]

Quantum SWAP test (1) helps to compare two quantum states and . An ancilla qubit is prepared here in the state and a controlled swap test is performed on two states and .

If = , then the ancilla qubit, after performing a Hadamard operation, yields when measurement is applied in computational basis. The SWAP test passes here.

If , then the ancilla qubit, after performing a Hadamard Gate and upon measurement, passes the test with probability and fails the test with probability . Hence, the SWAP test always passes for the same inputs and sometimes fails if they are different. By repeating the SWAP test, its efficiency can be amplified.

### Quantum Capable Homomorphic Encryption[edit]

**Homomorphic Encryption**

A homomorphic encryption scheme HE is a scheme to carry out classical computation from the Server while hiding the inputs, outputs and computation. It can be divided into following four stages.*Key Generation.*The algorithm (pk,evk,sk) ← HE.Keygen(1λ) takes a λ, a security parameter as input and outputs a public key encryption key pk, a public evaluation key evk and a secret decryption key sk.*Encryption.*The algorithm c ← HE.Encpk(µ) takes the public key pk and a single bit message µ ∈ {0,1} and outputs a ciphertext c. The notation HE.Encpk(µ;r) is be used to represent the encryption of a bit µ using randomness r.*Decryption*. The algorithm µ∗ ← HE.Decsk(c) takes the secret key sk and a ciphertext c and outputs a message µ∗ ∈ {0,1}.*Homomorphic Evaluation*The algorithm cf ← HE.Evalevk(f,c1,...,cl) takes the evaluation key evk, a function f : {0,1}l → {0,1} and a set of l ciphertexts c1,...,cl, and outputs a ciphertext cf. It must be the case that:

HE.Decsk(cf) = f(HE.Decsk(c1),...,HE.Decsk(cl)) (1) with all but negligible probability in λ. This means classical HE decrypts ciphertext bit by bit. HE scheme is compact if HE.Eval is independent of any inputs or computation. It is fully homomorphic if it can compute any boolean computation.

**Quantum Capable:**A classical HE scheme is quantum capable if it can be used to evaluate quantum circuits. Any HE scheme to be quantum capable requires the following two properties.*invariance of ciphertext:**natural XOR operation:*

## References[edit]

**contributed by Shraddha Singh*