In a groundbreaking advancement for quantum computing, researchers at the University of California, Riverside (UCR) have unveiled a novel approach to building scalable and fault-tolerant quantum architectures. While quantum computers have made significant strides across various scientific domains including chemistry, materials science, and cybersecurity, one persistent challenge has been their limited scale and the fragile nature of qubits. The new study, published in the journal Physical Review A, demonstrates how networks of smaller quantum chips can be interconnected, even with imperfect and noisy links, to form a powerful quantum system capable of detecting and correcting errors efficiently.
Until now, the predominant focus in quantum computing research was on increasing the sheer number of qubits on a single chip. However, this approach faces physical and technical constraints, especially when constructing ever-larger processors. The UCR team shifts this paradigm by exploring modular quantum architectures—systems where multiple smaller chips are linked together to function as an integrated quantum computer. Their key finding is the demonstration that fault-tolerant quantum computation does not require flawless connections between chips. Instead, as long as each individual chip maintains high operational fidelity, the inter-chip connections can tolerate significant noise, up to ten times noisier than intra-chip operations, without compromising the system’s ability to correct errors.
This breakthrough addresses two central challenges in quantum hardware: scalability and fault tolerance. Scalability refers to the methodical increase in system size without degradation in performance, while fault tolerance ensures that a quantum computer can automatically detect and correct errors that naturally occur due to the fragile quantum states. Quantum information is extremely susceptible to decoherence and external disturbances, making error correction not just desirable but essential for reliable quantum computation. The UCR researchers used advanced computational simulations to model six different modular quantum architectures with varying error rates and noise levels in the connection links, all inspired by realistic parameters from Google’s quantum infrastructure.
Mohamed A. Shalby, the lead author and a doctoral candidate in UCR’s Department of Physics and Astronomy, explained that their approach hinges on leveraging the existing surface code error correction scheme. The surface code is currently one of the most promising error-correcting codes for quantum information, relying on a two-dimensional lattice of physical qubits to encode a single logical qubit with high fidelity. Through extensive simulations, the team found that even when connections between chips were significantly noisier, the surface code could still function effectively, detecting and rectifying errors induced by the noisy links.
Traditional challenges in linking quantum chips arise from the noise introduced especially in inter-chip connections housed in separate cryogenic refrigerators. Unlike intra-chip operations which occur within a well-controlled environment, connecting quantum processors physically separated poses technical difficulties such as increased signal loss and interference. Despite these issues, the UCR study reveals that a fault-tolerant modular quantum computer does not need “perfect” connections—just “good enough” ones. This insight effectively lowers the barrier to scaling quantum systems by allowing current chip technologies to be interconnected while maintaining computational reliability.
This research capitalizes on a vast number of simulations, leveraging computational tools developed by the Google Quantum AI team. By simulating thousands of scenarios across various quantum chip designs and teleportation interfaces, the study paints a comprehensive picture of the noise thresholds quantum systems can tolerate. The simulation results also build on previously published work from leading institutions such as the Massachusetts Institute of Technology, evidencing a growing consensus about the feasibility of modular quantum computing.
Fault tolerance in quantum systems relies on redundancy: while classical bits are simply 0s or 1s, quantum bits (qubits) can be in superpositions, making them far more vulnerable to errors. To combat this, logical qubits are formed from clusters of physical qubits, sometimes numbering in the thousands, which collaboratively detect and correct errors. The surface code is a particularly robust logical qubit architecture due to its ability to localize and correct faults within the two-dimensional lattice configuration. UCR’s study utilizing optimized surface code teleportation interfaces further refines this approach by demonstrating noise resilience in modular chip connections.
The practical implications of this discovery are profound. By proving that modular quantum systems can tolerate realistic noise levels in their interconnections, this work provides a tangible pathway for the quantum computing community to scale up processors without waiting for optimal hardware perfection. This paves the way for building larger quantum machines sooner, accelerating quantum computation’s arrival into practical applications such as cryptography, complex molecular modeling, and artificial intelligence optimization algorithms.
Moreover, the research aligns with a strategic move toward distributed quantum computing, where quantum resources are networked across separate nodes and locations. Modular architectures inherently support this distributed nature by enabling quantum computation across multiple linked processors. The UCR team’s results thus not only aid in the physical scaling problem but also lay a foundation for scalable distributed quantum systems, which are essential for fault-tolerant quantum internet technologies.
The research team included UCR physicists Leonid P. Pryadko and Renyu Wang, along with Denis Sedov from the University of Stuttgart in Germany, in an international collaboration that reflects the global nature of quantum computing research. Supported by the National Science Foundation, this cross-institutional study combines expertise from multiple quantum research hubs, demonstrating how international cooperation accelerates innovation in this cutting-edge field.
Their paper, titled “Optimized noise-resilient surface code teleportation interfaces,” was published on August 22, 2025, in the peer-reviewed Physical Review A journal. The study represents a significant milestone on the path toward building practical, large-scale, and reliable quantum computers capable of transforming computing paradigms across scientific and industrial landscapes in the near future.
As quantum computing continues to mature, studies like this redefine what is possible with current technologies. By shifting focus from the impractical quest for perfect hardware to creating systems that effectively manage and correct imperfection, the UCR team’s findings embolden researchers and engineers to rethink quantum hardware design principles. This development will likely accelerate the commercialization and practical deployment of quantum processors, moving humanity closer to harnessing the transformative power of quantum information science.
Subject of Research: Quantum computing architectures; fault tolerance; scalable quantum systems; surface code error correction.
Article Title: Optimized noise-resilient surface code teleportation interfaces
News Publication Date: 22-Aug-2025
Web References:
- Physical Review A paper
- UCR Department of Physics and Astronomy
- Google Quantum AI
- MIT quantum research inspiration
References:
Shalby, M.A., Pryadko, L.P., Wang, R., Sedov, D. (2025). Optimized noise-resilient surface code teleportation interfaces. Physical Review A. doi:10.1103/xqrn-wdw1
Image Credits: Credit: M. Shalby, UC Riverside.
Keywords: quantum computing, modular quantum architecture, fault tolerance, surface code, quantum error correction, quantum chips, noise resilience, scalable quantum systems, quantum simulation, quantum teleportation interfaces
