Approaches to Simultaneously Solving Variational Quantum Eigensolver Problems

• URL: http://arxiv.org/abs/2410.21413v1
• Date: Mon, 28 Oct 2024 18:12:30 GMT
• Title: Approaches to Simultaneously Solving Variational Quantum Eigensolver Problems
• Authors: Adam Hutchings, Eric Yarnot, Xinpeng Li, Qiang Guan, Ning Xie, Shuai Xu, Vipin Chaudhary,
• Abstract summary: The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm to find the lowest-energy eigenstate of a particular Hamiltonian. We aim to take advantage of the VQE solution process to obtain useful information while disregarding information which we can predict to not be very useful.
• Score: 6.888442073314732
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The variational quantum eigensolver (VQE), a type of variational quantum algorithm, is a hybrid quantum-classical algorithm to find the lowest-energy eigenstate of a particular Hamiltonian. We investigate ways to optimize the VQE solving process on multiple instances of the same problem, by observing the process on one instance of the problem to inform initialization for other processes. We aim to take advantage of the VQE solution process to obtain useful information while disregarding information which we can predict to not be very useful. In particular, we find that the solution process produces lots of data with very little new information. Therefore, we can safely disregard much of this repetitive information with little effect on the outcome of the solution process.

Related papers

• Quantum Computing, Ising Formulation, and the Traveling Salesman Problem [0.0]
  Ising formulation is important for many NP problems.<n>We present some non-trivial issues related to Ising model view versus a realistic salesman.
  arXiv  Detail & Related papers  (2025-12-30T16:04:13Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Hybrid classical-quantum branch-and-bound algorithm for solving integer linear problems [0.0]
  Quantum annealers are suited to solve several logistic optimization problems expressed in the QUBO formulation. The solutions proposed by the quantum annealers are generally not optimal, as thermal noise and other disturbing effects arise when the number of qubits involved in the calculation is too large. We propose the use of the classical branch-and-bound algorithm, that divides the problem into sub-problems which are described by a lower number of qubits.
  arXiv  Detail & Related papers  (2023-11-16T09:19:01Z)
• Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing [93.83016310295804]
  AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for computer vision tasks. In this work, we explore the potential of using this information for probabilistic balanced k-means clustering. Instead of discarding non-optimal solutions, we propose to use them to compute calibrated posterior probabilities with little additional compute cost. This allows us to identify ambiguous solutions and data points, which we demonstrate on a D-Wave AQC on synthetic tasks and real visual data.
  arXiv  Detail & Related papers  (2023-10-18T17:59:45Z)
• 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)
• 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)
• Information scrambling and entanglement in quantum approximate optimization algorithm circuits [9.730534141168752]
  Variational quantum algorithms are promising for demonstrating quantum advantages in the noisy intermediate-scale quantum (NISQ) era. We study information scrambling and entanglement in QAOA circuits, respectively, and discover that for a harder problem, more quantum resource is required.
  arXiv  Detail & Related papers  (2023-01-18T11:36:49Z)
• Efficient algorithms for quantum information bottleneck [64.67104066707309]
  We propose a new and general algorithm for the quantum generalisation of information bottleneck. Our algorithm excels in the speed and the definiteness of convergence compared with prior results. Notably, we discover that a quantum system can achieve strictly better performance than a classical system of the same size regarding quantum information bottleneck.
  arXiv  Detail & Related papers  (2022-08-22T14:20:05Z)
• Quantum-Assisted Greedy Algorithms [1.5049442691806054]
  We show how to leverage quantum annealers (QAs) to better select candidates in greedy algorithms. We use QAs that sample from the ground state of problem-dependent Hamiltonians at cryogenic temperatures.
  arXiv  Detail & Related papers  (2022-08-03T13:09:17Z)
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays [39.76254807200083]
  We experimentally investigate quantum algorithms for solving the Maximum Independent Set problem. We find the problem hardness is controlled by the solution degeneracy and number of local minima. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions.
  arXiv  Detail & Related papers  (2022-02-18T19:00:01Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• The Variational Quantum Eigensolver: a review of methods and best practices [3.628860803653535]
  The variational quantum eigensolver (or VQE) uses the variational principle to compute the ground state energy of a Hamiltonian. This review aims to provide an overview of the progress that has been made on the different parts of the algorithm.
  arXiv  Detail & Related papers  (2021-11-09T14:40:18Z)
• Quantum variational PDE solver with machine learning [0.0]
  We propose a quantum variational (QuVa) PDE solver with the aid of machine learning (ML) schemes. The core quantum processing in this solver is to calculate efficiently the expectation value of specially designed quantum operators.
  arXiv  Detail & Related papers  (2021-09-19T20:30:02Z)
• A Mutual Information Maximization Approach for the Spurious Solution Problem in Weakly Supervised Question Answering [60.768146126094955]
  Weakly supervised question answering usually has only the final answers as supervision signals. There may exist many spurious solutions that coincidentally derive the correct answer, but training on such solutions can hurt model performance. We propose to explicitly exploit such semantic correlations by maximizing the mutual information between question-answer pairs and predicted solutions.
  arXiv  Detail & Related papers  (2021-06-14T05:47: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.