A Gauss-Newton based Quantum Algorithm for Combinatorial Optimization

• URL: http://arxiv.org/abs/2203.13939v4
• Date: Fri, 17 Jun 2022 04:24:52 GMT
• Title: A Gauss-Newton based Quantum Algorithm for Combinatorial Optimization
• Authors: Mitsuharu Takeori, Takahiro Yamamoto, Ryutaro Ohira, Shungo Miyabe
• Abstract summary: We present a Gauss-Newton based quantum algorithm (GNQA) for optimization problems that, under optimal conditions, rapidly converge towards one of the optimal solutions without being trapped in local minima or plateaus. Our approach mitigates those by employing a tensor product state that accurately represents the optimal solution, and an appropriate function for the Hamiltonian, containing all the combinations of binary variables. Numerical experiments presented here demonstrate the effectiveness of our approach, and they show that GNQA outperforms other optimization methods in both convergence properties and accuracy for all problems considered here.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we present a Gauss-Newton based quantum algorithm (GNQA) for combinatorial optimization problems that, under optimal conditions, rapidly converges towards one of the optimal solutions without being trapped in local minima or plateaus. Quantum optimization algorithms have been explored for decades, but more recent investigations have been on variational quantum algorithms, which often suffer from the aforementioned problems. Our approach mitigates those by employing a tensor product state that accurately represents the optimal solution, and an appropriate function for the Hamiltonian, containing all the combinations of binary variables. Numerical experiments presented here demonstrate the effectiveness of our approach, and they show that GNQA outperforms other optimization methods in both convergence properties and accuracy for all problems considered here. Finally, we briefly discuss the potential impact of the approach to other problems, including those in quantum chemistry and higher order binary optimization.

Related papers

• Performant near-term quantum combinatorial optimization [1.1999555634662633]
  We present a variational quantum algorithm for solving optimization problems with linear-depth circuits. Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target quantum function. We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.
  arXiv  Detail & Related papers  (2024-04-24T18:49:07Z)
• 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)
• Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer [3.591122855617648]
  We propose a new design to tackle optimisation problems, inspired by Hamiltonians for optimal state-transfer. We provide numerical evidence of the success of this new design.
  arXiv  Detail & Related papers  (2023-01-17T12:45:09Z)
• A Comparative Study On Solving Optimization Problems With Exponentially Fewer Qubits [0.0]
  We evaluate and improve an algorithm based on Variational Quantum Eigensolver (VQE) We highlight the numerical instabilities generated by encoding the problem into the variational ansatz. We propose a classical optimization procedure to find the ground-state of the ansatz in less iterations with a better objective.
  arXiv  Detail & Related papers  (2022-10-21T08:54:12Z)
• A Constrained Optimization Approach to Bilevel Optimization with Multiple Inner Minima [49.320758794766185]
  We propose a new approach, which convert the bilevel problem to an equivalent constrained optimization, and then the primal-dual algorithm can be used to solve the problem. Such an approach enjoys a few advantages including (a) addresses the multiple inner minima challenge; (b) fully first-order efficiency without Jacobian computations.
  arXiv  Detail & Related papers  (2022-03-01T18:20:01Z)
• Markov Chain Monte-Carlo Enhanced Variational Quantum Algorithms [0.0]
  We introduce a variational quantum algorithm that uses Monte Carlo techniques to place analytic bounds on its time-complexity. We demonstrate both the effectiveness of our technique and the validity of our analysis through quantum circuit simulations for MaxCut instances.
  arXiv  Detail & Related papers  (2021-12-03T23:03:44Z)
• 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)
• Improving the Quantum Approximate Optimization Algorithm with postselection [0.0]
  Combinatorial optimization is among the main applications envisioned for near-term and fault-tolerant quantum computers. We consider a well-studied quantum algorithm for optimization: the Quantum Approximate Optimization Algorithm (QAOA) applied to the MaxCut problem on 3-regular graphs. We derive theoretical upper and lower bounds showing that a constant (though small) increase of the fraction of satisfied edges is indeed achievable.
  arXiv  Detail & Related papers  (2020-11-10T22:17:50Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Convergence of adaptive algorithms for weakly convex constrained optimization [59.36386973876765]
  We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope. Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
  arXiv  Detail & Related papers  (2020-06-11T17:43:19Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.