Quantum Wave Atom Transforms

• URL: http://arxiv.org/abs/2507.10739v1
• Date: Mon, 14 Jul 2025 19:03:22 GMT
• Title: Quantum Wave Atom Transforms
• Authors: Marianna Podzorova, Yi-Kai Liu,
• Abstract summary: This paper constructs the first quantum algorithm for wavelet packet transforms with a tree structure, sometimes called wave atom transforms.<n>The result can be used to improve existing quantum algorithms for solving hyperbolic partial differential equations.
• Score: 0.5831737970661137
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper constructs the first quantum algorithm for wavelet packet transforms with a tree structure, sometimes called wave atom transforms. Classically, wave atoms are used to construct sparse representations of differential operators, which enable fast numerical algorithms for partial differential equations. Compared to previous work, our quantum algorithm can implement a larger class of wavelet and wave atom transforms, by using an efficient representation for a larger class of possible tree structures. Our quantum implementation has $O(\mathrm{poly}(n))$ gate complexity for the transform of dimension $2^n$, while classical implementations have $O(n 2^n)$ floating point operations. The result can be used to improve existing quantum algorithms for solving hyperbolic partial differential equations.

Related papers

• Towards efficient quantum algorithms for diffusion probability models [17.785526511644587]
  Diffusion model (DPM) is renowned for its ability to produce high-quality outputs in tasks such as image and audio generation.<n>We introduce efficient quantum algorithms for implementing DPMs through various quantum solvers.
  arXiv  Detail & Related papers  (2025-02-20T04:39:09Z)
• Almost Optimal Synthesis of Reversible Function in Qudit Model [5.9453200974654195]
  We propose a method to synthesize even permutations in $A_dn$ using $Theta(d)$(n - 1)$-qudit sub-circuits.<n>We also introduce a technique for reversible functions employing $Oleft( n dn right)$ gates and only a single ancilla.
  arXiv  Detail & Related papers  (2025-01-09T13:44:14Z)
• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations.<n>The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions.<n>The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Multi-strategy Based Quantum Cost Reduction of Quantum Boolean Circuits [0.4999814847776098]
  The construction of quantum computers is based on the synthesis of low-cost quantum circuits. This paper proposes two algorithms to construct a quantum circuit for any Boolean function expressed in a Positive Polarity Reed-Muller $PPRM$ expansion.
  arXiv  Detail & Related papers  (2024-07-05T19:25:46Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Efficient Quantum Algorithm for All Quantum Wavelet Transforms [0.08968838300743379]
  We develop a simple yet efficient quantum algorithm for executing any wavelet transform on a quantum computer. Our proposed quantum wavelet transforms could be used in quantum computing algorithms in a similar manner to their well-established counterpart, the quantum Fourier transform.
  arXiv  Detail & Related papers  (2023-09-17T19:02:08Z)
• Noisy Tensor Ring approximation for computing gradients of Variational Quantum Eigensolver for Combinatorial Optimization [33.12181620473604]
  Variational Quantum algorithms have established their potential to provide computational advantage in the realm of optimization. These algorithms suffer from classically intractable gradients limiting the scalability. This work proposes a classical gradient method which utilizes the parameter shift rule but computes the expected values from the circuits using a tensor ring approximation.
  arXiv  Detail & Related papers  (2023-07-08T03:14:28Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ans\"atze [13.651587339535961]
  We develop a framework for convolutional quantum circuits with SU$(d)$symmetry. We prove Harrow's statement on equivalence between $nameSU(d)$ and $S_n$ irrep bases.
  arXiv  Detail & Related papers  (2021-12-14T18:03:43Z)
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications [0.0]
  We investigate the effect of classical pre-optimization of the electronic structure Hamiltonian representation, via single-particle basis transformation, on the "1-norm" We derive a new formula for the 1-norm as a function of the electronic integrals, and use this quantity as a cost function for an orbital-optimization scheme.
  arXiv  Detail & Related papers  (2021-03-26T22:05:42Z)
• Quantum Legendre-Fenchel Transform [6.643082745560234]
  We present a quantum algorithm to compute the discrete Legendre-Fenchel transform. We show that our quantum algorithm is optimal up to polylogarithmic factors.
  arXiv  Detail & Related papers  (2020-06-08T18:00:05Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.