The expected emergence of cryptographically relevant quantum computers (CRQCs) will represent a singular discontinuity in the history of digital security, with wide ranging impacts. This Perspective seeks to elucidate specific implications that the capabilities of developing quantum architectures have on blockchain vulnerabilities and potential mitigation strategies. First, we provide new resource estimates for breaking the 256-bit Elliptic Curve Discrete Logarithm Problem over the secp256k1 curve, the core of modern blockchain cryptography. We demonstrate that Shor’s algorithm for this problem can execute with either $\le 1200$ logical qubits and $\le 90\mathrm{million}$ Toffoli gates or $\le 1450$ logical qubits and $\le 70\mathrm{million}$ Toffoli gates. In the interest of responsible disclosure, we use a zero-knowledge proof to validate these results without disclosing attack vectors. On superconducting architectures with ${10}^{-3}$ physical error rates and planar connectivity, those circuits can execute in minutes using fewer than half a million physical qubits. We introduce a critical distinction between “fast-clock” (such as superconducting and photonic) and “slow-clock” (such as neutral atom and ion trap) architectures. Our analysis reveals that the first fast-clock CRQCs would enable “on-spend” attacks on public mempool transactions of some cryptocurrencies. We survey major cryptocurrency vulnerabilities through this lens, identifying systemic risks associated with advanced features in some blockchains such as smart contracts, proof-of-stake consensus, and data availability sampling mechanism, as well as the enduring concern of “abandoned” assets. We argue that technical solutions would benefit from accompanying public policy and discuss various frameworks of “digital salvage” to regulate the recovery or destruction of dormant assets while preventing adversarial seizure. We also discuss implications for other digital assets and tokenization as well as challenges and successful examples of the ongoing transition to post-quantum cryptography (PQC). Finally, we urge all vulnerable cryptocurrency communities to join the migration to PQC without delay.

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.

Chiral quantum optics is a growing field of research in which light-matter interactions become asymmetrically dependent on momentum and spin, offering novel control over photonic and electronic degrees of freedom. Recently, the platforms for investigating chiral light-matter interactions have expanded from laser-cooled atoms and quantum dots to various solid-state systems, such as microcavity polaritons and two-dimensional layered materials, integrated into photonic structures such as waveguides, cavities, and ring resonators. In this Perspective, we begin by establishing the foundation for understanding and engineering these chiral light-matter regimes. We review the cutting-edge platforms that have enabled their successful realization in recent years, focusing on solid-state platforms, and discuss the most relevant experimental challenges to fully harness their potential. Finally, we explore the vast opportunities that these chiral light-matter interfaces present, particularly their ability to reveal exotic quantum many-body phenomena, such as chiral many-body superradiance and fractional quantum Hall physics.

Among all the inventions that quantum physics has produced, the laser holds a particularly important place, both for the rich story of successive discoveries that led to its birth, and for the role it has played in fundamental and applied research. I recall here the lineage of theoretical discoveries and experiments that have marked this history, restricting myself to the contribution of lasers to blue sky science and leaving apart its well-known role in various domains of technology. This story started from advances in the old quantum theory, from Einstein’s theoretical description of stimulated emission to O. Stern’s experimental discovery of the spatial quantization of the electron spin. Nuclear magnetic resonance, atomic clocks, optical pumping, and masers followed and the pace of discoveries accelerated with the appearance of the laser in 1960. This extraordinary light source has since enabled breakthroughs in fundamental physics and opened up fields of research that could not even have been imagined at the time of its birth. I was fortunate to begin my career in physics at this crossroad of atomic physics and optics. I give in this article my personal view of the great adventures in fundamental research in which I participated as an actor or spectator, from the cooling and trapping of atoms by light, to the physics of quantum gases of bosons and fermions, the manipulation of individual quantum particles and quantum simulations. Many other areas of fundamental physics, which I will only mention briefly, owe their development to lasers and further advances are still to be expected in the years to come.

Neutral atoms are among the leading platforms toward realizing fault-tolerant quantum computation (FTQC). However, scaling up a single neutral-atom device beyond ${10}^4$ atoms to meet the demands of FTQC for practical applications remains a challenge. To overcome this challenge, we clarify the criteria and technological requirements for further scaling based on multiple neutral atom quantum processing units (QPUs) connected through photonic networking links. Our quantitative analysis shows that nanofiber optical cavities have the potential as an efficient atom-photon interface to enable fast entanglement generation between atoms in distinct neutral-atom modules, allowing multiple neutral-atom QPUs to operate cooperatively without sacrificing computational speed. Using state-of-the-art millimeter-scale nanofiber cavities with the finesse of thousands, over a hundred atoms can be coupled to the cavity mode with an optical tweezer array, with expected single-atom cooperativity exceeding 100 for telecom-band transition of ytterbium atoms. This enables efficient time-multiplexed entanglement generation with a predicted Bell-pair generation rate of ${10}^5{\mathrm{s}}^{-1}$ while maintaining a small footprint for channel multiplexing. These proposals and results indicate a promising pathway for building large-scale multiprocessor fault-tolerant quantum computers using neutral atoms, nanofiber optical cavities, and fiber-optic networks.

Majorana bound states (MBSs) are quasiparticles that are their own antiparticles. They are predicted to emerge as zero-energy modes localized at the boundary of a topological superconductor. No intrinsic topological superconductor is known to date. However, by interfacing conventional superconductors and semiconductors with strong spin-orbit coupling, it is possible to create a system hosting topological states. Hence, epitaxial superconductors and semiconductors have emerged as an attractive material system with atomically sharp interfaces and broad flexibility in device fabrications incorporating Josephson junctions. We discuss the basics of topological superconductivity and provide insight into how to go beyond current state-of-the-art experiments. We argue that the ultimate success in realizing MBS physics requires the observation of non-Abelian braiding and fusion experiments.

In satellite-based quantum-key-distribution (QKD), the number of secret bits that can be generated in a single satellite pass over the ground station is severely restricted by the pass duration and the free-space optical channel loss. High channel loss may decrease the signal-to-noise ratio due to background noise, reduce the number of generated raw key bits, and increase the quantum bit error rate (QBER), all of which have detrimental effects on the output secret key length. Under finite-size security analysis, a higher QBER increases the minimum raw key length necessary for nonzero secret-key-length extraction due to less efficient reconciliation and postprocessing overheads. We show that recent developments in finite-key analysis allow three different small-satellite-based QKD projects, CQT-Sat, the United Kingdom QUARC-ROKS, and QEYSSat, to produce secret keys even under conditions of very high loss, improving on estimates based on previous finite-key bounds. This suggests that satellites in low Earth orbit can satisfy finite-size security requirements but that this remains challenging for satellites further from Earth. We analyze the performance of each mission to provide an informed route toward improving the performance of small-satellite QKD missions. We highlight the short- and long-term perspectives on the challenges and potential future developments in small-satellite-based QKD and quantum networks. In particular, we discuss some of the experimental and theoretical bottlenecks and the improvements necessary to achieve QKD and wider quantum networking capabilities in daylight and at different altitudes.

In recent years, research in quantum computing has largely focused on two approaches: near-term intermediate-scale quantum (NISQ) computing and future fault-tolerant quantum computing (FTQC). A growing body of research into early fault-tolerant quantum computing (EFTQC) is exploring how to utilize quantum computers during the transition between these two eras. However, without agreed-upon characterizations of this transition, it is unclear how best to utilize EFTQC architectures. We argue for the perspective that this transition period will be characterized by a law of diminishing returns in quantum error correction (QEC), where the ability of the architecture to maintain quality operations at scale determines the point of diminishing returns. Two challenges emerge from this picture: how to model this phenomenon of diminishing return of QEC as the performance of devices is continually improving and how to design algorithms to make the most use of these devices. To address these challenges, we present models for the performance of EFTQC architectures, capturing the diminishing returns of QEC. We then use these models to elucidate the regimes in which algorithms suited to such architectures are advantageous. As a concrete example, we show that for the canonical task of phase estimation, in a regime of moderate scalability and using just over one million physical qubits, the “reach” of the quantum computer can be extended (compared to the standard approach) from 90-qubit instances to over 130-qubit instances using a simple early fault-tolerant quantum algorithm, which reduces the number of operations per circuit by a factor of 100 and increases the number of circuit repetitions by a factor of 10 000. This clarifies the role that such algorithms might play in the era of limited-scalability quantum computing.

The scaling barriers currently faced by both quantum networking and quantum computing technologies ultimately amount to the same core challenge of distributing high-quality entanglement at scale. In this Perspective, a novel quantum information-processing architecture based on optically active spins in silicon is proposed that offers a combined single technological platform for scalable fault-tolerant quantum computing and networking. The architecture is optimized for overall entanglement distribution and leverages color-center spins in silicon (T centers) for their manufacturability, photonic interface, and high-fidelity information-processing properties. Silicon nanophotonic optical circuits allow for photonic links between T centers, which are networked via telecom-band optical photons in a highly connected graph. This high connectivity unlocks the use of low-overhead quantum error-correcting codes, significantly accelerating the time line for modular scalable fault-tolerant quantum repeaters and quantum processors.

Over the last two decades, integrated photonics has profoundly revolutionized the domain of quantum technologies. The ongoing second quantum revolution stands as a timely opportunity for a state-of-the-art review and, most important, an exploration of the directions undertaken by integrated quantum photonics. Within this perspective, based on the recent advances, we discuss the current challenges and future trends related to different technological platforms. Key examples will be considered across various subfields, including quantum communication, quantum metrology, and quantum memories. Our discussion encompasses disruptive concepts, progress, and potential limitations. The main objective of this Perspective is to provide the reader with a forward-looking discussion ranging from state-of-the-art developments to open challenges of the field.

The dark-matter puzzle is one of the most important open problems in modern physics. The ultralight axion is a well-motivated dark-matter candidate, conceived to resolve the strong-$CP$ problem of quantum chromodynamics. Numerous precision experiments are searching for the three nongravitational interactions of axionlike dark matter. Some of the searches are approaching fundamental quantum limits on their sensitivity. This Perspective describes several approaches that use quantum engineering to circumvent these limits. Squeezing and single-photon counting can enhance searches for the axion-photon interaction. Optimization of quantum spin-ensemble properties is needed to realize the full potential of spin-based searches for the electric dipole moment and the gradient interactions of axion dark matter. Several metrological and sensing techniques, developed in the field of quantum information science, are finding natural applications in this area of experimental fundamental physics.

Einstein-Rosen-Podolsky (EPR) steering or quantum steering describes the “spooky action at a distance” that one party is able to remotely alter the states of the other if they share a certain entangled state. Generally, it admits an operational interpretation as the task of verifying entanglement without trust in the steering party’s devices, making it lie intermediately between Bell nonlocality and entanglement. Together with the asymmetrical nature, quantum steering has attracted a considerable interest from theoretical and experimental sides over the past decades. In this Perspective, we present a brief overview of the EPR steering with emphasis on the recent progress, discuss current challenges, opportunities, and propose various future directions. We look to the future, which directs research to a larger-scale level beyond massless and microscopic systems to reveal steering of higher dimensionality, and to build up steered networks composed of multiple parties.

Machine learning is frequently listed among the most promising applications for quantum computing. This is in fact a curious choice: the machine-learning algorithms of today are notoriously powerful in practice but remain theoretically difficult to study. Quantum computing, in contrast, does not offer practical benchmarks on realistic scales and theory is the main tool we have to judge whether it could become relevant for a problem. In this perspective, we explain why it is so difficult to say something about the practical power of quantum computers for machine learning with the tools we are currently using. We argue that these challenges call for a critical debate on whether quantum advantage and that the narrative of “beating” classical machine learning should continue to dominate the literature in the way it does, and highlight examples for how other perspectives in existing research provide an important alternative to the focus on advantage.

Quantum technologies are currently the object of high expectations from governments and private companies, as they hold the promise to shape safer and faster ways to extract, exchange, and treat information. However, despite its major potential impact for industry and society, the question of their energetic footprint has remained in a blind spot of current deployment strategies. In this Perspective, I argue that quantum technologies must urgently plan for the creation and structuration of a transverse quantum energy initiative, connecting quantum thermodynamics, quantum information science, quantum physics, and engineering. Such an initiative is the only path towards energy-efficient, sustainable quantum technologies, and to possibly bring out an energetic quantum advantage.

We identify five selected open problems in the theory of quantum information, which are rather simple to formulate, are well studied in the literature, but are technically not easy. As these problems enjoy diverse mathematical connections, they offer a huge breakthrough potential. The first four concern existence of certain objects relevant for quantum information, namely a family of symmetric informationally complete generalized measurements in an infinite sequence of dimensions, mutually unbiased bases in dimension six, measurements saturating multiparameter Cramér-Rao bound and bound entangled states with negative partial transpose. The fifth problem requires checking whether a certain state of a two-ququart system is two-copy distillable.

Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called “quantum low-density parity-check (LDPC) codes.” The codes we discuss are alternatives to the surface code, which is currently the leading candidate to implement quantum fault tolerance. We introduce the zoo of quantum LDPC codes and discuss their potential for making quantum computers robust with regard to noise. In particular, we explain recent advances in the theory of quantum LDPC codes related to certain product constructions and discuss open problems in the field.

The field of materials for quantum information science is rapidly growing with a focus on scaling and integrating new solid-state qubits. However, despite the extraordinary progress, major challenges must still be overcome for scaling. Specifically, there is a critical need for efficient coupling of tens to hundreds of solid-state qubits and multiqubit error correction to mitigate environmental interactions. This Perspective looks forward to the challenges ahead in the realization of multiqubit operations and collective phenomena with a focus on solid-state quantum materials. We provide a theorists’ point of view on the modeling and rational design of these multiqubit systems. Our Perspective identifies a path for bridging the gap between the model Hamiltonians used to develop quantum algorithms and control sequences and the ab initio calculations used to understand and characterize single solid-state-based qubits.

Artificial atoms realized by superconducting circuits offer unique opportunities to store and process quantum information with high fidelity. Among them, implementations of circuits that harness intrinsic noise protection have been rapidly developed in recent years. These noise-protected devices constitute a new class of qubits in which the computational states are largely decoupled from local noise channels. The main challenges in engineering such systems are simultaneously guarding against both bit- and phase-flip errors, and also ensuring high-fidelity qubit control. Although partial noise protection is possible in superconducting circuits relying on a single quantum degree of freedom, the promise of complete protection can only be fulfilled by implementing multimode or hybrid circuits. This Perspective reviews the theoretical principles at the heart of these new qubits, describes recent experiments, and highlights the potential of robust encoding of quantum information in superconducting qubits.

The Gottesman-Kitaev-Preskill (GKP) code was proposed in 2001 by Daniel Gottesman, Alexei Kitaev, and John Preskill as a way to encode a qubit in an oscillator. The GKP codewords are coherent superpositions of periodically displaced squeezed vacuum states. Because of the challenge of merely preparing the codewords, the GKP code was for a long time considered to be impractical. However, the remarkable developments in quantum hardware and control technology in the last two decades has made the GKP code a frontrunner in the race to build practical, fault-tolerant bosonic quantum technology. In this Perspective, we provide an overview of the GKP code with emphasis on its implementation in the circuit-QED architecture and present our outlook on the challenges and opportunities for scaling it up for hardware-efficient, fault-tolerant quantum error correction.

In this perspective we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algorithm with only a small polynomial speedup over the best classical alternative. The challenge is that the computation must finish within a reasonable amount of time while being difficult enough that the small quantum scaling advantage would compensate for the large constant factor overheads associated with error correction. We compute several examples of such runtimes using state-of-the-art surface code constructions under a variety of assumptions. We conclude that quadratic speedups will not enable quantum advantage on early generations of such fault-tolerant devices unless there is a significant improvement in how we realize quantum error correction. While this conclusion persists even if we were to increase the rate of logical gates in the surface code by more than an order of magnitude, we also repeat this analysis for speedups by other polynomial degrees and find that quartic speedups look significantly more practical.