Quantum Approximate Optimization Algorithm for Bayesian network
structure learning
- URL: http://arxiv.org/abs/2203.02400v1
- Date: Fri, 4 Mar 2022 16:11:34 GMT
- Title: Quantum Approximate Optimization Algorithm for Bayesian network
structure learning
- Authors: Vicente P. Soloviev, Concha Bielza, Pedro Larra\~naga
- Abstract summary: In this work, a specific type of variational quantum algorithm, the quantum approximate optimization algorithm, was used to solve the Bayesian network structure learning problem.
Results showed that the quantum approximate optimization algorithm approach offers competitive results with state-of-the-art methods and quantitative resilience to quantum noise.
- Score: 1.332091725929965
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Bayesian network structure learning is an NP-hard problem that has been faced
by a number of traditional approaches in recent decades. Currently, quantum
technologies offer a wide range of advantages that can be exploited to solve
optimization tasks that cannot be addressed in an efficient way when utilizing
classic computing approaches. In this work, a specific type of variational
quantum algorithm, the quantum approximate optimization algorithm, was used to
solve the Bayesian network structure learning problem, by employing $3n(n-1)/2$
qubits, where $n$ is the number of nodes in the Bayesian network to be learned.
Our results showed that the quantum approximate optimization algorithm approach
offers competitive results with state-of-the-art methods and quantitative
resilience to quantum noise. The approach was applied to a cancer benchmark
problem, and the results justified the use of variational quantum algorithms
for solving the Bayesian network structure learning problem.
Related papers
- Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - Quantum Graph Optimization Algorithm [7.788671046805509]
This study introduces a novel variational quantum graph optimization algorithm that integrates the message-passing mechanism.
In terms of scalability on QUBO tasks, our algorithm shows superior performance compared to QAOA.
arXiv Detail & Related papers (2024-04-09T16:25:07Z) - Graph Learning for Parameter Prediction of Quantum Approximate
Optimization Algorithm [14.554010382366302]
Quantum Approximate Optimization (QAOA) stands out for its potential to efficiently solve the Max-Cut problem.
We use Graph Neural Networks (GNN) as a warm-start technique to optimize QAOA, using GNN as a warm-start technique.
Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing.
arXiv Detail & Related papers (2024-03-05T20:23:25Z) - Solving non-native combinatorial optimization problems using hybrid
quantum-classical algorithms [0.0]
Combinatorial optimization is a challenging problem applicable in a wide range of fields from logistics to finance.
Quantum computing has been used to attempt to solve these problems using a range of algorithms.
This work presents a framework to overcome these challenges by integrating quantum and classical resources with a hybrid approach.
arXiv Detail & Related papers (2024-03-05T17:46:04Z) - Iterative Quantum Algorithms for Maximum Independent Set: A Tale of
Low-Depth Quantum Algorithms [0.0]
We study a new class of hybrid approaches to quantum optimization, termed Iterative Maximum Quantum Algorithms.
We show that for QAOA with depth $p=1$, this algorithm performs exactly the same operations and selections as the classical greedy algorithm for MIS.
arXiv Detail & Related papers (2023-09-22T18:00:03Z) - A Review on Quantum Approximate Optimization Algorithm and its Variants [47.89542334125886]
The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve intractable optimization problems.
This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios.
We conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm.
arXiv Detail & Related papers (2023-06-15T15:28:12Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Surviving The Barren Plateau in Variational Quantum Circuits with
Bayesian Learning Initialization [0.0]
Variational quantum-classical hybrid algorithms are seen as a promising strategy for solving practical problems on quantum computers in the near term.
Here, we introduce the fast-and-slow algorithm, which uses gradients to identify a promising region in Bayesian space.
Our results move variational quantum algorithms closer to their envisioned applications in quantum chemistry, optimization, and quantum simulation problems.
arXiv Detail & Related papers (2022-03-04T17:48:57Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - 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)
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.