Variational Quantum Algorithms for Computational Fluid Dynamics
- URL: http://arxiv.org/abs/2209.04915v1
- Date: Sun, 11 Sep 2022 18:49:22 GMT
- Title: Variational Quantum Algorithms for Computational Fluid Dynamics
- Authors: Dieter Jaksch, Peyman Givi, Andrew J. Daley, Thomas Rung
- Abstract summary: Variational quantum algorithms are particularly promising since they are comparatively noise tolerant.
We show how variational quantum algorithms can be utilized in computational fluid dynamics.
We argue that a quantum advantage over classical computing methods could be achieved by the end of this decade.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computing uses the physical principles of very small systems to
develop computing platforms which can solve problems that are intractable on
conventional supercomputers. There are challenges not only in building the
required hardware, but also in identifying the most promising application areas
and developing the corresponding quantum algorithms. The availability of
intermediate-scale noisy quantum computers is now propelling the developments
of novel algorithms, with applications across a variety of domains, including
in aeroscience. Variational quantum algorithms are particularly promising since
they are comparatively noise tolerant and aim to achieve a quantum advantage
with only a few hundred qubits. Furthermore, they are applicable to a wide
range of optimization problems arising throughout the natural sciences and
industry. To demonstrate the possibilities for the aeroscience community, we
give a perspective on how variational quantum algorithms can be utilized in
computational fluid dynamics. We discuss how classical problems are translated
into quantum algorithms and their logarithmic scaling with problem size. As an
explicit example we apply this method to Burgers' Equation in one spatial
dimension. We argue that a quantum advantage over classical computing methods
could be achieved by the end of this decade if quantum hardware progresses as
currently envisaged and emphasize the importance of joining up development of
quantum algorithms with application-specific expertise to achieve real-world
impact.
Related papers
- Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study [11.29246196323319]
We describe NASA's work in assessing and advancing the potential of quantum computing.
We discuss advances in algorithms, both near- and longer-term, and the results of our explorations on current hardware and with simulations.
This work also includes physics-inspired classical algorithms that can be used at application scale today.
arXiv Detail & Related papers (2024-06-21T19:05:42Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - 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) - Quantum Algorithm Cards: Streamlining the development of hybrid
classical-quantum applications [0.0]
The emergence of quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains.
The ability of quantum computers to scale computations implies better performance and efficiency for certain algorithmic tasks than current computers provide.
To gain benefit from such improvement, quantum computers must be integrated with existing software systems, a process that is not straightforward.
arXiv Detail & Related papers (2023-10-04T06:02:59Z) - A Practitioner's Guide to Quantum Algorithms for Optimisation Problems [0.0]
NP-hard optimisation problems are common in industrial areas such as logistics and finance.
This paper aims to provide a comprehensive overview of the theory of quantum optimisation techniques.
It focuses on their near-term potential for noisy intermediate scale quantum devices.
arXiv Detail & Related papers (2023-05-12T08:57:36Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - 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) - 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) - Limitations of optimization algorithms on noisy quantum devices [0.0]
We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices.
Our approach is based on the combination of entropic inequalities that determine how fast the quantum state converges to the fixed point of the noise model.
arXiv Detail & Related papers (2020-09-11T17:07:26Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - 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.