FEqa: Finite Element Computations on Quantum Annealers

• URL: http://arxiv.org/abs/2201.09743v2
• Date: Sun, 15 May 2022 15:49:04 GMT
• Title: FEqa: Finite Element Computations on Quantum Annealers
• Authors: Osama Muhammad Raisuddin, Suvranu De
• Abstract summary: We present a unified formulation (FEqa) to solve physical problems using quantum annealers. FEqa is a hybrid technique in which the finite element problem is formulated on a classical computer. FEqa is scalable on the classical portion of the algorithm due to its Single Program Multiple Data nature.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The solution of physical problems discretized using the finite element methods using quantum computers remains relatively unexplored. Here, we present a unified formulation (FEqa) to solve such problems using quantum annealers. FEqa is a hybrid technique in which the finite element problem is formulated on a classical computer, and the residual is minimized using a quantum annealer. The advantages of FEqa include utilizing a single qubit per degree of freedom, enforcing Dirichlet boundary conditions a priori, reaching arbitrary solution precision, and eliminating the possibility of the annealer generating invalid results. FEqa is scalable on the classical portion of the algorithm due to its Single Program Multiple Data (SPMD) nature and does not rely on ground state solutions from the annealer. The exponentially large number of collocation points used in quantum annealing are investigated for their cosine measures, and new iterative techniques are developed to exploit their properties. The quantum annealer has clear advantages in computational time over simulated annealing, for the example problems presented in this paper solved on the D-Wave machine. The presented work provides a pathway to solving physical problems using quantum annealers.

Related papers

• Solving eigenvalue problems obtained by the finite element method on a quantum annealer using only a few qubits [0.0]
  One of the main obstacles for achieving a practical quantum advantage in quantum computing lies in the relatively small number of qubits currently available in quantum hardware. We show how to circumvent this problem in the context of eigenvalue problems obtained by the finite element method. As an example, we apply AQAE to eigenvalue problems that are relevant in a wide range of contexts, such as electromagnetism, acoustics and seismology.
  arXiv  Detail & Related papers  (2024-10-17T16:39:03Z)
• Formulation and evaluation of ocean dynamics problems as optimization problems for quantum annealing machines [0.0]
  Recent advancements in quantum computing suggest the potential to revolutionize computational algorithms across various scientific domains. Quantum computation is so different from classical computation that suitable frameworks to represent oceanic and atmospheric dynamics are yet to be explored.
  arXiv  Detail & Related papers  (2024-05-20T04:55:32Z)
• Robust Experimental Signatures of Phase Transitions in the Variational Quantum Eigensolver [0.0]
  Variational Quantum Eigensolver (VQE) is widely considered to be a promising candidate for a quantum-classical algorithm. In this work, we use several IBM devices to explore a finite-size spin model with multiple phase-like' regions.
  arXiv  Detail & Related papers  (2024-02-29T08:34:11Z)
• State-Averaged Orbital-Optimized VQE: A quantum algorithm for the democratic description of ground and excited electronic states [0.0]
  The SA-OO-VQE package aims to answer both problems with its hybrid quantum-classical conception based on a typical Variational Quantum Eigensolver approach. The SA-OO-VQE has the ability to treat degenerate (or quasi-degenerate) states on the same footing, thus avoiding known numerical optimization problems around avoided crossings or conical intersections.
  arXiv  Detail & Related papers  (2024-01-22T12:16:37Z)
• Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing [93.83016310295804]
  AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for computer vision tasks. In this work, we explore the potential of using this information for probabilistic balanced k-means clustering. Instead of discarding non-optimal solutions, we propose to use them to compute calibrated posterior probabilities with little additional compute cost. This allows us to identify ambiguous solutions and data points, which we demonstrate on a D-Wave AQC on synthetic tasks and real visual data.
  arXiv  Detail & Related papers  (2023-10-18T17:59:45Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits [0.0]
  We show that long term trends in solution quality exist on the D-Wave device, and that the unused qubits can be used to measure the current level of noise of the quantum system. In this work, we embed a disjoint random QUBO on the unused parts of the chip alongside the QUBO to be solved, which acts as an indicator of the solution quality of the device over time.
  arXiv  Detail & Related papers  (2022-09-12T23:06:51Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18: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.