After three decades of incremental progress, quantum computing is nearing practicality thanks to ingenious workarounds, according to Perimeter Institute. The development of a growing “Quantum Valley” in Waterloo Region reflects significant industry and investor excitement surrounding the technology, which promises expanded scientific calculation speeds but also poses a threat to current internet security.
“Quantum computers hold the potential to quickly and easily break the encryption that much of the modern Internet relies on,” notes Katie Mack, Hawking Chair in Cosmology and Science Communication at Perimeter. The key to realizing this potential, however, lies in overcoming the inherent instability of quantum systems through quantum error correction.
Quantum Computing’s Promise and Real-World Challenges
Michele Mosca, a professor at the University of Waterloo’s Institute for Quantum Computing and Perimeter associate faculty and founding member, initially doubted the feasibility of quantum computing due to the significant challenge of error correction in inherently fragile quantum systems. “I was one of the early skeptics of quantum computing because it just didn’t seem like it would ever be possible to correct the errors, given the inherent fragility of a quantum system,” Mosca told Perimeter in an interview, reflecting a perspective held before advancements in error correction techniques. This skepticism stemmed from the fundamental nature of qubits, which, unlike classical bits, exist in a superposition of states, represented visually by a vector on the Bloch sphere, and are susceptible to disruption.
The probabilistic nature of qubit readout necessitates error correction methods that avoid directly observing the qubit’s state, a process that would destroy the superposition and defeat the purpose of quantum computation. Early development of quantum error correction codes, however, fundamentally altered the outlook for the field, shifting it from an impossibility to a challenging but potentially achievable goal. “Quantum computing went from being impossible, to almost impossible, which was a big conceptual leap,” Mosca said, explaining the moment when viable error correction techniques emerged.
This conceptual leap prompted Mosca to join the field, recognizing the potential for overcoming previously insurmountable obstacles. The development of these codes relies on complex mathematical concepts and interdisciplinary collaboration, demanding expertise beyond traditional physics.
Researchers use the Bloch sphere, a mathematical representation where every qubit is a vector extending from the sphere’s center to its surface, to visualize and manage the delicate balance of quantum states. A vector pointing straight up represents the quantum state |0⟩, while a vector pointing straight down represents |1⟩, with all other points representing superpositions of these states.
Maintaining the integrity of these superpositions, despite environmental noise and imperfections, is the core challenge addressed by quantum error correction. Robust error correction is not merely a theoretical exercise. It directly impacts the scalability and practicality of quantum computers.
Sahu, Xu and Zhou’s 2026 research in Physical Review A further investigates achieving the Heisenberg limit using fault-tolerant quantum error correction, highlighting the continued drive to push the boundaries of what’s possible. Mosca’s current work emphasizes the ongoing need for theoretical contributions to translate technological advancements into practical applications. He believes that encouraging interdisciplinary thinking is important for enabling genuine breakthroughs in quantum computing.
The history of science consistently demonstrates that the most significant advances arise from the intersection of diverse fields, a principle particularly relevant to the complex challenges of building and operating quantum computers. The success of quantum error correction is not simply a technical achievement. It represents a fundamental shift in understanding and manipulating the quantum world.
By addressing the inherent fragility of qubits, researchers have unlocked the potential for building powerful computers capable of solving problems intractable for even the most advanced classical machines. The journey from initial skepticism to cautious optimism, as described by Mosca, highlights the importance of perseverance and interdisciplinary collaboration in the pursuit of scientific progress.
I was one of the early skeptics of quantum computing because it just didn’t seem like it would ever be possible to correct the errors, given the inherent fragility of a quantum system.
Michele Mosca, professor at the University of Waterloo’s Institute for Quantum Computing and Perimeter associate faculty and founding member
Classical Bits Versus Quantum Superposition and Qubits
Unlike classical bits constrained to representing either 0 or 1, qubits use quantum superposition, allowing them to exist as a combination of both states simultaneously. This isn’t merely a theoretical distinction; the state of a qubit is visualized as a vector on the Bloch sphere, where its position, defined by angles α and β, determines the probability of measuring either 0 or 1 upon readout.
A continuous slider provides a useful analogy for the range of possible quantum states a single qubit can occupy, a spectrum unavailable to classical computing. The inherent fragility of superposition is a central challenge, as any external interaction risks causing decoherence and collapsing the qubit’s state prematurely. This sensitivity necessitates meticulous isolation of qubits, often achieved through vacuum chambers and extremely low temperatures, to minimize unintended disturbances.
While classical computers also experience errors from sources like cosmic rays and power fluctuations, the nature of quantum errors introduces a far greater complexity. Classical error correction relies on reading bits to identify and fix flips, a process incompatible with the fundamental principle of quantum mechanics, observing a qubit collapses its superposition.
Researchers have circumvented this limitation by exploiting the geometry of the Bloch sphere and the concept of “subspaces.” A qubit experiencing an error doesn’t simply flip its value; it shifts into a different region of the sphere, a distinct subspace from valid, logical qubits. Projective measurements can then identify which subspace a qubit occupies without directly measuring its value and collapsing the superposition.
This technique allows for the detection of errors without destroying the quantum information, a critical step toward building fault-tolerant quantum computers. “It’s not actually measuring the value of the qubit, so it doesn’t collapse the superposition,” explains the source, highlighting the ingenious workaround that distinguishes quantum error correction from its classical counterpart.
The ability to distinguish between error-affected and valid qubits relies on recognizing their differing positions within the broader space of all possible qubit states. This approach, while conceptually complex, provides a pathway to mitigating the pervasive issue of decoherence and building quantum computers capable of solving complex problems.
Quantum Decoherence: Environmental Interactions and State Collapse
The inability to perfectly copy quantum information, dictated by the no-cloning theorem, presents a fundamental obstacle to traditional error correction methods. Unlike classical computing where redundant bits can be duplicated for error detection, replicating an unmeasured quantum state is prohibited, forcing researchers to explore alternative encoding strategies. Instead of directly copying qubits, scientists now encode quantum information into larger, interconnected systems of multiple physical qubits, creating what are known as logical qubits.
This approach involves representing a single logical qubit, the unit of quantum information used for computation, with a state like α|000⟩ + β|111⟩, where |000⟩ and |111⟩ are the logical codewords representing the encoded quantum information. The challenge extends beyond simply encoding information; errors affecting qubits aren’t always simple bit flips.
Each qubit can be visualized as a vector, an arrow whose direction indicates the superposition of |0⟩ and |1⟩ states, and whose length remains constant regardless of direction. Alterations to the qubit’s state, therefore, manifest as changes in the vector’s direction, demanding error correction methods capable of detecting and rectifying these more subtle distortions. Detecting these errors without collapsing the fragile quantum state requires ingenious techniques like projective measurement.
“You’re not really observing the object, just something about what shape it has from a particular direction,” explains the principle behind projective measurement, akin to discerning a 3D object’s form from its shadow. This indirect observation is essential because direct measurement forces the qubit into a definite state, destroying the superposition and halting computation.
The connection between error correction and topological phases of matter offers a promising avenue for building more robust quantum systems. Topological phases are defined by the overall quantum entanglement within a material, rather than the arrangement of its atoms, creating inherent stability. Because both error-correcting codes and topological phases encode information across the entire system, rather than relying on individual measurements, researchers are finding shared intuition and approaches applicable to both fields.
This convergence allows for the development of physical insights that can be applied in both error correction and the creation of more resilient quantum materials. The team’s work builds on three decades of physics workarounds that have brought quantum computing to the “brink of achieving it,” suggesting a surprisingly long and incremental path to a technology often presented as futuristic.
Quantum Error Correction Limits: The No-Cloning Theorem
The fundamental constraint of quantum mechanics known as the no-cloning theorem presents a unique challenge to error correction in quantum computing, preventing the simple replication of qubits for redundancy. While duplicating a quantum state exactly is impossible, researchers are creating new quantum states in different mathematical spaces that mimic aspects of the original, circumventing this limitation. This approach acknowledges that perfect replication is forbidden, but allows for the encoding of information in a way that protects it from errors.
Error correction in quantum systems differs significantly from classical methods because of the delicate nature of qubits and the potential for errors beyond simple bit flips. A qubit’s state can be visualized as a vector, and errors can alter the angles defining this vector, representing a continuous range of possible disturbances.
Unlike classical error correction, directly reading a qubit to check for errors is impossible, as the act of measurement collapses the superposition, destroying the quantum information. This incompatibility necessitates indirect methods of error detection that do not disturb the qubit’s fragile state. To address these challenges, scientists are exploring connections between error-correcting codes and topological phases of matter. Faculty member Tim Hsieh at Perimeter Institute, along with other experts, are investigating the deep mathematical relationships between these concepts.
“It’s only recently that quantum computing hardware is getting to a low enough noise level, and the design of error-correcting codes is getting good enough, that we can reach this critical threshold in real quantum computers,” explains the source. The interdisciplinary nature of quantum error correction requires expertise from diverse fields like quantum matter and mathematics, which is essential for developing innovative solutions to the complex challenges inherent in protecting quantum information.
Quantum computing went from being impossible, to almost impossible, which was a big conceptual leap.
Michele Mosca, professor at the University of Waterloo’s Institute for Quantum Computing and Perimeter associate faculty and founding member
Redundancy in Classical Error Correction Methods
Classical error correction relies on adding redundancy to data, a technique that initially appears straightforward but presents unique challenges when applied to quantum systems. Replacing each binary digit with a string of identical digits, like representing ‘1’ as ‘111’, allows detection of errors based on deviations from this pattern, such as identifying ‘010’ as an indicator of a flipped bit. This approach, effective for classical computing, assumes errors are discrete events like bit flips caused by cosmic rays or power fluctuations, which can be corrected by majority rule.
However, the continuous nature of quantum states introduces a far more complex error landscape. A qubit’s state, represented as a point on the Bloch sphere, can be altered in infinitely many ways, corresponding to changes in the angles defining its position. This continuous variability necessitates a more sophisticated approach to error detection than simply checking for flipped bits.
The team explains that while classical error correction identifies discrepancies through majority rule, quantum error correction must account for a spectrum of potential errors, making the task significantly more difficult. The fundamental incompatibility between quantum mechanics and direct measurement further complicates matters. Building sufficient redundancy into quantum systems is also a balancing act, as each added qubit introduces another potential source of error. The effectiveness of error correction is ultimately limited by an error threshold.
If the underlying error rate of the hardware is too high, even substantial redundancy will be insufficient to correct all errors. “If the error rate is high enough, then it doesn’t matter how much redundancy you build in; you won’t be able to correct the errors anymore,” the team reports. This threshold highlights the critical interplay between theoretical advances in error correction codes and experimental progress in building more stable and reliable quantum hardware.
See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.
