Gauge theory could give quantum error correction a boost

More from less Concepts from gauge theory could be used to reduce the number of qubits needed to do quantum error correction. (Courtesy: iStock/Quardia) Concepts from gauge theory could lead to a more efficient way to perform fault-tolerant quantum computation by reducing the number of qubits required for key operations – according to work done by Dominic Williamson and Theodore Yoder at IBM Quantum in the US. By adapting ideas from gauge theory, the researchers show how quantum information spread-out across a machine can be measured using only local checks, significantly lowering computing overhead. Their approach works for a wide class of quantum error-correction codes and could help accelerate the development of practical quantum computers. One importance difference between quantum computers and ordinary computers is how information is stored. Instead of bits, which can be either 0 or 1, quantum computers use qubits, which can exist in a combination of both states at once. Qubits can also be entangled and it is these and other quantum effects that can be harnessed to solve some problems much fast than conventional computers. However, this power comes with a major drawback. Qubits are extremely sensitive to disturbances from their environment, which can easily introduce errors. This fragility is one of the main reasons why building large-scale quantum computers is so difficult. To overcome this, researchers are developing fault-tolerant strategies that allow a quantum computer to continue working correctly even when some of its components fail. Williamson, who is now at Australia’s University of Sydney, describes this as using “carefully designed methods with built-in checks so that, when those checks pass, the final result has not been corrupted”. Such methods typically store information held in one “logical qubit” across many “physical qubits” so that errors can be detected and corrected. But this protection comes at a cost, often requiring a large numbers qubits to perform even simple operations. Measuring quantum information In their new work, Williamson and Yoder tackle one of the central challenges in fault-tolerant quantum computing: how to measure information that is spread across many qubits without introducing too many extra resources. The researchers draw on gauge theory, a concept from mathematical physics. “Gauge theories describe how local interactions can connect distant parts of a system,” Williamson explains. “In our work, we use this idea to measure information that is spread out across many qubits by adding extra helper qubits and performing only local checks.” In practice, this means breaking down a complicated, global measurement into many small, local ones. By combining the outcomes of these local checks, the overall result can be reconstructed. This avoids the need for large, complex operations that would otherwise require many additional qubits. According to the study, the number of extra qubits required grows only slightly faster than the size of the measurement itself. This is a substantial improvement over earlier methods, where the overhead could increase much more rapidly. The approach is also flexible and can be applied to a wide range of quantum error-correcting codes. Barbara Terhal at the Technical University of Delft in the Netherlands highlights this point, noting that “the advance in this [work] is that it shows how to do this measurement in a reliable way for any of these codes, and also makes clear how many extra qubits are needed.” She adds that such measurements are essential because they enable the key steps of quantum computation. “By measuring these operators, you can perform all the key steps needed for a full quantum computation.” The method is particularly effective when implemented on highly connected structures that allow information to spread efficiently. Williamson notes that, “using this kind of highly connected structure reduces the number of extra qubits needed for fault-tolerant computation.” Future directions Despite its advantages, the new method does not remove all obstacles. One important trade-off involves time. Reducing the number of qubits can make computations take longer. Terhal explains, “There is an inevitable extra time cost when you try to reduce the number of qubits”. In some cases, a system with fewer qubits may need more time to complete a calculation, while one with more qubits could run faster. Finding the right balance remains an open problem. Quantum computing on the verge: correcting errors, developing algorithms and building up the user base Read more Another limitation is that the current study is largely theoretical. As Terhal points out, “[This work] focuses on the mathematical side and does not yet study how well the method performs in realistic simulations, which are very important for practice”. Further work will be needed to understand how the approach performs in real devices. Williamson says, “We are working on ways to reduce the cost even more,” including lowering both the number of qubits required and the time needed to perform computations. He also notes that the method “has already been used in several follow-up studies” and is expected to appear in early fault-tolerant quantum computers in the coming years. As quantum computing continues to advance, reducing the resources required for error correction will be crucial. By showing how to perform key operations with fewer qubits, the new work offers a promising step toward scalable and practical quantum machines. The research is described in Nature Physics. Want to read more? Registration is free, quick and easy Note: The verification e-mail to complete your account registration should arrive immediately. However, in some cases it takes longer. Don't forget to check your spam folder. If you haven't received the e-mail in 24 hours, please contact customerservices@ioppublishing.org. E-mail Address Register