Quantum Algorithm for Protein Structure Prediction Using the Face-Centered Cubic Lattice

• URL: http://arxiv.org/abs/2507.08955v1
• Date: Fri, 11 Jul 2025 18:28:33 GMT
• Title: Quantum Algorithm for Protein Structure Prediction Using the Face-Centered Cubic Lattice
• Abstract summary: We present the first implementation of the face-centered cubic (FCC) lattice model for protein structure prediction with a quantum algorithm.<n>We are able to recover ground state configurations for the 6-amino acid sequence KLVFFA under noise.
• Score: 28.79836122081471
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we present the first implementation of the face-centered cubic (FCC) lattice model for protein structure prediction with a quantum algorithm. Our motivation to encode the FCC lattice stems from our observation that the FCC lattice is more capable in terms of modeling realistic secondary structures in proteins compared to other lattices, as demonstrated using root mean square deviation (RMSD). We utilize two quantum methods to solve this problem: a polynomial fitting approach (PolyFit) and the Variational Quantum Eigensolver with constraints (VQEC) based on the Lagrangian duality principle. Both methods are successfully deployed on Eagle R3 (ibm_cleveland) and Heron R2 (ibm_kingston) quantum computers, where we are able to recover ground state configurations for the 6-amino acid sequence KLVFFA under noise. A comparative analysis of the outcomes generated by the two QPUs reveals a significant enhancement (reaching nearly a two-fold improvement for PolyFit and a three-fold improvement for VQEC) in the prediction and sampling of the optimal solution (ground state conformations) on the newer Heron R2 architecture, highlighting the impact of quantum hardware advancements for this application.

Related papers

• Logarithmic-scale variational quantum eigensolver for off-lattice protein structure prediction in continuous torsional angle space [0.0]
  We propose a logarithmic-scale variational quantum eigensolver (VQE) that reduces qubit requirements for N torsional degrees of freedom to O(log2N)<n>This introduces the first all-atom, continuous-space quantum algorithm for protein structure prediction (QPSP)<n>It proves high-resolution prediction is feasible with exponentially fewer qubits.
  arXiv  Detail & Related papers  (2026-09-02T05:05:46Z)
• Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem [0.0]
  We propose a novel quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs)<n>In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes.<n>We show that the CTQW-based algorithm consistently achieves superior approximation ratios and exhibits remarkable robustness with respect to network topology.
  arXiv  Detail & Related papers  (2025-12-02T17:04:57Z)
• Quantum Orthogonal Separable Physics-Informed Neural Networks [0.0]
  This paper introduces Quantum Orthogonal Separable Physics-Informed Neural Networks (QO-SPINNs), a novel architecture for solving Partial Differential Equations.<n>We leverage a quantum algorithm for accelerating matrix multiplication within each layer, achieving a $mathcal O(dlog d/2)$ complexity.<n>We provide a robust and efficient framework for uncertainty quantification (UQ) which, to our knowledge, is the first UQ method specifically designed for Separable PINNs.
  arXiv  Detail & Related papers  (2025-11-16T14:15:19Z)
• Quantum Visual Fields with Neural Amplitude Encoding [70.86293548779774]
  We introduce a new type of Quantum Implicit Neural Representation (QINR) for 2D image and 3D geometric field learning.<n>QVF encodes classical data into quantum statevectors using neural amplitude encoding grounded in a learnable energy manifold.<n>Our ansatz follows a fully entangled design of learnable parametrised quantum circuits, with quantum (unitary) operations performed in the real Hilbert space.
  arXiv  Detail & Related papers  (2025-08-14T17:59:52Z)
• Optimization of the Qubit Coupled Cluster Ansatz on classical computers [0.0]
  We report two schemes for improving the amplitude optimisation in the iterative qubit coupled cluster (iQCC) method.<n>First scheme approximates the QCC unitary as a sum of generators coupled up to a given order.<n>Second scheme limits the size of the expansion space in which the QCC unitary is generated.
  arXiv  Detail & Related papers  (2025-02-24T19:11:40Z)
• Evolving a multi-population evolutionary-QAOA on distributed QPUs [0.0]
  We benchmark this Evolutionary-QAOA (E-QAOA) approach on the Max-Cut problem for $d$-3 regular graphs of 4 to 26 nodes.<n>We propose a novel distributed multi-population EA strategy, executing parallel, independent populations on two quantum processing units.
  arXiv  Detail & Related papers  (2024-09-16T21:16:51Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
  Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.<n>One of the main challenges of such quantum algorithms is increasing the system size.<n>We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
  arXiv  Detail & Related papers  (2024-01-17T09:52:24Z)
• Predicting RNA Secondary Structure on Universal Quantum Computer [2.277461161767121]
  It is the first step for understanding how RNA structure folds from base sequences that to know how its secondary structure is formed. Traditional energy-based algorithms are short of precision, particularly for non-nested sequences. Gate model algorithms for universal quantum computing are not available.
  arXiv  Detail & Related papers  (2023-05-16T15:57:38Z)
• 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)
• Photonic Quantum Computing For Polymer Classification [62.997667081978825]
  Two polymer classes visual (VIS) and near-infrared (NIR) are defined based on the size of the polymer gaps. We present a hybrid classical-quantum approach to the binary classification of polymer structures.
  arXiv  Detail & Related papers  (2022-11-22T11:59:52Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Polynomial unconstrained binary optimisation inspired by optical simulation [52.11703556419582]
  We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization. We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
  arXiv  Detail & Related papers  (2021-06-24T16:39:31Z)

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.