Quantum Algorithms for Geologic Fracture Networks

• URL: http://arxiv.org/abs/2210.11685v1
• Date: Fri, 21 Oct 2022 02:23:23 GMT
• Title: Quantum Algorithms for Geologic Fracture Networks
• Authors: Jessie M. Henderson, Marianna Podzorova, M. Cerezo, John K. Golden, Leonard Gleyzer, Hari S. Viswanathan, Daniel O'Malley
• Abstract summary: We introduce two quantum algorithms for solving fractured flow. One is designed for future quantum computers which operate without error, but we demonstrate that current hardware is too noisy for adequate performance. The second algorithm, designed to be noise resilient, already performs well for problems of small to medium size.
• Score: 0.09236074230806578
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approach known as coarse-graining. For many practical applications, such as flow in porous, homogenous materials, coarse-graining offers a sufficiently-accurate approximation of the solution. Unfortunately, fractured systems cannot be accurately coarse-grained, as critical network topology exists at the smallest scales, including topology that can push the network across a percolation threshold. Therefore, new techniques are necessary to accurately model important fracture systems. Quantum algorithms for solving linear systems offer a theoretically-exponential improvement over their classical counterparts, and in this work we introduce two quantum algorithms for fractured flow. The first algorithm, designed for future quantum computers which operate without error, has enormous potential, but we demonstrate that current hardware is too noisy for adequate performance. The second algorithm, designed to be noise resilient, already performs well for problems of small to medium size (order 10 to 1000 nodes), which we demonstrate experimentally and explain theoretically. We expect further improvements by leveraging quantum error mitigation and preconditioning.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Incompressible Navier-Stokes solve on noisy quantum hardware via a hybrid quantum-classical scheme [2.3624125155742064]
  Partial differential equation solvers are required to solve the Navier-Stokes equations for fluid flow. This work presents a hybrid quantum-classical algorithm for the incompressible Navier--Stokes equations. We verify the algorithm via noise-free simulation and test it on noisy IBM superconducting quantum hardware.
  arXiv  Detail & Related papers  (2024-06-01T03:12:36Z)
• Addressing Quantum's "Fine Print": State Preparation and Information Extraction for Quantum Algorithms and Geologic Fracture Networks [0.0]
  This work addresses two further requirements for solving geologic fracture flow systems with quantum algorithms. Our approach to addressing each is consistent with an overall exponential speed-up.
  arXiv  Detail & Related papers  (2023-10-03T23:02:54Z)
• Learning the tensor network model of a quantum state using a few single-qubit measurements [0.0]
  The constantly increasing dimensionality of artificial quantum systems demands highly efficient methods for their characterization and benchmarking. Here we present a constructive and numerically efficient protocol which learns a tensor network model of an unknown quantum system.
  arXiv  Detail & Related papers  (2023-09-01T11:11:52Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm [58.720142291102135]
  We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL) This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
  arXiv  Detail & Related papers  (2022-10-23T11:58:05Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Scalable Neural Decoder for Topological Surface Codes [0.0]
  We present a neural network based decoder for a family of stabilizer codes subject to noise and syndrome measurement errors. The key innovation is to autodecode error syndromes on small scales by shifting a preprocessing window over the underlying code. We show that such a preprocessing step allows to effectively reduce the error rate by up to two orders of magnitude in practical applications.
  arXiv  Detail & Related papers  (2021-01-18T19:02:09Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• A Neural-Network Variational Quantum Algorithm for Many-Body Dynamics [15.435967947933404]
  We propose a neural-network variational quantum algorithm to simulate the time evolution of quantum many-body systems. The proposed algorithm can be efficiently implemented in near-term quantum computers with low measurement cost.
  arXiv  Detail & Related papers  (2020-08-31T02:54:09Z)

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.