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

QFoldAgent: An Autonomous Quantum Optimization Multi-Agent System for Protein Structure Prediction

Winson Chen, Yuqi Zhang, Sixu Chen, Nuo Xu, Qiang Guan, Caiwen Ding

Published May 11, 2026• 0 citations
arXivHTMLPDF

Abstract

Hybrid quantum-classical protein structure prediction depends strongly on Hamiltonian penalty weights, yet existing lattice-based workflows typically fix these coefficients by hand and evaluate only very short fragments in simulation. We present QFoldAgent, a closed-loop multi-agent framework for 5-residue tetrahedral-lattice folding in which a design agent proposes sequence-conditioned penalties, a VQE-based quantum-classical pipeline optimizes the resulting Hamiltonian under Qiskit Aer noise, and a feedback agent uses energy-landscape diagnostics and MolProbity validation signals to refine penalties across cycles. Ground-truth metrics such as RMSD are never exposed to the agents and are used only for evaluation. We study the framework on two complementary datasets: 55 QDockBank-derived fragments with known structures and 100 coverage-optimized unseen sequences. On the QDockBank benchmark, QFoldAgent reduces median RMSD from 3.64 Å to 3.20 Å, with the largest gains on the hardest targets. On unseen sequences, the closed loop raises structural validity from 87.5% to 98.7%, recovers 87% of initially invalid cases, and the strongest controller improves cycle-3 energy on 87% of sequences while maintaining 96% Ramachandran-favored geometry. These results show that iterative agent control can systematically improve optimization behavior and reduce failure cases in a 5-residue quantum setting.

DOI
10.48550/arxiv.2607.22549

Related papers

A Quantum Framework for Protein Binding‐Site Structure Prediction on Utility‐Level Quantum Processors

Yuqi Zhang, Yuxin Yang, William Martin +8 more

Accurate prediction of protein active-site structures remains a central challenge in structural biology, especially for short and flexible peptide fragments where conventional and simulation-based methods often fail. Here, we present a quantum computing framework designed for utility-level quantum processors to address this problem. Starting from an amino acid sequence, we cast structure prediction as a ground-state energy minimization task using the Variational Quantum Eigensolver (VQE). Amino acid connectivity is represented on a tetrahedral lattice, and steric, geometric, and chirality constraints are encoded into a problem-specific Hamiltonian expressed as sparse Pauli operators. A two-stage architecture separates energy estimation from measurement decoding, enabling noise mitigation under realistic device conditions. We evaluate the method on 23 real protein fragments from the PDBbind dataset and 7 fragments from therapeutically relevant proteins, executing all experiments on the IBM-Cleveland Clinic quantum processor. Structural predictions are benchmarked against AlphaFold3 (AF3) and classical simulation-based approaches using identical postprocessing and docking procedures. Our quantum framework outperforms both AF3 and classical baselines in Root-Mean-Square Deviation (RMSD) and docking efficacy, demonstrating a practical end-to-end pipeline for biologically relevant structure prediction on real quantum hardware and highlighting its engineering feasibility for near-term quantum devices.

arXiv:2506.22677•Advanced Science•Nov 28, 2025•17 citations

A Hybrid Quantum–AI Framework for Protein Structure Prediction on NISQ Devices

Yuqi Zhang, Yuxin Yang, Feixiong Chen +6 more

Variational quantum algorithms provide a direct, physics-based approach to protein structure prediction, but their accuracy is limited by the coarse resolution of the energy landscapes generated on current noisy devices. We propose a hybrid framework that combines quantum computation with deep learning, formulating structure prediction as a problem of energy fusion. Candidate conformations are obtained through the Variational Quantum Eigensolver (VQE) executed on IBM’s 127 qubit superconducting processor, which defines a global yet low resolution quantum energy surface. To refine these basins, secondary structure probabilities and dihedral angle distributions predicted by the NSP3 neural network are incorporated as statistical potentials. These additional terms sharpen the valleys of the quantum landscape, resulting in a fused energy function that enhances effective resolution and better distinguishes native like structures. Evaluation on 375 conformations from 75 protein fragments shows that, on this short fragment-only benchmark (10–14 residues without surrounding chain context), the hybrid pipeline achieves a mean RMSD of 4.9 Å with statistical significance ( p < 0.001), outperforming both quantum-only re-rankings and fragment-level runs of AlphaFold3 and ColabFold. We caution that this conclusion is restricted to the fragment-scale regime accessible to current quantum hardware and does not extend to the full-chain regime in which AlphaFold3 and ColabFold are usually evaluated. The findings demonstrate that energy fusion offers a systematic method for combining data driven models with quantum algorithms, improving the practical applicability of near term quantum computing to molecular and structural biology.

arXiv:2510.06413•ACM Transactions on Quantum Computing•Sep 30, 2026•6 citations

A Quantum-Classical Hybrid System for Protein Folding

Manikanta Gandivalasa, Vamsi Bandana, Chandini Patnaikuni +2 more

Protein folding is a computationally intensive problem in bioinformatics that involves predicting the three-dimensional structure of a protein from its amino acid sequence. Classical approaches face challenges due to the exponential complexity of the search space. In this paper, we propose Q-ProteinFold, a quantum-classical hybrid system that leverages the Variational Quantum Eigensolver (VQE) for protein folding approximation. The system encodes protein sequences into parameterized quantum circuits using Qiskit and explores multiple conformations through quantum superposition and entanglement. A classical optimizer iteratively minimizes the energy function to identify stable protein structures. The implementation is developed using Python, Streamlit, and Qiskit Aer simulator. Experimental results demonstrate energy convergence, probabilistic state distribution, and effective fold prediction. This work highlights the potential of quantum computing in solving complex biological optimization problems.

•Mar 25, 2026•0 citations

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

Alejandro Gomez Cadavid, Pavle Nikačević, Pranav Chandarana +11 more

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.

quant-pharXiv:2604.26861•Apr 30, 2026•0 citations

Logarithmic-scale variational quantum eigensolver for off-lattice protein structure prediction in continuous torsional angle space

Fabio Cumbo, Bryan Raubenolt, Varun Puram +3 more

Classical and current quantum approaches to protein structure prediction (QPSP) face limitations, notably massive qubit requirements restricting near-term models to simplistic on-lattice simulations. We propose a logarithmic-scale variational quantum eigensolver (VQE) that reduces qubit requirements for N torsional degrees of freedom to O(log2N), enabling off-lattice, all-atom simulations. Our architecture extracts molecular torsions from relative phases in statevector simulations. On quantum hardware, a decoder maps the empirical cumulative distribution function (CDF) from basis-state probabilities to bounded torsional variables. These feed a classical algorithm to build heavy-atom coordinates. We use an EfficientSU2 ansatz and multi-stage relaxation to mitigate barren plateaus. Structures are evaluated via a custom hybrid quantum-classical Hamiltonian, alongside Rosetta and OpenMM benchmarks. Evaluation on chignolin and Trp-cage yielded native-like conformations. Chignolin reached a 0.623 Å Cα RMSD in retained snapshots and 1.199 Å in final models; Trp-cage achieved a 2.501 Å RMSD among snapshots (3.512 Å in final models). Execution on IBM processors (ibm_cleveland, ibm_miami) successfully recovered native-like structures with a best RMSD of 1.758 Å. The custom energy function performed best overall, though energy-ranking imbalances persisted across sampled landscapes for all functions. This introduces the first all-atom, continuous-space quantum algorithm for QPSP. By converting physical qubit constraints into circuit depth constraints, it proves high-resolution prediction is feasible with exponentially fewer qubits. Despite current limits like computational overhead and energy function sensitivity, it establishes a scalable foundation for hybrid quantum biophysics.

quant-pharXiv:2609.02113•Sep 3, 2026•0 citations

Quantum Sampling Architecture for Protein Structure Reconstruction on Utility-Scale Hardware

Yuqi Zhang, Bo Fang, Yuxin Yang +6 more

Predicting the structure of short peptides in protein binding pockets remains difficult because this regime requires physics-based conformational search, yet existing methods do not provide a practical way to carry out that search on current hardware. We present QSAD, a quantum-classical framework that reformulates peptide structure prediction as amino-acid-level Hamiltonian sampling and replaces iterative optimization with non-iterative Hamiltonian evolution. Executed entirely on IBM Heron R2 across 101 binding-pocket peptides (5-18 residues), QSAD improves prediction accuracy by 27-71% over all evaluated AI and quantum baselines while maintaining the lowest variance across tested lengths. QSAD also tolerates noise levels 3-5x beyond typical hardware error rates, where iterative methods fail, and reduces mean quantum execution time by 27x relative to VQE. The sampled ensemble further supports approximate reconstruction of protein energy landscapes. These results establish coarse-grained quantum sampling as a practical computational path for structure prediction in regimes where data-driven methods lack sufficient signal.

arXiv:2607.06971•Jul 8, 2026•1 citation
Hybrid quantum-classical protein structure prediction depends strongly on Hamiltonian penalty weights, yet existing lattice-based workflows typically fix these coefficients by hand and evaluate only very short fragments in simulation. We present QFoldAgent, a closed-loop multi-agent framework for 5-residue tetrahedral-lattice folding in which a design agent proposes sequence-conditioned penalties, a VQE-based quantum-classical pipeline optimizes the resulting Hamiltonian under Qiskit Aer noise, and a feedback agent uses energy-landscape diagnostics and MolProbity validation signals to refine penalties across cycles. Ground-truth metrics such as RMSD are never exposed to the agents and are used only for evaluation. We study the framework on two complementary datasets: 55 QDockBank-derived fragments with known structures and 100 coverage-optimized unseen sequences. On the QDockBank benchmark, QFoldAgent reduces median RMSD from 3.64 Å to 3.20 Å, with the largest gains on the hardest targets. On unseen sequences, the closed loop raises structural validity from 87.5% to 98.7%, recovers 87% of initially invalid cases, and the strongest controller improves cycle-3 energy on 87% of sequences while maintaining 96% Ramachandran-favored geometry. These results show that iterative agent control can systematically improve optimization behavior and reduce failure cases in a 5-residue quantum setting.
Accurate prediction of protein active-site structures remains a central challenge in structural biology, especially for short and flexible peptide fragments where conventional and simulation-based methods often fail. Here, we present a quantum computing framework designed for utility-level quantum processors to address this problem. Starting from an amino acid sequence, we cast structure prediction as a ground-state energy minimization task using the Variational Quantum Eigensolver (VQE). Amino acid connectivity is represented on a tetrahedral lattice, and steric, geometric, and chirality constraints are encoded into a problem-specific Hamiltonian expressed as sparse Pauli operators. A two-stage architecture separates energy estimation from measurement decoding, enabling noise mitigation under realistic device conditions. We evaluate the method on 23 real protein fragments from the PDBbind dataset and 7 fragments from therapeutically relevant proteins, executing all experiments on the IBM-Cleveland Clinic quantum processor. Structural predictions are benchmarked against AlphaFold3 (AF3) and classical simulation-based approaches using identical postprocessing and docking procedures. Our quantum framework outperforms both AF3 and classical baselines in Root-Mean-Square Deviation (RMSD) and docking efficacy, demonstrating a practical end-to-end pipeline for biologically relevant structure prediction on real quantum hardware and highlighting its engineering feasibility for near-term quantum devices.
Variational quantum algorithms provide a direct, physics-based approach to protein structure prediction, but their accuracy is limited by the coarse resolution of the energy landscapes generated on current noisy devices. We propose a hybrid framework that combines quantum computation with deep learning, formulating structure prediction as a problem of energy fusion. Candidate conformations are obtained through the Variational Quantum Eigensolver (VQE) executed on IBM’s 127 qubit superconducting processor, which defines a global yet low resolution quantum energy surface. To refine these basins, secondary structure probabilities and dihedral angle distributions predicted by the NSP3 neural network are incorporated as statistical potentials. These additional terms sharpen the valleys of the quantum landscape, resulting in a fused energy function that enhances effective resolution and better distinguishes native like structures. Evaluation on 375 conformations from 75 protein fragments shows that, on this short fragment-only benchmark (10–14 residues without surrounding chain context), the hybrid pipeline achieves a mean RMSD of 4.9 Å with statistical significance ( p < 0.001), outperforming both quantum-only re-rankings and fragment-level runs of AlphaFold3 and ColabFold. We caution that this conclusion is restricted to the fragment-scale regime accessible to current quantum hardware and does not extend to the full-chain regime in which AlphaFold3 and ColabFold are usually evaluated. The findings demonstrate that energy fusion offers a systematic method for combining data driven models with quantum algorithms, improving the practical applicability of near term quantum computing to molecular and structural biology.
Protein folding is a computationally intensive problem in bioinformatics that involves predicting the three-dimensional structure of a protein from its amino acid sequence. Classical approaches face challenges due to the exponential complexity of the search space. In this paper, we propose Q-ProteinFold, a quantum-classical hybrid system that leverages the Variational Quantum Eigensolver (VQE) for protein folding approximation. The system encodes protein sequences into parameterized quantum circuits using Qiskit and explores multiple conformations through quantum superposition and entanglement. A classical optimizer iteratively minimizes the energy function to identify stable protein structures. The implementation is developed using Python, Streamlit, and Qiskit Aer simulator. Experimental results demonstrate energy convergence, probabilistic state distribution, and effective fold prediction. This work highlights the potential of quantum computing in solving complex biological optimization problems.
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.
Classical and current quantum approaches to protein structure prediction (QPSP) face limitations, notably massive qubit requirements restricting near-term models to simplistic on-lattice simulations. We propose a logarithmic-scale variational quantum eigensolver (VQE) that reduces qubit requirements for N torsional degrees of freedom to O(log2N), enabling off-lattice, all-atom simulations. Our architecture extracts molecular torsions from relative phases in statevector simulations. On quantum hardware, a decoder maps the empirical cumulative distribution function (CDF) from basis-state probabilities to bounded torsional variables. These feed a classical algorithm to build heavy-atom coordinates. We use an EfficientSU2 ansatz and multi-stage relaxation to mitigate barren plateaus. Structures are evaluated via a custom hybrid quantum-classical Hamiltonian, alongside Rosetta and OpenMM benchmarks. Evaluation on chignolin and Trp-cage yielded native-like conformations. Chignolin reached a 0.623 Å Cα RMSD in retained snapshots and 1.199 Å in final models; Trp-cage achieved a 2.501 Å RMSD among snapshots (3.512 Å in final models). Execution on IBM processors (ibm_cleveland, ibm_miami) successfully recovered native-like structures with a best RMSD of 1.758 Å. The custom energy function performed best overall, though energy-ranking imbalances persisted across sampled landscapes for all functions. This introduces the first all-atom, continuous-space quantum algorithm for QPSP. By converting physical qubit constraints into circuit depth constraints, it proves high-resolution prediction is feasible with exponentially fewer qubits. Despite current limits like computational overhead and energy function sensitivity, it establishes a scalable foundation for hybrid quantum biophysics.
Predicting the structure of short peptides in protein binding pockets remains difficult because this regime requires physics-based conformational search, yet existing methods do not provide a practical way to carry out that search on current hardware. We present QSAD, a quantum-classical framework that reformulates peptide structure prediction as amino-acid-level Hamiltonian sampling and replaces iterative optimization with non-iterative Hamiltonian evolution. Executed entirely on IBM Heron R2 across 101 binding-pocket peptides (5-18 residues), QSAD improves prediction accuracy by 27-71% over all evaluated AI and quantum baselines while maintaining the lowest variance across tested lengths. QSAD also tolerates noise levels 3-5x beyond typical hardware error rates, where iterative methods fail, and reduces mean quantum execution time by 27x relative to VQE. The sampled ensemble further supports approximate reconstruction of protein energy landscapes. These results establish coarse-grained quantum sampling as a practical computational path for structure prediction in regimes where data-driven methods lack sufficient signal.