Quantum error correction allows for quantum information to be preserved using logical qubits, which are subject to lower error rates than their constituent physical qubits. The degree of error suppression depends on the choice of error correcting code and distance, the underlying physical error rate, and the accuracy of the decoder. While traditional decoders utilise a binary (hard) syndrome, recent work shows that additional (soft) information captured during qubit readout can be effectively utilised to improve decoding accuracy. In this work, we present experimental results from a distance-three surface code implemented on transmon qubits, where we perform Z-stabiliser measurements to protect the state of the logical qubit against bit-flip errors. We initialise the logical qubit in one of 16 possible computational states representing the logical zero state, and perform repeated stabiliser checks over a variable number of rounds to preserve the state over time. We compare the decoding performance for a hard minimum-weight perfect matching decoder against a soft variant where rich measurement information is incorporated, and demonstrate an improved logical fidelity. Additionally, we employ a recurrent neural network decoder with both soft and hard variants and observe improved performance when soft information is used. The general nature of soft information makes it widely applicable to different physical qubit platforms, where it can be leveraged to shorten measurement times and improve the logical fidelity in quantum error correction experiments. Pre-print available at arXiv:2403.00706.

A practical quantum computer must not merely store information, but also process it. To prevent errors introduced by noise from multiplying and spreading, a fault-tolerant computational architecture is required. Current experiments are taking the first steps toward noise-resilient logical qubits. But to convert these quantum devices from memories to processors, it is necessary to specify how a universal set of gates is performed on them. The leading proposals for doing so, such as magic-state distillation and colour-code techniques, have high resource demands. Alternative schemes, such as those that use high-dimensional quantum codes in a modular architecture, have potential benefits, but need to be explored further.

We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3%for the {4, 5}-hyperbolic surface code in a phenomenological noise model (as compared with 2.9% for the toric code). In this code family, parity checks are of weight 4 and 5, while each qubit participates in four different parity checks. We introduce a family of semi-hyperbolic codes that interpolate between the toric code and the {4, 5}-hyperbolic surface code in terms of encoding rate and threshold. We show how these hyperbolic codes outperform the toric code in terms of qubit overhead for a target logical error probability. We show how Dehn twists and lattice code surgery can be used to read and write individual qubits to this quantum storage medium.