Open Access
- 15 June 2026
- journal article
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (2)
Abstract
This perspective outlines promising pathways and critical obstacles on the road to developing useful quantum computing applications, drawing on insights from the Google Quantum AI team. We propose a five-stage framework for this process, spanning from theoretical explorations of quantum advantage to the practicalities of compilation and resource estimation. For each stage, we discuss key trends, milestones, and inherent scientific and sociological impediments. We argue that two central stages—identifying concrete problem instances expected to exhibit quantum advantage, and connecting such problems to real-world use cases—represent essential and currently under-resourced challenges. Throughout, we touch upon related topics, including the promise of generative artificial intelligence for aspects of this research, criteria for compelling demonstrations of quantum advantage, and the future of compilation as we enter the era of early fault-tolerant quantum computing.Keywords
All Related Versions
This publication has 139 references indexed in Scilit:
- Trotter Simulation of Vibrational Hamiltonians on a Quantum ComputerJournal of Chemical Theory and Computation, 2025
- Reducing the Number of Qubits in Quantum Factoring2025
- Reducing the Runtime of Fault-Tolerant Quantum Simulations in Chemistry through Symmetry-Compressed Double FactorizationJournal of Chemical Theory and Computation, 2024
- Distributed Multi-GPU Ab Initio Density Matrix Renormalization Group Algorithm with Applications to the P-Cluster of NitrogenaseJournal of Chemical Theory and Computation, 2024
- Effective quantum volume, fidelity and computational cost of noisy quantum processing experimentsFuture Generation Computer Systems, 2023
- Machine Learning Force FieldsChemical Reviews, 2021
- Quantum algorithms for topological and geometric analysis of dataNature Communications, 2016
- Classical and Quantum Algorithms for Exponential CongruencesLecture Notes in Computer Science, 2008
- Efficient Quantum Algorithms for Simulating Sparse HamiltoniansCommunications in Mathematical Physics, 2006
- Quantum computation of zeta functions of curvescomputational complexity, 2006