Fault-tolerant quantum error correction using error weight parities

Tansuwannont, Theerapat; Leung, Debbie

doi:10.1103/physreva.104.042410

Cited by 12 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, we also have a P 1 Pauli correction required depending on the value of the first ancilla qubit measured the Z basis. Lastly, we point out that using flag based methods [7,[27][28][29][30][31][32][33][34][35][36][37][38][39] to measure the elongated checks and weightfive twist defects would require an extra two-qubit gate between the ancillas instead of a single CNOT. As such, an extra idling time would be required resulting in slower algorithm runtimes.…”

Section: Discussionmentioning

confidence: 99%

A circuit-level protocol and analysis for twist-based lattice surgery

Chamberland,

Campbell

2022

Preprint

View full text Add to dashboard Cite

Lattice surgery is a measurement-based technique for performing fault-tolerant quantum computation in two dimensions. When using the surface code, the most general lattice surgery operations require lattice irregularities called twist defects. However, implementing twist-based lattice surgery may require additional resources, such as extra device connectivity, and could lower the threshold and overall performance for the surface code. Here we provide an explicit twist-based lattice surgery protocol and its requisite connectivity layout. We also provide new stabilizer measurement circuits for measuring twist defects which are compatible with our chosen gate scheduling. We undertake the first circuit-level error correction simulations during twist-based lattice surgery using a biased depolarizing noise model. Our results indicate a slight decrease in the threshold for timelike logical failures compared to lattice surgery protocols with no twist defects in the bulk. However, comfortably below threshold (i.e. with CNOT infidelities below 5 × 10 −3 ), the performance degradation is mild and in fact preferable over proposed alternative twist-free schemes. Lastly, we provide an efficient scheme for measuring Y operators along boundaries of surface codes which bypasses certain steps that were required in previous schemes.

show abstract