The experiment, led by Ziqian Li and Eesh Gupta, who contributed equally, together with senior author David I. Schuster, showcases a device in which seven distinct memory modes can be individually addressed through a single transmon qubit acting as a classical control intermediary. Crucially, the memory modes are not raw qubits exposed to the noise of the processing layer. Instead, they live inside a multimode storage cavity, and a carefully engineered buffer layer sits between the processor and the cavity, isolating the fragile stored quantum states from the nonlinear elements that make computation possible but also make errors likely.

The need for such a device is easy to appreciate when one considers how modern superconducting quantum processors actually operate. In today’s machines, every physical qubit is tied to its own dedicated control lines, readout resonators and filters. A logical qubit protected by a surface code can demand dozens of physical qubits, each with its own coaxial cable running down into the dilution refrigerator. The wiring burden grows so quickly that scaling to useful machines has become as much a problem of engineering and cryogenics as of quantum physics. A random access memory flips this picture: if quantum information can be parked in high-coherence storage and retrieved on demand through a small number of shared control channels, the number of lines required per logical qubit falls dramatically, and the logic and storage subsystems can each be optimised separately.

The conceptual foundations for quantum random access memory stretch back to 2008, when Giovannetti, Lloyd and Maccone formalised the idea of a structure that could be queried in superposition, an operation at the heart of several quantum algorithms with proven exponential advantages. Practical implementations, however, have lagged far behind their classical counterparts. Demonstration efforts in other platforms, including a 105-mode random access memory realised with atomic ensembles in 2019, showed that the principle could be realised, but superconducting processors, the leading candidate for fault-tolerant quantum computation, notably lacked an equivalent. Architectural proposals from computer scientists, including work by Baker, Schuster and Chong on memory-equipped quantum architectures, argued that the power of random access could reshape how error-corrected machines are organised, but the hardware to realise such a vision did not yet exist.

The new device closes that gap with an elegant layered design. At its heart is a multimode microwave storage cavity, a single physical object that supports many electromagnetic modes at distinct frequencies, each capable of holding a quantum state for a long time. Seamless cavities of this kind have previously achieved photon lifetimes measured in tens or even hundreds of milliseconds, far exceeding the coherence of planar transmon qubits. A single transmon, the workhorse qubit of the superconducting world, provides the address mechanism: by tuning the transmon into resonance with a selected cavity mode, the experimenters can swap a quantum state into or out of that mode while leaving the others untouched.

The crucial innovation is the cascaded architecture with its buffer layer. Directly coupling a transmon to a multimode cavity creates a problem: the strong nonlinearity of the qubit, which enables control, also pushes unwanted photons and residual excitations back into the memory, degrading the stored states through induced dephasing and other many-body effects. The team solved this by inserting an intermediate buffer mode between the processor and the storage cavity, cascading the interactions so that the storage modes are only weakly, virtually engaged during operation. The single transmon then classically addresses the seven memory modes through this buffer, addressing them one at a time while the full stack remains protected from processor nonlinearities.

The performance figures reported are striking for a first demonstration. Arbitrary random access across the eight-bit device, meaning the ability to write to or read from any chosen memory mode on demand, was achieved with an average infidelity of less than 1.5 percent per mode. The researchers did not stop at headline numbers: they characterised the dominant error processes in detail, showing that residual many-body interactions within the multimode cavity set the present error budget. This kind of honest error accounting matters enormously for the path forward, because it tells engineers exactly which physical mechanisms must be suppressed as the architecture is scaled to more modes and longer storage times.

Beyond mere storage, the architecture supports operations performed transversally within the memory module, meaning operations that act across the encoded information without spreading errors from one component to its neighbours, a key requirement for fault tolerance. Combined with the drastic reduction in control lines per logical qubit, this positions the cascaded random access memory as a candidate unit cell for fault-tolerant quantum architectures. In such a scheme, the memory module would hold many logical qubits in long-lived cavity modes, a modest number of transmons would provide address and control, and dedicated processors would operate on retrieved states, each subsystem optimised on its own terms. The authors describe the result as enabling resource-efficient control of logical qubits, separating the problems of high-speed logic and long-duration storage that currently fight for the same physical qubits.

The work also resonates with a broader trend in the field towards bosonic and multimode approaches to quantum information. Error-corrected logical qubits encoded in oscillator states, dual-rail cavity qubits with erasure detection, and high-quality-factor niobium and coaxial cavities have all advanced rapidly in recent years, with several experiments now reaching or exceeding the break-even point for quantum error correction. What has been missing is a way to organise many such high-performance memories into an addressable, switchable whole. The cascaded random access memory provides exactly that missing layer of organisation, and it does so using components, transmons, cavities and parametric couplers, that are already compatible with existing superconducting processor fabrication.

There remain, of course, substantial challenges between this eight-bit demonstration and the megabyte-scale ambitions of quantum computing. Error rates must fall further, storage times must lengthen relative to operation times, and the many-body interaction effects that dominate the current error budget must be engineered away or incorporated into error models. The researchers have made their data and simulation codes openly available through figshare, an invitation for the community to probe, reproduce and extend the results. Yet the conceptual milestone is unambiguous. Classical computing took its decisive step towards scalability when memory was separated from logic and made randomly accessible. Quantum computing has now taken an analogous step, demonstrating that a single control qubit can reach into a protected reservoir of quantum states and retrieve any one of them on demand. If the approach scales as its designers hope, the random access quantum memory may come to be seen as the moment quantum hardware began to acquire the architectural maturity that classical machines have enjoyed for decades.

Subject of Research: Demonstration of an eight-bit cascaded random access quantum memory using superconducting circuits, transmons and multimode storage cavities for scalable fault-tolerant quantum computing.

Article Title: A cascaded random access quantum memory

Article References: Li, Z., Gupta, E., Zhao, F., Banerjee, R., Lu, Y., Roy, T., Oriani, A., Vrajitoarea, A., Chakram, S., & Schuster, D. I. (2026). A cascaded random access quantum memory. Nature Physics. https://doi.org/10.1038/s41567-026-03418-w

Image Credits: AI Generated

DOI: 10.1038/s41567-026-03418-w

Keywords: quantum memory, random access memory, superconducting circuits, transmon qubit, multimode cavity, quantum computing, fault tolerance, quantum error correction, circuit quantum electrodynamics, logical qubits, cascaded architecture, quantum architecture

The work arrives at a moment when the quantum computing community is increasingly thinking about infrastructure rather than isolated devices. Just as classical computing evolved from room-sized mainframes to cloud services, quantum computing is expected to follow a similar trajectory, with the quantum internet envisioned as a network connecting quantum processors, memories, and sensors. But the delegation problem is uniquely quantum. Unlike classical data, quantum states cannot be copied, so a client cannot simply keep a backup while a server works on the original. Measuring a quantum state disturbs it, and any inspection by the server risks destroying the very information the client wants protected. Delegated quantum computation therefore demands guarantees that have no classical analogue, and the new framework addresses three of them simultaneously: blindness, which ensures the server learns nothing about the client’s input, output, or algorithm; completeness, which ensures the computation is performed correctly; and verifiability, which allows the client to detect malicious deviations by the server.

At the heart of the proposed architecture is a distributed stabilizer code backbone. Rather than storing a quantum state on a single server, the framework encodes it across multiple server nodes using the mathematics of stabilizer codes—the same formalism that underlies quantum error correction. Stabilizer codes define a protected codespace by a set of commuting operators, and a logical state is prepared by measuring these operators and applying corrections based on the measurement outcomes. The authors adapt this standard procedure to a network setting, with a central master node coordinating leaf nodes that each hold parts of the encoded data. The security of this distributed storage arrangement is analyzed under explicit assumptions: servers are assumed not to communicate with one another in an unrestricted fashion, and any collusion among them is bounded. Under these conditions, the encoding spreads quantum information in a way that no single node—or limited coalition of nodes—can reconstruct the client’s private state.

The second pillar of the framework is a two-level error management structure, reflecting the messy reality that real quantum hardware is noisy. Quantum states are fragile, and errors accumulate from imperfect gates, stray electromagnetic fields, and decoherence. The framework’s designers recognized that a one-size-fits-all error correction scheme would be wasteful, since different server nodes may face different physical noise environments. Instead, each node is equipped to handle errors locally according to its own noise model. The paper details two custom procedural quantum error correction schemes with full algebraic correctness proofs. The first is a four-qubit scheme capable of identifying and correcting any single Pauli error—bit-flip X, phase-flip Z, or the combined Y error—on a data qubit, producing a unique three-bit syndrome for each case. The second is a six-qubit scheme designed for biased noise environments: it deterministically corrects the dominant X and Y type faults while raising a distinctive flag syndrome when a Z-type error occurs, signaling the event to higher-level fault-tolerance routines rather than attempting a correction it cannot guarantee.

This bias-aware design choice is notable because it reflects a pragmatic engineering philosophy. In many physical qubit platforms, certain error types are far more common than others, and dedicating resources to correct the dominant faults while merely detecting the rarer ones can be far more efficient than universal correction. The authors are careful to state the limits of their schemes: the six-qubit method establishes correctness only with respect to its stated design goal and does not constitute universal single-qubit error correction. That kind of precision about what is and is not proven is a hallmark of the paper, which consistently pairs every architectural claim with an explicit statement of the assumptions under which it holds.

The third component is a trap-based verification protocol that addresses the malicious-server scenario. A cloud provider might be honest but incompetent, or it might be actively adversarial—substituting wrong operations, peeking at data, or returning fabricated results. The verification protocol embeds checks into the computation so that any malicious deviation is detected with a probability controlled by a security parameter. In effect, the client can tune the odds of catching a cheating server, trading a modest overhead in resources for a stronger guarantee. Bringing these three components together—distributed encoding, localized noise handling, and trap-based verification—into a single coherent system is the paper’s central contribution, and the authors provide a formal security analysis showing that, under the stated assumptions, the framework achieves completeness, blindness, and verifiability with respect to the permitted information leakage.

Underneath the security layer, the framework must still actually run quantum algorithms, and the paper devotes considerable attention to the mechanics of distributed execution. The authors prove the correctness of protocols for encoding stabilizer states across a network, for executing controlled operations between non-adjacent nodes using entanglement swapping and gate teleportation, and for composing these primitives into a complete synthesis pipeline. The pipeline begins with classical compilation, where the client’s controller decomposes a desired unitary operation into a universal gate set using established techniques such as the Solovay–Kitaev algorithm for single-qubit gates and the KAK decomposition for two-qubit gates, which can be implemented with as few as three CNOT gates. Logical operators are then formally defined by their algebraic action on the codespace, and each logical gate is dispatched to a distributed implementation. Clifford gates are handled transversally where the chosen code permits, while the non-Clifford T gate—essential for universality—is implemented through magic state injection, consuming a high-fidelity ancillary state prepared offline. The famous Eastin–Knill theorem, which forbids any code from having a transversal universal gate set, makes this more elaborate route unavoidable, and the framework embraces it explicitly.

The significance of the work lies less in any single technique—many of the underlying tools, from teleportation to stabilizer measurement to magic states, are well established—than in the integration and the proofs. Security frameworks for delegated quantum computation have existed before, and distributed quantum computing has been studied extensively from a performance standpoint, but combining noise awareness, distributed storage, and provable blindness, completeness, and verifiability in one architecture is a step toward what the authors call an architectural blueprint for trustworthy distributed quantum computation. The paper is candid that its guarantees are conditional: they hold under non-communication and bounded collusion assumptions among servers, and real deployments would need to assess how those assumptions map onto actual cloud providers and network topologies. Still, making the assumptions explicit is itself valuable, because it converts a vague hope of security into a set of testable conditions.

The broader implications reach toward the commercial quantum era that governments and companies are actively preparing for. National initiatives, including India’s National Quantum Mission, which supported this research alongside the U.S.–India Science and Technology Endowment Fund, are investing in the communication and networking layers that such architectures would require. If quantum cloud services are to win the trust of banks, pharmaceutical companies, and government agencies handling sensitive computations, they will need exactly the kind of formal guarantees this framework articulates. The authors position their work as a foundation for further development of secure quantum cloud services, and the detailed appendices—containing correctness proofs for every algorithm, syndrome tables for the error correction schemes, and state-evolution analyses—provide the technical scaffolding that other researchers will need to build on it. As quantum hardware matures, the question of who can safely use it, and how, may prove as consequential as the question of how fast it can run. This framework offers one carefully proven answer to the first question, and a template for the engineering that must follow.

Subject of Research: A provably secure, noise-aware architectural framework for delegating quantum computation and storage to untrusted distributed servers

Article Title: A provably secure framework for noise-aware delegated quantum computation and storage

Article References: A provably secure framework for noise-aware delegated quantum computation and storage. (n.d.). https://doi.org/10.1007/s11128-026-05329-4

Image Credits: AI Generated

DOI: 10.1007/s11128-026-05329-4

Keywords: quantum computing, delegated quantum computation, blind quantum computing, quantum cloud services, stabilizer codes, quantum error correction, verifiability, distributed quantum computing, quantum networks, magic state injection, quantum cryptography, noise-aware architecture

At the heart of this quantum engine lies a transmon qubit, a central component in many quantum computing architectures. Unlike conventional heat engines that require distinct hot and cold sources, this quantum heat engine employs a single, quantum-circuit refrigerator capable of acting as both heat source and sink. Tunable on demand, this element controls heat flow at an unprecedented quantum scale, allowing the engine to cyclically produce measurable positive work from minuscule ultracold energy fluctuations.

This experimental setup is a significant leap forward, proving that quantum thermodynamics can be engineered with precision in superconducting systems. The researchers designed their engine to operate near absolute zero inside a cryostat, carefully orchestrating microwave pulses that manage the cyclic Otto process. By monitoring the quantum state of the transmon, they showed direct evidence of work extraction—a feat that had long eluded quantum engineers.

The implications of this breakthrough extend beyond the laboratory. Autonomous quantum heat engines could help overcome significant challenges faced by the burgeoning quantum computing industry. Presently, high-qubit quantum computers rely on millions of costly microwave cables for qubit control and readout, cables that also introduce noise and complexity. Integrating heat engines capable of operating independently on-chip promises to drastically simplify these systems, reducing costs and improving stability.

Finland’s ambitious Quantum Technology Strategy foresees quantum computers with thousands of logical qubits on the horizon, demanding vast physical qubit arrays. Innovations like this superconducting quantum engine pave the way to meet such demands by minimizing external control infrastructure. The technology could enable quantum processors to perform essential functions such as qubit readout autonomously at cryogenic temperatures, bypassing the noisy transition to room temperature electronics.

This pioneering research was led by Academy Professor Mikko Möttönen and first author Tuomas Uusnäkki. Their paper detailing the construction and operation of the cyclic quantum heat engine was published in Nature Communications on July 13, 2026. Utilizing the state-of-the-art facilities at OtaNano, Finland’s national infrastructure for nano and quantum tech, the team demonstrated a clear proof of concept for a new class of quantum devices melding thermodynamics with quantum information science.

As quantum technologies continue to evolve, this fusion of quantum physics and thermodynamics may unlock novel functionalities and efficiencies. This development stands as a milestone indicating not only the feasibility of quantum heat engines but also their potential to reduce technological barriers in scaling future quantum computing systems.

Subject of Research: Superconducting quantum heat engine and quantum thermodynamics
Article Title: World’s first superconducting quantum heat engine offers path to larger quantum computers
News Publication Date: 13-Jul-2026
Web References: http://dx.doi.org/10.1038/s41467-026-72651-x
Image Credits: Heikka Valja / Aalto University

Keywords

Quantum heat engine, superconducting circuits, transmon qubit, quantum thermodynamics, Otto cycle, quantum refrigerator, quantum computing, cryogenic technology, autonomous quantum devices