An efficient quantum Hadamard product algorithm for functions

• URL: http://arxiv.org/abs/2606.03612v1
• Date: Tue, 02 Jun 2026 13:13:47 GMT
• Title: An efficient quantum Hadamard product algorithm for functions
• Abstract summary: We propose an efficient quantum algorithm for preparing the Hadamard product state of two quantum states.<n>Our method exploits the Fourier-space representation of the input functions.<n>We also propose a novel quantum circuit for the partial inner product as one of its applications.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an efficient quantum algorithm for preparing the Hadamard product state of two quantum states whose amplitudes are generated by functions on a uniform grid with grid number $N$. As the Hadamard product operation is non-unitary, the conventional approach generally suffer from a success probability that scales as $O(1/N)$, leading to an $O(\sqrt{N})$ query complexity even with quantum amplitude amplification. Our method exploits the Fourier-space representation of the input functions, where the Hadamard product can be treated through a convolution structure and approximated using localized Fourier coefficients. The resulting quantum circuit has complexity governed by the Fourier regularity of the underlying functions rather than directly by the grid number. In particular, when either of the input functions has finitely many non-zero Fourier coefficients, the algorithm prepares the exact quantum Hadamard product state under $N$-independent query complexity. Moreover, we also propose a novel quantum circuit for the partial inner product as one of its applications.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Processing through encoding: Quantum circuit approaches for point-wise multiplication and convolution [1.3521721488318912]
  This paper introduces quantum circuit methodologies for pointwise multiplication and convolution of complex functions.<n>We describe an approach where multiple complex functions are encoded onto auxiliary qubits.<n>We discuss the simulation of these techniques, their integration into an extended verb|quantumaudio| package for audio signal processing, and present initial experimental validations.
  arXiv  Detail & Related papers  (2025-12-12T10:52:06Z)
• Distributed quantum algorithm for divergence estimation and beyond [12.925989807145301]
  We propose a distributed quantum algorithm framework to compute $rm Tr(f(A)g(B))$ within an additive error $varepsilon$.<n>This framework holds broad applicability across a range of distributed quantum computing tasks.
  arXiv  Detail & Related papers  (2025-03-12T14:28:22Z)
• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• A Novel Quantum-Classical Hybrid Algorithm for Determining Eigenstate Energies in Quantum Systems [1.9714447272714082]
  This paper presents a novel quantum algorithm, XZ24, for efficiently computing the eigen-energy spectra of arbitrary quantum systems. XZ24 has three key advantages: It removes the need for eigenstate preparation, requiring only a reference state with non-negligible overlap. It enables simultaneous computation of multiple eigen-energies, depending on the reference state.
  arXiv  Detail & Related papers  (2024-06-01T04:31:43Z)
• 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 amplitude encoding of polynomial functions [0.0]
  We present and compare two efficient methods for encoding on real functions on $n$ qubits. First, we encode the linear function into the quantum registers with a swallow sequence multi-controlled gates. Second, we use this construction as a building block to achieve a block encoding of the amplitudes corresponding to the linear function.
  arXiv  Detail & Related papers  (2023-07-20T14:40:55Z)
• Quantum state preparation without coherent arithmetic [3.5707423185282665]
  We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function.magnitude existing approaches.<n>We use a template quantum eigenvalue transformation circuit to convert a low cost block encoding of the sine function into the desired function.
  arXiv  Detail & Related papers  (2022-10-26T17:48:31Z)
• Quantum State Preparation and Non-Unitary Evolution with Diagonal Operators [0.0]
  We present a dilation based algorithm to simulate non-unitary operations on unitary quantum devices. We use this algorithm to prepare random sub-normalized two-level states on a quantum device with high fidelity. We also present the accurate non-unitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude damping channel computed on a quantum device.
  arXiv  Detail & Related papers  (2022-05-05T17:56:41Z)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• 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)
• Estimating Gibbs partition function with quantumClifford sampling [6.656454497798153]
  We develop a hybrid quantum-classical algorithm to estimate the partition function. Our algorithm requires only a shallow $mathcalO(1)$-depth quantum circuit. Shallow-depth quantum circuits are considered vitally important for currently available NISQ (Noisy Intermediate-Scale Quantum) devices.
  arXiv  Detail & Related papers  (2021-09-22T02:03:35Z)
• Generalized quantum circuit differentiation rules [23.87373187143897]
  Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits. Here, we propose the rules for differentiating quantum circuits (unitaries) with arbitrary generators.
  arXiv  Detail & Related papers  (2021-08-03T00:29:45Z)
• A quantum Poisson solver implementable on NISQ devices (improved version) [23.69613801851615]
  We propose a compact quantum algorithm for solving one-dimensional Poisson equation based on simple Ry rotation. The solution error comes only from the finite difference approximation of the Poisson equation. Our quantum Poisson solver (QPS) has gate-complexity of 3n in qubits and 4n3 in one- and two-qubit gates, where n is the logarithmic of the dimension of the linear system of equations.
  arXiv  Detail & Related papers  (2020-05-01T07:38:07Z)
• 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.