Increasing the dimension of linear systems solved by classical or
quantum binary optimization: A new method to solve large linear equation
systems
- URL: http://arxiv.org/abs/2309.09933v2
- Date: Fri, 29 Sep 2023 17:48:00 GMT
- Title: Increasing the dimension of linear systems solved by classical or
quantum binary optimization: A new method to solve large linear equation
systems
- Authors: Erick R. Castro, Eldues O. Martins, Roberto S. Sarthour, Alexandre M.
Souza, Ivan S. Oliveira
- Abstract summary: We propose a new method to solve linear systems written as a binary optimization problem.
The procedure solves the problem efficiently and allows it to handle large linear systems.
- Score: 41.94295877935867
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recently, binary optimization has become an attractive research topic due to
the development of quantum computing and specialized classical systems inspired
by quantum computing. These hardware systems promise to speed up the
computation significantly. In this work, we propose a new method to solve
linear systems written as a binary optimization problem. The procedure solves
the problem efficiently and allows it to handle large linear systems. Our
approach is founded on the geometry of the original linear problem and
resembles the gradient conjugate method. The conjugated directions used can
significantly improve the algorithm's convergence rate. We also show that a
partial knowledge of the intrinsic geometry of the problem can divide the
original problem into independent sub-problems of smaller dimensions. These
sub-problems can then be solved using quantum or classical solvers. Although
determining the geometry of the problem has an additional computational cost,
it can substantially improve the performance of our method compared to previous
implementations.
Related papers
- A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm [9.804179673817574]
We propose a new quantum algorithm for the quantum linear system problem (QLSP) inspired by the classical proximal point algorithm (PPA)
Our proposed method can be viewed as a meta-algorithm that allows inverting a modified matrix via an existing texttimattQLSP_solver.
By carefully choosing the step size $eta$, the proposed algorithm can effectively precondition the linear system to mitigate the dependence on condition numbers that hindered the applicability of previous approaches.
arXiv Detail & Related papers (2024-06-19T23:15:35Z) - An Efficient Quantum Algorithm for Linear System Problem in Tensor Format [4.264200809234798]
We propose a quantum algorithm based on the recent advances on adiabatic-inspired QLSA.
We rigorously show that the total complexity of our implementation is polylogarithmic in the dimension.
arXiv Detail & Related papers (2024-03-28T20:37:32Z) - Linearization Algorithms for Fully Composite Optimization [61.20539085730636]
This paper studies first-order algorithms for solving fully composite optimization problems convex compact sets.
We leverage the structure of the objective by handling differentiable and non-differentiable separately, linearizing only the smooth parts.
arXiv Detail & Related papers (2023-02-24T18:41:48Z) - Quantum Algorithm for Solving a Quadratic Nonlinear System of Equations [0.22940141855172036]
The complexity of our algorithm is $O(rm polylog(n/epsilon))$, which provides an exponential improvement over the optimal classical algorithm in dimension $n$.
Our algorithm exponentially accelerates the solution of QNSE and has wide applications in all kinds of nonlinear problems.
arXiv Detail & Related papers (2021-12-03T00:27:16Z) - Improving quantum linear system solvers via a gradient descent
perspective [3.0969191504482247]
We revisit quantum linear system solvers from the perspective of convex optimization.
This leads to a considerable constant-factor iteration in the runtime.
We show how the optimal quantum linear system solver of Childs, Kothari, and Somma is related to the gradient descent algorithm.
arXiv Detail & Related papers (2021-09-09T13:16:28Z) - Quadratic Unconstrained Binary Optimisation via Quantum-Inspired
Annealing [58.720142291102135]
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation.
We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
arXiv Detail & Related papers (2021-08-18T09:26:17Z) - Quantum variational optimization: The role of entanglement and problem
hardness [0.0]
We study the role of entanglement, the structure of the variational quantum circuit, and the structure of the optimization problem.
Our numerical results indicate an advantage in adapting the distribution of entangling gates to the problem's topology.
We find evidence that applying conditional value at risk type cost functions improves the optimization, increasing the probability of overlap with the optimal solutions.
arXiv Detail & Related papers (2021-03-26T14:06:54Z) - Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra [53.46106569419296]
We create classical (non-quantum) dynamic data structures supporting queries for recommender systems and least-squares regression.
We argue that the previous quantum-inspired algorithms for these problems are doing leverage or ridge-leverage score sampling in disguise.
arXiv Detail & Related papers (2020-11-09T01:13:07Z) - Boosting Data Reduction for the Maximum Weight Independent Set Problem
Using Increasing Transformations [59.84561168501493]
We introduce new generalized data reduction and transformation rules for the maximum weight independent set problem.
Surprisingly, these so-called increasing transformations can simplify the problem and also open up the reduction space to yield even smaller irreducible graphs later in the algorithm.
Our algorithm computes significantly smaller irreducible graphs on all except one instance, solves more instances to optimality than previously possible, is up to two orders of magnitude faster than the best state-of-the-art solver, and finds higher-quality solutions than solvers DynWVC and HILS.
arXiv Detail & Related papers (2020-08-12T08:52:50Z) - Effective Dimension Adaptive Sketching Methods for Faster Regularized
Least-Squares Optimization [56.05635751529922]
We propose a new randomized algorithm for solving L2-regularized least-squares problems based on sketching.
We consider two of the most popular random embeddings, namely, Gaussian embeddings and the Subsampled Randomized Hadamard Transform (SRHT)
arXiv Detail & Related papers (2020-06-10T15:00: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.