Hybrid Sequential Quantum Computing

• URL: http://arxiv.org/abs/2510.05851v1
• Date: Tue, 07 Oct 2025 12:15:43 GMT
• Title: Hybrid Sequential Quantum Computing
• Authors: Pranav Chandarana, Sebastián V. Romero, Alejandro Gomez Cadavid, Anton Simen, Enrique Solano, Narendra N. Hegade,
• Abstract summary: We introduce hybrid sequential quantum computing (HSQC)<n>HSQC systematically integrates classical and quantum methods within a structured, stage-wise workflow.<n>Compared to standalone classical solvers, HSQC achieves a speedup of up to 700 times over SA and up to 9 times over runtime.
• Score: 33.72751145910978
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce hybrid sequential quantum computing (HSQC), a paradigm for combinatorial optimization that systematically integrates classical and quantum methods within a structured, stage-wise workflow. HSQC may involve an arbitrary sequence of classical and quantum processes, as long as the global result outperforms the standalone components. Our testbed begins with classical optimizers to explore the solution landscape, followed by quantum optimization to refine candidate solutions, and concludes with classical solvers to recover nearby or exact-optimal states. We demonstrate two instantiations: (i) a pipeline combining simulated annealing (SA), bias-field digitized counterdiabatic quantum optimization (BF-DCQO), and memetic tabu search (MTS); and (ii) a variant combining SA, BF-DCQO, and a second round of SA. This workflow design is motivated by the complementary strengths of each component. Classical heuristics efficiently find low-energy configurations, but often get trapped in local minima. BF-DCQO exploits quantum resources to tunnel through these barriers and improve solution quality. Due to decoherence and approximations, BF-DCQO may not always yield optimal results. Thus, the best quantum-enhanced state is used to continue with a final classical refinement stage. Applied to challenging higher-order unconstrained binary optimization (HUBO) problems on a 156-qubit heavy-hexagonal superconducting quantum processor, we show that HSQC consistently recovers ground-state solutions in just a few seconds. Compared to standalone classical solvers, HSQC achieves a speedup of up to 700 times over SA and up to 9 times over MTS in estimated runtimes. These results demonstrate that HSQC provides a flexible and scalable framework capable of delivering up to two orders of magnitude improvement at runtime quantum-advantage level on advanced commercial quantum processors.

Related papers

• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits [14.569660066740758]
  optimization problems have attracted tremendous attention due to their broad applicability and natural fitness to Ising Hamiltonians.<n>Here we propose a quantum sampling strategy, based on which we design an algorithm for accelerating solving the ground states of Ising model.<n>Using up to 104 superconducting qubits, we demonstrate that this algorithm outputs favorable solutions against even a highly-optimized classical simulated subroutine (SA) algorithm.
  arXiv  Detail & Related papers  (2025-09-15T02:58:38Z)
• Solving quantum-inspired dynamics on quantum and classical annealers [0.0]
  We propose a benchmarking suite inspired by physical dynamics to challenge both quantum and classical computers.<n>We convert the real-time propagator of an $n$-qubit, possibly non-Hermitian, Hamiltonian into a quadratic-unconstrained binary optimisation problem.<n>The resulting QUBO instances are executed on D-Wave quantum annealers as well as using two classical solvers, Simulated Annealing and VeloxQ.
  arXiv  Detail & Related papers  (2025-09-04T07:27:11Z)
• Bridging Classical and Quantum Computing for Next-Generation Language Models [17.823221766129723]
  We introduce Adaptive Quantum-Classical Fusion (AQCF), the first framework to bridge the gap between classical and quantum processing.<n>AQCF's core principle is real-time adaptation: it analyzes input complexity to orchestrate seamless transitions between classical and quantum processing.<n> Experiments on sentiment analysis demonstrate that AQCF achieves competitive performance, significantly improves quantum resource efficiency, and operates successfully within typical NISQ constraints.
  arXiv  Detail & Related papers  (2025-08-09T15:49:26Z)
• Hybrid Quantum-Classical Optimisation of Traveling Salesperson Problem [0.0]
  The Traveling Salesperson Problem (TSP) is a fundamental NP-hard optimisation challenge.<n>We present a hybrid quantum-classical approach that integrates quantum optimisation techniques with classical machine learning methods.
  arXiv  Detail & Related papers  (2025-02-28T22:07:28Z)
• Quantum Optimization for Optimal Power Flow: CVQLS-Augmented Interior Point Method [0.0]
  This paper presents a quantum-enhanced optimization approach for solving optimal power flow (OPF)<n>We integrate the interior point method (IPM) with a coherent variational quantum linear solver (CVQLS)<n>We evaluate our approaches on multiple systems to show their effectiveness in providing reliable OPF solutions.
  arXiv  Detail & Related papers  (2024-12-18T17:43:51Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06: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.