Quantinuum and CU Boulder just made quantum error correction easier

For a quantum computer to be useful, it must be universal, have lots of qubits, and be able to detect and correct errors. The error correction step must be done so well that in the final calculations, you only see an error in less than one in a billion (or maybe even one in a trillion) tries. Correcting errors on a quantum computer is quite tricky, and most current error correcting schemes are quite expensive for quantum computers to run.

We’ve teamed up with researchers at the University of Colorado to make error correction a little easier – bringing the era of quantum ‘fault tolerance’ closer to reality. Current approaches to error correction involve encoding the quantum information of one qubit into several entangled qubits (called a “logical” qubit). Most of the encoding schemes (called a “code”) in use today are relatively inefficient – they can only make one logical qubit out of a set of physical qubits. As we mentioned earlier, we want lots of error corrected qubits in our machines, so this is highly suboptimal – a “low encoding rate” means that you need many, many more physical qubits to realize a machine with lots of error corrected logical qubits.

Ideally, our computers will have “high-rate” codes (meaning that you get more logical qubits per physical qubit), and researchers have identified promising schemes known as “non-local qLDPC codes”. This type of code has been discussed theoretically for years, but until now had never been realized in practice. In a new paper on the arXiv, the joint team has implemented a high rate non-local qLDPC code on our H2 quantum processor, with impressive results. 

The team used the code to create 4 error protected (logical) qubits, then entangled them in a “GHZ state” with better fidelity than doing the same operation on physical qubits – meaning that the error protection code improved fidelity in a difficult entangling operation. The team chose to encode a GHZ state because it is widely used as a system-level benchmark, and its better-than-physical logical preparation marks a highly mature system.

It is worth noting that this remarkable accomplishment was achieved with a very small team, half of whom do not have specialized knowledge about the underlying physics of our processors. Our hardware and software stack are now so mature that advances can be achieved by “quantum programmers” who don’t need advanced quantum hardware knowledge, and who can run their programs on a commercial machine between commercial jobs. This places us bounds ahead of the competition in terms of accessibility and reliability.

This paper marks the first time anyone has entangled 4 logical qubits with better fidelity than the physical analog. This work is in strong synergy with our recent announcement in partnership with Microsoft, where we demonstrated logical fidelities better than physical fidelities on entangled bell pairs and demonstrated multiple rounds of error correction.  These results with two different codes underscore how we are moving into the era of fault-tolerance ahead of the competition.

The code used in this paper is significantly more optimized for architectures capable of moving the qubits around, like ours. In practice, this means that we are capable of “non-local” gates and reconfigurability. A big advantage in particular is that some of the critical operations amount to a simple relabeling of the individual qubits, which is virtually error-free.

The biggest advantage, however, is in this code’s very high encoding rate. Unlike many codes in use today, this code offers a very high rate of logical qubits per physical qubit – in fact, the number of logical qubits is proportional to the number of physical qubits, which will allow our machines to scale much more quickly than more traditional codes that have a hard limit on the number of logical qubits one can get in each code block. This is yet another proof point that our machines will scale effectively and quickly.