A Quantum Algorithm for Solving the Poisson Equation for Free Field Conditions via the Hockney Method
- URL: http://arxiv.org/abs/2608.10809v1
- Date: Tue, 11 Aug 2026 11:29:12 GMT
- Title: A Quantum Algorithm for Solving the Poisson Equation for Free Field Conditions via the Hockney Method
- Abstract summary: This work presents a quantum algorithm solving the problem of the Poisson equation.<n>The algorithm just uses a procedure for multiplying the state vector by a diagonal matrix w.r.t. amplitude encoding.<n>The functionality of the algorithm is verified via comparing the results obtained from state vector simulations for one- and two-dimensional test examples.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: For the often encountered problem of the Poisson equation, this work presents a quantum algorithm solving it based on the quantum Fourier transform (QFT) for periodic boundary conditions as well as free field conditions, where the latter is realized via the Hockney method. Besides the QFT and an initialization procedure for amplitude encoding, the algorithm just uses a procedure for multiplying the state vector by a diagonal matrix w.r.t. amplitude encoding. For the latter, two alternative implementations are considered here. The first variant is a version of the LCU method and the second is a sequence of multi-controlled rotation gates that represents a factoring of the multiplied values into absolute values and complex phase factors. The functionality of the algorithm is verified via comparing the results obtained from state vector simulations for one- and two-dimensional test examples with their analytical solutions. For the considered test examples, it is found that the success probability for obtaining the desired ancilla qubit subspace in the LCU version is a factor of around two higher than that for the sequence of multi-controlled rotation gates. However, the LCU version requires a number of ancilla qubits up to the number of qubits that is set to store the discretized source term of the Poisson equation in amplitude encoding, whereas the sequence of multi-controlled rotation gates demands only one ancilla qubit. Computations of the success probabilities for both variants furthermore indicate that the success probability converges for a specific problem with increasing resolution. Concerning the required computational resources for the quantum algorithm, the conclusion is drawn that while the QFT is a more efficient procedure than its classical counterpart, the current implementations of the other necessary steps in the algorithm diminish the efficiency w.r.t. the runtime.
Related papers
- Variational Quantum Linear Solver via Block Encoding for the Poisson Equation [0.0]
We present a variational quantum linear solver (VQLS) for the Poisson equation built on an exact block encoding the discrete Laplacian.<n>We demonstrate its performance on physically motivated benchmarks.
arXiv Detail & Related papers (2026-08-20T05:50:37Z) - 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) - A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization [39.146761527401424]
This work presents a rigorous worst-case runtime analysis of a measurement-driven quantum SAT solver.<n>We show that this quantum algorithm does not exclusively rely on Grover-type methods and shows promising numerical performance.<n>We also develop a new readout routine that efficiently finds a solution even for instances with multiple satisfying assignments.
arXiv Detail & Related papers (2025-11-12T19:00:13Z) - Learning Feasible Quantum States for Quadratic Constrained Binary Optimization Problems [41.23247424467223]
We develop a variational approach that creates an equal superposition of quantum states that satisfy constraints in a QCBO.<n>The resulting equal superposition can be used as an initial state for quantum algorithms that solve QUBOs/QCBOs.
arXiv Detail & Related papers (2025-08-04T16:44:53Z) - An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations [0.0]
We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS)<n>This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions.<n>We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation.
arXiv Detail & Related papers (2025-01-19T19:03:29Z) - 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) - 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) - Two quantum algorithms for solving the one-dimensional
advection-diffusion equation [0.0]
Two quantum algorithms are presented for the numerical solution of a linear one-dimensional advection-diffusion equation with periodic boundary conditions.
Their accuracy and performance with increasing qubit number are compared point-by-point with each other.
arXiv Detail & Related papers (2023-12-30T21:23:15Z) - Stochastic Optimization for Non-convex Problem with Inexact Hessian
Matrix, Gradient, and Function [99.31457740916815]
Trust-region (TR) and adaptive regularization using cubics have proven to have some very appealing theoretical properties.
We show that TR and ARC methods can simultaneously provide inexact computations of the Hessian, gradient, and function values.
arXiv Detail & Related papers (2023-10-18T10:29:58Z) - 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) - Variational determination of arbitrarily many eigenpairs in one quantum
circuit [8.118991737495524]
A variational quantum eigensolver (VQE) was first introduced for computing ground states.
We propose a new algorithm to determine many low energy eigenstates simultaneously.
Our algorithm reduces significantly the complexity of circuits and the readout errors.
arXiv Detail & Related papers (2022-06-22T13:01:37Z) - An entanglement perspective on the quantum approximate optimization
algorithm [0.0]
We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits.
We also investigate the entanglement spectrum in connection with random matrix theory.
arXiv Detail & Related papers (2022-06-14T17:37:44Z)
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.