Alternative threshold function for Bayesian Optimization of Variational Quantum Circuits

• URL: http://arxiv.org/abs/2507.20570v1
• Date: Mon, 28 Jul 2025 07:06:00 GMT
• Title: Alternative threshold function for Bayesian Optimization of Variational Quantum Circuits
• Authors: Shreyas Dillon,
• Abstract summary: We propose an expansion of the Expected Improvement over Confident Regions (EMICoRe) Variational Quantum Eigensolver (VQE)<n>We analyze the accuracy in approximated ground state energy and how the threshold evolves during optimization to compare the EMICoRe model with the proposed alternative.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we propose an expansion of the Expected Maximum Improvement over Confident Regions (EMICoRe) Variational Quantum Eigensolver (VQE) -- a technique advanced by Nicoli et al., which utilizes both quantum and classical components to approximate the ground state of a quantum system -- by introducing an alternative threshold for EMICoRe's Confident Region that depends on both the Gaussian process (GP) prior variance and the model's change in predicted energy over a set number of iterations. This modification is a more lenient threshold for the Confident Region and accounts for natural fluctuations in the predicted energy that EMICoRe punishes by eliminating the exploratory benefits presented by the Confident Region. We test both algorithms with the original EMICoRe model as a baseline and our results suggest improvement over EMICoRe's state-of-the-art results for a common benchmark for VQEs, the Ising Hamiltonian, and similar performance for more complex optimization regimes. We analyze the accuracy in approximated ground state energy and how the threshold evolves during optimization to compare the EMICoRe model with the proposed alternative. After comparison, we discuss the potential optimization of the degrees of freedom present in the new threshold for better performance and a more varied choice of system to be approximated.

Related papers

• Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
  A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently.<n>Momentum-QNG is more effective to escape local minima and plateaus in the variational parameter space.
  arXiv  Detail & Related papers  (2024-09-03T15:21:16Z)
• Towards Efficient Quantum Computation of Molecular Ground State Energies using Bayesian Optimization with Priors over Surface Topology [0.0]
  Variational Quantum Eigensolvers (VQEs) represent a promising approach to computing molecular ground states and energies on modern quantum computers. We propose modifications to the standard Bayesian optimization algorithm to leverage few-shot circuit observations to solve VQEs with fewer quantum resources.
  arXiv  Detail & Related papers  (2024-07-10T18:01:50Z)
• Physics-Informed Bayesian Optimization of Variational Quantum Circuits [13.530592183149661]
  We propose a novel and powerful method to harness Bayesian optimization for Variational Quantum Eigensolvers (VQEs) We derive a VQE- Kernel which incorporates important prior information about quantum circuits. We also propose a novel acquisition function for Bayesian optimization called Maximum Improvement over Confident Regions (EMICoRe)
  arXiv  Detail & Related papers  (2024-06-10T10:17:06Z)
• 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)
• Variational post-selection for ground states and thermal states simulation [1.9336815376402718]
  Variational quantum algorithms (VQAs) are one of the most promising routes in the noisy intermediate-scale quantum (NISQ) era. We propose a framework to enhance the expressiveness of variational quantum ansatz by incorporating variational post-selection techniques.
  arXiv  Detail & Related papers  (2024-02-12T12:16:17Z)
• 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)
• 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)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• 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)
• A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm [59.99439951055238]
  We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM) We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
  arXiv  Detail & Related papers  (2020-06-23T01:34:18Z)
• 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.