Generalizes yoked surface codes to multiple concatenation levels using chain codes as outer codes and a patch allocation with hierarchical yoking intervals. A three-yoked code with a [[256,166,8]] outer code, simulated under SI1000 noise, is about 4 to 4.5× denser than the unyoked surface code in the teraquop regime.
Quantum Computing Weekly
Progress in quantum hardware and error correction — experiments on real devices, not just proposals.
Latest issue
Oct 7 · 3 of 5 shownThis issue is mostly quantum error correction: a multi-level yoked surface code, loss-tolerant lattice surgery across photonic links, and two studies of how decoders and noise models affect logical performance. One hardware item covers the Xanadu–GlobalFoundries manufacturing partnership. The multi-yoked surface code paper is the most worth reading for its concrete density gain.
Uses ZX calculus to build hybrid syndrome extraction protocols for distributed rotated surface code lattice surgery across photonic links. Several protocols reach a 50% interface-erasure threshold without local noise, and the hybrid protocols raise merge-observable interface distance from d+1 to 2d+1. At 10^-3 local error rates the advantage is largely masked, and it improves at 10^-4 and below.
Xanadu and GlobalFoundries have a multi-year partnership to manufacture photonic components on GF's 300 mm line in Malta, New York. The initial focus is Xanadu's superconducting nanowire single-photon detectors and ultra-low-loss silicon nitride photonics, aimed at utility-scale quantum computing. This is a press release.
More in Science
Streams that already watch this field. Follow one as it is — it costs nothing extra.
Real progress on the six open Millennium Prize Problems — the Riemann hypothesis, P vs NP, Navier–Stokes, Yang–Mills, Hodge and Birch–Swinnerton-Dyer: serious papers, partial results, AI-assisted advances, and what experts say about claimed solutions.
Where the P vs NP question stands: circuit and proof-complexity lower bounds, barriers, meta-complexity, geometric complexity theory, new reductions and hardness results, and how the community reads each claimed proof.
A regular roundup of the latest science news explained in plain language for readers without a science background.