Using quantum computers in control: interval matrix properties
- URL: http://arxiv.org/abs/2403.17711v1
- Date: Tue, 26 Mar 2024 13:58:21 GMT
- Title: Using quantum computers in control: interval matrix properties
- Authors: Jan Schneider, Julian Berberich,
- Abstract summary: This paper explores the use of quantum computers for solving relevant problems in systems and control theory.
We present a prototypical example of the verification of interval matrix properties such as non-singularity and stability on a quantum computer.
Our results demonstrate that quantum computers provide a promising tool for control whose applicability to further computationally complex problems remains to be explored.
- Score: 0.46040036610482665
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control theory. In the recent literature, different quantum algorithms have been developed to tackle binary optimization, which plays an important role in various control-theoretic problems. As a prototypical example, we consider the verification of interval matrix properties such as non-singularity and stability on a quantum computer. We present a quantum algorithm solving these problems and we study its performance in simulation. Our results demonstrate that quantum computers provide a promising tool for control whose applicability to further computationally complex problems remains to be explored.
Related papers
- Computable and noncomputable in the quantum domain: statements and conjectures [0.70224924046445]
We consider an approach to the question of describing a class of problems whose solution can be accelerated by a quantum computer.
The unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates.
arXiv Detail & Related papers (2024-03-25T15:47:35Z) - Quantum computing through the lens of control: A tutorial introduction [0.7179506962081081]
This paper provides a tutorial introduction to quantum computing from the perspective of control theory.
The tutorial only requires basic knowledge of linear algebra and, in particular, no prior exposure to quantum physics.
arXiv Detail & Related papers (2023-10-19T08:25:50Z) - Reliable AI: Does the Next Generation Require Quantum Computing? [71.84486326350338]
We show that digital hardware is inherently constrained in solving problems about optimization, deep learning, or differential equations.
In contrast, analog computing models, such as the Blum-Shub-Smale machine, exhibit the potential to surmount these limitations.
arXiv Detail & Related papers (2023-07-03T19:10:45Z) - 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) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Quantum Metropolis Solver: A Quantum Walks Approach to Optimization
Problems [0.0]
This paper focuses on the Metropolis-Hastings quantum algorithm that is based on quantum walks.
We use this algorithm to build a quantum software tool called Quantum Solver (QMS)
We validate QMS with the N-Queen problem to show a potential quantum advantage in an example that can be easily extrapolated to an Artificial Intelligence domain.
arXiv Detail & Related papers (2022-07-13T18:26:36Z) - Multiple Query Optimization using a Hybrid Approach of Classical and
Quantum Computing [1.7077661158850292]
We tackle the multiple query optimization problem (MQO) which is an important NP-hard problem in the area of data-intensive problems.
We propose a novel hybrid classical-quantum algorithm to solve the MQO on a gate-based quantum computer.
Our algorithm shows a qubit efficiency of close to 99% which is almost a factor of 2 higher compared to the state of the art implementation.
arXiv Detail & Related papers (2021-07-22T08:12:49Z) - Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard.
We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware.
The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
arXiv Detail & Related papers (2021-07-08T17:59:55Z) - 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) - Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
We review and extend the application of deep learning to quantum geometric control problems.
We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems.
Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
arXiv Detail & Related papers (2020-06-19T19:12:14Z) - 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.