Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2504.15367

Branch-and-bound digitized counterdiabatic quantum optimization

Anton Simen, Sebastián V. Romero, Alejandro Gomez Cadavid, E. Solano, Narendra N. Hegade

Published Apr 21, 2025• 10 citations
arXivHTMLPDF

Abstract

Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order formulations pose challenges due to their inherent non-convexity. In this work, we propose branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO), a quantum algorithm that addresses the relaxation difficulties in higher-order unconstrained binary optimization (HUBO) problems. By employing bias fields as approximate solutions to the relaxed problem, we iteratively enhance the quality of the results compared to the bare bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm. We refer to this enhanced method as BBB-DCQO. In order to benchmark it against simulated annealing (SA), we apply it on sparse HUBO instances with up to $156$ qubits using tensor network simulations. To explore regimes that are less tractable for classical simulations, we experimentally apply BBB-DCQO to denser problems using up to 100 qubits on IBM quantum hardware. We compare our results with SA and a greedy-tuned quantum annealing baseline. In both simulations and experiments, BBB-DCQO consistently achieved higher-quality solutions with significantly reduced computational overhead, showcasing the effectiveness of integrating counterdiabatic quantum methods into branch-and-bound to address hard non-convex optimization tasks.

DOI
10.48550/arxiv.2504.15367

Related papers

Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization

Sebastián V. Romero, Anne-Maria Visuri, Alejandro Gomez Cadavid +3 more

Abstract Combinatorial optimization plays a crucial role in many industrial applications. While classical computing often struggles with complex instances, quantum optimization emerges as a promising alternative. Here, we present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO). We apply BF-DCQO to a HUBO problem featuring three-local terms in the Ising spin-glass model, validated experimentally using 156 qubits on an IBM quantum processor. In the studied instances, our results outperform standard methods such as the quantum approximate optimization algorithm, quantum annealing, simulated annealing, and Tabu search. Furthermore, we provide numerical evidence of the feasibility of a similar HUBO problem on a 433-qubit Osprey-like quantum processor. Finally, we solve denser instances of the MAX 3-SAT problem in an IonQ emulator. Our results show that BF-DCQO offers an effective path for solving large-scale HUBO problems on current and near-term quantum processors.

arXiv:2409.04477•Communications Physics•Aug 23, 2025•34 citations

Bias-field digitized counterdiabatic quantum optimization

Alejandro Gomez Cadavid, Archismita Dalal, Anton Simen +2 more

We introduce a method for solving combinatorial optimization problems on digital quantum computers, where we incorporate auxiliary counterdiabatic (CD) terms into the adiabatic Hamiltonian, while integrating bias terms derived from an iterative digitized counterdiabatic quantum algorithm. We call this protocol bias-field digitized counterdiabatic quantum optimization (BF-DCQO). Designed to effectively tackle large-scale combinatorial optimization problems, BF-DCQO demonstrates resilience against the limitations posed by the restricted coherence times of current quantum processors and shows clear enhancement even in the presence of noise. Additionally, our purely quantum approach eliminates the dependency on classical optimization required in hybrid classical-quantum schemes, thereby circumventing the trainability issues often associated with variational quantum algorithms. Through the analysis of an all-to-all connected general Ising spin-glass problem, we exhibit a polynomial scaling enhancement in ground-state success probability compared to traditional DCQO and finite-time adiabatic quantum optimization methods. Furthermore, it achieves scaling improvements in ground-state success probabilities, increasing by up to two orders of magnitude, and offers an average 1.3 × better approximation ratio than the quantum approximate optimization algorithm for the problem sizes studied. We validate these findings through experimental implementations on both trapped-ion quantum computers and superconducting processors, tackling a maximum weighted independent set problem with 36 qubits and a spin glass on a heavy-hexagonal lattice with 100 qubits, respectively. These results mark a significant advancement in gate-based quantum computing, employing a fully quantum algorithmic approach.

arXiv:2405.13898•Physical Review Research•Apr 9, 2025•24 citations

Efficient Protein Folding Using Bias-Field Digitized Counter diabatic Quantum Optimization and HUBO Encoding

Snehalata Funde, Ebhad Swagat Sadashiv, Vijay Agatrao Galande +3 more

Traditional quantum optimization methods rely on mapping problems to Quadratic Unconstrained Optimization formats (QUBO). This necessitated a computationally intensive quadratization process which can increase qubit requirements by up to 4.3x. To bypass this, the proposed framework implements the Bias-Field Digitized counter adiabatic Quantum Optimization (BF-DCQO) algorithm to solve binary optimization problems.The proposed approach utilizes a digitized counter adiabatic driving protocol to suppress diabatic transitions. Unlike the variational approaches, BF-DCQO is a measurement-driven approach, and it iteratively refines the solution using the dynamically updated bias fields which are based on qubit expectation values. The proposed framework demonstrates this methodology by folding sequences up to 12 amino acids on 33 qubits. This represents the largest protein folding instance executed. Experimental results on the IonQ Forte systems indicate solution achievement with 3x to 4x fewer entangling gates. This is a 75x improvement in success probability for dense optimization instances.The proposed BF-DCQO framework eliminates the problem of barren plateaus by providing a scalable solution for high-dimensional molecular modeling in pharmaceutical research.

International Conference on Computer, Mechatronics, Robotics & Artificial Intelligence (ICCMRAI)•Jul 1, 2026•0 citations

Protein folding with an all-to-all trapped-ion quantum computer

Sebastián V. Romero, Alejandro Gomez Cadavid, Pavle Nikačević +8 more

We experimentally demonstrate that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm, implemented on IonQ's fully connected trapped-ion quantum processors, offers an efficient approach to solving dense higher-order unconstrained binary optimization (HUBO) problems. Specifically, we tackle protein folding on a tetrahedral lattice for up to 12 amino acids, representing the largest quantum hardware implementations of protein folding problems reported to date. Additionally, we address MAX 4-SAT instances at the computational phase transition and fully connected spin-glass problems using all 36 available qubits. Across all considered cases, our method consistently achieves optimal solutions, highlighting the powerful synergy between non-variational quantum optimization approaches and the intrinsic all-to-all connectivity of trapped-ion architectures. Given the expected scalability of trapped-ion quantum systems, BF-DCQO represents a promising pathway toward practical quantum advantage for dense HUBO problems with significant industrial and scientific relevance.

arXiv:2506.07866•Jun 9, 2025•18 citations

VeloxQ: A Fast and Efficient QUBO Solver

Jakub Pawłowski, Jan Tuziemski, Paweł Tarasiuk +5 more

We introduce VeloxQ, a fast solver for Quadratic Unconstrained Binary Optimization (QUBO) problems, which are central to many real-world optimization tasks. Unlike approaches that depend on emerging quantum hardware, VeloxQ can be deployed on conventional computing infrastructure. We benchmark VeloxQ against state-of-the-art QUBO solvers from several families. These include quantum annealers, specifically D-Wave's Advantage and Advantage2 platforms; the digital-quantum BF-DCQO algorithm for Higher-Order Unconstrained Binary Optimization (HUBO) developed by Kipu Quantum; physics-inspired algorithms including Simulated Bifurcation, Parallel Annealing, and tropical tensor networks; and conventional methods including CPLEX, brute force, BEIT's Chimera solver, and Branch-and-Bound variants. The benchmark suite covers native quantum-annealer topologies, embedded all-to-all instances, HUBO-derived instances, planted-solution instances, certified-solver regimes, and dense Branch-and-Bound test cases. Across the benchmark suite, VeloxQ delivers competitive solution quality and runtime, and in several regimes outperforms the compared solvers. VeloxQ also demonstrates strong scalability. Among the solvers considered in this study, it was the only method we could run on the largest sparse instances within our computational budget, including problems with up to $10^{8}$ sparsely connected variables. These findings position VeloxQ as a competitive and practical tool for tackling large-scale QUBO/HUBO problems, offering a practical alternative to existing quantum and classical optimization methods.

arXiv:2501.19221•Jan 31, 2025•16 citations

Quantum optimization beyond QUBO for industrial logistics and scheduling

Juan F. R. Hernandez, Pavle Nikacevic, Enrique Solano +4 more

The increasing complexity of industrial scheduling and transport routing problems motivates the study of alternative optimization formulations and computational paradigms. In this work, we study how higher-order unconstrained binary optimization (HUBO) formulations of such problems map onto quantum optimization workflows in both noisy and fault-tolerant regimes. We consider three representative logistics and manufacturing use cases and formulate each as a HUBO problem. This captures process intricacies, such as highly correlated assembly-line scheduling rules, which are difficult to express faithfully with the standard quadratic (QUBO) form, while at the same time reducing the number of binary variables required in the quantum mapping, thus lowering qubit demand. We compare the HUBO formulations with corresponding QUBO encodings, highlighting a key trade-off: while HUBO reduces qubit requirements through compact binary encoding, it introduces higher-order interaction terms that increase circuit depth, limiting feasibility on current quantum hardware. The proposed formulations are validated using classical solvers across several problem instances and benchmark small routing problem instances using bias-field digitized counterdiabatic quantum optimization in classical simulation. We complement these results with a resource and scalability analysis, focusing on the capacitated vehicle routing problem as a representative large-scale industrial use case. Our analysis indicates that while HUBO formulations offer advantages in qubit scaling compared to QUBO encodings, their practical implementation is constrained by gate fidelity, coherence, and circuit depth, making hybrid quantum-classical workflows and early fault-tolerant quantum hardware the most plausible settings for their practical use.

quant-pharXiv:2605.30252•May 29, 2026•1 citation
Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order formulations pose challenges due to their inherent non-convexity. In this work, we propose branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO), a quantum algorithm that addresses the relaxation difficulties in higher-order unconstrained binary optimization (HUBO) problems. By employing bias fields as approximate solutions to the relaxed problem, we iteratively enhance the quality of the results compared to the bare bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm. We refer to this enhanced method as BBB-DCQO. In order to benchmark it against simulated annealing (SA), we apply it on sparse HUBO instances with up to 156156156 qubits using tensor network simulations. To explore regimes that are less tractable for classical simulations, we experimentally apply BBB-DCQO to denser problems using up to 100 qubits on IBM quantum hardware. We compare our results with SA and a greedy-tuned quantum annealing baseline. In both simulations and experiments, BBB-DCQO consistently achieved higher-quality solutions with significantly reduced computational overhead, showcasing the effectiveness of integrating counterdiabatic quantum methods into branch-and-bound to address hard non-convex optimization tasks.
Abstract Combinatorial optimization plays a crucial role in many industrial applications. While classical computing often struggles with complex instances, quantum optimization emerges as a promising alternative. Here, we present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO). We apply BF-DCQO to a HUBO problem featuring three-local terms in the Ising spin-glass model, validated experimentally using 156 qubits on an IBM quantum processor. In the studied instances, our results outperform standard methods such as the quantum approximate optimization algorithm, quantum annealing, simulated annealing, and Tabu search. Furthermore, we provide numerical evidence of the feasibility of a similar HUBO problem on a 433-qubit Osprey-like quantum processor. Finally, we solve denser instances of the MAX 3-SAT problem in an IonQ emulator. Our results show that BF-DCQO offers an effective path for solving large-scale HUBO problems on current and near-term quantum processors.
We introduce a method for solving combinatorial optimization problems on digital quantum computers, where we incorporate auxiliary counterdiabatic (CD) terms into the adiabatic Hamiltonian, while integrating bias terms derived from an iterative digitized counterdiabatic quantum algorithm. We call this protocol bias-field digitized counterdiabatic quantum optimization (BF-DCQO). Designed to effectively tackle large-scale combinatorial optimization problems, BF-DCQO demonstrates resilience against the limitations posed by the restricted coherence times of current quantum processors and shows clear enhancement even in the presence of noise. Additionally, our purely quantum approach eliminates the dependency on classical optimization required in hybrid classical-quantum schemes, thereby circumventing the trainability issues often associated with variational quantum algorithms. Through the analysis of an all-to-all connected general Ising spin-glass problem, we exhibit a polynomial scaling enhancement in ground-state success probability compared to traditional DCQO and finite-time adiabatic quantum optimization methods. Furthermore, it achieves scaling improvements in ground-state success probabilities, increasing by up to two orders of magnitude, and offers an average 1.3 × better approximation ratio than the quantum approximate optimization algorithm for the problem sizes studied. We validate these findings through experimental implementations on both trapped-ion quantum computers and superconducting processors, tackling a maximum weighted independent set problem with 36 qubits and a spin glass on a heavy-hexagonal lattice with 100 qubits, respectively. These results mark a significant advancement in gate-based quantum computing, employing a fully quantum algorithmic approach.
Traditional quantum optimization methods rely on mapping problems to Quadratic Unconstrained Optimization formats (QUBO). This necessitated a computationally intensive quadratization process which can increase qubit requirements by up to 4.3x. To bypass this, the proposed framework implements the Bias-Field Digitized counter adiabatic Quantum Optimization (BF-DCQO) algorithm to solve binary optimization problems.The proposed approach utilizes a digitized counter adiabatic driving protocol to suppress diabatic transitions. Unlike the variational approaches, BF-DCQO is a measurement-driven approach, and it iteratively refines the solution using the dynamically updated bias fields which are based on qubit expectation values. The proposed framework demonstrates this methodology by folding sequences up to 12 amino acids on 33 qubits. This represents the largest protein folding instance executed. Experimental results on the IonQ Forte systems indicate solution achievement with 3x to 4x fewer entangling gates. This is a 75x improvement in success probability for dense optimization instances.The proposed BF-DCQO framework eliminates the problem of barren plateaus by providing a scalable solution for high-dimensional molecular modeling in pharmaceutical research.
We experimentally demonstrate that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm, implemented on IonQ's fully connected trapped-ion quantum processors, offers an efficient approach to solving dense higher-order unconstrained binary optimization (HUBO) problems. Specifically, we tackle protein folding on a tetrahedral lattice for up to 12 amino acids, representing the largest quantum hardware implementations of protein folding problems reported to date. Additionally, we address MAX 4-SAT instances at the computational phase transition and fully connected spin-glass problems using all 36 available qubits. Across all considered cases, our method consistently achieves optimal solutions, highlighting the powerful synergy between non-variational quantum optimization approaches and the intrinsic all-to-all connectivity of trapped-ion architectures. Given the expected scalability of trapped-ion quantum systems, BF-DCQO represents a promising pathway toward practical quantum advantage for dense HUBO problems with significant industrial and scientific relevance.
We introduce VeloxQ, a fast solver for Quadratic Unconstrained Binary Optimization (QUBO) problems, which are central to many real-world optimization tasks. Unlike approaches that depend on emerging quantum hardware, VeloxQ can be deployed on conventional computing infrastructure. We benchmark VeloxQ against state-of-the-art QUBO solvers from several families. These include quantum annealers, specifically D-Wave's Advantage and Advantage2 platforms; the digital-quantum BF-DCQO algorithm for Higher-Order Unconstrained Binary Optimization (HUBO) developed by Kipu Quantum; physics-inspired algorithms including Simulated Bifurcation, Parallel Annealing, and tropical tensor networks; and conventional methods including CPLEX, brute force, BEIT's Chimera solver, and Branch-and-Bound variants. The benchmark suite covers native quantum-annealer topologies, embedded all-to-all instances, HUBO-derived instances, planted-solution instances, certified-solver regimes, and dense Branch-and-Bound test cases. Across the benchmark suite, VeloxQ delivers competitive solution quality and runtime, and in several regimes outperforms the compared solvers. VeloxQ also demonstrates strong scalability. Among the solvers considered in this study, it was the only method we could run on the largest sparse instances within our computational budget, including problems with up to 10810^{8}108 sparsely connected variables. These findings position VeloxQ as a competitive and practical tool for tackling large-scale QUBO/HUBO problems, offering a practical alternative to existing quantum and classical optimization methods.
The increasing complexity of industrial scheduling and transport routing problems motivates the study of alternative optimization formulations and computational paradigms. In this work, we study how higher-order unconstrained binary optimization (HUBO) formulations of such problems map onto quantum optimization workflows in both noisy and fault-tolerant regimes. We consider three representative logistics and manufacturing use cases and formulate each as a HUBO problem. This captures process intricacies, such as highly correlated assembly-line scheduling rules, which are difficult to express faithfully with the standard quadratic (QUBO) form, while at the same time reducing the number of binary variables required in the quantum mapping, thus lowering qubit demand. We compare the HUBO formulations with corresponding QUBO encodings, highlighting a key trade-off: while HUBO reduces qubit requirements through compact binary encoding, it introduces higher-order interaction terms that increase circuit depth, limiting feasibility on current quantum hardware. The proposed formulations are validated using classical solvers across several problem instances and benchmark small routing problem instances using bias-field digitized counterdiabatic quantum optimization in classical simulation. We complement these results with a resource and scalability analysis, focusing on the capacitated vehicle routing problem as a representative large-scale industrial use case. Our analysis indicates that while HUBO formulations offer advantages in qubit scaling compared to QUBO encodings, their practical implementation is constrained by gate fidelity, coherence, and circuit depth, making hybrid quantum-classical workflows and early fault-tolerant quantum hardware the most plausible settings for their practical use.