Introducing the Quantum Economic Advantage Online Calculator
Authors:
- Frederick MejiaFMFrederick Mejia
- Hans GundlachHGHans Gundlach
- Jayson LynchJLJayson Lynch
- Carl DukatzCDCarl Dukatz
- Andrew LucasALAndrew Lucas
- Eleanor CraneECEleanor Crane
- Prashant ShuklaPSPrashant Shukla
- Neil ThompsonNTNeil Thompson
Preprint
Abstract
Developing a systematic view of where quantum computers will outperform classical ones is important for researchers, policy makers and business leaders. But developing such a view is challenging because quantum advantage analyses depend not only on algorithm properties, but also on a host of technical characteristics (error correction, gate speeds, etc.). Because various analyses make different assumptions about these technical characteristics, it can be challenging to make comparisons across them. In this paper, we introduce an open-access web-tool designed to make such comparisons easy. Built on the framework introduced by Choi, Moses, and Thompson (2023), it calculates when quantum systems will outperform classical computers for a given algorithmic problem. These estimates can be easily updated based on various assumptions for error correction, overhead, and connectivity. Different hardware roadmaps can also be used and algorithm running times can be customized to particular applications. It can currently be accessed at https://futuretech.mit.edu/quantum-economic-advantage-calculator. This integrated prediction tool also allows us to explore which technical factors are most important for quantum ``economic" advantage (outperforming on a cost-equivalent basis). Overall, we find that for some algorithms (e.g. Shor's) the timing of advantage is quite robust, whereas for others (e.g. Grover's) it is contingent, with numerous technical characteristics substantially impacting these dates. In the paper, we discuss both why this occurs and what we can learn from it.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Quantum Advantage in Computational Chemistry?2025
- An Efficient Quantum Factoring AlgorithmJournal of the ACM, 2025
- Quantum Algorithms and Simulation for Parallel and Distributed Quantum Computing2021
- Focus beyond Quadratic Speedups for Error-Corrected Quantum AdvantagePRX Quantum, 2021
- On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivityQuantum Information & Computation, 2020
- Impact of qubit connectivity on quantum algorithm performanceQuantum Science and Technology, 2020
- Quantum supremacy using a programmable superconducting processorNature, 2019
- Quantum Random Access MemoryPhysical Review Letters, 2008
- Cramming More Components Onto Integrated CircuitsProceedings of the IEEE, 1998
- Efficient networks for quantum factoringPhysical Review A, 1996