Quantum algorithms for compact polymer thermodynamics

• URL: http://arxiv.org/abs/2603.12334v1
• Date: Thu, 12 Mar 2026 18:00:24 GMT
• Title: Quantum algorithms for compact polymer thermodynamics
• Abstract summary: Efficient sampling from ensembles of Hamiltonian cycles is critical for predicting the thermodynamic properties of compact polymers.<n>In this work, we enable a quadratic speedup in the estimation of thermodynamic properties of maximally compact polymers and heteropolymers by quantum computation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient sampling from ensembles of Hamiltonian cycles is critical for predicting the thermodynamic properties of compact polymers, with applications including modeling protein and RNA folding and designing soft materials. Although classical Monte Carlo methods are widely regarded as the standard approach, their efficiency is strongly limited when applied to compact polymers. In this work, we enable a quadratic speedup in the estimation of thermodynamic properties of maximally compact polymers and heteropolymers by quantum computation. To this end, we encode the target thermodynamic ensemble into the amplitudes of a quantum state, i.e., a quantum sample, which can be processed via amplitude amplification. Using quantum equational reasoning, we construct a local parent Hamiltonian whose unique ground state realizes a quantum sample of all Hamiltonian cycles. This state can be prepared on quantum hardware using ground-state preparation methods, such as quantum annealing, and subsequently manipulated to generate quantum samples of polymers and heteropolymers at a target temperature. Finally, we approximate the quantum sample as a tensor network, revealing an entanglement area law. For fixed-width rectangular lattices, we obtain a time-efficient and compact encoding of the full ensemble of Hamiltonian cycles, enabling the efficient evaluation of expectation values, partition functions, and configuration probabilities via tensor contractions, without resorting to sampling.

Related papers

• Neutrino thermalization via randomization on a quantum processor [37.457412158271126]
  We investigate flavor thermalization in much larger systems using random quantum circuits as an empirical tool to emulate the non-local dynamics.<n>We find that the thermalization time grows approximately as the square root of the system size, consistent with predictions from semi-classical methods.<n>It also highlights a new application of random circuits in physics, providing insight into complex many-body dynamics that are classically intractable.
  arXiv  Detail & Related papers  (2025-10-28T18:00:01Z)
• Simulating electronic structure on bosonic quantum computers [34.84696943963362]
  We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• Ab initio extended Hubbard model of short polyenes for efficient quantum computing [0.0]
  We propose introducing an extended Hubbard Hamiltonian derived via the ab initio downfolding method. The ab initio extended Hubbard Hamiltonian may hold significant potential for quantum chemical calculations using quantum computers.
  arXiv  Detail & Related papers  (2024-04-02T04:13:09Z)
• Accelerated quantum circuit Monte-Carlo simulation for heavy quark thermalization [0.0]
  We introduce and formalize an accelerated quantum circuit Monte-Carlo framework to simulate heavy quark thermalization. With simplified drag and diffusion coefficients connected by Einstein's relation, we simulate the thermalization of a heavy quark in isotropic and anisotropic mediums.
  arXiv  Detail & Related papers  (2023-12-26T19:01:19Z)
• On The Study Of Partial Qubit Hamiltonian For Efficient Molecular Simulation Using Variational Quantum Eigensolvers [0.0]
  We present a new approach for extracting information from the partial qubit Hamiltonian of simple molecules to design more efficient variational quantum eigensolvers. The results of this study have the potential to demonstrate the potential advancement in the field of quantum computing and its implementation in quantum chemistry.
  arXiv  Detail & Related papers  (2023-08-24T03:25:05Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Qubit-efficient simulation of thermal states with quantum tensor networks [13.128146097939263]
  We present a holographic quantum simulation algorithm to variationally prepare thermal states of interacting quantum manybody systems. We demonstrate a small-scale proof of principle demonstration of this technique on Quantinuum's trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2022-05-12T18:26:49Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Polymer Physics by Quantum Computing [0.0]
  We develop a formalism based on interacting binary tensors that allows for tackling the hard problem of sampling equilibrium ensembles of dense polymer mixtures. Our approach is general in that properties such as self-avoidance, branching, and looping can be specified in terms of quadratic interactions of the tensors. Our systematic approach offers a promising avenue to harness the rapid development of quantum computers for sampling discrete models of filamentous soft-matter systems.
  arXiv  Detail & Related papers  (2021-04-20T16:34:38Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)

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.