• Sovereignty gap G_gap = 0.1217 (non-eliminable) The framework is fully proved except for one open problem: the origin of α₀h = 0.8783. All proofs, corrections, and gap analysis openly available. #QuantumComputing #SurfaceCode #Research #OpenScience #LCL832

Researchers propose Cyclic Qubit Mappings (CQM), a dynamic compilation technique that cycles logical qubits across surface code tiles to guarantee average logical error rates, countering hardware heteroge... #QuantumErrorCorrection #SurfaceCode #Research iq.fp2.dev/ACxGu

On a 125-qubit superconducting processor, researchers teleported topological surface code logical qubits up to distance-7, mapped the teleportation phase diagram, and boosted entangling thresholds using e... #QuantumErrorCorrection #SurfaceCode #Research iq.fp2.dev/M5FRW

New syndrome extraction circuits for the surface code eliminate hook errors—correlated multi-qubit faults degrading logical performance—while preserving code distance at minimum depth across arbitrary har... #QuantumErrorCorrection #SurfaceCode #Informaq arxiv.org/abs/2603.01628…

Quantum benchmark challenge: 50 logical qubits demonstrated via surface-code prototypes in national lab facilities, validating fault-tolerance pathways .#FaultTolerance #SurfaceCode

quantum algorithms on real-world hardware. The researchers used a novel error-correction technique called #surfacecode, which allows them to correct errors in quantum information with high accuracy. This breakthrough could pave the way for the development of practical quantum

Preparing a 17 qubit #surfacecode device. @ETHZ_FIRSTLab is much more quite at this time of the day. To be installed at @psich_en tomorrow.

#Quantumerrorcorrection allows to correct for arbitrary quantum noise. But common codes such as the #surfacecode are best suited to iid unbiased noise. In this work, we tailor the surface code to non-independent and non-identically distributed errors. scirate.com/arxiv/2208.021…

> qubits n. For the #SurfaceCode, Darmawan and Poulin^{28,29} proposed an algorithm with a runtime exponential in n^{1/2} based on tensor networks, and simulated systems with up to 153 qubits. This algorithm can handle arbitrary noise (including, e.g., amplitude damping). >