Peptide Binding Classification on Quantum Computers
- URL: http://arxiv.org/abs/2311.15696v1
- Date: Mon, 27 Nov 2023 10:32:31 GMT
- Title: Peptide Binding Classification on Quantum Computers
- Authors: Charles London, Douglas Brown, Wenduan Xu, Sezen Vatansever,
Christopher James Langmead, Dimitri Kartsaklis, Stephen Clark, Konstantinos
Meichanetzidis
- Abstract summary: We conduct an extensive study on using near-term quantum computers for a task in the domain of computational biology.
We perform sequence classification on a task relevant to the design of therapeutic proteins, and find competitive performance with classical baselines of similar scale.
This work constitutes the first proof-of-concept application of near-term quantum computing to a task critical to the design of therapeutic proteins.
- Score: 3.9540968630765643
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We conduct an extensive study on using near-term quantum computers for a task
in the domain of computational biology. By constructing quantum models based on
parameterised quantum circuits we perform sequence classification on a task
relevant to the design of therapeutic proteins, and find competitive
performance with classical baselines of similar scale. To study the effect of
noise, we run some of the best-performing quantum models with favourable
resource requirements on emulators of state-of-the-art noisy quantum
processors. We then apply error mitigation methods to improve the signal. We
further execute these quantum models on the Quantinuum H1-1 trapped-ion quantum
processor and observe very close agreement with noiseless exact simulation.
Finally, we perform feature attribution methods and find that the quantum
models indeed identify sensible relationships, at least as well as the
classical baselines. This work constitutes the first proof-of-concept
application of near-term quantum computing to a task critical to the design of
therapeutic proteins, opening the route toward larger-scale applications in
this and related fields, in line with the hardware development roadmaps of
near-term quantum technologies.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers.
Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
arXiv Detail & Related papers (2024-06-17T14:10:10Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - On-the-fly Tailoring towards a Rational Ansatz Design for Digital
Quantum Simulations [0.0]
It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices.
We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz.
The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
arXiv Detail & Related papers (2023-02-07T11:22:01Z) - Near-Term Quantum Computing Techniques: Variational Quantum Algorithms,
Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation [5.381727213688375]
We are still a long way from reaching the maturity of a full-fledged quantum computer.
An outstanding challenge is to come up with an application that can reliably carry out a nontrivial task.
Several near-term quantum computing techniques have been proposed to characterize and mitigate errors.
arXiv Detail & Related papers (2022-11-16T07:53:15Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Machine learning applications for noisy intermediate-scale quantum
computers [0.0]
We develop and study three quantum machine learning applications suitable for NISQ computers.
These algorithms are variational in nature and use parameterised quantum circuits (PQCs) as the underlying quantum machine learning model.
We propose a variational algorithm in the area of approximate quantum cloning, where the data becomes quantum in nature.
arXiv Detail & Related papers (2022-05-19T09:26:57Z) - Quantum Robustness Verification: A Hybrid Quantum-Classical Neural
Network Certification Algorithm [1.439946676159516]
In this work, we investigate the verification of ReLU networks, which involves solving a robustness many-variable mixed-integer programs (MIPs)
To alleviate this issue, we propose to use QC for neural network verification and introduce a hybrid quantum procedure to compute provable certificates.
We show that, in a simulated environment, our certificate is sound, and provide bounds on the minimum number of qubits necessary to approximate the problem.
arXiv Detail & Related papers (2022-05-02T13:23:56Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits
at Exascale [57.84751206630535]
We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework.
The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators.
By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
arXiv Detail & Related papers (2021-04-21T13:26:42Z)
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.