Quantum element-wise transforms

• URL: http://arxiv.org/abs/2606.06456v1
• Date: Thu, 04 Jun 2026 17:50:07 GMT
• Title: Quantum element-wise transforms
• Abstract summary: Quantum algorithms for basic numerical linear tasks have proven essential for translating diverse problems to a unified quantum computational context.<n>We present our algorithms alongside applications to machine learning, simulation, and signal processing.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum algorithms for basic numerical linear algebraic tasks have proven essential for translating diverse problems to a unified quantum computational context. Many of these tasks -- e.g., applying a polynomial function to the spectrum of a matrix embedded in a unitary process (a so-called block encoding), or taking linear combinations of block encodings -- are well-addressed by techniques like quantum singular value transformation (QSVT) or linear combination of unitaries (LCU). However, there exist useful matrix transforms whose realization by existing quantum algorithms is unclear or inefficient. In this work we construct improved quantum algorithms for some of these transforms, the simplest of which is a polynomial function applied element-wise. We show the space required to compute quantum element-wise transforms can be reduced exponentially in the degree of the applied function compared to prior work, and raise and rectify errors in previous constructions. We present our algorithms alongside applications to machine learning, simulation, and signal processing.

Related papers

• Quantum algorithms for the fractional Poisson equation via rational approximation [20.497126318288906]
  We present a quantum algorithm for solving the fractional equation ((-)s u = f) with (s in (0,1)) on bounded domains.<n>The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage.
  arXiv  Detail & Related papers  (2026-04-01T08:08:33Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Hermitian Matrix Function Synthesis without Block-Encoding [6.824528644662748]
  We propose a novel and efficient approach to implement arbitrary circuits of a Hermitian matrix on quantum hardware.<n>Our method circumvents the need for block-encoding by expressing the target Hermitian matrix as a symmetric combination of unitary conjugates.
  arXiv  Detail & Related papers  (2025-12-20T07:22:04Z)
• Double-Logarithmic Depth Block-Encodings of Simple Finite Difference Method's Matrices [0.0]
  Solving differential equations is one of the most computationally expensive problems in classical computing. Despite recent progress made in the field of quantum computing and quantum algorithms, its end-to-end application towards practical realization still remains unattainable.
  arXiv  Detail & Related papers  (2024-10-07T17:44:30Z)
• Quantum Signal Processing and Quantum Singular Value Transformation on $U(N)$ [8.264300525515097]
  Quantum signal processing and quantum value transformation are powerful tools to implement transformations of block-encoded matrices on quantum computers. We propose a framework which realizes multiples simultaneously from a block-encoded input. We also give an algorithm to construct the quantum circuit that gives the desired transformation.
  arXiv  Detail & Related papers  (2024-07-19T14:15:20Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• 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)
• Improved Quantum Algorithms for Eigenvalues Finding and Gradient Descent [0.0]
  Block encoding is a key ingredient in the recently developed quantum singular value transformation (QSVT) framework.<n>In this article, we affirm this perspective by leveraging block encoding to substantially enhance two previously proposed quantum algorithms.<n>Our findings demonstrate that even just elementary operations within the unitary block encoding framework can eliminate major scaling factors.
  arXiv  Detail & Related papers  (2023-12-22T15:59:03Z)
• Semantic embedding for quantum algorithms [0.0]
  A need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT) We show that QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to soundness in quantum cryptography.
  arXiv  Detail & Related papers  (2023-04-27T17:55:40Z)
• Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices [4.2389474761558406]
  We show how efficient quantum circuits can be explicitly constructed for some well-structured matrices. We also provide implementations of these quantum circuits in sparse strategies.
  arXiv  Detail & Related papers  (2022-03-19T03:50:16Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• 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 circuits design for evaluating transcendental functions based on a function-value binary expansion method [23.69613801851615]
  We present the quantum circuits for solving the logarithmic, exponential, trigonometric and inverse trigonometric functions. The qFBE method provides a unified and programmed solution for the evaluation of transcendental functions.
  arXiv  Detail & Related papers  (2020-01-03T12:53:04Z)

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.