Scribd
Upload
85 views

Matrices and Quantum Computing

1) Quantum computing uses quantum gates that operate on qubits, which can be in superposition, rather than classical bits. These gates are represented by unitary matrices. 2) Common quantum gates include the Hadamard gate and Pauli-X gate. The Hadamard gate maps qubit states to equal superpositions, represented by a 2x2 matrix. The Pauli-X gate acts as a NOT gate by flipping qubit states, represented by another 2x2 matrix. 3) Quantum circuits can implement any computation by decomposing the overall unitary matrix using techniques like QR decomposition and cosine-sine decomposition. This decomposition corresponds to sequences of quantum gates.

Uploaded by

PiyKakde
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
85 views

Matrices and Quantum Computing

1) Quantum computing uses quantum gates that operate on qubits, which can be in superposition, rather than classical bits. These gates are represented by unitary matrices. 2) Common quantum gates include the Hadamard gate and Pauli-X gate. The Hadamard gate maps qubit states to equal superpositions, represented by a 2x2 matrix. The Pauli-X gate acts as a NOT gate by flipping qubit states, represented by another 2x2 matrix. 3) Quantum circuits can implement any computation by decomposing the overall unitary matrix using techniques like QR decomposition and cosine-sine decomposition. This decomposition corresponds to sequences of quantum gates.

Uploaded by

PiyKakde
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

MATRICES AND QUANTUM COMPUTING

MATHS 2002 DIGITAL ASSIGNMENT 1

SLOT : C1+TC1 FACULTY :


PADMA R

Name:-Piyush Kakde Reg no.-16BCL0032


In quantum computing and specifically the quantum circuit model of computation, a quantum
gate (or quantum logic gate) is a basic quantum circuit operating on a small number of qubits.
They are the building blocks of quantum circuits, like classical logic gates are for
conventional digital circuits. Unlike many classical logic gates, quantum logic gates are
reversible. However, it is possible to perform classical computing using only reversible gates.
For example, the reversible Toffoli gate can implement all Boolean functions. This gate has a
direct quantum equivalent, showing that quantum circuits can perform all operations
performed by classical circuits. Quantum logic gates are represented by unitary matrices. The
most common quantum gates operate on spaces of one or two qubits, just like the common
classical logic gates operate on one or two bits. This means that as matrices, quantum gates
can be described by 2 2 or 4 4 unitary matrices.

Commonly used gates

Quantum gates are usually represented as matrices. A gate which acts on k qubits is
represented by a 2k x 2k unitary matrix. The number of qubits in the input and output of the
gate have to be equal. The action of the gate on a specific quantum state is found by
multiplying the vector which represents the state by the matrix representing the gate. In the
following, the vector representation of a single qubit is

and the vector representation of two qubits is


where |ab is the basis vector representing a state where the first qubit is in the state |a and
the second qubit in the state |b .

The Hadamard gate acts on a single qubit. It maps the basis state |0 to |0+|1 2 and |1 to
|0|1 2 , which means that a measurement will have equal probabilities to become 1 or 0.
It represents a rotation of about the axis (x + z)/ 2 . Equivalently, it is the combination of
two rotations, about the X-axis followed by /2 about the Y-axis. It is represented by the
Hadamard matrix:

Since HH = I where I is the identity matrix, H is indeed a unitary matrix.

The Pauli-X gate acts on a single qubit. It is the quantum equivalent of a NOT gate (with
respect to the standard basis |0 , |1 , which privileges the Z-direction) . It equates to a
rotation of the Bloch sphere around the X-axis by radians. It maps |0 to |1 and |1 to |0 .
Due to this nature, it is sometimes called bit-flip. It is represented by the Pauli matrix:

NOT NOT = I where I is the identity matrix.


Quantum Computing

1) Replace bit with qubit: two state quantum system, states |0>|1>

2) Quantum data states obey axioms of quantum mechanices

3) density matrix r: Hermitian matrix describing stochastic dispersion of

pure states |y>

Choice of diagonalizations specifies mixture

For x'=|y> y pure, unmixed density matrix is


r = | y><y| = xx- = xx*

All states pure for rest of talk


4) Quantum Computations : Apply 2n * 2n unitary matrix u to n qubit data strings.

Quantum Circuits

Quantum computation Complexity == size of quantum circuit

Typical choices of gates

Any two-qubit
one-qubit, and CNOTs

For X = NOT =
Good quantum circuit design: find tensor factors of computation u

Circuit Synthesis by QR Decomposition

Universality argument(1995): circuits for arbitrary u

Observation (2000): argument implements QR decomposition

In general, m = qr, with q unitary, r upper-triangular


q is made of Givens rotations
m unitary demands r = q* m unitary, i.e. r diagonal

two-qubit Givens rotation: G10,11 acts on |10> and |11> by 2x2 matrix v

QR reduction of 4 x 4 unitary
Summary of QR Circuit Synthesis

Breakthrough: Every unitary u possesses a quantum circuit.


Roughly, Givens rotations build circuit entry by entry.

This design philosophy often ignores underlying structure.

General philosophy recurs in circuit design:


Choose matrix decomposition
Produce circuits factorwise

Cosine-Sine Decomposition

Cosine-Sine Decomposition factors a 2n x 2n unitary u:

Remark: Decomposition of unitary matrix, not arbitrary matrix


Side matrices of C.S.D. do not change top qubit

Good choice (?) when measurement of single qubit is output

q-ph/0303039 (B-,Markov): Circuit for cosine-sine matrix

Thank You

You might also like