Distributed Quantum Optimization for Large-Scale Higher-Order Problems with Dense Interactions

• URL: http://arxiv.org/abs/2604.20599v1
• Date: Wed, 22 Apr 2026 14:15:20 GMT
• Title: Distributed Quantum Optimization for Large-Scale Higher-Order Problems with Dense Interactions
• Abstract summary: We develop a distributed quantum optimization framework (DQOF) for dense, large-scale optimization problems.<n>A clustering strategy enables wide quantum circuits without increasing depth, allowing efficient execution on near-term quantum hardware.<n>We demonstrate high-quality solutions for HUBOs up to 500 variables within 170 seconds, significantly outperforming conventional approaches.
• Score: 2.823158183209683
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Many real-world problems are naturally formulated as higher-order optimization (HUBO) tasks involving dense, multi-variable interactions, which are challenging to solve with classical methods. Quantum optimization offers a promising route, but hardware constraints and limitations to quadratic formulations have hampered their practicality. Here, we develop a distributed quantum optimization framework (DQOF) for dense, large-scale HUBO problems. DQOF assigns quantum circuits a central role in directly capturing higher-order interactions, while high-performance computing orchestrates large-scale parallelism and coordination. A clustering strategy enables wide quantum circuits without increasing depth, allowing efficient execution on near-term quantum hardware. We demonstrate high-quality solutions for HUBOs up to 500 variables within 170 seconds, significantly outperforming conventional approaches in solution quality and scalability. Applied to optical metamaterial design, DQOF efficiently discovers high-performance structures and shows that higher-order interactions are important for practical optimization problems. These results establish DQOF as a practical and scalable computational paradigm for large-scale scientific optimization.

Related papers

• DQAOA-GPT: AI-Accelerated Distributed Quantum Optimization for Combinatorial Problems [1.0380578526859343]
  Variational quantum algorithms offer a promising route for tackling exponentially large search spaces.<n>In this work, we introduce DQAOA-GPT, a hybrid framework that integrates the distributed quantum approximate optimization algorithm (DQAOA)<n>Rather than relying on iterative variational optimization, the proposed approach uses a trained generative model to directly generate high-quality quantum circuits for the sub-problems.
  arXiv  Detail & Related papers  (2026-07-22T14:46:33Z)
• Quantum Annealing for Combinatorial Optimization: A Benchmarking Study [39.125366249242646]
  We show that a state-of-the-art quantum solver has higher accuracy (0.013%) and a significantly faster problem-solving time (6,561x) than the best classical solver.<n>Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations.
  arXiv  Detail & Related papers  (2025-04-08T16:43:24Z)
• Distributed Variational Quantum Algorithm with Many-qubit for Optimization Challenges [0.25782420501870296]
  Existing quantum algorithms struggle with scalability and accuracy due to excessive reliance on entanglement.<n>We propose variational quantum optimization algorithm (VQOA), which leverages many-qubit (MQ) operations in an ansatz solely employing quantum superposition.<n>We also introduce distributed VQOA, which integrates high-performance computing with quantum computing to achieve superior performance across MQ systems and classical nodes.
  arXiv  Detail & Related papers  (2025-02-28T22:13:23Z)
• Distributed Quantum Approximate Optimization Algorithm on a Quantum-Centric Supercomputing Architecture [1.953969470387522]
  Quantum approximate optimization algorithm (QAOA) has shown promise in solving optimization problems by providing quantum speedup on gate-based quantum computing systems.<n>However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits.<n>We present a distributed QAOA (DQAOA) which decomposes a large computational workload into smaller tasks that require fewer qubits and shallower circuits.
  arXiv  Detail & Related papers  (2024-07-29T17:42:25Z)
• Variational Quantum Multi-Objective Optimization [5.381539115778766]
  We present a variational quantum optimization algorithm to solve discrete multi-objective optimization problems on quantum computers. We show the effectiveness of the proposed algorithm on several benchmark problems with up to five objectives.
  arXiv  Detail & Related papers  (2023-12-21T18:59:21Z)
• 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)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• 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)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.