close
The Wayback Machine - https://web.archive.org/web/20250626214922/https://dl.acm.org/doi/10.1145/3723153
skip to main content
editorial
Free access

Beyond NISQ: The Megaquop Machine

Published: 29 April 2025 Publication History

Abstract

Today’s Noisy Intermediate-Scale Quantum (NISQ) computers have scientific value, but quantum machines with broad practical value must be protected against noise using quantum error correction and fault-tolerant protocols. Recent studies of quantum error correction on actual hardware are opening a new era of quantum information processing. Error-corrected computers capable of performing one million quantum operations or more may be realized soon, raising a compelling question for the quantum community: What are the potential uses of these megaquop machines?

1 NISQ and Beyond

Quantum technology is in the NISQ era [24]. NISQ, meaning Noisy Intermediate-Scale Quantum, is a deliberately vague term. It has no precise quantitative meaning but is intended to convey an idea: We now have quantum machines such that brute-force simulation of what the quantum machine does is well beyond the reach of our most powerful existing conventional computers [22]. However, these quantum machines are not error-corrected, and noise severely limits their computational power.
NISQ technology already has noteworthy scientific value. But there is no proposed application of NISQ computing with commercial value for which quantum advantage has been demonstrated when compared to the best classical hardware running the best algorithms for solving the same problems. Nor are there persuasive theoretical arguments indicating that commercially viable applications will be found that do not use quantum error-correcting codes and fault-tolerant quantum computing. That poses a daunting challenge for quantum science and the quantum industry.
In the future, we can envision FASQ1 machines, Fault-Tolerant Application-Scale Quantum computers that can run a wide variety of useful applications, but that is still a rather distant goal. What term captures the path along the road from NISQ to FASQ? Various terms retaining the ISQ format of NISQ have been proposed [6, 7, 29], but I would prefer to leave ISQ behind as we move forward, so I will speak instead of a megaquop or gigaquop machine and so on, meaning one capable of executing a million or a billion quantum operations, with the understanding that mega means not precisely a million but somewhere in the vicinity of a million.
Naively, a megaquop machine would have an error rate per logical gate of order \(10^{-6}\), which we do not expect to achieve anytime soon without using error correction and fault-tolerant operation. Or maybe the logical error rate could be somewhat larger, as we expect to be able to boost the simulable circuit volume using various error mitigation techniques in the megaquop era just as we do in the NISQ era [18]. Importantly, the megaquop machine would be capable of achieving some tasks beyond the reach of classical, NISQ, or analog quantum devices, for example, by executing circuits with of order 100 logical qubits and circuit depth of order 10,000.
What resources are needed to operate it? That depends on many things, but a rough guess is that tens of thousands of high-quality physical qubits could suffice. When will we have it? I do not know, but if it happens in just a few years, a likely modality is Rydberg atoms in optical tweezers, assuming they continue to advance in both scale and performance.
What will we do with it? I do not know, but as a scientist I expect we can learn valuable lessons by simulating the dynamics of many-qubit systems on megaquop machines. Will there be applications that are commercially viable as well as scientifically instructive? That I cannot promise you.

2 The Road to Fault Tolerance

To proceed along the road to fault tolerance, what must we achieve? We would like to see many successive rounds of accurate error syndrome measurement such that when the syndromes are decoded the error rate per measurement cycle drops sharply as the code increases in size. Furthermore, we want to decode rapidly, as will be needed to execute universal gates on protected quantum information. Indeed, we will want the logical gates to have much higher fidelity than physical gates and for the logical gate fidelities to improve sharply as codes increase in size. We want to do all this at an acceptable overhead cost in both the number of physical qubits and the number of physical gates. And speed matters—the time on the wall clock for executing a logical gate should be as short as possible.
A snapshot of the state-of-the-art comes from the Google Quantum AI team [1]. Their recently introduced Willow superconducting processor has improved transmon lifetimes, measurement errors, and leakage correction compared to its predecessor Sycamore [2]. With it they can perform millions of rounds of surface-code error syndrome measurement with good stability, each round lasting about a microsecond. Most notably, they find that the logical error rate per measurement round improves by a factor of 2 (a factor they call \(\Lambda\)) when the code distance increases from 3 to 5 and again from 5 to 7, indicating that further improvements should be achievable by scaling the device further. They performed accurate real-time decoding for the distance 3 and 5 codes. To further explore the performance of the device, they also studied the repetition code, which corrects only bit flips, out to a much larger code distance. As the hardware continues to advance we, hope to see larger values of \(\Lambda\) for the surface code, larger codes achieving much lower error rates, and eventually not just quantum memory but also logical two-qubit gates with much-improved fidelity compared to the fidelity of physical gates.
A nagging concern has been the potential vulnerability of superconducting quantum processors to ionizing radiation such as cosmic ray muons. In these events, errors occur in many qubits at once, too many errors for the error-correcting code to fend off. To mitigate this issue, one might want to operate a superconducting processor deep underground to suppress the muon flux, or to use less efficient codes [23] that protect against such error bursts.
The good news is that the Google team has demonstrated that so-called gap engineering of the qubits can reduce the frequency of such error bursts by orders of magnitude [21]. In their studies of the repetition code they found that, in the gap-engineered Willow processor, error bursts occurred about once per hour, as opposed to once every 10 seconds in their earlier hardware. Whether suppression of error bursts via gap engineering will suffice for running deep quantum circuits in the future is not certain, but this progress is encouraging. And, by the way, the origin of the error bursts seen every hour or so is not yet clearly understood, which reminds us that not only in superconducting processors but in other modalities as well, we are likely to encounter mysterious and highly deleterious rare events that will need to be understood and mitigated.

3 Real-time Decoding

Fast real-time decoding of error syndromes is important, because when performing universal error-corrected computation, we must frequently measure encoded blocks and then perform subsequent operations conditioned on the measurement outcomes. If it takes too long to decode the measurement outcomes, then that will slow down the logical clock speed. Decoding speed may be a more serious problem for superconducting circuits than for other hardware modalities where gates can be orders of magnitude slower.
For distance 5, Google achieves a latency, meaning the time from when data from the final round of syndrome measurement is received by the decoder until the decoder returns its result, of about 63 microseconds, on average. In addition, it takes about another 10 microseconds for the data to be transmitted via Ethernet from the measurement device to the decoding workstation. That is not bad, but considering that each round of syndrome measurement takes only a microsecond, faster would be preferable, and the decoding task becomes harder as the code grows in size.
Riverlane and Rigetti have demonstrated in small experiments that the decoding latency can be reduced by running the decoding algorithm on FPGAs rather than CPUs and by integrating the decoder into the control stack to reduce communication time [13]. Adopting such methods may become increasingly important as we scale further. Google DeepMind has shown that a decoder trained by reinforcement learning can achieve a lower logical error rate than a decoder constructed by humans [8], but it is unclear whether that will work at scale, because the cost of training rises steeply with code distance. Also, the Harvard/QuEra team has emphasized that performing correlated decoding across multiple code blocks can reduce the depth of fault-tolerant constructions [30], but this also increases the complexity of decoding, raising concern about whether such a scheme will be scalable.

4 Trading Simplicity for Performance

The Google processors use transmon qubits, as do superconducting processors from IBM and various other companies and research groups. Transmons are the simplest superconducting qubits, and their quality has improved steadily; we can expect further improvement with advances in materials and fabrication. But a logical qubit with very low error rate surely will be a complicated object due to the hefty overhead cost of quantum error correction. Perhaps it is worthwhile to fashion a more complicated physical qubit if the resulting gain in performance might actually simplify the operation of a fault-tolerant quantum computer in the megaquop regime or well beyond. Several versions of this strategy are being pursued.
One approach uses cat qubits, in which the encoded 0 and 1 are coherent states of a microwave resonator, well separated in phase space, such that the noise afflicting the qubit is highly biased. Bit flips are exponentially suppressed as the mean photon number of the resonator increases, while the error rate for phase flips induced by loss from the resonator increases only linearly with the photon number. The AWS team, using their recently announced Ocelot quantum chip, built a repetition code to correct phase errors for cat qubits that are passively protected against bit flips and showed that increasing the distance of the repetition code from 3 to 5 slightly improves the logical error rate [25] (see also Reference [26]).
Another helpful insight is that error correction can be more effective if we know when and where the errors occur in a quantum circuit. We can apply this idea using a dual-rail encoding of the qubits. With two microwave resonators, for example, we can encode a qubit by placing a single photon in either the first resonator (the 10) state or the second resonator (the 01 state). The dominant error is loss of a photon, causing either the 01 or 10 state to decay to 00. One can check whether the state is 00, detecting whether the error occurred without disturbing a coherent superposition of 01 and 10. In a device built by the Yale/QCI team, loss errors are detected over 99% of the time, and all undetected errors are relatively rare [14]. Similar results were reported by the AWS team, encoding a dual-rail qubit in a pair of transmons instead of resonators [20].
Another idea is encoding a finite-dimensional quantum system in a state of a resonator that is highly squeezed in two complementary quadratures, a so-called GKP encoding. This year the Yale group used this scheme to encode 3-dimensional and 4-dimensional systems with decay rate better by a factor of 1.8 than the rate of photon loss from the resonator [12] (see also Reference [19]).
A fluxonium qubit is more complicated than a transmon in that it requires a large inductance that is achieved with an array of Josephson junctions, but it has the advantage of larger anharmonicity, which has enabled two-qubit gates with better than three 9s of fidelity, as the MIT team has shown [16].
A theoretically compelling idea is to fashion an intrinsically robust qubit based on Majorana zero modes in superconducting nanowires. This scheme, tenaciously pursued by Microsoft, requires sophisticated fabrication and has progressed slowly so far. Their recently announced Majorana 1 processor incorporates fermion-parity readout circuitry which might pave the way for the first convincing demonstration of a topologically protected qubit [3].
Whether such trading of simplicity for performance in quantum devices will ultimately be advantageous for scaling to large systems is still unclear. But it is appropriate to explore such alternatives that might pay off in the long run.

5 Error Correction with Atomic Qubits

We have also seen recent progress on error correction with atomic qubits, both in ion traps and optical tweezer arrays. In these platforms qubits are movable, making it possible to apply two-qubit gates to any pair of qubits in the device. This opens the opportunity to use more efficient coding schemes, and in fact logical circuits are now being executed on these platforms. The Harvard/MIT/QuEra team sampled circuits with 48 logical qubits on a 280-qubit device [10]. Atom computing and Microsoft ran an algorithm with 28 logical qubits on a 256-qubit device [28]. Quantinuum and Microsoft prepared entangled states of 12 logical qubits on a 56-qubit device [27].
However, so far in these devices it has not been possible to perform more than a few rounds of error syndrome measurement, and the results rely on error detection and postselection. That is, circuit runs are discarded when errors are detected, a scheme that will not scale to large circuits. Efforts to address these drawbacks are in progress. Another concern is that the atomic movement slows the logical cycle time. If all-to-all coupling enabled by atomic movement is to be used in much deeper circuits, it will be important to speed up the movement quite a lot.

6 Toward the Megaquop Machine

How can we reach the megaquop regime? More efficient quantum codes like those recently discovered by the IBM team might help [11]. These require geometrically nonlocal connectivity and are therefore better suited for Rydberg optical tweezer arrays than superconducting processors, at least for now. Error mitigation strategies tailored for logical circuits might help by boosting the circuit volume that can be simulated beyond what one would naively expect based on the logical error rate [4]. Recent advances from the Google team, which reduce the overhead cost of logical gates, might also be helpful [17].
What about applications? Impactful applications to chemistry typically require rather deep circuits, so are likely to be out of reach for a while yet, but applications to materials science provide a more tempting target in the near term. Taking advantage of symmetries and various circuit optimizations like the ones Phasecraft has achieved [15], we might start seeing informative results in the megaquop regime or only slightly beyond.
As a scientist, I am intrigued by what we might conceivably learn about quantum dynamics far from equilibrium by doing simulations on megaquop machines, particularly in two spatial dimensions. But when seeking quantum advantage in that arena, we should bear in mind that classical methods for such simulations are also advancing impressively (see, for example, References [9] and [5]).
To summarize, advances in hardware, control, algorithms, error correction, error mitigation, and so on, are bringing us closer to megaquop machines, raising a compelling question for our community: What are the potential uses for these machines? Progress will require innovation at all levels of the stack. The capabilities of early fault-tolerant quantum processors will guide application development, and our vision of potential applications will guide technological progress. Advances in both basic science and systems engineering are needed. These are still the early days of quantum computing technology, but our experience with megaquop machines will guide the way to gigaquops, teraquops, and beyond and hence to widely impactful quantum utility that benefits the world.

Acknowledgments

This article is based on a keynote address delivered at the Q2B 2024 Conference in Silicon Valley. I thank Matt Johnson for inviting me to speak at Q2B for each of the past eight years, and Travis Humble for encouraging me to publish the talk. I also thank Dorit Aharonov, Jason Alicea, Sergio Boixo, Earl Campbell, Roland Farrell, Ashley Montanaro, Mike Newman, Will Oliver, Chris Pattison, Rob Schoelkopf, and Qian Xu for helpful comments.

Footnote

1
The acronym FASQ was suggested to me by Andrew Landahl.

References

[1]
Rajeev Acharya, Laleh Aghababaie-Beni, Igor Aleiner, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Nikita Astrakhantsev, Juan Atalayaet al.2025. Quantum error correction below the surface code threshold. Nature 638 (2025), 920–926.
[2]
Rajeev Acharya, Igor Aleiner, Richard Allen, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Juan Atalaya, Ryan Babbushet al.2023. Suppressing quantum errors by scaling a surface code logical qubit. Nature 614, 7949 (2023), 676–681.
[3]
Morteza Aghaee, Alejandro Alcaraz Ramirez, Zulfi Alam, Rizwan Ali, Mariusz Andrzejczuk, Andrey Antipov, Mikhail Astafev, Amin Barzegar, Bela Bauer, Jonathan Beckeret al.2025. Interferometric single-shot parity measurement in InAs–Al hybrid devices. Nature 638, 8051 (2025), 651–655.
[4]
Dorit Aharonov, Ori Alberton, Itai Arad, Yosi Atia, Eyal Bairey, Zvika Brakerski, Itsik Cohen, Omri Golan, Ilya Gurwich, Oded Kenneth, Eyal Leviatan, Netanel H. Lindner, Ron Aharon Melcer, Adiel Meyer, Gili Schul, and Maor Shutman. 2025. On the importance of error mitigation for quantum computation. arxiv:quant-ph/2503.17243
[5]
Armando Angrisani, Alexander Schmidhuber, Manuel S. Rudolph, M. Cerezo, Zoë Holmes, and Hsin-Yuan Huang. 2024. Classically estimating observables of noiseless quantum circuits. arxiv:quant-ph/2409.01706
[6]
Juan Miguel Arrazola. 2023. From NISQ to ISQ. Retrieved from https://pennylane.ai/blog/2023/06/from-nisq-to-isq
[7]
Dave Bacon. 2023. Acronyms beyond NISQ. Retrieved from https://dabacon.org/pontiff/2024/01/03/acronyms-beyond-nisq/
[8]
Johannes Bausch, Andrew W. Senior, Francisco J. H. Heras, Thomas Edlich, Alex Davies, Michael Newman, Cody Jones, Kevin Satzinger, Murphy Yuezhen Niu, Sam Blackwellet al.2024. Learning high-accuracy error decoding for quantum processors. Nature 635 (2024), 834–840.
[9]
Tomislav Begušić and Garnet Kin-Lic Chan. 2024. Real-time operator evolution in two and three dimensions via sparse Pauli dynamics. arxiv:quant-ph/2409.03097
[10]
Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim, Sophie H. Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiteret al.2024. Logical quantum processor based on reconfigurable atom arrays. Nature 626, 7997 (2024), 58–65.
[11]
Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J. Yoder. 2024. High-threshold and low-overhead fault-tolerant quantum memory. Nature 627, 8005 (2024), 778–782.
[12]
Benjamin L. Brock, Shraddha Singh, Alec Eickbusch, Volodymyr V. Sivak, Andy Z. Ding, Luigi Frunzio, Steven M. Girvin, and Michel H. Devoret. 2024. Quantum error correction of qudits beyond break-even. arxiv:quant-ph/2409.15065
[13]
Laura Caune, Luka Skoric, Nick S. Blunt, Archibald Ruban, Jimmy McDaniel, Joseph A. Valery, Andrew D. Patterson, Alexander V. Gramolin, Joonas Majaniemi, Kenton M. Barneset al.2024. Demonstrating real-time and low-latency quantum error correction with superconducting qubits. arxiv:quant-ph/2410.05202
[14]
Kevin S. Chou, Tali Shemma, Heather McCarrick, Tzu-Chiao Chien, James D. Teoh, Patrick Winkel, Amos Anderson, Jonathan Chen, Jacob Curtis, Stijn J. de Graafet al.2024. A superconducting dual-rail cavity qubit with erasure-detected logical measurements. Nat. Phys. 20, 9 (2024), 1454–1460.
[15]
Laura Clinton, Toby Cubitt, Brian Flynn, Filippo Maria Gambetta, Joel Klassen, Ashley Montanaro, Stephen Piddock, Raul A. Santos, and Evan Sheridan. 2024. Towards near-term quantum simulation of materials. Nat. Commun. 15 (2024), 211.
[16]
Leon Ding, Max Hays, Youngkyu Sung, Bharath Kannan, Junyoung An, Agustin Di Paolo, Amir H. Karamlou, Thomas M. Hazard, Kate Azar, David K. Kimet al.2023. High-fidelity, frequency-flexible two-qubit fluxonium gates with a transmon coupler. Phys. Rev. X 13, 3 (2023), 031035.
[17]
Craig Gidney, Noah Shutty, and Cody Jones. 2024. Magic state cultivation: Growing T states as cheap as CNOT gates. arxiv:quant-ph/2409.17595
[18]
Youngseok Kim, Andrew Eddins, Sajant Anand, Ken Xuan Wei, Ewout Van Den Berg, Sami Rosenblatt, Hasan Nayfeh, Yantao Wu, Michael Zaletel, Kristan Temmeet al.2023. Evidence for the utility of quantum computing before fault tolerance. Nature 618, 7965 (2023), 500–505.
[19]
Dany Lachance-Quirion, Marc-Antoine Lemonde, Jean Olivier Simoneau, Lucas St-Jean, Pascal Lemieux, Sara Turcotte, Wyatt Wright, Amélie Lacroix, Joëlle Fréchette-Viens, Ross Shillitoet al.2024. Autonomous quantum error correction of Gottesman-Kitaev-Preskill states. Phys. Rev. Lett. 132, 15 (2024), 150607.
[20]
H. Levine, A. Haim, J. S. C. Hung, N. Alidoust, M. Kalaee, L. DeLorenzo, E. A. Wollack, P. Arrangoiz-Arriola, A. Khalajhedayati, R. Sanilet al.2024. Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons. Phys. Rev. X 14, 1 (2024), 011051.
[21]
Matt McEwen, Kevin C. Miao, Juan Atalaya, Alex Bilmes, Alex Crook, Jenna Bovaird, John Mark Kreikebaum, Nicholas Zobrist, Evan Jeffrey, Bicheng Yinget al.2024. Resisting high-energy impact events through gap engineering in superconducting qubit arrays. arxiv:quant-ph/2402.15644
[22]
A. Morvan, B. Villalonga, X. Mi, S. Mandrà, A. Bengtsson, P. V. Klimov, Z. Chen, S. Hong, C. Erickson, I. K. Drozdovet al.2024. Phase transitions in random circuit sampling. Nature 634, 8033 (2024), 328–333.
[23]
Christopher A. Pattison, Anirudh Krishna, and John Preskill. 2023. Hierarchical memories: Simulating quantum LDPC codes with local gates. arxiv:quant-ph/2303.04798
[24]
John Preskill. 2018. Quantum computing in the NISQ era and beyond. Quantum 2 (2018), 79.
[25]
Harald Putterman, Kyungjoo Noh, Connor T. Hann, Gregory S. MacCabe, Shahriar Aghaeimeibodi, Rishi N. Patel, Menyoung Lee, William M. Jones, Hesam Moradinejad, Roberto Rodriguezet al.2025. Hardware-efficient quantum error correction using concatenated bosonic qubits. Nature 638 (2025), 927–934.
[26]
U. Réglade, A. Bocquet, R. Gautier, J. Cohen, A. Marquet, E. Albertinale, N. Pankratova, M. Hallén, F. Rautschke, L.-A. Sellemet al.2024. Quantum control of a cat qubit with bit-flip times exceeding ten seconds. Nature 629, 8013 (2024), 778–783.
[27]
Ben W. Reichardt, David Aasen, Rui Chao, Alex Chernoguzov, Wim van Dam, John P. Gaebler, Dan Gresh, Dominic Lucchetti, Michael Mills, Steven A. Moseset al.2024. Demonstration of quantum computation and error correction with a tesseract code. arxiv:quant-ph/2409.04628
[28]
Ben W. Reichardt, Adam Paetznick, David Aasen, Ivan Basov, Juan M. Bello-Rivas, Parsa Bonderson, Rui Chao, Wim van Dam, Matthew B. Hastings, Andres Pazet al.2024. Logical computation demonstrated with a neutral atom quantum processor. arxiv:quant-ph/2411.11822
[29]
Simone Severini. 2023. Bye NISQ. Hello LISQ? Retrieved from https://www.linkedin.com/pulse/bye-nisq-hello-lisq-simone-severini-ybkmc/
[30]
Hengyun Zhou, Chen Zhao, Madelyn Cain, Dolev Bluvstein, Casey Duckering, Hong-Ye Hu, Sheng-Tao Wang, Aleksander Kubica, and Mikhail D. Lukin. 2024. Algorithmic fault tolerance for fast quantum computing. arxiv:quant-ph/2406.17653

Cited By

View all
  • (2025)An accessible planar charged particle trap for experiential learning in quantum technologiesAmerican Journal of Physics10.1119/5.024338993:7(581-588)Online publication date: 1-Jul-2025
  • (2025)Efficient Magic State Distillation by Zero-Level DistillationPRX Quantum10.1103/thxx-njr66:2Online publication date: 20-Jun-2025

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Quantum Computing
ACM Transactions on Quantum Computing  Volume 6, Issue 3
September 2025
75 pages
EISSN:2643-6817
DOI:10.1145/3697222
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 April 2025
Online AM: 12 March 2025
Accepted: 09 March 2025
Revised: 22 February 2025
Received: 22 February 2025
Published in TQC Volume 6, Issue 3

Check for updates

Author Tags

  1. Quantum computing
  2. quantum error correction
  3. fault-tolerant quantum computing

Qualifiers

  • Editorial

Funding Sources

  • U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Quantum Systems Accelerator, and the National Science Foundation

Contributors

BERJAYA

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)945
  • Downloads (Last 6 weeks)446
Reflects downloads up to 24 Jun 2025

Other Metrics

Citations

Cited By

View all
  • (2025)An accessible planar charged particle trap for experiential learning in quantum technologiesAmerican Journal of Physics10.1119/5.024338993:7(581-588)Online publication date: 1-Jul-2025
  • (2025)Efficient Magic State Distillation by Zero-Level DistillationPRX Quantum10.1103/thxx-njr66:2Online publication date: 20-Jun-2025

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media