English
Related papers

Related papers: Protein folding on a 64 qubit trapped-ion hardware…

200 papers

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…

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…

We propose a hybrid classical-quantum digitized-counterdiabatic algorithm to tackle the protein folding problem on a tetrahedral lattice. Digitized-counterdiabatic quantum computing is a paradigm developed to compress quantum algorithms via…

Quantum Physics · Physics 2023-07-13 Pranav Chandarana , Narendra N. Hegade , Iraitz Montalban , Enrique Solano , Xi Chen

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…

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…

The peptide-protein docking problem is an important problem in structural biology that facilitates rational and efficient drug design. In this work, we explore modeling and solving this problem with the quantum-amenable quadratic…

Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order…

We demonstrate experimentally that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm on IBM's 156-qubit devices can outperform simulated annealing (SA) and CPLEX in time-to-approximate solutions for specific…

Steric clashes pose a challenge when exploring dense protein systems using conventional explicit-chain methods. A minimal example is a single lattice protein confined on a minimal grid, with no free sites. Finding its minimum energy is a…

Quantum Physics · Physics 2025-10-03 Anders Irbäck , Lucas Knuthson , Sandipan Mohanty

Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers…

Predicting the three-dimensional (3D) structure of a protein from its primary sequence of amino acids is known as the protein folding (PF) problem. Due to the central role of proteins' 3D structures in chemistry, biology and medicine…

Quantum Physics · Physics 2021-03-18 Anton Robert , Panagiotis Kl. Barkoutsos , Stefan Woerner , Ivano Tavernelli

We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm in the impulse regime, that is, where the counterdiabatic terms are dominant. Our approach…

Quantum annealing is a promising approach for obtaining good approximate solutions to difficult optimization problems. Folding a protein sequence into its minimum-energy structure represents such a problem. For testing new algorithms and…

Quantum Physics · Physics 2022-10-13 Anders Irbäck , Lucas Knuthson , Sandipan Mohanty , Carsten Peterson

Protein folding is one of the age-old biological problems that refers to the mechanism of understanding and predicting how a protein's linear sequence of amino acids folds into its specific three dimensional structure.This structure is…

We present a quantum feature-selection framework based on a higher-order unconstrained binary optimization (HUBO) formulation that explicitly incorporates multivariate dependencies beyond standard quadratic encodings. In contrast to…

Protein folding processes are a vital aspect of molecular biology that is hard to simulate with conventional computers. Quantum algorithms have been proven superior for certain problems and may help tackle this complex life science…

Quantum Physics · Physics 2024-09-11 Hanna Linn , Isak Brundin , Laura García-Álvarez , Göran Johansson

We propose digitized-counterdiabatic quantum optimization (DCQO) to achieve polynomial enhancement over adiabatic quantum optimization for the general Ising spin-glass model, which includes the whole class of combinatorial optimization…

Quantum Physics · Physics 2023-01-12 Narendra N. Hegade , Xi Chen , Enrique Solano

Protein folding, which dictates the protein structure from its amino acid sequence, is half a century old problem of biology. The function of the protein correlates with its structure, emphasizing the need of understanding protein folding…

Quantum Physics · Physics 2025-01-03 Jaya Vasavi P , Soham Bopardikar , Avinash D , Ashwini K , Kalyan Dasgupta , Sanjib Senapati

Lattice models have been used extensively over the past thirty years to examine the principles of protein folding and design. These models can be used to determine the conformation of the lowest energy fold out of a large number of possible…

Quantum Physics · Physics 2018-11-05 Tomáš Babej , Christopher Ing , Mark Fingerhuth

We introduce a hardware-specific, problem-dependent digital-analog quantum algorithm of a counterdiabatic quantum dynamics tailored for optimization problems. Specifically, we focus on trapped-ion architectures, taking advantage from global…

‹ Prev 1 2 3 10 Next ›