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:2604.26861

Protein folding on a 64 qubit trapped-ion hardware via counterdiabatic quantum optimization

Alejandro Gomez Cadavid, Pavle Nikačević, Pranav Chandarana, Sebastián V. Romero, Enrique Solano, Narendra N. Hegade, Miguel Angel Lopez-Ruiz, Claudio Girotto, Hanna Linn, Hakan Doga, Evgeny Epifanovsky, Panagiotis Kl. Barkoutsos, Ananth Kaushik, Martin Roetteler

quant-phSubmitted Apr 29, 2026• Announced Apr 30, 2026• 0 citations
arXivHTMLPDF

Abstract

We report the largest trapped-ion hardware demonstration of lattice protein-folding optimization to date, using bias-field digitized counterdiabatic quantum optimization (BF-DCQO) on a fully connected 64-qubit Barium development system similar to the forthcoming IonQ Tempo line. Six peptide sequences with 14-16 amino-acid residues are encoded using a coarse-grained tetrahedral lattice model, yielding higher-order spin-glass Hamiltonians with long-range interactions involving up to five-body terms and mapped to 46-61 qubits. The resulting instances are demanding for near-term quantum hardware because low-energy configurations must satisfy backbone-geometry constraints while optimizing dense residue-contact interactions. BF-DCQO uses a non-variational bias-feedback mechanism, where low-energy samples from each round define longitudinal fields that guide subsequent quantum evolutions. Across the studied instances, BF-DCQO shifts raw sampled energy distributions toward lower energies than uniform random sampling, with the strongest improvements appearing in residue-contact variables. To preserve this signal, we introduce a consensus-based post-processing pipeline that combines quantum-learned contact information with feasible backbone geometries. The resulting hybrid workflow reaches the classical reference energy in multiple instances and improves over the corresponding random-seeded pipeline. These results show that BF-DCQO can generate structured samples for dense protein-folding Hamiltonians at previously unexplored trapped-ion scales.

Related papers

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

Large-scale portfolio optimization on a trapped-ion quantum computer

Alejandro Gomez Cadavid, Ananth Kaushik, Pranav Chandarana +10 more

We present an end-to-end pipeline for large-scale portfolio selection with cardinality constraints and experimentally demonstrate it on trapped-ion quantum processors using hardware-aware decomposition. Building on RMT-based correlation-matrix denoising and community detection, we identify correlated asset groups and introduce a correlation-guided greedy splitting scheme that caps each cluster by the executable qubit budget. Each cluster defines a hardware-embeddable QUBO subproblem that we solve using bias-field digitized counterdiabatic quantum optimization (BF-DCQO), a non-variational method that avoids classical parameter-training loops. We recombine low-energy candidates into global portfolios and enforce feasibility with a two-stage post-processing routine: fast repair followed by a cardinality-preserving swap local search. We benchmark the workflow on a 250-asset universe taken from the S&P 500 and execute subproblems on a 64-qubit Barium development system similar to the forthcoming IonQ Tempo line. We observe that larger executable subproblem sizes reduce decomposition error and systematically improve final objective values and risk-return trade-offs relative to randomized baselines under identical post-processing. Overall, the results establish a hardware-tested route for scaling financial optimization problems, defined by a trade space in which executable problem size and circuit cost are balanced against the resulting solution quality.

quant-pharXiv:2602.23976•Mar 2, 2026•2 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

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

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

Quantum Assisted Protein Structure Optimization with Variational Circuit Based First Principles Conformation Search

Yalla Jnan Devi Satya Prasad, Devi Satya Prasad

Protein structure prediction remains central to computational biology and drug discovery. While deep learning models such as AlphaFold have achieved remarkable accuracy for known fold families, they struggle with novel folds, intrinsically disordered regions, and conformational dynamics, and they do not explicitly optimize physics-based energy functions. We present a quantum-assisted approach to protein conformation optimization that uses parameterized quantum circuits within a variational framework to explore the energy landscape of small proteins and fragments from first-principles or coarse-grained physics. Our method encodes backbone torsion angles (ϕ, ψ) and selected side-chain degrees of freedom into qubit registers and employs a variational quantum eigensolver (VQE)-inspired optimization to minimize an approximate Hamiltonian incorporating bonded interactions, sterics, hydrogen bonding, and hydrophobic contacts. We introduce problem-inspired ansätze that respect chain connectivity and secondary-structure motifs (helices, beta-sheets) and propose hierarchical circuit growth strategies for scaling from peptides to larger domains. Through classical simulations of small peptides and secondary-structure motifs, we demonstrate that quantum variational optimization can identify low-energy conformations consistent with experimentally determined structures. We provide explicit resource estimates for NISQ and early fault-tolerant quantum computers and discuss hybrid classical-quantum strategies for refining quantum solutions with classical molecular dynamics and machinelearning priors. While full protein-folding quantum advantage remains distant, we identify concrete subproblems where nearterm quantum devices offer complementary physics-based insight beyond data-driven approaches, opening pathways toward practical quantum-classical protein structure and drug discovery pipelines.

•Feb 2, 2026•0 citations
We report the largest trapped-ion hardware demonstration of lattice protein-folding optimization to date, using bias-field digitized counterdiabatic quantum optimization (BF-DCQO) on a fully connected 64-qubit Barium development system similar to the forthcoming IonQ Tempo line. Six peptide sequences with 14-16 amino-acid residues are encoded using a coarse-grained tetrahedral lattice model, yielding higher-order spin-glass Hamiltonians with long-range interactions involving up to five-body terms and mapped to 46-61 qubits. The resulting instances are demanding for near-term quantum hardware because low-energy configurations must satisfy backbone-geometry constraints while optimizing dense residue-contact interactions. BF-DCQO uses a non-variational bias-feedback mechanism, where low-energy samples from each round define longitudinal fields that guide subsequent quantum evolutions. Across the studied instances, BF-DCQO shifts raw sampled energy distributions toward lower energies than uniform random sampling, with the strongest improvements appearing in residue-contact variables. To preserve this signal, we introduce a consensus-based post-processing pipeline that combines quantum-learned contact information with feasible backbone geometries. The resulting hybrid workflow reaches the classical reference energy in multiple instances and improves over the corresponding random-seeded pipeline. These results show that BF-DCQO can generate structured samples for dense protein-folding Hamiltonians at previously unexplored trapped-ion scales.
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 present an end-to-end pipeline for large-scale portfolio selection with cardinality constraints and experimentally demonstrate it on trapped-ion quantum processors using hardware-aware decomposition. Building on RMT-based correlation-matrix denoising and community detection, we identify correlated asset groups and introduce a correlation-guided greedy splitting scheme that caps each cluster by the executable qubit budget. Each cluster defines a hardware-embeddable QUBO subproblem that we solve using bias-field digitized counterdiabatic quantum optimization (BF-DCQO), a non-variational method that avoids classical parameter-training loops. We recombine low-energy candidates into global portfolios and enforce feasibility with a two-stage post-processing routine: fast repair followed by a cardinality-preserving swap local search. We benchmark the workflow on a 250-asset universe taken from the S&P 500 and execute subproblems on a 64-qubit Barium development system similar to the forthcoming IonQ Tempo line. We observe that larger executable subproblem sizes reduce decomposition error and systematically improve final objective values and risk-return trade-offs relative to randomized baselines under identical post-processing. Overall, the results establish a hardware-tested route for scaling financial optimization problems, defined by a trade space in which executable problem size and circuit cost are balanced against the resulting solution quality.
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 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.
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.
Protein structure prediction remains central to computational biology and drug discovery. While deep learning models such as AlphaFold have achieved remarkable accuracy for known fold families, they struggle with novel folds, intrinsically disordered regions, and conformational dynamics, and they do not explicitly optimize physics-based energy functions. We present a quantum-assisted approach to protein conformation optimization that uses parameterized quantum circuits within a variational framework to explore the energy landscape of small proteins and fragments from first-principles or coarse-grained physics. Our method encodes backbone torsion angles (ϕ, ψ) and selected side-chain degrees of freedom into qubit registers and employs a variational quantum eigensolver (VQE)-inspired optimization to minimize an approximate Hamiltonian incorporating bonded interactions, sterics, hydrogen bonding, and hydrophobic contacts. We introduce problem-inspired ansätze that respect chain connectivity and secondary-structure motifs (helices, beta-sheets) and propose hierarchical circuit growth strategies for scaling from peptides to larger domains. Through classical simulations of small peptides and secondary-structure motifs, we demonstrate that quantum variational optimization can identify low-energy conformations consistent with experimentally determined structures. We provide explicit resource estimates for NISQ and early fault-tolerant quantum computers and discuss hybrid classical-quantum strategies for refining quantum solutions with classical molecular dynamics and machinelearning priors. While full protein-folding quantum advantage remains distant, we identify concrete subproblems where nearterm quantum devices offer complementary physics-based insight beyond data-driven approaches, opening pathways toward practical quantum-classical protein structure and drug discovery pipelines.