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

Signals and communication technology

Lower Bound on Givens Rotation Matrices Decomposition of Quantum Fourier Transform

P. C. Karthik, G. K. Sandhia, M. Gayathri, R. Thilagavathy

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-3-031-68952-9_81

Related papers

Obtaining the Quantum Fourier Transform from the classical FFT with QR decomposition

Franklin de Lima Marquezino, Renato Portugal, F. D. Sasse

arXiv:1005.3730•Journal of Computational and Applied Mathematics•May 22, 2010•16 citations

Fourier Transforms and Quantum Computation

Umesh V. Vazirani

Lecture notes in computer science•Jan 1, 2002•6 citations

New Permutation-Free Quantum Circuits for Implementing 3- and 4-Qubit Unitary Operations

Artyom M. Grigoryan

The article presents the quantum signal-induced heap transform (QsiHT) method of the QR-decomposition of multi-qubit operations. This transform can be generated by a given signal, by using different paths, or orders, of processing the data. We propose using the concept of the fast path of calculation of the QsiHT and applying such transforms on each stage of the matrix decomposition. This allows us to build quantum circuits for multi-qubit unitary operation without permutations. Unitary operations with real and complex matrices are considered. The cases of 3- and 4-qubit operations are described in detail with quantum circuits. These circuits use a maximum of 28 and 120 Givens rotation gates for 3- and 4-qubit real operations, respectively. All rotations are performing only on adjacent bit planes. For complex unitary operation, each of the Givens gates is used in pairs with two Z-rotation gates. These two types of rotations and the global phase gate are the universal gate set for multi-qubit operations. The presented approach can be used for implementing quantum circuits for n-qubits when n≥2, with a maximum of (4n/2−2n−1) Givens rotations and no permutations.

Information•Jul 21, 2025•5 citations

Quantum Fourier transform over symmetric groups — improved result

Yasuhito Kawano, Hiroshi Sekigawa

Journal of Symbolic Computation•Nov 5, 2015•20 citations

Quantum Schemes for Multiplication of 2‐Qubits

Artyom M. Grigoryan, Sos S. Agaian

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.

Wiley eBooks•Feb 10, 2025•0 citations

The Quantum Fourier Transform and Its Applications

WORLD SCIENTIFIC eBooks•Aug 27, 2026•0 citations
The article presents the quantum signal-induced heap transform (QsiHT) method of the QR-decomposition of multi-qubit operations. This transform can be generated by a given signal, by using different paths, or orders, of processing the data. We propose using the concept of the fast path of calculation of the QsiHT and applying such transforms on each stage of the matrix decomposition. This allows us to build quantum circuits for multi-qubit unitary operation without permutations. Unitary operations with real and complex matrices are considered. The cases of 3- and 4-qubit operations are described in detail with quantum circuits. These circuits use a maximum of 28 and 120 Givens rotation gates for 3- and 4-qubit real operations, respectively. All rotations are performing only on adjacent bit planes. For complex unitary operation, each of the Givens gates is used in pairs with two Z-rotation gates. These two types of rotations and the global phase gate are the universal gate set for multi-qubit operations. The presented approach can be used for implementing quantum circuits for n-qubits when n≥2, with a maximum of (4n/2−2n−1) Givens rotations and no permutations.
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.