Peptide Binding Classification on Quantum Computers
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 30 references that are in the map. First posted on arXiv 27 Nov 2023.
Builds on
7 of 30 references.
References · 7
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
- 2020Captum: A unified and generic model interpretability library for PyTorchcited by 542
- 2019Parameterized quantum circuits as machine learning modelscited by 330
- 2021QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuitscited by 97
- 2021QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computercited by 65
- 2020Grammar-aware sentence classification on quantum computerscited by 16
- 2019On the qubit routing problemcited by 11
Built on by
Citing papers per year: 2024: 2.
2 papers.
- 2024Towards Compositional Interpretability for XAIcited by 10
- 2024Quantum Natural Language Processingcited by 6
- 2024Towards Compositional Interpretability for XAI25 Jun 2024
- 2024Quantum Natural Language Processing28 Mar 2024