False traps on quantum-classical optimization landscapes

• URL: http://arxiv.org/abs/2603.05190v1
• Date: Thu, 05 Mar 2026 14:03:09 GMT
• Title: False traps on quantum-classical optimization landscapes
• Abstract summary: We show that false traps can still emerge on landscapes even with sufficient parameters.<n>The emergence of false traps is linked to the loss of distinguishability among states or operators in the objective function.
• Score: 3.213138004671347
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Optimization is ubiquitous in quantum information science and technology, however, the corresponding optimization landscape can encounter false traps, i.e., local but not global optima, likely to prevent used optimizers from finding optimal solutions. Such traps are believed to arise from parameter insufficiency and are expected to disappear when tunable parameters are sufficiently abundant. In this work, we investigate optimization landscapes of quantum optimization problems, and especially obtain that the parameter sufficiency is not enough to ensure the absence of false traps. First, we present a complete framework for analyzing critical features of optimization landscapes, by deriving necessary and sufficient conditions to identify all critical points and to classify them as local maxima, minima, or saddles, under some assumptions. Then, we show that false traps can still emerge on landscapes even with sufficient parameters, implying their appearance cannot be solely attributed to parameter insufficiency. Moreover, a close connection between landscape topology and quantum distinguishability is revealed that the emergence of false traps is linked to the loss of distinguishability among states or operators in the objective function. Finally, implications of our results are noted. Our work not only provides a deeper understanding of the intrinsic complexity of quantum-classical optimization, but also provides practical guidance for solving quantum-classical optimization problems, thus significantly aiding the progress in witnessing quantum advantages of the underlying quantum information processing tasks.

Related papers

• Certified bounds on optimization problems in quantum theory [2.8417851789786686]
  We introduce a rigorous framework for extracting exact rational optimization on non-commutative problems from numerical data.<n>An extension to sparsity and symmetry-adapted semidefinite relaxations is also provided compared to the general scheme.
  arXiv  Detail & Related papers  (2025-12-19T15:44:15Z)
• Hot-Starting Quantum Portfolio Optimization [39.916647837440316]
  Combinatorial optimization with a smooth and convex objective function arises naturally in applications such as discrete mean-variance portfolio optimization.<n>We introduce a novel approach that restricts the search space to discrete solutions in the vicinity of the continuous optimum by constructing a compact Hilbert space.<n> Experiments on software solvers and a D-Wave Advantage quantum annealer demonstrate that our method outperforms state-of-the-art techniques.
  arXiv  Detail & Related papers  (2025-10-13T08:47:43Z)
• Quantum Annealing Hyperparameter Analysis for Optimal Sensor Placement in Production Environments [39.58317527488534]
  We show how quantum computing could contribute to cost-efficient, large-scale optimization problems once the hardware matures.<n>We transform the problem into a quadratic unconstrained binary optimization formulation with one-hot and binary encoding.<n>Our results demonstrate that quantum annealing is capable of solving instances derived from real-world scenarios.
  arXiv  Detail & Related papers  (2025-07-22T13:35:51Z)
• Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits [0.05999777817331316]
  We introduce Directanglement Ansatz Learning ( DEAL), which exploits a quantum entanglement-based ansatz to explore intricate latent spaces and zero noise extrapolation (ZNE)<n>Deal increases the success rate by up to 14% compared to the classic quantum approximation optimization algorithm.<n>In addition, we demonstrate the capability of DEAL to provide near optimum ground energy solutions for travelling salesman, knapsack, and maxcut problems.
  arXiv  Detail & Related papers  (2025-04-05T02:05:45Z)
• A Novel Unified Parametric Assumption for Nonconvex Optimization [53.943470475510196]
  Non optimization is central to machine learning, but the general framework non convexity enables weak convergence guarantees too pessimistic compared to the other hand.<n>We introduce a novel unified assumption in non convex algorithms.
  arXiv  Detail & Related papers  (2025-02-17T21:25:31Z)
• 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)
• Boundary Exploration for Bayesian Optimization With Unknown Physical Constraints [37.095510211590984]
  We propose BE-CBO, a new Bayesian optimization method that efficiently explores the boundary between feasible and infeasible designs. Our method demonstrates superior performance against state-of-the-art methods through comprehensive experiments on synthetic and real-world benchmarks.
  arXiv  Detail & Related papers  (2024-02-12T14:59:40Z)
• Challenges and Opportunities in Quantum Optimization [14.7608536260003]
  Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. Across computer science and physics, there are different approaches for major optimization problems.
  arXiv  Detail & Related papers  (2023-12-04T19:00:44Z)
• Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational Quantum Systems [65.268245109828]
  We compare the performance of classicals across a series of partially-randomized tasks. We focus on local zeroth-orders due to their generally favorable performance and query-efficiency on quantum systems.
  arXiv  Detail & Related papers  (2023-10-14T02:13:26Z)
• Scalable Bayesian Meta-Learning through Generalized Implicit Gradients [64.21628447579772]
  Implicit Bayesian meta-learning (iBaML) method broadens the scope of learnable priors, but also quantifies the associated uncertainty. Analytical error bounds are established to demonstrate the precision and efficiency of the generalized implicit gradient over the explicit one.
  arXiv  Detail & Related papers  (2023-03-31T02:10:30Z)
• Generalizing Bayesian Optimization with Decision-theoretic Entropies [102.82152945324381]
  We consider a generalization of Shannon entropy from work in statistical decision theory. We first show that special cases of this entropy lead to popular acquisition functions used in BO procedures. We then show how alternative choices for the loss yield a flexible family of acquisition functions.
  arXiv  Detail & Related papers  (2022-10-04T04:43:58Z)
• 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)

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.