Design and Analysis of an Improved Constrained Hypercube Mixer in Quantum Approximate Optimization Algorithm

• URL: http://arxiv.org/abs/2603.05187v1
• Date: Thu, 05 Mar 2026 13:57:15 GMT
• Title: Design and Analysis of an Improved Constrained Hypercube Mixer in Quantum Approximate Optimization Algorithm
• Authors: Arkadiusz Wołk, Karol Capała, Katarzyna Rycerz,
• Abstract summary: In the Noisy Intermediate-Scale Quantum (NISQ) era, QAOA is not suited for constrained problems.<n>One way to incorporate certain types of constraints is to restrict the mixing operator to the feasible subspace.<n>We present a modification that generates circuits with fewer gates for a broad class of constrained problems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Quantum Approximate Optimization Algorithm (QAOA) is expected to offer advantages over classical approaches when solving combinatorial optimization problems in the Noisy Intermediate-Scale Quantum (NISQ) era. In its standard formulation, however, QAOA is not suited for constrained problems. One way to incorporate certain types of constraints is to restrict the mixing operator to the feasible subspace; however, this substantially increases circuit size, thereby reducing noise robustness. In this work, we refine an existing hypercube mixer method for enforcing hard constraints in QAOA. We present a modification that generates circuits with fewer gates for a broad class of constrained problems defined by linear functions. Furthermore, we calculate an analytical upper bound on the number of binary variables for which this reduction might not apply. Additionally, we present numerical experimental results demonstrating that the proposed approach improves robustness to noise. In summary, the method proposed in this paper allows for more accurate QAOA performance in noisy settings, bringing us closer to practical, real-world NISQ-era applications.

Related papers

• Tensor Network Assisted Distributed Variational Quantum Algorithm for Large Scale Combinatorial Optimization Problem [19.046113542182436]
  We propose the Distributed Variational Quantum Algorithm (DVQA) for solving Combinatorial Optimization Problems (COPs)<n>A key innovation of DVQA is its use of the truncated higher-order singular value decomposition to preserve inter-variable dependencies without relying on complex long-range entanglement.<n> Empirically, DVQA achieves state-of-the-art performance in simulations and has been experimentally validated on the Wu Kong quantum computer for portfolio optimization.
  arXiv  Detail & Related papers  (2026-01-20T13:31:02Z)
• 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)
• Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking [45.147301546565316]
  This paper considers the problem of decentralized optimization on compact submanifolds.<n>We propose an algorithm where agents update variables using quantized variables.<n>To the best of our knowledge, this is the first algorithm to achieve an $mathcalO (1/K)$ convergence rate in the presence of quantization.
  arXiv  Detail & Related papers  (2025-06-09T01:57:25Z)
• Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization [0.19116784879310023]
  We introduce an approximate quadratization of high-order Hamiltonians which do not incur a qubit overhead.<n>This approximation yields shallower Ansatze which are more robust to noise than the standard QAOA one.<n>We also propose a noise-aware Ansatz design method for quadratic optimization problems.
  arXiv  Detail & Related papers  (2025-05-07T18:00:07Z)
• Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints [49.76332265680669]
  This paper examines a crucial subset of problems where both the objective and constraint functions are weakly convex.<n>Existing methods often face limitations, including slow convergence rates or reliance on double-loop designs.<n>We introduce a novel single-loop penalty-based algorithm to overcome these challenges.
  arXiv  Detail & Related papers  (2025-04-21T17:15:48Z)
• Solving Constrained Combinatorial Optimization Problems with Variational Quantum Imaginary Time Evolution [4.266376725904727]
  We show that VarQITE achieves significantly lower mean optimality gaps compared to other conventional methods.<n>We demonstrate that scaling the Hamiltonian can further reduce optimization costs and accelerate convergence.
  arXiv  Detail & Related papers  (2025-04-17T03:09:37Z)
• Hierarchical Quantum Optimization via Backbone-Driven Problem Decomposition: Integrating Tabu-Search with QAOA [6.1238490000465635]
  We propose Backbone-DrivenOA to overcome limitations of Noisy Intermediate Scale Quantum (NISQ) devices.<n>In our approach, adaptive Tabu search dynamically identifies and fixes backbone variables to construct reduced-dimensional subspaces.<n>Our proposed framework effectively orchestrates the allocation of quantum and classical resources, thereby enabling the solution of large-scale optimization problems.
  arXiv  Detail & Related papers  (2025-04-13T13:50:38Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• Constrained Optimization via Quantum Zeno Dynamics [23.391640416533455]
  We introduce a technique that uses quantum Zeno dynamics to solve optimization problems with multiple arbitrary constraints, including inequalities. We show that the dynamics of quantum optimization can be efficiently restricted to the in-constraint subspace on a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2022-09-29T18:00:40Z)
• Bayesian Optimization for QAOA [0.0]
  We present a Bayesian optimization procedure to optimise a quantum circuit. We show that our approach allows for a significant reduction in the number of calls to the quantum circuit. Our results suggest that the method proposed here is a promising framework to leverage the hybrid nature of QAOA on the noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2022-09-08T13:59:47Z)
• Quantum constraint learning for quantum approximate optimization algorithm [0.0]
  This paper introduces a quantum machine learning approach to learn the mixer Hamiltonian required to hard constrain the search subspace. One can directly plug the learnt unitary into the QAOA framework using an adaptable ansatz. We also develop an intuitive metric that uses Wasserstein distance to assess the performance of general approximate optimization algorithms with/without constraints.
  arXiv  Detail & Related papers  (2021-05-14T11:31:14Z)
• QED driven QAOA for network-flow optimization [17.745108999585867]
  We present a framework for modifying quantum approximate optimization algorithms (QAOA) to solve constrained network flow problems. By exploiting an analogy between flow constraints and Gauss's law for electromagnetism, we design lattice quantum electrodynamics inspired mixing Hamiltonians that preserve flow constraints throughout the QAOA process.
  arXiv  Detail & Related papers  (2020-06-16T18:02:35Z)
• 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.