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

• URL: http://arxiv.org/abs/2609.02113v1
• Date: Wed, 02 Sep 2026 05:05:46 GMT
• Title: Logarithmic-scale variational quantum eigensolver for off-lattice protein structure prediction in continuous torsional angle space
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Fault tolerant computation of the static structure factor and finite size effects [43.936586633107396]
  We develop a quantum post-processing strategy for the leading two-body finite-size correction.<n>After one-body shell effects are reduced by twist averaging, the dominant residual error is controlled by long-wavelength density fluctuations.<n>We also introduce adaptive global and local binary search procedures for identifying the infrared fitting window used to reconstruct the two-body finite size error correction.
  arXiv  Detail & Related papers  (2026-06-26T05:31:08Z)
• Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning [38.502127166117674]
  We propose gated QKAN-FWP, a fast-weight framework that integrates FWP with Quantum-inspired Kolmogorov-Arnold Network (QKAN)<n>We use single-qubit data re-uploading circuits as learnable nonlinear activation, known as DatA Re-Uploading ActivatioN (DARUAN)<n>We evaluate the framework across time-series benchmarks, MiniGrid reinforcement learning, and highlight real-world solar cycle forecasting as our main practical result.
  arXiv  Detail & Related papers  (2026-05-07T13:04:09Z)
• Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors [40.72140849821964]
  We consider the massive Thirring and Gross-Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$.<n>We prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$.<n>Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models.
  arXiv  Detail & Related papers  (2026-02-25T19:00:01Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• When Less is More: Approximating the Quantum Geometric Tensor with Block Structures [43.39839287869652]
  We introduce a block-diagonal quantum geometric tensor that partitions the metric by network layers, analogous to block-structured Fisher methods such as K-FAC.<n> Experiments on Heisenberg and frustrated $J_1$-$J$ models show faster convergence, lower energy, and improved stability.
  arXiv  Detail & Related papers  (2025-10-09T16:44:30Z)
• Randomized Quantum Singular Value Transformation [18.660349597156266]
  We introduce the first randomized algorithms for Quantum Singular Value Transformation (QSVT)<n>Standard implementations of QSVT rely on block encodings of the Hamiltonian, requiring a logarithmic number of ancilla qubits, intricate multi-qubit control, and circuit depth scaling linearly with the number of Hamiltonian terms.<n>Our algorithms use only a single ancilla qubit and entirely avoid block encodings.
  arXiv  Detail & Related papers  (2025-10-08T10:14:15Z)
• Fast-forwardable Lindbladians imply quantum phase estimation [26.310568727393758]
  We show that certain simple Lindbladian processes can be adapted to perform QPE-type tasks.<n>Unlike QPE, which achieves Heisenberg-limit scaling, these Lindbladian evolutions are restricted to standard quantum limit complexity.<n>This indicates that, different from Hamiltonian dynamics, the natural dissipative evolution speed of such Lindbladians does not saturate the fundamental quantum limit.
  arXiv  Detail & Related papers  (2025-10-08T08:36:46Z)
• Quantum Machine Learning for Predicting Binding Free Energies in Structure-Based Virtual Screening [0.0]
  We introduce a quantum machine learning approach that encodes molecular information into quantum states.<n>With six quantum circuit units, the model achieves an RMSD of 2.37 kcal/mol and a Pearson correlation of 0.650.
  arXiv  Detail & Related papers  (2025-07-24T14:01:39Z)
• SRBB-Based Quantum State Preparation [1.3108652488669736]
  A scalable algorithm for the approximate quantum state preparation problem is proposed.<n>The algorithm uses a variational quantum circuit based on the Standard Recursive Block Basis (SRBB)<n>The desired quantum state is then approximated by a scalable quantum neural network.
  arXiv  Detail & Related papers  (2025-03-17T18:51:07Z)
• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• Large-scale quantum annealing simulation with tensor networks and belief propagation [0.0]
  We show that quantum annealing for 3-regular graphs can be classically simulated even at scales of 1000 qubits and 5000000qubit gates. For non-degenerate instances, the unique solution can be read out from the final reduced single-qubit states. For degenerate problems, such as MaxCut, we introduce an approximate measurement simulation algorithm for graph tensor-network states.
  arXiv  Detail & Related papers  (2024-09-18T18:00:08Z)
• Orbital-free density functional theory with first-quantized quantum subroutines [0.0]
  We propose a quantum-classical hybrid scheme for performing orbital-free density functional theory (OFDFT) using probabilistic imaginary-time evolution (PITE) PITE is applied to the part of OFDFT that searches the ground state of the Hamiltonian in each self-consistent field (SCF) iteration. It is shown that obtaining the ground state energy of Hamiltonian requires a circuit depth of $O(log N_mathrmg)$.
  arXiv  Detail & Related papers  (2024-07-23T05:34:11Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices [3.1952399274829775]
  We develop a tool called quantum eigenvalue transformation of unitary matrices with reals (QET-U) This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy. We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model.
  arXiv  Detail & Related papers  (2022-04-12T17:11:40Z)

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.