CoChat

Gate-based quantum computing for protein design

Open access

The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.

Abstract

Protein design is a technique to engineer proteins by permuting amino acids in the sequence to obtain novel functionalities. However, exploring all possible combinations of amino acids is generally impossible due to the exponential growth of possibilities with the number of designable sites. The present work introduces circuits implementing a pure quantum approach, Grover’s algorithm, to solve protein design problems. Our algorithms can adjust to implement any custom pair-wise energy tables and protein structure models. Moreover, the algorithm’s oracle is designed to consist of only adder functions. Quantum computer simulators validate the practicality of our circuits, containing up to 234 qubits. However, a smaller circuit is implemented on real quantum devices. Our results show that usingO(N)iterations, the circuits find the correct results among all N possibilities, providing the expected quadratic speed up of Grover’s algorithm over classical methods (i.e.,O(N)).

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1371/journal.pcbi.1011033

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig 1 Schematic representation of our circuits. A) Different steps of Grover’s algorithm; B) Different sub-steps implemented in our Oracle. The parallel lines represent qubits. The blue lines show the n qubits and the red lines show the work qubits. In the oracle, if |k〉 is an answer state, f(k) = 1, otherwise it is 0.
Fig 1 Schematic representation of our circuits. A) Different steps of Grover’s algorithm; B) Different sub-steps implemented in our Oracle. The parallel lines represent qubits. The blue lines show the n qubits and the red lines show the work qubits. In the oracle, if |k〉 is an answer state, f(k) = 1, otherwise it is 0.CC BY · PubMed Central
Fig 2 Schematic representations of protein models. SP model with: a) Two designable sites; b) Three designable sites; c) Six designable sites with I) three, II) four, and III) five pair-wise interactions. MR model with: d) Two designable sites; e) Three designable sites. The designable sites are shown as circles with numbers. The red dashed lines represent the interactions among the designable sites. In a–c) the pattern of interactions between the sites are provided for each structure. The checkered circles are non-interacting residues. In this study, there are no geometrical differences between residues, and all are being treated as identical beads represented with circles. In d) and e) the dij⁻¹ is the corresponding distance reciprocal between designable sites i and j.
Fig 2 Schematic representations of protein models. SP model with: a) Two designable sites; b) Three designable sites; c) Six designable sites with I) three, II) four, and III) five pair-wise interactions. MR model with: d) Two designable sites; e) Three designable sites. The designable sites are shown as circles with numbers. The red dashed lines represent the interactions among the designable sites. In a–c) the pattern of interactions between the sites are provided for each structure. The checkered circles are non-interacting residues. In this study, there are no geometrical differences between residues, and all are being treated as identical beads represented with circles. In d) and e) the dij⁻¹ is the corresponding distance reciprocal between designable sites i and j.CC BY · PubMed Central
Fig 3 Energy tables to represent the pair-wise interactions in our systems and the binary representation of residues. Energy tables for: a) The SP model; b) The MR model. c) Binary representation of residues in the energy table. d) Energy table and the residue representations for the HP protein model. In a–c) H1 and H2 represent two types of hydrophobic residues, Pol1 and Pol2 represent two types of polar residues, Pos represents a positive residue, Neg represents a negative residue, and two types of “other” residues that do not fit in any of the previous categories are represented by X1 and X2. Note that all energies in our tables have qualitative values. In d) H represents hydrophobic and P represents polar residues.
Fig 3 Energy tables to represent the pair-wise interactions in our systems and the binary representation of residues. Energy tables for: a) The SP model; b) The MR model. c) Binary representation of residues in the energy table. d) Energy table and the residue representations for the HP protein model. In a–c) H1 and H2 represent two types of hydrophobic residues, Pol1 and Pol2 represent two types of polar residues, Pos represents a positive residue, Neg represents a negative residue, and two types of “other” residues that do not fit in any of the previous categories are represented by X1 and X2. Note that all energies in our tables have qualitative values. In d) H represents hydrophobic and P represents polar residues.CC BY · PubMed Central
Fig 4 Histogram representations of the probability of finding each state (64 in total) in circuits with two designable sites. Results for circuits in the SP model with: a) Eth = -3 and R = 1; b) Eth = -3 and R = Rmax = 4; c) Eth = -2 and R = 1; d) Eth = -2 and R = Rmax = 2. Results for circuits in the MR model with: e) Eth = 95%Emin and R = 1; f) Eth = 95%Emin and R = Rmax = 4; g) Eth = 85%Emin and R = 1; h) Eth = 85%Emin and R = Rmax = 3.
Fig 4 Histogram representations of the probability of finding each state (64 in total) in circuits with two designable sites. Results for circuits in the SP model with: a) Eth = -3 and R = 1; b) Eth = -3 and R = Rmax = 4; c) Eth = -2 and R = 1; d) Eth = -2 and R = Rmax = 2. Results for circuits in the MR model with: e) Eth = 95%Emin and R = 1; f) Eth = 95%Emin and R = Rmax = 4; g) Eth = 85%Emin and R = 1; h) Eth = 85%Emin and R = Rmax = 3.CC BY · PubMed Central
Fig 5 Probability of finding answer states in different systems as a function of normalized number of iterations (R/Rmax). Results for a) The SP model; b) The MR model; The inset in a), represents data for the first few R for systems with six designable sites.
Fig 5 Probability of finding answer states in different systems as a function of normalized number of iterations (R/Rmax). Results for a) The SP model; b) The MR model; The inset in a), represents data for the first few R for systems with six designable sites.CC BY · PubMed Central
Fig 6 The maximum number of iterations (Rmax) values as a function of normalized number of states (N/M). The circles represent the data for the SP model and the stars are the data for the MR model. The magenta dashed line shows the Rmax threshold for Grover’s algorithm, while the black dashed line is the threshold of the classic realm.
Fig 6 The maximum number of iterations (Rmax) values as a function of normalized number of states (N/M). The circles represent the data for the SP model and the stars are the data for the MR model. The magenta dashed line shows the Rmax threshold for Grover’s algorithm, while the black dashed line is the threshold of the classic realm.CC BY · PubMed Central
Fig 7 Histogram representations of probabilities for each state in the IBM-SP model circuit. a) Results of the circuit, using the ideal MPS quantum computer simulator. b) Results of the circuit using: I) gate fidelity, measurement fidelity, initialization fidelity and qubit mapping of ibmq_toronto in the simulator; II) Real ibm_toronto device averaged over 20 different runs. c) Results of the circuit using: I) gate fidelity, measurement fidelity, initialization fidelity and qubit mapping of ibmq_montreal in the simulator; II) Real ibm_montreal device averaged over 30 different runs. In b) and c), the data bars with different colours show results for five separate runs. The error bars represent the standard deviation from the mean value. The numbers on each set of bars show the average probability of the state. The number of samplings for all plots is set to 8,192 shots.
Fig 7 Histogram representations of probabilities for each state in the IBM-SP model circuit. a) Results of the circuit, using the ideal MPS quantum computer simulator. b) Results of the circuit using: I) gate fidelity, measurement fidelity, initialization fidelity and qubit mapping of ibmq_toronto in the simulator; II) Real ibm_toronto device averaged over 20 different runs. c) Results of the circuit using: I) gate fidelity, measurement fidelity, initialization fidelity and qubit mapping of ibmq_montreal in the simulator; II) Real ibm_montreal device averaged over 30 different runs. In b) and c), the data bars with different colours show results for five separate runs. The error bars represent the standard deviation from the mean value. The numbers on each set of bars show the average probability of the state. The number of samplings for all plots is set to 8,192 shots.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 38 references

Research works printed but not linked: 2

  1. T Babej, 2018, others. Coarse-grained lattice protein folding on a quantum annealer., arXiv preprint arXiv:181100713.
  2. M Fingerhuth, 2018, others. A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding, arXiv preprint arXiv:181013411.

Cited by

See all 26

Metadata

Authors
Khatami, M. H., Mendes, U. C., Wiebe, N., & Kim, P. M.
Affiliations
  • University of Toronto (CA)
  • CMC Microsystems (Canada) (CA)
  • Pacific Northwest National Laboratory (US)
Corresponding author
Kim, Philip M.
Venue
PLOS Computational Biology
Published
2023-04-12
Volume
19
Issue
4
Pages
e1011033
ISSN
  • 1553-734X (ISSN-L)
  • 1553-7358
OpenAlex
W4365135628
Cited by
26
References
36
Citations by year
2026: 2 · 2025: 7 · 2024: 11 · 2023: 3
FWCI
2.17
Type
journal article
Language
en
Open access
Locations
  • PLoS Computational Biology (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
Canadian Institutes of Health Research (PJT-159750)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
Keywords
protein design, Grover's algorithm, quantum computing, quantum circuits, combinatorial search, quadratic speedup
MeSH terms
Algorithms, Amino Acids, Computing Methodologies, Engineering, Quantum Theory

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Gate-based quantum computing for protein design. https://app.cochat.ai/papers/10.1371/journal.pcbi.1011033
The paper
Khatami, M. H., Mendes, U. C., Wiebe, N., & Kim, P. M. (2023). Gate-based quantum computing for protein design. PLOS Computational Biology. https://doi.org/10.1371/journal.pcbi.1011033

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.