© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Open Systems & Information Dynamics

Quantum Computing with the Subgroup YU(n) of the Unitary Group U(n)

Alexis De Vos

Published Mar 1, 2025• 0 citations

Abstract

Starting from the three Pauli matrices, it is possible to construct a synthesis procedure for an arbitrary quantum circuit. A prominent role is played by X-circuits and Y-circuits. They constitute the [Formula: see text]-dimensional subgroups XU([Formula: see text]) and YU([Formula: see text]) of the [Formula: see text]-dimensional group U([Formula: see text]). The former are described by unitary matrices with all line sums equal to 1. The latter are described by unitary matrices with all weighted line sums equal to 1. Whereas the group XU([Formula: see text]) has been studied before, investigation of the group YU([Formula: see text]) is new.

DOI: 10.1142/s1230161225500027

Related papers

X, Y, and Z Subgroups of the Unitary Group

Alexis De Vos

The subgroups XU(2), YU(2), and ZU(2) of the unitary group U(2) allow to find twenty-four different decompositions of an arbitrary [Formula: see text] unitary matrix. Because the group YU(2) has not been considered before, 20 out of the 24 decompositions are new. Introducing this YU(2) group allows to highlight, within quantum circuit design, a symmetry similar to the threefold symmetry of the Pauli matrices of spin systems. Similar subgroups of the unitary group U([Formula: see text]) lead to various new decompositions of an arbitrary [Formula: see text] unitary matrix. Whereas for [Formula: see text] equal 2, this leads to the synthesis of single-qubit quantum gates, for [Formula: see text] equal a power of 2, this leads to new design methods for multiple-qubit circuits.

Open Systems & Information Dynamics•Aug 26, 2024•1 citation

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 Series•Apr 13, 2015•9 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, 2014•0 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 eBooks•Jan 1, 2014•4 citations

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, 2016•0 citations

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 (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.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2014•3 citations

Starting from the three Pauli matrices, it is possible to construct a synthesis procedure for an arbitrary quantum circuit. A prominent role is played by X-circuits and Y-circuits. They constitute the [Formula: see text]-dimensional subgroups XU([Formula: see text]) and YU([Formula: see text]) of the [Formula: see text]-dimensional group U([Formula: see text]). The former are described by unitary matrices with all line sums equal to 1. The latter are described by unitary matrices with all weighted line sums equal to 1. Whereas the group XU([Formula: see text]) has been studied before, investigation of the group YU([Formula: see text]) is new.

The subgroups XU(2), YU(2), and ZU(2) of the unitary group U(2) allow to find twenty-four different decompositions of an arbitrary [Formula: see text] unitary matrix. Because the group YU(2) has not been considered before, 20 out of the 24 decompositions are new. Introducing this YU(2) group allows to highlight, within quantum circuit design, a symmetry similar to the threefold symmetry of the Pauli matrices of spin systems. Similar subgroups of the unitary group U([Formula: see text]) lead to various new decompositions of an arbitrary [Formula: see text] unitary matrix. Whereas for [Formula: see text] equal 2, this leads to the synthesis of single-qubit quantum gates, for [Formula: see text] equal a power of 2, this leads to new design methods for multiple-qubit circuits.

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.

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.