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

Fourier Transforms and Quantum Computation

Umesh V. Vazirani

Lecture notes in computer science•Jan 1, 2002•5 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•4 citations

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

Quantum Fourier transform over symmetric groups — improved result

Yasuhito Kawano, Hiroshi Sekigawa

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

Synthesis of arbitrary SU(3) transformations of atomic qutrits

Nikolay V. Vitanov

Several scenarios are proposed and analyzed for engineering of arbitrary preselected SU(3) transformations of laser-driven atomic qutrits. Two of the most natural implementations of qutrits are considered, in which the three qutrit states are coupled to each other via two-photon transitions through either (i) a common state in a tripod linkage pattern or (ii) two upper states in an M-shaped linkage chain. The SU(3) transformation for the tripod qutrit can be realized by 3 Givens SU(2) rotations, which require 9 consecutive interaction steps. Alternatively, because under certain conditions the propagator of the tripod system reduces to the Householder reflection operator, any SU(3) transformation can be constructed physically by 3 Householder reflections, each of which is implemented in a single interaction step. As an example, the discrete Fourier transform can be synthesized by 7 consecutive interaction steps with Givens rotations or, alternatively, by only a single Householder reflection and a phase gate. For the M-qutrit, the propagator is given by coupled Householder reflections and it cannot be reduced to Givens rotations or independent Householder reflections. By using these coupled Householder reflections it is shown that an arbitrary SU(3) transformation of the M qutrit can be realized with just two fields in at most 3 interaction steps; the discrete Fourier transform, in particular, requires only 2 interaction steps.

Physical Review A•Mar 27, 2012•55 citations

Quantum Fourier Transform I

Hiu Yung Wong

Springer eBooks•Jun 21, 2023•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.
Several scenarios are proposed and analyzed for engineering of arbitrary preselected SU(3) transformations of laser-driven atomic qutrits. Two of the most natural implementations of qutrits are considered, in which the three qutrit states are coupled to each other via two-photon transitions through either (i) a common state in a tripod linkage pattern or (ii) two upper states in an M-shaped linkage chain. The SU(3) transformation for the tripod qutrit can be realized by 3 Givens SU(2) rotations, which require 9 consecutive interaction steps. Alternatively, because under certain conditions the propagator of the tripod system reduces to the Householder reflection operator, any SU(3) transformation can be constructed physically by 3 Householder reflections, each of which is implemented in a single interaction step. As an example, the discrete Fourier transform can be synthesized by 7 consecutive interaction steps with Givens rotations or, alternatively, by only a single Householder reflection and a phase gate. For the M-qutrit, the propagator is given by coupled Householder reflections and it cannot be reduced to Givens rotations or independent Householder reflections. By using these coupled Householder reflections it is shown that an arbitrary SU(3) transformation of the M qutrit can be realized with just two fields in at most 3 interaction steps; the discrete Fourier transform, in particular, requires only 2 interaction steps.