Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
- URL: http://arxiv.org/abs/2212.13511v1
- Date: Tue, 27 Dec 2022 14:57:45 GMT
- Title: Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
- Authors: Pranav Chandarana, Narendra N. Hegade, Iraitz Montalban, Enrique
Solano, and Xi Chen
- Abstract summary: We propose a hybrid classical-quantum digitized-counterdiabatic algorithm to tackle the protein folding problem on a tetrahedral lattice.
We benchmark our quantum algorithm with Quantinuum's trapped ions, Google's and IBM's superconducting circuits.
- Score: 3.2174634059872154
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 the digitization of the counterdiabatic acceleration of
a given adiabatic quantum computation. Finding the lowest energy configuration
of the amino acid sequence is an NP-hard optimization problem that plays a
prominent role in chemistry, biology, and drug design. We outperform
state-of-the-art quantum algorithms using problem-inspired and
hardware-efficient variational quantum circuits. We apply our method to
proteins with up to 9 amino acids, using up to 17 qubits on quantum hardware.
Specifically, we benchmark our quantum algorithm with Quantinuum's trapped
ions, Google's and IBM's superconducting circuits, obtaining high success
probabilities with low-depth circuits as required in the NISQ era.
Related papers
- Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Complexity-Theoretic Limitations on Quantum Algorithms for Topological
Data Analysis [59.545114016224254]
Quantum algorithms for topological data analysis seem to provide an exponential advantage over the best classical approach.
We show that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers.
We argue that an exponential quantum advantage can be recovered if the input data is given as a specification of simplices.
arXiv Detail & Related papers (2022-09-28T17:53:25Z) - Quantum Computing Quantum Monte Carlo [8.69884453265578]
We propose a hybrid quantum-classical algorithm that integrates quantum computing and quantum Monte Carlo.
Our work paves the way to solving practical problems with intermediatescale and early-fault tolerant quantum computers.
arXiv Detail & Related papers (2022-06-21T14:26:24Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard.
We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware.
The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
arXiv Detail & Related papers (2021-07-08T17:59:55Z) - Digitized Adiabatic Quantum Factorization [3.53163169498295]
We propose an alternative factorization method, within the digitized-adiabatic quantum computing paradigm, by digitizing an adiabatic quantum factorization algorithm.
We find that this fast factorization algorithm is suitable for available gate-based quantum computers.
arXiv Detail & Related papers (2021-05-19T13:26:23Z) - Quantum circuit synthesis of Bell and GHZ states using projective
simulation in the NISQ era [0.0]
We studied the viability of using Projective Simulation, a reinforcement learning technique, to tackle the problem of quantum circuit synthesis for noise quantum computers with limited number of qubits.
Our simulations demonstrated that the agent had a good performance but its capacity for learning new circuits decreased as the number of qubits increased.
arXiv Detail & Related papers (2021-04-27T16:11:27Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - QFold: Quantum Walks and Deep Learning to Solve Protein Folding [0.0]
We develop quantum computational tools to predict how proteins fold in 3D.
We explain how to combine recent deep learning advances with the well known technique of quantum walks applied to a Metropolis.
arXiv Detail & Related papers (2021-01-25T18:00:03Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z)
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.