Quantum Gate Decomposition Algorithms: Sandia Report
Quantum Gate Decomposition Algorithms: Sandia Report
Quantum Gate Decomposition Algorithms: Sandia Report
SAND2006-3440
Unlimited Release
Printed July 2006
Prepared by
Sandia National Laboratories
Albuquerque, New Mexico 87185 and Livermore, California 94550
NOTICE: This report was prepared as an account of work sponsored by an agency of the
United States Government. Neither the United States Government, nor any agency thereof,
nor any of their employees, nor any of their contractors, subcontractors, or their employees,
make any warranty, express or implied, or assume any legal liability or responsibility for the
accuracy, completeness, or usefulness of any information, apparatus, product, or process
disclosed, or represent that its use would not infringe privately owned rights. Reference herein
to any specific commercial product, process, or service by trade name, trademark,
manufacturer, or otherwise, does not necessarily constitute or imply its endorsement,
recommendation, or favoring by the United States Government, any agency thereof, or any of
their contractors or subcontractors. The views and opinions expressed herein do not
necessarily state or reflect those of the United States Government, any agency thereof, or any
of their contractors.
Printed in the United States of America. This report has been reproduced directly from the best
available copy.
2
SAND2006-3440
Unlimited Release
Printed July 2006
Alexander Slepoy
Multiscale Composition Materials Methods
Sandia National Laboratories
P.O. Box 5800
Albuquerque, New Mexico 87185-MS1110
Abstract
3
4
CONTENTS
I. Introduction ................................................................................................................................7
II. Decomposition Algorithm .........................................................................................................8
A. Cosine-Sine Decomposition ................................................................................................8
B. Quantum Circuits ................................................................................................................9
C. Uniformly Controlled Gate .................................................................................................9
D. Gray Code Ordering ............................................................................................................9
III. References ..............................................................................................................................10
Distribution ...................................................................................................................................12
FIGURES
Figure 1. .Definition of the uniformly controlled rotation .............................................................9
Figure 2. .Quantum circuit realizing the gate and Binary reflected 3-bit Gray code ...................10
5
6
APS/123-QED
A. Slepoy
Sandia National Laboratories, Albuquerque, NM
(Dated: January 27, 2006)
Quantum computing algorithms can be conveniently expressed in a format of a quantum logical
circuits. Such circuits consist of sequential coupled operations, termed ”quantum gates”, on quan-
tum analogs of bits called qubits. We review a recently proposed method [1] for constructing general
”quantum gates” operating on n qubits, as composed of a sequence of generic elementary ”gates”.
7
2
D1 D1
L10 R01 L10
0,0 0,1
1 1
L11 D1,0 D1,1
R11 D0,0 D0,1 L11
L12 1
D3,3 1
D3,4 R21 D1,0 D1,1 L12
1
L3 1 1
D4,3 D4,4 R31 L13
1 1
D0,0 D0,1 R01
1 1
D1,0 D1,1 1
R1
.
1 1
D3,3 D3,4 R21
1 1 1
D4,3 D4,4 R3
The superscript refers to the iteration number. The trices now have a 2 × 2 block-diagonal structure. The
subscripts indicate position of block in its matrix struc- D matrices have two entries in each row connected with
ture. L, D and R matrices on the right are not the same a complimentary pair in another row by the cosine-sine
as the ones on the left, except in structure. Their entries relation. Each of these resulting matrices is termed a
are given by their respective decompositions. At the end uniformly controlled rotation.
of the recursion, we are left with a product of matrices
that have a special form. All the resulting L and R ma-
8
3
k
B. Quantum Circuits. Let Fm (Ra ) represent an uniformly controlled rotation.
k
A special case of such rotation is Fk+1 (Ra ), which has a
A quantum circuit is a convenient representation of the matrix representation
operators as they transform the state of a multi-qubit
Ra (α1 )1
array. In such circuits, the wires represent the state of
.
a qubit as they progress through the operations. The .
.
following quantum circuits were rendered using public
Ra (α2k )
domain software [5]. The circuit directly below is a rep-
resentation of three qubits, initialized to state |000i. where the rotation matrices are of the form
→
−
|0i Ra (φ) = eia· σ φ/2 = I (1)
|0i cos(φ/2) + i(a · − →
σ) (2)
|0i sin(φ/2). (3)
gates, where the operation on a given qubit is conditional
on the state of another qubit. The circuit below expresses R̃a (θ) R̃a (−θ)
a controlled operation in which the second qubit state is
flipped with a CNOT operation if the first qubit is set:
|0i • This is an important piece of information in understand-
|0i ing the decomposition procedure.
|0i
D. Gray Code Ordering.
C. Uniformly Controlled Gate. The authors propose an algorithm where a CNOT gate
is sandwiched between two single-qubit rotation opera-
The decomposed form of the arbitrary unitary operator tors on the slave qubit. These rotations are perpendic-
now consists of a product of operators, each of which is ular to the x axis to assure the decoupled action of the
a uniformly controlled rotation. These are single-qubit CNOTs. They minimize the number of single control
rotations controlled by a joint classical state of the rest CNOTs needed to accomplish this by ordering the rota-
of the qubits. The paper defines this rotation as Fmk
(Ra ), tions and their control states according to a cyclic binary
where the m-th qubit is controlled by the 2k classical Grey code. The reordering is permitted because the oper-
states of k other qubits, example in Fig.1. ations commute. Gray code arranges the control states so
that they only differ by a value of a single bit. A realiza-
tion of the uniform rotation F43 (Ra ) with the associated
Gray code ordering is depicted in Fig. 2. The position
of the control node in the lth CNOT gate matches the
position where the lth and (l + 1)s t bit strings gl−1 and
gl of the Gray code are different.
The first CNOT gate is set by the state of the 3rd
bit, the second CNOT gate is set by the 2nd bit, and
so on. It is clear that, for any of the basis vector input
states, CNOT gates destroy each other. The rotations are
FIG. 1: Definition of the uniformly controlled rotation additive since they share a common axis Ra (φ)Ra (ω) =
F43 (Ra ) . Here a is a three-dimensional vector fixing the ro- Ra (φ + ω) for any φ and ω. The resulting operation is
tation axis of the matrices Raj = R( αj ).
a rotation of the slave qubit through an angle which is
9
4
θ1 α1
. .
Mk = (4)
. .
θ 2k α2k
.
The matrix elements of Mk can be obtained from equa-
tion 1. A rotation angle θj is reversed if the lth bit of the
gj−1 bit string is 1. Then
k
Mij = (−1)bi−1 ·gj−1 , (5)
FIG. 2: (a) Quantum circuit realizing the gate F43 (Ra ) , where
a is perpendicular to the x axis. Here the authors have used
a notation R̃j (a) = Ra (θj ) . (b) Binary reflected 3-bit Gray where bi is a standard binary representation of the integer
code used to define the positions of the control nodes. The i and the exponent is a bitwise product of binary vectors.
black and white rectangles denote bit values one and zero, The inverse of Mk is (Mk )−1 = 2−k (M k )T , so θi can
respectively. be calculated by applying the inverse to the right hand
side of Eqn. 4. This means that any uniform rotation
k
operation Fm (Ra ) around the x-axis with k ≥ 1 needs
linearly constructed of the angles θj . The circuits in the at most 2 CNOT gates and 2k single qubit rotations
k
10
III. REFERENCES
1. M. Mottonen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Physical Review Letters
93, 130502 (2004, ISSN 0031-9007.
4. G. H. Golub and C. F. V. Loan, Matrix Computations (The Johns Hopkins University Press,
Baltimore, MD, USA, 1989), 2nd ed.
11
DISTRIBUTION:
12