2 research outputs found
Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
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
Physics-Informed Neural Networks for an optimal counterdiabatic quantum computation
We introduce a novel methodology that leverages the strength of
Physics-Informed Neural Networks (PINNs) to address the counterdiabatic (CD)
protocol in the optimization of quantum circuits comprised of systems with
qubits. The primary objective is to utilize physics-inspired deep
learning techniques to accurately solve the time evolution of the different
physical observables within the quantum system. To accomplish this objective,
we embed the necessary physical information into an underlying neural network
to effectively tackle the problem. In particular, we impose the hermiticity
condition on all physical observables and make use of the principle of least
action, guaranteeing the acquisition of the most appropriate counterdiabatic
terms based on the underlying physics. The proposed approach offers a
dependable alternative to address the CD driving problem, free from the
constraints typically encountered in previous methodologies relying on
classical numerical approximations. Our method provides a general framework to
obtain optimal results from the physical observables relevant to the problem,
including the external parameterization in time known as scheduling function,
the gauge potential or operator involving the non-adiabatic terms, as well as
the temporal evolution of the energy levels of the system, among others. The
main applications of this methodology have been the and
molecules, represented by a 2-qubit and 4-qubit systems
employing the STO-3G basis. The presented results demonstrate the successful
derivation of a desirable decomposition for the non-adiabatic terms, achieved
through a linear combination utilizing Pauli operators. This attribute confers
significant advantages to its practical implementation within quantum computing
algorithms.Comment: 28 pages, 10 figures, 1 algorithm, 1 tabl