Post

Joschka Roffe
@qec.codes

📢 New paper. 𝗡𝗲𝗮𝗿𝗲𝘀𝘁-𝗻𝗲𝗶𝗴𝗵𝗯𝗼𝘂𝗿 𝗴𝗮𝘁𝗲𝘀 𝗮𝗿𝗲 𝗮𝗹𝗹 𝘆𝗼𝘂 𝗻𝗲𝗲𝗱: 𝗛𝗶𝗴𝗵-𝗿𝗮𝘁𝗲 𝗾𝘂𝗮𝗻𝘁𝘂𝗺 𝗹𝗼𝘄-𝗱𝗲𝗻𝘀𝗶𝘁𝘆 𝗽𝗮𝗿𝗶𝘁𝘆-𝗰𝗵𝗲𝗰𝗸 𝗰𝗼𝗱𝗲𝘀 𝗼𝗻 𝗮 𝗽𝗹𝗮𝗻𝗮𝗿 𝗴𝗿𝗶𝗱. scirate.com/arxiv/2606.1... 𝘁𝗹𝗱𝗿; For several years now, we have been advocating for qLDPC codes as a resource-efficient alternative to the surface code. 1/3

scirate.comNearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar gridHigh-performance quantum low-density parity-check codes promise substantial reductions in the overhead of fault-tolerant quantum computation, but most constructions require long-range connectivity or ...
Joschka Roffe
@qec.codes

But this has always come with the caveat that they require long-range interactions, making them far harder to engineer into practical quantum computing systems. In this work we show we can have the best of both worlds: efficient qLDPC codes that can be implemented on a planar 2D grid of qubits. 2/3

Joschka Roffe
@qec.codes

This is not a marginal improvement: instances of the code family we introduce can reduce qubits by up to an order of magnitude relative to the rotated surface code, and our circuit-level numerical simulations demonstrate improvements in logical error rate suppression by a factor of up to 1000x. 3/3

0 reposts1 like

No replies yet.