IEEE International Symposium on Multiple-Valued Logic (ISMVL)

The Decomposition of U(n) into XU(n) and ZU(n)

Alexis De Vos, Stijn De Baerdemacker

Published May 1, 2014• 3 citations

Abstract

Any matrix of the unitary group U(n) can (up to a global phase) be decomposed into 2n-1 matrices from two subgroups, denoted XU(n) and ZU(n). This leads to the decomposition of an arbitrary quantum circuit into NEGATOR circuits and PHASOR circuits. The NEGATOR circuits are closely related to classical reversible computation.

DOI: 10.1109/ismvl.2014.38

Related papers

The decomposition of U(n) into XU(n) and ZU(n)

Alexis De Vos, Stijn De Baerdemacker

Any matrix of the unitary group U(n) can be decomposed into matrices from two subgroups, denoted XU(n) and ZU(n). This leads to decompositions of an arbitrary quantum circuit into NEGATOR circuits and PHASOR circuits. The NEGATOR circuits are closely related to classical reversible computation.

Jan 1, 20160 citations

On two subgroups of U(n), useful for quantum computing

Alexis De Vos, Stijn De Baerdemacker

As two basic building blocks for any quantum circuit, we consider the 1-qubit PHASOR circuit ϕ( θ ) and the 1-qubit NEGATOR circuit N ( θ ). Both are roots of the IDENTITY circuit. Indeed: both ϕ(0) and N (0) equal the 2 × 2 unit matrix. Additionally, the NEGATOR is a root of the classical NOT gate. Quantum circuits (acting on w qubits) consisting of controlled PHASORs are represented by matrices from ZU(2 w ); quantum circuits consisting of controlled NEGATORs are represented by matrices from XU(2 w ). Here, ZU( n ) and XU( n ) are subgroups of the unitary group U( n ): the group XU( n ) consists of all n × n unitary matrices with all 2 n line sums (i.e. all n row sums and all n column sums) equal to 1 and the group ZU( n ) consists of all n × n unitary diagonal matrices with first entry equal to 1. Any U( n ) matrix can be decomposed into four parts: U = exp( iα ) Z 1 XZ 2 , where both Z 1 and Z 2 are ZU( n ) matrices and X is an XU( n ) matrix. We give an algorithm to find the decomposition. For n = 2 w it leads to a four-block synthesis of an arbitrary quantum computer.

Journal of Physics Conference SeriesApr 13, 20159 citations

The synthesis of a quantum circuit

Alexis De Vos, Stijn De Baerdemacker

As two basic building blocks for any quantum circuit, we consider the 1-qubit NEGATOR(θ) circuit and the 1-qubit PHASOR(θ) circuit, extensions of the NOT gate and PHASE gate, respectively: NEGATOR(π) = NOT and PHASOR(π) = PHASE.Quantum circuits (acting on w qubits) consisting of controlled NEGATORs are represented by matrices from XU(2 w ); quantum circuits (acting on w qubits) consisting of controlled PHASORs are represented by matrices from ZU(2 w ).Here, XU(n) and ZU(n) are subgroups of the unitary group U(n): the group XU(n) consists of all n × n unitary matrices with all line sums equal to 1 and the group ZU(n) consists of all n × n unitary diagonal matrices with first entry equal to 1.We conjecture that any U(n) matrix can be decomposed into four parts: U = e iα Z1XZ2, where both Z1 and Z2 are ZU(n) matrices and X is an XU(n) matrix.For n = 2 w , this leads to a decomposition of a quantum computer into simpler blocks.

Cambridge University Press eBooksJan 1, 20144 citations

On two subgroups of U(n), important for quantum computing

Alexis De Vos, Stijn De Baerdemacker

ZU(n) and XU(n) are subgroups of the unitary group U(n): the group XU(n) consists of all n X n unitary matrices with all 2n line sums (i.e. all n row sums and all n column sums) equal to 1 and the group ZU(n) consists of all n X n unitary diagonal matrices with first entry equal to 1.

Jan 1, 20140 citations

The NEGATOR as a Basic Building Block for Quantum Circuits

Alexis De Vos, Stijn De Baerdemacker

Between (classical) reversible computation and quantum computation there exists an intermediate computational world, represented by unitary matrices that have all line sums equal to 1. All of these quantum circuits can be synthesized with the help of merely two building blocks: the NEGATOR and the singly controlled square root of NOT.

Open Systems & Information DynamicsMar 1, 201317 citations

Almost-classical quantum computers

Michiel Boes, Alexis De Vos, Jan De Beule

By means of a subgroup of the 2 X 2 unitary matrices, i.e. a subgroup Q of U(2), acting on a single qubit, we create a group X, acting on w qubits. If Q equals the group of order 2 consisting of the follower and the inverter, we recover S_{2^w}, i.e. the permutation matrices describing a classical reversible computer acting on w bits. If Q is another group of two 2 X 2 matrices, then a new kind of computing appears.

Jan 1, 20101 citation