The Fully Depolarizing Noise Conjecture for Entangled Physical States: A Twenty-Year Perspective
In this paper honoring Yuri Gurevich, the author revisits a twenty-year-old conjecture that correlated noise in entangled qubits contains a fully depolarizing component posing a fundamental challenge to quantum fault tolerance, while also discussing noise sensitivity in NISQ systems, the statistical analysis of quantum advantage claims, and personal reflections on their scientific relationship.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
The dream of building a quantum computer has captivated scientists and engineers for decades, promising machines that could solve problems far beyond the reach of today's most powerful supercomputers. At the heart of this dream is the idea of entanglement, a strange connection where two tiny particles, such as atoms or electrons, become linked so that the state of one instantly influences the other, no matter how far apart they are. This connection is the fuel for quantum power, but it is also incredibly fragile. In the real world, these particles are constantly bombarded by heat, vibration, and electromagnetic waves, causing them to lose their delicate quantum states in a process called decoherence. To build a working computer, engineers must protect these particles from this noise, a challenge so difficult that it requires a concept called fault tolerance. This approach assumes that if errors happen rarely enough and independently of one another, a system can detect and fix them faster than they accumulate, allowing the computer to run complex calculations without collapsing.
However, a twenty-year-old idea proposed by mathematician Gil Kalai suggests that this entire strategy might be built on a flawed assumption about how nature works. In a paper written for a volume honoring his friend and colleague Yuri Gurevich, Kalai revisits a hypothesis he first put forward in 2006. He argues that the noise affecting quantum particles is not as random and independent as current models assume. Instead, he proposes that whenever two physical particles are entangled, the noise acting on them is inherently linked. Specifically, he suggests that there is a significant chance that both particles will be wiped clean of their information at the exact same time, a phenomenon known as joint fully depolarizing noise. If this is true, the errors would not be isolated incidents that a computer could easily fix; they would be synchronized events that overwhelm the system's ability to correct itself, potentially making large-scale quantum computers impossible to build.
Kalai's paper does not claim to have proven this impossibility yet. Rather, it serves as a roadmap for how to test this structural constraint against the physical world. He argues that the standard models used by engineers treat errors on different particles as separate events, like two people dropping their own distinct items. His conjecture posits that in reality, the errors are more like a single gust of wind knocking over two people standing close together. The paper outlines a specific way to check this: by comparing how errors behave when two particles are entangled directly versus when they are entangled indirectly through a third particle. In standard models, indirect entanglement should make the chance of a simultaneous error much smaller, dropping from a linear probability to a quadratic one. Kalai predicts that nature does not allow this reduction; even when the connection is indirect, the probability of both particles failing together should remain high, comparable to the error rate of a direct connection.
The implications of this idea are profound for the field of quantum computing. If Kalai is correct, the errors in a quantum system would not just be a few scattered mistakes that can be cleaned up. Instead, they would be large-scale, synchronized failures where many particles lose their information at once. This would break the mathematical theorems that promise fault tolerance, suggesting that no matter how good the engineering becomes, the noise will always grow too fast to be controlled. The paper also touches on a broader skepticism regarding recent claims of "quantum advantage," where companies have announced that their devices have performed tasks impossible for classical computers. Kalai and his collaborators have developed statistical tools to scrutinize these claims, arguing that the data might not be as robust as reported and that the observed results could be influenced by the very classical computers used to design and calibrate the experiments.
To settle the question, Kalai proposes a series of experiments that could be performed on current devices, which already contain dozens of qubits. He suggests looking at the statistical patterns of errors in these machines to see if they show the signs of the synchronized noise he predicts. This would involve analyzing not just how often errors happen, but how they are correlated across different parts of the system. The paper acknowledges that these tests are difficult and require precise measurements, but it insists that the technology is now advanced enough to attempt them. The goal is not to dismiss the field, but to subject its most optimistic assumptions to a rigorous stress test. If the conjecture holds, it would mean that the path to a universal quantum computer is blocked by a fundamental law of physics. If it is disproven, it would remove a major theoretical obstacle and validate the current engineering approaches.
Throughout the paper, Kalai reflects on the nature of scientific progress and the relationship between theory and reality. He draws parallels between the challenges of quantum computing and other areas where theoretical models struggle to capture the messiness of the real world, such as parallel computing or the limits of human creativity. He also shares personal reflections on his long friendship with Yuri Gurevich, a logician and computer scientist, noting how their shared interest in the gap between abstract theory and practical application has shaped their careers. This personal dimension underscores the paper's central theme: that understanding the limits of computation requires not just mathematical rigor, but a deep, critical engagement with how physical systems actually behave. The paper concludes by emphasizing that the answer to whether quantum computers can be built will not come from a new equation, but from careful observation of the noise in the machines we are building today.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.