A novel quantum circuit for the quantum Fourier transform

• URL: http://arxiv.org/abs/2507.08699v2
• Date: Mon, 28 Jul 2025 23:19:37 GMT
• Title: A novel quantum circuit for the quantum Fourier transform
• Authors: Juan M. Romero, Emiliano Montoya-González, Guillermo Cruz, Roberto C. Romero,
• Abstract summary: We introduce a new quantum circuit for implementing the Quantum Fourier Transform.<n>We show that this circuit is more efficient than the conventional design.<n>We also develop alternative versions of the HHL algorithm and Shor's algorithm.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum circuit for implementing the QFT. We show that this circuit is more efficient than the conventional design. Furthermore, using this circuit, we develop alternative versions of the HHL algorithm and Shor's algorithm, which also demonstrate improved performance compared to their standard implementations.

Related papers

• QRTlib: A Library for Fast Quantum Real Transforms [5.23032256592014]
  Real-valued transforms such as the discrete cosine, sine, and Hartley transforms play a central role in classical computing.<n>This article introduces QRTlib, a library for fast and practical implementations of quantum real transforms.<n>We develop new algorithms and circuit optimizations that make these transforms efficient and suitable for near-term devices.
  arXiv  Detail & Related papers  (2025-10-18T19:45:31Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Efficient Variational Quantum Algorithms via Circuit Knitting and Architecture Search [14.667623160371013]
  We introduce CKVQA, a framework that applies circuit knitting to variational quantum algorithms (VQAs)<n>CKVQA aims to minimize the sampling overhead by identifying parameterized quantum circuits that achieve a favorable balance between algorithmic performance and sampling overhead.<n>We have developed a subcircuit-level optimization method to accelerate the training of VQAs and reduce overall execution time.
  arXiv  Detail & Related papers  (2025-08-05T12:27:19Z)
• Compilation, Optimization, Error Mitigation, and Machine Learning in Quantum Algorithms [0.0]
  This paper discusses the compilation, optimization, and error mitigation of quantum algorithms.<n>Quantum algorithms running on a hybrid platform with QPU and CPU/GPU take advantage of existing high-performance computing power with quantum-enabled exponential speedups.
  arXiv  Detail & Related papers  (2025-06-18T14:56:16Z)
• RH: An Architecture for Redesigning Quantum Circuits on Quantum Hardware Devices [6.959884576408311]
  We present an architecture that enables the redesign of large-scale quantum circuits on quantum hardware.<n>By prepending a random quantum circuit module to the standard EQ-GAN framework, we extend its capability from quantum state learning to unitary transformation learning.
  arXiv  Detail & Related papers  (2024-12-30T12:05:09Z)
• Exploiting recursive structures for the design of novel quantum primitives [0.1227734309612871]
  This paper focuses on generating novel quantum primitives. We show how these structures can be exploited to design new, potentially advantageous quantum algorithms. We comment on the potential impact on quantum algorithms, numerical analysis, and signal processing.
  arXiv  Detail & Related papers  (2024-10-17T17:45:50Z)
• Circuit-Efficient Qubit-Excitation-based Variational Quantum Eigensolver [7.865137519552981]
  We present a circuit-efficient implementation of two-body Qubit-Excitation-Based (QEB) operator for building shallow-circuit wave function Ansatze. This work shows great promise for quantum simulations of electronic structures, leading to improved performance on current quantum hardware.
  arXiv  Detail & Related papers  (2024-06-17T16:16:20Z)
• Quantum conjugate gradient method using the positive-side quantum eigenvalue transformation [0.35794129023851595]
  We introduce the quantum conjugate gradient (QCG) method using the quantum eigenvalue transformation (QET) Based on the numerical results, our algorithm significantly improves circuit depth, outperforming another QET-based algorithm by three to four orders of magnitude.
  arXiv  Detail & Related papers  (2024-04-03T13:13:55Z)
• Learning with SASQuaTCh: a Novel Variational Quantum Transformer Architecture with Kernel-Based Self-Attention [0.464982780843177]
  We present a variational quantum circuit architecture named Self-Attention Sequential Quantum Transformer Channel (SASQuaT)<n>Our approach leverages recent insights from kernel-based operator learning in the context of predicting vision transformer network using simple gate operations and a set of multi-dimensional quantum Fourier transforms.<n>To validate our approach, we consider image classification tasks in simulation and with hardware, where with only 9 qubits and a handful of parameters we are able to simultaneously embed and classify a grayscale image of handwritten digits with high accuracy.
  arXiv  Detail & Related papers  (2024-03-21T18:00:04Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
  We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder. Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
  arXiv  Detail & Related papers  (2022-09-30T02:36:42Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.