Adaptive mesh refinement quantum algorithm for Maxwell's equations

• URL: http://arxiv.org/abs/2504.01646v1
• Date: Wed, 02 Apr 2025 11:54:24 GMT
• Title: Adaptive mesh refinement quantum algorithm for Maxwell's equations
• Authors: Elise Fressart, Michel Nowak, Nicole Spillane,
• Abstract summary: We propose to extend adaptive mesh refinement to the quantum formalism, and apply our method to the resolution of Maxwell's equations.<n>By using block-encoding, we propose a way to compute these estimators with quantum circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Algorithms that promise to leverage resources of quantum computers efficiently to accelerate the finite element method have emerged. However, the finite element method is usually incorporated into a high-level numerical scheme which allows the adaptive refinement of the mesh on which the solution is approximated. In this work, we propose to extend adaptive mesh refinement to the quantum formalism, and apply our method to the resolution of Maxwell's equations. An important step in this procedure is the computation of error estimators, which guide the refinement. By using block-encoding, we propose a way to compute these estimators with quantum circuits. We present first numerical experiments on a 2D geometry.

Related papers

• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM) We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall. Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• High order schemes for solving partial differential equations on a quantum computer [0.0]
  We show that higher-order methods can reduce the number of qubits necessary for discretization, similar to the classical case. This result has important consequences for the practical application of quantum algorithms based on Hamiltonian evolution.
  arXiv  Detail & Related papers  (2024-12-26T14:21:59Z)
• 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)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states.<n>It is executable on current (hybrid) quantum hardware and does not depend on quantum memory.<n>We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Momentum exchange method for quantum Boltzmann methods [0.0]
  This paper marks the first quantum method proposed to efficiently calculate quantities of interest (QoIs) from a state vector representing the flow field.<n>In particular, we propose a method to calculate the force acting on an object immersed in the fluid using a quantum version of the momentum exchange method (MEM) that is commonly used in lattice Boltzmann methods.
  arXiv  Detail & Related papers  (2024-04-26T12:31:46Z)
• Quantum Realization of the Finite Element Method [0.0]
  This paper presents a quantum algorithm for the solution of second-order linear elliptic partial differential equations discretized by $d$-linear finite elements.<n>An essential step in the construction is a BPX preconditioner, which transforms the linear system into a sufficiently well-conditioned one.<n>We provide a constructive proof demonstrating that, for any fixed dimension, our quantum algorithm can compute suitable functionals of the solution to a given tolerance.
  arXiv  Detail & Related papers  (2024-03-28T15:44:20Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective [39.58317527488534]
  We present an algorithm for solving systems of linear equations based on the HHL algorithm with a novel qudits methodology. We perform a quantum-inspired version on tensor networks, taking advantage of their ability to perform non-unitary operations such as projection.
  arXiv  Detail & Related papers  (2023-09-11T08:18:41Z)
• Clifford Circuit Initialisation for Variational Quantum Algorithms [0.0]
  We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers. We numerically demonstrate the effectiveness of the technique, and how it depends on Hamiltonian structure, number of qubits and circuit depth.
  arXiv  Detail & Related papers  (2022-07-04T15:59:33Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• 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)

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.