This extreme fragility might make quantum computing sound hopeless. But in 1995, the applied mathematician Peter Shor discovered a clever way to store quantum information. His encoding had two key properties. First, it could tolerate errors that only affected individual qubits. Second, it came with a procedure for correcting errors as they occurred, preventing them from piling up and derailing a computation. Shors discovery was the first example of a quantum error-correcting code, and its two key properties are the defining features of all such codes. <\/p>\n
The first property stems from a simple principle: Secret information is less vulnerable when its divided up. Spy networks employ a similar strategy. Each spy knows very little about the network as a whole, so the organization remains safe even if any individual is captured. But quantum error-correcting codes take this logic to the extreme. In a quantum spy network, no single spy would know anything at all, yet together theyd know a lot. <\/p>\n
Each quantum error-correcting code is a specific recipe for distributing quantum information across many qubits in a collective superposition state. This procedure effectively transforms a cluster of physical qubits into a single virtual qubit. Repeat the process many times with a large array of qubits, and youll get many virtual qubits that you can use to perform computations. <\/p>\n
The physical qubits that make up each virtual qubit are like those oblivious quantum spies. Measure any one of them, and youll learn nothing about the state of the virtual qubit its a part of a property called local indistinguishability. Since each physical qubit encodes no information, errors in single qubits wont ruin a computation. The information that matters is somehow everywhere, yet nowhere in particular. <\/p>\n
You cant pin it down to any individual qubit, Cubitt said. <\/p>\n
All quantum error-correcting codes can absorb at least one error without any effect on the encoded information, but they will all eventually succumb as errors accumulate. Thats where the second property of quantum error-correcting codes kicks in the actual error correction. This is closely related to local indistinguishability: Because errors in individual qubits dont destroy any information, its always possible to reverse any error using established procedures specific to each code. <\/p>\n
Zhi Li, a postdoc at the Perimeter Institute for Theoretical Physics in Waterloo, Canada, was well versed in the theory of quantum error correction. But the subject was far from his mind when he struck up a conversation with his colleague Latham Boyle. It was the fall of 2022, and the two physicists were on an evening shuttle from Waterloo to Toronto. Boyle, an expert in aperiodic tilings who lived in Toronto at the time and is now at the University of Edinburgh, was a familiar face on those shuttle rides, which often got stuck in heavy traffic. <\/p>\n
Normally they could be very miserable, Boyle said. This was like the greatest one of all time. <\/p>\n
Before that fateful evening, Li and Boyle knew of each others work, but their research areas didnt directly overlap, and theyd never had a one-on-one conversation. But like countless researchers in unrelated fields, Li was curious about aperiodic tilings. Its very hard to be not interested, he said. <\/p>\n
Interest turned into fascination when Boyle mentioned a special property of aperiodic tilings: local indistinguishability. In that context, the term means something different. The same set of tiles can form infinitely many tilings that look completely different overall, but its impossible to tell any two tilings apart by examining any local area. Thats because every finite patch of any tiling, no matter how large, will show up somewhere in every other tiling. <\/p>\n
If I plop you down in one tiling or the other and give you the rest of your life to explore, youll never be able to figure out whether I put you down in your tiling or my tiling, Boyle said. <\/p>\n
To Li, this seemed tantalizingly similar to the definition of local indistinguishability in quantum error correction. He mentioned the connection to Boyle, who was instantly transfixed. The underlying mathematics in the two cases was quite different, but the resemblance was too intriguing to dismiss. <\/p>\n
Li and Boyle wondered whether they could draw a more precise connection between the two definitions of local indistinguishability by building a quantum error-correcting code based on a class of aperiodic tilings. They continued talking through the entire two-hour shuttle ride, and by the time they arrived in Toronto they were sure that such a code was possible it was just a matter of constructing a formal proof. <\/p>\n
Li and Boyle decided to start with Penrose tilings, which were simple and familiar. To transform them into a quantum error-correcting code, theyd have to first define what quantum states and errors would look like in this unusual system. That part was easy. An infinite two-dimensional plane covered with Penrose tiles, like a grid of qubits, can be described using the mathematical framework of quantum physics: The quantum states are specific tilings instead of 0s and 1s. An error simply deletes a single patch of the tiling pattern, the way certain errors in qubit arrays wipe out the state of every qubit in a small cluster. <\/p>\n
The next step was to identify tiling configurations that wouldnt be affected by localized errors, like the virtual qubit states in ordinary quantum error-correcting codes. The solution, as in an ordinary code, was to use superpositions. A carefully chosen superposition of Penrose tilings is akin to a bathroom tile arrangement proposed by the worlds most indecisive interior decorator. Even if a piece of that jumbled blueprint is missing, it wont betray any information about the overall floor plan. <\/p>\n
<\/p>\n
Read more from the original source: <\/p>\n
Never-Repeating Tiles Can Safeguard Quantum Information - Quanta Magazine<\/a><\/p>\n","protected":false},"excerpt":{"rendered":" This extreme fragility might make quantum computing sound hopeless. But in 1995, the applied mathematician Peter Shor discovered a clever way to store quantum information. His encoding had two key properties Continue reading