Add to ORKGZU(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.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.C
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S_{2^w}; qua...
The design of a quantum computer and the design of a classical computer can be based on quite simi...
The unitary group $U_N$ has a free analogue $U_N^+$, and the closed subgroups $G\subset U_N^+$ can b...
ZU(n) and XU(n) are subgroups of the unitary group U(n): the group XU(n) consists of all n X n unita...
ZU(n) and XU(n) are subgroups of the unitary group U(n): the group XU(n) consists of all n X n unita...
Quantum computation on w qubits is represented by the infinite unitary group U(2^w); classical rever...
As two basic building blocks for any quantum circuit, we consider the 1-qubit PHASOR circuit Phi(the...
We introduce the global unitary supergroup UOSp((3n + 1)/2|(3n − 1)/2) for an n-superqubit system, w...
The Clifford+T quantum computing gate library for single qubit gates can create all unitary matrices...
A complete and clear account of the classification of unitary reflection groups, which arise natural...
The complementarity relation between the unitary groups U(d) and U(n) within the symmetrical irreduc...
Any matrix of the unitary group U(n) can be decomposed into matrices from two subgroups, denoted XU(...
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S_{2^w}; qua...
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S_{2^w}; qua...
Any matrix of the unitary group U(n) can be decomposed into matrices from two subgroups, denoted XU(...
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S_{2^w}; qua...
The design of a quantum computer and the design of a classical computer can be based on quite simi...
The unitary group $U_N$ has a free analogue $U_N^+$, and the closed subgroups $G\subset U_N^+$ can b...
ZU(n) and XU(n) are subgroups of the unitary group U(n): the group XU(n) consists of all n X n unita...
ZU(n) and XU(n) are subgroups of the unitary group U(n): the group XU(n) consists of all n X n unita...
Quantum computation on w qubits is represented by the infinite unitary group U(2^w); classical rever...
As two basic building blocks for any quantum circuit, we consider the 1-qubit PHASOR circuit Phi(the...
We introduce the global unitary supergroup UOSp((3n + 1)/2|(3n − 1)/2) for an n-superqubit system, w...
The Clifford+T quantum computing gate library for single qubit gates can create all unitary matrices...
A complete and clear account of the classification of unitary reflection groups, which arise natural...
The complementarity relation between the unitary groups U(d) and U(n) within the symmetrical irreduc...
Any matrix of the unitary group U(n) can be decomposed into matrices from two subgroups, denoted XU(...
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S_{2^w}; qua...
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S_{2^w}; qua...
Any matrix of the unitary group U(n) can be decomposed into matrices from two subgroups, denoted XU(...
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S_{2^w}; qua...
The design of a quantum computer and the design of a classical computer can be based on quite simi...
The unitary group $U_N$ has a free analogue $U_N^+$, and the closed subgroups $G\subset U_N^+$ can b...