Quantum Arithmetic-based on Quantum Signal Processing

• URL: http://arxiv.org/abs/2503.18761v1
• Date: Mon, 24 Mar 2025 15:11:13 GMT
• Title: Quantum Arithmetic-based on Quantum Signal Processing
• Authors: Robin Ollive, Stephane Louise,
• Abstract summary: This article presents another approach to explain the Quantum Arithmetic in quantum computing.<n>We derive a new original technique to construct Quantum Arithmetic with the framework of embedded Quantum Signal Processing.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: As in classical reversible computing, Quantum Arithmetic is typically seen as a set of tools that process binary data encoded into a quantum register to set the value of another quantum register. This article presents another approach to explain the Quantum Arithmetic in quantum computing. Here, Quantum Arithmetic is addressed with a matrix processing point of view. Quantum Arithmetic is a convenient way to construct the Query that implements the mathematical problem of interest. This approach is not only an interpretation with the matrix approach to encode the problem of interest; it also allows us to derive a new original technique to construct Quantum Arithmetic with the framework of embedded Quantum Signal Processing (QSP). This work uses the link between the eigenstate amplitude and the operator phase to transform the QSP processed amplitude into binary value extracted by Quantum Phase Estimation(QPE). The explanations allowing the QSP based Quantum Arithmetic construction let appear natively sub-routines and functions used by well-known algorithms such as Ancilla Quantum Encoding (AQE)'s Harrow-Hassidim-Lloyd algorithm (HHL) and Quantum Amplitude Estimation (QAE). Methods to implement this circuit are presented in the paper.

Related papers

• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• 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)
• Efficient Quantum Modular Arithmetics for the ISQ Era [0.0]
  This study presents an array of quantum circuits, each precision-engineered for modular arithmetic functions. We provide a theoretical framework and practical implementations in the PennyLane quantum software.
  arXiv  Detail & Related papers  (2023-11-14T21:34:39Z)
• 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)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Step-by-Step HHL Algorithm Walkthrough to Enhance the Understanding of Critical Quantum Computing Concepts [0.0]
  Harrow-Hassidim-Lloyd (HHL) quantum algorithm is explained analytically followed by a 4-qubit numerical example in bra-ket notation. A quantum circuit programmed using qiskit can be used for real hardware execution in IBM quantum computers.
  arXiv  Detail & Related papers  (2021-08-20T05:24:07Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Quantum Amplitude Amplification Operators [3.8073142980733]
  We show the characterization of quantum iterations that would generally construct quantum amplitude amplification algorithms with a quadratic speedup. We show that an optimal and exact quantum amplitude amplification algorithm corresponds to the Grover algorithm together with a single iteration of QAAO. We then realize 3-qubit QAAOs with the current quantum technologies via cloud-based quantum computing services, IBMQ and IonQ.
  arXiv  Detail & Related papers  (2021-05-20T07:26:23Z)
• A Grand Unification of Quantum Algorithms [0.0]
  A number of quantum algorithms were recently tied together by a technique known as the quantum singular value transformation. This paper provides a tutorial through these developments, first illustrating how quantum signal processing may be generalized to the quantum eigenvalue transform. We then employ QSVT to construct intuitive quantum algorithms for search, phase estimation, and Hamiltonian simulation.
  arXiv  Detail & Related papers  (2021-05-06T17:46:33Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum Amplitude Arithmetic [20.84884678978409]
  We propose the notion of quantum amplitude arithmetic (QAA) that intent to evolve the quantum state by performing arithmetic operations on amplitude. QAA is expected to find applications in a variety of quantum algorithms.
  arXiv  Detail & Related papers  (2020-12-21T00:17:18Z)

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.