Quantum Algorithms for Geologic Fracture Networks
arXiv:2210.11685 · doi:10.1038/s41598-023-29643-4
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.
arXiv comment20 pages, 12 figures
References in corpus (32)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- Quantum computational advantage using photons
- Noisy intermediate-scale quantum (NISQ) algorithms
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Error mitigation for short-depth quantum circuits
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Exponential suppression of bit or phase flip errors with repetitive error correction
- Minimal Universal Two-qubit Quantum Circuits
- Preconditioned quantum linear system algorithm
- A quantum linear system algorithm for dense matrices
- Quantum algorithms and the finite element method
- Noise Resilience of Variational Quantum Compiling
- Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
- Variational algorithms for linear algebra
- Experimental Quantum Computing to Solve Systems of Linear Equations
- Quantum fidelity measures for mixed states
- Group-Invariant Quantum Machine Learning
- Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
- Experimental realization of quantum algorithm for solving linear systems of equations
- A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
- An alternative quantum fidelity for mixed states of qudits
- Solving systems of linear equations on a quantum computer
- Solving Systems of Linear Equations with a Superconducting Quantum Processor
- Hybrid quantum linear equation algorithm and its experimental test on IBM Quantum Experience
- Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- Experimental realization of quantum algorithms for linear system inspired by adiabatic quantum computing
- Quantum Computing and Preconditioners for Hydrological Linear Systems