IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0249850.html
   My bibliography  Save this article

QuASeR: Quantum Accelerated de novo DNA sequence reconstruction

Author

Listed:
  • Aritra Sarkar
  • Zaid Al-Ars
  • Koen Bertels

Abstract

In this article, we present QuASeR, a reference-free DNA sequence reconstruction implementation via de novo assembly on both gate-based and quantum annealing platforms. This is the first time this important application in bioinformatics is modeled using quantum computation. Each one of the four steps of the implementation (TSP, QUBO, Hamiltonians and QAOA) is explained with a proof-of-concept example to target both the genomics research community and quantum application developers in a self-contained manner. The implementation and results on executing the algorithm from a set of DNA reads to a reconstructed sequence, on a gate-based quantum simulator, the D-Wave quantum annealing simulator and hardware are detailed. We also highlight the limitations of current classical simulation and available quantum hardware systems. The implementation is open-source and can be found on https://github.com/QE-Lab/QuASeR.

Suggested Citation

  • Aritra Sarkar & Zaid Al-Ars & Koen Bertels, 2021. "QuASeR: Quantum Accelerated de novo DNA sequence reconstruction," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-23, April.
    • Handle: RePEc:plo:pone00:0249850
    DOI: 10.1371/journal.pone.0249850
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0249850
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0249850&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0249850?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    2. Jarrod R. McClean & Sergio Boixo & Vadim N. Smelyanskiy & Ryan Babbush & Hartmut Neven, 2018. "Barren plateaus in quantum neural network training landscapes," Nature Communications, Nature, vol. 9(1), pages 1-6, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ajagekar, Akshay & You, Fengqi, 2022. "Quantum computing and quantum artificial intelligence for renewable and sustainable energy: A emerging prospect towards climate neutrality," Renewable and Sustainable Energy Reviews, Elsevier, vol. 165(C).
    2. Byron Tasseff & Tameem Albash & Zachary Morrell & Marc Vuffray & Andrey Y. Lokhov & Sidhant Misra & Carleton Coffrin, 2024. "On the emerging potential of quantum annealing hardware for combinatorial optimization," Journal of Heuristics, Springer, vol. 30(5), pages 325-358, December.
    3. Takayuki Sakuma, 2020. "Application of deep quantum neural networks to finance," Papers 2011.07319, arXiv.org, revised May 2022.
    4. Singh, Nongmeikapam Brajabidhu & Roy, Arnab & Saha, Anish Kumar, 2024. "Max-flow min-cut theorem in quantum computing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 649(C).
    5. Aufenanger, Tobias, 2018. "Treatment allocation for linear models," FAU Discussion Papers in Economics 14/2017, Friedrich-Alexander University Erlangen-Nuremberg, Institute for Economics, revised 2018.
    6. Michele Samorani & Yang Wang & Yang Wang & Zhipeng Lv & Fred Glover, 2019. "Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem," Journal of Heuristics, Springer, vol. 25(4), pages 629-642, October.
    7. Elies Gil-Fuster & Jens Eisert & Carlos Bravo-Prieto, 2024. "Understanding quantum machine learning also requires rethinking generalization," Nature Communications, Nature, vol. 15(1), pages 1-12, December.
    8. Bahram Alidaee & Haibo Wang, 2017. "A note on heuristic approach based on UBQP formulation of the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 102-110, January.
    9. Iris Cong & Nishad Maskara & Minh C. Tran & Hannes Pichler & Giulia Semeghini & Susanne F. Yelin & Soonwon Choi & Mikhail D. Lukin, 2024. "Enhancing detection of topological order by local error correction," Nature Communications, Nature, vol. 15(1), pages 1-14, December.
    10. Fred Glover & Jin-Kao Hao, 2016. "f-Flip strategies for unconstrained binary quadratic programming," Annals of Operations Research, Springer, vol. 238(1), pages 651-657, March.
    11. Yang Wang & Jin-Kao Hao & Fred Glover & Zhipeng Lü & Qinghua Wu, 2016. "Solving the maximum vertex weight clique problem via binary quadratic programming," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 531-549, August.
    12. Fangjun Hu & Saeed A. Khan & Nicholas T. Bronn & Gerasimos Angelatos & Graham E. Rowlands & Guilhem J. Ribeill & Hakan E. Türeci, 2024. "Overcoming the coherence time barrier in quantum machine learning on temporal data," Nature Communications, Nature, vol. 15(1), pages 1-12, December.
    13. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
    14. Eric R. Anschuetz & Bobak T. Kiani, 2022. "Quantum variational algorithms are swamped with traps," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    15. Alen Senanian & Sridhar Prabhu & Vladimir Kremenetski & Saswata Roy & Yingkang Cao & Jeremy Kline & Tatsuhiro Onodera & Logan G. Wright & Xiaodi Wu & Valla Fatemi & Peter L. McMahon, 2024. "Microwave signal processing using an analog quantum reservoir computer," Nature Communications, Nature, vol. 15(1), pages 1-9, December.
    16. Enrico Fontana & Dylan Herman & Shouvanik Chakrabarti & Niraj Kumar & Romina Yalovetzky & Jamie Heredge & Shree Hari Sureshbabu & Marco Pistoia, 2024. "Characterizing barren plateaus in quantum ansätze with the adjoint representation," Nature Communications, Nature, vol. 15(1), pages 1-12, December.
    17. Matthias C. Caro & Hsin-Yuan Huang & M. Cerezo & Kunal Sharma & Andrew Sornborger & Lukasz Cincio & Patrick J. Coles, 2022. "Generalization in quantum machine learning from few training data," Nature Communications, Nature, vol. 13(1), pages 1-11, December.
    18. He, Zhimin & Deng, Maijie & Zheng, Shenggen & Li, Lvzhou & Situ, Haozhen, 2023. "GSQAS: Graph Self-supervised Quantum Architecture Search," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).
    19. Zhao, Xiumei & Li, Yongmei & Li, Jing & Wang, Shasha & Wang, Song & Qin, Sujuan & Gao, Fei, 2024. "Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 648(C).
    20. Sofiene Jerbi & Lukas J. Fiderer & Hendrik Poulsen Nautrup & Jonas M. Kübler & Hans J. Briegel & Vedran Dunjko, 2023. "Quantum machine learning beyond kernel methods," Nature Communications, Nature, vol. 14(1), pages 1-8, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0249850. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.