{"id":21089,"date":"2023-05-17T05:09:18","date_gmt":"2023-05-17T04:09:18","guid":{"rendered":"https:\/\/www.oezratty.net\/wordpress\/?p=21089"},"modified":"2023-05-17T05:09:18","modified_gmt":"2023-05-17T04:09:18","slug":"where-are-we-heading-with-nisq","status":"publish","type":"post","link":"https:\/\/www.oezratty.net\/wordpress\/2023\/where-are-we-heading-with-nisq\/","title":{"rendered":"Where are we heading with NISQ?"},"content":{"rendered":"

I’m continuing a series of broad review papers on quantum computing after\u00a0Disentangling quantum emulation and quantum simulation<\/a> in January 2023, Is there a Moore’s law for quantum computing?<\/a> in March 2023 and Perspective on superconducting qubit quantum computing<\/a> published in EPJA in April 2023.<\/p>\n

This time, I evaluate the state of the art of noisy intermediate scale quantum computers (NISQ) and what can be done with it or not, and how it can improve in the near future. I lay out some inconvenient truths: NISQ is not at all ready for prime time quantum computing despite all the fuss about “quantum computing being business ready”. Not only have we not yet reached any quantum computing advantage, but in many cases, even if it worked, the most common NISQ algorithms using a variational approach, have prohibitively long execution times particularly in the promising chemical simulations domain. Most documented gate-based NISQ algorithms use cases run with fewer than 20 qubits that can be emulated faster on a regular laptop costing less than $2K and even provide better results since they emulate perfect non noisy qubits. Also, there are significant inconsistencies between the criteria to reach some quantum advantage (>50 qubits, some computing depth) and the fidelities of the required physical qubits.<\/p>\n

There is still hope to extract some value from NISQ quantum computers, mostly with analog quantum computers and with various other techniques related to the improvement of gate-based NISQ quantum computers, but probably within a rather narrow window, corresponding to the 100×100 (# qubits x computing depth) challenge proposed by IBM for its future Heron 133 qubits QPU.<\/p>\n

You can download this paper on arXiv<\/a>.<\/p>\n

\"\"<\/a><\/p>\n

If you are interested by the advent of FTQC (scalable fault-tolerant quantum computing), my recent arXiv<\/a> on Moore’s law in quantum computing is a good starter.<\/p>\n

Thanks a lot to Alain Chanc\u00e9 (Molket), Vincent Elfving (Pasqal), Marco Fellous-Asiani (Centre of New Technologies University of Warsaw), Lo\u00efc Henriet (Pasqal), Michel Kurek (Multiverse), Jean-Baptiste Latre (Qualitative Computing), Joseph Mikael (EDF), St\u00e9phane Requena (HQI\/GENCI), Jean Senellart (Quandela), Simone Severini (AWS), Robert Whitney (CNRS LPMMC, QEI), Xavier Waintal (CEA IRIG) and Raja Yehia (ICFO) for their feedback on the paper, which doesn\u2019t mean an endorsement of all its content.<\/p>\n

I also recognize useful discussions with and insights from Alexia Auff\u00e8ves (CNRS MajuLab, CQT, QEI), Cyrille Allouche (Atos\/Eviden), Thomas Ayral (Atos\/Eviden), Jerry Chow (IBM), Jay Gambetta (IBM), John Preskill (Caltech), and Pierre Perrot (Eureptech).<\/a><\/p>\n

I wrote this paper from February to May 2023 and I am ready to correct errors and complement it for a subsequent release!<\/p>\n","protected":false},"excerpt":{"rendered":"

I’m continuing a series of broad review papers on quantum computing after\u00a0Disentangling quantum emulation and quantum simulation in January 2023, Is there a Moore’s law for quantum computing? in March 2023 and Perspective on superconducting qubit quantum computing published in EPJA in April 2023. This time, I evaluate the state of the art of noisy […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3057],"tags":[3346,3781,3734,1088,3061,3783,3063,3784,3236,3779,867,3406,3260,3780,3421,3782,3777,3778],"class_list":["post-21089","post","type-post","status-publish","format-standard","hentry","category-quantique","tag-alicebob","tag-fidelities","tag-ftqc","tag-ibm","tag-john-preskill","tag-kipu-quantum","tag-nisq","tag-parityqc","tag-pasqal","tag-qaoa","tag-qml","tag-quantum-algorithms","tag-quantum-computing","tag-qubo","tag-quera","tag-scalability","tag-vqa","tag-vqe"],"views":32123,"_links":{"self":[{"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/posts\/21089","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/comments?post=21089"}],"version-history":[{"count":0,"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/posts\/21089\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/media?parent=21089"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/categories?post=21089"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.oezratty.net\/wordpress\/wp-json\/wp\/v2\/tags?post=21089"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}