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

Wiley eBooks

Quantum Schemes for Multiplication of 2‐Qubits

Artyom M. Grigoryan, Sos S. Agaian

Published Feb 10, 2025• 0 citations
Publisher

Abstract

This chapter describes a few quantum schemes for the multiplication matrix of 2-qubits. The matrix will be diagonalized by using the DsiHT with Givens rotations. The chapter also describes the method of QD-decomposition. It presents a system of coordinates in the 4-D space, which allows for factorization of the matrix. The chapter examines examples of such matrices which relate to different 4-point Hadamard transforms. It describes quantum scheme for the 4 × 4 gate of division of 2-qubits. The chapter considers a few examples of the parameterized matrix of multiplication A φ1 . It also considers different unitary matrices with coefficients ±1, that is Hadamard matrices.

DOI
10.1002/9781394265183.ch11

Related papers

Quantum Circuit Implementation of Two Matrix Product Operations and Elementary Column Transformations

Yu-Hang Liu, Yuan-Hong Tao, Jing-Run Lan +1 more

This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs.

quant-pharXiv:2511.02413•Nov 5, 2025•1 citation

DECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATES

Chi-Kwong Li, Rebecca Roberts, Xiaoyan Yin

A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2n-1(2n-1) fully controlled single-qubit gates chosen from 2n-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.

arXiv:1210.7366•International Journal of Quantum Information•Feb 1, 2013•56 citations

Bilaterally Symmetrical Transformation between Independent Operators and Rotations

Nikolay Raychev

This report describes an approach for representation of quantum operators through rotations and rotation through quantum operators. The approach of the proposed method transforms rotation in a kind of a unitary matrix that corresponds to the rotation. Operations with qubits are very similar to the rotation, but with an added phase coefficient. This fact is used to create a process for rotation between unitary matrices. This approach could be used to modifying the controls to apply in a different basis.

Journal of Quantum Information Science•Jan 1, 2015•4 citations

Reconstructing the Hadamard Gate from Euler-Angle Parameters

P. K. Majumdar

This notebook implements the general single-qubit unitary matrix U(θ, φ, λ) and evaluates it for θ = π/2, φ = 0 and λ = π. It compares the generated array with the exact Hadamard matrix, uses matrix multiplication to verify their equivalence, and independently confirms that the resulting operator satisfies the unitarity condition U†U = I. The exercise demonstrates how familiar quantum gates can be recovered as particular cases of a general parameterised single-qubit transformation.

•Aug 19, 2026•0 citations

Introduction to Quantum Computing

Dietmar Hildenbrand

In this chapter, we introduce quantum computing. We will see that the operations of quantum computing can be understood as algebraic transformations such as reflections or rotations of a so-called state vector. As example computing gate we use the NOT-operation, the Hadamard transform as well as the CNOT-operation.

Chapman & Hall/CRC eBooks•Aug 31, 2021•2 citations

Matrix Formulation of Quantum Mechanics

Arjun Sharma

This chapter deals with the matrix and vector formulation of quantum mechanics. Topics covered under the chapter are: matrices and their basic algebra, bra and ket notations, vector space and the basis vectors, inner and outer products of vectors, the orthogonalization procedure for vectors, the Schwarz inequality, linear transformation of a vector, eigenvalues and eigenvectors of a matrix, numerical methods to find eigenvalue and eigenvector, different types of matrices used in quantum mechanics, diagonalization of a matrix, the Cayley-Hamilton theorem, change of basis in a vector space and the unitary transformations, infinite-dimensional and Hilbert spaces, representation of quantum states and operators in Hilbert space, the Schrödinger equation in matrix form, assumptions of quantum mechanics in matrix formulations, the general uncertainty principle, the one dimensional harmonic oscillator, solved examples and unsolved exercises. The objectives of this chapter are to introduce the important aspects of vector and matrix algebra that have been vital in the development and the description of modern quantum mechanics and in exhibiting that the Heisenberg and Schrödinger approaches to quantum mechanics are equivalent.

CRC Press eBooks•Jun 18, 2021•0 citations
This chapter describes a few quantum schemes for the multiplication matrix of 2-qubits. The matrix will be diagonalized by using the DsiHT with Givens rotations. The chapter also describes the method of QD-decomposition. It presents a system of coordinates in the 4-D space, which allows for factorization of the matrix. The chapter examines examples of such matrices which relate to different 4-point Hadamard transforms. It describes quantum scheme for the 4 × 4 gate of division of 2-qubits. The chapter considers a few examples of the parameterized matrix of multiplication A φ1 . It also considers different unitary matrices with coefficients ±1, that is Hadamard matrices.
This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs.
A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2n-1(2n-1) fully controlled single-qubit gates chosen from 2n-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.
This report describes an approach for representation of quantum operators through rotations and rotation through quantum operators. The approach of the proposed method transforms rotation in a kind of a unitary matrix that corresponds to the rotation. Operations with qubits are very similar to the rotation, but with an added phase coefficient. This fact is used to create a process for rotation between unitary matrices. This approach could be used to modifying the controls to apply in a different basis.
This chapter deals with the matrix and vector formulation of quantum mechanics. Topics covered under the chapter are: matrices and their basic algebra, bra and ket notations, vector space and the basis vectors, inner and outer products of vectors, the orthogonalization procedure for vectors, the Schwarz inequality, linear transformation of a vector, eigenvalues and eigenvectors of a matrix, numerical methods to find eigenvalue and eigenvector, different types of matrices used in quantum mechanics, diagonalization of a matrix, the Cayley-Hamilton theorem, change of basis in a vector space and the unitary transformations, infinite-dimensional and Hilbert spaces, representation of quantum states and operators in Hilbert space, the Schrödinger equation in matrix form, assumptions of quantum mechanics in matrix formulations, the general uncertainty principle, the one dimensional harmonic oscillator, solved examples and unsolved exercises. The objectives of this chapter are to introduce the important aspects of vector and matrix algebra that have been vital in the development and the description of modern quantum mechanics and in exhibiting that the Heisenberg and Schrödinger approaches to quantum mechanics are equivalent.