Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Open Systems & Information Dynamics

The Group of Dyadic Unitary Matrices

Alexis De Vos, Raphaël Van Laer, Steven Vandenbrande

Published Mar 1, 2012• 7 citations
Publisher

Abstract

We introduce the group DU (m) of m × m dyadic unitary matrices, i.e. unitary matrices with all entries having a real and an imaginary part that are both rational numbers with denominator of the form 2p(with p a non-negative integer). We investigate in detail the finite groups DU(1) and DU(2) and the discrete, but infinite groups DU(3) and DU(4). We further introduce the subgroup XDU (m) of DU (m), consisting of those members of DU (m) that have constant line sum 1. The study of XDU(2) and XDU(4) leads to conclusions concerning the synthesis of quantum computers acting on one and two qubits, respectively.

DOI
10.1142/s1230161212500035

Related papers

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

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

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

Alexis De Vos

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.

Open Systems & Information Dynamics•Mar 1, 2025•0 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, 2010•1 citation

Creating subgroups of U(2w) for quantum-minus computers

Alexis De Vos, Michiel Boes

Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S 2 w ; quantum computers on w qubits are isomorphic to the (Lie) unitary group U(2 w ). We investigate and classify groups X which represent computers intermediate between classical reversible computers and quantum computers. Such intermediate groups X may exist in three flavours: finite groups of order larger than (2 w )!, infinite but discrete groups, and Lie groups of dimension smaller than (2 w ). For our purpose, we start from 1-qubit transformations, represented by 2 × 2 unitary matrices. We call this group the creator. Its members are called gates and act on one qubit. Controlled gates are quantum circuits acting on w qubits, such that the 1-qubit transformation (applied to a particular qubit) depends on the state of the w − 1 other qubits. The controlled gates generate the group X of 2 w × 2 w matrices, called the creation. We discuss all creators of order up to 8. Additionally a creator of order 16 and one of order 192 are discussed.

Journal of Physics Conference Series•Mar 1, 2011•1 citation

Generators and Relations for the Group On(Z[1/2])

Sarah Meng Li, Neil J. Ross, Peter Selinger

We give a finite presentation by generators and relations for the group O_n(Z[1/2]) of n-dimensional orthogonal matrices with entries in Z[1/2]. We then obtain a similar presentation for the group of n-dimensional orthogonal matrices of the form M/sqrt(2)^k, where k is a nonnegative integer and M is an integer matrix. Both groups arise in the study of quantum circuits. In particular, when the dimension is a power of 2, the elements of the latter group are precisely the unitary matrices that can be represented by a quantum circuit over the universal gate set consisting of the Toffoli gate, the Hadamard gate, and the computational ancilla.

arXiv:2106.01175•Electronic Proceedings in Theoretical Computer Science•Sep 9, 2021•9 citations
We introduce the group DU (m) of m × m dyadic unitary matrices, i.e. unitary matrices with all entries having a real and an imaginary part that are both rational numbers with denominator of the form 2p(with p a non-negative integer). We investigate in detail the finite groups DU(1) and DU(2) and the discrete, but infinite groups DU(3) and DU(4). We further introduce the subgroup XDU (m) of DU (m), consisting of those members of DU (m) that have constant line sum 1. The study of XDU(2) and XDU(4) leads to conclusions concerning the synthesis of quantum computers acting on one and two qubits, respectively.
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.
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.
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S 2 w ; quantum computers on w qubits are isomorphic to the (Lie) unitary group U(2 w ). We investigate and classify groups X which represent computers intermediate between classical reversible computers and quantum computers. Such intermediate groups X may exist in three flavours: finite groups of order larger than (2 w )!, infinite but discrete groups, and Lie groups of dimension smaller than (2 w ). For our purpose, we start from 1-qubit transformations, represented by 2 × 2 unitary matrices. We call this group the creator. Its members are called gates and act on one qubit. Controlled gates are quantum circuits acting on w qubits, such that the 1-qubit transformation (applied to a particular qubit) depends on the state of the w − 1 other qubits. The controlled gates generate the group X of 2 w × 2 w matrices, called the creation. We discuss all creators of order up to 8. Additionally a creator of order 16 and one of order 192 are discussed.
We give a finite presentation by generators and relations for the group O_n(Z[1/2]) of n-dimensional orthogonal matrices with entries in Z[1/2]. We then obtain a similar presentation for the group of n-dimensional orthogonal matrices of the form M/sqrt(2)^k, where k is a nonnegative integer and M is an integer matrix. Both groups arise in the study of quantum circuits. In particular, when the dimension is a power of 2, the elements of the latter group are precisely the unitary matrices that can be represented by a quantum circuit over the universal gate set consisting of the Toffoli gate, the Hadamard gate, and the computational ancilla.