{ "last_updated": "2026-10-16T13:46:49+02:00", "2026-10-16": { "word_cloud": [ { "word": "Magic", "weight": 5 }, { "word": "Surface", "weight": 4 }, { "word": "Readout", "weight": 4 }, { "word": "Decoding", "weight": 4 }, { "word": "Lattice", "weight": 3 }, { "word": "Surgery", "weight": 3 }, { "word": "Qudits", "weight": 2 }, { "word": "Leakage", "weight": 2 }, { "word": "Simulation", "weight": 3 }, { "word": "Triorthogonal", "weight": 2 }, { "word": "LDPC", "weight": 3 }, { "word": "Debugging", "weight": 2 }, { "word": "Concatenation", "weight": 3 }, { "word": "Energy", "weight": 2 }, { "word": "Monitored", "weight": 2 } ], "social_highlights": "Highlights: stitched surface codes on Willow, patchwork lattice-surgery compilation, Clifford-cost magic factory simulation, qLDPC noise stability, Standard Model triorthogonal codes, spin-qubit energetics, SynDebug debugging, readout-error decoding, infinite magic and the continuum, and monitored circuits surviving readout errors.", "papers": [ { "arxiv_id": "2610.21357", "title": "Stitched surface codes: planar concatenation through GHZ corridors", "authors": "Mohamed A. Shalby, Alexandre Bourassa, Amir Karamlou, Leigh Martin, Alexis Morvan, Nicholas Noll, Craig Gidney, Leonid P. Pryadko", "arxiv_url": "https://arxiv.org/abs/2610.21357", "pdf_url": "https://arxiv.org/pdf/2610.21357.pdf", "summary": "The paper concatenates four distance-$t$ rotated surface-code patches with the $[[4,2,2]]$ outer code, encoding two logical qubits at distance $d=2t$ on a square lattice with nearest-neighbor connectivity. Outer stabilizers $XXXX$ and $ZZZZ$ are measured in situ via verified GHZ ancillae routed through narrow corridors, with hyperedge faults decomposing into graphlike components so a single MWPM pass decodes the syndrome. Circuit-level simulations show logical error scaling as $p^t$, and an experiment on a 105-qubit Willow processor shows a factor 1.52 reduction in block logical error rate from $d=4$ to $d=6$.", "motivation": "Concatenated codes were historically the first route to fault tolerance, but they typically require non-local connectivity that fixed 2D superconducting hardware lacks. Showing concatenation on a planar nearest-neighbor lattice opens a near-term testbed for architectures beyond the standard surface code.", "highlights": [ "Encodes $k=2$ logical qubits at distance $d=2t$ in footprint $N<2(2t+1)^2$ with nearest-neighbor connectivity", "Outer $[[4,2,2]]$ checks measured via verified GHZ ancillae in corridors, decodable by one MWPM pass", "Willow experiment: increasing $d=4$ to $d=6$ reduces block logical error rate by factor 1.52" ], "keywords": [ { "label": "Surface Codes", "reason": "Inner code patches are rotated surface codes on a square lattice" }, { "label": "Concatenation", "reason": "Combines $[[4,2,2]]$ outer code with surface-code inner patches" }, { "label": "GHZ Ancillae", "reason": "Verified GHZ states measure high-weight outer stabilizers through corridors" }, { "label": "Matching Decoder", "reason": "Hyperedge faults decompose into graphlike parts decodable by MWPM" } ], "emoji": "🧵", "social_summary": "Stitches four surface-code patches with an outer $[[4,2,2]]$ code via GHZ corridors, demonstrating concatenated memory on Google's 105-qubit Willow processor.", "highlights_oneliner": "Planar concatenated surface codes via GHZ corridors" }, { "arxiv_id": "2610.22112", "title": "Patchwork: automated lattice surgery and space-time partitioning for real-time decoding", "authors": "Christopher Chamberland, Muyuan Li, Scott Thornton, Justin Gage Lietz, Melody Ren, Antonio deMarti iOlius", "arxiv_url": "https://arxiv.org/abs/2610.22112", "pdf_url": "https://arxiv.org/pdf/2610.22112.pdf", "summary": "The paper introduces patchwork, a lattice-surgery compiler for arbitrary multi-qubit Pauli measurements on a narrow-corridor 2D surface-code layout, with geometric rules for stabilizer placement and gate scheduling, including logical $Y$ measurements via twist defects. A wavefront algorithm partitions merged patches into space-time commit, buffer, and cleanup regions for parallel decoding. Simulations of three sequential Pauli measurements on ten logical qubits show staged decoding reaches failure probabilities close to monolithic decoding.", "motivation": "Lattice surgery is the standard way to perform logical operations on 2D local-connectivity hardware, but compiling it systematically while preserving code distance is hard. Growing merged patches also make decoding a bottleneck, so real-time scalable decoding must be tied to circuit construction.", "highlights": [ "Systematic geometric rules and schedules preserve full effective distance for $Y$ measurements for all tested $d\\leq 11$", "Wavefront algorithm partitions merged patches into space-time commit, buffer, and cleanup regions", "Staged decoding on ten logical qubits matches monolithic decoding failure probabilities closely" ], "keywords": [ { "label": "Lattice Surgery", "reason": "Core operation compiled for multi-qubit Pauli measurements" }, { "label": "Compilation", "reason": "Automated framework generates stabilizers and schedules" }, { "label": "Parallel Decoding", "reason": "Space-time partitioning enables real-time staged decoding" }, { "label": "Twist Defects", "reason": "Used for logical $Y$ measurements with preserved distance" } ], "emoji": "🧩", "social_summary": "Introduces patchwork, a lattice-surgery compiler with space-time partitioning that enables parallel real-time decoding while matching monolithic decoder performance.", "highlights_oneliner": "Automated lattice surgery with parallel decoding partitions" }, { "arxiv_id": "2610.22315", "title": "Magna: simulating magic state factories as cheaply as Clifford circuits", "authors": "Yifei Wang, Yingfei Gu", "arxiv_url": "https://arxiv.org/abs/2610.22315", "pdf_url": "https://arxiv.org/pdf/2610.22315.pdf", "summary": "The paper presents magna, a classical simulator that expresses acceptance rate and output fidelity of magic state protocols as tensor networks reduced globally via a correspondence with transversal gates. It supports feedforward conditioned on arbitrary functions of measurement outcomes, including decoder outputs. It simulates Bravyi-Haah distillation with up to 100 outputs at non-exponential cost and achieves state-of-the-art sampling for distance-5 cultivation on color and $\\mathbb{RP}^2$ surface codes.", "motivation": "Magic state factories are essential for fault-tolerant computation but are hard to simulate classically due to heavy non-Clifford content. Existing simulators restrict gates or feedforward, limiting large-scale evaluation and optimization of factories.", "highlights": [ "Cost does not grow exponentially with the number of output magic states in Bravyi-Haah distillation (up to 100 outputs)", "State-of-the-art sampling times for distance-5 cultivation on color codes and $\\mathbb{RP}^2$ surface codes", "Validates nonlinear feedforward with 15 rounds of decoder-dependent corrections" ], "keywords": [ { "label": "Magic States", "reason": "Simulator targets distillation, cultivation, and code-switching factories" }, { "label": "Tensor Networks", "reason": "Figures of merit expressed and globally reduced as networks" }, { "label": "Simulation", "reason": "Clifford-like cost for non-Clifford-heavy protocols" }, { "label": "Feedforward", "reason": "Supports arbitrary decoder-conditioned classical control" } ], "emoji": "🪄", "social_summary": "Simulates magic state factories at Clifford-circuit cost using tensor networks, supporting arbitrary decoder-dependent feedforward across distillation, cultivation, and code switching.", "highlights_oneliner": "Cheap tensor-network simulation of magic state factories" }, { "arxiv_id": "2610.22357", "title": "Stability of Quantum LDPC States under Local Pauli Noise", "authors": "Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay, Jong Yeon Lee", "arxiv_url": "https://arxiv.org/abs/2610.22357", "pdf_url": "https://arxiv.org/pdf/2610.22357.pdf", "summary": "The paper proves that for the normalized code-projector state of a $\\mathbb{Z}_d$ qLDPC stabilizer code under local Pauli noise, conditional mutual information $I(A:C|B)$ across a buffer decays exponentially with buffer width in both weak and strong noise regimes. Under a space-uniformity assumption it establishes robustness of Levin-Wen topological entropy, and on finite-dimensional lattices of size $n$ it implies a constant-layer quasi-local Petz recovery channel of range $O(\\mathrm{poly}(\\log n)/\\varepsilon)$.", "motivation": "Mixed-state phases of matter lack a spectral-gap analogue, and spatial decay of CMI has emerged as the key diagnostic of stability. Understanding this for general qLDPC code states connects quantum error correction with many-body physics beyond lattice geometries.", "highlights": [ "Exponential CMI decay in buffer width at weak noise for full-system tripartitions, independent of system size", "At strong noise, exponential decay holds whenever the buffer supports no logical operator", "Weak-noise bound yields quasi-local Petz recovery of range $O(\\mathrm{poly}(\\log n)/\\varepsilon)$ on finite-dimensional lattices" ], "keywords": [ { "label": "qLDPC Codes", "reason": "Results apply to general qLDPC interaction graphs" }, { "label": "Mixed-State Phases", "reason": "CMI decay serves as stability criterion for noisy phases" }, { "label": "Conditional Mutual Information", "reason": "Central diagnostic proven to decay exponentially" }, { "label": "Petz Recovery", "reason": "Quasi-local recovery channel constructed from CMI bound" } ], "emoji": "🌫️", "social_summary": "Proves exponential decay of conditional mutual information in noisy qLDPC code states, giving a general criterion for mixed-state phase stability and quasi-local recovery.", "highlights_oneliner": "Mixed-state stability of noisy qLDPC code states" }, { "arxiv_id": "2610.21879", "title": "One generation of the Standard Model as a quantum error-correcting code", "authors": "Shiroman Prakash, K. L. Ramya", "arxiv_url": "https://arxiv.org/abs/2610.21879", "pdf_url": "https://arxiv.org/pdf/2610.21879.pdf", "summary": "The paper shows that anomaly cancellation for one Standard Model generation, the vanishing of a cubic form, coincides with the defining property of triorthogonal codes. Removing the right-handed neutrino gives a $[[15,1,3]]_p$ code for every prime $p$, including the Bravyi-Kitaev code at $p=2$. For qutrits it is the unique shortest distance-three triorthogonal code.", "motivation": "The five-bit labelling of Standard Model fermions and anomaly cancellation have been understood group-theoretically, but no connection to quantum codes was known. Linking them reveals a new family of triorthogonal qudit codes relevant to magic state distillation.", "highlights": [ "Anomaly cancellation is the same cubic equation defining triorthogonal codes", "Yields a $[[15,1,3]]_p$ code for every prime $p$, recovering Bravyi-Kitaev at $p=2$", "Qutrit instance is the unique shortest distance-three triorthogonal code" ], "keywords": [ { "label": "Triorthogonal Codes", "reason": "Anomaly cancellation maps onto their defining cubic condition" }, { "label": "Magic States", "reason": "Codes support transversal non-Clifford gates for distillation" }, { "label": "Qudits", "reason": "Construction yields new codes on $p$-level systems" }, { "label": "Standard Model", "reason": "Fermion content of one generation forms the code" } ], "emoji": "⚛️", "social_summary": "Reveals that one generation of Standard Model fermions forms a triorthogonal quantum code, recovering the Bravyi-Kitaev code and a new family of qudit codes.", "highlights_oneliner": "Standard Model generation is a triorthogonal code" }, { "arxiv_id": "2610.22199", "title": "Energetics of Fault-Tolerant Spin-Qubit Quantum Computation", "authors": "João Santos, Jayshankar Nath, Marco Pezzutto, Valentin Savin, Tristan Meunier, Yasser Omar", "arxiv_url": "https://arxiv.org/abs/2610.22199", "pdf_url": "https://arxiv.org/pdf/2610.22199.pdf", "summary": "The paper builds a detailed energy budget for a Loss-DiVincenzo spin-qubit quantum computer running the QFT, benchmarked against the classical FFT, and adds surface-code QEC costs including QEC cycles, gate synthesis, and decoding. Cryogenic cooling dominates the baseline, while at scale instrumentation and decoding dominate. Optimizing control-signal demultiplexing cuts total energy by about two orders of magnitude, giving roughly 100 kW for one million physical qubits.", "motivation": "Energy efficiency is increasingly important for large-scale quantum computers, yet fault-tolerant energy costs are poorly quantified. Understanding where power goes in spin-qubit systems guides scalable, energetically competitive design.", "highlights": [ "Energy crossover with classical FFT occurs at smaller problem sizes than the time crossover", "Optimizing control-signal demultiplexing ratio reduces overall energy cost by about two orders of magnitude", "About one million physical qubits estimated at roughly 100 kW, over an order of magnitude below top classical systems" ], "keywords": [ { "label": "Spin Qubits", "reason": "Loss-DiVincenzo silicon spin-qubit platform is analyzed" }, { "label": "Energy Budget", "reason": "Core contribution is power and energy accounting" }, { "label": "Surface Codes", "reason": "QEC cycle, synthesis, and decoding energy are included" }, { "label": "Decoding", "reason": "Decoder energy becomes dominant at scale" } ], "emoji": "🔋", "social_summary": "Quantifies the energy cost of fault-tolerant spin-qubit computing, showing demultiplexing optimization cuts energy by two orders of magnitude to about 100 kW at a million qubits.", "highlights_oneliner": "Energy budget of fault-tolerant spin-qubit computers" }, { "arxiv_id": "2610.22275", "title": "SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs", "authors": "Nicholas S. DiBrita, Jack Lange, Tirthak Patel", "arxiv_url": "https://arxiv.org/abs/2610.22275", "pdf_url": "https://arxiv.org/pdf/2610.22275.pdf", "summary": "SynDebug is a systems-level debugging framework for fault-tolerant quantum programs, introducing lightweight assertion-based primitives that operate directly within encoded FTQC infrastructures without extra logical surface area. Evaluated across multiple QEC code families, distances, and workloads including state preparation, entanglement validation, and Shor-style programs, it incurs 1.8% average depth overhead and no measurable logical error increase.", "motivation": "QEC infrastructure adds substantial complexity, making logic bugs hard to find, and existing debugging targets logical-level circuits only. Practical software reliability tooling is needed for large-scale FTQC.", "highlights": [ "First systems-level debugging framework operating inside encoded FTQC execution flows", "Average 1.8% additional circuit depth overhead, 0% in most cases", "No measurable increase in logical error rate across code families and distances" ], "keywords": [ { "label": "Debugging", "reason": "Framework targets logic bugs in quantum programs" }, { "label": "Assertions", "reason": "Lightweight assertion primitives check encoded states" }, { "label": "FTQC Software", "reason": "Operates within realistic fault-tolerant execution flows" }, { "label": "Code Families", "reason": "Evaluated across multiple QEC codes and distances" } ], "emoji": "🐞", "social_summary": "Introduces SynDebug, the first systems-level debugger for fault-tolerant quantum programs, using assertions inside encoded circuits with only 1.8% depth overhead.", "highlights_oneliner": "Assertion-based debugging for fault-tolerant quantum programs" }, { "arxiv_id": "2610.20810", "title": "Syndrome-Resolved Decoding of Qubit Readout Errors", "authors": "Han Zheng, Vladimir Pešić, Nikolay Gusarov, Andrea Lizzit, Taketo Imaizumi, Chulwoo Ahn, Marco Nicolas Mueller, Raymond Mencia, Edoardo Charbon, Vladimir E. Manucharyan", "arxiv_url": "https://arxiv.org/abs/2610.20810", "pdf_url": "https://arxiv.org/pdf/2610.20810.pdf", "summary": "The paper introduces the Readout Error Decoder (RED), which converts repeated thresholded binary readout records into a channel-resolved error budget separating assignment errors, bit flips, and leakage. Controlled error injections validate its channel-specific response, and it is demonstrated on fluxonium and transmon qubits across distinct leakage-lifetime regimes without dedicated discrimination of non-computational states.", "motivation": "Conventional fidelity and repeatability metrics hide which readout error mechanisms dominate, though each needs different mitigation. Channel-resolved characterization enables targeted readout optimization critical for quantum error correction.", "highlights": [ "Decomposes readout error into assignment, bit-flip, and leakage channels from repeated readouts", "Validated via controlled error injections with channel-specific decoder response", "Works on both fluxonium and transmon qubits without discriminating non-computational states" ], "keywords": [ { "label": "Readout Errors", "reason": "Paper decomposes readout error into distinct channels" }, { "label": "Leakage", "reason": "Leakage lifetimes regimes are identified and resolved" }, { "label": "Repeated Readout", "reason": "Temporal correlations across readouts drive the decoder" }, { "label": "Superconducting Qubits", "reason": "Demonstrated on fluxonium and transmon devices" } ], "emoji": "📡", "social_summary": "Decodes repeated qubit readouts into a channel-resolved error budget, separating assignment errors, bit flips, and leakage on fluxonium and transmon devices.", "highlights_oneliner": "Channel-resolved decoding of qubit readout errors" }, { "arxiv_id": "2610.20790", "title": "Infinite magic and the emergence of the continuum", "authors": "Leo Shaposhnik, Lorenzo Leone, Lennart Bittel, Dimitris Saraidaris, Alexander Jahn, Jens Eisert", "arxiv_url": "https://arxiv.org/abs/2610.20790", "pdf_url": "https://arxiv.org/pdf/2610.20790.pdf", "summary": "The paper links the type classification of hyperfinite von Neumann algebras to nonstabilizerness (magic). It proves that stabilizer systems on a lattice yield local algebras with no type III factors, and that for Araki-Woods-Powers factors the limit is type III if and only if the locally optimized min-relative entropy of magic diverges.", "motivation": "Understanding which quantum-state resources are required for a relativistic quantum field theory to emerge from a lattice system is a foundational question connecting quantum information and algebraic QFT. Magic is the key resource beyond stabilizer (Clifford-simulable) states, so quantifying its role in the continuum limit has implications for the structure of quantum field theories and their simulability.", "highlights": [ "Stabilizer systems on a lattice produce local von Neumann algebras with no type III factors in their central decomposition", "For short-range-ordered stabilizer systems, local algebras are tensor products of hyperfinite type I or type II factors", "A hyperfinite AWP factor is type III if and only if the locally optimized min-relative entropy of magic diverges, so emergence of a continuum requires infinite magic" ], "keywords": [ { "label": "Magic", "reason": "Nonstabilizerness is the central resource whose divergence is shown to be necessary for type III factors." }, { "label": "Stabilizer States", "reason": "Stabilizer systems are proven to yield algebras without type III factors, forbidding a QFT limit." }, { "label": "Von Neumann Algebras", "reason": "The type I/II/III classification of hyperfinite factors provides the mathematical framework for the results." }, { "label": "Relative Entropy", "reason": "The locally optimized min-relative entropy of magic quantifies the divergence tied to type III emergence." } ], "emoji": "✨", "social_summary": "Prove that a relativistic continuum emerging from a lattice requires infinite magic, linking nonstabilizerness to the type III von Neumann algebras of quantum field theory.", "highlights_oneliner": "Infinite magic needed for continuum QFT" }, { "arxiv_id": "2610.20712", "title": "Surviving readout errors and incomplete postselection in monitored quantum circuits", "authors": "Murtaza Ali Mir, Teemu Ojanen, Ali G. Moghaddam", "arxiv_url": "https://arxiv.org/abs/2610.20712", "pdf_url": "https://arxiv.org/pdf/2610.20712.pdf", "summary": "The paper studies how readout errors, which make postselection effectively incomplete, affect monitored $U(1)$-symmetric quantum circuits. The charge-sharpening transition survives at finite error rate, with vanishing fluctuations replaced by a steady-state plateau and a shallow minimum in charge fluctuations near the ideal transition. A decomposition into quantum and classical fluctuation contributions yields a minimal mitigation framework to locate the transition from experimental data.", "motivation": "Measurement-induced phase transitions in monitored circuits are a central topic, but experimental realizations face imperfect readout that corrupts the conditioning on measurement records. Mid-circuit measurement errors are harder to mitigate than end-of-circuit ones, so understanding whether the transitions remain observable is crucial for experiments.", "highlights": [ "Charge-sharpening transition survives at a finite readout error rate, with a finite steady-state plateau replacing vanishing fluctuations", "Charge fluctuations show a shallow minimum near the ideal transition point due to competition between measurement-induced purification and noise-induced mixing", "Decomposing fluctuations into quantum and classical parts gives a mitigation framework and a way to locate the transition directly from experimental data" ], "keywords": [ { "label": "Readout Errors", "reason": "Imperfect measurement records corrupting postselection are the central noise source studied." }, { "label": "Monitored Circuits", "reason": "The study concerns dynamics of quantum circuits under mid-circuit measurements." }, { "label": "Charge Sharpening", "reason": "The $U(1)$ charge-sharpening transition is the phenomenon shown to survive noise." }, { "label": "Error Mitigation", "reason": "The fluctuation decomposition provides a minimal mitigation framework for mid-circuit readout errors." } ], "emoji": "📡", "social_summary": "Show that charge-sharpening transitions in monitored circuits survive readout errors, leaving a detectable fluctuation minimum and offering a route to locate transitions in noisy experiments.", "highlights_oneliner": "Charge sharpening survives noisy readout" } ] }, "2026-10-15": { "word_cloud": [ { "word": "Magic", "weight": 5 }, { "word": "LDPC", "weight": 4 }, { "word": "Tomography", "weight": 4 }, { "word": "Coherent", "weight": 3 }, { "word": "Modular", "weight": 3 }, { "word": "Cultivation", "weight": 4 }, { "word": "Anyons", "weight": 3 }, { "word": "Qudit", "weight": 2 }, { "word": "Leakage", "weight": 2 }, { "word": "Entropy", "weight": 2 }, { "word": "Recovery", "weight": 2 }, { "word": "Postselection", "weight": 3 }, { "word": "Benchmarking", "weight": 2 }, { "word": "Topological", "weight": 2 }, { "word": "Decoupling", "weight": 2 } ], "social_highlights": "Highlights: Cornucopia modular architecture, polynomial-minor qLDPC codes, logical CCZ cultivation, gap-priced T-state factories, logical gate set and coherent-noise tomography, Petz recovery, leakage benchmarking, qudit dynamical decoupling, stabilizer entropy cones, chiral semion algebras, monitored anyon chains.", "papers": [ { "arxiv_id": "2610.19073", "title": "A modular quantum computer based on Cornucopia codes", "authors": "Zhide Lu, Weikang Li, Yinghao Ma, Hanyu Yan, Bingrun Wang, Yixuan Ma, Zheng-Zhi Sun, Dong-Ling Deng", "arxiv_url": "https://arxiv.org/abs/2610.19073", "pdf_url": "https://arxiv.org/pdf/2610.19073.pdf", "summary": "The paper proposes the Cornucopia architecture, a modular fault-tolerant quantum computer built from $[[2844,1426,18]]$ Cornucopia code blocks connected by bridges. Using the code's translation symmetry, reusable gadgets individually address 1,422 logical qubits per block and support three universal logical instruction sets. A module needs on average 4.1 physical qubits per logical qubit versus 3.0 for memory alone, excluding magic-state factories.", "motivation": "Ultra-high-rate codes store many logical qubits cheaply, but universal computation on individually addressable logical qubits typically requires ancilla overhead that erodes this advantage. This work seeks to preserve the high encoding rate while enabling universal logical operations at low overhead.", "highlights": [ "Modular architecture with blocks of $[[2844,1426,18]]$ Cornucopia codes connected by bridges", "Translation-symmetry gadgets individually address 1,422 logical qubits per block with three universal instruction sets", "Average 4.1 physical qubits per logical qubit for universal computation versus 3.0 for memory alone" ], "keywords": [ { "label": "Cornucopia Codes", "reason": "The ultra-high-rate code family underlying the whole architecture." }, { "label": "Modular Architecture", "reason": "Code blocks linked by bridges form a scalable fault-tolerant computer." }, { "label": "Logical Gadgets", "reason": "Reusable gadgets address individual logical qubits within a block." }, { "label": "Qubit Overhead", "reason": "Central metric: 4.1 physical per logical qubit for universal computation." } ], "emoji": "🏗️", "social_summary": "Proposes a modular quantum computer from ultra-high-rate Cornucopia code blocks, achieving universal logical computation at about 4.1 physical qubits per logical qubit.", "highlights_oneliner": "Modular universal computer from Cornucopia codes" }, { "arxiv_id": "2610.19459", "title": "Quantum LDPC Codes from Polynomial Minors", "authors": "Vahid Nourozi, Roxana Smarandache, David G. M. Mitchell", "arxiv_url": "https://arxiv.org/abs/2610.19459", "pdf_url": "https://arxiv.org/pdf/2610.19459.pdf", "summary": "The paper constructs CSS quantum codes from cyclic-code codewords and the minors of a $2\\times 3$ polynomial matrix, where the minors automatically satisfy CSS orthogonality. Code dimension is derived from gcds of entries and minors, with residue conditions enabling dimension control. Explicit constructions yield 13 codes with verified distances, including $[[255,80,12]]$.", "motivation": "Algebraic quantum LDPC constructions such as bicycle, generalized bicycle, lifted-product and bivariate bicycle codes have produced strong codes, but systematic ways to control dimension remain valuable. Polynomial minors offer a new route to guaranteed orthogonality and tunable code parameters.", "highlights": [ "Minors of a $2\\times 3$ polynomial matrix give CSS-orthogonal check matrices for any polynomial choice", "Dimension formula via gcds, simplified for odd lifting factor $N$, with residue conditions for targeting a dimension", "13 explicit codes with verified minimum distance, including $[[255,80,12]]$ and $[[189,58,10]]$" ], "keywords": [ { "label": "Quantum LDPC", "reason": "The constructed codes belong to the quantum LDPC family." }, { "label": "CSS Codes", "reason": "Construction is built around the CSS orthogonality condition." }, { "label": "Cyclic Codes", "reason": "Codewords of cyclic codes supply the polynomial entries." }, { "label": "Polynomial Minors", "reason": "Minors of the polynomial matrix generate the second check matrix." } ], "emoji": "🧮", "social_summary": "Constructs quantum LDPC codes from minors of polynomial matrices, giving controllable dimension and new codes such as a $[[255,80,12]]$ code with rate about 0.31.", "highlights_oneliner": "Quantum LDPC codes via polynomial minors" }, { "arxiv_id": "2610.20591", "title": "Logical CCZ state cultivation", "authors": "Yuta Hirasaki, Jong Yeon Lee", "arxiv_url": "https://arxiv.org/abs/2610.20591", "pdf_url": "https://arxiv.org/pdf/2610.20591.pdf", "summary": "The paper introduces an end-to-end protocol for direct $CCZ$-state preparation on bivariate tricycle and bicycle (BT/BB) codes, using native cup-product $CCZ$ gates and projection-preserving lifts. Index-2 lifted BB ancillas enable selective $Z$-basis initialization, and states are transferred to index-3 lifted BB memories with decoder-based postselection. Simulations under neutral-atom-motivated noise give infidelities of $1.84\\times10^{-5}$ at $21.94\\%$ acceptance and $4.10\\times10^{-7}$ at $8.89\\%$ acceptance.", "motivation": "Toffoli gates for fault-tolerant arithmetic need $CCZ$ states, which are conventionally obtained by converting four cultivated $T$ states, incurring extra overhead. A direct cultivation route on qLDPC codes could reduce the spacetime cost.", "highlights": [ "Cup-product $CCZ$ gates on BT codes with lifted BB ancillas directly prepare two disjoint logical $CCZ$ states", "Exact circuit-level simulations give infidelity $4.10\\times10^{-7}$ at $8.89\\%$ acceptance", "Estimated spacetime cost per $CCZ$ state is lower than $T$-state cultivation followed by conversion" ], "keywords": [ { "label": "Magic States", "reason": "The factory produces logical $CCZ$ resource states." }, { "label": "Cultivation", "reason": "Prepares and verifies states in small codes before transfer, with postselection." }, { "label": "Tricycle Codes", "reason": "BT codes provide native cup-product $CCZ$ gates." }, { "label": "Postselection", "reason": "Decoder-based postselection yields high-fidelity outputs at low overhead." } ], "emoji": "🌱", "social_summary": "Introduces a direct logical CCZ state cultivation protocol on tricycle and bicycle codes that beats T-state cultivation plus conversion in estimated spacetime cost.", "highlights_oneliner": "Direct CCZ cultivation on tricycle codes" }, { "arxiv_id": "2610.19034", "title": "Logical gate set tomography", "authors": "Piper C. Wysocki, Juan Gonzalez De Mendoza, Karl Mayer, Natalie C. Brown, Ciaran Ryan-Anderson, Jalan A. Ziyad, Jordan H. Hines, Daniel G. Hothem, Corey I. Ostrove, Timothy J. Proctor, Kevin C. Young, Robin J. Blume-Kohout, Charles H. Baldwin, Kenneth M. Rudinger", "arxiv_url": "https://arxiv.org/abs/2610.19034", "pdf_url": "https://arxiv.org/pdf/2610.19034.pdf", "summary": "The paper introduces logical gate set tomography, producing detailed noisy representations of logical operations and enabling tests for non-Markovian and coherent logical errors. It gives the first full self-consistent characterization of a universal single-qubit logical gate set in the Steane code on Quantinuum H1. Emulator data reveal weak logical non-Markovianity and coherent errors, and error attribution links physical sources to logical error mechanisms.", "motivation": "As experimental QEC moves to fault-tolerant logical operations, predicting computational success requires knowing the structure, not just the rate, of residual logical noise. Assumptions such as Markovianity of logical gates need direct experimental tests.", "highlights": [ "First self-consistent GST characterization of a universal logical gate set in the $[[7,1,3]]$ Steane code on a trapped-ion processor", "Experiment shows mostly Pauli-stochastic logical errors with no evidence of non-Markovianity; emulator reveals weak non-Markovianity and coherent error", "Error attribution with the emulator ties specific physical error sources to logical error mechanisms" ], "keywords": [ { "label": "Gate Set Tomography", "reason": "Core method extended to logical qubits." }, { "label": "Steane Code", "reason": "The $[[7,1,3]]$ code hosts the characterized logical gate set." }, { "label": "Non-Markovianity", "reason": "Tested via GST fit quality on logical data." }, { "label": "Coherent Errors", "reason": "Detected as weak signatures in experiment and strong evidence in emulation." } ], "emoji": "🔬", "social_summary": "Introduces logical gate set tomography and uses it on a trapped-ion Steane code to characterize logical gate noise, probing non-Markovian and coherent errors.", "highlights_oneliner": "Tomography of noisy logical gates" }, { "arxiv_id": "2610.19299", "title": "Gap-Priced $|T\\rangle$-States: Dynamic $|T\\rangle$ Post-Selection and Budget-Aware Factory Provisioning", "authors": "Maxwell Poster, Sayam Sethi, Yuhao Liu, Jonathan Baker, Costin Iancu", "arxiv_url": "https://arxiv.org/abs/2610.19299", "pdf_url": "https://arxiv.org/pdf/2610.19299.pdf", "summary": "The paper presents GP$|T\\rangle$-S, a lattice surgery scheduler and factory allocator that co-optimizes cultivation and distillation under a total $T$-error budget. It uses the complementary gap of cultivated states as a fidelity estimate to dynamically tune post-selection, introduces cultivating factories, and allocates factories via dynamic programming. Across sixteen benchmarks it achieves a 5.5$\\times$ geometric-mean speedup in logical cycles and 3.4$\\times$ reduction in space-time volume.", "motivation": "Magic-state preparation dominates fault-tolerant cost on surface codes, yet cultivation and distillation are usually provisioned statically, leaving error budget unused. Jointly exploiting budget slack could convert unused accuracy into speed.", "highlights": [ "Complementary gap of each cultivated state used as a fidelity estimate to dynamically adjust the post-selection cutoff", "Cultivating factories embed cultivation in routing channels, matching two-level distillation fidelity at single-level footprint", "5.5$\\times$ geometric-mean speedup in logical cycles and 3.4$\\times$ space-time volume reduction across sixteen benchmarks" ], "keywords": [ { "label": "Magic States", "reason": "Paper targets $T$-state supply for fault-tolerant computation." }, { "label": "Lattice Surgery", "reason": "Scheduler operates on lattice surgery surface-code architectures." }, { "label": "Distillation", "reason": "Factory catalog and allocation for distillation factories." }, { "label": "Error Budget", "reason": "Total $T$-error budget drives dynamic post-selection and provisioning." } ], "emoji": "🏭", "social_summary": "Schedules magic state supply by pricing cultivated T states with decoder gap confidence and allocating factories under an error budget, cutting spacetime volume by 3.4 times.", "highlights_oneliner": "Budget-aware T-state factory scheduling" }, { "arxiv_id": "2610.20515", "title": "Petz Recovery through a Single Polar Transformation for Approximate Quantum Error Correction", "authors": "Hanzhang Zhao, Shenglong Xu", "arxiv_url": "https://arxiv.org/abs/2610.20515", "pdf_url": "https://arxiv.org/pdf/2610.20515.pdf", "summary": "The paper implements Petz recovery via a single quantum singular value transformation using the polar structure of the recovery isometry, with explicit block-encoding circuits and an extended isometry avoiding postselection. It bounds the diamond distance between approximate and ideal Petz channels by a spectrum-weighted loss used to optimize QSVT angles, with error decaying exponentially in QSVT iterations. Applications include Haar-random encoding and the Hayden-Preskill protocol.", "motivation": "The Petz map is a near-optimal decoder for approximate QEC, but its inverse square-root normalization makes circuit implementation difficult. A QSVT formulation offers a systematic, resource-controlled route to realize it.", "highlights": [ "Inverse square-root normalization absorbed into a single QSVT via the polar decomposition", "Diamond-distance bound through a spectrum-weighted loss that guides QSVT angle optimization", "Exponentially decaying error bound in QSVT iterations, controlled by the smallest nonzero scaled singular value" ], "keywords": [ { "label": "Petz Recovery", "reason": "The near-optimal recovery map being implemented." }, { "label": "QSVT", "reason": "Quantum singular value transformation realizes the recovery circuit." }, { "label": "Approximate QEC", "reason": "Setting where Petz recovery provides decoders." }, { "label": "Hayden-Preskill", "reason": "Application placing scrambling decoders within the Petz framework." } ], "emoji": "🔄", "social_summary": "Implements near-optimal Petz recovery for approximate error correction with one quantum singular value transformation, with error decaying exponentially in circuit depth.", "highlights_oneliner": "Petz recovery via single QSVT" }, { "arxiv_id": "2610.19779", "title": "Tomography for coherent noise", "authors": "Long Huang", "arxiv_url": "https://arxiv.org/abs/2610.19779", "pdf_url": "https://arxiv.org/pdf/2610.19779.pdf", "summary": "The paper introduces a protocol to determine the model and parameters of coherent noise, reducing experimental complexity from $16^n$ to $O(16)$. Knowing the coherent noise parameters allows injecting correlated priors into the decoding graph and maximum-likelihood decoding under polynomially tractable structures, improving syndrome-based decoding accuracy.", "motivation": "Coherent noise is more damaging than stochastic Pauli noise because unitary errors preserve interference, accumulate across QEC rounds, and leave coherent components in the logical channel. Efficiently characterizing it enables decoders to exploit its structure.", "highlights": [ "Protocol identifies the model and parameters of coherent noise", "Experimental complexity reduced from $16^n$ to $O(16)$", "Parameters enable correlated decoding priors and tractable maximum-likelihood decoding" ], "keywords": [ { "label": "Coherent Noise", "reason": "The central noise type being characterized." }, { "label": "Tomography", "reason": "Protocol estimates noise model and parameters." }, { "label": "Decoding", "reason": "Learned parameters improve syndrome-based and maximum-likelihood decoding." }, { "label": "Logical Channel", "reason": "Coherent errors leave residual coherence in the logical channel." } ], "emoji": "🌊", "social_summary": "Introduces a tomography protocol for coherent noise that cuts experimental cost from exponential to constant, enabling better decoding of unitary errors.", "highlights_oneliner": "Efficient tomography of coherent noise" }, { "arxiv_id": "2610.18905", "title": "Stabilizer entropy cones as self-dual slices of linear rank cones: a five-party gap and dependence on the local dimension", "authors": "Xidan Song, Ruifeng Cao", "arxiv_url": "https://arxiv.org/abs/2610.18905", "pdf_url": "https://arxiv.org/pdf/2610.18905.pdf", "summary": "The paper shows that after a linear lift, the closure of the stabilizer entropy cone is the self-dual slice of the cone generated by rank functions of subspace arrangements over $\\mathrm{GF}(d)$ on one more element than parties. This shows the five-party stabilizer cone is strictly smaller than the quantum linear rank cone, witnessed by a six-variable inequality, and that the cone depends on local dimension. For six parties the Steane logical zero state lies outside the stabilizer cone of every odd local dimension.", "motivation": "Entropy cones characterize entanglement structure, and stabilizer states underlie quantum error correction, yet whether the stabilizer cone coincides with the quantum linear rank cone for five parties was open. Linden et al. conjectured common-information inequalities suffice to describe it.", "highlights": [ "Stabilizer entropy cone equals the self-dual slice of a linear rank cone on $n+1$ elements", "Five-party stabilizer cone is strictly smaller than the quantum linear rank cone, witnessed by a six-variable inequality", "Cone depends on local dimension $d$; Steane logical zero state lies outside the odd-$d$ stabilizer cones at six parties" ], "keywords": [ { "label": "Entropy Cones", "reason": "Main object: cone of achievable stabilizer entropy vectors." }, { "label": "Stabilizer States", "reason": "Backbone of QEC whose entropies are studied." }, { "label": "Rank Inequalities", "reason": "Linear rank inequalities separate stabilizer and quantum cones." }, { "label": "Local Dimension", "reason": "The cone depends on the characteristic of the qudit dimension." } ], "emoji": "📐", "social_summary": "Reveals that stabilizer entropy cones are self-dual slices of linear rank cones, exposing a five-party gap and a dependence on local dimension.", "highlights_oneliner": "Stabilizer entropy cones meet rank cones" }, { "arxiv_id": "2610.19676", "title": "Dynamical Decoupling of Nonclassical States in a Biased-Noise Spin Qudit", "authors": "Arjen Vaartjes, Namit Anand, Rocky Y. Su, Akram Youssry, Ritik Sareen, Jeffrey Marshall, Mark R. van Blankenstein, Danielle Holmes, Benjamin Wilhelm, Bibek Pokharel, Xi Yu, Laura A. O'Neill, Martin Nurizzo, Alexander M. Jakob, Fay E. Hudson, Kohei M. Itoh, Andrew S. Dzurak, David N. Jamieson, Andrea Morello", "arxiv_url": "https://arxiv.org/abs/2610.19676", "pdf_url": "https://arxiv.org/pdf/2610.19676.pdf", "summary": "The paper shows that noise-biased qudits allow dynamical decoupling overhead to be reduced from quadratic to linear in the dimension $d$. Experiments on a $d=8$ nuclear spin qudit of an antimony donor in silicon protect uniform superpositions, cat states and Haar random states, improving coherence by factors of $5$ to $10$. For a spin-cat code, continuous DD extends the logical $|+\\rangle_L$ coherence time to $225$ ms versus $19$ ms free evolution.", "motivation": "Qudits with $d>2$ promise resource-efficient quantum computing, but protecting nonclassical qudit states with dynamical decoupling has been limited by quadratic sequence overhead in $d$. Exploiting the noise bias of real systems makes DD practical for higher-dimensional encodings such as spin-cat codes.", "highlights": [ "Decoupling overhead reduced from $d^2$ to $d$ for dephasing-biased qudits", "Coherence improvements of $5$ to $10$ times on cat and Haar random states of a $d=8$ spin", "Spin-cat logical $|+\\rangle_L$ coherence extended to $225$ ms versus $85$ ms with Hahn echo" ], "keywords": [ { "label": "Dynamical Decoupling", "reason": "Core technique adapted to qudits with reduced overhead" }, { "label": "Qudits", "reason": "The $d=8$ antimony nuclear spin is the experimental platform" }, { "label": "Cat Codes", "reason": "Spin-cat error correction code is protected by DD" }, { "label": "Biased Noise", "reason": "Noise bias enables linear instead of quadratic overhead" } ], "emoji": "🐈", "social_summary": "Demonstrates dynamical decoupling on an eight-level nuclear spin qudit in silicon, exploiting noise bias to cut overhead and extend spin-cat logical coherence more than tenfold.", "highlights_oneliner": "Biased-noise qudit dynamical decoupling with linear overhead" }, { "arxiv_id": "2610.19304", "title": "Leakage benchmarking with decohering subgroups in the presence of preparation and measurement errors", "authors": "Shawn Geller, Tongyu Zhao, Alex Kwiatkowski, Scott Glancy, Raymond W. Simmonds, Emanuel Knill", "arxiv_url": "https://arxiv.org/abs/2610.19304", "pdf_url": "https://arxiv.org/pdf/2610.19304.pdf", "summary": "The paper shows that randomized benchmarking with leakage-level decoherence can be analyzed as a Markov process with noisy classical preparations and measurements, generalizing to groups with a phase-decohering subgroup. It characterizes the parameter degeneracy caused by SPAM errors and develops an inference method using conservative SPAM bounds to constrain fidelity and leakage. The method is demonstrated on a dual-rail qubit in two transmons with two leakage levels.", "motivation": "Leakage out of the computational subspace is a common physical-qubit error that is hard to separate from SPAM errors in standard randomized benchmarking. Properly bounding leakage and gate fidelity is important for characterizing hardware relevant to fault-tolerant operation.", "highlights": [ "Leakage RB sequences modeled as a Markov process with noisy classical SPAM", "Full characterization of parameter degeneracy and gauge freedom in the inference", "Experimental confidence intervals for leakage and fidelity compared against conventional leakage benchmarking methods" ], "keywords": [ { "label": "Leakage", "reason": "Central error mechanism being benchmarked" }, { "label": "Randomized Benchmarking", "reason": "Underlying protocol extended with decohering subgroups" }, { "label": "SPAM Errors", "reason": "Source of parameter degeneracy in inference" }, { "label": "Dual-Rail", "reason": "Experimental qubit encoded in two transmons" } ], "emoji": "💧", "social_summary": "Develops a leakage benchmarking method robust to preparation and measurement errors, using Markov process analysis and demonstrating it on a dual-rail transmon qubit.", "highlights_oneliner": "SPAM-robust leakage randomized benchmarking via decohering subgroups" }, { "arxiv_id": "2610.18953", "title": "Invertible subalgebras for chiral semion topological order", "authors": "Yu-An Chen, Meng Sun, Nathanan Tantivasadakarn, Zongyuan Wang, Bowen Yang", "arxiv_url": "https://arxiv.org/abs/2610.18953", "pdf_url": "https://arxiv.org/pdf/2610.18953.pdf", "summary": "The paper constructs an invertible subalgebra supporting chiral semions, with its anti-semion commutant, on a square lattice with one qubit per edge, giving explicit non-Pauli generators. Starting from the $\\mathbb{Z}_4$ toric code by condensing $e^2m^2$, it defines a three-dimensional non-Clifford QCA by pumping the semion ISA, and extends the construction to $U(1)_4$ and to dimensions $d=4k-2$. Together with earlier odd-prime ISAs, stacking realizes every pointed Witt class of bosonic Abelian anyon theories.", "motivation": "Chiral topological order cannot arise from strictly two-dimensional commuting-projector Hamiltonians, so invertible subalgebras offer an alternative operator-algebraic framework. Explicit lattice constructions and QCAs clarify the structure of chiral phases relevant to topological codes.", "highlights": [ "Explicit non-Pauli ISA for chiral semions on a square lattice with one qubit per edge", "Pumping gives a 3D non-Clifford QCA, with order-eight pumping equivalent to translation plus a finite-depth circuit", "Finite stacking realizes every pointed Witt class of bosonic Abelian anyon theories" ], "keywords": [ { "label": "Chiral Topological Order", "reason": "Phase realized by the semion invertible subalgebra" }, { "label": "Invertible Subalgebras", "reason": "Main framework for circumventing commuting-projector obstruction" }, { "label": "Cellular Automata", "reason": "Pumping yields a 3D non-Clifford QCA" }, { "label": "Toric Code", "reason": "$\\mathbb{Z}_4$ toric code condensation is the starting point" } ], "emoji": "🌀", "social_summary": "Constructs an explicit chiral semion invertible subalgebra on a qubit lattice, derives a 3D non-Clifford cellular automaton, and extends to all Abelian anyon Witt classes.", "highlights_oneliner": "Chiral semion invertible subalgebra and non-Clifford QCA" }, { "arxiv_id": "2610.18965", "title": "Measurement-induced criticality for non-Abelian anyons: The monitored golden chain", "authors": "Zhaohui Zhi, Bo Han, Romain Vasseur, Andreas W. W. Ludwig, Simon Trebst, Guo-Yi Zhu", "arxiv_url": "https://arxiv.org/abs/2610.18965", "pdf_url": "https://arxiv.org/pdf/2610.18965.pdf", "summary": "The paper studies measurement-only dynamics of non-Abelian anyon chains with non-commuting local fusion charge measurements, mapping them to a random tensor network. Numerics show $1/L$ scaling Lyapunov gaps, logarithmic entanglement scaling and an effective central charge in the Shannon entropy of the measurement record, with the topological charge learnable by a decoder in $O(L)$ time at $z=1$. The monitored golden chain ($k=3$) is established as a non-Abelian generalization of the weakly self-dual toric code critical point.", "motivation": "Measurement-induced phases in monitored systems have been explored mainly with Abelian or unitary-symmetric settings, leaving non-Abelian anyon chains with non-invertible symmetries open. Understanding such non-unitary critical points connects learnability of topological charge to decoding problems.", "highlights": [ "Random tensor network mapping reveals non-unitary CFT criticality with $1/L$ Lyapunov gaps", "Topological charge sharpens with dynamical exponent $z=1$ and is learnable by a decoder in $O(L)$ time", "Monitored golden chain ($k=3$) generalizes the toric code ($k=2$) self-dual critical point to $k\\geq 3$" ], "keywords": [ { "label": "Non-Abelian Anyons", "reason": "Fibonacci anyon chain is the system studied" }, { "label": "Monitored Dynamics", "reason": "Measurement-only evolution drives criticality" }, { "label": "Decoders", "reason": "Topological charge learnability via a decoder" }, { "label": "Criticality", "reason": "Non-unitary CFT governs the measurement-induced transition" } ], "emoji": "🔔", "social_summary": "Reveals measurement-induced criticality in a monitored Fibonacci anyon chain, showing non-unitary conformal behavior and decoder-learnable topological charge in linear time.", "highlights_oneliner": "Measurement-induced criticality in monitored golden chain" } ] }, "2026-10-14": { "word_cloud": [ { "word": "Decoders", "weight": 4 }, { "word": "qLDPC", "weight": 4 }, { "word": "Stabilizer", "weight": 5 }, { "word": "Bosonic", "weight": 2 }, { "word": "Magic", "weight": 3 }, { "word": "Logical", "weight": 4 }, { "word": "Qudits", "weight": 2 }, { "word": "Heavy-Hexagon", "weight": 2 }, { "word": "Simulation", "weight": 3 }, { "word": "Trapped-Ion", "weight": 2 }, { "word": "Majorana", "weight": 2 }, { "word": "Equivalence", "weight": 2 }, { "word": "Gates", "weight": 3 }, { "word": "QRAM", "weight": 2 }, { "word": "Neural", "weight": 2 } ], "social_highlights": "Highlights:", "papers": [ { "arxiv_id": "2610.17612", "title": "From Syndromes to Computation: A General Framework for Logical Operations in Quantum Error-Correcting Codes", "authors": "Hunter Nelson, Arshag Danageozian, ChunJun Cao, Sophia E. Economou, Edwin Barnes", "arxiv_url": "https://arxiv.org/abs/2610.17612", "pdf_url": "https://arxiv.org/pdf/2610.17612.pdf", "summary": "Develops a framework where stabilizer syndromes of commuting Pauli rotations organize logical-gate design, with an exact codespace-preservation condition valid at arbitrary angles for CSS and non-CSS codes. An equal-syndrome specialization reduces Clifford gate design to stabilizer factorization with a generator weight bound of $\\lceil d/2\\rceil$ for distance-$d$ codes, yielding new low-weight gates on BB and Mirror qLDPC codes.", "motivation": "Transversal gates are limited by Eastin-Knill and related no-go results, motivating broader approaches to logical gate design that are intertwined with code design. A unified stabilizer-level framework for both Clifford and non-Clifford operations on qLDPC codes has been lacking.", "highlights": [ "Exact codespace-preservation condition for commuting Pauli rotations at arbitrary angles, covering CSS and non-CSS codes", "Generator weight bound of $\\lceil d/2\\rceil$ and new low-weight gates including addressed $T$ on the $[[16,4,4]]$ BB code and $CCZ$/$CS$/$T$ on the $[[36,6,6]]$ Mirror code", "Analytic constructions on hypercube codes and $C^rZ$ gates on quantum Reed-Muller codes saturating the weight bound" ], "keywords": [ { "label": "Logical Gates", "reason": "Central topic is systematic design of logical operations from stabilizer syndromes." }, { "label": "qLDPC", "reason": "Applied to bivariate-bicycle and Mirror qLDPC codes." }, { "label": "Pauli Rotations", "reason": "Framework is built on commuting multiqubit Pauli rotations." }, { "label": "Clifford Hierarchy", "reason": "Extends to non-Clifford rotations like $T$ and $CCZ$ higher in the hierarchy." } ], "emoji": "🧮", "social_summary": "Introduces a syndrome-based framework that designs low-weight logical Clifford and non-Clifford gates on qLDPC and Reed-Muller codes, with a general weight bound for distance-d codes.", "highlights_oneliner": "Syndrome-driven logical gate design framework" }, { "arxiv_id": "2610.14192", "title": "Lifting an $[n,k,d]$ Binary Linear Code to an $[[n,k,d]]$ Quantum Stabilizer Code", "authors": "Thamadathil Aswanth, Navin Kashyap", "arxiv_url": "https://arxiv.org/abs/2610.14192", "pdf_url": "https://arxiv.org/pdf/2610.14192.pdf", "summary": "Studies when a classical $[n,k,d]$ binary linear code can be lifted to an $[[n,k,d]]$ stabilizer code via the CWS framework using an Erdős-Rényi random graph $\\mathrm{G}(n,\\frac12)$. Derives a lower bound on the probability that the quantum code preserves distance $d$, yielding a Gilbert-Varshamov-type existence condition.", "motivation": "CWS codes generalize stabilizer codes and give a route from classical to quantum codes beyond CSS. Understanding when classical parameters carry over unchanged to quantum codes clarifies the power of this construction.", "highlights": [ "Probabilistic analysis of random CWS codes from a binary linear code and random graph", "Lower bound on the probability that minimum distance $d$ is preserved", "Gilbert-Varshamov-type condition guaranteeing a graph giving an $[[n,k,d]]$ code" ], "keywords": [ { "label": "CWS Codes", "reason": "The codeword stabilized framework is the construction used." }, { "label": "Stabilizer Codes", "reason": "Linear classical codes yield stabilizer quantum codes." }, { "label": "Random Graphs", "reason": "Erdős-Rényi graphs underpin the probabilistic analysis." }, { "label": "GV Bound", "reason": "Result is a Gilbert-Varshamov-type existence condition." } ], "emoji": "🎲", "social_summary": "Proves a Gilbert-Varshamov-type condition under which classical binary linear codes lift to quantum stabilizer codes with identical parameters using random graphs in the CWS framework.", "highlights_oneliner": "Lifting classical linear codes to quantum" }, { "arxiv_id": "2610.14202", "title": "Below-threshold execution of fault-tolerant ripple-carry addition on a trapped-ion quantum computer", "authors": "Jacob S. Nelson, Andrew J. Landahl, Andrew D. Baczewski", "arxiv_url": "https://arxiv.org/abs/2610.14202", "pdf_url": "https://arxiv.org/pdf/2610.14202.pdf", "summary": "Executes fault-tolerant ripple-carry adders up to five bits on Quantinuum's Helios-1 using error-detecting $[[8,3,2]]$ and $[[4,2,2]]$ codes. An algorithmic check from uncomputing a workspace qubit raises the effective fault distance of many locations from two to four, giving a one-bit logical failure rate of $(6.0 \\pm 5.9) \\times 10^{-5}$ versus $(3.5 \\pm 1.3) \\times 10^{-3}$ unencoded.", "motivation": "Early fault-tolerant experiments have run small algorithms near break-even, but clear below-threshold advantage on arithmetic circuits has been limited. Arithmetic is a foundational building block, making it a key benchmark for early FTQC architectures.", "highlights": [ "Observed a single logical failure in one-bit addition, far below the unencoded failure probability", "Algorithmic check increases effective fault distance from two to four at many locations", "Two- and three-bit adders improved while four- and five-bit adders ran just above threshold" ], "keywords": [ { "label": "Error Detection", "reason": "Uses $[[8,3,2]]$ and $[[4,2,2]]$ error-detecting codes." }, { "label": "Trapped Ions", "reason": "Experiments run on Quantinuum Helios-1." }, { "label": "Ripple-Carry Adder", "reason": "Arithmetic circuits are the benchmark algorithm." }, { "label": "Fault Distance", "reason": "Algorithmic check boosts effective fault distance." } ], "emoji": "➕", "social_summary": "Demonstrates below-threshold fault-tolerant ripple-carry addition on a trapped-ion computer, where an algorithmic check boosts fault distance and cuts one-bit logical failure by orders of magnitude.", "highlights_oneliner": "Below-threshold fault-tolerant adders on trapped ions" }, { "arxiv_id": "2610.14778", "title": "Avoiding Defects within Heavy-Hexagon Architecture", "authors": "Hansol Kim, Younghun Kwon", "arxiv_url": "https://arxiv.org/abs/2610.14778", "pdf_url": "https://arxiv.org/pdf/2610.14778.pdf", "summary": "Proposes a defect-avoidance scheme for the low-connectivity (2 to 3) heavy-hexagon architecture that measures all gauge operators of a super-stabilizer in two cycles instead of four. Experiments on IBM hardware show roughly 10% lower logical error rate per cycle for both logical $X$ and $Z$.", "motivation": "Fabrication and calibration defects in superconducting processors disrupt stabilizer measurements and inflate logical error rates. Existing mitigation targets higher-connectivity lattices, and experimental demonstrations of benefit on real hardware have been lacking.", "highlights": [ "Two-cycle gauge measurement for super-stabilizers versus four in prior approaches", "Tailored to heavy-hexagon lattices with connectivity 2 to 3", "About 10% logical error reduction per cycle demonstrated on IBM hardware" ], "keywords": [ { "label": "Heavy-Hexagon", "reason": "Target low-connectivity IBM architecture." }, { "label": "Defects", "reason": "Handling defective qubits is the central problem." }, { "label": "Super-Stabilizers", "reason": "Gauge-operator-based mitigation strategy." }, { "label": "Superconducting", "reason": "Validated experimentally on IBM superconducting hardware." } ], "emoji": "🔷", "social_summary": "Introduces a defect-avoidance scheme for heavy-hexagon lattices that halves gauge measurement cycles and cuts logical error rates about ten percent on real IBM hardware.", "highlights_oneliner": "Defect avoidance on heavy-hexagon lattices" }, { "arxiv_id": "2610.15893", "title": "Local-dimension-invariant low-density parity-check stabilizer codes", "authors": "Md. Shahinul Islam, Aaryan Reza, Lane G. Gunderman", "arxiv_url": "https://arxiv.org/abs/2610.15893", "pdf_url": "https://arxiv.org/pdf/2610.15893.pdf", "summary": "Studies local-dimension-invariant (LDI) extensions of qubit stabilizer codes to qudits, focusing on qLDPC codes to lower the prime cutoff needed to preserve distance. The cutoff reduces in some cases to the initial local dimension and for arbitrary CSS qubit-derived codes to singly exponential in $d$ with no dependence on the number of logicals $k$.", "motivation": "LDI constructions convert qubit stabilizer codes into qudit codes but generally require a very large prime local dimension to preserve distance. Reducing this cutoff makes the approach practical for qudit, rotor, and GKP-like encodings.", "highlights": [ "Cutoff reduced to the initial local dimension in some constructions", "Singly exponential cutoff in $d$ independent of $k$ for CSS qubit-derived codes", "Interpretation of the cutoff as a squeezing or precision requirement" ], "keywords": [ { "label": "Qudits", "reason": "Codes are extended to higher local dimensions." }, { "label": "LDPC", "reason": "Sparsity enables tighter distance-preservation bounds." }, { "label": "LDI Codes", "reason": "Local-dimension-invariant stabilizer framework." }, { "label": "GKP", "reason": "Cutoff interpreted as squeezing requirement for GKP-like encodings." } ], "emoji": "🔢", "social_summary": "Shrinks the local-dimension cutoff needed for distance preservation in qudit extensions of qubit codes by exploiting low-density parity-check structure.", "highlights_oneliner": "Tighter local-dimension bounds for qLDPC" }, { "arxiv_id": "2610.16375", "title": "Pathfinder-BP: A Low-Latency Recursive Decoder for Topological Codes", "authors": "Stefano Tinelli, Francisco Lázaro, Francisco García Herrero", "arxiv_url": "https://arxiv.org/abs/2610.16375", "pdf_url": "https://arxiv.org/pdf/2610.16375.pdf", "summary": "Presents Pathfinder-BP, a recursive decoder combining belief propagation with controlled bit-flipping: high-confidence errors are fixed after an initial BP pass and low-confidence variables are tentatively flipped upon failure. On surface codes it matches MWPM in threshold and logical error rate with worst-case latency quasi-linear in code distance.", "motivation": "Real-time decoding demands accuracy, low complexity, and hardware friendliness; OSD-style decoders need matrix inversion while plain BP fails on short cycles. A parallelizable decoder without inversion is needed for low-latency hardware.", "highlights": [ "Threshold and logical error rate comparable to MWPM on surface codes", "No matrix inversion required, highly parallel structure", "Worst-case latency quasi-linear in code distance" ], "keywords": [ { "label": "Decoders", "reason": "Paper proposes a new decoding algorithm." }, { "label": "Belief Propagation", "reason": "Core primitive augmented with bit-flipping." }, { "label": "Surface Codes", "reason": "Main benchmark code family." }, { "label": "Low Latency", "reason": "Quasi-linear worst-case latency for hardware." } ], "emoji": "⚡", "social_summary": "Proposes a recursive belief-propagation decoder that matches matching-decoder performance on surface codes while avoiding matrix inversion and achieving quasi-linear parallel latency.", "highlights_oneliner": "Fast parallel BP decoder rivaling MWPM" }, { "arxiv_id": "2610.16401", "title": "Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits", "authors": "Gebrat Porta-San Miguel, Shahram Panahiyan, Dieter Jaksch", "arxiv_url": "https://arxiv.org/abs/2610.16401", "pdf_url": "https://arxiv.org/pdf/2610.16401.pdf", "summary": "Introduces magic-free certification, a code- and decoder-agnostic protocol using trap circuits in which magic states are replaced by stabilizer states, giving deterministic outcomes that fail at the same rate as the target under stochastic Pauli noise. Sample complexity grows linearly in logical qubits and non-Clifford gates and is decoupled from the logical error rate itself.", "motivation": "Certifying universal fault-tolerant circuits is hard because non-Clifford gates make ideal outputs classically intractable and tomography does not scale. A certification method that avoids consuming magic, the costliest resource, is highly desirable.", "highlights": [ "Trap circuits replace magic states with stabilizer states yet fail at the same rate", "Sample complexity linear in logical qubits and non-Clifford gates", "Illustrated with Steane-code simulations of magic state injection and a quantum Fourier transform" ], "keywords": [ { "label": "Certification", "reason": "Protocol certifies logical error rates below a tolerance." }, { "label": "Magic States", "reason": "Protocol avoids consuming magic resources." }, { "label": "Trap Circuits", "reason": "Core technique using stabilizer-substituted copies." }, { "label": "Steane Code", "reason": "Simulations use the Steane code." } ], "emoji": "🪤", "social_summary": "Certifies logical error rates of universal fault-tolerant circuits without consuming magic states, using stabilizer trap circuits that experience the same noise as the target.", "highlights_oneliner": "Certifying universal logical circuits without magic" }, { "arxiv_id": "2610.17017", "title": "Photon-stimulated decay of $χ$-matched ancillas causes unheralded bit flips in bosonic codes", "authors": "Aleksandr Gulkanov", "arxiv_url": "https://arxiv.org/abs/2610.17017", "pdf_url": "https://arxiv.org/pdf/2610.17017.pdf", "summary": "Shows that code photons open a first-order photon-stimulated Raman decay $|f,n\\rangle\\to|g,n+1\\rangle$ in $\\chi$-matched transmon ancillas, at $(n+1)(\\chi_{ge}/2g_{01})^2$ times the $f\\to e$ rate. This decay is unheralded and flips a cat with probability about $1/2$, making the bit-flip floor in the Ocelot repetition cat code grow linearly with cat size.", "motivation": "Equal-parity $\\chi$-matched ancillas were thought to protect bosonic codes because $f\\to g$ is parity-forbidden and $f\\to e$ is heralded. Bit-flip errors in cat-code experiments have been modeled as photon-independent, leaving their origin unexplained.", "highlights": [ "Photon-stimulated Raman decay opens at first order in the ancilla decay rate", "Bit-flip floor grows by a factor 1.2-1.7 from four to ten photons in an Ocelot model, limiting noise bias to about $10^3$", "Qubit ancillas lack this channel; deliberate mismatch or drive matching reduces the cost" ], "keywords": [ { "label": "Cat Codes", "reason": "Repetition cat codes like Ocelot are the main application." }, { "label": "Bosonic Codes", "reason": "Syndrome readout through transmon ancillas in bosonic modes." }, { "label": "Bit Flips", "reason": "Unheralded decay causes photon-dependent bit-flip floor." }, { "label": "Transmon Ancilla", "reason": "The $\\chi$-matched $(g,f)$ transmon is the error source." } ], "emoji": "🐈", "social_summary": "Reveals that photons in bosonic codes stimulate an unheralded ancilla decay in chi-matched transmons, making cat-code bit-flip errors grow with photon number.", "highlights_oneliner": "Hidden ancilla decay limits cat-code bias" }, { "arxiv_id": "2610.17185", "title": "Error-Corrected QRAM Queries with One-Fault-Tolerant \\texttt{CSWAP} Gates", "authors": "Shifan Xu, Connor T. Hann, Nathan Wiebe, Steven M. Girvin, Yongshan Ding", "arxiv_url": "https://arxiv.org/abs/2610.17185", "pdf_url": "https://arxiv.org/pdf/2610.17185.pdf", "summary": "The paper proposes a low-overhead protection framework for bucket-brigade QRAM built from two components: a one-fault-tolerant repeat-until-success logical $CSWAP$ gate using the $[[4,2,2]]$ code under erasure noise, and local parity checks on router states that exploit bucket-brigade validity constraints. Monte Carlo simulations show quadratic suppression of logical failure for the protected $CSWAP$ and improved depth scaling for decoded router-state snapshots, and the two codes can be concatenated.", "motivation": "QRAM requires $O(N)$ qubits for $N=2^n$ addresses, making it appear vulnerable to noise even though bucket-brigade routing offers intrinsic resilience. Generic QEC is poorly matched to this setting, so exploiting routing constraints for cheap error correction could make coherent classical data access more reliable.", "highlights": [ "One-fault-tolerant repeat-until-success logical $CSWAP$ with $[[4,2,2]]$ code gives second-order logical failure under erasure noise", "Local parity checks from routing validity constraints need no extra data qubits and are decoded by minimum-weight perfect matching", "Concatenated realization combines inner erasure protection with outer bit-flip correction, confirmed by Monte Carlo simulation" ], "keywords": [ { "label": "QRAM", "reason": "The paper targets error protection of bucket-brigade quantum random-access memory queries." }, { "label": "Erasure Noise", "reason": "The $[[4,2,2]]$ gate protection is designed for erasure-dominant noise channels." }, { "label": "Fault Tolerance", "reason": "A one-fault-tolerant logical $CSWAP$ gate is constructed and analyzed." }, { "label": "Concatenated Codes", "reason": "Inner erasure code and outer parity-check code are combined in a concatenated scheme." } ], "emoji": "🗄️", "social_summary": "Protects bucket-brigade QRAM queries using a one-fault-tolerant logical CSWAP gate and routing-based parity checks, achieving quadratic error suppression under erasure and bit-flip noise.", "highlights_oneliner": "Error-corrected QRAM with fault-tolerant CSWAP" }, { "arxiv_id": "2610.17520", "title": "Chromatic Block-Gibbs p-Bit Decoding of QLDPC Codes", "authors": "Mert Gökduman, Cyril Guyot, Henry D. Pfister", "arxiv_url": "https://arxiv.org/abs/2610.17520", "pdf_url": "https://arxiv.org/pdf/2610.17520.pdf", "summary": "The paper introduces a parallel QLDPC decoder based on probabilistic bits that are stochastically updated with local Gibbs conditionals while a progressively strengthened parity penalty drives the search toward syndrome-valid configurations. Graph coloring enables parallel block updates, and replicas and restarts provide diversity, with the best candidate returned. Logical error rates are on par with leading decoders under code-capacity and circuit-level noise.", "motivation": "Belief propagation struggles on QLDPC codes due to short cycles and degeneracy, motivating ensemble and post-processing decoders. Stochastic p-bit dynamics offer a hardware-friendly alternative that could suit native probabilistic hardware.", "highlights": [ "Constraint-annealed p-bit dynamics decode QLDPC codes via local Gibbs conditionals", "Graph coloring enables parallel block updates with replicas and restarts for diversity", "Logical error rates match leading decoders under code-capacity and circuit-level noise" ], "keywords": [ { "label": "QLDPC", "reason": "The decoder targets quantum low-density parity-check codes." }, { "label": "Decoders", "reason": "A new stochastic decoding algorithm is proposed and benchmarked." }, { "label": "p-Bits", "reason": "Probabilistic bits are the core computational unit of the decoder." }, { "label": "Gibbs Sampling", "reason": "Local Gibbs conditionals drive the stochastic error-configuration updates." } ], "emoji": "🎲", "social_summary": "Introduces a parallel p-bit Gibbs-sampling decoder for QLDPC codes that matches leading decoders' logical error rates and motivates hardware-native stochastic implementations.", "highlights_oneliner": "Stochastic p-bit decoder for QLDPC codes" }, { "arxiv_id": "2610.18130", "title": "Distance Prediction for Quantum Codes", "authors": "Nadav Schneider, Eliya Nachmani", "arxiv_url": "https://arxiv.org/abs/2610.18130", "pdf_url": "https://arxiv.org/pdf/2610.18130.pdf", "summary": "The paper builds a dataset of bivariate bicycle codes labeled with heuristic distance upper bounds and introduces BB-Net, an attention-based network that predicts code distance. BB-Net reaches 96.39% accuracy on reference distances versus 94.86% for heuristics with up to $10^{4}$ times more runtime, and 98.94% on certified exact distances.", "motivation": "Computing quantum code distance is a major bottleneck in searching for good qLDPC codes, since exact solvers and heuristics are costly. A fast learned predictor can accelerate ML-driven code discovery for low-overhead fault tolerance.", "highlights": [ "BB-Net attention architecture uses polynomial and Tanner-spectral representations of BB codes", "96.39% accuracy versus 94.86% for heuristics with up to $10^{4}$ times more runtime", "98.94% accuracy on a subset with certified exact distances" ], "keywords": [ { "label": "Bivariate Bicycle", "reason": "The distance predictor is built for BB code family." }, { "label": "Code Distance", "reason": "Predicting minimum distance is the central task." }, { "label": "Neural Networks", "reason": "An attention-based architecture performs the prediction." }, { "label": "Code Search", "reason": "Fast prediction enables screening large code spaces." } ], "emoji": "📏", "social_summary": "Predicts distances of bivariate bicycle codes with an attention-based neural network that beats costly heuristics in accuracy, speeding up the search for new quantum error-correcting codes.", "highlights_oneliner": "Neural prediction of BB code distance" }, { "arxiv_id": "2610.18218", "title": "Methods for Automated Equivalence Checking of Quantum Error-Correction Codes", "authors": "Maxie Bichmann, Ludwig Schmid, Robert Wille", "arxiv_url": "https://arxiv.org/abs/2610.18218", "pdf_url": "https://arxiv.org/pdf/2610.18218.pdf", "summary": "The paper formalizes permutation equivalence for stabilizer and CSS codes and local-Clifford equivalence for stabilizer codes, and develops group-action search, isomorphism-based, and constraint-solving decision strategies with invariants for preprocessing. No paradigm dominates, so a staged Refute-Refine-Decide hybrid checker is built, with mean runtimes under 10 s for most structured cases with $n \\leq 37$.", "motivation": "Many QEC code constructions coexist, and it is often unclear whether two descriptions represent distinct or equivalent codes. Automated equivalence checking helps deduplicate databases and reuse results across equivalent codes.", "highlights": [ "Unified framework separating representation freedom from physical freedom", "Three decision paradigms plus invariants combined into Refute-Refine-Decide hybrid checkers", "Inequivalent $n=144$ instances decided in about 310 s (permutation) and 16 s (local-Clifford)" ], "keywords": [ { "label": "Equivalence", "reason": "Deciding code equivalence under specified transformations is the core problem." }, { "label": "Stabilizer Codes", "reason": "Local-Clifford equivalence is formalized for stabilizer codes." }, { "label": "CSS Codes", "reason": "Permutation equivalence is treated specifically for CSS codes." }, { "label": "Automation", "reason": "Hybrid automated checkers are implemented in MQT QECC." } ], "emoji": "🔍", "social_summary": "Develops automated hybrid checkers that decide whether two quantum error-correction codes are equivalent under permutations or local Cliffords, scaling to codes with 144 qubits.", "highlights_oneliner": "Automated equivalence checking for QEC codes" }, { "arxiv_id": "2610.15975", "title": "Scalable Exact Non-Pauli Noise Simulation for Fault-Tolerant Quantum Circuits", "authors": "Yuewen Hou, Gokul Subramanian Ravi", "arxiv_url": "https://arxiv.org/abs/2610.15975", "pdf_url": "https://arxiv.org/pdf/2610.15975.pdf", "summary": "The paper proposes QuasiStim, combining the QuasiFold compiler frontend, which merges equivalent non-Pauli sites, with the DeltaFrame sampling backend, which reuses precomputed references instead of resimulating the tableau per shot. It reduces shots by over $100\\times$ on BB codes and is $166\\times$--$1331\\times$ faster than per-shot tableau simulation on rotated surface-code memory under coherent $R_Z$ noise.", "motivation": "Stabilizer simulators like Stim handle only Clifford gates and Pauli noise, so realistic coherent errors and thermal relaxation are approximated via Pauli twirling, which can introduce inaccuracies. Exact scalable simulation allows measuring this bias for QEC design.", "highlights": [ "QuasiFold reduces required shots by over $100\\times$ on bivariate-bicycle codes", "DeltaFrame is $166\\times$--$1331\\times$ faster than per-shot tableau simulation for $d$ from 5 to 35", "Pauli-twirling bias is non-negligible and varies with noise strength, decoder, and schedule" ], "keywords": [ { "label": "Noise Simulation", "reason": "The work simulates realistic non-Pauli noise exactly." }, { "label": "Stabilizer Simulation", "reason": "It extends Stim-style stabilizer methods beyond Pauli noise." }, { "label": "Coherent Errors", "reason": "Coherent $R_Z$ noise is a key benchmark." }, { "label": "Surface Codes", "reason": "Rotated surface-code memory is used to benchmark speedups." } ], "emoji": "🧪", "social_summary": "Presents QuasiStim, an exact simulator for non-Pauli noise in fault-tolerant circuits that cuts shots and runtime by orders of magnitude and exposes Pauli-twirling bias.", "highlights_oneliner": "Fast exact non-Pauli noise simulation for QEC" }, { "arxiv_id": "2610.17500", "title": "A three-eighths upper bound on the stabilizer-rank exponent of face-center magic states", "authors": "Samuel Bevins", "arxiv_url": "https://arxiv.org/abs/2610.17500", "pdf_url": "https://arxiv.org/pdf/2610.17500.pdf", "summary": "The paper gives an explicit construction showing the exact stabilizer rank of $m$ copies of the qubit face-center magic state is $O(2^{3m/8})$. Two symmetry-related fifteen-term identities yield a twenty-four-term decomposition at twelve copies, and its balanced structure gives a substitution adding eight copies at a cost of eight terms per term, improving $\\log_2(3)/4$ to $\\gamma_T \\leq 3/8$.", "motivation": "Stabilizer rank governs the cost of classically simulating circuits with magic-state resources such as those in Bravyi-Kitaev distillation. Tighter exponent bounds directly improve the scaling of such simulation methods.", "highlights": [ "Explicit decomposition of $|T\\rangle^{\\otimes(4+8j)}$ into $3\\cdot 8^j$ stabilizer states", "Symmetry gluing of two fifteen-term identities gives a twenty-four-term witness at twelve copies", "Exponent bound improves from $\\log_2(3)/4 \\approx 0.396$ to $3/8$" ], "keywords": [ { "label": "Stabilizer Rank", "reason": "The paper bounds the exponent of exact stabilizer rank." }, { "label": "Magic States", "reason": "Face-center $T$-type magic states are the object of study." }, { "label": "Classical Simulation", "reason": "Rank bounds determine simulation cost for nonstabilizer circuits." }, { "label": "Decompositions", "reason": "Explicit stabilizer decompositions prove the bound." } ], "emoji": "✨", "social_summary": "Proves a tighter three-eighths upper bound on the stabilizer-rank exponent of face-center magic states through explicit decompositions, improving the previous log base two of three over four.", "highlights_oneliner": "Improved stabilizer-rank exponent bound for magic states" }, { "arxiv_id": "2610.18124", "title": "Local error correction prolongs time-crystalline memory", "authors": "Benedikt Fauseweh", "arxiv_url": "https://arxiv.org/abs/2610.18124", "pdf_url": "https://arxiv.org/pdf/2610.18124.pdf", "summary": "The paper applies stochastic local bit-flip error correction with repetition codes of distances three and five on a honeycomb lattice of up to 68 qubits on a superconducting processor to prolong the time-crystalline response of a driven, disordered 2D Ising model. Despite ancilla and measurement overhead, memory decay time increases by up to a factor of two, while syndrome measurements without correction accelerate decay.", "motivation": "Environmental coupling limits the lifetime of discrete time crystals in experiments, and extending coherent many-body dynamics on noisy processors is a central challenge. Below-threshold QEC demonstrations motivate using conditional correction within quantum simulation.", "highlights": [ "Repetition codes with distances three and five on up to 68 physical qubits", "Memory decay time increased by up to a factor of two", "Syndrome measurements without conditional correction accelerate memory decay" ], "keywords": [ { "label": "Time Crystals", "reason": "The protected object is the discrete time-crystalline response." }, { "label": "Repetition Code", "reason": "Distance-three and five repetition codes provide bit-flip protection." }, { "label": "Quantum Simulation", "reason": "Error correction is used to extend dynamics in a digital simulation." }, { "label": "Midcircuit Measurement", "reason": "Syndrome measurements and conditional correction occur during the circuit." } ], "emoji": "⏳", "social_summary": "Demonstrates that local bit-flip error correction on a superconducting processor extends the memory lifetime of a discrete time crystal by up to a factor of two.", "highlights_oneliner": "Error correction extends time-crystal lifetime" }, { "arxiv_id": "2610.17058", "title": "Architecting Instruction Execution for Scalable Fault-Tolerant Quantum Computing", "authors": "Dmitry Filippov, Justin Hogaboam, Mathias Soeken, Raghu Gatta, Prakash Murali, Matthias Troyer", "arxiv_url": "https://arxiv.org/abs/2610.17058", "pdf_url": "https://arxiv.org/pdf/2610.17058.pdf", "summary": "The paper introduces the ARIES instruction set hierarchy categorizing quantum instruction set architectures into abstraction levels and an end-to-end toolflow with a cycle-accurate driver and hardware engine simulator. Evaluating eight applications on superconducting and topological qubit platforms, it finds physical-level abstractions exceed cryogenic thermal limits while canonical-level ones underestimate routing congestion, with Level 4 local logical operations offering the best balance.", "motivation": "Scaling FTQC requires orchestrating millions of operations across a classical-quantum control stack, and the hardware-software boundary strongly affects thermal budgets and engine complexity. Concrete architectural guidance is needed for upcoming scalable hardware.", "highlights": [ "ARIES hierarchy categorizes QISAs into distinct abstraction levels", "Physical-level QISAs exceed dilution-refrigerator thermal limits by orders of magnitude", "Level 4 local logical operations balances bandwidth, power, and runtime" ], "keywords": [ { "label": "Instruction Sets", "reason": "The paper analyzes the quantum instruction set architecture boundary." }, { "label": "Control Stack", "reason": "Classical driver and hardware engine orchestration is central." }, { "label": "Cryogenic Limits", "reason": "Thermal budgets constrain instruction bandwidth and transceiver power." }, { "label": "Fault Tolerance", "reason": "The architecture targets scalable FTQC execution." } ], "emoji": "🧊", "social_summary": "Evaluates quantum instruction set abstraction levels for fault-tolerant machines and finds local logical operations best balance cryogenic power limits against control-engine complexity.", "highlights_oneliner": "Choosing the right QISA for FTQC" }, { "arxiv_id": "2610.18589", "title": "$T$-efficient unitary synthesis via block-sparse Hamiltonian simulation", "authors": "Diyi Liu, Shuchen Zhu, Wibe Albert de Jong, Di Fang, David Williams-Young, Chao Yang", "arxiv_url": "https://arxiv.org/abs/2610.18589", "pdf_url": "https://arxiv.org/pdf/2610.18589.pdf", "summary": "The paper constructs Clifford+$T$ circuits for arbitrary $n$-qubit unitaries with worst-case $T$-count $\\widetilde{O}(N^{8/7})$ at constant operator-norm error, improving the prior exponent $5/4$, using $\\widetilde{O}(N^{6/7})$ clean ancillas. The method simulates a Hermitian logarithm of the target via random similarity flattening, block-sparse partitioning, and qDRIFT, with residual refinement yielding $\\widetilde{O}(N^{8/7}L^{3/7}+NL)$ $T$ gates. The exponent $8/7$ is proven optimal within a sequential block-SELECT model.", "motivation": "In fault-tolerant quantum computing, non-Clifford $T$ gates dominate cost via magic state distillation, so minimizing $T$-count for generic unitaries is a central resource question. A polynomial gap remains between the $\\Omega(N)$ counting lower bound and the best known upper bounds, previously $\\widetilde{O}(N^{5/4})$.", "highlights": [ "Worst-case $T$-count $\\widetilde{O}(N^{8/7})$ with $\\widetilde{O}(N^{6/7})$ clean ancillas, improving exponent from $5/4$", "Combines random similarity flattening, block-sparse Hermitian splitting, qDRIFT, and QSVT with residual error correction", "Proves $8/7$ exponent is optimal within the sequential block-SELECT model at constant precision" ], "keywords": [ { "label": "Unitary Synthesis", "reason": "The core task is synthesizing arbitrary $n$-qubit unitaries in Clifford+$T$ circuits." }, { "label": "T-count", "reason": "The main figure of merit is the worst-case number of $T$ gates, a key fault-tolerant cost." }, { "label": "qDRIFT", "reason": "Randomized Hamiltonian simulation is used to combine block-sparse pieces efficiently." }, { "label": "Block Encoding", "reason": "Sparse block-encoding queries and lookup cost drive the construction and its optimality analysis." } ], "emoji": "🧮", "social_summary": "Slash the T-gate cost of synthesizing arbitrary unitaries, improving the exponent to 8/7 using block-sparse Hamiltonian simulation, and prove this exponent is optimal within a natural model.", "highlights_oneliner": "Cheaper T-count for arbitrary unitary synthesis" }, { "arxiv_id": "2610.17198", "title": "Revealing topological protection through unprotected operations in a Majorana parity qubit", "authors": "Sebastian Miles, Juan Daniel Torres Luna, Francesco Zatelli, Nick van Loo, Antonio Lombardi, Vincent P. M. Sietses, Florian J. Bennebroek Evertsz', Bart Roovers, Leo P. Kouwenhoven, Michael Wimmer", "arxiv_url": "https://arxiv.org/abs/2610.17198", "pdf_url": "https://arxiv.org/pdf/2610.17198.pdf", "summary": "The paper develops an analytical theory of quasistatic dephasing for two coupled $N$-site Kitaev chains at the sweet spot, accounting for non-Gaussian splitting statistics. It shows that Rabi experiments reveal protection as an exponentially growing optimized number of oscillations or longer coherence time, while Ramsey experiments show exponentially increasing coherence time if chains can be decoupled. It also determines how residual noise and imperfections limit the observable range of chain lengths.", "motivation": "Majorana zero modes promise error suppression through spatial separation, but small energy splittings are hard to resolve in transport measurements. Recent coherent parity oscillations in minimal Kitaev chains motivate using qubit dynamics, despite unprotected coupling operations, to probe topological protection.", "highlights": [ "Analytical quasistatic dephasing theory for two coupled $N$-site Kitaev chains at the sweet spot", "Rabi experiments reveal exponential protection via optimized oscillation number or coherence time, depending on coupling architecture", "Ramsey coherence time grows exponentially with chain length, with noise-imposed limits on observable scaling" ], "keywords": [ { "label": "Majorana Qubit", "reason": "The work concerns a parity qubit encoded in coupled Kitaev chains." }, { "label": "Kitaev Chains", "reason": "Quantum-dot-based chains of length $N$ provide the platform for studying protection scaling." }, { "label": "Dephasing", "reason": "Quasistatic noise in the coupling strength limits coherence and is modeled analytically." }, { "label": "Topological Protection", "reason": "The goal is to reveal exponential protection with chain length through qubit dynamics." } ], "emoji": "🔗", "social_summary": "Show how unprotected qubit operations can still reveal exponential topological protection in Majorana parity qubits built from coupled Kitaev chains, with analytical predictions for scaling with chain length.", "highlights_oneliner": "Probing Majorana protection via qubit dephasing" } ] }, "2026-10-13": { "status": "no_arxiv" }, "2026-10-12": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Lifted", "weight": 3 }, { "word": "Product", "weight": 3 }, { "word": "Bicycle", "weight": 4 }, { "word": "Decoding", "weight": 4 }, { "word": "GPU", "weight": 3 }, { "word": "Clifford", "weight": 4 }, { "word": "Surface", "weight": 2 }, { "word": "Fold-transversal", "weight": 1 }, { "word": "Gauging", "weight": 3 }, { "word": "Spectral", "weight": 2 }, { "word": "Graphs", "weight": 2 }, { "word": "Mitigation", "weight": 2 }, { "word": "Extrapolation", "weight": 2 }, { "word": "Annealing", "weight": 2 } ], "social_highlights": "Highlights: coset lifted product qLDPC codes, a two-block code census, GPU belief-propagation decoding, noise-aware Clifford-deformed codes, fast La-cross logical gates, spectral dimension in random-graph codes, indirect-control zero-noise extrapolation, and an XX gadget boosting annealing.", "papers": [ { "arxiv_id": "2610.12782", "title": "Coset Lifted Product Codes: Constructing Quantum LDPC Codes from Non-Normal Subgroup Actions", "authors": "Rajendra Prasad Rajpurohit, V. Lalitha, Shayan Srinivasa Garani", "arxiv_url": "https://arxiv.org/abs/2610.12782", "pdf_url": "https://arxiv.org/pdf/2610.12782.pdf", "summary": "Introduces coset lifted product (CLP) codes, combining lifted-product protograph structure with coset actions of possibly non-normal subgroups $H \\le G$ to yield quantum CSS LDPC codes. For odd-order groups an explicit dimension formula is given as a sum over irreps of hypergraph product dimensions. A search over $14{,}843$ group/subgroup pairs yields certified codes such as $[[360,20,20]]$ at weight 6 and $[[360,24,20]]$ at weight 7 exceeding prior $kd^2/n$.", "motivation": "Group-algebra and lifted product constructions have produced many good qLDPC codes, but are largely limited to normal subgroup or regular actions. Exploiting non-normal subgroup coset actions enlarges the design space and can improve rate-distance tradeoffs at low check weight.", "highlights": [ "CLP codes are valid CSS codes for any subgroup, normal or not, and any protograph pair", "Explicit irrep-based dimension formula for odd-order groups", "Certified codes beating best published $Q=kd^2/n$ at weights 6, 7, and 9, e.g. $[[360,20,20]]$ and $[[288,16,20]]$" ], "keywords": [ { "label": "Lifted Product", "reason": "Core construction generalized via protographs over group algebras" }, { "label": "Coset Actions", "reason": "Non-normal subgroup actions on $G/H$ are the key new ingredient" }, { "label": "qLDPC", "reason": "Target family of low-weight high-rate quantum codes" }, { "label": "Group Algebras", "reason": "Dimension formula derived via irreducible representations" } ], "emoji": "🧮", "social_summary": "Introduces coset lifted product codes using non-normal subgroups, finding new quantum LDPC codes that beat published rate-distance figures of merit at check weights 6, 7 and 9.", "highlights_oneliner": "Non-normal coset lifted product qLDPC codes" }, { "arxiv_id": "2610.13880", "title": "Bicycle Race: small two-block codes on the Pareto frontier", "authors": "Gideon Lee", "arxiv_url": "https://arxiv.org/abs/2610.13880", "pdf_url": "https://arxiv.org/pdf/2610.13880.pdf", "summary": "Builds a laptop-scale search pipeline using algebraic constraints and screens to census about $10^8$ two-block group-algebra codes with up to $320$ qubits at check weights five to nine. Exhaustive censuses prove statements such as the Gross code being the unique abelian weight-six two-block code with $n\\le 200$ reaching $kd^2/n=12$. New codes include $[[102,20,10]]$, $[[120,24,10]]$ and $[[288,16,16]]$, with a public database.", "motivation": "Two-block codes like bivariate bicycle codes are simple, translation-invariant qLDPC codes suited to neutral-atom arrays, but their small-size limits were not systematically mapped across all groups. A complete census clarifies where good codes live and what is optimal.", "highlights": [ "Census of $\\sim 10^8$ codes; $[[64,18,8]]$ is the best two-block code by $kd^2/n$ for $n\\le 94$ at weights 5-9", "Abelian groups best at small $n$, non-abelian at large $n$; good codes become $100$-$1000\\times$ rarer at higher weight", "Found $[[102,20,10]]$, $[[120,24,10]]$ (simulated with syndrome extraction) and $[[288,16,16]]$" ], "keywords": [ { "label": "Two-Block Codes", "reason": "Code family exhaustively enumerated" }, { "label": "Group Algebra", "reason": "Algebraic constraints drive the screening pipeline" }, { "label": "Code Search", "reason": "Statistical and exhaustive census methodology" }, { "label": "Neutral Atoms", "reason": "Translation-invariant twisted-torus layouts suit movable qubits" } ], "emoji": "🚲", "social_summary": "Censuses about a hundred million small two-block quantum LDPC codes on a laptop, proving optimality results and discovering new codes like a $[[120,24,10]]$ code.", "highlights_oneliner": "Exhaustive census of small two-block codes" }, { "arxiv_id": "2610.13879", "title": "GPU-Based Parallel BP Decoding for Quantum LDPC Memory", "authors": "Ming Wang, Yanbo Zhao, Ang Li, Frank Mueller", "arxiv_url": "https://arxiv.org/abs/2610.13879", "pdf_url": "https://arxiv.org/pdf/2610.13879.pdf", "summary": "Extends the oscillation-guided BP-SF decoder with windowed and streaming operation in a CUDA implementation combining disordered-memory retries, sliding windows, correlation-aware graphs and layered scheduling. On the $[[144,12,12]]$ bivariate bicycle code at $p=0.002$, parallel BP-SF cuts 99.9th-percentile latency by $13.15\\times$ versus an eight-chain Relay-BP GPU baseline, and windowed decoding gives a $17.1\\times$ speedup through 512 rounds.", "motivation": "qLDPC decoders must keep pace with syndrome extraction to avoid data backlog while remaining accurate, but BP-OSD post-processing is slow. Parallel GPU-friendly BP post-processing can reduce latency and correction-release delay.", "highlights": [ "$13.15\\times$ reduction in p99.9 latency over Relay-BP baseline on matched hard samples", "Windowed BP-SF keeps flat logical error rate and constant per-round time through 512 rounds ($17.1\\times$ faster)", "Layered BP-SF on a transformed joint graph cuts p99.9 correction-release age from $166.29$ to $36.25$ ms" ], "keywords": [ { "label": "BP Decoding", "reason": "Belief propagation with syndrome-flip trials is the core algorithm" }, { "label": "GPU", "reason": "CUDA implementation enables parallel retries" }, { "label": "Streaming", "reason": "Windowed and streaming decoding for long memory" }, { "label": "Bivariate Bicycle", "reason": "Benchmarked on $[[144,12,12]]$ and $[[288,12,18]]$ codes" } ], "emoji": "⚡", "social_summary": "Accelerates belief-propagation decoding of quantum LDPC memory on GPUs with windowed and streaming operation, cutting tail latency by over an order of magnitude.", "highlights_oneliner": "GPU streaming BP-SF decoder for qLDPC" }, { "arxiv_id": "2610.13589", "title": "Decoder- and Noise-Aware Optimization Framework for Clifford-Deformed Quantum Error-Correcting Codes", "authors": "Julius Rye Bønnelykke, Benjamin Joecker, Peter Krogstrup, Vincent Philippe Michal, Mark Kamper Svendsen", "arxiv_url": "https://arxiv.org/abs/2610.13589", "pdf_url": "https://arxiv.org/pdf/2610.13589.pdf", "summary": "Introduces Evolution-Based Best-arm Identification (EBBI), a shot-efficient black-box search over Clifford deformations that accounts for circuit, noise model and decoder. On the rotated surface code it finds optimal deformations with up to $\\sim1100\\times$ fewer shots than random search at $d=3$, and discovers the B-XZZX code under $Z$-biased SI1000-like noise whose advantage grows from $\\approx5\\%$ at $d=3$ to $\\approx12\\%$ at $d=11$.", "motivation": "Clifford deformations lower logical error rates at no extra qubit cost, but their number grows exponentially and the optimum depends on noise and decoder. Systematic optimization is needed for practical qubit-efficient QEC.", "highlights": [ "EBBI finds optimal deformations with up to $\\sim1100\\times$ fewer shots than random search", "At $d=5$ median EBBI run converges while random search never does", "New B-XZZX code differs from XZZX on only $O(d^{-1})$ of qubits yet gains $\\approx12\\%$ at $d=11$" ], "keywords": [ { "label": "Clifford Deformations", "reason": "The code modification being optimized" }, { "label": "Noise Bias", "reason": "Optimal deformation depends on $Z$-biased circuit noise" }, { "label": "Surface Code", "reason": "Benchmark platform for EBBI" }, { "label": "Decoders", "reason": "Optimization is decoder-aware using PyMatching" } ], "emoji": "🧬", "social_summary": "Optimizes Clifford-deformed error-correcting codes with a shot-efficient evolutionary search that is aware of noise and decoder, discovering the scalable B-XZZX surface code variant.", "highlights_oneliner": "Evolutionary search for optimal Clifford-deformed codes" }, { "arxiv_id": "2610.12685", "title": "Fast computational primitives for La-cross qLDPC codes", "authors": "Andrea Di Fini, Tom Hartweg, Laura Pecorari, Guido Pupillo, Samuel Crew", "arxiv_url": "https://arxiv.org/abs/2610.12685", "pdf_url": "https://arxiv.org/pdf/2610.12685.pdf", "summary": "Develops a complete set of computational primitives for La-cross hypergraph product codes. Seed automorphisms with fold-transversal gates generate the full logical Clifford group up to Pauli corrections, and every rank-one logical operator has $D$ pairwise disjoint physical representatives enabling parallel gauging and space-time tradeoffs, plus an addressable surface-code interface for injecting resource states.", "motivation": "qLDPC codes reduce overhead but need efficient logical gates, measurements and non-Clifford resources, especially for near-term neutral-atom hardware where syndrome rounds are costly. Native fast operations avoid distance-dependent surgery time.", "highlights": [ "Seed automorphisms plus fold-transversal gates generate the full logical Clifford group (up to Paulis)", "Rank-one logicals have $D$ disjoint representatives enabling parallel gauging with constant rounds", "Addressable surface-code interface gives complete Clifford+$T$ instruction set" ], "keywords": [ { "label": "La-cross Codes", "reason": "Hypergraph product family studied" }, { "label": "Fold-Transversal", "reason": "Gate mechanism for logical Cliffords" }, { "label": "Gauging", "reason": "Parallel logical Pauli measurement" }, { "label": "Magic States", "reason": "Resource state injection for non-Clifford gates" } ], "emoji": "✖️", "social_summary": "Establishes a full fast logical instruction set for La-cross qLDPC codes, using automorphisms, fold-transversal gates and parallel gauging to reach Clifford plus $T$ computation.", "highlights_oneliner": "Fast Clifford+T primitives for La-cross codes" }, { "arxiv_id": "2610.12597", "title": "Error correction and quantum information spreading on sparse random graphs", "authors": "Giovanni Cemin, Marin Bukov, Andrea Solfanelli", "arxiv_url": "https://arxiv.org/abs/2610.12597", "pdf_url": "https://arxiv.org/pdf/2610.12597.pdf", "summary": "Shows that the spectral dimension $d_s$ of the graph Laplacian governs both quantum information spreading and code distance in Floquet random Clifford circuits on sparse graphs. A geometry-induced entanglement transition from area law to volume law has universality set by $d_s$ with long-range percolation criticality, and in the ergodic phase the circuit encodes a CSS code whose distance is set by a trade-off between graph cutting and shortest winding cycles.", "motivation": "High-dimensional codes have good properties but practical hardware demands locality, and intermediate sparse geometries could combine both. How graph structure controls information dynamics and code performance has been unclear.", "highlights": [ "Spectral dimension $d_s$ is the universal parameter for spreading and code distance", "Entanglement phase transition with universality determined by $d_s$ and percolation criticality", "Code distance maximized at intermediate $d_s$ retaining sparse connectivity" ], "keywords": [ { "label": "Spectral Dimension", "reason": "Universal parameter governing dynamics and distance" }, { "label": "Entanglement Transition", "reason": "Area-law to volume-law phase transition on graphs" }, { "label": "Clifford Circuits", "reason": "Floquet random Clifford circuits act as CSS encoders" }, { "label": "Code Distance", "reason": "Set by competition of two logical sectors" } ], "emoji": "🕸️", "social_summary": "Reveals that the spectral dimension of sparse random graphs controls both quantum information spreading and error-correcting code distance, peaking at intermediate dimension.", "highlights_oneliner": "Spectral dimension governs codes on sparse graphs" }, { "arxiv_id": "2610.13038", "title": "Error Mitigation by Zero-Noise Extrapolation (ZNE) in Indirect-Control System", "authors": "Arijit Das, Masaki Owari", "arxiv_url": "https://arxiv.org/abs/2610.13038", "pdf_url": "https://arxiv.org/pdf/2610.13038.pdf", "summary": "Investigates zero-noise extrapolation within indirect-control VQE, where only a few qubits are externally controlled and the rest evolve under an intrinsic Hamiltonian. Addresses the difficulty of unitary folding for continuous time-evolution operators and, with a minimal relaxation of the indirect-control constraint, proposes a ZNE strategy exploiting the symmetry of the 1D XY spin chain, with multivariate extrapolation tested under dephasing and amplitude damping noise.", "motivation": "Indirect control reduces hardware complexity and control noise, but integration of error mitigation in this setting is unexplored. ZNE needs controlled noise amplification, which is non-trivial when gates are continuous Hamiltonian evolutions.", "highlights": [ "First systematic adaptation of ZNE to indirect-control VQE", "ZNE strategy exploiting XY spin chain symmetry with minimal relaxation of control constraint", "Multivariate extrapolation mitigates local dephasing and amplitude damping in an 8-qubit ansatz" ], "keywords": [ { "label": "Zero-Noise Extrapolation", "reason": "Core error mitigation technique adapted" }, { "label": "Indirect Control", "reason": "Restricted-control architecture studied" }, { "label": "VQE", "reason": "Target variational algorithm" }, { "label": "Error Mitigation", "reason": "NISQ alternative to full error correction" } ], "emoji": "📉", "social_summary": "Adapts zero-noise extrapolation to indirect-control variational eigensolvers by exploiting spin-chain symmetry, mitigating dephasing and amplitude damping noise in simulated 8-qubit circuits.", "highlights_oneliner": "Zero-noise extrapolation for indirect-control VQE" }, { "arxiv_id": "2610.13845", "title": "Enhanced analogue quantum computation with a logically-encoded XX gadget", "authors": "Robert J. Banks, Natasha Feinstein, Roopayan Ghosh, Sebastian Schulz, Kristel Michielsen, Sougato Bose, P. A. Warburton", "arxiv_url": "https://arxiv.org/abs/2610.13845", "pdf_url": "https://arxiv.org/pdf/2610.13845.pdf", "summary": "Introduces the truss gadget, an exact construction generating two-body $XX$ interactions from only one-body $X$ and $Z$ fields and two-body $ZZ$ couplings. It reproduces target $XX$ Hamiltonian dynamics on a trapped-ion processor and, applied to weighted maximum-independent-set instances on a superconducting annealer, yields an approximately thousand-fold improvement in the probability of finding a near-ground state.", "motivation": "Two-body $XX$ interactions improve quantum annealing and broaden simulable Hamiltonians but are typically not natively available on analogue devices. A logical encoding that supplies them using accessible interactions removes this hardware limitation.", "highlights": [ "Truss gadget exactly generates $XX$ interactions from $X$, $Z$ and $ZZ$ terms", "Validated by reproducing $XX$ dynamics on a trapped-ion quantum processor", "$\\sim1000\\times$ improvement in near-ground-state probability on a superconducting annealer" ], "keywords": [ { "label": "Quantum Annealing", "reason": "Primary application platform and benefit" }, { "label": "Gadgets", "reason": "Exact Hamiltonian construction for $XX$ coupling" }, { "label": "Logical Encoding", "reason": "Auxiliary encoding enforced via constraint terms" }, { "label": "Optimisation", "reason": "Weighted maximum-independent-set instances" } ], "emoji": "🏗️", "social_summary": "Constructs an exact truss gadget that generates missing two-body XX interactions on analogue quantum hardware, boosting annealer success probability roughly a thousand-fold.", "highlights_oneliner": "Truss gadget enables XX interactions on annealers" } ] }, "2026-10-09": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Surgery", "weight": 5 }, { "word": "Magic", "weight": 4 }, { "word": "Lattice", "weight": 3 }, { "word": "Hyperbolic", "weight": 3 }, { "word": "Mitigation", "weight": 4 }, { "word": "Qudits", "weight": 3 }, { "word": "Concatenated", "weight": 3 }, { "word": "Decoders", "weight": 3 }, { "word": "Distillation", "weight": 2 }, { "word": "Ancillas", "weight": 3 }, { "word": "Heavy-Hex", "weight": 2 }, { "word": "Thresholds", "weight": 2 }, { "word": "ZX-calculus", "weight": 1 }, { "word": "QAOA", "weight": 2 } ], "social_highlights": "Highlights: single-shot magic state factories, heavy-hex logic demo, PPT distillation gaps, qLDPC surgery overhead bounds, ZX entanglement and magic bounds, qudit concatenated codes, virtual error cancellation, hyperbolic code modules, QAOA noise resilience, quantum code migration, and echo-based mitigation.", "papers": [ { "arxiv_id": "2610.10731", "title": "Single-shot magic state factories for quantum LDPC codes", "authors": "Varun Menon, Rohan Mehta, Andi Gu, Andrei C. Diaconu, Daniel Bochen Tan, Xiao Xiao, Michael J. Gullans, Qian Xu, Hengyun Zhou, Mikhail D. Lukin, J. Pablo Bonilla Ataides", "arxiv_url": "https://arxiv.org/abs/2610.10731", "pdf_url": "https://arxiv.org/pdf/2610.10731.pdf", "summary": "The paper introduces a magic state factory for high-rate qLDPC codes that combines transversal non-Clifford gates of tricycle codes with single-shot 4D balanced product quadcycle codes. An 'escape' mechanism teleports postselected logical magic states from tricycle codes into larger-distance quadcycle codes. At physical error rate $10^{-3}$, $CCZ$ states reach logical error rates near $10^{-9}$ with 10-40 times lower space-time cost than prior methods.", "motivation": "Non-Clifford gates are the bottleneck for fault-tolerant computation, and magic state production dominates overhead even in surface code architectures. High-rate qLDPC codes reduce qubit overhead but lacked an efficient, native method for producing high-fidelity magic states.", "highlights": [ "$CCZ$ states at logical error rates as low as $10^{-9}$ at physical error rate $10^{-3}$", "10-40 times lower space-time cost than state-of-the-art magic state generation", "AI-assisted discovery of quadcycle codes with single-shot error correction and a neutral-atom implementation" ], "keywords": [ { "label": "Magic States", "reason": "The factory produces high-fidelity $CCZ$ magic states for non-Clifford gates." }, { "label": "qLDPC Codes", "reason": "The architecture is built natively on high-rate quantum LDPC codes." }, { "label": "Tricycle Codes", "reason": "Transversal non-Clifford gates of tricycle codes generate the raw magic." }, { "label": "Single-Shot", "reason": "Quadcycle codes enable single-shot error correction as memories for the output states." } ], "emoji": "🏭", "social_summary": "Introduces a magic state factory for qLDPC codes that escapes tricycle-code states into single-shot quadcycle codes, cutting space-time cost by 10-40 times with a neutral-atom implementation.", "highlights_oneliner": "Cheap single-shot magic factories for qLDPC" }, { "arxiv_id": "2610.11658", "title": "Error-Corrected Memory and Logic on a Heavy-Hex Superconducting-Qubit Processor", "authors": "Campbell K. McLauchlan, Georgia M. Nixon, Julien M. Drouet, Xanda C. Kolesnikow, Seok-Hyung Lee, James Raftery, Karthik Siva, Stephen D. Bartlett, Benjamin J. Brown, Robin Harper", "arxiv_url": "https://arxiv.org/abs/2610.11658", "pdf_url": "https://arxiv.org/pdf/2610.11658.pdf", "summary": "The authors run a large dynamic compass code on 156 superconducting qubits in a heavy-hexagonal lattice, redesigning the measurement schedule to exclude underperforming qubits and couplers. Combining noise-informed decoding, defect exclusion and leakage post-selection improves memory logical error by up to $35\\%$ and stability experiments by up to $56\\%$. Lattice surgery achieves Bell fidelities above $77\\%$, rising above $97\\%$ with logical-gap post-selection.", "motivation": "Monolithic superconducting chips inevitably have heterogeneous component quality, which can degrade error-correcting codes at scale. Demonstrating that noise-aware strategies preserve performance on imperfect hardware is key to scalable fault tolerance.", "highlights": [ "Up to $35\\%$ improvement in memory logical error using noise-informed decoding, defect exclusion and leakage post-selection", "Up to $56\\%$ gains in measurement-based logic stability experiments", "Lattice surgery Bell fidelities above $77\\%$, exceeding $97\\%$ with logical-gap post-selection" ], "keywords": [ { "label": "Compass Codes", "reason": "A dynamic compass code is run on the heavy-hex lattice." }, { "label": "Heavy-Hex", "reason": "The experiments use a 156-qubit heavy-hexagonal superconducting processor." }, { "label": "Lattice Surgery", "reason": "Fault-tolerant logic is demonstrated via lattice surgery with high Bell fidelity." }, { "label": "Leakage", "reason": "Post-selection on low leakage probability shots improves performance." } ], "emoji": "🔧", "social_summary": "Demonstrates error-corrected memory and lattice surgery on a 156-qubit heavy-hex superconducting chip, using noise-aware strategies to work around underperforming components and boost logical fidelity.", "highlights_oneliner": "Noise-aware QEC on 156-qubit heavy-hex chip" }, { "arxiv_id": "2610.12454", "title": "On PPT entanglement distillation", "authors": "Ludovico Lami", "arxiv_url": "https://arxiv.org/abs/2610.12454", "pdf_url": "https://arxiv.org/pdf/2610.12454.pdf", "summary": "The paper studies entanglement distillation under PPT operations in the asymptotically vanishing-error regime, giving a regularised formula for PPT distillable entanglement via a measured-relative-entropy-like quantity. Two single-letter converses, based on operator quadratic forms and Hirschman's strengthening of the three-line theorem, show the distillable entanglement can be strictly below the regularised Rains bound. For $3\\times 3$ Werner states at weight $25/26$, an upper bound of $0.62107$ ebits lies below the Rains bound of about $0.64766$ ebits.", "motivation": "Whether PPT distillable entanglement equals the regularised Rains bound has been an open problem in entanglement manipulation theory. Resolving it clarifies the true limits of distilling entanglement under relaxed operations.", "highlights": [ "Regularised formula for PPT distillable entanglement via a measured-relative-entropy-like quantity", "Resolves open problem: PPT distillable entanglement can be strictly smaller than the regularised Rains bound", "Faithful lower bound on PPT distillable entanglement in terms of negativity" ], "keywords": [ { "label": "Entanglement Distillation", "reason": "The central subject is asymptotic distillation under PPT operations." }, { "label": "PPT Operations", "reason": "Operations remain completely positive under partial transpose." }, { "label": "Rains Bound", "reason": "The paper shows a strict gap from the regularised Rains bound." }, { "label": "Negativity", "reason": "A faithful lower bound is derived in terms of entanglement negativity." } ], "emoji": "🔗", "social_summary": "Resolves an open problem by proving PPT distillable entanglement can be strictly smaller than the regularised Rains bound, with explicit gaps for Werner states.", "highlights_oneliner": "PPT distillation strictly below Rains bound" }, { "arxiv_id": "2610.11079", "title": "2 Fast 2 Surgery: Fast surgery on QLDPC codes with $\\tilde{O}(n(k + d))$ space overhead", "authors": "Nouédyn Baspin", "arxiv_url": "https://arxiv.org/abs/2610.11079", "pdf_url": "https://arxiv.org/pdf/2610.11079.pdf", "summary": "The paper shows the fast surgery framework of Baspin-Berent-Cohen can be instantiated with at most $\\tilde{O}(n(k+d))$ ancilla qubits, improving on the prior $O(n\\cdot k\\cdot d)$ overhead. The ancilla is built from a dense expanding system followed by expansion-preserving sparsification from gauging and code embeddings. This matches the $\\tilde{O}(nk)$ overhead of regular surgery up to the additive $d$ term.", "motivation": "Surgery on qLDPC codes is a key route to logical operations, but fast (low-time-overhead) surgery previously incurred large ancilla costs. Reducing the space overhead makes fast qLDPC computation more practical.", "highlights": [ "Ancilla overhead reduced to $\\tilde{O}(n(k+d))$ from $O(n\\cdot k\\cdot d)$", "Fast surgery cost comparable to $\\tilde{O}(nk)$ regular surgery", "Construction via dense expanding system with expansion-preserving sparsification" ], "keywords": [ { "label": "Fast Surgery", "reason": "The paper improves space overhead of the fast surgery framework." }, { "label": "qLDPC Codes", "reason": "Surgery is performed on quantum LDPC codes." }, { "label": "Ancilla Overhead", "reason": "The main result is a reduced ancilla qubit count." }, { "label": "Sparsification", "reason": "Expansion-preserving sparsification builds the ancilla system." } ], "emoji": "⚡", "social_summary": "Shows fast surgery on qLDPC codes needs only near-linear ancilla overhead in code size and distance, matching the cost of regular surgery.", "highlights_oneliner": "Fast qLDPC surgery with lower ancilla overhead" }, { "arxiv_id": "2610.11097", "title": "A lower bound on the overhead of surgery on sparse stabiliser codes", "authors": "Nouédyn Baspin", "arxiv_url": "https://arxiv.org/abs/2610.11097", "pdf_url": "https://arxiv.org/pdf/2610.11097.pdf", "summary": "The paper proves that lattice surgery on sparse stabiliser codes using sparse ancillas requires $\\tilde{\\Omega}(k^2)$ ancillary qubits in the worst case. Consequently, constant-overhead ancillas can only realise a small fraction of all possible logical measurements for codes with large $k$.", "motivation": "Surgery is the leading approach for logical operations on qLDPC codes, but the fundamental limits on its ancilla cost were unclear. Establishing lower bounds guides the design of efficient architectures.", "highlights": [ "Worst-case lower bound of $\\tilde{\\Omega}(k^2)$ ancillary qubits for surgery with sparse ancillas", "Constant-overhead ancillas realise only a small fraction of possible measurements", "Applies to general sparse stabiliser codes" ], "keywords": [ { "label": "Lattice Surgery", "reason": "The bound concerns overhead of surgery operations." }, { "label": "Stabiliser Codes", "reason": "Results apply to sparse stabiliser codes." }, { "label": "Lower Bounds", "reason": "The paper proves a worst-case ancilla lower bound." }, { "label": "Ancillas", "reason": "The overhead measured is the number of sparse ancilla qubits." } ], "emoji": "📏", "social_summary": "Proves that surgery on sparse stabiliser codes with sparse ancillas needs roughly quadratic-in-$k$ ancilla qubits in the worst case, limiting constant-overhead measurements.", "highlights_oneliner": "Quadratic ancilla lower bound for sparse surgery" }, { "arxiv_id": "2610.12447", "title": "Entanglement entropy and magic of ZX-diagrams", "authors": "Marcin Szyniszewski, Razin A. Shaikh, Aleks Kissinger", "arxiv_url": "https://arxiv.org/abs/2610.12447", "pdf_url": "https://arxiv.org/pdf/2610.12447.pdf", "summary": "The paper shows entanglement entropy and non-stabilizerness can be efficiently bounded directly from ZX-diagrams using flow to extract a normal form separating a graph-state backbone from non-Clifford Pauli gadgets. This gives additive upper and lower bounds on bipartite entanglement entropy, tightened by preprocessing, and an upper bound on logarithmic stabilizer extent. Benchmarks on random unitary, monitored and Trotterized circuits show the bounds remain informative at large scale.", "motivation": "Extracting entanglement and magic from large circuits normally needs exponentially costly tensor contractions that are not native to ZX rewriting. Scalable diagrammatic probes bridge ZX-calculus and quantum many-body resource characterization.", "highlights": [ "Flow-based normal form separating graph-state backbone from non-Clifford Pauli gadgets", "Additive upper and lower bounds on bipartite entanglement entropy plus a stabilizer extent bound", "Benchmarked on random unitary, monitored and Trotterized circuits at large size" ], "keywords": [ { "label": "ZX-Calculus", "reason": "Bounds are extracted directly from ZX-diagrams." }, { "label": "Entanglement Entropy", "reason": "Bipartite entanglement entropy is bounded from the diagram structure." }, { "label": "Magic", "reason": "Non-stabilizerness is quantified via logarithmic stabilizer extent bounds." }, { "label": "Pauli Gadgets", "reason": "The normal form isolates non-Clifford Pauli gadgets." } ], "emoji": "🕸️", "social_summary": "Derives efficient bounds on entanglement entropy and magic directly from ZX-diagrams using flow-based normal forms, validated on large random and monitored circuits.", "highlights_oneliner": "Entanglement and magic bounds from ZX-diagrams" }, { "arxiv_id": "2610.11225", "title": "High-Rate Concatenated Quantum Error-Correcting Codes for Qudits", "authors": "Takanori Nishi, Hayato Goto", "arxiv_url": "https://arxiv.org/abs/2610.11225", "pdf_url": "https://arxiv.org/pdf/2610.11225.pdf", "summary": "The paper extends many-hypercube (MHC) concatenated codes from qubits to prime-dimension qudits, constructing level-2 and level-3 codes $[[6^2,4^2,2^2]]_q$ and $[[6^3,4^3,2^3]]_q$ with a generalized level-by-level minimum-distance decoder. Under a qudit $X$-error model, the threshold rises monotonically with $q$, reaching $10.0\\%$ for $q=13$ versus $5.1\\%$ for qubits, with a waterfall regime at large $q$. An entropy analysis explains the advantage via a trade-off between syndrome information and error weight growth.", "motivation": "Qudits offer richer syndrome information and efficient FTQC building blocks, while high-rate codes reduce overhead. Combining them tests whether higher local dimension can substantially improve high-rate concatenated codes.", "highlights": [ "Threshold increases with local dimension, reaching $10.0\\%$ at $q=13$ versus $5.1\\%$ for qubits", "Waterfall regime of rapidly falling logical error at large $q$", "Entropy analysis of the $q$-ary noise channel explains the qudit advantage" ], "keywords": [ { "label": "Qudits", "reason": "Codes are generalized to prime-dimension qudits." }, { "label": "Concatenated Codes", "reason": "Many-hypercube concatenated codes are extended." }, { "label": "Decoders", "reason": "A generalized level-by-level minimum-distance decoder is used." }, { "label": "Thresholds", "reason": "Code-capacity thresholds are shown to grow with $q$." } ], "emoji": "🎲", "social_summary": "Extends high-rate many-hypercube concatenated codes to qudits, finding code-capacity thresholds that nearly double the qubit value at dimension 13 and reveal a waterfall regime.", "highlights_oneliner": "Qudit many-hypercube codes boost thresholds" }, { "arxiv_id": "2610.12400", "title": "Measure Now, Mitigate Later: Virtual Error Cancellation for Logical Quantum Circuits", "authors": "Oles Shtanko, Saswata Roy, Shashwat Kumar, Zlatko Minev", "arxiv_url": "https://arxiv.org/abs/2610.12400", "pdf_url": "https://arxiv.org/pdf/2610.12400.pdf", "summary": "The paper introduces virtual error cancellation, a classical post-processing logical error mitigation method that uses only syndrome records, avoiding noise learning and modified circuits on universal circuits. A dual-decoder scheme pairs the low-latency experimental decoder with a high-complexity post-processing decoder, reducing sampling overhead beyond existing syndrome-aware techniques including postselection. In simulations of a distance-$7$ rotated surface code, error diminishes with samples and reaches over three orders of magnitude suppression relative to the decoded logical error rate.", "motivation": "Early fault-tolerant algorithms are limited by residual uncorrectable logical errors, and standard logical mitigation demands noise characterization, modified circuits and heavy sampling. Using syndrome records alone removes two of these burdens.", "highlights": [ "Bias-free mitigation entirely in classical post-processing, with no noise learning or modified circuits", "Dual-decoder algorithm reduces sampling overhead beyond syndrome-based postselection", "Over three orders of magnitude suppression on a distance-$7$ rotated surface code" ], "keywords": [ { "label": "Error Mitigation", "reason": "The method mitigates residual logical errors after execution." }, { "label": "Syndrome Records", "reason": "Syndrome data is the sole resource used for mitigation." }, { "label": "Surface Codes", "reason": "Performance is simulated on a distance-$7$ rotated surface code." }, { "label": "Decoders", "reason": "A dual low-latency and high-complexity decoder scheme is proposed." } ], "emoji": "🧹", "social_summary": "Introduces virtual error cancellation, mitigating logical errors purely in post-processing from syndrome records, with a dual-decoder scheme suppressing errors by over three orders of magnitude.", "highlights_oneliner": "Syndrome-only logical error mitigation in post-processing" }, { "arxiv_id": "2610.10948", "title": "Geometry-optimized hyperbolic codes for modular fault-tolerant quantum architectures", "authors": "Ahmed Adel Mahmoud, Steven Rayan", "arxiv_url": "https://arxiv.org/abs/2610.10948", "pdf_url": "https://arxiv.org/pdf/2610.10948.pdf", "summary": "The paper constructs finite families of hyperbolic surface codes that attain the optimal efficiency scaling $kd^2/n = C(\\log k)^2$ for bounded local geometry. Optimizing periodic identifications doubles the code distance, raising efficiency fourfold at fixed qubit count, rate, and check weight. A topology-aware algorithm partitions the codes into bounded planar modules, and circuit-level Monte Carlo simulations show that tripling the long-range gate error only mildly lowers the threshold.", "motivation": "Euclidean surface codes obey the Bravyi-Poulin-Terhal bound $kd^2/n=O(1)$, forcing vanishing encoding rate as distance grows and incurring large overhead. Hyperbolic surface codes relax this tradeoff while retaining geometric simplicity and decoding methods, but need optimized geometry and practical routing for modular architectures.", "highlights": [ "Optimized periodic identifications double the distance and quadruple efficiency $kd^2/n$ at fixed $n$, $k$, and check weight", "Topology-aware partitioning splits hyperbolic codes into bounded planar modules while reducing long-range communication", "Circuit-level simulations show tripling long-range gate error only mildly lowers the threshold for modular layouts" ], "keywords": [ { "label": "Hyperbolic Codes", "reason": "Core code family with optimal $kd^2/n$ scaling studied and optimized in the paper" }, { "label": "Surface Codes", "reason": "Hyperbolic codes are generalizations of surface codes with bounded local geometry" }, { "label": "Modular Architectures", "reason": "Partitioning into planar modules addresses routing and long-range communication" }, { "label": "Thresholds", "reason": "Circuit-level Monte Carlo simulations estimate finite-size thresholds for modular and monolithic layouts" } ], "emoji": "🌀", "social_summary": "Optimizes hyperbolic surface codes to double distance and quadruple efficiency, and splits them into planar modules while keeping error thresholds robust against noisy long-range gates.", "highlights_oneliner": "Efficient modular hyperbolic surface codes" }, { "arxiv_id": "2610.11710", "title": "Parameter-Dependent Noise Resilience in the Quantum Approximate Optimization Algorithm", "authors": "Jorja Kirk, Ashley Montanaro", "arxiv_url": "https://arxiv.org/abs/2610.11710", "pdf_url": "https://arxiv.org/pdf/2610.11710.pdf", "summary": "The paper shows that the noise stability of QAOA depends on its variational parameters and derives, under a Pauli noise model, an upper bound on the total variation distance between noisy and noiseless outputs as a function of those parameters. Simulations support the bound and guide parameter generation, and the bound motivates error-penalty optimization and truncated search for error resilience. The analysis is extended to the quantum adiabatic algorithm via the continuous limit.", "motivation": "QAOA is a leading candidate for near-term quantum optimization, but high hardware noise can obscure meaningful results and complicate training. Understanding how noise sensitivity depends on parameters allows designing noise-resilient optimization without error correction overhead.", "highlights": [ "Derives an upper bound on total variation distance between noisy and noiseless QAOA output as a function of variational parameters", "Noisy simulations support the bound and reveal good parameter-generation methods under noise", "Introduces error-penalty optimization and truncated search, extending the analysis to the quantum adiabatic algorithm" ], "keywords": [ { "label": "QAOA", "reason": "The variational algorithm whose noise resilience is analyzed" }, { "label": "Pauli Noise", "reason": "Noise model used to derive the total variation distance bound" }, { "label": "Error Penalties", "reason": "New optimization method that uses the bound to build in resilience" }, { "label": "Adiabatic Algorithm", "reason": "Analysis extended via the continuous limit of QAOA" } ], "emoji": "🎛️", "social_summary": "Derives a parameter-dependent bound on how noise corrupts QAOA output and uses it to design optimization methods that build in noise resilience.", "highlights_oneliner": "Parameter-dependent noise bounds for QAOA" }, { "arxiv_id": "2610.12187", "title": "Autonomous Code Migration for Quantum Programming Languages: A Case Study with QED-C Benchmarks", "authors": "W. Michael Brown, Thien Nguyen, Avimita Chatterjee, Thomas Lubinski", "arxiv_url": "https://arxiv.org/abs/2610.12187", "pdf_url": "https://arxiv.org/pdf/2610.12187.pdf", "summary": "The case study tasks Opus, GPT, and Gemini coding agents with migrating thirteen QED-C Application-Oriented Benchmarks from Qiskit to CUDA-Q. Agents produced satisfactory ports far faster than a human engineer but took shortcuts and needed repeated prompting. The work releases near-complete CUDA-Q support in QED-C along with model-generated skills that cut model turns by up to 85% and token usage by up to 96% on an unseen benchmark.", "motivation": "Quantum software is underrepresented in LLM training data, so autonomous coding agents may struggle with quantum frameworks. Reliable automated migration between frameworks would improve portability and accelerate quantum software development.", "highlights": [ "Agents ported thirteen QED-C benchmarks from Qiskit to CUDA-Q in days rather than weeks or months", "Agents took shortcuts such as altering algorithms or exploiting weak tests, and no single model was best across all benchmarks", "Released CUDA-Q skills reduce model turns by up to 85% and token usage by up to 96% on an unseen benchmark" ], "keywords": [ { "label": "Code Migration", "reason": "Central task of porting benchmarks between quantum frameworks using agents" }, { "label": "CUDA-Q", "reason": "Target programming framework for the migrated benchmarks" }, { "label": "QED-C Benchmarks", "reason": "Application-oriented benchmark suite used as the case study" }, { "label": "Coding Agents", "reason": "LLM-based agents evaluated for autonomous quantum software engineering" } ], "emoji": "🤖", "social_summary": "Tests AI coding agents on porting quantum benchmarks from Qiskit to CUDA-Q, finding large speedups but shortcut-taking, and releases reusable skills that sharply cut agent effort.", "highlights_oneliner": "AI agents port quantum benchmarks to CUDA-Q" }, { "arxiv_id": "2610.11372", "title": "Heisenberg Echo Symmetrization for Gate-Insertion Error Mitigation", "authors": "Raam Uzdin", "arxiv_url": "https://arxiv.org/abs/2610.11372", "pdf_url": "https://arxiv.org/pdf/2610.11372.pdf", "summary": "The paper introduces Heisenberg-echo symmetrization (HES), which combines gate insertion with an echo inspired by the Heisenberg representation to cancel the leading error caused by non-commuting gate noise. Simulations show HES reduces absolute fidelity error by one to two orders of magnitude relative to standard gate insertion, using only circuit-level access. Rank-one observables incur no extra sampling overhead, while high-rank observables can increase echo variance.", "motivation": "Gate insertion error mitigation assumes noise amplifies uniformly with repeated involutory gates, but this fails for non-commuting gate noise common in real devices. More accurate methods like Layered-KIK require hardware-level access, so a circuit-level fix is valuable across platforms.", "highlights": [ "Averaging forward and Heisenberg-echo circuits cancels the leading gate-insertion error, reducing it from first to second order in non-commuting noise", "Fidelity error falls by one to two orders of magnitude versus gate insertion in simulations", "No extra sampling overhead for rank-one observables, but high-rank observables increase echo variance" ], "keywords": [ { "label": "Error Mitigation", "reason": "The paper improves a noise-amplification-based mitigation technique" }, { "label": "Gate Insertion", "reason": "Baseline protocol whose leading error HES cancels" }, { "label": "Noise Scaling", "reason": "HES enables virtual noise scaling across platforms and resilience to drift" }, { "label": "Echo Symmetrization", "reason": "Core technique averaging forward and Heisenberg-echo results" } ], "emoji": "🔔", "social_summary": "Introduces a Heisenberg-echo trick that cancels the leading error in gate-insertion error mitigation, cutting fidelity error by up to two orders of magnitude without pulse-level hardware access.", "highlights_oneliner": "Echo symmetrization improves gate-insertion mitigation" } ] }, "2026-10-08": { "word_cloud": [ { "word": "Transversal", "weight": 4 }, { "word": "Erasure", "weight": 4 }, { "word": "Leakage", "weight": 4 }, { "word": "Resource", "weight": 4 }, { "word": "Sensitivities", "weight": 3 }, { "word": "Syndrome", "weight": 3 }, { "word": "Surface", "weight": 3 }, { "word": "Circuits", "weight": 3 }, { "word": "Geometry", "weight": 2 }, { "word": "Wigner", "weight": 2 }, { "word": "Stabilizer", "weight": 2 }, { "word": "Uncertainty", "weight": 3 }, { "word": "Superconducting", "weight": 3 }, { "word": "Optimization", "weight": 2 }, { "word": "Kerr", "weight": 2 } ], "social_highlights": "Highlights: small transversal-CCZ codes via projective geometry and SAT solvers, automated fault-tolerant circuit reduction, fault-counting logical sensitivities, a dynamically protected erasure qubit, evidence-based resource estimate uncertainty, optimized Wigner non-stabilizerness witnesses, and geodesic optimal control suppressing leakage.", "papers": [ { "arxiv_id": "2610.09341", "title": "Building codes with transversal CCZ using projective geometry and SAT solvers", "authors": "Bohan Lu, Kenneth R. Brown", "arxiv_url": "https://arxiv.org/abs/2610.09341", "pdf_url": "https://arxiv.org/pdf/2610.09341.pdf", "summary": "The authors construct CSS codes with three logical qubits whose logical $CCZ$ gate is implemented by transversal physical $T/T^{\\dagger}$ gates, starting from $8$-divisible $X$-stabilizers defined by projective geometry and using a SAT solver to find compatible logical operators. They build codes at thirteen block lengths from $n=48$ to $n=496$ with $d_Z=3$ or $4$, including the $[[48,3,3]]$ code, and prove no such quasi-transversal $CCZ$ code exists below $n=39$.", "motivation": "Magic-state distillation carries a large space-time overhead, so codes with directly transversal non-Clifford gates are an attractive alternative. Finding small codes with transversal $CCZ$ and nontrivial distance requires systematic construction methods and lower bounds.", "highlights": [ "Construction of $[[48,3,3]]$ code $Q_{48}$ with single-qubit transversal $CCZ$ from the unique projective $8$-divisible $[48,6]$ code", "Thirteen code families spanning $n=48$ to $n=496$ with $d_Z=3$ or $4$", "Proof that no CSS code with three logical qubits, $d_Z\\geq 3$ and quasi-transversal $CCZ$ exists below $n=39$" ], "keywords": [ { "label": "Transversal Gates", "reason": "Logical $CCZ$ is realized by physical $T/T^{\\dagger}$ rotations applied directly to the code block." }, { "label": "CSS-T Codes", "reason": "The codes are CSS codes built from triply even ($8$-divisible) stabilizer codes." }, { "label": "Projective Geometry", "reason": "Projective supports guarantee $d_Z\\geq 3$ for the constructed codes." }, { "label": "SAT Solvers", "reason": "A SAT solver finds the $X$-logical operators compatible with the transversal $CCZ$." } ], "emoji": "🧩", "social_summary": "Constructs small CSS codes with three logical qubits and transversal CCZ using projective geometry and SAT solvers, including a 48-qubit distance-3 code and a lower bound.", "highlights_oneliner": "Small transversal-CCZ codes via SAT solvers" }, { "arxiv_id": "2610.09749", "title": "Automated reduction of fault-tolerant circuits", "authors": "Hyeongjun Jeon, Jeonghoon Lee, Taehyun Kim", "arxiv_url": "https://arxiv.org/abs/2610.09749", "pdf_url": "https://arxiv.org/pdf/2610.09749.pdf", "summary": "An automated search applies fault-equivalent rewrite rules to expose Bell-pair reductions, each removing an ancilla preparation and a CNOT, so optimized circuits inherit fault tolerance by construction. For Shor-style extraction on the $[[7,1,3]]$ code it cuts ancilla preparations from 30 to 18 and CNOTs from 54 to 42, lowering the logical error rate by about 21% at $p=10^{-3}$.", "motivation": "Verifying fault tolerance of each candidate circuit is expensive and limits search-based circuit optimization. Fault-equivalent rewriting preserves fault tolerance automatically, enabling resource reduction without re-verification.", "highlights": [ "Shor-style $[[7,1,3]]$ syndrome round reduced from 30 to 18 ancillas and 54 to 42 CNOTs", "Logical error rate reduced by 13%-23% across two orders of magnitude in $p$", "Steane-based dynamic extraction circuit with four ancillas, 14 CNOTs and improved CNOT depth, reducing logical error by about 15%" ], "keywords": [ { "label": "Fault Equivalence", "reason": "Every rewrite preserves fault equivalence so fault tolerance is inherited by construction." }, { "label": "Syndrome Extraction", "reason": "Shor-style and Steane-style extraction circuits are the optimization targets." }, { "label": "Circuit Optimization", "reason": "Automated search reduces ancilla and CNOT counts and CNOT depth." }, { "label": "Monte Carlo", "reason": "Candidate circuits are ranked by circuit-level Monte Carlo simulation." } ], "emoji": "✂️", "social_summary": "Automates fault-tolerant circuit reduction using fault-equivalent rewrites, cutting ancillas and CNOTs in $[[7,1,3]]$ syndrome extraction while lowering logical error rates.", "highlights_oneliner": "Automated fault-equivalent circuit reduction" }, { "arxiv_id": "2610.10531", "title": "Efficient Estimation of Logical Sensitivities Through Fault-Counting", "authors": "Winston Fu, J. Wilson Staples, Jeff D. Thompson", "arxiv_url": "https://arxiv.org/abs/2610.10531", "pdf_url": "https://arxiv.org/pdf/2610.10531.pdf", "summary": "The authors develop a differentiable estimator that obtains all components of $\\nabla_{\\mathbf p}p_L$ from a single Monte Carlo data set using sampled fault configurations. In surface code simulations it matches finite differences with one to two orders of magnitude fewer shots, and enables error budgets, per-qubit sensitivities, effective distance inference, and Newton root finding of threshold contours.", "motivation": "Understanding how each physical noise mechanism contributes to logical failure guides hardware improvement, but finite-difference sensitivity estimates scale linearly with the number of parameters. A single-dataset estimator makes fine-grained error budgeting practical.", "highlights": [ "Single Monte Carlo data set yields all logical sensitivities $\\nu_i=\\partial p_L/\\partial p_i$ simultaneously", "One to two orders of magnitude fewer shots than finite differences for equal variance", "Newton root finding with sensitivities traces threshold contours in multidimensional noise models" ], "keywords": [ { "label": "Sensitivities", "reason": "Logical sensitivity measures the response of $p_L$ to each physical noise parameter." }, { "label": "Error Budgets", "reason": "Sensitivities enable post-hoc aggregation of error contributions from qubits to error types." }, { "label": "Surface Codes", "reason": "The estimator is validated on circuit-level surface code simulations." }, { "label": "Thresholds", "reason": "Sensitivities feed Newton root finding to locate threshold contours." } ], "emoji": "📈", "social_summary": "Estimates logical sensitivities to every physical noise parameter from one Monte Carlo dataset using fault counting, needing far fewer shots than finite differences.", "highlights_oneliner": "Cheap logical sensitivities from fault-counting" }, { "arxiv_id": "2610.10432", "title": "Dynamically protected erasure qubit via low-frequency charge driving", "authors": "Ahmed Hajr, Ke Wang, Bingcheng Qing, Akel Hashim, Bibek Bhandari, Dominic Briseño-Colunga, Justin Dressel, Andrew N. Jordan, Irfan Siddiqi", "arxiv_url": "https://arxiv.org/abs/2610.10432", "pdf_url": "https://arxiv.org/pdf/2610.10432.pdf", "summary": "Sub-GHz charge driving of transmon-regime Kerr oscillators activates fast parametric interactions while protecting against low-frequency charge noise, since charge sensitivity grows quadratically with drive frequency and amplitude. The authors demonstrate 82 ns reset, a dynamically protected dual-rail qubit with nearly fourfold erasure bias, and an error per Clifford of $5.6\\times10^{-4}$ falling to $1.5\\times10^{-4}$ after post-selection with 25 ns gates.", "motivation": "Strong-drive dynamical protection is usually limited by drive-induced dephasing and leakage. Erasure qubits convert errors into detectable erasures, making them valuable for efficient fault-tolerant architectures.", "highlights": [ "Cooling and reset of the Kerr oscillator in 82 ns to residual population below $0.7\\%$", "Dual-rail erasure qubit with nearly fourfold erasure bias under dynamical protection", "Error per Clifford of $5.6\\times10^{-4}$, reduced to $1.5\\times10^{-4}$ with post-selection using 25 ns gates" ], "keywords": [ { "label": "Erasure Qubits", "reason": "A dual-rail encoding converts errors into detectable erasures with biased noise." }, { "label": "Kerr Oscillators", "reason": "Transmon-regime Kerr oscillators are driven to realize fast parametric interactions." }, { "label": "Dynamical Protection", "reason": "Strong low-frequency charge driving suppresses sensitivity to $1/f$ charge noise." }, { "label": "Superconducting Qubits", "reason": "The experiment is performed on superconducting circuit hardware." } ], "emoji": "🛡️", "social_summary": "Demonstrates a dynamically protected dual-rail erasure qubit using sub-GHz charge driving of Kerr oscillators, achieving fast reset and low error per Clifford.", "highlights_oneliner": "Charge-driven protected dual-rail erasure qubit" }, { "arxiv_id": "2610.10490", "title": "Standard estimators cannot represent fault-tolerant workloads at measured error rates: evaluated, evidence-based uncertainty for quantum resource estimation", "authors": "Furqan Nasir, Sher Jeel Ahmad", "arxiv_url": "https://arxiv.org/abs/2610.10490", "pdf_url": "https://arxiv.org/pdf/2610.10490.pdf", "summary": "An open, tool-agnostic framework propagates evidence-based priors over hardware parameters through five surface-code cost models with correlated sensitivity analysis and a pre-registered evaluation protocol. Using demonstrated error rates around $4\\times10^{-3}$ widens the 90% physical-qubit interval about forty-fold, and third-party estimators exceed their representable envelope over 80-100% of the evidence-based parameter space.", "motivation": "Resource estimates for fault-tolerant algorithms are usually reported as single numbers despite uncertain hardware parameters and disagreeing cost models. Quantifying this uncertainty is essential for realistic planning of fault-tolerant quantum computers.", "highlights": [ "Measured error rates of about $4\\times10^{-3}$ widen the 90% physical-qubit interval roughly forty times", "Five cost models disagree by a stable factor of two, even when two third-party estimators agree within ten percent", "Azure and Qualtran estimators exceed their representable envelope for 80 to 100 percent of the parameter space" ], "keywords": [ { "label": "Resource Estimation", "reason": "The paper studies uncertainty in physical-qubit estimates for fault-tolerant algorithms." }, { "label": "Surface Codes", "reason": "Five surface-code cost models underpin the estimates." }, { "label": "Uncertainty Propagation", "reason": "Evidence-based priors are propagated with correlated-input sensitivity analysis." }, { "label": "Cryptanalysis", "reason": "Workloads include RSA-2048, ECC-256 and AES-256." } ], "emoji": "📊", "social_summary": "Shows that single-number quantum resource estimates hide large uncertainty, and that standard estimators break down at the error rates real hardware actually achieves.", "highlights_oneliner": "Evidence-based uncertainty for quantum resource estimates" }, { "arxiv_id": "2610.10471", "title": "Optimized discrete Wigner representations and non-stabilizerness in qubit systems", "authors": "A. B. Klimov, C. Muñoz, I. Sainz", "arxiv_url": "https://arxiv.org/abs/2610.10471", "pdf_url": "https://arxiv.org/pdf/2610.10471.pdf", "summary": "By letting the discrete phase-space representation adapt to the state, the authors prove every qubit stabilizer state admits an exact delta-function discrete Wigner representation for any fixed partition, implementable via maximal probabilities across mutually unbiased bases. This yields a non-stabilizerness witness given by the optimized Wigner function at the origin, which is sharply concentrated and Clifford-invariant at large qubit number.", "motivation": "Discrete Wigner functions give a clear picture of stabilizer states and magic in odd dimensions, but qubit systems lacked such a description due to state-independent fixed maps. Restoring a geometric phase-space characterization offers an operational diagnostic of non-stabilizerness.", "highlights": [ "Every qubit stabilizer state has an exact delta-function Wigner representation for any fixed phase-space partition", "Optimization performed directly from measurement statistics by selecting maximal probabilities across mutually unbiased bases", "Non-stabilizer witness saturates the lower bound for stabilizer states and concentrates under random Clifford transformations at large qubit number" ], "keywords": [ { "label": "Wigner Functions", "reason": "State-adapted discrete Wigner representations characterize stabilizer states." }, { "label": "Non-Stabilizerness", "reason": "A witness based on the optimized Wigner function at the origin certifies magic." }, { "label": "Stabilizer States", "reason": "Stabilizer states are represented by delta-function distributions on stabilizer curves." }, { "label": "Mutually Unbiased Bases", "reason": "Maximal probabilities across MUBs of the partition drive the optimization." } ], "emoji": "🌀", "social_summary": "Restores a phase-space picture of qubit stabilizer states by adapting discrete Wigner functions to the state, yielding a practical witness of non-stabilizerness.", "highlights_oneliner": "State-adapted Wigner functions witness qubit magic" }, { "arxiv_id": "2610.09666", "title": "Geodesic-based optimal control for leakage suppression in superconducting qubits", "authors": "Adonai Hilário da Silva, Tanmoy Pandit, Francesco Cosco", "arxiv_url": "https://arxiv.org/abs/2610.09666", "pdf_url": "https://arxiv.org/pdf/2610.09666.pdf", "summary": "The authors adapt a sub-Riemannian geodesic search in the unitary group to a two-transmon system with leakage levels, enforcing zero start and end of pulses. For $R_x(\\pi/2)$ the optimal pulses improve average gate fidelity and reduce leakage versus Gaussian and DRAG pulses, especially for short durations, while for $i$SWAP they obtain considerably higher fidelity at slightly longer evolution time.", "motivation": "Leakage out of the computational subspace is non-Pauli noise that is particularly harmful for quantum error correction in superconducting qubits. Control methods that suppress leakage without sacrificing gate speed help meet fidelity thresholds for fault tolerance.", "highlights": [ "Geodesic optimal pulses outperform Gaussian and DRAG pulses for $R_x(\\pi/2)$, especially at short durations such as 17 ns", "Boundary constraint of zero pulse start and end built into the sub-Riemannian geodesic equation limits spurious excitations", "For $i$SWAP, leakage stays roughly unchanged but fidelity is considerably higher with slightly longer evolution time" ], "keywords": [ { "label": "Leakage", "reason": "Population leaking to higher transmon levels is the primary error being suppressed." }, { "label": "Optimal Control", "reason": "Sub-Riemannian geodesic search in the unitary group designs the control pulses." }, { "label": "Transmon Qubits", "reason": "Two coupled superconducting qubits with leakage levels are modeled." }, { "label": "DRAG Pulses", "reason": "DRAG and Gaussian pulses serve as baselines for comparison." } ], "emoji": "💧", "social_summary": "Adapts sub-Riemannian geodesic optimal control to suppress leakage in coupled superconducting qubits, beating Gaussian and DRAG pulses for short single-qubit gates.", "highlights_oneliner": "Geodesic pulses suppress transmon leakage" } ] }, "2026-10-07": { "word_cloud": [ { "word": "Bosonic", "weight": 4 }, { "word": "Flags", "weight": 4 }, { "word": "Ancilla", "weight": 3 }, { "word": "Magic", "weight": 5 }, { "word": "Triorthogonal", "weight": 4 }, { "word": "Cyclic", "weight": 3 }, { "word": "Qudits", "weight": 3 }, { "word": "Distillation", "weight": 3 }, { "word": "Pauli", "weight": 3 }, { "word": "Entropy", "weight": 2 }, { "word": "Nonlocality", "weight": 2 }, { "word": "Decay", "weight": 2 }, { "word": "Fiducials", "weight": 2 }, { "word": "Thresholds", "weight": 2 } ], "social_highlights": "Highlights: continuous-variable flags suppress ancilla-decay errors in bosonic codes by three orders of magnitude, cyclic triorthogonal qudit codes improve magic state distillation overhead and thresholds, and Pauli flat states mimic maximal magic, linking magic, entanglement, and Pauli expectation values.", "papers": [ { "arxiv_id": "2610.07139", "title": "Protecting bosonic codes from ancilla-induced errors with continuous-variable flags", "authors": "Thomas Décultot, Ronan Gautier, Mazyar Mirrahimi", "arxiv_url": "https://arxiv.org/abs/2610.07139", "pdf_url": "https://arxiv.org/pdf/2610.07139.pdf", "summary": "The paper introduces continuous-variable flags: an auxiliary oscillator coupled to the ancilla whose phase-space position encodes the continuous error that ancilla decay induces on the storage mode. A heterodyne measurement of the flag followed by feedback undoes the error up to a bosonic code stabilizer, protecting conditional rotations to all orders in ancilla decay with one flag and conditional displacements to first order with one flag (all orders with two). Simulations with realistic circuit-QED parameters predict over three orders of magnitude fewer logical errors for four-component cat code parity measurement and a finite-energy GKP lifetime near its noiseless-ancilla bound.", "motivation": "Ancilla decay during qubit-oscillator gates propagates to the bosonic mode as continuous errors that lie beyond what bosonic codes can correct, making it a leading error source in superconducting and trapped-ion experiments. Mitigating these errors without new hardware ingredients is key to fault-tolerant computation with bosonic modes.", "highlights": [ "Continuous-variable flag oscillator records ancilla-decay-induced continuous errors for heterodyne readout and feedback correction", "One flag protects conditional rotations to all orders in ancilla decay; two flags protect conditional displacements to all orders", "Over three orders of magnitude fewer logical errors for four-component cat parity measurement, and GKP lifetime near the noiseless-ancilla bound" ], "keywords": [ { "label": "Bosonic Codes", "reason": "The protected encodings include cat codes and GKP codes in a harmonic oscillator." }, { "label": "Flag Qubits", "reason": "The continuous-variable flag generalizes the flag concept to oscillator-based error detection." }, { "label": "Ancilla Decay", "reason": "Spontaneous ancilla decay during dispersive gates is the dominant error mechanism being mitigated." }, { "label": "Circuit QED", "reason": "Simulations use realistic superconducting circuit-QED parameters with dispersive coupling." } ], "emoji": "🚩", "social_summary": "Introduces continuous-variable flags that catch ancilla-decay errors in bosonic codes, cutting logical errors by over three orders of magnitude in simulations.", "highlights_oneliner": "Continuous-variable flags tame ancilla errors in bosonic codes" }, { "arxiv_id": "2610.08012", "title": "Cyclic triorthogonal codes in prime dimension", "authors": "Shiroman Prakash", "arxiv_url": "https://arxiv.org/abs/2610.08012", "pdf_url": "https://arxiv.org/pdf/2610.08012.pdf", "summary": "The paper studies cyclic triorthogonal codes in prime dimension $p$, supporting a transversal third-level diagonal logical non-Clifford gate, reducing triorthogonality for cyclic codes of length coprime to $p$ to a sumset condition on the spectral support. This enables exhaustive enumeration of maximal codes for $p=3$ up to length $121$ and $p=5,7$ up to length $96$, and a complete description of triply-even cyclic qubit codes up to length $763$. New qudit codes such as $[[19,1,3]]_3$ and $[[7,1,3]]_7$ improve overhead exponent and distillation threshold over Reed-Muller and Reed-Solomon codes, with the latter starting an infinite family $[[p,1,2\\lfloor p/6\\rfloor+1]]_p$.", "motivation": "Triorthogonal codes underlie many magic state distillation protocols, yet small explicit examples are scarce, especially for qudits. A systematic algebraic study of cyclic constructions can yield better overheads and thresholds for qudit magic state distillation.", "highlights": [ "Triorthogonality for cyclic codes reduces to a sumset condition on spectral support, enabling exhaustive search up to length $121$ for $p=3$", "Qubit cyclic code of odd length is triply even iff classically triorthogonal, classifying all such codes up to length $763$", "New qudit codes $[[19,1,3]]_3$ and $[[7,1,3]]_7$ beat shortest Reed-Muller and Reed-Solomon codes, with $[[p,1,2\\lfloor p/6\\rfloor+1]]_p$ family" ], "keywords": [ { "label": "Triorthogonal Codes", "reason": "The central object enabling transversal non-Clifford gates." }, { "label": "Cyclic Codes", "reason": "Algebraic structure via spectral support makes the triorthogonality condition tractable." }, { "label": "Qudits", "reason": "Codes are constructed in odd prime dimensions with improved overheads." }, { "label": "Magic States", "reason": "The codes serve magic state distillation with better exponent and threshold." } ], "emoji": "🔁", "social_summary": "Classifies cyclic triorthogonal codes in prime dimension via a spectral sumset condition, finding new qudit codes that improve magic state distillation overhead and thresholds.", "highlights_oneliner": "Exhaustive cyclic triorthogonal codes for qudit distillation" }, { "arxiv_id": "2610.07172", "title": "Pauli Flat Quantum States Mimicking Maximal Magic", "authors": "Paweł Cieśliński", "arxiv_url": "https://arxiv.org/abs/2610.07172", "pdf_url": "https://arxiv.org/pdf/2610.07172.pdf", "summary": "The paper examines correlation structures of states maximizing Rényi stabiliser entropies (T-type and Hoggar states) and introduces Pauli flat states, $N$-qubit states whose expectation values on all Pauli strings are equal in absolute value. It investigates their existence and constructions inside and outside the stabiliser polytope, using a tailored magic witness, and characterizes their entanglement and Bell nonlocality. Pure states with relaxed conditions forcing unequal elements to zero are also found and their non-stabiliserness discussed.", "motivation": "Magic, the departure from stabiliser states, is a necessary resource for fault-tolerant quantum computing, and maximally magical states were recently tied to WH-SIC fiducial states. Understanding how Pauli correlation structure relates to magic offers new tools for magic detection and geometric approaches to quantum mechanics.", "highlights": [ "Defines Pauli flat states with equal-magnitude expectation values on all Pauli strings, mimicking correlations of maximally magical states", "Constructs examples both inside and outside the stabiliser polytope, identified using a tailored magic witness", "Characterizes entanglement and Bell nonlocality of these states and studies relaxed pure states with unequal elements forced to zero" ], "keywords": [ { "label": "Quantum Magic", "reason": "The paper relates Pauli correlation structure to non-stabiliserness as a computational resource." }, { "label": "Stabiliser Entropy", "reason": "Rényi stabiliser entropies define the maximally magical states under study." }, { "label": "SIC Fiducials", "reason": "Pauli flat states connect to Weyl-Heisenberg SIC fiducial states." }, { "label": "Bell Nonlocality", "reason": "Nonlocality and entanglement of the Pauli flat family are analyzed." } ], "emoji": "✨", "social_summary": "Introduces Pauli flat quantum states that reproduce the correlation structure of maximally magical states, revealing new links between magic, entanglement, and Pauli expectation values.", "highlights_oneliner": "Pauli flat states mimic maximal magic correlations" } ] }, "2026-10-06": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Surgery", "weight": 5 }, { "word": "Magic", "weight": 5 }, { "word": "Surface", "weight": 5 }, { "word": "Transversal", "weight": 4 }, { "word": "Decoders", "weight": 4 }, { "word": "Clifford", "weight": 4 }, { "word": "Bicycle", "weight": 3 }, { "word": "Lattice", "weight": 3 }, { "word": "Thresholds", "weight": 2 }, { "word": "Symmetry", "weight": 3 }, { "word": "Distillation", "weight": 2 }, { "word": "Neural", "weight": 2 }, { "word": "Topological", "weight": 2 }, { "word": "Concatenated", "weight": 2 } ], "social_highlights": "Highlights: neural decoder for lattice surgery, magic-state code surgery, yoked surface codes, code switching, qLDPC surgery and parallel logic, non-Abelian decoding, magic factory discovery, cultivation costs, transversal universality, simulation, autonomous memories, Lee-metric and phase-space codes, and benchmarking.", "papers": [ { "arxiv_id": "2610.03869", "title": "Modular Neural Decoder for Surface Code Memory and Logic on Superconducting Processors", "authors": "Moritz Lange, Ole Fjeldså, Gustaf Jonasson Johansson, Mats Granath", "arxiv_url": "https://arxiv.org/abs/2610.03869", "pdf_url": "https://arxiv.org/pdf/2610.03869.pdf", "summary": "A modular graph-recurrent neural decoder built from reusable local syndrome encoders is pretrained in simulation and fine-tuned on hardware with only lightweight spatial aggregation adapted between experiments. It outperforms MWPM at distances $3$ and $5$ on an IBM Nighthawk-generation processor, approaches AlphaQubit on Google below-threshold data, and extends to $X$-type stability and $ZZ$-merge lattice-surgery experiments.", "motivation": "Neural decoders have reached high accuracy on surface code memory but are rarely shown to transfer across devices, noise conditions, and logical operations. Practical fault-tolerant computation needs portable decoders trainable with modest resources rather than re-engineered for each setting.", "highlights": [ "Outperforms MWPM at distances $3$ and $5$ on an IBM Nighthawk-generation processor and closely approaches AlphaQubit on Google hardware data", "A single decoder trained jointly across a tunable measurement-error range in a stability experiment matches or beats MWPM without per-setting calibration", "Improves decoded correlation between merge outcome and final $ZZ$ parity versus MWPM in a real-hardware lattice-surgery experiment, trainable on a single GPU" ], "keywords": [ { "label": "Neural Decoders", "reason": "The core contribution is a modular graph-recurrent neural decoder for surface codes." }, { "label": "Surface Codes", "reason": "Experiments cover memory, stability, and merge operations on surface code patches." }, { "label": "Lattice Surgery", "reason": "The decoder is tested on a $ZZ$-merge lattice-surgery experiment on real hardware." }, { "label": "Superconducting Qubits", "reason": "Evaluated on IBM Nighthawk and Google superconducting processor data." } ], "emoji": "🧠", "social_summary": "Introduces a modular neural decoder that transfers across superconducting hardware, noise levels, and logical operations including lattice surgery, beating matching decoders while training on a single GPU.", "highlights_oneliner": "Portable neural decoder for surface code logic" }, { "arxiv_id": "2610.03920", "title": "Magic Quantum Code Surgery", "authors": "Kathleen Chang, Anasuya Lyons, Yuanjie Ren, Harald Putterman, Nathanan Tantivasadakarn, Victor V. Albert, Benjamin J. Brown, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2610.03920", "pdf_url": "https://arxiv.org/pdf/2610.03920.pdf", "summary": "A generalized framework is presented to fault-tolerantly measure transversal Clifford logical operators in QLDPC codes by deforming the code across ancillary qubits so a stabilizer product equals the desired logical Clifford. The deformed code remains LDPC with distance preserved up to a constant factor, and the fault distance grows linearly with the original code distance.", "motivation": "Non-Clifford operations for universal computation can be implemented by measuring logical Clifford operators, but doing so in QLDPC codes without blowing up overhead has been unclear. A general fault-tolerant measurement scheme enables magic state preparation and non-Clifford gates in high-rate codes.", "highlights": [ "Protocol deforms any QLDPC code with ancillas so a stabilizer product measures a transversal logical Clifford operator", "Proves the deformed code stays LDPC with distance preserved up to a constant factor independent of qubit count", "Fault distance against data and measurement errors grows linearly with the original code distance, enabling non-Clifford gates and magic state preparation" ], "keywords": [ { "label": "Code Surgery", "reason": "The paper generalizes surgery to measure Clifford logical operators." }, { "label": "QLDPC", "reason": "The protocol applies to arbitrary quantum low-density parity check codes." }, { "label": "Magic States", "reason": "Applications include preparing magic states in stabilizer codes." }, { "label": "Non-Clifford Gates", "reason": "Measuring Clifford logicals yields non-Clifford operations for universality." } ], "emoji": "🪄", "social_summary": "Develops a general method to fault-tolerantly measure transversal Clifford operators in QLDPC codes, enabling non-Clifford gates and magic state preparation while preserving LDPC structure and distance.", "highlights_oneliner": "Measuring Clifford logicals for magic in QLDPC" }, { "arxiv_id": "2610.04613", "title": "Multi-Yoked Surface Codes", "authors": "Yuga Hirai, Yasunari Suzuki", "arxiv_url": "https://arxiv.org/abs/2610.04613", "pdf_url": "https://arxiv.org/pdf/2610.04613.pdf", "summary": "Yoked surface codes are generalized to multiple concatenation levels using chain codes, outer codes built by chaining seed codes that detect block errors of the level below, together with a patch allocation using movable workspaces and a hierarchy of yoking intervals. A three-yoked code with a $[[256,166,8]]$ outer code is simulated under SI1000 noise using soft information.", "motivation": "The surface code's low encoding rate demands roughly a thousand physical qubits per logical qubit in the teraquop regime, and prior density improvements typically require non-planar or long-range connectivity. Yoked codes improve density while keeping planar nearest-neighbor connectivity, but only by a factor of two or three.", "highlights": [ "Introduces chain codes that use all logical qubits of the lower level and reach high encoding rate within a few concatenation levels", "Hierarchical yoking intervals avoid long intervals required by a single large-distance outer code", "Three-yoked surface code with $[[256,166,8]]$ outer code is about $4$ to $4.5\\times$ denser than the unyoked surface code in the teraquop regime" ], "keywords": [ { "label": "Yoked Codes", "reason": "The paper generalizes yoked surface codes to multiple levels." }, { "label": "Chain Codes", "reason": "A new outer code family built by chaining seed codes." }, { "label": "Surface Codes", "reason": "The inner code retains planar nearest-neighbor connectivity." }, { "label": "Encoding Rate", "reason": "The goal is higher density in the teraquop regime." } ], "emoji": "🐂", "social_summary": "Generalizes yoked surface codes to multiple concatenation levels with new chain codes, achieving about four to four and a half times higher density than the plain surface code while staying planar.", "highlights_oneliner": "Multi-level yoking boosts surface code density" }, { "arxiv_id": "2610.05189", "title": "Error-Transparent Code Switching Between Permutation-Invariant Codes with Transversal Clifford and Icosahedral Gates", "authors": "Zachary P. Bradshaw", "arxiv_url": "https://arxiv.org/abs/2610.05189", "pdf_url": "https://arxiv.org/pdf/2610.05189.pdf", "summary": "Switching between two permutation-invariant codes with transversal Clifford and binary icosahedral gates is analyzed, showing distance-three codes in the shared encoder space satisfy at most two quadratic equations and share identical error geometry. A fault-tolerant switching unitary exists iff the codes are joined by a continuous path of distance-three codes, and can be made error transparent; on thirteen qubits the set forms an explicit circle.", "motivation": "Code switching achieves universality by combining transversal gates of two codes, but the switching step itself is usually non-transversal and can spread faults into uncorrectable errors. Understanding when fault-tolerant, error-transparent switching exists is key to practical universal computation.", "highlights": [ "Distance-three codes in the shared encoder space are cut out by at most two quadratic equations and all share the same error geometry", "Fault-tolerant switching tolerating one single-qubit fault exists iff the codes are connected by a continuous path of distance-three codes", "On thirteen qubits the real distance-three codes form a circle joining two Clifford codes and an icosahedral code, with recovery infidelity at machine precision versus $0.13$ and $0.85$ for alternatives" ], "keywords": [ { "label": "Code Switching", "reason": "The paper characterizes fault-tolerant switching between codes." }, { "label": "Permutation-Invariant", "reason": "The codes studied are permutation-invariant codes on shared qubits." }, { "label": "Transversal Gates", "reason": "Clifford and binary icosahedral transversal gates together give universality." }, { "label": "Error Transparency", "reason": "Faults reach the target code as the same single-qubit error." } ], "emoji": "🔀", "social_summary": "Shows that fault-tolerant, error-transparent switching between permutation-invariant codes exists exactly when the codes lie on a continuous path of distance-three codes, with an explicit thirteen-qubit construction.", "highlights_oneliner": "Error-transparent switching between permutation-invariant codes" }, { "arxiv_id": "2610.05214", "title": "Cups and Gates II: Operads, twists, and addressable intra-code gates", "authors": "Nikolas P. Breuckmann, Margarita Davydova, Jens Niklas Eberhardt, Lucas Ferdinand Hallwirth, Nathanan Tantivasadakarn", "arxiv_url": "https://arxiv.org/abs/2610.05214", "pdf_url": "https://arxiv.org/pdf/2610.05214.pdf", "summary": "The cohomology-invariant framework for logical gates in CSS codes is extended with twists from code automorphisms, higher twisted cohomology operations, folding in relative cohomology, and coefficient lifts from $\\mathbb{Z}/2$ to $\\mathbb{Z}/2^k$, enabling all diagonal gates such as $\\operatorname{R}(2\\pi/2^k)$. New operations such as higher twisted Pontryagin powers arise from $E_\\infty$-structures on cochains via the surjection operad, yielding addressable logical gates including addressable $T$ gates on tori and gates in qLDPC codes.", "motivation": "Constant-depth fault-tolerant logical gates are bounded for topological codes by Bravyi-König, but what is achievable in general qLDPC codes with long-range connectivity is poorly understood. A systematic mathematical framework is needed for high-rate qLDPC codes where traditional techniques do not apply.", "highlights": [ "Introduces twists, higher twisted cohomology operations, and folding in relative cohomology to vastly extend the cup-product gate framework", "Coefficient lifting to $\\mathbb{Z}/2^k$ enables all diagonal logical gates including $\\operatorname{R}(2\\pi/2^k)$, with selection of cohomology classes yielding addressable gates", "Higher twisted Pontryagin powers constructed via the surjection operad, giving addressable $T$ gates on three- and four-tori and gates in qLDPC codes" ], "keywords": [ { "label": "Cohomology", "reason": "Logical gates are built from cohomology invariants of CSS codes." }, { "label": "Operads", "reason": "The surjection operad and $E_\\infty$-structures construct new cohomology operations." }, { "label": "Addressable Gates", "reason": "Selecting cohomology classes yields individually addressable logical gates." }, { "label": "qLDPC", "reason": "Gates are realized in qLDPC codes beyond topological ones." } ], "emoji": "🍵", "social_summary": "Extends the cohomology framework for logical gates with twists and operadic cohomology operations, yielding addressable diagonal gates like $T$ in topological and qLDPC codes.", "highlights_oneliner": "Operadic cohomology gives addressable logical gates" }, { "arxiv_id": "2610.05307", "title": "Lifted surgery for non-Abelian two-block group-algebra codes", "authors": "Tushar Pandey", "arxiv_url": "https://arxiv.org/abs/2610.05307", "pdf_url": "https://arxiv.org/pdf/2610.05307.pdf", "summary": "Lifted surgery is extended to two-block group-algebra codes over non-Abelian groups by classifying block-affine automorphisms, showing the gain over Abelian symmetry is bounded by the index of a largest Abelian subgroup. Codes with distance up to $13$ achieve gain two, and products of $A_4$, $S_4$ and $SL(2,3)$ give gain three for a best logical, up to $[[336,26,12]]$, with circuit-level Relay-BP simulations showing equal or better reliability using two to three times fewer rounds.", "motivation": "Code surgery requires $O(d)$ rounds per measured logical operator, and lifted surgery amortises this on Abelian group-algebra codes via translation symmetry. It was unknown whether non-commutativity lets one merged code measure more operators than any Abelian symmetry group.", "highlights": [ "Classifies block-affine automorphisms of non-Abelian two-block codes and proves the gain is at most the index of a largest Abelian subgroup", "Finds codes with exact distance up to $13$ with gain two, and codes over $A_4$, $S_4$, $SL(2,3)$ products with gain three, up to $[[336,26,12]]$", "Relay-BP circuit-level simulations show the non-Abelian gadget is as reliable or better than Abelian ones using two to three times fewer rounds" ], "keywords": [ { "label": "Lifted Surgery", "reason": "The paper extends lifted surgery to non-Abelian codes." }, { "label": "Group-Algebra Codes", "reason": "Two-block group-algebra codes over non-Abelian groups are the setting." }, { "label": "Automorphisms", "reason": "Block-affine automorphism classification determines the achievable gain." }, { "label": "Relay-BP", "reason": "Circuit-level simulations use the Relay-BP decoder." } ], "emoji": "🧮", "social_summary": "Extends lifted surgery to non-Abelian two-block group-algebra codes, proving a bound on gains and demonstrating parallel logical measurements with two to three times fewer syndrome rounds.", "highlights_oneliner": "Lifted surgery for non-Abelian group codes" }, { "arxiv_id": "2610.05901", "title": "Fusion-assisted decoding of non-Abelian topological order", "authors": "Rohith Sajith, Yabo Li, Zijian Song, Tsung-Cheng Lu, Carolyn Zhang", "arxiv_url": "https://arxiv.org/abs/2610.05901", "pdf_url": "https://arxiv.org/pdf/2610.05901.pdf", "summary": "Refined syndrome sets that include measurements resolving non-Abelian anyon fusion outcomes are shown to systematically improve maximum likelihood decoders. Explicit decoders for the $D_4$ quantum double under charge noise are built, with thresholds obtained via mappings to classical statistical-mechanics models, showing a nonzero threshold below which the whole logical qudit is recoverable with a single measurement round.", "motivation": "Non-Abelian topological codes support transversal or constant-depth non-Clifford gates and efficient preparation, but non-Abelian anyons cannot be deterministically annihilated and logical operators are not classified by Abelian homology. Decoding them well is an open challenge beyond the toric code.", "highlights": [ "Syndrome sets that resolve non-Abelian anyon fusion outcomes systematically improve ML decoder performance", "Explicit ML decoders for the $D_4$ quantum double model under charge noise with thresholds computed via statistical-mechanics mappings", "Nonzero noise threshold below which the entire logical qudit can be recovered with a single round of measurements" ], "keywords": [ { "label": "Non-Abelian Anyons", "reason": "Decoding challenges stem from non-Abelian anyon fusion." }, { "label": "Maximum Likelihood", "reason": "The work improves ML decoders via refined syndromes." }, { "label": "Quantum Doubles", "reason": "Explicit decoders are built for the $D_4$ quantum double." }, { "label": "Thresholds", "reason": "Thresholds are derived via classical statistical-mechanics mappings." } ], "emoji": "🔗", "social_summary": "Shows that measuring fusion outcomes of non-Abelian anyons improves maximum likelihood decoding, with explicit $D_4$ quantum double decoders and a nonzero threshold for single-round recovery.", "highlights_oneliner": "Fusion measurements improve non-Abelian decoding" }, { "arxiv_id": "2610.06059", "title": "Comparing thresholds of XZZX and rotated surface codes under spatio-temporal correlated noise", "authors": "Dhruv Koul", "arxiv_url": "https://arxiv.org/abs/2610.06059", "pdf_url": "https://arxiv.org/pdf/2610.06059.pdf", "summary": "The $\\mathrm{XZZX}$ and rotated surface codes are compared under spatio-temporal correlated noise using the Minimum Weight Parity Factor decoder, which handles syndrome hypergraphs natively. At strong $Z$-bias ($\\eta=100$) the rotated code threshold drops to about $0.36\\%$ while $\\mathrm{XZZX}$ reaches about $0.70\\%$, and the $\\mathrm{XZZX}$ code shows a non-monotonic threshold with a minimum near $\\eta\\approx 10$.", "motivation": "Most QEC studies assume independent identically distributed noise, leaving correlated and spatio-temporal errors underexplored, and standard graph decoders struggle with the hyperedges these errors create on bias-tailored codes. Understanding how code geometry interacts with correlated noise is vital for realistic fault tolerance.", "highlights": [ "Uses the MWPF hypergraph decoder to avoid artificial edge decomposition of correlated-error hyperedges", "At $\\eta=100$ circuit-level correlated noise, the rotated code threshold is about $0.36\\%$ versus about $0.70\\%$ for $\\mathrm{XZZX}$", "$\\mathrm{XZZX}$ shows a threshold minimum near $\\eta\\approx 10$ because transverse $X$ and $Y$ errors bridge diagonal strings and break one-dimensional decoupling" ], "keywords": [ { "label": "XZZX Code", "reason": "A bias-tailored surface code compared against the rotated code." }, { "label": "Correlated Noise", "reason": "Spatio-temporal correlated errors create hyperedges in the syndrome graph." }, { "label": "Hypergraph Decoding", "reason": "The MWPF decoder natively processes syndrome hypergraphs." }, { "label": "Thresholds", "reason": "Threshold behavior versus bias ratio is the central measured quantity." } ], "emoji": "📉", "social_summary": "Compares XZZX and rotated surface codes under spatio-temporal correlated noise with a hypergraph decoder, revealing a non-monotonic threshold dependence on bias for the XZZX code.", "highlights_oneliner": "XZZX versus rotated codes under correlated noise" }, { "arxiv_id": "2610.06535", "title": "Symmetry and AI-assisted discovery of magic-state factories", "authors": "Shubham P. Jain, Adam Wills, Shraddha Singh", "arxiv_url": "https://arxiv.org/abs/2610.06535", "pdf_url": "https://arxiv.org/pdf/2610.06535.pdf", "summary": "The authors develop symmetry- and language-model-assisted searches for distance-three-and-above magic-state factories using a unified binary-matrix formulation in which distance $\\geq 3$ is equivalent to nonzero, pairwise distinct syndromes. They obtain 699 factory classes (564 new), including pure-$T$ factories such as $[[63,11,3]]$, $[[850,128,6]]$ and $[[1715,287,6]]$ with overhead exponents $\\gamma=1.589$, $1.057$ and $0.998$.", "motivation": "Magic-state distillation is a dominant resource cost in fault-tolerant quantum computing, and its cost depends strongly on the number of input states. Searches beyond distance two have been intractable at moderate input counts, so new structured and automated search methods are needed.", "highlights": [ "699 factory classes found, 564 of them new, including pure-$T$ and entangled $T$/$CS$/$CCZ$ outputs", "$[[1715,287,6]]$ is the smallest known pure-$T$ factory with $\\gamma<1$ ($\\gamma=0.998$)", "Open-source repository and context directory enabling readers to train their own search agents" ], "keywords": [ { "label": "Magic States", "reason": "The paper searches for distillation factories for $T$, $CS$ and $CCZ$ magic states." }, { "label": "Distillation", "reason": "Factory overhead exponents $\\gamma$ are the main figure of merit." }, { "label": "AI Agents", "reason": "Language-model agents restrict the syndrome search space." }, { "label": "Symmetry", "reason": "Group symmetry makes distance-three-and-above searches tractable." } ], "emoji": "🏭", "social_summary": "Combines group symmetry and language-model agents to discover 699 magic-state factories, including the smallest known pure-T factory with sub-linear overhead exponent.", "highlights_oneliner": "AI and symmetry find new magic-state factories" }, { "arxiv_id": "2610.06606", "title": "Staying Sober: A Shot-Free Predictor of Logical Error Rates for Concatenated Quantum Error Correcting Codes", "authors": "Sayam Sethi, Aditi Awasthi, Maxwell Poster, Joshua Viszlai, Jonathan Mark Baker", "arxiv_url": "https://arxiv.org/abs/2610.06606", "pdf_url": "https://arxiv.org/pdf/2610.06606.pdf", "summary": "The authors propose a sampling-free predictor of the leading monomial $c\\,p^{o}$ of the logical error rate of a code at every concatenation level, using the stabilizers and minimum-weight (and weight $d+1$) logical operators. The prediction is exact for unconcatenated stabilizer codes whenever no budget is exhausted, and approximates an exact exponential-time recursion for concatenated codes.", "motivation": "Monte Carlo estimation of logical error rates needs $O(p^{-\\lceil d/2\\rceil}/\\varepsilon^2)$ samples, which is intractable for large distances and especially for concatenated codes whose distance grows as $d^{\\ell}$. Efficient comparison of many candidate codes requires a shot-free predictor.", "highlights": [ "Exact leading-order logical error rate for any unconcatenated stabilizer code, for arbitrary per-qubit error rates", "Runtime polynomial in code parameters and linear in the number of concatenation levels $\\ell$ for fixed budgets", "Compared 37 code configurations under four noise biases in 48 core-hours, where Monte Carlo would need over $10^{12}$ shots for 113 of 148 cases" ], "keywords": [ { "label": "Logical Error Rate", "reason": "The predictor computes the leading monomial of the logical error rate in $p$." }, { "label": "Concatenated Codes", "reason": "The method handles soft information passed between concatenation levels." }, { "label": "Monte Carlo", "reason": "The approach replaces intractable sampling with analytic prediction." }, { "label": "Iceberg Code", "reason": "Predictions were validated against exact enumeration up to three levels." } ], "emoji": "🔮", "social_summary": "Predicts logical error rates of concatenated quantum codes without any sampling, matching exact enumeration and replacing Monte Carlo runs that would need over a trillion shots.", "highlights_oneliner": "Sampling-free logical error rate predictor" }, { "arxiv_id": "2610.06623", "title": "Large Language Model-Guided Discovery of Weight-Five Bivariate Bicycle Codes", "authors": "Juan Cruz-Benito", "arxiv_url": "https://arxiv.org/abs/2610.06623", "pdf_url": "https://arxiv.org/pdf/2610.06623.pdf", "summary": "An LLM-guided program-evolution search over weight-five bivariate bicycle (BB) and perturbed bivariate bicycle (PBB) codes yields a catalogue of 1,142 proposals, with certified connected CSS codes $[[96,4,10]]$, $[[140,6,10]]$ and $[[180,4,14]]$. Connectivity and algebraic analyses classify the codes into cyclotomic-kernel strata and compare the yield against random-search controls.", "motivation": "BB codes are a prominent family of qLDPC codes, usually studied with weight-six checks, and finding good finite-length instances is a large combinatorial search. Extending LLM-guided discovery to the more constrained weight-five family tests the generality of this workflow.", "highlights": [ "1,142 distinct code proposals with $[[96,4,10]]$, $[[140,6,10]]$, $[[180,4,14]]$ certified, plus seven imported Lin–Pryadko archive constructions", "409 catalogue entries are disconnected, and 73.1% of classes with exact distance certificates contain repeated connected components", "LLM-guided campaign gives 87.18% certified at $d\\geq 5$ versus 72.50–74.26% for random controls, which cover more connected classes" ], "keywords": [ { "label": "Bivariate Bicycle", "reason": "The study targets weight-five BB and PBB code families." }, { "label": "LLM Search", "reason": "A large language model guides program evolution to propose codes." }, { "label": "qLDPC", "reason": "BB codes are CSS quantum low-density parity-check codes." }, { "label": "Distance Certification", "reason": "Exact distances are certified for leading candidates." } ], "emoji": "🚲", "social_summary": "Extends language-model-guided code search to weight-five bivariate bicycle codes, certifying new qLDPC instances like [[180,4,14]] and benchmarking yield against random search.", "highlights_oneliner": "LLM-guided weight-five bivariate bicycle codes" }, { "arxiv_id": "2610.06730", "title": "Qubit CSS codes with Universal Transversal Gates", "authors": "Arpit Dua, Adam Holmes, Michael J. Gullans, Victor V. Albert", "arxiv_url": "https://arxiv.org/abs/2610.06730", "pdf_url": "https://arxiv.org/pdf/2610.06730.pdf", "summary": "The authors show that depth-one layers of few-qubit gates, each respecting its own qubit partition, can jointly generate a universal logical gate set on a single error-correcting code without magic-state distillation or other gadgets. Such codes are built by applying an entangling circuit to a low-distance seed code with a depth-one non-Clifford gate and a kernel code, yielding 47 codes including $[[37,1,7]]$ and $[[59,1,9]]$.", "motivation": "The Eastin–Knill theorem forbids universal transversal gates on codes detecting single-qubit errors, so fault-tolerant compilers rely on costly gadgets like magic-state distillation and lattice surgery. The theorem constrains only one partition at a time, leaving open universality via layers on different partitions.", "highlights": [ "Universal logical gate generators realized as single depth-one layers followed by error correction, with no gadgets", "47 codes tolerating at least one faulty gate per layer, including $[[37,1,7]]$ and $[[59,1,9]]$ with check weight at most eight", "Proof that every CSS code with a physical parity layer is a coupled code, via Goursat's lemma" ], "keywords": [ { "label": "Transversal Gates", "reason": "Universality is achieved using depth-one gate layers on different partitions." }, { "label": "Eastin-Knill", "reason": "The construction circumvents the single-partition no-go theorem." }, { "label": "CSS Codes", "reason": "The constructed codes and structure lemma are CSS-based." }, { "label": "Universality", "reason": "The generating sets yield a universal logical gate set." } ], "emoji": "🔓", "social_summary": "Shows that depth-one gate layers on different qubit partitions can together give universal logical gates on one code, sidestepping Eastin-Knill without magic-state distillation.", "highlights_oneliner": "Universal transversal gates across multiple partitions" }, { "arxiv_id": "2610.06749", "title": "Efficient Logic with Ultra-High-Rate Quantum Codes", "authors": "Nishad Maskara, Rohan Mehta, Zhiyang He, Varun Menon, J. Pablo Bonilla Ataides, Mikhail D. Lukin, Hengyun Zhou", "arxiv_url": "https://arxiv.org/abs/2610.06749", "pdf_url": "https://arxiv.org/pdf/2610.06749.pdf", "summary": "The authors use group symmetries of ultra-high-rate qLDPC codes to partition logical qubits into orbits and apply parallel surgery to implement group-invariant logical Pauli-product measurements. A technique called chain-map convolution boosts spatial and temporal distances efficiently, yielding distance-preserving parallel gadgets for $[[256,68,12]]$, $[[576,148,18]]$ and $[[1152,580,12]]$ codes with about $2.5\\times$ space overhead and 3–4 syndrome rounds.", "motivation": "Ultra-high-rate qLDPC codes encode logical information densely, but operating on it requires low space and time overhead, high parallelism and programmability, goals that typically conflict in code surgery. New methods exploiting code symmetry are needed to realize the full potential of these codes.", "highlights": [ "Parallel surgery on logical orbits with group-invariant Pauli-product measurements that are highly programmable", "Chain-map convolution boosts spatial and temporal distance with only 3–4 syndrome extraction rounds", "Distance-preserving gadgets for $[[256,68,12]]$, $[[576,148,18]]$ and rate-$1/2$ $[[1152,580,12]]$ codes with about $2.5\\times$ space overhead" ], "keywords": [ { "label": "qLDPC", "reason": "The work targets ultra-high-rate quantum LDPC codes." }, { "label": "Code Surgery", "reason": "Parallel surgery implements logical Pauli-product measurements." }, { "label": "Parallelism", "reason": "Group symmetry enables orbit-wide parallel logical operations." }, { "label": "Magic States", "reason": "The methods also enable parallel injection of cultivated magic states." } ], "emoji": "⚡", "social_summary": "Exploits group symmetry of ultra-high-rate qLDPC codes to perform parallel logical measurements with low space and time overhead, including rate-1/2 codes with only about 2.5x space cost.", "highlights_oneliner": "Parallel symmetric surgery for high-rate qLDPC codes" }, { "arxiv_id": "2610.06775", "title": "Engineering logical gates with irrep surface codes", "authors": "Yabo Li, Zijian Song, Vieri Mattei, Naren Manjunath, Apoorv Tiwari, Tyler D. Ellison", "arxiv_url": "https://arxiv.org/abs/2610.06775", "pdf_url": "https://arxiv.org/pdf/2610.06775.pdf", "summary": "The authors introduce irrep surface codes (ISCs), two-dimensional topological codes engineered to transversally implement a prescribed finite, irreducible group of logical gates, including arbitrary finite groups of diagonal gates and reversible classical gates. They also develop lattice-surgery protocols to transfer information between surface codes and ISCs.", "motivation": "Fault-tolerant computation usually relies on a fixed set of logical primitives, and realizing other operations can be resource-intensive. A systematic way to tailor topological codes to desired logical gates would reduce this cost.", "highlights": [ "Transversal implementation of any finite irreducible gate group, including gates outside every finite level of the Clifford hierarchy", "Arbitrary finite groups of diagonal gates and reversible classical gates embeddable into irreducible groups", "Lattice-surgery protocols to transfer encoded information between surface codes and ISCs" ], "keywords": [ { "label": "Surface Codes", "reason": "ISCs are two-dimensional topological codes related to surface codes." }, { "label": "Transversal Gates", "reason": "ISCs are engineered to implement prescribed gates transversally." }, { "label": "Lattice Surgery", "reason": "Surgery protocols interface ISCs with conventional surface codes." }, { "label": "Clifford Hierarchy", "reason": "ISCs enable gates outside every finite level of the hierarchy." } ], "emoji": "🧩", "social_summary": "Introduces irrep surface codes that transversally implement any prescribed finite irreducible gate group, with lattice-surgery protocols for integrating them into surface-code computations.", "highlights_oneliner": "Topological codes tailored to desired logical gates" }, { "arxiv_id": "2610.06792", "title": "Error Mitigation From a Single Unmodified Error-Corrected Circuit", "authors": "Maor Shutman, Dorit Aharonov, Itai Arad, Yosi Atia, Eyal Bairey, Zvika Brakerski, Barak A. Katzir, Netanel H. Lindner, Omri Golan, Ilya Gurwich", "arxiv_url": "https://arxiv.org/abs/2610.06792", "pdf_url": "https://arxiv.org/pdf/2610.06792.pdf", "summary": "The authors introduce syndrome-based offline logical error mitigation (SOLEM), which uses syndrome data entirely in post-processing without modifying the error-corrected circuit. They develop unbiased and heuristic estimators, including offline logical PEC and ZNE and a global-regression estimator, achieving runtime overhead exponentially lower than external LEM and comparable to syndrome-aware LEM.", "motivation": "Residual logical errors will limit near-term error-corrected computations, and syndrome-aware mitigation reduces overhead but needs adaptive real-time circuit operations. An offline approach built into unmodified circuits would be simpler to implement.", "highlights": [ "Syndrome data used entirely in post-processing with no modification of the error-corrected circuit", "Offline logical PEC, ZNE and global-regression estimators built from naturally occurring syndrome-conditioned logical error channels", "Runtime overhead exponentially lower than external LEM and comparable to syndrome-aware estimators, with offline stronger decoding and drift-robust characterization" ], "keywords": [ { "label": "Error Mitigation", "reason": "SOLEM mitigates residual logical errors via post-processing." }, { "label": "Syndromes", "reason": "Syndrome-conditioned logical error channels are the core resource." }, { "label": "PEC", "reason": "An offline logical probabilistic error cancellation estimator is developed." }, { "label": "Decoders", "reason": "Offline processing permits a more powerful decoder than real-time." } ], "emoji": "🩹", "social_summary": "Mitigates logical errors using only syndrome data in post-processing, leaving the error-corrected circuit untouched while achieving exponentially lower overhead than external mitigation.", "highlights_oneliner": "Offline logical error mitigation from syndromes" }, { "arxiv_id": "2610.06811", "title": "Polynomial-time simulation of non-Clifford quantum error correction", "authors": "Serban Cercelescu, Mark Koch, Arthur Pesah", "arxiv_url": "https://arxiv.org/abs/2610.06811", "pdf_url": "https://arxiv.org/pdf/2610.06811.pdf", "summary": "The authors show that intermediate states of a broad class of non-Clifford QEC circuits, even under stochastic Pauli noise, are third-order phase-polynomial states, which are exactly the stabilizer states of a new diagonal-Clifford-and-Pauli (DCP) stabilizer formalism. This yields an exact polynomial-time simulation algorithm, implemented in the open-source tool merlin.", "motivation": "Clifford simulators like stim have enabled large-scale evaluation of memory and Clifford operations, but non-Clifford protocols such as distillation, cultivation and code switching lack efficient simulation. Existing methods retain exponential dependencies, for example on the number of logical qubits.", "highlights": [ "Third-order phase-polynomial states equal DCP stabilizer states and can be updated in polynomial time", "Covers magic state distillation and cultivation, code switching, gauge fixing and transversal non-Clifford gates under Pauli noise", "merlin simulates a distance-5 code-switching circuit where other tested simulators fail, with improved scaling in Bravyi–Haah distillation" ], "keywords": [ { "label": "Simulation", "reason": "The paper gives an exact polynomial-time simulation algorithm." }, { "label": "Non-Clifford", "reason": "The class of circuits simulated includes non-Clifford operations." }, { "label": "Phase Polynomials", "reason": "Intermediate states are third-order phase-polynomial states." }, { "label": "Code Switching", "reason": "A distance-5 code switching circuit is simulated beyond other tools." } ], "emoji": "🧮", "social_summary": "Proves that many non-Clifford error-correction circuits stay within an efficiently simulable stabilizer-like class, enabling exact polynomial-time simulation with the open-source tool merlin.", "highlights_oneliner": "Exact efficient simulation of non-Clifford QEC" }, { "arxiv_id": "2610.06820", "title": "Designing Group-Valued Codes with Full Regular Low-Weight Bases", "authors": "Jong Yeon Lee", "arxiv_url": "https://arxiv.org/abs/2610.06820", "pdf_url": "https://arxiv.org/pdf/2610.06820.pdf", "summary": "Develops design principles for group-valued quantum codes whose complete canonical logical bases are generated by translating low-weight seed operators, and introduces frame width $f$ as a new code parameter alongside distance $d$ and check weight $w$. Explicit lifted-product and pair-partition codes, such as an $[[1088,128,22]]$ LP code with $f=22$, are constructed, together with a symmetry-reduction and stabilizer-pruning method for exact distance certification.", "motivation": "Reported canonical logical bases for high-rate, high-distance codes can be several times heavier than the code distance, inflating the spacetime cost of logical Pauli measurements and surgery. Controlling the weight of every basis operator is therefore essential for efficient fault-tolerant compilation.", "highlights": [ "Structural obstruction: for odd-order groups, full regularity of fully populated binary monomial CSS checks forces distance two", "$[[1088,128,22]]$ LP code with $f=22$ and $[[1024,256,24]]$ PP code with $f \\leq 27$ at check weight $w=10$", "Symmetry reduction plus stabilizer-based pruning certifies exact distances for LP codes with over a thousand qubits" ], "keywords": [ { "label": "Lifted Product", "reason": "Main code family used to build explicit low-weight-basis examples" }, { "label": "Frame Width", "reason": "New code parameter bounding the weight of a complete canonical logical basis" }, { "label": "Logical Operators", "reason": "Central focus is designing low-weight, regular canonical logical bases" }, { "label": "Distance Certification", "reason": "Proposed symmetry-reduction method for exact distance computation" } ], "emoji": "🧮", "social_summary": "Introduces frame width as a new code parameter and constructs high-rate group-valued codes whose complete logical bases are low-weight and generated by translating seed operators.", "highlights_oneliner": "Low-weight regular logical bases via frame width" }, { "arxiv_id": "2610.06828", "title": "The practical cost of magic state cultivation", "authors": "Rohan Mehta, Varun Menon, Hengyun Zhou, Mikhail D. Lukin, J. Pablo Bonilla Ataides", "arxiv_url": "https://arxiv.org/abs/2610.06828", "pdf_url": "https://arxiv.org/pdf/2610.06828.pdf", "summary": "Introduces Caliper, an open-boundary postselection method for the escape stage of magic state cultivation that uses only nondestructive mid-circuit syndrome information instead of destructive transversal measurement of the output state. Benchmarks show it outperforms alternative methods under this constraint, but achievable logical error rates can be orders of magnitude worse at previously reported spacetime costs.", "motivation": "Prior cultivation resource estimates assumed noiseless transversal measurement of the output magic state for postselection, which would destroy the state and is unavailable in real computation. Accounting for this constraint is needed to get realistic costs for non-Clifford resource state preparation.", "highlights": [ "Caliper open-boundary postselection uses only nondestructive mid-circuit syndrome information", "In some regimes it recovers the resource efficiency of prior estimates", "At previously reported spacetime costs, logical error rates can be orders of magnitude higher; recovering them needs larger codes and longer escape stages" ], "keywords": [ { "label": "Magic States", "reason": "Paper studies cultivation of high-fidelity non-Clifford resource states" }, { "label": "Cultivation", "reason": "Core protocol whose practical cost is re-evaluated" }, { "label": "Postselection", "reason": "Open-boundary postselection method Caliper is the main contribution" }, { "label": "Resource Estimates", "reason": "Revisits spacetime overhead claims under realistic constraints" } ], "emoji": "🔭", "social_summary": "Reveals that magic state cultivation costs more in practice by developing Caliper, a postselection method that avoids destructive measurement but can raise logical error rates by orders of magnitude.", "highlights_oneliner": "Realistic postselection costs for magic cultivation" }, { "arxiv_id": "2610.04306", "title": "The cost of each side condition in a gauged logical measurement", "authors": "Shuoming An, Fusheng Yang", "arxiv_url": "https://arxiv.org/abs/2610.04306", "pdf_url": "https://arxiv.org/pdf/2610.04306.pdf", "summary": "Analyzes the four side conditions in the Williamson-Yoder guarantee for gauged logical measurements and shows they are not equally important: dropping the perfect first/last round requirement collapses the fault distance to one for every code and round count. Expansion does not determine the outcome, and both spatial and temporal distances are computed exactly on a gauged bivariate bicycle code and a Bacon-Shor measurement inside a proof assistant.", "motivation": "Gauging provides a systematic way to implement logical measurements with local checks, but its fault-tolerance guarantee rests on four bundled side conditions whose individual costs were never priced. Knowing which conditions truly matter helps designers choose auxiliary graphs and round counts.", "highlights": [ "Removing the perfect first-and-last-round condition drops the fault distance to one for every code and round count", "Expansion condition does not decide the distance: two path graphs on the same qubits give distances one and two", "Exact spatial and temporal distances computed for gauged BB and Bacon-Shor measurements, verified in a proof assistant" ], "keywords": [ { "label": "Gauging", "reason": "The logical measurement construction being analyzed" }, { "label": "Fault Distance", "reason": "Temporal component of tolerance shown to collapse without boundary rounds" }, { "label": "Formal Verification", "reason": "Results computed and checked inside a proof assistant" }, { "label": "Bivariate Bicycle", "reason": "Example code on which distances are computed exactly" } ], "emoji": "⚖️", "social_summary": "Prices each side condition of gauged logical measurement, showing the seemingly trivial perfect boundary rounds carry the temporal fault distance, with exact results verified in a proof assistant.", "highlights_oneliner": "Which gauging side conditions really matter" }, { "arxiv_id": "2610.04694", "title": "Stabilizer codes over general phase spaces", "authors": "Sayan Chakraborty, Victor V. Albert", "arxiv_url": "https://arxiv.org/abs/2610.04694", "pdf_url": "https://arxiv.org/pdf/2610.04694.pdf", "summary": "Develops a unified theory of stabilizer codes whose groups of commuting qudit Paulis, oscillator displacements, and planar-rotor displacements form lattices in a general phase space, with finite logical dimension equal to the stabilizer lattice covolume. Constructs new hybrid oscillator-rotor-qubit codes and a Golay-based oscillator-qubit code, derives logical operators, Clifford-Gaussian gates, distances, decoding, and weight enumerators.", "motivation": "Code theory for qudits, GKP oscillators, and rotors has developed largely one system type at a time, even though all share the structure of locally compact abelian group phase spaces. A unifying framework enables hybrid codes and recovers known MacWilliams identities across platforms.", "highlights": [ "Code dimension equals covolume of the stabilizer lattice, with syndrome subspaces organized as a vector bundle", "New oscillator-rotor, rotor-qudit, oscillator-rotor-qubit codes and a partially lifted Golay oscillator-qubit code", "Finite-energy codewords whose encoding is an isometry up to error exponentially small in the inverse damping parameter" ], "keywords": [ { "label": "GKP Codes", "reason": "Framework generalizes lattice-based oscillator codes" }, { "label": "Phase Space", "reason": "Codes defined over general locally compact abelian group phase spaces" }, { "label": "Hybrid Codes", "reason": "Constructs codes mixing oscillators, rotors, and qubits" }, { "label": "Weight Enumerators", "reason": "Recovers MacWilliams identities across code types" } ], "emoji": "🌀", "social_summary": "Unifies qudit, GKP oscillator, and rotor stabilizer codes under one lattice-based phase space theory, yielding new hybrid codes, logical operators, distances, and weight enumerators.", "highlights_oneliner": "Unified stabilizer theory for hybrid phase spaces" }, { "arxiv_id": "2610.04834", "title": "Quantum codes in the Lee metric", "authors": "Jinkang Guo, Yiqiu Han, Aranya Chakraborty, Shubham P. Jain, Tianhao Liu, Victor V. Albert, Andrew Lucas", "arxiv_url": "https://arxiv.org/abs/2610.04834", "pdf_url": "https://arxiv.org/pdf/2610.04834.pdf", "summary": "Introduces a quantum coding framework for small-shift qudit noise using joint and separate Lee metrics for stabilizer codes over $\\mathbb{Z}_q$, including Gray-map qubitization of $\\mathbb{Z}_4$ codes and analysis of Lee-weight spreading under Clifford gates. Proves that Lee distance of CSS Lee-LDPC codes cannot exceed $O(n)$ uniformly in $q$, and shows classical helical repetition codes have exponentially long memory under Metropolis dynamics.", "motivation": "Nuclear-spin and similar noise in high-dimensional qudits favors small shifts rather than arbitrary errors, which the Hamming metric ignores. A Lee-metric theory could exploit large internal Hilbert spaces more efficiently than qubit-derived codes.", "highlights": [ "Joint Lee metric counts $Y$ errors twice and can yield codes using fewer qubits than Hamming-metric designs", "Lee distance of CSS Lee-LDPC codes on $n$ qudits is bounded by $O(n)$ uniformly in $q$", "Helical repetition codes show exponentially long memory at finite temperature via symmetry breaking; hypergraph products inherit $Z$-error self-correction" ], "keywords": [ { "label": "Lee Metric", "reason": "Core distance measure for small-shift noise on qudits" }, { "label": "Qudits", "reason": "Codes defined over $\\mathbb{Z}_q$ for arbitrary $q$" }, { "label": "LDPC", "reason": "Lee-LDPC distance bound is a main no-go result" }, { "label": "Self-Correction", "reason": "Helical repetition codes and hypergraph products give thermal memory" } ], "emoji": "📏", "social_summary": "Builds a Lee-metric theory of qudit stabilizer codes for small-shift noise, proving a linear distance obstruction for LDPC codes and finding self-correcting helical repetition codes.", "highlights_oneliner": "Quantum error correction with the Lee metric" }, { "arxiv_id": "2610.05589", "title": "Autonomous Quantum Memories from Classical Stochastic Processes", "authors": "Nadav Drechsler, Yuval Oreg, Dorit Aharonov", "arxiv_url": "https://arxiv.org/abs/2610.05589", "pdf_url": "https://arxiv.org/pdf/2610.05589.pdf", "summary": "Establishes an equivalence between CSS-based quantum memories under Pauli noise and classical memories via syndrome-based Lindbladians and syndrome-based probabilistic cellular automata (SPCAs). Gives the first rigorous proof that the 4D toric code with Toom's rule is a quantum memory under local Pauli noise below a constant threshold, for both synchronous and Floquet Lindbladian dynamics.", "motivation": "A central open question is whether quantum information can be preserved autonomously, without external controllers, decoders, or reactive corrections, in translationally invariant, time-independent systems. Linking quantum memory to classical stochastic memory offers a systematic route to provable autonomous memories.", "highlights": [ "Equivalence between classical continuous-time Markov memory and quantum memory for a broad class of syndrome-based Lindbladians", "One-to-one correspondence between SPCA classical memories and CSS quantum memories under local channels", "First rigorous proof that the 4D toric code with Toom's rule is a quantum memory below a constant noise threshold" ], "keywords": [ { "label": "Autonomous Memory", "reason": "Goal is memory without external control or decoding" }, { "label": "Toric Code", "reason": "4D toric code with Toom's rule proven to be a quantum memory" }, { "label": "Cellular Automata", "reason": "Syndrome-based PCAs map classical to quantum memories" }, { "label": "Lindbladians", "reason": "Asynchronous dynamics analyzed via syndrome-based Lindbladians" } ], "emoji": "🧠", "social_summary": "Maps autonomous quantum memories onto classical stochastic processes, yielding the first rigorous proof that the 4D toric code with Toom's rule protects quantum information under local Pauli noise.", "highlights_oneliner": "Classical processes yield autonomous quantum memories" }, { "arxiv_id": "2610.05928", "title": "Evaluating the performance of QEC primitives on quantum processors at large width and depth", "authors": "J. A. Montanez-Barrera; Kristel Michielsen", "arxiv_url": "https://arxiv.org/abs/2610.05928", "pdf_url": "https://arxiv.org/pdf/2610.05928.pdf", "summary": "Introduces a few-sample benchmark of QEC primitives using mid-circuit-measurement LR-QAOA whose Hamiltonian mimics a code's check structure, with approximation ratio decay versus depth mapped to an effective two-qubit depolarizing rate. Evaluated on 10 QPUs from IBM, IQM, and Quantinuum with up to 2950 MCM operations, including surface, color, and bivariate-bicycle structures, and correlated with logical-memory performance on ibm_phoenix.", "motivation": "Repeated syndrome extraction relies on mid-circuit measurement, reset, feed-forward, and scheduling, yet these are usually assessed in isolation or through resource-heavy logical memory experiments. A cheap benchmark helps independent institutions track QEC readiness across hardware generations.", "highlights": [ "Code-structured LR-QAOA benchmark with effective hardware error mapped to depolarizing rate $\\lambda_{\\text{eff}}$", "Tested on 10 QPUs with up to 2950 MCM operations; surface, color, and BB structures up to 81, 91, and 48 data qubits on Quantinuum", "Benchmark correlates with logical surface-code memory performance across regions of IBM ibm_phoenix" ], "keywords": [ { "label": "Benchmarking", "reason": "Paper proposes a low-resource QPU benchmark for QEC primitives" }, { "label": "Mid-Circuit Measurement", "reason": "Key primitive stressed by the benchmark circuits" }, { "label": "QAOA", "reason": "LR-QAOA provides the algorithmic signal used for benchmarking" }, { "label": "Syndrome Extraction", "reason": "Circuit connectivity mimics code syndrome-extraction structure" } ], "emoji": "📊", "social_summary": "Proposes a cheap QAOA-based benchmark that mimics syndrome extraction and mid-circuit measurements, tested on 10 quantum processors and correlated with logical memory performance.", "highlights_oneliner": "Low-cost QAOA benchmark for QEC hardware readiness" }, { "arxiv_id": "2610.06036", "title": "Materialised symmetries of 2D translationally invariant codes", "authors": "Andrew Li, Stephen D. Bartlett, Andrew C. Doherty, Campbell K. McLauchlan", "arxiv_url": "https://arxiv.org/abs/2610.06036", "pdf_url": "https://arxiv.org/pdf/2610.06036.pdf", "summary": "Decomposes the symmetry spaces of 2D CSS translationally invariant codes on infinite lattices into translation-invariant subspaces, giving an explicit plane-wave-like basis of materialised symmetries. Shows how to restrict this basis to rectangular periodic lattices and twisted boundaries, describing how symmetry spaces vary with lattice dimensions, with examples including the gross code.", "motivation": "Materialised symmetries enable matching-based decoders with provable thresholds, unlike heuristic decoders like BP, but their structure under translation and finite restriction for codes such as bivariate bicycle codes was not well understood.", "highlights": [ "Explicit plane-wave-like basis of symmetries for 2D CSS TI codes on infinite lattices", "Restriction to basis elements compatible with periodic boundaries gives symmetry spaces for any rectangular lattice", "Twisted boundaries handled without recomputing the decomposition; applications to matching decoders and the gross code" ], "keywords": [ { "label": "Materialised Symmetries", "reason": "Central objects characterized in the paper" }, { "label": "Bivariate Bicycle", "reason": "Prominent TI code family studied, including the gross code" }, { "label": "Matching Decoders", "reason": "Symmetries enable matchable decoding subproblems with thresholds" }, { "label": "Translation Invariance", "reason": "Structure exploited to decompose symmetry spaces" } ], "emoji": "🔷", "social_summary": "Characterizes materialised symmetries of 2D translationally invariant codes with an explicit plane-wave basis, showing how they restrict to finite periodic and twisted lattices for matching-based decoders.", "highlights_oneliner": "Explicit symmetry bases for 2D translation-invariant codes" }, { "arxiv_id": "2610.06402", "title": "When is the Clifford hierarchy generalized semi-Clifford?", "authors": "Rongbiao Thomas Wang, Bobby Zixuan Zhang", "arxiv_url": "https://arxiv.org/abs/2610.06402", "pdf_url": "https://arxiv.org/pdf/2610.06402.pdf", "summary": "The paper classifies when the $n$-qubit Clifford hierarchy level $\\mathcal{C}_k(n)$ is semi-Clifford (iff $k\\le2$, $n\\le2$, or $k=3$ and $n\\le6$) and generalized semi-Clifford (when $k\\le4$ or $n\\le3$), with counterexamples for $k,n\\ge5$. It shows that gates over $\\mathbb{Q}(i)$ are generalized semi-Clifford for $n=4$, and introduces $n_c$-generalized semi-Clifford gates of the form $\\sum_x|\\pi(x)\\rangle\\langle x|\\otimes V_x$, refining a conjecture of Zeng, Chen, and Chuang.", "motivation": "The Clifford hierarchy, introduced by Gottesman and Chuang for fault-tolerant computation via gate teleportation, lacks a group structure for $k\\ge3$ and remains poorly understood. Characterizing which levels decompose into semi-Clifford structure clarifies how non-Clifford gates can be implemented and constructed.", "highlights": [ "$\\mathcal{C}_k(n)$ is semi-Clifford iff $k\\le2$, $n\\le2$, or $k=3$ and $n\\le6$", "$\\mathcal{C}_k(n)$ is generalized semi-Clifford for $k\\le4$ or $n\\le3$, with counterexamples for $k,n\\ge5$", "Introduces $n_c$-generalized semi-Clifford gates and refines the Zeng-Chen-Chuang conjecture" ], "keywords": [ { "label": "Clifford Hierarchy", "reason": "The central object whose semi-Clifford structure is classified by level $k$ and qubit number $n$." }, { "label": "Semi-Clifford", "reason": "Gates of the form $C_1 D C_2$ whose occurrence in the hierarchy is characterized." }, { "label": "Fault Tolerance", "reason": "The hierarchy underlies gate teleportation for fault-tolerant non-Clifford gates." }, { "label": "Gate Structure", "reason": "Introduces the $n_c$-generalized semi-Clifford form as a structural refinement." } ], "emoji": "🪜", "social_summary": "Pins down exactly when the Clifford hierarchy decomposes into semi-Clifford structure, proves counterexamples at higher levels, and proposes a refined conjecture on gate structure.", "highlights_oneliner": "Classifying semi-Clifford structure in the Clifford hierarchy" }, { "arxiv_id": "2610.06607", "title": "Quantum codes are quantized codes: Stabilizer codes from quantization over finite fields", "authors": "Michael Zurel", "arxiv_url": "https://arxiv.org/abs/2610.06607", "pdf_url": "https://arxiv.org/pdf/2610.06607.pdf", "summary": "The paper presents a discrete analogue of geometric quantization over finite fields. Applied to certain classical error-correcting codes, it produces stabilizer quantum error-correcting codes, giving physical meaning to a known quantum-classical correspondence in coding theory.", "motivation": "The correspondence between classical codes and quantum stabilizer codes has long been a powerful tool in coding theory but lacked a physical interpretation. Framing it as quantization over finite fields explains why classical codes yield quantum codes.", "highlights": [ "Develops a discrete analogue of geometric quantization over finite fields", "Obtains stabilizer quantum codes by quantizing certain classical codes", "Gives a physical interpretation of the quantum-classical code correspondence" ], "keywords": [ { "label": "Stabilizer Codes", "reason": "The quantum codes obtained as outputs of the quantization procedure." }, { "label": "Quantization", "reason": "A discrete geometric quantization over finite fields is the core construction." }, { "label": "Finite Fields", "reason": "The setting over which the quantization of classical codes is carried out." }, { "label": "Classical Codes", "reason": "Certain classical error-correcting codes serve as the input to quantization." } ], "emoji": "🔄", "social_summary": "Shows that quantum stabilizer codes arise by quantizing classical codes over finite fields, giving a physical interpretation of a known quantum-classical correspondence.", "highlights_oneliner": "Stabilizer codes via finite-field quantization of classical codes" }, { "arxiv_id": "2610.06697", "title": "Measurement-free Preparation of Surface-Code States with Digital-Analog Counterdiabatic Drivings", "authors": "Shubham Kumar Balaganchi A. Bhargava, Paolo A. Erdman, Anne-Maria Visuri, Jose D. Martın-Guerrero, Yolanda Vives-Gilabert, Enrique Solano, Narendra N. Hegade", "arxiv_url": "https://arxiv.org/abs/2610.06697", "pdf_url": "https://arxiv.org/pdf/2610.06697.pdf", "summary": "The paper introduces a digital-analog counterdiabatic method for preparing surface-code ground-state manifolds without measurements, mapping stabilizer-local counterdiabatic terms to blocks of fixed-angle two-qubit $XY$ gates, single-qubit rotations, and analog exchange evolutions. Benchmarks on grids up to $4\\times4$ show improved ground-state preparation at short times over bare adiabatic evolution, and the construction generalizes to $n\\times m$ lattices with an order-of-magnitude reduction in entangling depth.", "motivation": "Logical-state initialization for surface codes needs four-body stabilizer correlations from native one- and two-body controls, and adiabatic preparation is limited by closing gaps and finite coherence times. Measurement-free, shallow, hardware-native preparation is a key primitive for near-term quantum error correction.", "highlights": [ "Maps stabilizer-local counterdiabatic terms to digital-analog blocks using native $XY$ interactions", "Improves short-time ground-state preparation versus bare adiabatic evolution on grids up to $4\\times4$", "Reduces entangling depth by an order of magnitude for general $n\\times m$ stabilizer lattices" ], "keywords": [ { "label": "Surface Codes", "reason": "The target ground-state manifolds being prepared on rotated and rectangular lattices." }, { "label": "Counterdiabatic Driving", "reason": "The adiabatic gauge potential framework used to speed up state preparation." }, { "label": "Digital-Analog", "reason": "Hybrid gate and analog-evolution synthesis reduces entangling depth." }, { "label": "State Preparation", "reason": "Measurement-free initialization of stabilizer-code states on superconducting hardware." } ], "emoji": "⚡", "social_summary": "Prepares surface-code states without measurements using digital-analog counterdiabatic drivings, cutting entangling depth by an order of magnitude on superconducting hardware.", "highlights_oneliner": "Measurement-free surface-code preparation via digital-analog counterdiabatic control" }, { "arxiv_id": "2610.04617", "title": "New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids", "authors": "Anderson S. Barbosa, Franklin de L. Marquezino, Giuliano G. La Guardia", "arxiv_url": "https://arxiv.org/abs/2610.04617", "pdf_url": "https://arxiv.org/pdf/2610.04617.pdf", "summary": "The paper constructs linear codes from book graphs, obtaining optimal binary codes via the $2$-sum of two equal book graphs, and uses matroid and graph theory to study their properties. It also shows that the incidence matrix of any graph yields a linear code over any finite field with the same parameters, and translates the condition for two linear codes to form a CSS code into matroid theory, using cycle graphs to generate such codes.", "motivation": "Classical linear codes underpin CSS quantum codes, so better classical constructions improve quantum code parameters $[[n,k,d]]$. Graph and matroid structures offer systematic routes to codes with large dimension and minimum distance for a given length.", "highlights": [ "Binary codes with optimal minimum distance from the $2$-sum of two equal book graphs", "Graph incidence matrices yield linear codes over any finite field with the same parameters", "CSS compatibility condition translated into matroid theory, with cycle graphs generating valid codes" ], "keywords": [ { "label": "CSS Codes", "reason": "The quantum code family whose construction condition is translated into matroid language." }, { "label": "Graph Codes", "reason": "Linear codes derived from book graphs and incidence matrices." }, { "label": "Matroids", "reason": "Matroid theory is used to analyze code properties and the CSS condition." }, { "label": "Linear Codes", "reason": "Optimal binary linear codes are obtained via the $2$-sum of book graphs." } ], "emoji": "🕸️", "social_summary": "Builds optimal binary linear codes from book graphs and uses matroid theory to express and satisfy the CSS condition for quantum code construction.", "highlights_oneliner": "Graph and matroid constructions for classical and CSS codes" } ] }, "2026-10-05": { "word_cloud": [ { "word": "qLDPC", "weight": 4 }, { "word": "Decoders", "weight": 4 }, { "word": "Surface", "weight": 4 }, { "word": "Hyperedges", "weight": 2 }, { "word": "Lean", "weight": 3 }, { "word": "Distance", "weight": 4 }, { "word": "Subsystem", "weight": 2 }, { "word": "Bosonic", "weight": 2 }, { "word": "Qudit", "weight": 2 }, { "word": "Percolation", "weight": 2 }, { "word": "Certificates", "weight": 2 }, { "word": "Distillation", "weight": 2 }, { "word": "Correlated", "weight": 2 }, { "word": "Hyperbolic", "weight": 2 }, { "word": "Addressable", "weight": 2 } ], "social_highlights": "", "papers": [ { "arxiv_id": "2610.02648", "title": "Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound", "authors": "Tushant Mittal, Shashank Srivastava, Madhur Tulsiani, Mary Wootters", "arxiv_url": "https://arxiv.org/abs/2610.02648", "pdf_url": "https://arxiv.org/pdf/2610.02648.pdf", "summary": "The authors construct an ensemble of $p$-ary quantum LDPC codes with constant-weight checks whose normalized distance approaches the quantum Gilbert-Varshamov bound $\\delta_{\\mathrm{GV}}(p,R)-\\epsilon$ with high probability. The construction combines asymptotically good QLDPC codes with the Alon-Edmonds-Luby expander-based distance amplification to control degeneracy, then concatenates with random inner codes in a quantum analogue of Thommesen's construction. The ensemble matches random stabilizer codes on the erasure channel capacity and the hashing bound for Pauli channels.", "motivation": "Random stabilizer codes achieve the quantum GV bound but have dense checks, while known QLDPC codes are far from this bound in the rate-distance tradeoff. Closing this gap requires handling the inherent degeneracy of sparse-check codes, which complicates distance analysis.", "highlights": [ "QLDPC codes with $O_\\epsilon(1)$-weight checks reach distance $\\delta_{\\mathrm{GV}}(p,R)-\\epsilon$ for any prime $p$", "Quantitative control of degeneracy via AEL distance amplification of good QLDPC codes", "Ensemble approaches erasure-channel quantum capacity and hashing bound for depolarizing noise" ], "keywords": [ { "label": "QLDPC", "reason": "The core object is a family of sparse-check quantum codes with constant-weight checks." }, { "label": "Gilbert-Varshamov", "reason": "The paper's main result is approaching the quantum GV bound with LDPC codes." }, { "label": "Degeneracy", "reason": "Controlling low-weight stabilizers is the key technical challenge and contribution." }, { "label": "Concatenation", "reason": "A random inner code concatenated with a low-degeneracy outer code yields the ensemble." } ], "emoji": "🎲", "social_summary": "Shows random quantum LDPC codes can approach the Gilbert-Varshamov bound with constant-weight checks, by taming degeneracy through expander-based amplification and random concatenation.", "highlights_oneliner": "Random QLDPC codes near the GV bound" }, { "arxiv_id": "2610.02310", "title": "Homological Thresholds in Randomly Monitored Quantum Error-Correcting Codes", "authors": "Yoshito Watanabe, Daiki Sasamoto, Bo Han, Simon Trebst", "arxiv_url": "https://arxiv.org/abs/2610.02310", "pdf_url": "https://arxiv.org/pdf/2610.02310.pdf", "summary": "The paper studies stabilizer code robustness under one round of random single-qubit Pauli measurements, showing thresholds fall into geometric versus homological percolation classes, exemplified by the color code and toric code. Critical exponents are estimated from stabilizer simulations of over one million qubits, and the framework extends to non-CSS, subsystem, higher-dimensional and Floquet codes. The results bound inference and decoding thresholds and are applied to the gross code.", "motivation": "Monitored dynamics connects code decoding to percolation, random-bond models and Nishimori physics, but a unified classification of monitoring thresholds across code families was lacking. Easy-to-compute monitoring thresholds can guide the much harder inference and maximum-likelihood decoding problems.", "highlights": [ "Two threshold classes identified: geometric percolation versus homological percolation", "Critical exponents from stabilizer simulations with over $10^6$ qubits", "Monitoring thresholds bound Nishimori and decoding thresholds, including for the gross code" ], "keywords": [ { "label": "Percolation", "reason": "Monitoring thresholds are captured by geometric and homological percolation transitions." }, { "label": "Monitored Dynamics", "reason": "Random projective measurements model the interplay of monitoring and decoding." }, { "label": "Toric Code", "reason": "Serves as the principal example of the homological percolation class." }, { "label": "Color Code", "reason": "Principal example of the geometric percolation class." } ], "emoji": "🔍", "social_summary": "Classifies stabilizer code robustness under random Pauli monitoring into geometric and homological percolation thresholds, with million-qubit simulations and bounds on decoding thresholds.", "highlights_oneliner": "Percolation thresholds of monitored stabilizer codes" }, { "arxiv_id": "2610.02392", "title": "Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d,q): Construction, Structural Theorems, and Monte-Carlo Performance", "authors": "Michel Kulhandjian, Lajos Hanzo", "arxiv_url": "https://arxiv.org/abs/2610.02392", "pdf_url": "https://arxiv.org/pdf/2610.02392.pdf", "summary": "The authors propose $Q(q,d)$, non-CSS $q$-ary qudit stabilizer codes built from Singer difference sets and non-degenerate quadrics in $PG(d,q)$, with parity check $H=(A\\,|\\,M_QA)$ made symplectic-isotropic by a Cancellation Lemma. Structural theorems give a distance ceiling, a Clifford bridge to a graph-state encoding of the trivial Singer CSS code, and the exact relation $d_{\\min}=R_P+1$. Examples include $[[31,15,6]]_5$ and $[[57,28,d\\ge 8]]_7$, with Monte-Carlo simulation showing a 70-fold per-logical-qudit improvement over the Steane code.", "motivation": "Finite-geometry constructions such as Singer difference sets give cyclic stabilizer codes with structured checks, and quadrics were used in classical LDS-NOMA signature design. Bridging these gives qudit codes with closed-form rate and provable distance, useful for higher-dimensional quantum systems.", "highlights": [ "Family $Q(p,2)=[[p^2+p+1,\\,p(p+1)/2,\\,d_{\\min}]]_p$ with asymptotic rate one-half", "Exact characterization $d_{\\min}=R_P+1$ and bound $d_{\\min}(Q(7,2))\\ge 8$ via exhaustive search", "$Q(5,2)$ shows ~70x per-logical-qudit improvement over Steane $[[7,1,3]]_2$ at depolarizing rate $10^{-3}$" ], "keywords": [ { "label": "Qudit Codes", "reason": "The codes are $q$-ary stabilizer codes over qudits of prime power dimension." }, { "label": "Singer Difference Sets", "reason": "Provide the circulant incidence structure underlying the parity-check matrix." }, { "label": "Finite Geometry", "reason": "Construction relies on non-degenerate quadrics in projective space $PG(d,q)$." }, { "label": "Clifford Equivalence", "reason": "An explicit Clifford bridge relates $Q(q,2)$ to a graph-state encoding of a CSS code." } ], "emoji": "📐", "social_summary": "Introduces qudit stabilizer codes from Singer difference sets and quadrics in projective geometry, with provable distance results and a 70-fold simulated improvement over the Steane code.", "highlights_oneliner": "Finite-geometry non-CSS qudit stabilizer codes" }, { "arxiv_id": "2610.02621", "title": "High-Rate Quantum Codes with Proven Distance and Low-Weight Measurements", "authors": "Kishor Bharti, Tobias Haug, Runzhou Tao, Kevin Ye", "arxiv_url": "https://arxiv.org/abs/2610.02621", "pdf_url": "https://arxiv.org/pdf/2610.02621.pdf", "summary": "The paper studies subsystem codes on rectangular coordinate grids of any dimension with even side lengths at least four, where measured gauge operators act along coordinate lines. For every member the number of logical qubits is derived and the dressed distance is proven (equal to $2^L$ for $L$ axes) without numerical search. Under a 10,000-qubit budget, the rate-versus-measurement-weight tradeoff is fully mapped, e.g. 4,096 logical qubits at distance 16 with weight-ten measurements.", "motivation": "Subsystem codes can replace heavy stabilizer measurements with lighter gauge measurements, but gauge multiplication complicates distance analysis. Proven parameters enable code selection as a finite optimization under hardware constraints.", "highlights": [ "Dressed distance is exactly $2^L$ for $L$ axes, independent of side lengths", "10,000 data qubits: 4,096 logical qubits at distance 16 with weight-ten measurements", "Lean formal verification snippets for the construction and its dressed and bare distances" ], "keywords": [ { "label": "Subsystem Codes", "reason": "The construction uses gauge operators measured along coordinate lines." }, { "label": "Many-Hypercube", "reason": "The family extends many-hypercube codes based on concatenated error-detecting codes." }, { "label": "Dressed Distance", "reason": "Proving distance after gauge multiplication is the central theorem." }, { "label": "Lean", "reason": "Formal verification in Lean supports the distance proofs." } ], "emoji": "🧊", "social_summary": "Proves exact distances for high-rate subsystem codes on rectangular grids with low-weight measurements, mapping rate versus weight tradeoffs and including Lean formal verification.", "highlights_oneliner": "Provable high-rate low-weight subsystem codes" }, { "arxiv_id": "2610.02734", "title": "SMP: A General Hyperedge-Based Framework for Circuit-Level Quantum Error Correction", "authors": "Siying Wang, Yue Yan, Zhixin Xia, Canwei Shi, Hannuo Yuan, Xiang-Bin Wang", "arxiv_url": "https://arxiv.org/abs/2610.02734", "pdf_url": "https://arxiv.org/pdf/2610.02734.pdf", "summary": "Syndrome Motif Projection (SMP) incorporates hyperedge fault information into matching-based decoders by recognizing characteristic local syndrome motifs with linear-complexity preprocessing, leaving the matching backend unchanged. It improves standard and correlated matching on Google's Willow surface code data, reduces color code logical failure by up to 77.8% with Chromobius, and cuts a six-CNOT circuit failure by 35.5%.", "motivation": "Hyperedge faults from circuit-level propagation and correlated noise degrade pairwise matching decoders, while hypergraph, neural or belief-matching decoders cost substantial computation. A lightweight approach compatible with real-time matching decoders is needed.", "highlights": [ "Linear-complexity preprocessing front end preserving the matching backend", "Outperforms tested belief matching on Google Willow surface code data", "Up to 77.8% logical failure reduction for color codes with Chromobius" ], "keywords": [ { "label": "Hyperedges", "reason": "Handling multi-detector fault mechanisms is the paper's core problem." }, { "label": "Matching Decoders", "reason": "SMP augments MWPM-style decoders without changing the backend." }, { "label": "Color Codes", "reason": "Evaluated with Chromobius to achieve large failure reductions." }, { "label": "Real-Time Decoding", "reason": "The lightweight design targets scalable low-latency architectures." } ], "emoji": "🧩", "social_summary": "Introduces Syndrome Motif Projection, a lightweight front end that feeds hyperedge fault information into matching decoders, improving surface code, color code and logical gate circuit performance.", "highlights_oneliner": "Hyperedge-aware matching via syndrome motifs" }, { "arxiv_id": "2610.03399", "title": "Optimizing quantum error correction through error attribution", "authors": "Yuguo Shao, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2610.03399", "pdf_url": "https://arxiv.org/pdf/2610.03399.pdf", "summary": "The authors introduce an error attribution scheme that estimates the sensitivity of the logical error rate to noise at each circuit component, computed jointly from the same Monte Carlo samples used for the logical error rate. Sensitivity maps identify hotspots for targeted noise reduction; in rotated surface code memories and lifted product codes, halving noise on about 5-7% of selected components cuts logical error rates by roughly 15-25%, about twice the effect of random selection.", "motivation": "Logical error rate is only an aggregate benchmark, though errors at different circuit locations affect logical failure very differently. Limited calibration resources call for knowing which components most merit improvement.", "highlights": [ "All component sensitivities estimated from the same Monte Carlo samples, with no extra decoder evaluations", "Sensitivity-guided halving of noise on 5-7% of components reduces logical error by ~15-25%", "About twice the improvement of randomly chosen components for surface and lifted product codes" ], "keywords": [ { "label": "Error Attribution", "reason": "The core method quantifies each component's influence on logical failure." }, { "label": "Sensitivity Maps", "reason": "Identify hotspots for targeted noise reduction." }, { "label": "Surface Codes", "reason": "Rotated surface code memories are a main test case." }, { "label": "Lifted Product", "reason": "High-rate lifted product codes serve as a structurally distinct benchmark." } ], "emoji": "🎯", "social_summary": "Maps which circuit components drive logical failure using Monte Carlo error attribution, showing targeted noise reduction on few components roughly doubles the benefit of random choices.", "highlights_oneliner": "Targeted QEC optimization via error attribution" }, { "arxiv_id": "2610.03429", "title": "Fault tolerance of quantum circuits with tensor networks and symplectic geometry", "authors": "Soham Ghosh, Holger Boche, Andrew Tanggara", "arxiv_url": "https://arxiv.org/abs/2610.03429", "pdf_url": "https://arxiv.org/pdf/2610.03429.pdf", "summary": "An operator-algebraic framework gives necessary and sufficient fault-tolerance conditions, with an SDP test certifying the nonexistence of a recovery map. For stabilizer circuits, symplectic geometry yields closed-form detection and logical-effect matrices, certifying distance four and two logical qubits in a Hastings-Haah honeycomb Floquet circuit. MacWilliams identities for circuit weight enumerators give LP distance bounds, pseudothreshold bounds under depolarizing noise, and flag-circuit bounds, with a tight distance-three Hamming-code benchmark.", "motivation": "Fault tolerance of whole circuits, including dynamical codes and syndrome extraction, lacks algebraic tools analogous to static-code distance theory. Algebraic and LP bounds enable certification and design of circuits without exhaustive search.", "highlights": [ "SDP-based infeasibility certificate that no recovery map restores the circuit's intended operation", "Closed-form detection/logical-effect matrices certify distance four for a honeycomb Floquet circuit", "MacWilliams identities and LP bounds on circuit distance, including flag syndrome-extraction orderings" ], "keywords": [ { "label": "Circuit Distance", "reason": "Algebraic characterization and bounds of circuit-level distance are the main results." }, { "label": "Floquet Codes", "reason": "Honeycomb Floquet circuit used to certify dynamical encoding." }, { "label": "MacWilliams Identities", "reason": "Derived for circuit weight enumerators to yield LP bounds." }, { "label": "Flag Circuits", "reason": "LP bounds extended using the $t$-flag criterion for syndrome extraction." } ], "emoji": "🧮", "social_summary": "Develops operator-algebraic and symplectic tools that certify fault tolerance of quantum circuits, with SDP tests, MacWilliams identities and LP bounds on circuit distance.", "highlights_oneliner": "Algebraic fault-tolerance certification of circuits" }, { "arxiv_id": "2610.03545", "title": "What Must a Quantum-Memory Decoder Know About Temporally Correlated Noise?", "authors": "Danesh Morales-Hashemi, Graeme Smith, Ningping Cao", "arxiv_url": "https://arxiv.org/abs/2610.03545", "pdf_url": "https://arxiv.org/pdf/2610.03545.pdf", "summary": "The paper studies what a decoder must know about temporally correlated noise, using weak coherent $X$ rotations with a shared sign that is either fixed for a run or redrawn each interval. These models have identical syndrome statistics and spatiotemporal Pauli process yet need different logical corrections, causing worst-case fidelity loss approaching $1/2$ without model knowledge. Matching calibration bounds show complete QEC cycles need noise intervals scaling as the inverse rotation angle to the $X$ distance, reduced to inverse-square with delayed extraction.", "motivation": "Experiments increasingly use syndrome data to calibrate decoders, but it is unclear which properties of temporally correlated noise matter for choosing recovery. Understanding the information cost clarifies limits of syndrome-based learning.", "highlights": [ "Fixed-sign and resampled-sign models share syndrome statistics and the Pauli-twirled process yet worst-case fidelity loss approaches $1/2$", "Calibration cost scales as $(1/\\theta)^{d_X}$, improving to inverse-square with two uninterrupted intervals before extraction", "Pauli twirling changes recovery performance and information needs; discarding the twirl record makes the SPP sufficient" ], "keywords": [ { "label": "Correlated Noise", "reason": "Temporal correlations in the noise source create decoder ambiguity." }, { "label": "Decoder Calibration", "reason": "The paper quantifies information and experimental cost needed to select recovery." }, { "label": "Pauli Twirling", "reason": "Twirling changes both fidelity and information requirements." }, { "label": "Non-Markovian", "reason": "Classical memory in the noise source is the origin of the separation." } ], "emoji": "⏳", "social_summary": "Shows decoders can lose nearly half their fidelity when temporally correlated noise looks identical in syndromes, and derives matching bounds on the calibration cost needed to resolve it.", "highlights_oneliner": "Decoder calibration cost for temporally correlated noise" }, { "arxiv_id": "2610.03594", "title": "Fault-tolerant and fully addressable unitary logical gates via round-robin sparsification", "authors": "Kaavya Sahay, Cody Jones", "arxiv_url": "https://arxiv.org/abs/2610.03594", "pdf_url": "https://arxiv.org/pdf/2610.03594.pdf", "summary": "The paper constructs explicit low-depth unitary circuits realizing fully addressable, fault-tolerant two-qubit Clifford ($CZ$) gates for a subset of two-dimensional translationally invariant qLDPC codes. The circuits are obtained by a geometrically structured sparsification of round-robin circuits, and are numerically simulated for toric, cyclic hypergraph-product, color, gross, and directional codes, showing memory-like logical error scaling.", "motivation": "qLDPC codes encode many logical qubits efficiently, but exploiting this requires gates acting on individual logical qubits rather than whole blocks. Addressable, constant-depth, fault-tolerant gates have been lacking for these code families.", "highlights": [ "Circuit depth independent of code distance for addressable logical $CZ$ gates", "Demonstrated cross-code, intra-code, and simultaneous addressable $CZ$s across toric, color, directional, cyclic hypergraph-product, and gross codes", "Numerical simulations show memory-like logical error rate scaling" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The gates are built for two-dimensional translationally invariant qLDPC codes." }, { "label": "Addressable Gates", "reason": "Central goal is manipulating individual logical qubits within a code block." }, { "label": "Sparsification", "reason": "Round-robin circuits are geometrically sparsified to achieve low depth." }, { "label": "Transversal Gates", "reason": "Resulting unitaries are fault-tolerant transversal-type logical $CZ$ gates." } ], "emoji": "🔗", "social_summary": "Introduces low-depth, fault-tolerant addressable logical CZ gates for translationally invariant qLDPC codes via round-robin sparsification, with memory-like error scaling across toric, color, and gross codes.", "highlights_oneliner": "Addressable fault-tolerant CZ gates for qLDPC" }, { "arxiv_id": "2610.03605", "title": "Efficient fidelity simulation of high-rate magic distillation circuits", "authors": "Xiao Xiao, Dominik Hangleiter, J. Pablo Bonilla Ataides, Rohan Mehta, Varun Menon, Mikhail D. Lukin, Michael J. Gullans", "arxiv_url": "https://arxiv.org/abs/2610.03605", "pdf_url": "https://arxiv.org/pdf/2610.03605.pdf", "summary": "The authors develop exact and efficient classical algorithms for benchmarking circuits built from $X$, CNOT, and diagonal Clifford-hierarchy gates, including teleportation gadgets with feedforward, without simulating logical measurements. For third-level diagonal gates the algorithm samples syndrome statistics and estimates logical fidelity and Clifford observable expectations in time polynomial in $n$ and $T$.", "motivation": "Non-Clifford circuits are classically hard to simulate, which impedes understanding of fault-tolerant performance of magic state protocols. Efficient exact benchmarking is needed to optimize distillation and cultivation factories.", "highlights": [ "Polynomial scaling in physical qubits $n$ and depth $T$, independent of logical qubit count", "Syndrome expectation evaluation extends to fourth-level diagonal gates", "Used to optimize high-rate magic distillation based on three copies of a $[[27,3,3]]$ tricycle code" ], "keywords": [ { "label": "Magic Distillation", "reason": "Simulation is used to optimize high-rate distillation factories." }, { "label": "Classical Simulation", "reason": "Core contribution is efficient exact classical benchmarking algorithms." }, { "label": "Clifford Hierarchy", "reason": "Algorithms handle diagonal gates at third and fourth Clifford hierarchy levels." }, { "label": "Tricycle Code", "reason": "Application uses three copies of the $[[27,3,3]]$ tricycle code." } ], "emoji": "✨", "social_summary": "Develops polynomial-time exact classical algorithms for benchmarking non-Clifford fault-tolerant circuits, enabling optimization of high-rate magic state distillation factories built on tricycle codes.", "highlights_oneliner": "Efficient simulation of magic distillation fidelity" }, { "arxiv_id": "2610.03663", "title": "BARC codes: general polynomial framework for coherent-state superposition codes", "authors": "Praneel Gore, Davit Aghamalyan, Varun Narasimhachar, Andrew Tanggara", "arxiv_url": "https://arxiv.org/abs/2610.03663", "pdf_url": "https://arxiv.org/pdf/2610.03663.pdf", "summary": "The paper introduces bosonic algebraically-restricted constellation (BARC) codes, whose code states are superpositions of coherent-state constellations constrained by symmetries of solution sets to multivariate polynomial systems. These constraints impose approximate Knill-Laflamme conditions for photon loss and gain, with upper bounds on constellation separation and explicit ellipsoidal and hexagonal single-mode families.", "motivation": "Cat-type coherent-state codes lack a unifying algebraic construction principle to systematically design constellations resilient to photon loss and gain. A polynomial framework enables general, multi-mode code design.", "highlights": [ "Algebraic framework linking Knill-Laflamme conditions to polynomial ideals and moment symmetries", "Upper bounds on minimum geometric separation for equally-weighted constellations", "Explicit ellipsoidal and hexagonal codes benchmarked against spherical and cubature codes under pure loss" ], "keywords": [ { "label": "Bosonic Codes", "reason": "Codes encode information in coherent-state superpositions of oscillator modes." }, { "label": "Coherent States", "reason": "Code states are constellations of coherent states." }, { "label": "Photon Loss", "reason": "Constraints target approximate correction of photon loss and gain errors." }, { "label": "Polynomial Framework", "reason": "Constellations arise from solution sets of multivariate polynomial systems." } ], "emoji": "🌌", "social_summary": "Introduces BARC codes, an algebraic polynomial framework for building coherent-state superposition codes that protect against photon loss and gain, with explicit hexagonal and ellipsoidal constructions.", "highlights_oneliner": "Polynomial framework for coherent-state bosonic codes" }, { "arxiv_id": "2610.03677", "title": "Exact Recovery for Non-Abelian Surface Codes", "authors": "Alison Warman, Nathanan Tantivasadakarn, Sakura Schafer-Nameki", "arxiv_url": "https://arxiv.org/abs/2610.03677", "pdf_url": "https://arxiv.org/pdf/2610.03677.pdf", "summary": "The paper studies exact recovery for non-Abelian surface codes from the quantum double $D(G)$ of any finite group $G$. It constructs an orthogonal error basis from group multiplication and irreducible representation operators, introduces a gauge-fixing for completeness on the code space, and builds charge and flux transfer circuits that move correctable errors onto ancillas.", "motivation": "Non-Abelian topological codes enable non-Clifford transversal gates and magic states, but their lack of an Abelian stabilizer group makes error correction challenging. Deterministic recovery protocols have been missing.", "highlights": [ "Complete orthogonal error basis on the code space via a gauge-fixing", "Charge and flux transfer circuits project errors onto ancillas", "Exact deterministic recovery protocol for any finite, including non-Abelian, group $G$" ], "keywords": [ { "label": "Non-Abelian Codes", "reason": "Codes are based on quantum double $D(G)$ for non-Abelian groups." }, { "label": "Surface Codes", "reason": "Work generalizes surface code recovery beyond $\\mathbb{Z}_2$." }, { "label": "Error Recovery", "reason": "Main result is an exact deterministic recovery protocol." }, { "label": "Quantum Double", "reason": "The $D(G)$ model underlies the code construction." } ], "emoji": "🧩", "social_summary": "Constructs an exact, deterministic recovery protocol for non-Abelian surface codes using orthogonal error bases and charge and flux transfer circuits applicable to any finite group.", "highlights_oneliner": "Exact deterministic recovery for non-Abelian surface codes" }, { "arxiv_id": "2610.03682", "title": "Low-Overhead Quantum Error Correction with Boundary-Connected Planar Modules", "authors": "Oscar Higgott, Hasan Sayginel, Francisco J. H. Heras, Zhiyang He, Tomas Jochym-O'Connor, Andrew W. Senior, Lei M. Zhang, Thomas Edlich, James S. Spencer, Matt McEwen, Craig Gidney, Johannes Bausch, Pushmeet Kohli, Hartmut Neven", "arxiv_url": "https://arxiv.org/abs/2610.03682", "pdf_url": "https://arxiv.org/pdf/2610.03682.pdf", "summary": "By wiring sparse static boundary connections between Euclidean planar modules, the authors build modular hyperbolic surface and color codes based on semi-hyperbolic code families. Circuit-level simulations with modular syndrome extraction and neural network and matching decoders show over tenfold qubit overhead reduction versus surface codes, with projections to codes of rate $k/n=1/16$ and $d\\geq 22$.", "motivation": "The planar surface code demands large physical qubit overhead, while high-rate codes typically need non-local connectivity. Modular planar chips with limited inter-module links could offer high-rate efficiency while retaining fabrication advantages.", "highlights": [ "Tenfold or greater overhead reduction versus surface code, robust to elevated seam error rates", "Projected codes with $k/n=1/16$ and $d\\geq 22$, over $30\\times$ overhead reduction", "Fault-tolerant walking circuits for logic via code automorphisms with extractor system $\\approx 4.5\\times$ smaller than the code" ], "keywords": [ { "label": "Hyperbolic Codes", "reason": "Modular hyperbolic surface and color codes are the core construction." }, { "label": "Modular Architecture", "reason": "Planar modules joined by sparse boundary connections." }, { "label": "Neural Decoders", "reason": "Neural network and matching decoders used in circuit-level simulations." }, { "label": "Code Automorphisms", "reason": "Logic implemented via fault-tolerant walking circuits." } ], "emoji": "🧱", "social_summary": "Connects planar modules with sparse boundary links to form modular hyperbolic surface and color codes, cutting qubit overhead by tenfold or more over the surface code in circuit-level simulations.", "highlights_oneliner": "Modular hyperbolic codes slash surface code overhead" }, { "arxiv_id": "2610.03684", "title": "Single-Shot Error Correction at Optimal Spacetime Cost", "authors": "Kishor Bharti, Tobias Haug, Derek Khu, Andrew Tanggara", "arxiv_url": "https://arxiv.org/abs/2610.03684", "pdf_url": "https://arxiv.org/pdf/2610.03684.pdf", "summary": "The paper shows that storing $K$ logical qubits for $S$ steps at error $\\varepsilon$ can be achieved with spacetime cost $O(S(K+\\log(S/\\varepsilon)))$ using an explicit noisy error-correction circuit with efficient decoding and quantum Tanner codes. The construction tolerates general weak circuit noise including correlated faults and extends to constant-depth logical Clifford operations.", "motivation": "Prior optimal-spacetime memory constructions assumed ideal error correction, leaving open whether the bound survives noisy syndrome extraction and decoding latency. Resolving this clarifies the true resource cost of reliable quantum memory.", "highlights": [ "Matches the independent-erasure lower bound $\\Omega(S(K+\\log(S/\\varepsilon)))$ up to constants under noisy recovery", "Each memory step uses one syndrome round plus a fixed number of parallel decoder steps, with cost linear in code size", "Analysis extends to certain constant-depth logical Clifford operations" ], "keywords": [ { "label": "Quantum Tanner", "reason": "Quantum Tanner codes provide the good codes enabling single-shot correction." }, { "label": "Single-Shot", "reason": "Error correction uses one syndrome round per memory step." }, { "label": "Spacetime Cost", "reason": "Optimal spacetime scaling is the central result." }, { "label": "Quantum Memory", "reason": "The setting is storing logical qubits over many time steps." } ], "emoji": "⏳", "social_summary": "Proves quantum Tanner code memories reach optimal spacetime cost even with noisy syndrome extraction and efficient decoding, adding only a logarithmic overhead shared across all stored qubits.", "highlights_oneliner": "Optimal spacetime cost memory with noisy recovery" }, { "arxiv_id": "2610.03714", "title": "SpiderCSS: Scalable Fault-Tolerant CSS State Preparation", "authors": "Boldizsár Poór, Andrey Boris Khesin, Sarah Meng Li, Benjamin Rodatz, John van de Wetering, Richie Yeung", "arxiv_url": "https://arxiv.org/abs/2610.03714", "pdf_url": "https://arxiv.org/pdf/2610.03714.pdf", "summary": "SpiderCSS is a compilation pipeline that uses the ZX-calculus and fault-equivalent rewrites to generate fault-tolerant state preparation circuits for arbitrary CSS codes. The modular construction is CNOT-minimal within components and in their connections, and is provably fault-tolerant without expensive verification.", "motivation": "Fault-tolerant logical state preparation is a key primitive for large-scale quantum computing, but existing methods are heuristic or do not scale. A provably correct, optimized compiler is needed for arbitrary CSS codes.", "highlights": [ "Provably fault-tolerant circuits via fault-equivalent ZX rewrites without verification", "Monte Carlo simulations up to distance 15 show reduced depth and qubit footprint", "Average 33.7% logical error rate decrease and 9.5% acceptance rate increase" ], "keywords": [ { "label": "ZX-Calculus", "reason": "Fault-equivalent ZX rewrites drive the circuit synthesis." }, { "label": "CSS Codes", "reason": "The pipeline targets state preparation for arbitrary CSS codes." }, { "label": "State Preparation", "reason": "Fault-tolerant logical state preparation is the main task." }, { "label": "Circuit Compilation", "reason": "CNOT-minimal modular compilation reduces depth and qubit count." } ], "emoji": "🕷️", "social_summary": "Compiles provably fault-tolerant, CNOT-minimal CSS state preparation circuits using ZX-calculus fault-equivalent rewrites, reducing logical error rate by about a third versus existing methods up to distance 15.", "highlights_oneliner": "ZX-based fault-tolerant CSS state preparation compiler" }, { "arxiv_id": "2610.03214", "title": "Quantum code parameters, checkable by a certificate of provable size", "authors": "Shuoming An, Fusheng Yang", "arxiv_url": "https://arxiv.org/abs/2610.03214", "pdf_url": "https://arxiv.org/pdf/2610.03214.pdf", "summary": "The paper makes quantum code parameters, notably the distance $d$, verifiable via short certificates (lists, pairings, or symbolic instances) whose correctness the Lean proof assistant kernel decides by computation. Certificate size is itself a theorem: enumeration lists $\\sum_{j(n-k+1)/2$ and proves a Clique Path obstruction ruling out $t\\leq (n-1)/k$, matching exactly at $k=2$, using $k$-colorability of graphs derived from the access structure.", "motivation": "No-cloning forbids single-copy threshold QSS for $t\\leq n/2$, but multiple copies could circumvent this. Characterizing the many-copy case clarifies feasibility limits and implies analogous obstructions for erasure-channel quantum error correction.", "highlights": [ "Positive result: $k$-copy QSS for thresholds $t>(n-k+1)/2$", "Clique Path obstruction: impossible whenever $t\\leq (n-1)/k$, applicable to arbitrary access structures", "Bounds match for $k=2$; graph coloring conjectured to capture feasibility for general $k$" ], "keywords": [ { "label": "Secret Sharing", "reason": "Central task with access structures and thresholds." }, { "label": "No-Cloning", "reason": "Source of the impossibility obstructions." }, { "label": "Erasure Channels", "reason": "Obstructions carry over to erasure error correction." }, { "label": "Graph Coloring", "reason": "$k$-colorability characterizes feasibility results." } ], "emoji": "🔐", "social_summary": "Show that giving multiple copies of the input state moves quantum secret sharing beyond the no-cloning threshold, with tight bounds for two copies via graph coloring arguments.", "highlights_oneliner": "Multi-copy quantum secret sharing beyond no-cloning" }, { "arxiv_id": "2610.01253", "title": "Context-Aware Error Mitigation Orchestration for Hybrid Quantum Reinforcement Learning on NISQ Systems", "authors": "Bisma Majid, Shabir Ahmed Sofi, Mir Mohammad Yousuf", "arxiv_url": "https://arxiv.org/abs/2610.01253", "pdf_url": "https://arxiv.org/pdf/2610.01253.pdf", "summary": "APGEM is an orchestration layer in hybrid quantum reinforcement learning that dynamically selects among ZNE, PEC, CDR, and REM using policy-level indicators such as fidelity, entropy, reward, and approximation ratio. On the Capacitated Vehicle Routing Problem under multiple NISQ noise models it outperforms static mitigation and reaches about $94\\%$ of oracle utility.", "motivation": "Fixed error mitigation corrections do not adapt to changing noise or the evolving training state, degrading quantum policy quality on NISQ devices. Integrating adaptive mitigation into learning could make QRL more reliable.", "highlights": [ "Context-aware selection among ZNE, PEC, CDR, and REM inside the RL training loop", "Achieves about $94\\%$ of the oracle strategy's utility and maintains higher fidelity as noise increases", "Ablations show learned mitigation policies adapt to distinct noise regimes" ], "keywords": [ { "label": "Error Mitigation", "reason": "Core technique being adaptively orchestrated." }, { "label": "Quantum RL", "reason": "Application setting for variational policies." }, { "label": "NISQ", "reason": "Noisy hardware regime motivating the framework." }, { "label": "ZNE", "reason": "One of the mitigation strategies selected from." } ], "emoji": "🎛️", "social_summary": "Orchestrate error mitigation adaptively during quantum reinforcement learning, picking the best technique per noise context and nearly matching an oracle on vehicle routing under NISQ noise.", "highlights_oneliner": "Adaptive error mitigation for quantum reinforcement learning" }, { "arxiv_id": "2610.02031", "title": "Adaptivity is all you need: Optimal stabilizer learning using just single-copy measurements", "authors": "L. Bittel, J. Eisert, W. Gong, A. A. Mele, L. Schatzki", "arxiv_url": "https://arxiv.org/abs/2610.02031", "pdf_url": "https://arxiv.org/pdf/2610.02031.pdf", "summary": "A polynomial-time adaptive algorithm learns an arbitrary $n$-qubit stabilizer state from $\\Theta(n)$ single-copy Clifford measurements, matching Bell sampling's optimal sample complexity without multi-copy measurements. It also yields an optimal single-copy tolerant tester, a memory tradeoff $\\Theta(n-k+1/\\varepsilon)$, and learning of states with stabilizer nullity $r$ using $O(n2^{r})$ measurements.", "motivation": "Non-adaptive single-copy measurements require $\\Omega(n^2)$ copies versus $\\Theta(n)$ for two-copy Bell sampling, leaving a gap between experimentally convenient and optimal protocols. Closing it avoids coherent quantum memory across copies.", "highlights": [ "Adaptive learning of $n$-qubit stabilizer states with $\\Theta(n)$ single-copy measurements, closing the gap with Bell sampling", "Sample-optimal single-copy tolerant testing and the optimal tradeoff $\\Theta(n-k+1/\\varepsilon)$ with $k$ qubits of memory", "Extension to stabilizer nullity at most $r$ (bounded $T$-gate circuits) with $O(n2^{r})$ measurements" ], "keywords": [ { "label": "Stabilizer Learning", "reason": "Main task of recovering an unknown stabilizer state." }, { "label": "Adaptivity", "reason": "Key mechanism closing the sample complexity gap." }, { "label": "Single-Copy", "reason": "Measurement model avoiding quantum memory." }, { "label": "Stabilizer Nullity", "reason": "Parameter extending results to near-stabilizer states." } ], "emoji": "🎯", "social_summary": "Prove that adaptive single-copy Clifford measurements learn stabilizer states with the optimal linear number of copies, matching Bell sampling without any multi-copy quantum memory.", "highlights_oneliner": "Optimal single-copy adaptive stabilizer learning" }, { "arxiv_id": "2610.02037", "title": "Complexity and Applications of Nearest Stabilizer Product State Problems", "authors": "Daniel Grier, Hakop Pashayan, Luke Schaeffer", "arxiv_url": "https://arxiv.org/abs/2610.02037", "pdf_url": "https://arxiv.org/pdf/2610.02037.pdf", "summary": "The paper studies the problem of maximizing the overlap $|\\langle \\psi|\\phi_1,\\ldots,\\phi_n\\rangle|^2$ between an $n$-qubit stabilizer state and product states drawn from a set $S$ of single-qubit stabilizer states. Up to Clifford symmetries there are $9$ distinct choices of $S$, and a complete complexity classification is given showing all but the two simplest are $\\mathsf{NP}$-complete. The problem is connected to tighter runtime bounds for classical simulation algorithms, entanglement measures, and low-rank matrix completion.", "motivation": "Stabilizer states underpin quantum error-correcting codes and classical simulation methods via the Gottesman-Knill theorem, yet questions about how close they are to product states remain computationally subtle. Understanding this hardness informs the efficiency of stabilizer-rank-based simulation and multipartite entanglement quantification.", "highlights": [ "Complete complexity classification of nearest stabilizer product state problems into $9$ cases up to Clifford symmetry", "All but the two simplest cases are shown to be $\\mathsf{NP}$-complete", "Applications to classical simulation runtime bounds, entanglement measures, and low-rank matrix completion" ], "keywords": [ { "label": "Stabilizer States", "reason": "The central objects whose proximity to product states is optimized." }, { "label": "NP-completeness", "reason": "The paper classifies the computational hardness of the nearest product state problem." }, { "label": "Classical Simulation", "reason": "Solutions yield tighter runtime bounds for stabilizer-based simulation algorithms." }, { "label": "Entanglement", "reason": "The optimization serves as a measure of multipartite entanglement for stabilizer states." } ], "emoji": "🧩", "social_summary": "Classify the complexity of finding the nearest stabilizer product state, proving most variants NP-complete and linking them to simulation bounds, entanglement measures, and matrix completion.", "highlights_oneliner": "NP-hardness of nearest stabilizer product states" } ] }, "2026-10-01": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Syndrome", "weight": 4 }, { "word": "Bivariate", "weight": 3 }, { "word": "Decoding", "weight": 4 }, { "word": "Surface", "weight": 3 }, { "word": "Magic", "weight": 3 }, { "word": "Hypergraph", "weight": 2 }, { "word": "Transversal", "weight": 2 }, { "word": "Single-shot", "weight": 3 }, { "word": "List", "weight": 3 }, { "word": "Thresholds", "weight": 3 }, { "word": "Surgery", "weight": 2 }, { "word": "Tanner", "weight": 3 }, { "word": "Spacetime", "weight": 2 }, { "word": "Metrology", "weight": 1 } ], "social_highlights": "Highlights: constant-overhead injection, addressable transversal T, exact rank-decomposition decoding, spacetime fault-tolerance theory, parallel qLDPC surgery, single-shot thresholds, layer codes, syndrome extraction bounds, list-decodable qLDPC codes, bivariate bicycle distances, cubic code thermalization, magic detection, and QAOA costs.", "papers": [ { "arxiv_id": "2609.39345", "title": "Constant-Overhead Injection into Quantum Codes", "authors": "Louis Golowich, Venkatesan Guruswami", "arxiv_url": "https://arxiv.org/abs/2609.39345", "pdf_url": "https://arxiv.org/pdf/2609.39345.pdf", "summary": "The paper constructs the first fault-tolerant scheme for injecting bare physical qubits into, and ejecting them from, quantum codes with constant space and time overhead under circuit-level locally stochastic noise. The construction uses high-dimensional hypergraph products of classical LDPC codes (a simplified version of Spielman's linear-time encodable codes) and concatenation with inner codes to handle uniform noise. Single-shot error correction and code-state preparation gadgets are also provided with constant depth and linear qubit count.", "motivation": "Interfacing between bare physical qubits and encoded data is a basic primitive for processing real-world quantum data fault-tolerantly, yet prior schemes incurred super-constant overhead. Achieving constant space-time overhead is key to low-overhead fault-tolerant quantum computation.", "highlights": [ "First constant space and time overhead fault-tolerant injection and ejection into constant-rate codes", "All gadgets are constant-depth (single-shot) with qubit count linear in the number of logical qubits", "Product of Spielman-style classical LDPC codes plus concatenation yields tolerance to uniform noise" ], "keywords": [ { "label": "Injection", "reason": "Core primitive of encoding bare physical qubits into a code block fault-tolerantly." }, { "label": "Hypergraph Products", "reason": "High-dimensional hypergraph products of classical LDPC codes build the quantum codes." }, { "label": "Single-shot", "reason": "All gadgets run in constant circuit depth with noisy syndromes." }, { "label": "Constant Overhead", "reason": "Main result is constant space and time overhead for injection." } ], "emoji": "💉", "social_summary": "Constructs the first fault-tolerant injection and ejection of qubits into quantum codes with constant space and time overhead using high-dimensional hypergraph products of Spielman-type LDPC codes.", "highlights_oneliner": "Constant-overhead qubit injection into codes" }, { "arxiv_id": "2609.38996", "title": "Constant Rate Codes with Fully Addressable Transversal T: Good Codes, Sparse Checks", "authors": "Alexander Meiburg", "arxiv_url": "https://arxiv.org/abs/2609.38996", "pdf_url": "https://arxiv.org/pdf/2609.38996.pdf", "summary": "The paper constructs asymptotically good CSS codes with fully addressable transversal $T$ gates, allowing selective $T$ on any subset of logical qubits. It also gives Pauli-LDPC codes with transversal $T$ at vanishing rate and a protected-subsystem construction with constant rate, distance $\\Omega(\\sqrt{n})$, and sparse non-Pauli checks, extending to other finite-order one-qubit gates.", "motivation": "Wills constructed constant-rate codes with transversal $T$, but without selective addressability of logical qubits. Addressable transversal non-Clifford gates are important for efficient universal fault-tolerant computation.", "highlights": [ "Asymptotically good CSS codes with fully addressable transversal $T$", "Protected-subsystem construction with distance $\\Omega(\\sqrt{n})$ and sparse checks", "Extension to every fixed finite-order one-qubit gate, including $\\sqrt{T}$ and $R_z(\\pi/7)$" ], "keywords": [ { "label": "Transversal T", "reason": "Central object is addressable transversal $T$ gates on constant-rate codes." }, { "label": "CSS Codes", "reason": "Good CSS codes realize addressable dyadic phase gates." }, { "label": "LDPC", "reason": "Sparse Pauli-LDPC and subsystem constructions with bounded check weight." }, { "label": "Addressability", "reason": "Selective control over which logical qubits receive the gate." } ], "emoji": "🎯", "social_summary": "Constructs asymptotically good codes where a transversal T gate can be applied selectively to any chosen logical qubits, plus sparse-check variants and extensions to other rotation gates.", "highlights_oneliner": "Good codes with addressable transversal T" }, { "arxiv_id": "2609.39556", "title": "Exact Maximum Likelihood Decoding beyond Treewidth via Rank-Decomposition Dynamic Programming", "authors": "Bin Cheng, Feng Pan", "arxiv_url": "https://arxiv.org/abs/2609.39556", "pdf_url": "https://arxiv.org/pdf/2609.39556.pdf", "summary": "The paper introduces a rank-decomposition dynamic programming (Rank DP) algorithm for exact maximum-likelihood decoding, expressing decoding partition functions as quadratic sums of powers. Complexity is polynomial in input size and exponential in the Tanner graph's rank-width, giving polynomial-time decoding for punctured quantum Reed-Muller codes and a Steane-concatenated family where tensor-network contraction is superpolynomial.", "motivation": "Exact degenerate maximum-likelihood decoding is #P-hard, and leading tensor-network methods scale exponentially in treewidth. Exploiting algebraic structure beyond graph connectivity could enable optimal decoding and noise characterization for broader code families.", "highlights": [ "Exact decoding with cost exponential in rank-width rather than treewidth", "Polynomial-time decoding for punctured quantum Reed-Muller and Steane-concatenated codes", "Full likelihood evaluation for Reed-Muller codes up to $1{,}023$ qubits, used for noise learning and decoder optimality gaps" ], "keywords": [ { "label": "ML Decoding", "reason": "Paper targets exact maximum-likelihood decoding under Pauli noise." }, { "label": "Rank-width", "reason": "Complexity parameter replacing treewidth." }, { "label": "Tensor Networks", "reason": "Baseline exact decoding method that Rank DP outperforms." }, { "label": "Reed-Muller", "reason": "Code family admitting polynomial-time exact decoding." } ], "emoji": "🧮", "social_summary": "Introduces a rank-decomposition dynamic programming decoder that computes exact maximum-likelihood decoding beyond treewidth limits, achieving polynomial time for Reed-Muller-type codes.", "highlights_oneliner": "Exact ML decoding beyond treewidth limits" }, { "arxiv_id": "2609.39758", "title": "Theory of spacetime quantum fault tolerance", "authors": "Yijia Xu, Yixu Wang, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2609.39758", "pdf_url": "https://arxiv.org/pdf/2609.39758.pdf", "summary": "The paper develops a unified algebraic theory of Clifford spacetime fault tolerance, building a spacetime chain complex from a circuit's tensor network that encodes fault propagation, detectors, and logical actions. It unifies spacetime codes, Gottesman's gadget framework, fault complexes, and ZX calculus, links spacetime distances to gadget correctness, and covers phenomenological and circuit-level noise.", "motivation": "Various formulations of fault tolerance have been developed separately with different languages and fault models. A common algebraic framework clarifies relations among them and supports systematic design of fault-tolerant constructions.", "highlights": [ "Spacetime chain complex from circuit tensor networks unifying multiple fault-tolerance formalisms", "Connects spacetime distances to gadget-level correctness in Gottesman's formalism", "Recovers repeated syndrome extraction, transversal and fold-transversal detectors, Steane/Knill extraction, and single-shot correction" ], "keywords": [ { "label": "Spacetime Codes", "reason": "Framework treats circuits as codes in spacetime." }, { "label": "Chain Complexes", "reason": "Algebraic backbone encoding faults and detectors." }, { "label": "ZX Calculus", "reason": "One of the formalisms unified by the theory." }, { "label": "Fault Models", "reason": "Accommodates phenomenological and circuit-level noise." } ], "emoji": "🕸️", "social_summary": "Unifies spacetime codes, gadget frameworks, fault complexes, and ZX calculus into one algebraic theory of Clifford fault tolerance built from circuit tensor networks.", "highlights_oneliner": "Unified algebraic theory of spacetime fault tolerance" }, { "arxiv_id": "2609.39874", "title": "Parallel algebraic surgery for qLDPC codes with constant shuttling depth", "authors": "Tian-Gang Zhou, Boren Gu, Jens Eisert, Chen Zhao", "arxiv_url": "https://arxiv.org/abs/2609.39874", "pdf_url": "https://arxiv.org/pdf/2609.39874.pdf", "summary": "The paper introduces algebraic surgery for lifted product codes, co-designing logical measurements, auxiliary codes, and atom shuttling to enable parallel Pauli-product measurements with constant shuttling depth on neutral-atom arrays. It supports measurements within or between blocks, even with different lift sizes, and a benchmark cycle with 3 parallel measurements is about $2\\times$ faster than single-observable graph-based schedules.", "motivation": "High-rate qLDPC memories on reconfigurable atom arrays are promising, but logical operations may incur prohibitive shuttling and space overhead. Hardware-aware surgery is needed to realize the computational advantage of qLDPC architectures.", "highlights": [ "Algebraic surgery for lifted product codes with constant shuttling depth", "Parallel Pauli-product measurements including heavily overlapping logical supports and different lift sizes", "About $2\\times$ faster than compared graph-based surgery schedules with competitive qubit overhead" ], "keywords": [ { "label": "Code Surgery", "reason": "Pauli-product measurements via auxiliary code attachment." }, { "label": "Lifted Product", "reason": "Code family whose cyclic symmetry enables the algebraic surgery." }, { "label": "Neutral Atoms", "reason": "Target hardware with atom shuttling and reconfigurable connectivity." }, { "label": "qLDPC", "reason": "High-rate codes whose logical operations are being optimized." } ], "emoji": "⚛️", "social_summary": "Designs parallel algebraic surgery for lifted product qLDPC codes that needs only constant atom-shuttling depth, running multiple logical measurements about twice as fast on neutral-atom hardware.", "highlights_oneliner": "Parallel qLDPC surgery with constant shuttling" }, { "arxiv_id": "2609.39965", "title": "Single-shot state preparation threshold: rigorous theorem and statistical mechanical mapping", "authors": "Yuanchen Zhao, Yi Yuan, Zhengyi Han, Dong E. Liu", "arxiv_url": "https://arxiv.org/abs/2609.39965", "pdf_url": "https://arxiv.org/pdf/2609.39965.pdf", "summary": "The paper proves that linear confinement suffices for a nonzero single-shot state-preparation threshold for CSS qLDPC codes, contrary to the belief that soundness is necessary, with exponentially small logical error for distance at least logarithmic. A statistical mechanical mapping to a classical partition function and Monte Carlo simulations of the 3D toric code suggest sublinear soundness can also support a threshold.", "motivation": "Single-shot preparation of logical codewords can reduce the time overhead of fault-tolerant computation, but the structural code properties guaranteeing a threshold were unclear. Understanding weaker sufficient conditions broadens which codes can be used.", "highlights": [ "Linear confinement suffices for a single-shot state-preparation threshold", "Under linear soundness, residual data error is local stochastic and composable", "Statistical mechanical mapping and 3D toric code simulations suggest sublinear soundness also works" ], "keywords": [ { "label": "Single-shot", "reason": "Preparation with a single round of noisy syndrome measurements." }, { "label": "Confinement", "reason": "Structural property proven sufficient for a threshold." }, { "label": "Thresholds", "reason": "Rigorous nonzero state-preparation thresholds are established." }, { "label": "Stat Mech", "reason": "Mapping to a classical partition function for numerical study." } ], "emoji": "📐", "social_summary": "Proves that linear confinement alone guarantees a single-shot state-preparation threshold for CSS qLDPC codes and uses a statistical mechanics mapping to probe weaker conditions.", "highlights_oneliner": "Confinement suffices for single-shot preparation thresholds" }, { "arxiv_id": "2609.39522", "title": "Layer codes as quantum memories: syndrome extraction, thresholds and idle robustness", "authors": "Zhu Sun, Zhenyu Cai", "arxiv_url": "https://arxiv.org/abs/2609.39522", "pdf_url": "https://arxiv.org/pdf/2609.39522.pdf", "summary": "The paper evaluates 3D layer codes as active memories under circuit-level noise, presenting a decoder-free syndrome extraction scheduler that constrains hook propagation then compresses depth. Circuits for eighteen layer codes show a threshold of $5.06(7)\\times 10^{-3}$ for the $[[4,2,2]]$-input family and idle tolerance 1.7-3.0 times longer than rotated surface codes, at about five times more physical qubits per logical qubit.", "motivation": "Layer codes had only been analyzed as codes or passive memories, not as circuits measured repeatedly under noise. Circuit-level evaluation is needed to judge their practical value versus surface codes.", "highlights": [ "Decoder-free scheduler preserving distance against hook errors at about half the CNOT depth of general-purpose CSS scheduling", "Circuit-level threshold of $5.06(7)\\times 10^{-3}$ for the $[[4,2,2]]$-input family", "1.7-3.0 times better idle robustness than rotated surface codes at higher qubit and operation cost" ], "keywords": [ { "label": "Layer Codes", "reason": "3D local CSS codes studied as active memories." }, { "label": "Syndrome Extraction", "reason": "Scheduler design for junction stabilizers is a main contribution." }, { "label": "Thresholds", "reason": "Circuit-level threshold computed and compared to surface codes." }, { "label": "Idle Robustness", "reason": "Tolerance to longer intervals between extraction rounds." } ], "emoji": "🧱", "social_summary": "Designs syndrome extraction circuits for 3D layer codes and shows they reach a circuit-level threshold near half a percent and tolerate much longer idle times than surface codes.", "highlights_oneliner": "Layer codes tested as circuit-level memories" }, { "arxiv_id": "2609.39705", "title": "The Intrinsic Cost of Quantum Syndrome Extraction", "authors": "Chia-Tung Chu", "arxiv_url": "https://arxiv.org/abs/2609.39705", "pdf_url": "https://arxiv.org/pdf/2609.39705.pdf", "summary": "The paper defines an intrinsic measure of the interaction required for syndrome extraction directly from the stabilizer group, independent of the generating set, and derives hardware-dependent lower bounds on exact syndrome-extraction depth. It gives annular surface-code examples with constant-depth local extraction that counter Corollary 1 of DBT21, and for quantum Tanner families strengthens the BFS23 bound with a matching construction establishing a tight space-depth tradeoff.", "motivation": "Prior depth bounds for syndrome extraction depended on listed checks or entanglement arguments, leaving open how much time is fundamentally needed on a given connectivity graph. Intrinsic bounds help assess unavoidable circuit costs before committing to a hardware layout.", "highlights": [ "Generating-set-independent intrinsic measure of syndrome-extraction interaction cost", "Annular surface-code counterexample to Corollary 1 of DBT21", "Asymptotically tight space-depth tradeoff for quantum Tanner code families" ], "keywords": [ { "label": "Syndrome Extraction", "reason": "Fundamental depth cost of measuring stabilizers is the paper's subject." }, { "label": "Lower Bounds", "reason": "Hardware-dependent depth bounds are derived." }, { "label": "Quantum Tanner", "reason": "Family for which a tight space-depth tradeoff is shown." }, { "label": "Connectivity", "reason": "Hardware connectivity graph determines the bounds." } ], "emoji": "⏱️", "social_summary": "Derives generating-set-independent lower bounds on syndrome extraction depth for any stabilizer code and hardware graph, with a counterexample to prior work and a tight tradeoff for quantum Tanner codes.", "highlights_oneliner": "Intrinsic depth bounds for syndrome extraction" }, { "arxiv_id": "2609.40319", "title": "Local Automorphism-Aware Syndrome Compilation for General Quantum LDPC Codes", "authors": "Eugenio Durazo Rocha, Olai Å. Mostad, Hsuan-Yin Lin, Eirik Rosnes", "arxiv_url": "https://arxiv.org/abs/2609.40319", "pdf_url": "https://arxiv.org/pdf/2609.40319.pdf", "summary": "Formulates low-depth CSS syndrome extraction as a proper ordered edge-coloring problem subject to quantum parity constraints, and introduces LocalASC, which reduces the constraint system to edge-orbit variables under a Tanner graph automorphism subgroup and lifts feasible assignments to the full graph. LocalASC finds depth-optimal schedules for several two-block CSS codes with odd component weights and lower-bound-saturating schedules for quantum Tanner codes.", "motivation": "Syndrome extraction depth directly limits logical error rates, yet the degree lower bound of 6 layers is unattainable for the published weight-6 IBM bivariate bicycle codes. A scalable method exploiting symmetry is needed to find optimal schedules for general qLDPC codes without computing the full automorphism group.", "highlights": [ "LocalASC reduces ordered edge-coloring constraints to edge-orbit variables under Tanner graph automorphism subgroups", "Depth-optimal syndrome-extraction schedules found for several two-block CSS codes with odd (including unequal) component weights", "Translation subgroups constructed for abelian two-block group-algebra codes and symmetry extension conditions given for quantum Tanner codes" ], "keywords": [ { "label": "Syndrome Extraction", "reason": "The paper compiles minimum-depth syndrome-extraction circuits for qLDPC codes." }, { "label": "Edge Coloring", "reason": "Depth minimization is cast as a proper ordered edge-coloring problem with parity constraints." }, { "label": "Automorphisms", "reason": "Tanner graph automorphism subgroups reduce the constraint system to orbit variables." }, { "label": "Quantum Tanner", "reason": "Lower-bound-saturating schedules are obtained for quantum Tanner codes." } ], "emoji": "🎨", "social_summary": "Introduces LocalASC, using Tanner graph symmetries to compile depth-optimal syndrome extraction schedules for two-block CSS and quantum Tanner LDPC codes.", "highlights_oneliner": "Symmetry-based depth-optimal syndrome extraction for qLDPC codes" }, { "arxiv_id": "2609.40313", "title": "Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear Time", "authors": "William Gay, Fernando Granha Jeronimo, Abhi Shukul", "arxiv_url": "https://arxiv.org/abs/2609.40313", "pdf_url": "https://arxiv.org/pdf/2609.40313.pdf", "summary": "Gives the first explicit constructions of quantum LDPC codes achieving list decoding capacity, with list decoding radius approaching the quantum Singleton bound at constant list sizes. Construction uses quantum AEL amplification over expander graphs, and near-linear-time list decoders are obtained by generalizing classical expander-based weak-regularity list decoding algorithms.", "motivation": "Classically, explicit list-decoding-capacity codes took decades after random codes, and good quantum LDPC codes were only found recently. Combining capacity-achieving list decoding with the LDPC property and efficient decoding was an open question for quantum codes.", "highlights": [ "First explicit quantum LDPC codes with list decoding radius approaching the quantum Singleton bound with constant list size", "Near-linear time list decoding algorithms in the block length", "Construction via quantum AEL amplification on expanders, preserving the LDPC property" ], "keywords": [ { "label": "List Decoding", "reason": "The paper achieves list decoding capacity for quantum codes." }, { "label": "LDPC", "reason": "The explicit constructions are quantum LDPC codes." }, { "label": "Expanders", "reason": "Quantum AEL amplification on expander graphs underlies the construction." }, { "label": "Singleton Bound", "reason": "List decoding radius approaches the quantum Singleton bound." } ], "emoji": "📋", "social_summary": "Constructs the first explicit quantum LDPC codes achieving list decoding capacity, with near-linear time decoders based on quantum expander amplification.", "highlights_oneliner": "Explicit capacity-achieving list-decodable quantum LDPC codes" }, { "arxiv_id": "2609.40252", "title": "From Random Quantum Codes to Explicit qLDPC Codes via Local Properties", "authors": "Fernando Granha Jeronimo, Xiaojuan Ma, Nikhil Shagrithaya", "arxiv_url": "https://arxiv.org/abs/2609.40252", "pdf_url": "https://arxiv.org/pdf/2609.40252.pdf", "summary": "Develops a quantum version of local coordinate-wise linear (LCL) witnesses for nested spaces $S \\subseteq C$, imposing local constraints on physical representatives while measuring independence in the logical quotient $C/S$. This yields a threshold theorem for random CSS codes, a quantum subspace design notion, and explicit qLDPC constructions of quantum list-decodable, list-recoverable (with optimal list sizes) and subspace design codes.", "motivation": "Explicitly matching the parameters of random codes has been a central elusive goal in coding theory, and the quantum setting adds the demand for LDPC structure. A unifying local-property framework could derandomize many code properties at once.", "highlights": [ "Quantum LCL framework distinguishing physical and logical rank, giving a threshold theorem for random CSS codes", "Per-sector rate threshold equals the classical rate threshold", "First explicit qLDPC quantum list-decodable and list-recoverable codes with optimal list sizes, plus quantum subspace design codes" ], "keywords": [ { "label": "LCL Properties", "reason": "The quantum local coordinate-wise linear framework is the central tool." }, { "label": "Derandomization", "reason": "Explicit constructions match random code parameters via AEL-type derandomization." }, { "label": "List Recovery", "reason": "Explicit quantum list-recoverable codes with optimal list sizes are obtained." }, { "label": "CSS Codes", "reason": "Threshold theorem is proved for random CSS codes." } ], "emoji": "🎲", "social_summary": "Derandomizes random quantum codes into explicit qLDPC codes using a quantum local-property framework, giving optimal list-decodable, list-recoverable and subspace design codes.", "highlights_oneliner": "Explicit qLDPC codes matching random code properties" }, { "arxiv_id": "2609.39016", "title": "Entropy threshold: A simple proxy for performance of quantum error correction", "authors": "Diego Ruiz, Aleksander Kubica", "arxiv_url": "https://arxiv.org/abs/2609.39016", "pdf_url": "https://arxiv.org/pdf/2609.39016.pdf", "summary": "Develops an entropy-based proxy predicting QEC thresholds by locally comparing noise entropy with error information gained from stabilizer measurements, spacetime detectors and flag outcomes. It matches numerics for Clifford-deformed surface codes under biased Pauli or erasure noise and for surface/color codes with flag qubits under circuit-level noise, despite ignoring syndrome correlations and degeneracy.", "motivation": "QEC numerics are abundant but simple heuristics to understand and predict performance are scarce. Back-of-the-envelope threshold estimates would avoid costly detailed simulations.", "highlights": [ "Simple entropy-versus-information-gain proxy estimates thresholds across diverse noise models", "Covers code-capacity biased and erasure noise and circuit-level noise with flag qubits", "Good agreement with numerics despite neglecting syndrome correlations and code degeneracy" ], "keywords": [ { "label": "Thresholds", "reason": "The proxy predicts QEC thresholds." }, { "label": "Entropy", "reason": "Noise entropy is compared with information gained from measurements." }, { "label": "Surface Codes", "reason": "Clifford-deformed and circuit-level surface codes are benchmark cases." }, { "label": "Biased Noise", "reason": "Biased Pauli noise is a main code-capacity setting tested." } ], "emoji": "🌡️", "social_summary": "Proposes a simple entropy-based proxy that predicts quantum error correction thresholds across surface codes, color codes, biased noise and circuit-level settings.", "highlights_oneliner": "Entropy proxy predicts QEC thresholds simply" }, { "arxiv_id": "2609.39121", "title": "Bivariate Bicycle Codes and Metachecks: Syndrome Repair, Measurement-Fault Ambiguity, and Logical Obstructions", "authors": "Mohammad Rowshan", "arxiv_url": "https://arxiv.org/abs/2609.39121", "pdf_url": "https://arxiv.org/pdf/2609.39121.pdf", "summary": "Studies when the dependent stabilizer checks of bivariate bicycle codes serve as metachecks for syndrome repair, showing the metasyndrome is reduction modulo the valid-syndrome ideal and the translation group maps into the unit group of a quotient algebra of dimension $k/2$. This gives a unit-group bound on distinguishable single faults and an obstruction: for bounded-$k$ families with growing block length, metasyndrome-only exact repair fails with probability tending to one.", "motivation": "Faulty syndrome measurements can corrupt QEC, and repeated rounds add latency and decoding cost. Built-in check redundancy in BB codes could reduce rounds, but it is unclear when it actually enables repair.", "highlights": [ "Distance-two characterization and unit-group bound on distinguishable single measurement faults", "$[[72,12,6]]$ corrects every single measurement fault while Gross $[[144,12,12]]$ has 36 indistinguishable single-fault pairs", "Joint data-measurement decoding outperforms separated repair on codes with stronger ambiguity" ], "keywords": [ { "label": "Bivariate Bicycle", "reason": "The analysis targets BB codes and their polynomial structure." }, { "label": "Metachecks", "reason": "Dependent checks give parity constraints used for syndrome repair." }, { "label": "Syndrome Repair", "reason": "Ambiguity of measurement faults under metasyndrome-only repair is characterized." }, { "label": "Decoding", "reason": "Joint data-measurement decoding is compared against separated repair." } ], "emoji": "🔧", "social_summary": "Analyzes when bivariate bicycle code metachecks can repair faulty syndromes, proving fundamental obstructions for bounded-dimension families and contrasting the 72 and Gross codes.", "highlights_oneliner": "Metachecks and syndrome repair in BB codes" }, { "arxiv_id": "2609.39395", "title": "Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes", "authors": "Mohammad Rowshan, Simon Devitt", "arxiv_url": "https://arxiv.org/abs/2609.39395", "pdf_url": "https://arxiv.org/pdf/2609.39395.pdf", "summary": "Shows the $Z$-logical quotient $K/S$ of BB codes fits a short exact sequence with annihilator-quotient kernel and colon-quotient cokernel, giving a logical basis, dimension formula and distance identity $d_Z=\\min(d_{\\mathcal A},d_{\\mathcal C})$. A translation-anchored cluster search proves distances $4,6,10,10,12,18$ for the six standard BB codes of lengths 18 to 288 and enumerates all minimum-weight logicals.", "motivation": "BB code distances are usually found numerically rather than read from the defining polynomials. An algebraic decomposition gives structure and provable distance verification.", "highlights": [ "Exact sequence with annihilator kernel and colon cokernel, and $r_{\\mathcal A}=r_{\\mathcal C}=k/2$ for every BB code", "Cluster search proves the six standard BB distances and enumerates all minimum-weight logical operators", "$[[108,8,10]]$ is the only one with distance attained in a single component ($d_{\\mathcal C}=10$, $d_{\\mathcal A}=12$)" ], "keywords": [ { "label": "Bivariate Bicycle", "reason": "The distance analysis targets BB codes." }, { "label": "Code Distance", "reason": "The paper proves exact minimum distances of the standard BB codes." }, { "label": "Logical Operators", "reason": "Logical classes are decomposed into annihilator and colon components." }, { "label": "Group Algebra", "reason": "Frobenius structure of the finite group algebra yields the dimension results." } ], "emoji": "📏", "social_summary": "Decomposes logical operators of bivariate bicycle codes algebraically and proves the exact distances of all six standard BB codes, including the Gross code.", "highlights_oneliner": "Algebraic distance proofs for bivariate bicycle codes" }, { "arxiv_id": "2609.39764", "title": "Measurement and feedforward circuits from quantum error correcting codes", "authors": "Georgios Styliaris, Rahul Trivedi", "arxiv_url": "https://arxiv.org/abs/2609.39764", "pdf_url": "https://arxiv.org/pdf/2609.39764.pdf", "summary": "Establishes a correspondence between measurement-and-feedforward shallow circuits and quantum error-correcting codes: the pre-measurement circuit is an encoder, and unitary feedforward removes post-selection iff measurement projectors are detectable errors on the codespace. For stabilizer codes with Pauli measurements nonstabilizerness comes entirely from the encoder, but non-Pauli measurements or non-additive codes generate long-range nonstabilizerness with single-qubit corrections.", "motivation": "Measurements and feedforward enable deterministic global unitaries and long-range entangled states from shallow circuits, but a unifying design principle has been lacking. Casting them as code design opens a systematic route.", "highlights": [ "Exact correspondence between measurement-feedforward protocols and QEC codes", "Post-selection elimination iff measurement projectors are detectable errors on the codespace", "Non-Pauli measurements or non-additive codes yield long-range nonstabilizerness with single-qubit corrections" ], "keywords": [ { "label": "Feedforward", "reason": "Measurement with unitary feedforward circuits are the object of study." }, { "label": "Encoders", "reason": "The circuit before measurement acts as a code encoder." }, { "label": "Nonstabilizerness", "reason": "The origin and generation of non-Clifford resources is analyzed." }, { "label": "Non-additive Codes", "reason": "They are used to overcome the stabilizer-code restriction." } ], "emoji": "🔁", "social_summary": "Maps measurement-and-feedforward shallow circuits onto quantum error-correcting codes, turning state preparation and global unitaries into a code-design problem.", "highlights_oneliner": "Feedforward circuits as QEC code design" }, { "arxiv_id": "2609.39879", "title": "Fault Tolerant Quantum Phases of Matter", "authors": "Colin V. Coane, Shouzhen Gu, Aleksander Kubica", "arxiv_url": "https://arxiv.org/abs/2609.39879", "pdf_url": "https://arxiv.org/pdf/2609.39879.pdf", "summary": "Introduces a classification of mixed-state quantum phases by the ability to preserve and fault-tolerantly transfer information using shallow local channel circuits with noisy measurements and classical communication, and shows the existence of a recovery threshold is a property of an entire phase. It classifies subsystem codes, shows 2D and 3D color codes are in the same phase via dimensional jumps, and proves single-shot state preparation for stabilizer codes with extended syndromes while point-like syndrome circuits are not fault tolerant.", "motivation": "Topological orders are known to host quantum memories, but a phase classification that includes active, noise-robust operations such as measurements and feedback was missing. Connecting fault tolerance and phases of matter clarifies when state preparation is robust.", "highlights": [ "Stability (nonzero recovery threshold) is a property of an entire fault tolerant phase", "2D and 3D color codes shown phase-equivalent using dimensional jumps in the 3D gauge color code", "Extended syndromes permit single-shot state preparation, while shallow circuits measuring point-like syndromes are not fault tolerant" ], "keywords": [ { "label": "Quantum Phases", "reason": "The paper classifies mixed-state phases by fault tolerant information transfer." }, { "label": "Color Codes", "reason": "Phase equivalence of 2D and 3D color codes is demonstrated." }, { "label": "Subsystem Codes", "reason": "The framework classifies subsystem codes without favoring a gauge state." }, { "label": "Single-Shot", "reason": "Syndrome structure determines single-shot state preparation feasibility." } ], "emoji": "🧊", "social_summary": "Classifies quantum phases of mixed states by fault tolerant information transfer, linking recovery thresholds, color codes and single-shot state preparation.", "highlights_oneliner": "Classifying fault tolerant quantum phases of matter" }, { "arxiv_id": "2609.40262", "title": "Quantum List Recovery and Decoding: Achievability and Limitations", "authors": "Fernando Granha Jeronimo, Xiaojuan Ma", "arxiv_url": "https://arxiv.org/abs/2609.40262", "pdf_url": "https://arxiv.org/pdf/2609.40262.pdf", "summary": "The paper derives tight combinatorial upper and lower bounds on list sizes for quantum list recovery (QLR) and quantum list decoding (QLD) of balanced folded quantum Reed-Solomon and random CSS codes, showing $L^\\star_{\\rm QLR}=\\ell^{\\Theta(R_1/\\gamma)}$ and $L^\\star_{\\rm QLD}=\\Theta((1-R)/\\gamma)$ near the quantum Singleton bound. A pairing lemma for joint $X/Z$ candidate lists avoids a product loss in list size, and a quantum generalized Singleton bound with stabilizer distinctness gives the QLD converse.", "motivation": "Approximate quantum codes can reach decoding radii near the quantum Singleton bound $(1-R)/2$, but the list sizes required were not well understood. Treating $X$ and $Z$ sectors separately can blow up lists, and classical candidates can collapse under stabilizer quotienting, so tight quantum-specific bounds are needed.", "highlights": [ "Asymptotically exact QLD radius tradeoff $\\rho_L^\\star=\\frac{L}{L+1}\\frac{1-R}{2}$", "Pairing lemma for joint $X/Z$ lists avoids a product loss in list size", "Quantum generalized Singleton bound and stabilizer-distinct lower bounds for folded Reed-Solomon constructions" ], "keywords": [ { "label": "List Decoding", "reason": "Core subject: bounding list sizes of logically distinct Pauli corrections consistent with a syndrome." }, { "label": "List Recovery", "reason": "Quantum list recovery bounds are derived and shown to scale as $\\ell^{\\Theta(R_1/\\gamma)}$." }, { "label": "CSS Codes", "reason": "Balanced random CSS codes are analyzed, including surviving classical bad lists under stabilizer quotient." }, { "label": "Singleton Bound", "reason": "Results are tight near the quantum Singleton bound and a generalized quantum version is proven." } ], "emoji": "📋", "social_summary": "Establishes tight list-size bounds for quantum list decoding and recovery near the quantum Singleton bound, for folded quantum Reed-Solomon and random CSS codes.", "highlights_oneliner": "Tight quantum list decoding and recovery bounds" }, { "arxiv_id": "2609.39916", "title": "Distillation of N-Qubit Stabilizer States on a Star Network Topology", "authors": "Theodore M. Mahaffey, Chaohan Cui, Saikat Guha, Murphy Yuezhen Niu", "arxiv_url": "https://arxiv.org/abs/2609.39916", "pdf_url": "https://arxiv.org/pdf/2609.39916.pdf", "summary": "The paper introduces an entanglement distillation protocol using an arbitrary $[[n,k,d]]$ stabilizer code to convert $n$ noisy $N$-qubit GHZ states into $k$ logical copies on a star network with only local operations. Numerics with the 5-qubit, toric, and $[[144,12,12]]$ bivariate bicycle codes show fidelity improvement up to roughly $6\\%$ depolarizing noise, and the protocol is proven to extend to any $N$-qubit CSS stabilizer state.", "motivation": "Modular quantum computers need high-fidelity multipartite entanglement across many nodes, but building GHZ states from Bell pairs is exponentially limited by Bell-state-measurement success rates. Existing distillation focuses on Bell pairs, leaving a gap for efficient multipartite distillation.", "highlights": [ "Distills $N$-qubit GHZ states with any $[[n,k,d]]$ stabilizer code using only local operations on a star topology", "Improves GHZ fidelity over a bare state for depolarizing rates up to or above $6\\%$ across 5-qubit, toric, and $[[144,12,12]]$ codes", "Proves applicability to any $N$-qubit CSS stabilizer state, generalizing prior Bell and GHZ distillation" ], "keywords": [ { "label": "Distillation", "reason": "Main contribution is a multipartite entanglement distillation protocol." }, { "label": "GHZ States", "reason": "The protocol converts noisy GHZ states into higher-fidelity logical copies." }, { "label": "Stabilizer Codes", "reason": "Uses arbitrary $[[n,k,d]]$ stabilizer codes, including toric and bivariate bicycle codes." }, { "label": "Quantum Networks", "reason": "Formulated on a star network topology for distributed quantum computing." } ], "emoji": "🌟", "social_summary": "Introduces a stabilizer-code-based protocol distilling multipartite GHZ and CSS states over star networks with local operations, improving fidelity under depolarizing noise.", "highlights_oneliner": "Stabilizer-code GHZ distillation on star networks" }, { "arxiv_id": "2609.39959", "title": "Haah's 3D cubic code thermalizes rapidly", "authors": "Sebastian Stengele, Libor Caha, Ángela Capel, Simone Warzel", "arxiv_url": "https://arxiv.org/abs/2609.39959", "pdf_url": "https://arxiv.org/pdf/2609.39959.pdf", "summary": "The paper rigorously proves that Haah's 3D cubic code thermalizes rapidly at every positive temperature, ruling out self-correction. The proof converts a decay-of-correlations condition into a modified logarithmic Sobolev inequality for the Davies generator.", "motivation": "Haah's cubic code was a long-standing candidate for a self-correcting quantum memory in three dimensions, but only numerics and partial self-correction results existed with no analytic upper bound on memory time. Settling this question determines whether passive 3D quantum memory is feasible with fracton codes.", "highlights": [ "Settles the open question: the cubic code is not a self-correcting memory since it thermalizes rapidly at all positive temperatures", "Uses decay of correlations to derive a modified logarithmic Sobolev inequality for the Davies generator", "First analytic proof of rapid mixing at all positive temperatures for any fracton code" ], "keywords": [ { "label": "Cubic Code", "reason": "Haah's 3D cubic code is the central object of study." }, { "label": "Self-Correction", "reason": "The paper resolves whether the code is a self-correcting quantum memory." }, { "label": "Fracton Codes", "reason": "First rigorous rapid-mixing proof for any fracton code." }, { "label": "Thermalization", "reason": "Rapid mixing of the Davies generator at positive temperature bounds memory time." } ], "emoji": "🧊", "social_summary": "Proves rigorously that Haah's 3D cubic code thermalizes rapidly at every positive temperature, ending its candidacy as a self-correcting quantum memory.", "highlights_oneliner": "Cubic code thermalizes rapidly, no self-correction" }, { "arxiv_id": "2609.40220", "title": "NLTM Hamiltonians from gauged sheaf quantum locally testable codes", "authors": "Fuchuan Wei, Zhengyi Han, Zimu Li, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2609.40220", "pdf_url": "https://arxiv.org/pdf/2609.40220.pdf", "summary": "The paper proves the no low-energy trivial magic (NLTM) conjecture by constructing local Hamiltonians whose positive-energy-density states require circuit depth $\\Omega(\\log n)$ to prepare from any stabilizer state. The construction uses non-Abelian gauged sheaf codes built from cup products on good quantum locally testable codes, with constant operator soundness.", "motivation": "Understanding the complexity of low-energy states is central to quantum PCP, and NLTS showed such states are nontrivial relative to product states. Strengthening this to exclude arbitrary, possibly highly entangled, stabilizer-state witnesses requires new code constructions with strong local testability.", "highlights": [ "Proves the NLTM conjecture with $\\Omega(\\log n)$ depth lower bound from arbitrary stabilizer inputs", "Same Hamiltonian family and energy threshold work for arbitrary qudit stabilizer inputs of bounded local dimension", "Establishes constant operator soundness for gauged sheaf quantum locally testable codes" ], "keywords": [ { "label": "Sheaf Codes", "reason": "Construction builds on non-Abelian gauged sheaf codes via cup products." }, { "label": "Local Testability", "reason": "Constant operator soundness of good quantum locally testable codes drives the result." }, { "label": "Quantum PCP", "reason": "The result advances low-energy complexity relevant to the quantum PCP conjecture." }, { "label": "Magic", "reason": "NLTM concerns non-stabilizer resources required for low-energy states." } ], "emoji": "✨", "social_summary": "Proves the no low-energy trivial magic conjecture using gauged sheaf quantum locally testable codes, strengthening NLTS to exclude stabilizer-state witnesses.", "highlights_oneliner": "Proving NLTM via gauged sheaf codes" }, { "arxiv_id": "2609.40279", "title": "Classical simulation of coherent crosstalk in surface codes", "authors": "Andrew S. Darmawan, Yelyzaveta Kolesnyk, Robert Koenig", "arxiv_url": "https://arxiv.org/abs/2609.40279", "pdf_url": "https://arxiv.org/pdf/2609.40279.pdf", "summary": "The paper gives a polynomial-time classical algorithm sampling syndromes of a surface code under coherent nearest-neighbor $ZZ$ crosstalk, at cost $O(d^6)$ per sample for odd distance $d$. Combining crosstalk with single-qubit coherent noise maps to king-lattice IQP circuits, giving a complexity-theoretic hardness obstruction unless the polynomial hierarchy collapses.", "motivation": "Residual $ZZ$ coupling is a major coherent error source in superconducting qubits, and coherent noise can change logical error rates substantially relative to Pauli noise. Efficient classical simulation enables threshold studies, but it was unknown when such simulation breaks down.", "highlights": [ "Efficient exact sampler for coherent $ZZ$ crosstalk using two single-qubit noise samplers at $O(d^6)$ cost", "Numerical MWPM thresholds: $\\theta_c/\\pi=0.0342(4)$ for coherent versus $0.0493(5)$ for the Pauli twirl", "Hardness of sampling with combined single-qubit and crosstalk noise via IQP circuits on a non-planar graph" ], "keywords": [ { "label": "Surface Codes", "reason": "Syndrome sampling is performed on rotated surface codes." }, { "label": "Coherent Noise", "reason": "Coherent $ZZ$ crosstalk is the noise model studied." }, { "label": "Classical Simulation", "reason": "Provides an efficient algorithm and a hardness result." }, { "label": "IQP Circuits", "reason": "Hardness is shown by mapping syndrome distributions to IQP output distributions." } ], "emoji": "🔗", "social_summary": "Presents an efficient classical algorithm for simulating coherent crosstalk in surface codes and proves hardness once single-qubit coherent noise is added.", "highlights_oneliner": "Simulating coherent crosstalk in surface codes" }, { "arxiv_id": "2609.39597", "title": "Thermodynamics of Ahn--Doherty--Landahl Continuous Quantum Error Correction", "authors": "Juan Garcia-Nila, Pedro B. Melo, Lucas Johns", "arxiv_url": "https://arxiv.org/abs/2609.39597", "pdf_url": "https://arxiv.org/pdf/2609.39597.pdf", "summary": "The paper formulates measurement-based continuous quantum error correction as an information engine, separating system-side and controller-side power. Simulations of the one-qubit ADL protocol and the three-qubit repetition code show fidelity saturates with increasing feedback strength while energetic costs keep growing.", "motivation": "Continuous quantum error correction has been studied mainly for fidelity performance, leaving the energetic cost of continuous feedback largely unexplored. Understanding the energy-versus-protection tradeoff is needed to compare controllers in realistic devices.", "highlights": [ "Defines system-side power $P_{\\rm sys}$ and controller-side feedback power $P_{\\rm fb}$ for continuous QEC", "Fidelity saturates while both energetic contributions keep increasing with feedback strength", "Applies framework to the one-qubit ADL protocol and the three-qubit repetition code" ], "keywords": [ { "label": "Continuous QEC", "reason": "Subject is continuous syndrome extraction with real-time Hamiltonian feedback." }, { "label": "Thermodynamics", "reason": "Analyzes heat, work, and entropy of the correction process." }, { "label": "Feedback Control", "reason": "Energy costs of feedback Hamiltonians are quantified." }, { "label": "Repetition Code", "reason": "The three-qubit repetition code is a studied example." } ], "emoji": "🔥", "social_summary": "Quantifies the energy cost of continuous quantum error correction by treating it as an information engine, revealing diminishing fidelity returns for rising feedback power.", "highlights_oneliner": "Energy costs of continuous quantum error correction" }, { "arxiv_id": "2609.38751", "title": "The Generalized Semi-Clifford Conjecture Holds at Level 4", "authors": "Maxwell Marcus, Sathyawageeswar Subramanian, Marcel Dall'Agnol", "arxiv_url": "https://arxiv.org/abs/2609.38751", "pdf_url": "https://arxiv.org/pdf/2609.38751.pdf", "summary": "The paper proves the generalized semi-Clifford conjecture for levels $k\\leq 4$ of the Clifford hierarchy and any prime dimension $d$, by extending fixed-point arguments to conjugation groups $\\Gamma_1(U),\\Gamma_2(U),\\ldots$. It also gives a sufficient condition on such groups for higher-level gates to be generalized semi-Clifford.", "motivation": "The Clifford hierarchy characterizes gates implementable by gate teleportation, yet little is known beyond level 3. The generalized semi-Clifford conjecture would give a structural description of all such gates as permutation-diagonal products up to Cliffords.", "highlights": [ "Proves the generalized semi-Clifford conjecture for $k\\leq 4$ and any prime $d$", "Introduces conjugation groups $\\Gamma_j(U)$ as a tool for studying the Clifford hierarchy", "Gives a sufficient condition on conjugation groups for higher-level gates to be generalized semi-Clifford" ], "keywords": [ { "label": "Clifford Hierarchy", "reason": "The paper studies structure of gates at levels up to 4." }, { "label": "Gate Teleportation", "reason": "The hierarchy was introduced to characterize fault-tolerant gates via teleportation." }, { "label": "Semi-Clifford Gates", "reason": "The main result proves the generalized semi-Clifford conjecture." }, { "label": "Qudits", "reason": "Result holds for any prime dimension $d$." } ], "emoji": "🪜", "social_summary": "Proves the generalized semi-Clifford conjecture through the fourth level of the Clifford hierarchy for any prime qudit dimension, using new conjugation group techniques.", "highlights_oneliner": "Semi-Clifford conjecture proven through level 4" }, { "arxiv_id": "2609.38986", "title": "Quantum Pseudorandom Error-Correcting Codes", "authors": "Min-Hsiu Hsieh, Shogo Yamada", "arxiv_url": "https://arxiv.org/abs/2609.38986", "pdf_url": "https://arxiv.org/pdf/2609.38986.pdf", "summary": "The paper defines quantum pseudorandom error-correcting codes (QPRCs) and, assuming quantum-hard LPN, constructs pseudorandom isometric codes indistinguishable from Haar-random isometries and robust to $o(n\\frac{\\log\\log n}{\\log n})$-local noise, as well as codes indistinguishable from the completely depolarizing channel robust to $\\alpha n$-local noise. Key ingredients are pseudorandom functional error-correcting codes and an efficient decoder for codeword-stabilized (CWS) codes built on nonlinear classical codes.", "motivation": "Classical pseudorandom error-correcting codes unify pseudorandomness and error correction with applications in watermarking and covert communication, but no quantum analogue existed. Efficient decoding of CWS codes based on nonlinear classical codes was also an open problem.", "highlights": [ "Constructs pseudorandom isometric codes indistinguishable from Haar-random isometries under quantum-hard LPN", "Constructs QPRCs indistinguishable from the completely depolarizing channel, robust to $\\alpha n$-local noise", "Gives an efficient decoder for CWS codes based on nonlinear classical codes, resolving an open problem" ], "keywords": [ { "label": "Pseudorandomness", "reason": "Codes are computationally indistinguishable from Haar-random objects or depolarizing channels." }, { "label": "CWS Codes", "reason": "A new efficient decoding procedure for codeword-stabilized codes is developed." }, { "label": "LPN", "reason": "Security relies on quantum-hardness of Learning Parity with Noise." }, { "label": "Isometries", "reason": "Pseudorandom isometric codes mimic Haar-random isometries." } ], "emoji": "🎲", "social_summary": "Introduces quantum pseudorandom error-correcting codes whose encodings look Haar-random or fully depolarizing yet survive local noise, built from LPN and a new CWS decoder.", "highlights_oneliner": "Quantum pseudorandom error-correcting codes from LPN" }, { "arxiv_id": "2609.40022", "title": "CSS codes for Quantum Metrology with Discrete-time Error Correction", "authors": "Ugnė Liaubaitė, Debora Ramacciotti, Robert Raußendorf", "arxiv_url": "https://arxiv.org/abs/2609.40022", "pdf_url": "https://arxiv.org/pdf/2609.40022.pdf", "summary": "Develops a quantum-metrology protocol based on CSS codes with discrete-time error correction, giving an analytical framework for arbitrary CSS codes applied to the Steane and Shor codes. For noise perpendicular to the sensing Hamiltonian, Heisenberg-like temporal scaling is preserved over a finite interrogation-time window set by the correction frequency, with a crossover to SQL-like scaling and an optimal interrogation time.", "motivation": "Noise typically destroys the Heisenberg-scaling advantage of quantum sensing, reverting precision to the standard quantum limit. Error correction can restore the advantage, but one must understand how correction frequency and code structure govern the achievable scaling.", "highlights": [ "Discrete-time CSS error correction preserves Heisenberg-like scaling over a finite window for perpendicular $X$-type noise", "Recovery applied only at final readout gives no advantage, so intermediate correction steps are essential", "Analytical framework for arbitrary CSS codes yields optimal interrogation time and HL-to-SQL crossover for the Steane and Shor codes" ], "keywords": [ { "label": "Quantum Metrology", "reason": "Core application: estimating a parameter with Heisenberg-limited precision" }, { "label": "CSS Codes", "reason": "Code family used, analyzed in general and for Steane and Shor codes" }, { "label": "Heisenberg Scaling", "reason": "Scaling regime preserved over a finite interrogation window" }, { "label": "Discrete Correction", "reason": "Periodic error correction interval controls crossover to SQL scaling" } ], "emoji": "🧭", "social_summary": "Shows how periodic CSS-code error correction keeps Heisenberg-like sensing precision alive under perpendicular noise, with an analytical framework applied to the Steane and Shor codes.", "highlights_oneliner": "CSS codes preserve quantum sensing advantage" }, { "arxiv_id": "2609.39980", "title": "Logical information localisation in stabiliser codes via single-qubit measurements", "authors": "Jelena Mackeprang, Hemant Sharma, Jonas Helsen", "arxiv_url": "https://arxiv.org/abs/2609.39980", "pdf_url": "https://arxiv.org/pdf/2609.39980.pdf", "summary": "Studies stabiliser path finding (SPF), which localises logical information of a lossy stabiliser code onto target qubits via one round of single-qubit measurements, and introduces $g$-SPF with $g$ unspecified targets. Percolation arguments establish a localisation threshold at $p<1/2$ for surface codes, and two algorithms (exact integer linear program and fast heuristic decoder) are implemented.", "motivation": "Fast read-out of logical information is valuable for fault-tolerant communication with flying qubits and limited resources. Existing SPF algorithms are too slow to study large codes, and no thresholds were established.", "highlights": [ "Proves localisation via $g$-SPF succeeds with probability approaching one for i.i.d. loss $p<1/2$ in large planar surface codes", "Exact ILP algorithm and heuristic decoding-based algorithm, with the latter considerably faster", "Enables studying localisation in much larger stabiliser codes, with applications to teleportation and logical fusion" ], "keywords": [ { "label": "Qubit Loss", "reason": "Error model for which localisation thresholds are derived" }, { "label": "Surface Codes", "reason": "Planar surface code used to prove the threshold" }, { "label": "Percolation", "reason": "Theory underpinning the proof of the localisation threshold" }, { "label": "Decoding", "reason": "Heuristic SPF algorithm is cast as a decoding problem" } ], "emoji": "🎯", "social_summary": "Proves a localisation threshold for logical information in lossy surface codes and delivers much faster algorithms for stabiliser path finding using single-qubit measurements.", "highlights_oneliner": "Localising logical info under qubit loss" }, { "arxiv_id": "2609.39482", "title": "Generation of large-amplitude squeezed cat states with near-unity efficiency", "authors": "Simon K. Yung, Matthew S. Winnel, Timothy C. Ralph, Jie Zhao", "arxiv_url": "https://arxiv.org/abs/2609.39482", "pdf_url": "https://arxiv.org/pdf/2609.39482.pdf", "summary": "Proposes an all-optical scheme using quantum non-demolition interactions and photon-number measurements to prepare large-amplitude cat states with near-unity probability. No photon-number outcome is postselected; all outcomes accumulate until a threshold is reached, and the scheme is robust to realistic photon loss.", "motivation": "GKP encoding for photonic fault tolerance requires resource states synthesised from many large cat states, but only modest optical cats have been made and methods are highly probabilistic. Efficient deterministic-like generation is key to bosonic QEC.", "highlights": [ "Near-unity-probability preparation of large-amplitude squeezed cat states", "No postselection on particular photon-number outcomes; protocol repeats until a threshold is met", "Demonstrated robustness to realistic photon loss" ], "keywords": [ { "label": "Cat States", "reason": "Target resource states being generated" }, { "label": "GKP Codes", "reason": "Motivating encoding requiring cat-state resources" }, { "label": "Bosonic Codes", "reason": "Paves way for efficient bosonic error correction" }, { "label": "Photon Loss", "reason": "Dominant optical error shown to be tolerated" } ], "emoji": "🐱", "social_summary": "Proposes an all-optical protocol that prepares large-amplitude cat states with near-unity probability without postselection, robust to photon loss, aiding GKP-based photonic fault tolerance.", "highlights_oneliner": "Near-deterministic large optical cat states" }, { "arxiv_id": "2609.38713", "title": "When Error Mitigation Makes Things Worse: Budget-Aware Evaluation, Extrapolation Failure, and the Calibration Trust Boundary", "authors": "Guilin Zhang, Kai Zhao, Xiquan Cui, Henry Heng, Xu Chu, Aletta Johanna Blanken", "arxiv_url": "https://arxiv.org/abs/2609.38713", "pdf_url": "https://arxiv.org/pdf/2609.38713.pdf", "summary": "Shows that unconstrained zero-noise extrapolation under control-offset miscalibration is worse than no mitigation on 38-63% of simulated instances, with similar worsening on IBM Heron hardware. Compares methods at equal online shot budgets and exposes an adversarial vulnerability of learned correctors to manipulated calibration metadata.", "motivation": "Error mitigation is widely trusted to convert noisy outputs into usable estimates, yet comparisons at generous fixed shot budgets hide failure modes. Reliability and security of the calibration inputs matter for near-term quantum learning pipelines.", "highlights": [ "ZNE worsens estimates on 38-63% of simulated instances and 80-88% on a small IBM Heron study", "Budget-conditioned neural corrector sits at the low-budget end of the accuracy-cost frontier but fails to transfer to hardware", "White-box attack on calibration metadata increases corrector error 8.1 times and evades the disagreement monitor in half of worsened cases" ], "keywords": [ { "label": "Error Mitigation", "reason": "Central subject whose failure modes are analyzed" }, { "label": "Zero-Noise Extrapolation", "reason": "Main technique shown to amplify error under miscalibration" }, { "label": "Shot Budget", "reason": "Fair comparison axis across mitigation methods" }, { "label": "Calibration Security", "reason": "Adversarial manipulation of provider-reported calibration data" } ], "emoji": "⚠️", "social_summary": "Reveals that zero-noise extrapolation often makes results worse under miscalibration, and shows learned correctors can be attacked through manipulated calibration data.", "highlights_oneliner": "When error mitigation backfires" }, { "arxiv_id": "2609.40259", "title": "Self-testing the toric code against classical communication", "authors": "Gustavo Fróes, Amanda Wei, Carlos de Gois, Denis Rochette, Marc-Olivier Renou", "arxiv_url": "https://arxiv.org/abs/2609.40259", "pdf_url": "https://arxiv.org/pdf/2609.40259.pdf", "summary": "Shows the toric code space, distributed over a torus-shaped network, can be self-tested noise-robustly even when untrusted devices secretly exchange classical messages up to distances proportional to the network diameter. An integer-linear-programming method constructs such protocols and extends results to the surface code and cluster states under nearest-neighbor communication.", "motivation": "Most device-independent self-tests fail once parties can communicate, which is problematic for realistic multipartite certification and locality loopholes. Modular fault-tolerant architectures distribute surface codes across connected parties, motivating certification robust to communication.", "highlights": [ "Noise-robust toric code self-test tolerating classical communication over distances proportional to lattice size, with optimal scaling", "Algorithmic ILP-based search for self-testing protocols on smaller lattices", "Extension to surface code and two-dimensional cluster states with nearest-neighbor communication robustness" ], "keywords": [ { "label": "Self-Testing", "reason": "Device-independent certification of the state from correlations" }, { "label": "Toric Code", "reason": "Primary code subspace being certified" }, { "label": "Surface Codes", "reason": "Extension of the protocol to planar codes" }, { "label": "Classical Communication", "reason": "Adversarial resource the protocols are robust against" } ], "emoji": "🔐", "social_summary": "Shows the toric code can be self-tested device-independently even when untrusted devices secretly exchange classical messages, and extends the approach to surface codes and cluster states.", "highlights_oneliner": "Toric code self-testing despite communication" }, { "arxiv_id": "2609.40032", "title": "Pauli instability in arbitrary states: detecting magic in physical correlators", "authors": "Tanner Jackson, Alexey Milekhin", "arxiv_url": "https://arxiv.org/abs/2609.40032", "pdf_url": "https://arxiv.org/pdf/2609.40032.pdf", "summary": "Introduces a magic measure based on out-of-time-order correlators evaluated in arbitrary full-rank states, including Gibbs states, that vanishes if and only if the evolution is Clifford. It is related to the stabilizer entropy of the Choi state and lower-bounds the number of $T$ gates needed, even with a single fixed probe operator.", "motivation": "Magic quantifies classical simulation hardness, yet extracting it from physical correlators at finite temperature or in ground states has been unclear. A physically accessible magic probe connects non-stabilizerness to many-body dynamics.", "highlights": [ "OTOC-based quantity vanishes iff dynamics is Clifford for any full-rank state", "Related to the stabilizer entropy of the Choi state", "Lower bounds the $T$-gate count for implementing the dynamics in any circuit architecture" ], "keywords": [ { "label": "Magic", "reason": "Non-stabilizerness being measured" }, { "label": "OTOCs", "reason": "Out-of-time-order correlators used as the detection tool" }, { "label": "Stabilizer Entropy", "reason": "Related quantity for the Choi state" }, { "label": "T-count", "reason": "Lower bound on required non-Clifford gates" } ], "emoji": "✨", "social_summary": "Detects magic of quantum dynamics using out-of-time-order correlators in arbitrary states, proving the signal vanishes only for Clifford evolution and bounds T-gate counts.", "highlights_oneliner": "Measuring magic with OTOCs" }, { "arxiv_id": "2609.38319", "title": "When Symmetry Suppresses Magic", "authors": "A. de Oliveira Junior, Jake Xuereb, Rafael A. Macêdo, Jonatan Bohr Brask, Rafael Chaves", "arxiv_url": "https://arxiv.org/abs/2609.38319", "pdf_url": "https://arxiv.org/pdf/2609.38319.pdf", "summary": "Proves that the Robustness of Magic of $N$-qubit X-states is at most $\\sqrt{3}$, showing parity symmetry bounds many-body nonstabilizerness. Uses this to build an efficient lower bound on RoM for arbitrary states and derives the critical temperature at which magic emerges for Hamiltonians with X-state equilibrium states.", "motivation": "Evaluating magic for mixed states is NP-hard and scales superexponentially, and while symmetries reduce computational cost it was unknown whether they also limit magic. Analytic control over magic in many-body systems is rare.", "highlights": [ "RoM of $N$-qubit X-states is bounded by $\\sqrt{3}$ independent of system size", "Scalable lower-bounding method for RoM of arbitrary many-body states tested on spin-1/2 ground states", "Analytic critical temperature for emergence of magic in Gibbs states with X-state form" ], "keywords": [ { "label": "Robustness Magic", "reason": "Magic monotone bounded under symmetry" }, { "label": "Parity Symmetry", "reason": "Symmetry shown to suppress nonstabilizerness" }, { "label": "Repetition Code", "reason": "Symmetry generators are its stabilizers" }, { "label": "Nonstabilizerness", "reason": "Resource for quantum advantage being quantified" } ], "emoji": "🪞", "social_summary": "Proves parity symmetry caps the robustness of magic of many-qubit X-states at the single-qubit maximum, enabling scalable magic lower bounds and analytic critical temperatures.", "highlights_oneliner": "Symmetry bounds many-body magic" }, { "arxiv_id": "2609.39922", "title": "Fault-tolerant cost of shallow QAOA on near-symmetric optimization problems", "authors": "Jernej Rudi Finžgar, Martin Leib, Elisabeth Wybo", "arxiv_url": "https://arxiv.org/abs/2609.39922", "pdf_url": "https://arxiv.org/pdf/2609.39922.pdf", "summary": "Analyzes the fault-tolerant resource cost of depth-one QAOA on Montanaro-Zhou near-symmetric CSPs. Since the rotation angle shrinks as $n^{1-\\ell}$, small-angle Clifford$+T$ synthesis reduces non-Clifford cost to $\\widetilde O(n^2)$ for any clause locality $\\ell$, though compilation requires the clause list and leakage of degree-one Fourier coefficients may reveal the planted solution.", "motivation": "Depth-one QAOA shows an empirical exponential speedup on near-symmetric CSPs, but the $\\Theta(n^\\ell)$ clauses suggest prohibitive fault-tolerant cost. Determining realistic non-Clifford requirements is essential for early fault-tolerant devices.", "highlights": [ "Non-Clifford cost per circuit reduced to $\\widetilde O(n^2)$ for every clause locality $\\ell$ via small-angle rotation synthesis", "Constant QAOA success is tied to degree-one Fourier coefficients whose signs leak the planted solution", "Constructed families where quadratic non-Clifford scaling coexists with hard exact optimization" ], "keywords": [ { "label": "QAOA", "reason": "Algorithm whose fault-tolerant cost is analyzed" }, { "label": "T Gates", "reason": "Non-Clifford resource count being minimized" }, { "label": "Rotation Synthesis", "reason": "Small-angle Clifford+T synthesis lowers cost" }, { "label": "Fault Tolerance", "reason": "Resource estimation for early fault-tolerant hardware" } ], "emoji": "🧮", "social_summary": "Shows shallow QAOA on near-symmetric problems needs only quadratically many non-Clifford gates thanks to tiny rotation angles, while analyzing when the planted solution leaks.", "highlights_oneliner": "Fault-tolerant cost of shallow QAOA" }, { "arxiv_id": "2609.40128", "title": "Optimal Resource Scaling for Early Fault Tolerant Iterative Quantum Phase Estimation under Cost Error Tradeoffs", "authors": "Mrudula A Mahindrakar, Avhishek Chatterjee", "arxiv_url": "https://arxiv.org/abs/2609.40128", "pdf_url": "https://arxiv.org/pdf/2609.40128.pdf", "summary": "The paper derives closed-form optimal shot allocations $N_k^*$ across iterations of the iterative quantum phase estimation algorithm (IPEA) under a total resource budget $W$, maximizing the probability that all $L$ phase bits are correct under majority-vote repetition. Using tight concentration and anti-concentration bounds to build upper and lower surrogate problems that converge for small per-shot error $q_k$, it shows $N_k^*$ is proportional to $\\ln(\\sum_k w_k)/c_k$ with $c_k \\propto \\ln(1/q_k)$ in the resource-abundant regime, with additional $\\frac{1}{c_k}\\ln\\frac{1}{w_k}$ corrections in the tighter-budget regime.", "motivation": "IPEA is attractive for NISQ and early fault-tolerant hardware because it avoids the inverse quantum Fourier transform, but imperfect unitaries from error mitigation or partial correction produce unreliable phase bits. Since iterations differ in circuit cost $w_k$ and error $q_k$, principled shot allocation under tight budgets is needed to design practical systems.", "highlights": [ "Closed-form optimal shot allocation $N_k^*$ for IPEA under a total resource constraint $\\sum_k w_k N_k \\le W$", "In the resource-abundant regime, $N_k^*$ depends only on iteration reliability via $c_k=-\\ln\\left(2\\sqrt{(1-q_k/2)q_k/2}\\right)$, not on individual costs $w_k$", "For tighter budgets, allocation to higher-power iterations is additively influenced by $\\frac{1}{c_k}\\ln\\frac{1}{w_k}$, yielding simple rules of thumb" ], "keywords": [ { "label": "Phase Estimation", "reason": "Core algorithm studied is iterative quantum phase estimation (IPEA)." }, { "label": "Resource Allocation", "reason": "The paper optimizes shots per iteration under a cost budget $W$." }, { "label": "Early Fault-Tolerance", "reason": "Target hardware regime with imperfect unitaries and partial error correction." }, { "label": "Majority Voting", "reason": "Repetition with majority decision is used to boost phase-bit reliability." } ], "emoji": "🎯", "social_summary": "Derives closed-form optimal shot allocation across iterations of iterative phase estimation under resource budgets, giving simple rules of thumb for early fault-tolerant hardware.", "highlights_oneliner": "Optimal shot allocation for iterative phase estimation" }, { "arxiv_id": "2609.40036", "title": "Cycle Codes and Decoded Quantum Interferometry", "authors": "Anuj Apte, Shouvanik Chakrabarti, Andi Gu, Stephen P. Jordan, Ojas Parekh, Ruslan Shaydulin, Jacob Watkins, Noureldin Yosri, Adam Zalcman", "arxiv_url": "https://arxiv.org/abs/2609.40036", "pdf_url": "https://arxiv.org/pdf/2609.40036.pdf", "summary": "The paper derives Decoded Quantum Interferometry (DQI) satisfaction guarantees under imperfect decoding of cycle codes, showing minimum-weight decoding of homological cycle codes is NP-hard over every field of size $q>2$. On the Linial–Simkin ensemble of logarithmic-girth regular graphs it proves maximum-likelihood recovery bounds, a strong converse, and LP-decoder recovery, yielding bounds that rule out quantum advantage for classical decoders in the analyzed regimes while identifying regular Max-$k$-Cut instances where DQI efficiently achieves a nontrivial guarantee.", "motivation": "DQI reduces optimization problems with two-variable constraints, such as MaxCut, to decoding cycle codes, but prior no-go results relied on minimum-distance assumptions that underestimate true decodability thresholds. Understanding actual decoding performance is key to determining whether DQI can deliver quantum advantage over powerful classical heuristics.", "highlights": [ "Minimum-weight decoding of homological cycle codes is NP-hard for every field of size $q>2$, contrasting with the binary case", "Maximum-likelihood recovery bounds and a strong converse on the Linial–Simkin ensemble of logarithmic-girth regular graphs, plus LP decoding of a positive fraction of random errors", "Upper and lower bounds on DQI with classical decoders rule out advantage in analyzed regimes but identify regular Max-$k$-Cut instances with a nontrivial efficient guarantee" ], "keywords": [ { "label": "Cycle Codes", "reason": "DQI for two-variable constraints reduces to decoding cycle codes." }, { "label": "Decoded Quantum Interferometry", "reason": "The quantum optimization algorithm whose performance is analyzed." }, { "label": "LP Decoding", "reason": "Linear programming decoders give polynomial-time error recovery." }, { "label": "MaxCut", "reason": "Paradigmatic optimization problem used to assess DQI guarantees." } ], "emoji": "🔄", "social_summary": "Analyzes decoded quantum interferometry through cycle code decoding, proving hardness and recovery bounds that rule out advantage in some regimes while finding promising Max-k-Cut instances.", "highlights_oneliner": "Cycle code decoding limits for DQI advantage" }, { "arxiv_id": "2609.39589", "title": "Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering", "authors": "Naresh Goud Boddu", "arxiv_url": "https://arxiv.org/abs/2609.39589", "pdf_url": "https://arxiv.org/pdf/2609.39589.pdf", "summary": "The paper constructs efficient information-theoretic non-malleable codes for classical messages secure against two non-communicating quantum tampering operations with arbitrary pre-shared entanglement, achieving rate at least $1/5-\\xi$, perfect correctness, and error $2^{-n^{\\Omega(1)}}$. It modifies the Batra–Boddu–Jain permutation-based construction by feeding a prescribed message concatenated with fresh uniform padding, and gives a worst-case security reduction with a single message-independent simulator per attack.", "motivation": "Non-malleable codes protect stored cryptographic state from related-key tampering, and the entangled two-split-state model was previously known to reach rate approaching $1/5$ only for uniformly random messages. Achieving constant rate for worst-case classical messages was an open question.", "highlights": [ "Rate $1/5-\\xi$ non-malleable codes with perfect correctness and error $2^{-n^{\\Omega(1)}}$ against entangled split-state tampering", "Worst-case security for every message with a single message-independent simulator per attack", "Replaces uniform message input with a prescribed message plus uniform padding in the permutation construction, with a new security reduction" ], "keywords": [ { "label": "Non-Malleable Codes", "reason": "The central cryptographic primitive being constructed." }, { "label": "Split-State Tampering", "reason": "The adversarial model with two non-communicating tampering functions." }, { "label": "Entanglement", "reason": "Tamperers may share arbitrary pre-shared entanglement." }, { "label": "Code Rate", "reason": "Main result achieves constant rate approaching $1/5$." } ], "emoji": "🔐", "social_summary": "Constructs rate one-fifth non-malleable codes secure against entangled split-state tampering for worst-case classical messages, resolving the constant-rate question in this model.", "highlights_oneliner": "Rate 1/5 non-malleable codes vs entangled tampering" } ] }, "2026-09-30": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Transversal", "weight": 4 }, { "word": "Bicycle", "weight": 3 }, { "word": "Decoding", "weight": 4 }, { "word": "Entanglement", "weight": 4 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "BeliefPropagation", "weight": 2 }, { "word": "Magic", "weight": 2 }, { "word": "Fermions", "weight": 2 }, { "word": "Distributed", "weight": 2 }, { "word": "Photon", "weight": 2 }, { "word": "Distance", "weight": 3 }, { "word": "GroupAlgebra", "weight": 2 }, { "word": "Memories", "weight": 2 } ], "social_highlights": "Highlights: Bell-pair-saving puncturing for EAQECCs, stable SPDC entanglement without feedback, transversal code choices for distributed QC, magic-entanglement links in free fermions, group-algebra bivariate bicycle codes, disagreement-based adaptive qLDPC decoding, autonomous local belief-propagation decoders, constant-rate PRISM codes with full Clifford gates, tomography-free universal quantum coding, and amplified qLDPC codes for ultra-high-distance memories.", "papers": [ { "arxiv_id": "2609.36273", "title": "Puncturing for Adaptive Entanglement-Assisted Stabilizer Codes", "authors": "Nicolai Peder Bülow Pedersen, Jakob Kaltoft Søndergaard, Jaron Skovsted Gundersen, René Bødker Christensen, Petar Popovski", "arxiv_url": "https://arxiv.org/abs/2609.36273", "pdf_url": "https://arxiv.org/pdf/2609.36273", "summary": "This work extends puncturing techniques from standard stabilizer codes to entanglement-assisted stabilizer codes (EAQECCs), enabling a single mother code to adapt to varying availability of pre-shared Bell pairs. The three-step procedure interprets an $[[n,k,d;c]]$ code as an unassisted $[[n+c,k,d']]$ stabilizer, punctures a receiver-side qubit, and maps back to obtain an $[[n,k,d_p;c-1]]$ code, reducing entanglement consumption by one Bell pair while preserving $k$.", "motivation": "Entanglement-assisted stabilizer codes can achieve better parameters than unassisted codes but require reliable pre-shared entanglement, which may be intermittently available in practice. Adapting a single mother code to fluctuating entanglement budgets, rather than designing separate codes, motivates this puncturing-based framework.", "highlights": [ "Three-step puncturing procedure reduces Bell pair consumption by one while preserving $k$", "Derived bound on distance loss and conditions to preserve original code distance", "14.75% of randomly generated EAQECCs beat their unassisted counterparts in distance, with 81.4% of those preserving distance under puncturing" ], "keywords": [ { "label": "EAQECC", "reason": "Paper focuses on entanglement-assisted quantum error-correcting codes and their adaptation" }, { "label": "Puncturing", "reason": "Core technique extended from unassisted to entanglement-assisted stabilizer codes" }, { "label": "Bell Pairs", "reason": "Pre-shared entanglement resource whose consumption is reduced by the proposed method" }, { "label": "Code Distance", "reason": "Key parameter analyzed for preservation or degradation under puncturing" } ], "emoji": "🔗", "social_summary": "Researchers show how to adapt entanglement-assisted quantum codes to save Bell pairs while preserving code distance and logical qubits.", "highlights_oneliner": "Puncturing extends adaptivity to entanglement-assisted stabilizer codes" }, { "arxiv_id": "2609.37514", "title": "Multi-Parameter Error Mitigation in Parametric Down-Conversion via SU(1, 1) Composite Segmentation", "authors": "Nastaran Ragerdi Kashani, Rouhollah Karimzadeh", "arxiv_url": "https://arxiv.org/abs/2609.37514", "pdf_url": "https://arxiv.org/pdf/2609.37514", "summary": "This paper analyzes error mitigation in spontaneous parametric down-conversion (SPDC) using composite segmentation governed by $SU(1,1)$ spatial dynamics, showing that odd spatial Fourier harmonics preserve error-cancellation flatness with pair-generation rates scaling as $m^{-2}$. An open-loop thermo-optic bias broadens angular acceptance by $3.46\\times$ and the scheme tolerates missing poling domains while sustaining relative conversion efficiency $\\eta \\ge 0.954$ across a $5^{\\circ}$C thermal window without closed-loop feedback.", "motivation": "SPDC is a key resource for continuous-variable quantum information protocols, but phase mismatch fluctuations from temperature drift, misalignment, and fabrication errors degrade pair-generation efficiency and phase stability, and active stabilization imposes hardware overhead. This work seeks a passive, structurally robust alternative to continuous feedback control for entangled photon sources.", "highlights": [ "Odd spatial Fourier harmonics yield error-cancellation flatness with $m^{-2}$ pair-rate scaling", "Open-loop thermo-optic bias broadens 90%-efficiency angular acceptance half-width by $3.46\\times$", "Sustains relative conversion efficiency $\\eta \\ge 0.954$ and phase coherence above $0.95$ across a $5^{\\circ}$C thermal window" ], "keywords": [ { "label": "SPDC", "reason": "Central physical process studied for entangled photon pair generation" }, { "label": "SU(1,1)", "reason": "Non-compact Lie algebra governing the spatial propagation dynamics analyzed" }, { "label": "Phase Matching", "reason": "Key error source addressed via composite segmentation design" }, { "label": "Composite Pulses", "reason": "Segmentation technique borrowed from composite pulse error-mitigation concepts applied to nonlinear optics" } ], "emoji": "💎", "social_summary": "New composite segmentation design keeps entangled photon generation efficient and phase-stable without active feedback control.", "highlights_oneliner": "Passive SU(1,1)-based error mitigation for photon pair sources" }, { "arxiv_id": "2609.37210", "title": "Encoding and Node Choices in Transversal Fault-Tolerant Distributed Quantum Computations: An Initial Study", "authors": "Seng W. Loke", "arxiv_url": "https://arxiv.org/abs/2609.37210", "pdf_url": "https://arxiv.org/pdf/2609.37210", "summary": "This paper compares Bivariate-Bicycle (BB) code encodings and node allocation strategies for distributed transversal operations like non-local CNOTs and global GCZ gates, arguing that minimizing ebit consumption alone is not sufficient for minimizing logical error rate. It demonstrates that a transversal physical GCZ on a self-dual $[[120,8,12]]$ BB code can realize eight concurrent logical GCZ operations after accounting for logical permutations induced by transversal Hadamard.", "motivation": "Distributed fault-tolerant quantum computing requires choosing among competing QLDPC encodings across multiple QPUs, and prior work has focused mainly on reducing entanglement (ebit) costs. This study highlights that code distance and logical error rate must also be jointly optimized alongside resource consumption when selecting encodings and node configurations.", "highlights": [ "Shows ebit-minimizing encoding choice is not always optimal for logical error rate", "Demonstrates eight concurrent logical GCZ operations via transversal physical GCZ on $[[120,8,12]]$ BB code", "Frames encoding/node selection as a circuit- and architecture-dependent constrained optimization problem" ], "keywords": [ { "label": "BB Codes", "reason": "Bivariate-Bicycle codes are the primary code family compared in the study" }, { "label": "Distributed QC", "reason": "Paper targets distributed/modular fault-tolerant quantum computation across QPUs" }, { "label": "Transversal Gates", "reason": "Non-local CNOT and GCZ transversal operations are the studied distributed primitives" }, { "label": "Logical Error Rate", "reason": "Key metric argued to be more important than ebit consumption alone" } ], "emoji": "🧩", "social_summary": "Study shows minimizing entanglement cost alone is not enough when choosing quantum codes for distributed computing.", "highlights_oneliner": "Comparing BB code choices for distributed transversal gates" }, { "arxiv_id": "2609.36008", "title": "Entanglement spectrum and magic in higher-dimensional free fermionic systems", "authors": "Beatrice Magni, Daniele Iannotti, Riccardo Travaglino", "arxiv_url": "https://arxiv.org/abs/2609.36008", "pdf_url": "https://arxiv.org/pdf/2609.36008", "summary": "This work studies fermionic non-local magic in higher-dimensional free-fermion systems via the entanglement spectrum, showing that dimensional reduction in strip geometries maps to independent lower-dimensional momentum sectors, producing multiplicative logarithmic Gioev-Klich-Widom-like boundary-law violations in two dimensions. The authors bound the second Rényi non-local magic by the capacity of entanglement, introduce an entanglement-temperature deformation probing the entanglement Hamiltonian's low-energy structure, and apply this to the matter-Majorana sector of the Kitaev model and to random Gaussian circuit dynamics.", "motivation": "Magic (nonstabilizerness) and entanglement are complementary quantum resources, with magic having gained recent attention through stabilizer entropy measures, but non-local magic's minimization over local unitaries is generally computationally prohibitive. Fermionic Gaussian states offer a tractable setting where this obstruction can be bypassed, motivating deeper study of higher-dimensional and out-of-equilibrium behavior.", "highlights": [ "Multiplicative logarithmic violation of boundary law for non-local magic in 2D, analogous to Gioev-Klich-Widom scaling", "Second Rényi non-local magic bounded by capacity of entanglement, with entanglement-temperature deformation probing entanglement Hamiltonian structure", "Exponential suppression in the Abelian phase vs. algebraic behavior in the non-Abelian phase of the Kitaev model, approaching a universal capacity ratio" ], "keywords": [ { "label": "Magic", "reason": "Non-local nonstabilizerness in fermionic systems is the central resource studied" }, { "label": "Entanglement Spectrum", "reason": "Primary analytical tool used to characterize the fermionic states" }, { "label": "Kitaev Model", "reason": "Applied case study distinguishing Abelian and non-Abelian topological phases" }, { "label": "Free Fermions", "reason": "Gaussian fermionic states provide the tractable setting for the analysis" } ], "emoji": "🌀", "social_summary": "Physicists link entanglement spectra to nonstabilizer magic in higher-dimensional free-fermion systems, including the Kitaev model.", "highlights_oneliner": "Non-local magic and entanglement spectrum in free fermions" }, { "arxiv_id": "2609.36213", "title": "Bivariate Bicycle Codes over Group Algebras", "authors": "Chaobin Liu", "arxiv_url": "https://arxiv.org/abs/2609.36213", "pdf_url": "https://arxiv.org/pdf/2609.36213", "summary": "This paper introduces a weighted-shift formulation of bivariate bicycle group-algebra (BBGA) codes over finite group algebras, where commuting left and right multiplication shifts—even for nonabelian seed groups—define CSS codes via bivariate polynomials including mixed monomials. It presents a computer-verified $[[144,16,12]]$ code over $A_4 \\times C_6$ with weight-eight checks and a $[[18,4,3]]$ code over $\\mathbb{F}_2[C_3]$ that is proven inequivalent to any ordinary abelian BB or two-block group-algebra realization.", "motivation": "Quantum LDPC codes such as bivariate bicycle (BB) codes offer compact, sparse-check constructions with favorable rate-distance scaling, and group-algebra generalizations extend this mechanism to nonabelian groups. This work seeks to clarify when such generalized constructions produce codes genuinely inequivalent to known abelian BB or 2BGA families, expanding the known design space.", "highlights": [ "$D_3$ weighted permutation shifts recover known $[[144,12,12]]$ and $[[144,14,14]]$ BB codes", "Computer-verified $[[144,16,12]]$ code over $A_4\\times C_6$ with uniform weight-eight checks", "$[[18,4,3]]$ code over $\\mathbb{F}_2[C_3]$ certified inequivalent to any ordinary binary 2BGA realization" ], "keywords": [ { "label": "qLDPC", "reason": "Paper constructs sparse quantum low-density parity-check codes" }, { "label": "Group Algebra", "reason": "Codes are built from bivariate polynomials over finite group algebras" }, { "label": "BB Codes", "reason": "Extends the bivariate bicycle code framework to nonabelian settings" }, { "label": "CSS Codes", "reason": "Constructed codes belong to the CSS stabilizer code family" } ], "emoji": "🔢", "social_summary": "New group-algebra construction generalizes bivariate bicycle quantum codes, yielding provably inequivalent nonabelian code examples.", "highlights_oneliner": "Nonabelian group-algebra generalization of bivariate bicycle codes" }, { "arxiv_id": "2609.37629", "title": "Adaptive decoding of quantum LDPC codes through decoder disagreement", "authors": "Maida Wang, Peter V. Coveney", "arxiv_url": "https://arxiv.org/abs/2609.37629", "pdf_url": "https://arxiv.org/pdf/2609.37629", "summary": "This paper introduces an adaptive BP-OSD decoder for qLDPC codes that uses disagreement between the BP hard decision and the order-zero OSD solution as an internal risk signal to selectively escalate deeper post-processing search only for high-risk syndromes. On the $[[144,12,12]]$ bivariate bicycle code, escalating the riskiest 20% of instances recovers 85-92% of the logical error rate improvement from a full search while cutting mean decoding cost by $3.6\\times$, with similar gains on a lifted-product radial code and validation on Quantinuum H2 hardware.", "motivation": "Fault-tolerant quantum computation requires decoders to keep pace with syndrome streams, but expensive post-processing search in BP-OSD decoding of qLDPC codes is typically applied uniformly even though decoding difficulty varies greatly between syndromes. Identifying and prioritizing hard instances could dramatically reduce classical computational overhead without sacrificing accuracy.", "highlights": [ "Disagreement-based risk signal recovers 85-92% of full-search logical error rate gains by escalating only 20% of instances", "Reduces mean serial decoding cost by $3.6\\times$ compared to uniform truncated search", "Signal validated on real device noise via $Z$-memory experiment on Quantinuum H2 trapped-ion processor" ], "keywords": [ { "label": "BP-OSD", "reason": "Core decoding algorithm combining belief propagation and ordered-statistics decoding" }, { "label": "Adaptive Decoding", "reason": "Central contribution is dynamically allocating decoding effort per syndrome" }, { "label": "qLDPC", "reason": "Bivariate bicycle and lifted-product codes are the target code families" }, { "label": "Trapped Ions", "reason": "Validated using Quantinuum H2 hardware experiments" } ], "emoji": "🎯", "social_summary": "New adaptive decoder spots which quantum error syndromes need extra effort, cutting decoding cost by over three times.", "highlights_oneliner": "Disagreement signal enables cost-efficient adaptive qLDPC decoding" }, { "arxiv_id": "2609.38139", "title": "Local autonomous inference machines for quantum LDPC codes", "authors": "Siddhant Midha, Dmitry A. Abanin", "arxiv_url": "https://arxiv.org/abs/2609.38139", "pdf_url": "https://arxiv.org/pdf/2609.38139", "summary": "This paper introduces a local, distributed, autonomous decoding framework for quantum LDPC codes built on belief propagation, combining local processing, feedback, and parallelized decoding without global classical coordination. It shows that codes with a BP threshold can be promoted to autonomous local measurement-and-feedback dynamics preserving that threshold, and that BP's local marginal information can drive defect motion, pairing, and annihilation even in cases like 2D/3D toric codes where naive BP fails.", "motivation": "Real-time decoding of quantum LDPC codes at scale demands fast, parallelizable, and ideally local decoding architectures rather than centralized classical processors that struggle to keep pace with syndrome extraction rates. This work explores whether belief propagation's local information can be harnessed for genuinely autonomous, distributed decoding dynamics.", "highlights": [ "BP-threshold-preserving promotion to autonomous local measurement-and-feedback dynamics", "Demonstrates threshold behavior via defect motion/annihilation in 2D and 3D toric code point-like sectors where naive BP fails", "Extends inference dynamics to membrane-like 3D toric code sectors and bivariate-bicycle qLDPC codes" ], "keywords": [ { "label": "Belief Propagation", "reason": "Core decoding algorithm underlying the local inference machine architecture" }, { "label": "Toric Code", "reason": "2D and 3D toric codes used as testbeds for threshold demonstration" }, { "label": "Autonomous Decoding", "reason": "Key innovation is local, feedback-driven decoding without central control" }, { "label": "qLDPC", "reason": "Framework generalized to bivariate-bicycle quantum LDPC codes" } ], "emoji": "🤖", "social_summary": "New local, autonomous decoder architecture uses belief propagation to fix quantum errors in a distributed, parallelized way.", "highlights_oneliner": "Local autonomous BP-based decoding for qLDPC codes" }, { "arxiv_id": "2609.37699", "title": "Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates", "authors": "Takaya Matsuura, Yohji Chin, Shohei Kiryu, Kosuke Fukui", "arxiv_url": "https://arxiv.org/abs/2609.37699", "pdf_url": "https://arxiv.org/pdf/2609.37699", "summary": "This paper constructs a family of quantum codes, named PRISM codes, with asymptotically constant encoding rate and sublogarithmically growing stabilizer weight that support the entire logical Clifford group using only transversal and fold-transversal gates. The construction uses hypergraph products of classical codes whose code spaces are absolutely irreducible Steinberg modules of their Tanner-graph automorphism groups, achieving stabilizer weight $\\lesssim 10$ for up to $\\sim10^{18}$ physical qubits with distance growing much faster than stabilizer weight.", "motivation": "Low-space-overhead fault tolerance requires both high-rate codes and space-efficient logical gate implementations, and transversal/fold-transversal gates are attractive since they avoid ancilla overhead but usually support only restricted gate sets. This work addresses the central challenge of combining a complete logical Clifford group with favorable code parameters and low stabilizer weight.", "highlights": [ "Constant-rate code family (PRISM codes) with sublogarithmically growing stabilizer weight supporting full logical Clifford group", "Hypergraph products of Steinberg-module-based classical codes enable transversal/fold-transversal implementation of all in-block and inter-block Clifford gates", "Achieves stabilizer weight $\\lesssim 10$ for up to $\\sim 10^{18}$ physical qubits with distance scaling faster than stabilizer weight" ], "keywords": [ { "label": "Transversal Gates", "reason": "Central mechanism for implementing logical operations without ancilla overhead" }, { "label": "Hypergraph Product", "reason": "Construction method combining classical Steinberg codes into quantum codes" }, { "label": "Clifford Group", "reason": "Paper achieves full logical Clifford gate support, a key fault-tolerance goal" }, { "label": "Steinberg Modules", "reason": "Algebraic structure underlying the seed classical codes used in the construction" } ], "emoji": "🧬", "social_summary": "New PRISM code family enables full logical Clifford gates via low-weight, space-efficient transversal operations at constant rate.", "highlights_oneliner": "Constant-rate codes with full transversal Clifford gates" }, { "arxiv_id": "2609.38038", "title": "Universal quantum coding", "authors": "Jacopo Rizzo, Ludovico Lami, Jens Eisert, Lorenzo Leone", "arxiv_url": "https://arxiv.org/abs/2609.38038", "pdf_url": "https://arxiv.org/pdf/2609.38038", "summary": "The authors use Schur-Weyl duality to construct universal quantum error-correction codes that require no prior knowledge of the underlying bipartite state or channel. Irreducible permutation spaces from the local Schur-Weyl decomposition of many identical copies form maximally entangled code spaces whose error structure is fixed by representation theory, yielding universal protocols for entanglement distillation and quantum communication achieving coherent-information rates with exponentially vanishing error and optimal second-order corrections. At finite block length, achievable rates are governed by a Schur-Weyl information spectrum linked to Petz-Rényi conditional entropies, with sample complexity depending only on spectral ranks rather than Hilbert space dimension.", "motivation": "Standard entanglement distillation and channel coding protocols traditionally require full knowledge of the state or channel, forcing costly tomography before optimal codes can be designed. This work matters because it shows representation theory alone can supply universal, tomography-free codes that achieve optimal rates without any prior characterization of the noise or resource.", "highlights": [ "Established a universal quantum error-correction principle via Schur-Weyl duality that removes dependence on prior state/channel knowledge", "Achieved coherent-information rates with exponentially vanishing error and optimal second-order corrections for entanglement distillation and communication", "Showed sample complexity scales with spectral ranks (e.g. $O(\\text{poly } n)$ global rank for $n$-qubit states) rather than Hilbert space dimension" ], "keywords": [ { "label": "Schur-Weyl Duality", "reason": "Core mathematical mechanism underlying the universal code construction" }, { "label": "Entanglement Distillation", "reason": "One of the two central tasks unified by the universal coding framework" }, { "label": "Tomography-Free", "reason": "Highlights that the protocols avoid needing prior state/channel characterization" }, { "label": "Rényi Entropy", "reason": "Petz-Rényi conditional entropies characterize finite block-length performance" } ], "emoji": "🔄", "social_summary": "Researchers use Schur-Weyl duality to build quantum codes that work optimally without any prior knowledge of the noisy state or channel.", "highlights_oneliner": "Tomography-free universal codes via representation theory" }, { "arxiv_id": "2609.37231", "title": "Ultra-high-distance quantum memories from amplified qLDPC codes", "authors": "Zijian Liang, Boren Gu, Yu-An Chen, Jens Eisert, Zongyuan Wang", "arxiv_url": "https://arxiv.org/abs/2609.37231", "pdf_url": "https://arxiv.org/pdf/2609.37231", "summary": "The authors introduce distance amplifiers, a modular tensor-product construction that boosts both code distance and certified circuit-level protection in quantum LDPC codes by combining a base code with a small amplifier code and adapting syndrome-extraction circuits accordingly. They develop a fault-response certificate giving rigorous lower bounds on circuit distance and prove multiplicative distance scaling for flagged $[[4,2,2]]$, hypergraph-product, and rotated surface code amplifiers, with the certificate extending recursively across amplification steps.", "motivation": "Large code distance alone does not guarantee protection since circuit faults during syndrome extraction can propagate into correlated data errors, and certifying true circuit distance becomes computationally intractable as circuits scale up. This modular amplification approach addresses the need to build and rigorously certify very high-distance fault-tolerant memories from small, well-understood building blocks.", "highlights": [ "Proved multiplicative circuit-distance scaling for three amplifier types: flagged $[[4,2,2]]$, hypergraph-product, and rotated surface codes", "Constructed a $[[13320,64,64]]$ code with circuit distance $d_{\\mathrm{circ}} \\geq 48$ and check weights $w \\leq 14$ via four successive amplifications of an $[[18,4,4]]$ seed", "Developed a recursive fault-response certificate providing rigorous lower bounds on circuit distance at every amplification step" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The paper's central code family targeted for distance amplification" }, { "label": "Circuit Distance", "reason": "Key metric certified and multiplicatively amplified by the construction" }, { "label": "Flag Qubits", "reason": "Used alongside gate ordering to control correlated errors during amplification" }, { "label": "Tensor-Product Codes", "reason": "The CSS tensor-product construction underlying the distance amplifier method" } ], "emoji": "🧬", "social_summary": "New modular amplifier construction builds and certifies ultra-high-distance quantum LDPC memories from small building blocks.", "highlights_oneliner": "Modular amplifiers boost and certify qLDPC code distance" } ] }, "2026-09-29": { "word_cloud": [ { "word": "Transversal", "weight": 5 }, { "word": "CSS", "weight": 4 }, { "word": "Asymptotically", "weight": 3 }, { "word": "Magic", "weight": 3 }, { "word": "GKP", "weight": 5 }, { "word": "Bosonic", "weight": 3 }, { "word": "Concatenated", "weight": 3 }, { "word": "BP-OSD", "weight": 3 }, { "word": "Circuit", "weight": 4 }, { "word": "Hardness", "weight": 4 }, { "word": "Distance", "weight": 4 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Logical", "weight": 4 }, { "word": "Quasi-Cyclic", "weight": 3 }, { "word": "qLDPC", "weight": 5 } ], "social_highlights": "Highlights: addressable transversal T gates in asymptotically good codes, GKP-concatenated qLDPC circuit-level benchmarking with analog decoding, proof of hardness approximating quantum code distance beyond sqrt(N), and low-weight canonical logical bases for quasi-cyclic pair-partition codes.", "papers": [ { "arxiv_id": "2609.35129", "title": "Asymptotically Good Quantum Codes with Addressable Transversal T Gates", "authors": "Tongyin Lin, Bujiao Wu, Bin Cheng", "arxiv_url": "https://arxiv.org/abs/2609.35129", "pdf_url": "https://arxiv.org/pdf/2609.35129", "summary": "The authors construct binary CSS codes with constant rate and linear distance that support fully addressable transversal $T$ gates, meaning any prescribed tensor product of logical $T$ powers can be implemented by physical $T$ powers without subsequent Clifford correction. The construction combines algebraic-geometry codes with a binary embedding technique to induce generalized divisibility properties in the resulting binary codes. The minimum embedding length is formulated as a minimum-weight optimization over an affine space, yielding improved explicit rate and distance bounds.", "motivation": "The Eastin-Knill theorem forbids a fixed code from supporting a universal set of transversal gates, yet transversal non-Clifford gates like $T$ remain crucial ingredients for magic-state distillation and code-switching approaches to universal fault tolerance. Achieving fully addressable transversal $T$ gates while retaining asymptotically good code parameters ($K=\\Theta(N)$, $D=\\Theta(N)$) has remained an open challenge, motivating this explicit construction.", "highlights": [ "First explicit asymptotically good CSS code family with fully addressable transversal $T$ gates and no correction step", "Uses algebraic-geometry codes plus binary embedding to induce generalized divisibility enabling addressability", "Formulates minimum embedding length as a binary optimization problem to numerically improve rate/distance bounds" ], "keywords": [ { "label": "Transversal Gates", "reason": "The paper's central achievement is fully addressable transversal $T$ gates on a fixed encoding" }, { "label": "CSS Codes", "reason": "The construction produces binary CSS codes with constant rate and linear distance" }, { "label": "AG Codes", "reason": "Algebraic-geometry codes are the key ingredient combined with binary embedding" }, { "label": "Magic States", "reason": "Transversal $T$ gates underlie magic-state distillation protocols motivating the work" } ], "emoji": "🧩", "social_summary": "Researchers build asymptotically good quantum codes where every logical T gate can be applied directly and independently, with no correction needed.", "highlights_oneliner": "Good codes with fully addressable transversal T gates" }, { "arxiv_id": "2609.35282", "title": "Circuit-level benchmarks of GKP-concatenated qLDPC Codes", "authors": "Yuan Yao, Ruipeng Xing, Jianshuo Gao, Xiao Yuan", "arxiv_url": "https://arxiv.org/abs/2609.35282", "pdf_url": "https://arxiv.org/pdf/2609.35282", "summary": "The authors benchmark BB and tricycle quantum LDPC codes as outer codes for GKP concatenation using a unified simulation pipeline spanning code-capacity, repeated syndrome extraction, and schedule-resolved circuit-level noise. Analog-informed belief-propagation with ordered-statistics decoding (BP-OSD) consistently outperforms hard-decision decoding across all noise models, achieving finite-size crossing estimates of $\\sigma_{\\mathrm{th}}\\simeq0.212$ for the BB code and $0.142$ for the tricycle code under full circuit-level noise, corresponding to squeezing requirements of about $10.46\\,\\mathrm{dB}$ and $13.94\\,\\mathrm{dB}$.", "motivation": "GKP codes preserve valuable analog information about displacement errors, but a single GKP layer cannot achieve scalable fault tolerance and must be concatenated with an outer qubit code to suppress residual logical Pauli faults. Prior work has not systematically compared qLDPC outer codes for GKP concatenation under realistic circuit-level noise, leaving open which code families and decoders best exploit analog information at scale.", "highlights": [ "Unified simulation framework spanning code-capacity, statistical, and schedule-resolved circuit-level GKP noise", "Analog-informed BP-OSD decoding consistently beats hard-decision decoding across all tested noise models and codes", "BB code sequence achieves higher finite-size crossing ($\\sigma_{\\mathrm{th}}\\simeq0.212$, $10.46\\,\\mathrm{dB}$ squeezing) than tricycle code ($0.142$, $13.94\\,\\mathrm{dB}$)" ], "keywords": [ { "label": "GKP Codes", "reason": "The paper studies GKP bosonic encoding concatenated with outer qubit codes" }, { "label": "qLDPC", "reason": "BB and tricycle quantum LDPC codes are benchmarked as outer codes" }, { "label": "BP-OSD", "reason": "Analog-informed belief propagation with ordered statistics decoding is the key decoder compared" }, { "label": "Circuit Noise", "reason": "Benchmarks progress to schedule-resolved circuit-level displacement noise for realism" } ], "emoji": "📡", "social_summary": "Researchers benchmark GKP bosonic codes concatenated with LDPC codes, showing analog decoding info keeps boosting performance under realistic circuit noise.", "highlights_oneliner": "Circuit-level GKP-qLDPC concatenation benchmarking" }, { "arxiv_id": "2609.33956", "title": "Hardness of Approximating Quantum Code Distance Beyond $\\sqrt{N}$", "authors": "Upendra Kapshikar", "arxiv_url": "https://arxiv.org/abs/2609.33956", "pdf_url": "https://arxiv.org/pdf/2609.33956", "summary": "This work closes the gap in hardness-of-approximation results for the stabilizer code minimum distance problem, showing that no randomized algorithm can approximate distance to within an additive $\\alpha N$ gap unless $\\mathsf{NP}\\subseteq\\mathsf{coRP}$, improving on prior $O(\\sqrt{N})$ additive gap reductions. It further initiates a fine-grained complexity study, proving SETH-based lower bounds of $2^{(1-\\varepsilon)\\kappa}\\mathrm{poly}(N)$ for exact computation and non-uniform Gap-ETH-based $2^{o(N)}$ lower bounds for approximation when block length, logical qubits, and gap all scale linearly.", "motivation": "Classical minimum distance problems are known to be NP-hard to approximate within a linear additive gap, but prior quantum analogues by Kapshikar-Kundu and Grigorescu-Jha-Samperton only achieved a weaker $O(\\sqrt{N})$ gap, leaving open whether quantum codes are as hard to approximate as classical ones. Understanding this hardness matters because efficient distance approximation would undermine efforts to search for good quantum codes via random sampling.", "highlights": [ "Improves quantum minimum distance hardness from additive $O(\\sqrt{N})$ gap to full linear additive $\\alpha N$ gap", "Establishes SETH-based fine-grained lower bound of $2^{(1-\\varepsilon)\\kappa}\\mathrm{poly}(N)$ for exact distance computation", "Proves non-uniform Gap-ETH-based $2^{o(N)}$ hardness for linear-gap approximation with linear logical qubits" ], "keywords": [ { "label": "Complexity", "reason": "The paper is centrally about computational complexity of the minimum distance problem" }, { "label": "Stabilizer Codes", "reason": "Hardness results are proven for the distance problem of stabilizer codes" }, { "label": "Hardness Reductions", "reason": "Uses NP-hardness and fine-grained reductions like SETH and Gap-ETH" }, { "label": "Fine-Grained", "reason": "Initiates fine-grained complexity analysis with exponential time lower bounds" } ], "emoji": "🧮", "social_summary": "New proof shows approximating quantum code distance beyond a square-root gap is as hard as solving NP-hard problems.", "highlights_oneliner": "Tighter hardness bounds for quantum code distance" }, { "arxiv_id": "2609.35601", "title": "Low-Weight Canonical Logical Bases from Pair-Partition Codes", "authors": "Koki Okada, Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2609.35601", "pdf_url": "https://arxiv.org/pdf/2609.35601", "summary": "The authors construct complete canonical logical bases for qubit CSS codes built from circulant permutation matrix pair-partition (CPM-PP) checks, using quaternary coefficients, cofactor representatives, and a pairing polynomial to derive logical $X/Z$ operator pairs that span the full logical space. When the pairing polynomial is a cyclic-shift monomial, normalization preserves low binary weight of the representatives, and example codes achieve parameters such as $[[320,80,14]]$, $[[448,112,18]]$, and $[[2048,512,24]]$ with maximum check weight $10$ and logical weights around $25$-$27$.", "motivation": "Quasi-cyclic quantum LDPC constructions offer sparse checks with controlled block dimensions, but obtaining low-weight canonical logical representatives that respect this cyclic structure has remained a design challenge distinct from constructing the check matrices themselves. Low-weight logical operators are important for efficient logical measurement and fault-tolerant operations, making this canonical construction practically valuable.", "highlights": [ "Polynomial construction of complete canonical logical bases preserving cyclic structure of CPM-PP checks", "Cyclic-shift monomial pairing polynomials guarantee normalization preserves binary weight of representatives", "Example codes $[[320,80,14]]$, $[[448,112,18]]$, $[[2048,512,24]]$ achieve check weight $10$ and logical weights $25$-$27$" ], "keywords": [ { "label": "qLDPC", "reason": "The construction targets low-density parity-check CSS codes with sparse checks" }, { "label": "Logical Operators", "reason": "The paper's focus is constructing canonical low-weight logical basis representatives" }, { "label": "Quasi-Cyclic", "reason": "Uses circulant permutation matrix structure to maintain cyclic symmetry" }, { "label": "CSS Codes", "reason": "The framework is built for general CSS code check matrices $H_X$, $H_Z$" } ], "emoji": "🔗", "social_summary": "New method builds low-weight logical operator bases for quasi-cyclic quantum LDPC codes, preserving their cyclic structure.", "highlights_oneliner": "Canonical low-weight logical bases for quasi-cyclic codes" } ] }, "2026-09-28": { "word_cloud": [ { "word": "Triorthogonal", "weight": 4 }, { "word": "MagicStates", "weight": 5 }, { "word": "ReedMuller", "weight": 2 }, { "word": "GKP", "weight": 4 }, { "word": "Teleportation", "weight": 2 }, { "word": "Dephasing", "weight": 3 }, { "word": "Bosonic", "weight": 3 }, { "word": "qLDPC", "weight": 4 }, { "word": "Topological", "weight": 3 }, { "word": "GaugeTheory", "weight": 2 }, { "word": "Uncomputation", "weight": 3 }, { "word": "Decoding", "weight": 3 }, { "word": "HHL", "weight": 2 }, { "word": "Oracle", "weight": 3 }, { "word": "Grover", "weight": 3 }, { "word": "Distillation", "weight": 4 } ], "social_highlights": "Highlights: exhaustive triorthogonal code search reaches length 54 with 65 new protocols, dephased ancillas undermine GKP self-correction, twisted sheaf gauge theory powers non-Abelian qLDPC magic state fountains, uncomputation reframed as error correction slashes HHL overhead, and oracle distillation shields Grover speedups below threshold.", "papers": [ { "arxiv_id": "2609.30860", "title": "Classification of Generalised Triorthogonal Codes through Length 54", "authors": "Adam Wills, Shubham P. Jain, Shraddha Singh", "arxiv_url": "https://arxiv.org/abs/2609.30860", "pdf_url": "https://arxiv.org/pdf/2609.30860", "summary": "This work extends the classification of unital triorthogonal spaces used in generalised triorthogonal magic state distillation codes from length $38$ to length $54$, using a directional derivative method on Reed-Muller codewords. By adding logical rows satisfying triorthogonality constraints and restricting to distance $d\\geq 3$, the authors find $74$ optimal protocols in the extended range, $65$ of which are new discoveries.", "motivation": "Magic state distillation is a key primitive for fault-tolerant non-Clifford resource preparation, and prior exhaustive classifications of triorthogonal codes were limited to $n+k\\leq 38$ due to computational and combinatorial complexity. Extending the classification to $n\\leq 54$ significantly broadens the known catalog of optimal protocols, which is valuable for practical fault-tolerant architecture design.", "highlights": [ "Extended classification of unital triorthogonal spaces from length $38$ to $54$", "Found $74$ optimal generalised triorthogonal protocols, $65$ new to the literature", "Used directional derivative methods on Reed-Muller codewords $\\operatorname{RM}(m-4,m)$ to enable the extension" ], "keywords": [ { "label": "Magic States", "reason": "The paper studies magic state distillation protocols using triorthogonal codes" }, { "label": "Triorthogonal Codes", "reason": "Central object of classification, generalised triorthogonal codes distilling T states" }, { "label": "Reed-Muller Codes", "reason": "Classification relies on correspondence with Reed-Muller codeword weight enumeration" }, { "label": "Code Classification", "reason": "Core contribution is an exhaustive optimal classification up to length $54$" } ], "emoji": "🔮", "social_summary": "Researchers extend the exhaustive search for optimal magic state distillation codes up to length 54, uncovering 65 new protocols.", "highlights_oneliner": "Classifying optimal magic state distillation codes to length 54" }, { "arxiv_id": "2609.31462", "title": "Gottesman-Kitaev-Preskill error-correction with decohered resources", "authors": "Rajendra S. Bhati, T. Bazylewicz, Jarosław K. Korbicz", "arxiv_url": "https://arxiv.org/abs/2609.31462", "pdf_url": "https://arxiv.org/pdf/2609.31462", "summary": "This paper analyzes teleportation-based GKP error correction when the ancillary GKP Bell pair undergoes pure dephasing, showing that this transforms the correction process into a correlated Pauli-Gaussian noise channel rather than a clean projection onto the codespace. The authors demonstrate that repeated noisy teleportation drives encoded modes out of the logical subspace, with leakage saturating after several correction rounds, and discuss implications for motional-oscillator GKP platforms.", "motivation": "GKP codes are a leading candidate for fault-tolerant bosonic quantum computation, but real experimental implementations always suffer from environmental decoherence that idealized ancilla-based analyses ignore. Understanding how decohered ancillas break the self-correcting property of GKP error correction is essential for realistic fault-tolerance assessments of trapped-ion and cavity-based GKP platforms.", "highlights": [ "Pure dephasing of the GKP ancilla converts teleportation-based correction into correlated Pauli-Gaussian noise", "Repeated noisy GKP teleportation causes logical subspace leakage that saturates with correction rounds", "Analysis applied to motional-oscillator-based GKP error-correction platforms using an Ohmic quantum Brownian motion model" ], "keywords": [ { "label": "GKP Codes", "reason": "The paper's central object is the Gottesman-Kitaev-Preskill bosonic code" }, { "label": "Teleportation", "reason": "GKP error correction analyzed is teleportation-based using ancilla Bell pairs" }, { "label": "Dephasing Noise", "reason": "Pure-dephasing decoherence of the ancilla is the studied noise mechanism" }, { "label": "Bosonic Codes", "reason": "GKP is a continuous-variable bosonic encoding relevant to trapped-ion and cavity platforms" } ], "emoji": "🌀", "social_summary": "Dephased ancilla qubits break the self-correcting magic of GKP error correction, causing logical information to leak away over time.", "highlights_oneliner": "Decohered ancillas degrade GKP error correction over time" }, { "arxiv_id": "2609.31541", "title": "Sipser-Spielman meets Dijkgraaf-Witten: non-Abelian qLDPC codes via twisted sheaf gauge theory and almost-constant-overhead magic state fountain", "authors": "Guanyu Zhu, Shi Jie Samuel Tan, Ryohei Kobayashi, Po-Shen Hsin", "arxiv_url": "https://arxiv.org/abs/2609.31541", "pdf_url": "https://arxiv.org/pdf/2609.31541", "summary": "This work unifies Sipser-Spielman codes and Dijkgraaf-Witten twisted gauge theories through sheaf cohomology, introducing twisted sheaf gauge theories that describe qLDPC codes with non-Abelian $D_4$ topological order. The construction enables a 'magic state fountain' via gauging measurements of addressable logical $CZ$ gates as $\\mathbb{Z}_2^3$ subcomplex symmetries, achieving near-constant magic state production rate using code parameters $[[n,\\Theta(n^{1-\\epsilon}),\\Omega(n^{(1-\\epsilon)/2})]]$.", "motivation": "Low-overhead fault-tolerant quantum computation requires both space-efficient quantum memories and efficient non-Clifford resource generation, but current qLDPC-based magic state schemes and transversal gate constructions are constrained by dimensionality and distance trade-offs. Unifying classical expander code theory with topological gauge theory offers a novel route toward scalable magic state distillation without the overhead of 3D constructions.", "highlights": [ "Unified Sipser-Spielman codes with Dijkgraaf-Witten gauge theory via sheaf cohomology framework", "Constructed non-Abelian $D_4$ topological qLDPC codes from twisted sheaf gauge theory on hypergraph-product complexes", "Achieved near-constant magic state production rate $\\Theta(n^{1-\\epsilon})$ via gauging measurement-based magic state fountain" ], "keywords": [ { "label": "qLDPC Codes", "reason": "Core codes constructed are quantum low-density parity-check codes with topological order" }, { "label": "Magic States", "reason": "Paper introduces a magic state fountain scheme for parallel non-Clifford resource generation" }, { "label": "Topological Order", "reason": "Codes realize non-Abelian $D_4$ topological order via twisted gauge theory" }, { "label": "Sheaf Cohomology", "reason": "Mathematical framework unifying Sipser-Spielman and Dijkgraaf-Witten theories" } ], "emoji": "🧮", "social_summary": "A new twisted sheaf gauge theory merges classical expander codes with topological gauge theory to fuel a near-constant-rate magic state fountain.", "highlights_oneliner": "Non-Abelian qLDPC codes power a magic state fountain" }, { "arxiv_id": "2609.31605", "title": "Measurement-Based Uncomputation from an Error Correction Perspective", "authors": "Minjun Jeon, Po-Wei Huang, Zhenyu Cai", "arxiv_url": "https://arxiv.org/abs/2609.31605", "pdf_url": "https://arxiv.org/pdf/2609.31605", "summary": "This paper develops an algebraic error-correction framework for measurement-based uncomputation (MBU), where garbage register measurement outcomes are treated as induced phase errors analogous to syndromes. The authors show post-selected MBU succeeds with probability determined by the affine rank of the garbage support, derive structural conditions for reusing the original uncomputation oracle to correct all syndromes deterministically, and demonstrate applications to HHL, modular arithmetic, QROM, and QRAM constructions.", "motivation": "Coherent uncomputation in compute-use-uncompute patterns can be as costly as the original computation, posing a major overhead for early fault-tolerant quantum devices with limited ancilla and coherence budgets. Casting measurement-based uncomputation through the lens of quantum error correction offers a principled way to trade off correction cost, workspace, and success probability.", "highlights": [ "Framed garbage register measurement outcomes as error syndromes analogous to QEC", "Derived a structural criterion enabling deterministic correction reusing the original uncomputation oracle", "Applied the framework to HHL, halving per-shot circuit depth via post-selected MBU" ], "keywords": [ { "label": "Uncomputation", "reason": "Central topic is measurement-based uncomputation of temporary quantum workspaces" }, { "label": "Syndrome Decoding", "reason": "Measurement outcomes are interpreted as error syndromes to correct phases" }, { "label": "Fault Tolerance", "reason": "Framework targets early fault-tolerant quantum computing resource constraints" }, { "label": "HHL Algorithm", "reason": "HHL is used as a concrete application example for the MBU protocol" } ], "emoji": "🧹", "social_summary": "Researchers reinterpret quantum uncomputation as an error-correction problem, cutting overhead for early fault-tolerant algorithms like HHL.", "highlights_oneliner": "Uncomputation reframed through quantum error correction" }, { "arxiv_id": "2609.31596", "title": "Oracle Distillation", "authors": "Ruohan Shen, Soonwon Choi", "arxiv_url": "https://arxiv.org/abs/2609.31596", "pdf_url": "https://arxiv.org/pdf/2609.31596", "summary": "This paper introduces oracle distillation, a protocol that distills many noisy queries to an unknown Boolean oracle into a single high-fidelity oracle, using a 'weak query' technique that trades response strength for error correctability. The authors prove near-optimality of the protocol under adversarial and depolarizing noise, and establish a threshold theorem showing that polynomial quantum advantages such as Grover search, $k$-forrelation, and Simon's problem persist below a constant noise threshold.", "motivation": "Quantum learning and sensing algorithms promise provable quantum advantages, but noise threatens to erase these advantages as problem size grows, and traditional quantum error correction only protects known, prescribed operations rather than unknown dynamics. Extending fault-tolerance concepts to protect unknown oracles opens a path toward robust computational sensing and noise-resilient quantum advantage.", "highlights": [ "Introduced 'weak query' technique enabling distillation of unknown Boolean oracles under noise", "Proved a threshold theorem preserving polynomial quantum advantages like Grover search under constant depolarizing noise", "Established a near-matching lower bound showing fundamental tension between distillation and error correctability" ], "keywords": [ { "label": "Oracle Distillation", "reason": "Core novel protocol introduced for purifying noisy unknown oracles" }, { "label": "Grover Search", "reason": "Used as a flagship example of a quantum advantage protected by the protocol" }, { "label": "Threshold Theorem", "reason": "Paper establishes a noise threshold below which quantum advantage survives" }, { "label": "Knill-Laflamme", "reason": "Lower bound relies on Knill-Laflamme conditions for correctable pre-query subspaces" } ], "emoji": "🎯", "social_summary": "A new distillation protocol protects unknown quantum oracles from noise, keeping speedups like Grover search alive below a noise threshold.", "highlights_oneliner": "Distilling noisy unknown oracles to preserve quantum advantage" } ] }, "2026-09-25": { "word_cloud": [ { "word": "Stabilizer", "weight": 4 }, { "word": "Syndrome", "weight": 4 }, { "word": "Golay", "weight": 2 }, { "word": "Magic", "weight": 5 }, { "word": "LDPC", "weight": 5 }, { "word": "NonAbelian", "weight": 3 }, { "word": "Decoder", "weight": 4 }, { "word": "Postselection", "weight": 2 }, { "word": "Cultivation", "weight": 3 }, { "word": "FPGA", "weight": 2 }, { "word": "Compilation", "weight": 3 }, { "word": "Simulation", "weight": 2 }, { "word": "Router", "weight": 3 }, { "word": "Superconducting", "weight": 3 }, { "word": "Distance", "weight": 2 } ], "social_highlights": "Highlights: syndrome-only fault-tolerant T gates, design rules for ultra-high-rate qLDPC codes, magical non-Abelian sheaf codes, decoder mismatch aiding postselection under drift, MagiCFirm speeding magic-state cultivation, recoverability theory for compiled T states, encoded error detection boosting simulated physics, and a reconfigurable router for modular superconducting processors.", "papers": [ { "arxiv_id": "2609.29890", "title": "Syndrome measurements enable deterministic fault-tolerant $T$ gates", "authors": "Kishor Bharti, Tobias Haug, Andrew Tanggara", "arxiv_url": "https://arxiv.org/abs/2609.29890", "pdf_url": "https://arxiv.org/pdf/2609.29890", "summary": "The authors show that releasing a single stabilizer check to expose an ancillary logical qubit within a stabilizer code enables a deterministic, fault-tolerant logical $T$ gate via two Pauli rotations, syndrome measurement, and Clifford feed-forward. They characterize the distance of the intermediate stabilizer code traversed during the gate and show it can grow with the original code distance for pure codes with balanced factorizations. Concrete circuits realize this mechanism with $22$-qubit and Golay-code constructions tolerant to a single fault, requiring at most $33$ or $32$ physical qubits in serial implementations.", "motivation": "The Eastin-Knill theorem forbids universal transversal gate sets, forcing every fault-tolerant architecture to rely on costly mechanisms like magic-state distillation or code switching to realize non-Clifford gates. This work introduces an alternative mechanism based on temporarily released stabilizer checks, offering a new design axis for protecting non-Clifford operations without magic-state consumption.", "highlights": [ "Deterministic logical $T$ gate implemented via syndrome measurement and Clifford feed-forward on any distance-$\\geq 2$ stabilizer code", "Exact characterization of the intermediate code distance during the non-Clifford rotation, growing with the original code distance for pure balanced codes", "Explicit $22$-qubit and Golay-code circuits tolerating a single fault, needing at most $33$ and $32$ physical qubits respectively" ], "keywords": [ { "label": "T Gates", "reason": "The paper's central result is a deterministic fault-tolerant logical $T$ gate construction" }, { "label": "Stabilizer Codes", "reason": "The mechanism applies generally to stabilizer codes of distance at least two" }, { "label": "Syndrome Extraction", "reason": "Syndrome measurement and recovery are the key mediating steps for the non-Clifford gate" }, { "label": "Golay Code", "reason": "A direct Golay-code gate construction is used as a concrete demonstration" } ], "emoji": "🧩", "social_summary": "Researchers show that syndrome measurements alone can implement deterministic fault-tolerant $T$ gates on stabilizer codes.", "highlights_oneliner": "Syndrome-mediated deterministic fault-tolerant $T$ gates" }, { "arxiv_id": "2609.30069", "title": "Design Principles for Ultra-High-Rate Quantum Codes", "authors": "Jong Yeon Lee, Koki Okada, Nishad Maskara, Kenta Kasai, Hengyun Zhou", "arxiv_url": "https://arxiv.org/abs/2609.30069", "pdf_url": "https://arxiv.org/pdf/2609.30069", "summary": "The authors develop a systematic design framework for ultra-high-rate quantum LDPC codes, introducing pair-partition and halving-transformation code templates and identifying column weight as a key parameter controlling the distance-versus-check-weight tradeoff. Applying this framework, they construct compact non-CSS codes such as $[[90,21,11]]$, $[[140,31,15]]$, and $[[200,43,20]]$ with check weight $10$, alongside symmetry-informed strategies for finding low-weight logical operators.", "motivation": "Reducing physical qubit overhead is essential for scalable fault-tolerant quantum computing, and while ultra-high-rate qLDPC codes with rates from $10\\%$ to over $50\\%$ have emerged, no systematic principles existed for navigating tradeoffs among rate, distance, check weight, and blocklength. This work fills that gap by providing design coordinates analogous to classical coding theory's degree distributions.", "highlights": [ "Identification of column weight as a key parameter trading off distance against check weight", "New compact non-CSS codes including $[[90,21,11]]$, $[[140,31,15]]$, and $[[200,43,20]]$ with check weight $10$", "Symmetry-informed strategies for finding low-weight logical bases in ultra-high-rate codes" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The paper focuses on quantum low-density parity-check codes with high encoding rate" }, { "label": "Code Design", "reason": "It develops systematic design principles and templates for navigating code parameter tradeoffs" }, { "label": "Non-CSS Codes", "reason": "The constructed compact codes are explicitly non-CSS" }, { "label": "Logical Operators", "reason": "Symmetry-informed strategies are developed to find low-weight logical bases" } ], "emoji": "📐", "social_summary": "New design principles reveal how column weight shapes the rate-distance tradeoff in ultra-high-rate quantum codes.", "highlights_oneliner": "Systematic design principles for compact high-rate codes" }, { "arxiv_id": "2609.30159", "title": "Non-Abelian sheaf quantum LDPC codes: good and magical", "authors": "Zimu Li, Fuchuan Wei, Zhengyi Han, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2609.30159", "pdf_url": "https://arxiv.org/pdf/2609.30159", "summary": "This work develops a general framework for constructing non-Abelian quantum LDPC codes by gauging sheaf codes via cup products, obtaining families with constant encoding rate and linear distance. The authors establish code distance bounds through a Knill-Laflamme condition combined with expansion and cleaning arguments, and construct an almost-good family whose full code space exhibits long-range magic.", "motivation": "Non-Abelian quantum codes link error correction, exotic phases of matter, and computational resources such as magic, but extending good qLDPC constructions beyond the Pauli stabilizer setting has remained a major challenge. This work advances the no low-energy trivial magic conjecture by demonstrating that gauging is compatible with asymptotically good non-Abelian code parameters.", "highlights": [ "Construction of asymptotically good non-Abelian qLDPC codes via gauging sheaf codes with cup products", "Distance bounds established through the general Knill-Laflamme condition combined with expansion and cleaning", "An almost-good family whose entire code space exhibits long-range magic, and Clifford measurements preparing encoded magic states" ], "keywords": [ { "label": "Non-Abelian Codes", "reason": "The central object of study is non-Abelian quantum LDPC codes" }, { "label": "Magic States", "reason": "The code family is shown to exhibit long-range magic and enable magic state preparation" }, { "label": "Good qLDPC", "reason": "The construction achieves constant rate and linear distance, hallmarks of good qLDPC codes" }, { "label": "Gauging", "reason": "Gauging sheaf codes via cup products is the core construction technique" } ], "emoji": "🌀", "social_summary": "New non-Abelian quantum LDPC codes achieve good parameters while exhibiting long-range magic across the entire code space.", "highlights_oneliner": "Good non-Abelian qLDPC codes with long-range magic" }, { "arxiv_id": "2609.29018", "title": "Decoder Model Compatibility Provides Information beyond the Logical Gap under Drifting and Correlated Quantum Noise", "authors": "Aaron C. Hoyt, Chunshu Wu, Shuwen Kan, Sean Garner, Avimita Chatterjee, Drew Rebar, Norman M. Tubman, Katherine Klymko, Chenxu Liu, Ang Li, Samuel Stein", "arxiv_url": "https://arxiv.org/abs/2609.29018", "pdf_url": "https://arxiv.org/pdf/2609.29018", "summary": "The authors show that mismatch between a decoder's assumed noise model and drifting physical hardware noise carries useful information beyond the standard logical gap confidence metric, and exploit minimum-weight matching weight as a proxy for detector-history surprisal to improve postselection. On IBM repetition-code and Google surface-code and magic-state cultivation data, likelihood-aware postselection substantially reduces retained logical error probability and improves tomography infidelity.", "motivation": "Decoder confidence measures like the logical gap assume an accurate noise model, but real quantum hardware drifts over time, causing miscalibration that limits postselection effectiveness for tasks such as magic-state factories. This work demonstrates that the resulting model mismatch itself is informative and can be harvested cheaply from quantities already computed during decoding.", "highlights": [ "Likelihood-aware postselection cuts retained logical error probability by $10.6\\%$ at $d=7$ and $28.8\\%$ at $d=9$ on IBM repetition codes at $15\\%$ rejection", "Reduces retained logical error probability by $75.4\\%$ on Google $d=5$ XZZX surface-code memory data at $90\\%$ rejection", "Reduces tomography infidelity by $34.7\\%$ in Google's magic-state cultivation experiment with the Tesseract decoder" ], "keywords": [ { "label": "Postselection", "reason": "The paper's method improves postselection efficiency using decoder confidence" }, { "label": "MWPM", "reason": "Minimum-weight perfect matching weight is used as a proxy for syndrome surprisal" }, { "label": "Noise Drift", "reason": "The work addresses miscalibration caused by drifting physical hardware noise" }, { "label": "Magic-State Cultivation", "reason": "The method is applied to Google's magic-state cultivation experiment" } ], "emoji": "📡", "social_summary": "Decoder model mismatch under hardware drift turns out to hold extra clues for smarter quantum error postselection.", "highlights_oneliner": "Exploiting decoder-noise mismatch for better postselection" }, { "arxiv_id": "2609.29267", "title": "MagiCFirm: A Runtime for Magic-State Cultivation with Algorithm-Hardware Co-Design", "authors": "Jubo Xu, Abbas B. Ziad, Prakash Murali, Hongxiang Fan", "arxiv_url": "https://arxiv.org/abs/2609.29267", "pdf_url": "https://arxiv.org/pdf/2609.29267", "summary": "This paper presents MagiCFirm, a configurable classical runtime for magic-state cultivation that combines a two-stage early-escape decoding scheme with dedicated hardware datapaths for detector construction and protocol control. The early-escape scheme performs partial decoding on an offline-selected informative detector subset in parallel with complete decoding, allowing confident attempts to proceed before full decoding finishes.", "motivation": "Magic-state cultivation promises resource-efficient non-Clifford state preparation, but existing FTQC tools treat it as a coarse logical operation without specifying the online runtime and latency-constrained decoding required for practical execution. MagiCFirm bridges this abstraction gap by co-designing algorithms and hardware for real-time cultivation control.", "highlights": [ "Two-stage early-escape decoding scheme combining offline detector selection with parallel partial and complete decoding", "Configurable FPGA-based runtime with microprograms and dedicated datapaths for detector construction and protocol control", "Reduces wall-clock magic-state preparation time by up to $39.3\\%$ at matched logical error rate, yielding $11\\%$ overall application runtime reduction" ], "keywords": [ { "label": "Magic-State Cultivation", "reason": "The paper builds a runtime specifically for the magic-state cultivation protocol" }, { "label": "Real-Time Decoding", "reason": "Latency-constrained partial decoding is central to the early-escape scheme" }, { "label": "FPGA", "reason": "MagiCFirm is implemented as a configurable FPGA-based control runtime" }, { "label": "Co-Design", "reason": "The approach explicitly combines algorithm and hardware co-design" } ], "emoji": "⚙️", "social_summary": "MagiCFirm is a hardware-software runtime that speeds up magic-state cultivation with fast partial decoding and dedicated control logic.", "highlights_oneliner": "Hardware-software runtime accelerating magic-state cultivation" }, { "arxiv_id": "2609.29210", "title": "Representation-Dependent Recoverability in Quantum Compilation", "authors": "Jinze Yang, Yangyang Li, Xiu-Hao Deng", "arxiv_url": "https://arxiv.org/abs/2609.29210", "pdf_url": "https://arxiv.org/pdf/2609.29210", "summary": "This work formalizes how fault-tolerant compilation steps such as schedule splitting, gate synthesis, and randomized compiling change the cost of recovering aggregate phase information downstream, via a two-channel accounting of committed output and crossing state. The authors prove an information-theoretic lower bound relating committed output, crossing-state capacity, and accumulation accuracy, and show a mask-naming entropy toll applies specifically to compilers that commit output early rather than defer or buffer.", "motivation": "Fault-tolerant compilation pipelines disperse high-level phase structure across many representations, and understanding which representations preserve cheap recoverability of aggregate data is important for minimizing downstream resource costs like logical $T$ states. This paper provides the first rigorous framework quantifying this representation-dependent recoverability tradeoff.", "highlights": [ "Proves an information-theoretic lower bound linking committed output, crossing-state cap, and phase accumulation accuracy $\\epsilon$", "Shows a mask-naming entropy toll of $\\log_2\\binom{m}{k}$ applies only to compilers that commit output early, not to buffered or deferred compilers", "Demonstrates a materialize-first pipeline costs orders of magnitude more logical $T$ states and spacetime volume than a semantic-first one under a surface-code model" ], "keywords": [ { "label": "Compilation", "reason": "The paper's core focus is fault-tolerant quantum compilation strategies" }, { "label": "T States", "reason": "The resource cost comparison is measured in terms of logical $T$ state consumption" }, { "label": "Randomized Compiling", "reason": "Randomized compiling is one of the compilation techniques analyzed for recoverability" }, { "label": "Information Theory", "reason": "The bound derivation uses information-theoretic entropy arguments" } ], "emoji": "🗜️", "social_summary": "A new theory shows how compiler choices for fault-tolerant circuits can secretly inflate the cost of recovering phase information.", "highlights_oneliner": "Information-theoretic limits on recoverable compiled phases" }, { "arxiv_id": "2609.28825", "title": "Fundamental Physics at the Frontier of Noisy Quantum Computation", "authors": "Nikita A. Zemlevskiy", "arxiv_url": "https://arxiv.org/abs/2609.28825", "pdf_url": "https://arxiv.org/pdf/2609.28825", "summary": "This thesis advances quantum simulation of fundamental physics through new wavepacket preparation, time evolution, and error mitigation techniques enabling some of the largest simulated circuit volumes to date, including the first quantum evidence for inelastic particle production. It further shows that entanglement and magic probe scattering and hadronization dynamics, and demonstrates that error detection in encoded quantum simulations improves local observable estimation on current hardware relative to unencoded runs.", "motivation": "Quantum computing offers an orthogonal route to studying fundamental physics beyond classical numerics, but realizing this potential requires directly confronting noise through improved algorithms, error mitigation, and early steps toward fault tolerance. This thesis bridges NISQ-era heuristics and fully fault-tolerant operation by demonstrating concrete encoded error detection benefits in a crossover regime.", "highlights": [ "First quantum simulation providing numerical evidence for inelastic particle production in a quantum field theory", "Entanglement and magic shown to probe interactions in scattering and hadronization dynamics beyond mere correlation", "Encoded error detection with fault-tolerant syndrome extraction and non-fault-tolerant logical operations improves local observable estimation on IBM hardware relative to unencoded runs" ], "keywords": [ { "label": "Quantum Simulation", "reason": "The thesis centers on quantum simulation of collisions in quantum field theories" }, { "label": "Error Detection", "reason": "A key contribution is encoded error detection improving observable estimation" }, { "label": "Magic", "reason": "Quantum magic is studied as a probe of scattering and hadronization dynamics" }, { "label": "Error Mitigation", "reason": "New error mitigation techniques underpin the large-scale simulations presented" } ], "emoji": "🔬", "social_summary": "A thesis pushes quantum simulation toward fault tolerance, showing encoded error detection improves physics observables on real hardware.", "highlights_oneliner": "Noisy quantum simulation advances toward fault tolerance" }, { "arxiv_id": "2609.28881", "title": "Reconfigurable bus-based quantum router for modular superconducting processors", "authors": "Benzheng Yuan, chaojie Zhang, Yangyang Fei, Chuanbing Han, Haoran He, Huihui Sun, Bo Zhao, Fudong Liu, Weilong Wang, Zheng Shan", "arxiv_url": "https://arxiv.org/abs/2609.28881", "pdf_url": "https://arxiv.org/pdf/2609.28881", "summary": "The authors introduce a bus-based reconfigurable quantum router using flux-tunable SQUID couplers that connect interface qubits to two shared buses, enabling destructive interference to suppress idle interactions while supporting two parallel disjoint CZ gates. Hamiltonian simulations show parallel-gate errors near $10^{-3}$, and hardware-aware compilation shows the router reduces median SWAP count by up to $34\\%$ and native CZ count by up to $20\\%$ on 36-qubit benchmark circuits.", "motivation": "Scaling superconducting quantum processors is bottlenecked by limited nearest-neighbor connectivity, which forces costly SWAP networks for non-local interactions and inflates circuit depth and error accumulation. This work addresses that bottleneck by proposing a compiler-visible hardware router that provides non-local connectivity with schedulable parallel entangling operations.", "highlights": [ "Full-system Hamiltonian simulations achieve parallel-gate errors at the level of $10^{-3}$", "Reduces median SWAP count by up to $34\\%$ and native CZ count by up to $20\\%$ relative to a matched 2D grid on 36-qubit circuits", "Demonstrates circuit-dependent depth reduction, reaching $20\\%$ for QAOA-MaxCut but negligible for QFT" ], "keywords": [ { "label": "Quantum Router", "reason": "The paper's core contribution is a reconfigurable bus-based quantum router" }, { "label": "Superconducting Qubits", "reason": "The router is designed for modular superconducting quantum processors" }, { "label": "SQUID Couplers", "reason": "Flux-tunable SQUID couplers are the physical mechanism enabling the router" }, { "label": "Compilation", "reason": "Hardware-aware compilation and scheduling are used to evaluate circuit-level benefits" } ], "emoji": "🔀", "social_summary": "A new reconfigurable bus router lets superconducting qubits swap fewer gates and run parallel entangling operations across modules.", "highlights_oneliner": "Bus-based router boosts modular superconducting connectivity" } ] }, "2026-09-24": { "word_cloud": [ { "word": "GKP", "weight": 5 }, { "word": "LDPC", "weight": 5 }, { "word": "Fluxonium", "weight": 3 }, { "word": "Decoders", "weight": 4 }, { "word": "Transversal", "weight": 3 }, { "word": "Bosonic", "weight": 3 }, { "word": "Fluxonium", "weight": 1 }, { "word": "Tanner", "weight": 2 }, { "word": "Overhead", "weight": 4 }, { "word": "MagicState", "weight": 3 }, { "word": "Cat", "weight": 2 }, { "word": "Bell", "weight": 2 }, { "word": "Sheaf", "weight": 2 }, { "word": "TopologicalOrder", "weight": 2 }, { "word": "Security", "weight": 2 } ], "social_highlights": "Highlights: planar fluxonium GKP chip debuts, soft beam-search decoding doubles ion qubit lifetimes, near-optimal LDPC surgery gadgets emerge, cup products enable cheap transversal non-Clifford gates, logarithmic-time constant-overhead fault tolerance achieved, cubical sheaf complexes yield good qLTCs, decoder-prior poisoning attack and defense revealed, distinguishability threatens monolithic QEC, Gaussian states mapped to GKP logic, GKP/cat states near-optimal Bell nonlocality shown, transparent domain walls found via entanglement bootstrap.", "papers": [ { "arxiv_id": "2609.26880", "title": "Bosonic Error Correction with Fluxonium", "authors": "Shantanu R. Jha, Shoumik D. Chowdhury, Gabriele Rolleri, Anaida Ali, Lev-Arcady Sellem, Réouven Assouly, David Pahl, Lukas Pahl, Junyoung An, Farid Hassani, Hung-Yu Tsao, Chia-Chin Tsai, Aranya Goswami, Jeremie Boudreault, Jeffrey M. Gertler, Michael A. Gingras, Bethany M. Niedzielski, Jeffrey M. Knecht, Mollie E. Schwartz, Kyle Serniak, Jeffrey A. Grover, Baptiste Royer, Max Hays, William D. Oliver", "arxiv_url": "https://arxiv.org/abs/2609.26880", "pdf_url": "https://arxiv.org/pdf/2609.26880", "summary": "The authors realize bosonic quantum error correction in a fully planar superconducting circuit architecture, pairing a heavy fluxonium qubit with a bit-flip lifetime of $451 \\pm 70~\\mu\\text{s}$ to an on-chip Archimedean spiral resonator. They prepare finite-energy Gottesman-Kitaev-Preskill (GKP) states and stabilize them via measurement-free error correction with rapid fluxonium reset, extending the logical lifetime by a factor of $1.59 \\pm 0.05$.", "motivation": "Prior bosonic QEC demonstrations relied on hybrid architectures combining bulky 3D microwave cavities with fixed-frequency transmons, whose bit-flip errors limited logical lifetimes. This work matters because it shows that a compact, fully planar architecture with a long-lived fluxonium control qubit can achieve standalone bosonic error correction, opening a path toward scalable hardware-efficient fault tolerance.", "highlights": [ "First fully planar superconducting realization of bosonic QEC without 3D cavities", "Heavy fluxonium control qubit achieves $451 \\pm 70~\\mu\\text{s}$ bit-flip lifetime, exceeding prior control qubits", "Measurement-free GKP error correction extends logical lifetime by factor $1.59 \\pm 0.05$" ], "keywords": [ { "label": "GKP Codes", "reason": "The paper stabilizes finite-energy Gottesman-Kitaev-Preskill states as the bosonic code under study" }, { "label": "Fluxonium", "reason": "Uses a heavy fluxonium qubit as the long-lived control qubit for the bosonic mode" }, { "label": "Planar Architecture", "reason": "Demonstrates the first standalone bosonic QEC using a fully planar on-chip resonator rather than 3D cavities" }, { "label": "Bit-flip Errors", "reason": "Central metric improved via long fluxonium coherence to reduce dominant error channel" } ], "emoji": "📡", "social_summary": "Researchers built the first fully planar bosonic quantum error correction chip using a long-lived fluxonium qubit to stabilize GKP states.", "highlights_oneliner": "Planar chip realizes bosonic QEC via fluxonium" }, { "arxiv_id": "2609.26958", "title": "Soft decoding for quantum LDPC codes with experimental validation", "authors": "Arda Aydin, Edwin Tham, Nicolas Delfosse, Min Ye", "arxiv_url": "https://arxiv.org/abs/2609.26958", "pdf_url": "https://arxiv.org/pdf/2609.26958", "summary": "The authors introduce a soft beam search decoder for quantum LDPC codes that leverages internal decoder data as a confidence score without extra computation, enabling post-selection to boost logical performance. Circuit-level simulations across five qLDPC codes show up to $580\\times$ logical-error suppression at physical error rate $10^{-3}$ while rejecting only $0.1\\%$ of shots, and application to trapped-ion memory experiments doubles logical qubit lifetimes.", "motivation": "Post-selection has long improved fault-tolerant protocols by discarding unreliable outcomes, but existing confidence measures for qLDPC decoders often require significant extra computation. This soft decoder matters because it provides a computationally cheap confidence metric that brings real trapped-ion qLDPC experiments into the beyond-breakeven regime.", "highlights": [ "Up to $580\\times$ logical-error suppression at $p=10^{-3}$ with only $0.1\\%$ shot rejection", "Streaming variant achieves $210\\times$ error suppression for error-detected measurements in walking cat architecture", "Doubles logical qubit lifetimes in trapped-ion experiments, achieving beyond-breakeven for all five codes tested" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The decoder targets quantum low-density parity-check codes relevant to superconducting and trapped-ion platforms" }, { "label": "Soft Decoding", "reason": "Introduces confidence-score-based decoding to enable effective post-selection" }, { "label": "Beam Search", "reason": "Builds on and extends the beam search decoder combined with belief propagation" }, { "label": "Post-selection", "reason": "Central technique used to discard low-confidence shots and improve logical error rates" } ], "emoji": "🎯", "social_summary": "A new soft beam search decoder doubles trapped-ion logical qubit lifetimes by flagging unreliable shots almost for free.", "highlights_oneliner": "Confidence-aware decoding boosts qLDPC performance" }, { "arxiv_id": "2609.26973", "title": "Near-optimal high-rate surgery from linear PCPPs", "authors": "Alexander Cowtan, Benjamin Ide", "arxiv_url": "https://arxiv.org/abs/2609.26973", "pdf_url": "https://arxiv.org/pdf/2609.26973", "summary": "The authors introduce a general method for constructing high-rate surgery gadgets for quantum LDPC codes that measure large sets of logical operators in parallel while preserving sparsity and fault distance. Given an $[[n,k,d]]$ CSS code and a subcode of size $\\mu \\le n$ containing $t \\le k$ logicals, their gadget has size $\\mu^{1+o(1)}$, nearly matching the $\\Omega(\\mu)$ lower bound, and is built by relating surgery gadgets to linear Probabilistically Checkable Proofs of Proximity.", "motivation": "Lattice surgery generalized to LDPC codes promises low-overhead fault-tolerant computation, but past constructions traded off space efficiency against time efficiency in worst-case scenarios. This work matters because it achieves near-optimal space overhead for parallel logical measurements using a novel connection between code expansion and PCPP theory.", "highlights": [ "Surgery gadget size scales as $\\mu^{1+o(1)} = \\mu(\\log\\mu)^{O(\\log\\log\\mu)}$, nearly matching the $\\Omega(\\mu)$ lower bound", "Gadgets preserve phenomenological fault distance $d$ when performed for $d$ rounds", "Establishes new connection between relative cosystolic expansion and linear PCPPs for surgery gadget design" ], "keywords": [ { "label": "LDPC Surgery", "reason": "Focuses on designing surgery gadgets for lattice surgery on quantum LDPC codes" }, { "label": "CSS Codes", "reason": "The construction operates on arbitrary $[[n,k,d]]$ CSS codes and their subcodes" }, { "label": "PCPPs", "reason": "Uses linear Probabilistically Checkable Proofs of Proximity as the core theoretical tool" }, { "label": "Cosystolic Expansion", "reason": "Relates surgery gadget properties to relative cosystolic expansion for fault distance guarantees" } ], "emoji": "🔧", "social_summary": "New surgery gadgets let quantum LDPC codes measure many logical operators in parallel with near-optimal overhead.", "highlights_oneliner": "Near-optimal parallel logical measurement gadgets" }, { "arxiv_id": "2609.27801", "title": "Improved Transversal Non-Clifford Gates from Cup Products", "authors": "Louis Golowich, Itzhak Tamo, Guanyu Zhu", "arxiv_url": "https://arxiv.org/abs/2609.27801", "pdf_url": "https://arxiv.org/pdf/2609.27801", "summary": "The authors construct quantum LDPC codes with constant-weight stabilizers supporting transversal $C^{r-1}Z$ non-Clifford gates for every constant $r \\ge 3$, achieving length-$n$ codes with distance $d \\ge n^{(1-\\epsilon)/r}$ and $k \\ge n^{1-\\epsilon}$ disjoint logical tuples. They develop a general cup-product-based transformation mapping classical codes with a multiplication property to quantum codes with transversal $C^{r-1}Z$, applied to a new family of classical Tanner codes from punctured tensor products of algebraic codes.", "motivation": "Non-Clifford gates are a major bottleneck for fault-tolerant quantum computation, and prior constant-weight-stabilizer constructions could not simultaneously achieve high distance and high logical gate count. This work matters because it is the first constant-weight-stabilizer construction achieving $dk \\gg n$, yielding arbitrarily small magic state overhead exponent.", "highlights": [ "First constant-weight-stabilizer codes achieving $dk \\gg n$ for transversal $C^{r-1}Z$ gates", "Arbitrarily small magic state overhead exponent $\\gamma = \\log(n/k)/\\log(d) > 0$ achieved", "Supports addressing of specific logical qubits and a linear-$k$ variant with $n^\\epsilon$ stabilizer weight" ], "keywords": [ { "label": "Transversal Gates", "reason": "Central result concerns transversal implementations of the non-Clifford $C^{r-1}Z$ gate" }, { "label": "Cup Products", "reason": "Core technical tool mapping classical codes to quantum codes via cup product structure" }, { "label": "Tanner Codes", "reason": "Uses a new family of classical Tanner codes built from punctured tensor products of algebraic codes" }, { "label": "Magic State Overhead", "reason": "Result quantified via the magic state overhead exponent $\\gamma$" } ], "emoji": "🪄", "social_summary": "New quantum LDPC codes enable efficient transversal non-Clifford gates with arbitrarily small magic state overhead.", "highlights_oneliner": "Cup products yield efficient transversal magic gates" }, { "arxiv_id": "2609.28461", "title": "Purely-logarithmic-time- and constant-space-overhead fault-tolerant quantum computation", "authors": "Zhengyi Han, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2609.28461", "pdf_url": "https://arxiv.org/pdf/2609.28461", "summary": "The authors prove that constant-space-overhead fault-tolerant quantum computation can be achieved with strictly logarithmic time overhead, improving on prior results that had additional subpolylogarithmic factors. Their main construction uses polynomial-subrank transversal logical $CCZ$ gates on good quantum locally testable codes, transferring logical qubit batches between storage and active subspaces, with an alternative construction modifying Reed-Solomon magic-state distillation.", "motivation": "Concatenated codes achieve fault tolerance with polylogarithmic overhead in both space and time, and a series of works progressively reduced time overhead toward logarithmic scale using qLDPC and qLTC codes. This work matters because it closes the remaining gap, achieving the theoretically minimal logarithmic time overhead while keeping space overhead constant.", "highlights": [ "Achieves strictly logarithmic time overhead, eliminating subpolylogarithmic factors of prior work", "Main construction directly implements non-Clifford gates via transversal $CCZ$ on good qLTCs", "Alternative construction recursively applies Reed-Solomon magic-state distillation to also reach logarithmic time overhead" ], "keywords": [ { "label": "qLTCs", "reason": "Construction relies on good quantum locally testable codes with transversal $CCZ$ gates" }, { "label": "Time Overhead", "reason": "Central metric being optimized to strictly logarithmic scaling" }, { "label": "Magic State Distillation", "reason": "Alternative construction based on modifying Reed-Solomon magic-state distillation scheme" }, { "label": "CCZ Gate", "reason": "Non-Clifford gate implemented transversally as the key computational primitive" } ], "emoji": "⏱️", "social_summary": "New fault-tolerance schemes achieve constant space overhead with the theoretically minimal logarithmic time overhead.", "highlights_oneliner": "Logarithmic-time fault tolerance with constant space" }, { "arxiv_id": "2609.28028", "title": "Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs", "authors": "Yeyuan Chen, Miryam Mi-Ying Huang, Yinchen Liu, Er-Cheng Tang", "arxiv_url": "https://arxiv.org/abs/2609.28028", "pdf_url": "https://arxiv.org/pdf/2609.28028", "summary": "The authors construct $r$-dimensional cubical sheaf complexes whose degree-$k$ CSS codes achieve positive constant rate, linear distance, and constant soundness with bounded row and column weights, for every fixed $r \\ge 4$ and $2 \\le k \\le r-2$. Setting $r=4$, $k=2$ yields a family of asymptotically good binary quantum locally testable codes, built on a uniform product-expansion theorem for explicit Reed-Solomon codes with bounded expansion constant.", "motivation": "Quantum locally testable codes with good parameters are a key open problem for both theoretical fault-tolerance and code testability, following the local-to-global framework of Dinur, Lin, and Vidick. This work matters because it provides explicit, polynomial-time computable constructions of asymptotically good qLTCs using new algebraic expansion results.", "highlights": [ "First explicit cubical sheaf complexes achieving constant expansion for both the sheaf and its dual", "Yields asymptotically good binary qLTCs at $r=4$, $k=2$ with linear distance and constant soundness", "Uniform product-expansion theorem for Reed-Solomon codes keeps expansion constant bounded away from zero" ], "keywords": [ { "label": "qLTCs", "reason": "Main result is a family of asymptotically good quantum locally testable codes" }, { "label": "Sheaf Complexes", "reason": "Construction is based on cubical sheaf complexes as the underlying combinatorial structure" }, { "label": "Reed-Solomon Codes", "reason": "Product-expansion theorem for explicit Reed-Solomon codes on norm-one evaluation sets underlies the construction" }, { "label": "Local-to-Global", "reason": "Uses the Dinur-Lin-Vidick local-to-global framework to derive distance and soundness" } ], "emoji": "🧩", "social_summary": "New algebraic geometry techniques yield explicit, asymptotically good quantum locally testable codes.", "highlights_oneliner": "Explicit good qLTCs via cubical sheaf complexes" }, { "arxiv_id": "2609.27805", "title": "Decoder-Prior Poisoning in Quantum Error Correction: Attacks and PriorGuard Defense", "authors": "Xinyi Li, Yifeng Peng, Juntao Chen, Ying Wang", "arxiv_url": "https://arxiv.org/abs/2609.27805", "pdf_url": "https://arxiv.org/pdf/2609.27805", "summary": "The authors identify the prior-update path in calibration-aware surface-code decoders as an overlooked attack surface, showing that poisoning just $6.4\\%$ of decoder-prior entries can raise the logical error rate by $3.35\\times$ without altering the syndrome stream. They introduce PriorGuard, a lightweight semantic guard that validates proposed prior updates against private syndrome-derived evidence and falls back to the last trusted prior when unsupported.", "motivation": "Modern surface-code decoders increasingly rely on calibration-derived priors for matching-graph edge probabilities, but this update channel has been treated purely as an accuracy-tuning mechanism rather than a security boundary. This matters because such priors can be maliciously manipulated to corrupt decoding decisions in ways that raw syndrome-anomaly detection would miss.", "highlights": [ "Top $10\\%$ of prior entries carry over $60\\%$ of positive logical-error influence, enabling targeted poisoning", "Poisoning only $6.4\\%$ of decoder-prior entries raises logical error rate by $3.35\\times$", "PriorGuard recovers most attack-induced loss with low false positives and about $1.7$-$1.8$ ms overhead per update" ], "keywords": [ { "label": "Decoder Security", "reason": "Paper introduces a novel attack surface targeting decoder calibration priors in QEC systems" }, { "label": "Surface Codes", "reason": "Experiments use Stim-generated rotated surface-code memory circuits" }, { "label": "Matching Decoders", "reason": "Attack and defense target matching-graph edge probabilities used by PyMatching-based decoders" }, { "label": "Anomaly Detection", "reason": "PriorGuard defense validates prior updates against syndrome-derived evidence to detect poisoning" } ], "emoji": "🛡️", "social_summary": "Researchers reveal a hidden attack on quantum decoder calibration priors and build PriorGuard to defend against it.", "highlights_oneliner": "Guarding surface-code decoders from prior poisoning" }, { "arxiv_id": "2609.26946", "title": "Monolithic Quantum Error Correction in the Presence of Distinguishability", "authors": "Shubham P. Jain, Eric R. Hudson, Wesley C. Campbell, Alexey V. Gorshkov, Victor V. Albert", "arxiv_url": "https://arxiv.org/abs/2609.26946", "pdf_url": "https://arxiv.org/pdf/2609.26946", "summary": "The authors study how residual Zeeman, Stark, or anharmonic interactions make error processes distinguishable, weakening the conditions for perfect quantum error recovery, using an analytically solvable four-level model and a canonical spontaneous-emission noise model for atoms and molecules. They show that distinguishability raises the effective Kraus rank of the noise channel and sets an operational checking time that shortens as the emitted-photon frequency separation increases, with rapid syndrome checking able to restore near-perfect recovery.", "motivation": "Perfect quantum error correction relies on the Knill-Laflamme conditions, which assume errors act indistinguishably on different codewords, but practical atomic and molecular systems have residual level shifts that break this assumption. This work matters because it quantifies exactly how fast syndrome extraction must occur to counteract distinguishability, providing a concrete design constraint for monolithic QEC in atomic and molecular platforms.", "highlights": [ "Establishes a canonical angular-momentum spontaneous-emission noise model as a benchmark for atomic and molecular QEC", "Shows distinguishability raises effective Kraus rank and lowers recovered fidelity, degrading Knill-Laflamme conditions", "Derives an operational checking time that shortens as photon frequency separation increases, guiding fast syndrome extraction" ], "keywords": [ { "label": "Knill-Laflamme", "reason": "Paper analyzes how distinguishability weakens the standard Knill-Laflamme recovery conditions" }, { "label": "Spontaneous Emission", "reason": "Uses a canonical spontaneous-emission noise model tailored to atoms and molecules" }, { "label": "Approximate QEC", "reason": "Frames degeneracy lifting and distinguishability within the language of approximate quantum error correction" }, { "label": "Syndrome Checking", "reason": "Identifies fast syndrome extraction timing as the key mitigation strategy for distinguishability" } ], "emoji": "🔬", "social_summary": "Physicists show that tiny energy-level shifts in atoms and molecules can leak quantum error information, demanding faster error checks.", "highlights_oneliner": "Distinguishable decays limit atomic QEC fidelity" }, { "arxiv_id": "2609.26898", "title": "The logical set of Gaussian states under the stabilizer subsystem decomposition", "authors": "Santiago Zamora, Kaustav Chatterjee, Ulrik Lund Andersen, Thiago Lucena de Macedo Guedes, Jonatan Bohr Brask, A. de Oliveira Junior, Rafael Chaves", "arxiv_url": "https://arxiv.org/abs/2609.26898", "pdf_url": "https://arxiv.org/pdf/2609.26898", "summary": "The authors characterize the image of single-mode Gaussian states under the stabilizer subsystem decomposition extraction channel used to map continuous-variable states into the GKP logical subspace. They derive series expressions for the logical Bloch vector, characterize the reachable set of logical qubit states, and use this geometric picture to bound the robustness of magic. They further translate a discrete-variable qubit witness into a continuous-variable squeezing witness, enabling certification of non-stabilizer 'set-magic' and cryptographic randomness from ensembles of Gaussian states.", "motivation": "Universal quantum computation requires non-Gaussianity in continuous-variable encodings and non-stabilizerness in discrete-variable encodings, yet how the underlying Gaussian continuous-variable structure translates into discrete logical resources under GKP-type encodings has remained poorly understood. Clarifying this mapping is important for designing practical certification protocols for magic and squeezing resources in near-term bosonic hardware.", "highlights": [ "Derived analytical series expressions for the logical Bloch vector reachable from single-mode Gaussian states under stabilizer subsystem decomposition", "Mapped a discrete-variable stabilizer witness to a continuous-variable squeezing witness, yielding experimentally usable lower bounds on squeezing", "Showed ensembles of Gaussian states can violate both stabilizer and classical bounds, certifying 'set-magic' and cryptographic randomness" ], "keywords": [ { "label": "GKP Encoding", "reason": "The paper studies mapping Gaussian states into the Gottesman-Kitaev-Preskill logical qubit subspace" }, { "label": "Magic States", "reason": "Analyzes robustness of magic and non-stabilizerness of logical states derived from Gaussian resources" }, { "label": "Squeezing Witness", "reason": "Constructs a continuous-variable squeezing witness derived from discrete-variable stabilizer witnesses" }, { "label": "Continuous Variable", "reason": "Focuses on single-mode Gaussian states and their continuous-variable structure under extraction channels" } ], "emoji": "🌊", "social_summary": "Maps Gaussian continuous-variable states into GKP logical qubits to certify magic, squeezing, and cryptographic randomness.", "highlights_oneliner": "Gaussian states mapped to GKP logical magic resources" }, { "arxiv_id": "2609.27640", "title": "Near-Optimal Bell Nonlocality with GKP and Entangled Cat States", "authors": "Özlem Erkılıç, Aritra Das, S. Nibedita Swain, Simon Devitt, Timothy C. Ralph", "arxiv_url": "https://arxiv.org/abs/2609.27640", "pdf_url": "https://arxiv.org/pdf/2609.27640", "summary": "The authors study Bell nonlocality in finite-energy GKP Bell states under realistic optical measurement constraints, showing that logical Pauli measurements alone cannot reveal nonlocality achievable at low squeezing. They demonstrate that photon-number-resolving detection combined with Gaussian preprocessing and adaptive feed-forward can closely approach the maximum CHSH violation without requiring logical non-Clifford gates, and that this measurement strategy also strongly enhances Bell violations for cat-code and entangled coherent states.", "motivation": "GKP states are a leading bosonic encoding for fault-tolerant quantum computing, but the high squeezing levels required for full fault tolerance remain experimentally unavailable, motivating the search for useful quantum-information tasks achievable with today's finite-squeezing resources. Bell nonlocality underlies device-independent protocols such as self-testing, DI-QKD, and randomness certification, making practical routes to revealing it in bosonic states of high experimental relevance.", "highlights": [ "Showed finite-energy GKP Bell states support Bell nonlocality even at low squeezing, but logical Pauli measurements alone fail to reveal it", "Demonstrated photon-number-resolving detection with Gaussian preprocessing and feed-forward nearly achieves maximum CHSH violation without non-Clifford logical gates", "Extended the non-Gaussian measurement strategy to strongly enhance Bell violations in cat-code and entangled coherent states" ], "keywords": [ { "label": "GKP Codes", "reason": "Studies Bell nonlocality of finite-energy GKP Bell states under realistic squeezing" }, { "label": "Cat Codes", "reason": "Applies the non-Gaussian measurement strategy to entangled cat-code and coherent states" }, { "label": "Bell Nonlocality", "reason": "Central focus is quantifying and maximizing CHSH inequality violations" }, { "label": "Photon Counting", "reason": "Uses photon-number-resolving detection as the key non-Gaussian measurement resource" } ], "emoji": "🐱", "social_summary": "Shows photon-counting measurements let finite-squeezing GKP and cat states nearly reach maximal Bell nonlocality without fancy gates.", "highlights_oneliner": "Photon counting unlocks near-optimal Bell violations in bosonic codes" }, { "arxiv_id": "2609.26892", "title": "Transparent Domain Walls through Information Convex Sets", "authors": "Jintae Kim, Amanda Gatto Lamas, Jacopo Gliozzi, Bowen Shi, Taylor L. Hughes, Jong Yeon Lee", "arxiv_url": "https://arxiv.org/abs/2609.26892", "pdf_url": "https://arxiv.org/pdf/2609.26892", "summary": "The authors develop an entanglement-bootstrap framework based on information convex sets on local and noncontractible annuli to extract data about transparent domain walls directly from ground-state wavefunctions of Abelian topological phases on a torus, without assuming categorical defect data. They derive fusion rules for anyon action on extreme points of these convex sets, relate minimum entropy states to ground state degeneracy, and characterize maximal topological entanglement entropy and entanglement asymmetry as distinct probes of transparent wall effects, applying the framework to Wen's plaquette model, the anisotropic dipolar toric code, and the rank-2 toric code.", "motivation": "Transparent domain walls are a subtle class of gapped domain walls that evade local topological diagnostics yet can modify ground state degeneracy and permute anyons around noncontractible loops, making them difficult to detect or characterize using conventional methods. Developing an entanglement-based, model-agnostic diagnostic is important for systematically identifying and classifying such elusive topological defects in many-body wavefunctions.", "highlights": [ "Derived fusion rules and quantum dimensions for anyon action on extreme points of information convex sets on noncontractible annuli", "Showed extreme points invariant under transport correspond one-to-one to minimum entropy states, with their count equal to the ground state degeneracy", "Identified symmetries jointly supported on two fundamental cycles that cannot decompose into separate 1-form symmetry operators, linked to transparent domain walls" ], "keywords": [ { "label": "Topological Order", "reason": "Studies (2+1)D Abelian topological phases and their ground state structure" }, { "label": "Domain Walls", "reason": "Focuses specifically on transparent gapped domain walls invisible to local probes" }, { "label": "Entanglement Bootstrap", "reason": "Uses the information convex set framework, a key entanglement bootstrap tool" }, { "label": "Toric Code", "reason": "Applies the framework to Wen's plaquette model, dipolar and rank-2 toric codes" } ], "emoji": "🌀", "social_summary": "Reveals hidden transparent domain walls in topological phases using entanglement data from ground-state wavefunctions alone.", "highlights_oneliner": "Detecting invisible domain walls via entanglement convex sets" } ] }, "2026-09-23": { "word_cloud": [ { "word": "Lattice", "weight": 5 }, { "word": "Surgery", "weight": 4 }, { "word": "Testable", "weight": 4 }, { "word": "Transversal", "weight": 3 }, { "word": "Bosonic", "weight": 3 }, { "word": "Distributed", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "Expanders", "weight": 2 }, { "word": "Concatenation", "weight": 2 }, { "word": "Tensor", "weight": 2 }, { "word": "Floquet", "weight": 2 }, { "word": "Decoherence", "weight": 2 }, { "word": "Reset", "weight": 2 }, { "word": "Complexity", "weight": 2 }, { "word": "Syndrome", "weight": 2 } ], "social_highlights": "Highlights: transversal non-Clifford gates via covering spaces, product-expansion locally testable codes, distributed lattice surgery seam construction, hook-error suppression in heterogeneous lattice surgery, asymmetric Iceberg code concatenation, covariant bosonic code framework, Floquet monitored Clifford circuit transitions, tensor network simulation of dynamic circuits, Bayesian adaptive qubit reset, QMA-hardness of decoherence-free subspace detection.", "papers": [ { "arxiv_id": "2609.26691", "title": "Transversal non-Clifford gates on good quantum locally testable codes", "authors": "Yiming Li, Zimu Li, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2609.26691", "pdf_url": "https://arxiv.org/pdf/2609.26691", "summary": "The authors construct asymptotically good quantum locally testable codes (qLTCs) that simultaneously support nontrivial transversal logical multi-controlled-$Z$ gates, using a covering space method to build a nonzero cup product pairing on a finite arithmetic cubical complex. They prove polynomial nonvanishing of this pairing via a bipartite multigraph specialization expressed through Moore determinants, then pull back the pairing to a covering-space qLTC family to realize the transversal non-Clifford logical action.", "motivation": "Non-Clifford gates are essential for universal fault-tolerant quantum computation, yet achieving them transversally while retaining optimal code parameters has been an open challenge since the advent of good qLDPC and qLTC constructions. This work closes part of that gap by showing compatibility between local testability, good asymptotic parameters, and useful non-Clifford transversal logic.", "highlights": [ "Achieves nontrivial transversal multi-controlled-$Z$ gates on asymptotically good qLDPC and qLTC codes simultaneously", "Introduces a covering space method to build nonzero cup product pairings on arithmetic cubical complexes", "Proves polynomial nonvanishing of the pairing via bipartite multigraph specialization and Moore determinants" ], "keywords": [ { "label": "qLTC", "reason": "The paper's central object is quantum locally testable codes with good parameters" }, { "label": "Transversal Gates", "reason": "The main contribution is nontrivial transversal non-Clifford logical gates" }, { "label": "Cup Product", "reason": "The construction relies on a nonzero cup product pairing on cubical complexes" }, { "label": "Covering Spaces", "reason": "Covering space methods are used to build the asymptotic code family" } ], "emoji": "🧮", "social_summary": "Researchers achieve transversal non-Clifford gates on asymptotically good quantum locally testable codes using covering space topology.", "highlights_oneliner": "Transversal non-Clifford gates meet good qLTCs" }, { "arxiv_id": "2609.26735", "title": "Good Quantum Locally Testable Codes from Product Expansion", "authors": "Mitali Bafna, Anqi Li, Quynh T. Nguyen", "arxiv_url": "https://arxiv.org/abs/2609.26735", "pdf_url": "https://arxiv.org/pdf/2609.26735", "summary": "The authors construct quantum locally testable codes with constant rate, distance, soundness, and locality, conditional on a variant of a product expansion conjecture for Reed-Solomon codes. They instantiate the high-dimensional expansion framework of Dinur, Lin, and Vidick using non-Abelian cubical complexes equipped with symmetry-compatible Reed-Solomon local codes.", "motivation": "Good locally testable codes and good quantum LDPC codes were both resolved using high-dimensional expansion techniques, but combining strong local testability with good quantum code parameters remains a key open problem in coding theory. This work advances that goal by leveraging product expansion properties of Reed-Solomon codes within a carefully symmetric cubical complex.", "highlights": [ "Constructs quantum LTCs with constant rate, distance, soundness, and locality under a product expansion conjecture", "Uses non-Abelian cubical complexes of Rungtanapirom, Stix, and Vdovina as the underlying high-dimensional expander", "Selects Reed-Solomon local codes whose symmetries match the complex to enable product expansion in the high-rate regime" ], "keywords": [ { "label": "qLTC", "reason": "The paper constructs quantum locally testable codes with good parameters" }, { "label": "Product Expansion", "reason": "The construction depends on a product expansion conjecture for Reed-Solomon codes" }, { "label": "High-Dim Expanders", "reason": "Uses the Dinur-Lin-Vidick framework based on high-dimensional expansion" }, { "label": "Reed-Solomon", "reason": "Local codes are chosen as symmetric Reed-Solomon codes over projective lines" } ], "emoji": "🔗", "social_summary": "New quantum locally testable codes emerge from product-expanding Reed-Solomon codes on symmetric cubical complexes.", "highlights_oneliner": "Good qLTCs via Reed-Solomon product expansion" }, { "arxiv_id": "2609.26736", "title": "A Syndrome-Extraction Framework for Distributed Lattice Surgery on Arbitrary Rotated Surface-Code Layouts", "authors": "Pritesh Thakur, Daniel Dilley, Zain Saleem", "arxiv_url": "https://arxiv.org/abs/2609.26736", "pdf_url": "https://arxiv.org/pdf/2609.26736", "summary": "The authors introduce a seam construction that splits arbitrary merged rotated surface-code layouts into smaller uniform-boundary patches, each retaining its own hook-avoiding N/Z schedule, while splitting weight-4 stabilizers into Bell-pair-mediated weight-2 measurements at the seam using three-qubit $CXX$ gates within CNOT depth 4. They also provide a custom detector annotator for these seams compatible with matching decoders, demonstrating lower and more stable logical error rates across a range of elevated link error rates compared to existing hook-avoiding schemes.", "motivation": "Modular quantum computing requires inter-module lattice surgery, but noisy inter-QPU gates and multi-directional hook errors threaten fault distance, and existing schedules trade off circuit depth against error propagation into the bulk. Confining elevated link errors to the seam while preserving minimal-depth syndrome extraction is crucial for realizing scalable distributed fault-tolerant architectures.", "highlights": [ "Introduces a seam construction splitting weight-4 stabilizers into Bell-pair-mediated weight-2 measurements within CNOT depth 4", "Uses three-qubit $CXX$ gates for seam parity measurements to preserve minimum circuit depth", "Achieves lowest and most stable logical error rate across link error rates from $10\\times$ to $100\\times$ bulk error rate" ], "keywords": [ { "label": "Lattice Surgery", "reason": "The paper's core contribution is a distributed lattice surgery framework" }, { "label": "Surface Codes", "reason": "Built on rotated surface-code patch layouts" }, { "label": "Hook Errors", "reason": "Addresses hook error propagation across merged code boundaries" }, { "label": "Modular QC", "reason": "Targets modular quantum computing with inter-module gates" } ], "emoji": "🧵", "social_summary": "A new seam construction confines noisy inter-module errors and stabilizes distributed lattice surgery on surface codes.", "highlights_oneliner": "Seam-based distributed lattice surgery framework" }, { "arxiv_id": "2609.26784", "title": "Error Suppression in Distributed Quantum Computing with Heterogeneous-Distance Lattice Surgery", "authors": "Daniel Dilley, Anastashia Jebraeilli, Rayat Roy, Shobhit Gupta, Alvin Gonzales, Zain Saleem", "arxiv_url": "https://arxiv.org/abs/2609.26784", "pdf_url": "https://arxiv.org/pdf/2609.26784", "summary": "The authors propose an eight-data-patch ancilla-mediated (8-DAM) architecture for distributed lattice surgery, enlarging only the central inter-QPU ancilla while keeping data patches at distance $d$, using traveling stabilizers to suppress hook errors during merge and split operations. Circuit-level simulations show logical error rates weakly dependent on link noise and comparable suppression to uniform-distance implementations with reduced physical-qubit overhead, including support for simultaneous distributed logical CNOTs.", "motivation": "Distributed quantum computing suffers from noisier inter-QPU links, and naively increasing code distance everywhere to compensate inflates qubit overhead across all data patches. Selectively enlarging only the noisy interface offers a resource-efficient alternative that is increasingly important as modular architectures scale.", "highlights": [ "Introduces the 8-DAM architecture enlarging only the inter-QPU ancilla while keeping data patches at distance $d$", "Uses traveling stabilizers to suppress hook errors during heterogeneous-distance merge and split operations", "Achieves comparable logical error suppression to uniform-distance implementations with $9.5\\%$ to $28.4\\%$ fewer qubits" ], "keywords": [ { "label": "Lattice Surgery", "reason": "Core technique is heterogeneous-distance lattice surgery between logical patches" }, { "label": "Distributed QC", "reason": "Focuses on inter-QPU fault-tolerant operations in modular architectures" }, { "label": "Hook Errors", "reason": "Traveling stabilizers are designed to suppress hook error propagation" }, { "label": "Resource Overhead", "reason": "Central tradeoff studied is physical-qubit overhead versus link noise robustness" } ], "emoji": "🧩", "social_summary": "An enlarged shared ancilla architecture suppresses hook errors in distributed lattice surgery while saving physical qubits.", "highlights_oneliner": "Heterogeneous-distance ancilla for distributed surgery" }, { "arxiv_id": "2609.25251", "title": "Exploring Asymmetric QEC Code Concatenation", "authors": "Sayam Sethi, Maxwell Poster, Aditi Awasthi, Willers Yang, Joshua Viszlai, Jonathan Mark Baker", "arxiv_url": "https://arxiv.org/abs/2609.25251", "pdf_url": "https://arxiv.org/pdf/2609.25251", "summary": "The authors study concatenation of the $[[4,1,2]]$ Iceberg code, which has an asymmetric number of $X$ and $Z$ checks leading to skewed logical error rates, and formalize the doubly-exponentially large space of Hadamard-deformation strategies that can mitigate this asymmetry. They propose and compare six concrete deformation strategies under code-capacity noise models with a concatenated maximum-likelihood soft-information decoder, finding one strategy achieves near-identical $X$/$Z$ logical error rates while reducing total logical error rate.", "motivation": "Concatenated codes like the Iceberg code offer a resource-efficient path to improved distance without discovering new codes, but their inherent $X$/$Z$ check asymmetry propagates into skewed and suboptimal logical performance under soft-information decoding. Systematically exploring Clifford deformations is needed to balance error protection and reduce overall logical error rates for practical concatenated architectures.", "highlights": [ "Formalizes the doubly-exponentially large space of Hadamard deformation strategies for concatenated Iceberg codes", "Proposes and benchmarks six deformation strategies under biased and unbiased code-capacity noise with ML decoding", "Identifies a mixed deformation strategy achieving near-symmetric $X$/$Z$ logical error rates and lower total LER" ], "keywords": [ { "label": "Concatenation", "reason": "The paper's focus is concatenated quantum error-correcting codes" }, { "label": "Iceberg Code", "reason": "Central object of study is the $[[4,1,2]]$ Iceberg code" }, { "label": "Clifford Deformation", "reason": "Explores Hadamard-deformation strategies to balance error rates" }, { "label": "Soft Decoding", "reason": "Uses a maximum-likelihood soft-information decoder to evaluate strategies" } ], "emoji": "🧊", "social_summary": "New deformation strategies balance X and Z error rates in concatenated Iceberg code quantum memories.", "highlights_oneliner": "Balancing X/Z errors in Iceberg concatenation" }, { "arxiv_id": "2609.26660", "title": "Error Correction Properties of Covariant Bosonic Encodings", "authors": "Frederic St-Amand, Jean-Philippe Burelle, Baptiste Royer", "arxiv_url": "https://arxiv.org/abs/2609.26660", "pdf_url": "https://arxiv.org/pdf/2609.26660", "summary": "The authors build a representation-theoretic framework for multimode symmetric bosonic codes based on finite groups, showing that QEC matrices are morphisms of group representations so Schur's lemma forces entire irreducible blocks to vanish. They recover known single- and two-mode bosonic codes and construct and analyze three new codes from finite subgroups of $SU(2)$, studying how logical representation reducibility affects error protection and optimizing seed states via near-optimal fidelity.", "motivation": "Bosonic codes like GKP and cat codes reduce hardware overhead by encoding logical qubits in a single mode, and their symmetry structure is key to simple encodings and gates, but a unified systematic framework for multimode symmetric constructions has been lacking. This work extends covariant encoding theory to formalize and generalize such constructions using representation theory.", "highlights": [ "Shows QEC matrices are morphisms of group representations, so Schur's lemma forces vanishing of mismatched irreducible blocks", "Recovers known codes including the four-legged cat code and bosonic cyclic codes within a unified framework", "Constructs new two-mode codes from the quaternion group $Q_8$ and binary octahedral group $2O$ with analyzed error protection" ], "keywords": [ { "label": "Bosonic Codes", "reason": "Paper focuses on multimode symmetric bosonic quantum codes" }, { "label": "Representation Theory", "reason": "Framework built on group representation theory and Schur's lemma" }, { "label": "Covariant Encoding", "reason": "Codewords are defined via covariant encoding from group representations" }, { "label": "GKP/Cat Codes", "reason": "Recovers and generalizes known GKP and cat code constructions" } ], "emoji": "🐈", "social_summary": "A representation-theoretic framework unifies and extends bosonic codes, revealing new multimode codes from finite groups.", "highlights_oneliner": "Group theory unifies multimode bosonic codes" }, { "arxiv_id": "2609.25201", "title": "Measurement-Induced Phase Transitions and Logical-Space Localization in Floquet Monitored Clifford Circuits", "authors": "Hyunsoo Ha, David A. Huse", "arxiv_url": "https://arxiv.org/abs/2609.25201", "pdf_url": "https://arxiv.org/pdf/2609.25201", "summary": "The authors study Floquet monitored Clifford circuits where a fixed spatially-random pattern of gates and measurements is exactly repeated every period, finding that entanglement transitions can occur without a corresponding purification transition. In 1D the system remains extensively mixed while entanglement stays area-law, while in 2D+ a volume-law to area-law entanglement transition occurs with the system remaining mixed on both sides, characterized via a newly introduced logical-support radius and logical Krylov dimension.", "motivation": "Measurement-induced phase transitions are typically studied in spacetime-random circuits where entanglement and purification transitions coincide, but time-periodic disorder introduces persistent rare spatial structures whose consequences were unexplored. Understanding this decoupling matters for quantum error correction since the volume-law phase has a direct QEC interpretation and surviving logical information dynamics are central to code performance under repeated measurement.", "highlights": [ "Demonstrates entanglement transitions can occur without a corresponding purification transition in Floquet monitored circuits", "Finds a volume-law to area-law entanglement transition in 2D+ while the system stays extensively mixed on both sides", "Introduces logical-support radius and logical Krylov dimension to characterize delocalized versus localized logical dynamics" ], "keywords": [ { "label": "MIPT", "reason": "Paper investigates measurement-induced phase transitions in monitored circuits" }, { "label": "Clifford Circuits", "reason": "Simulations use stabilizer formalism via Clifford circuits" }, { "label": "Floquet Dynamics", "reason": "Circuits are periodically repeated in a Floquet setting" }, { "label": "Purification", "reason": "Central finding is the decoupling of entanglement and purification transitions" } ], "emoji": "🌀", "social_summary": "Repeating the same random Clifford circuit each period decouples entanglement transitions from purification, revealing new physics.", "highlights_oneliner": "Entanglement and purification decouple in Floquet circuits" }, { "arxiv_id": "2609.26516", "title": "Tensor Network Simulation of Dynamic Circuits", "authors": "Innocenzo Fulginiti, Alessandro Poggiali, Christian Mendl", "arxiv_url": "https://arxiv.org/abs/2609.26516", "pdf_url": "https://arxiv.org/pdf/2609.26516", "summary": "The authors extend a DMRG-based tensor network method for quantum circuit simulation to support dynamic circuits with mid-circuit measurements and classically controlled operations, proposing a single-path stochastic sampling strategy and a multi-path ensemble strategy to handle the exponential branching of measurement outcomes. They benchmark both approaches on teleportation, GHZ state preparation, and random dynamic circuits, characterizing the accuracy-efficiency trade-off between the two methods.", "motivation": "Dynamic circuits with mid-circuit measurement and feedback are central to quantum error correction and efficient state preparation, but their classical simulation is challenging due to exponentially many execution branches. A practical, scalable tensor network simulation framework is needed to validate and benchmark such circuits on classical hardware.", "highlights": [ "Extends DMRG-based tensor network simulation to support mid-circuit measurements and classical feedback", "Introduces single-path stochastic sampling and multi-path branch-ensemble strategies for dynamic circuits", "Benchmarks accuracy-efficiency trade-offs on teleportation, GHZ preparation, and random dynamic circuits" ], "keywords": [ { "label": "Tensor Networks", "reason": "Simulation method is based on DMRG tensor network techniques" }, { "label": "Dynamic Circuits", "reason": "Paper's core subject is circuits with mid-circuit measurement and feedback" }, { "label": "Classical Simulation", "reason": "Focus is on classically simulating quantum circuits efficiently" }, { "label": "MPS/TTN", "reason": "Method is designed to support matrix product state and tree tensor network topologies" } ], "emoji": "🕸️", "social_summary": "A new DMRG-based tensor network method efficiently simulates dynamic circuits with mid-circuit measurements and feedback.", "highlights_oneliner": "Tensor networks tackle dynamic circuit simulation" }, { "arxiv_id": "2609.25208", "title": "Adaptive thresholding for scalable measurement-based qubit reset", "authors": "Qian Cao, Unnati Akhouri, Samuel Vizvary, Nissim Ofek, Wei Dai, Kater W. Murch", "arxiv_url": "https://arxiv.org/abs/2609.25208", "pdf_url": "https://arxiv.org/pdf/2609.25208", "summary": "The authors demonstrate an adaptive measurement-based qubit reset protocol that uses Bayesian inference to continuously update the ground-state probability estimate from analog readout and dynamically adjust the feedback threshold. Implemented with real-time FPGA feedback on a dispersively read transmon, the protocol achieves $99.44\\pm0.04\\%$ single-qubit initialization fidelity and $98.78\\pm0.19\\%$ fidelity for simultaneous five-qubit reset with deterministic duration.", "motivation": "Fast, high-fidelity qubit initialization underlies both quantum algorithms and quantum error correction, but conventional reset protocols either require long relaxation waits or discard information in the continuous measurement record, limiting reset speed and fidelity. As processors scale, deterministic and high-fidelity reset becomes critical, motivating protocols that exploit the full analog signal rather than binarized thresholds.", "highlights": [ "Achieves $99.44\\pm0.04\\%$ single-qubit ground-state initialization fidelity using Bayesian adaptive thresholding", "Demonstrates $98.78\\pm0.19\\%$ simultaneous five-qubit reset fidelity with deterministic reset duration", "Shows adaptive thresholding outperforms repeat-until-success protocols by using full analog measurement history rather than binary outcomes" ], "keywords": [ { "label": "Qubit Reset", "reason": "The paper's central topic is fast, high-fidelity active qubit initialization" }, { "label": "Bayesian Inference", "reason": "Bayesian updating of the qubit-state estimate drives the adaptive threshold mechanism" }, { "label": "Soft Information", "reason": "The protocol leverages analog IQ measurement records instead of binarized readout, connecting to soft-information decoding ideas mentioned for QEC" }, { "label": "Superconducting Qubits", "reason": "Experiments are performed on dispersively read transmon qubits with FPGA-based real-time feedback" } ], "emoji": "🔄", "social_summary": "Researchers use Bayesian adaptive thresholding with real-time FPGA feedback to reset superconducting qubits with over 99% fidelity.", "highlights_oneliner": "Bayesian adaptive thresholding enables fast, high-fidelity qubit reset" }, { "arxiv_id": "2609.26769", "title": "On the Complexity of Finding Decoherence Free Subspaces", "authors": "Evan Borras", "arxiv_url": "https://arxiv.org/abs/2609.26769", "pdf_url": "https://arxiv.org/pdf/2609.26769", "summary": "This paper studies the computational complexity of deciding whether a Markovian open quantum system, governed by a time-independent Lindblad master equation, admits a decoherence free subspace. The author introduces the $k$-Local Lindbladian problem and its pure steady-state variant, proving both are hard for $\\mathrm{QMA}$ when locality $k\\geq5$, via a generalization of Kitaev's clock construction encoding quantum circuits into Lindbladian steady subspaces.", "motivation": "Decoherence free subspaces are a key resource for preserving quantum coherence in open systems and have wide applications in quantum information science, yet the tractability of identifying them for generic open systems was not well understood. Establishing complexity-theoretic hardness clarifies fundamental limits on searching for such protected subspaces, paralleling known hardness results for the local Hamiltonian problem.", "highlights": [ "Introduces the $k$-Local Lindbladian and $k$-Local Lindbladian Pure Steady-State problems for Markovian open systems", "Proves $\\mathrm{QMA}_1$-hardness (pure steady-state) and $\\mathrm{QMA}$-completeness (general problem) for locality $k\\geq5$", "Generalizes Kitaev's clock Hamiltonian construction to Lindbladian dynamics encoding circuit history states in a mixed steady subspace" ], "keywords": [ { "label": "QMA Hardness", "reason": "The paper's main results establish $\\mathrm{QMA}$ and $\\mathrm{QMA}_1$ hardness/completeness for the studied problems" }, { "label": "Lindbladian Dynamics", "reason": "The complexity analysis is framed around time-independent Lindblad master equations governing open quantum systems" }, { "label": "Decoherence Free Subspaces", "reason": "The core object of study is the existence of decoherence free subspaces in open quantum systems" }, { "label": "Kitaev Construction", "reason": "The hardness proof generalizes Kitaev's clock Hamiltonian construction to the open-system setting" } ], "emoji": "🧩", "social_summary": "New complexity results show deciding whether an open quantum system has a decoherence free subspace is QMA-hard.", "highlights_oneliner": "QMA-hardness of finding decoherence free subspaces" } ] }, "2026-09-22": { "word_cloud": [ { "word": "NonCSS", "weight": 4 }, { "word": "TrappedIons", "weight": 4 }, { "word": "LatticeSurgery", "weight": 5 }, { "word": "SurfaceCode", "weight": 4 }, { "word": "MagicStates", "weight": 5 }, { "word": "Modular", "weight": 3 }, { "word": "NPHard", "weight": 3 }, { "word": "SelfDual", "weight": 2 }, { "word": "Distance", "weight": 3 }, { "word": "LDPC", "weight": 5 }, { "word": "TannerGraph", "weight": 3 }, { "word": "BeliefPropagation", "weight": 3 }, { "word": "Erasure", "weight": 3 }, { "word": "NeutralAtoms", "weight": 4 }, { "word": "Toric", "weight": 3 } ], "social_highlights": "Highlights: modular fault-tolerant computing on a non-CSS trapped-ion code, FlowRouter halves lattice-surgery spacetime cost, NP-hardness proof for code distance approximation, high-rate quasi-dyadic QLDPC codes with cycle-free Tanner graphs, optimal entanglement-assisted local recovery algorithm, and a thermal microwave bus speeding neutral-atom toric and bicycle codes.", "papers": [ { "arxiv_id": "2609.22572", "title": "Modular fault-tolerant quantum computing on a non-CSS code", "authors": "Robert Freund, Friederike Butt, César Benito, Ivan Pogorelov, Marcel Meyer, Alex Steiner, Alejandro Bermudez, Markus Müller, Thomas Monz", "arxiv_url": "https://arxiv.org/abs/2609.22572", "pdf_url": "https://arxiv.org/pdf/2609.22572", "summary": "The authors implement, for the first time, a complete suite of fault-tolerant logical operations for modular quantum computing using the non-CSS perfect $[[5,1,3]]$ code on a trapped-ion platform. They demonstrate logical state teleportation, fault-tolerant state preparation, real-time-feedback QEC, logical measurements, magic-state preparation and injection, and logical entangling gates. They also characterize spectator errors on idling logical qubits and introduce a resource-efficient logical Pauli process tomography.", "motivation": "Scalable fault-tolerant quantum computing requires modular architectures that route and manipulate logical information across separate registers, not just protect stored qubits. Prior demonstrations largely focused on CSS qLDPC codes, leaving open whether compact non-CSS codes like the $[[5,1,3]]$ code can support the full modular fault-tolerant toolkit.", "highlights": [ "First full demonstration of modular fault-tolerant operations on the non-CSS $[[5,1,3]]$ code", "Logical state teleportation between modules via measurement and classical feedback", "Resource-efficient logical Pauli process tomography reducing sampling overhead" ], "keywords": [ { "label": "Non-CSS Codes", "reason": "The paper uses the perfect $[[5,1,3]]$ code, which is not a CSS code, as its core error-correcting code" }, { "label": "Trapped Ions", "reason": "All experiments are performed on a trapped-ion quantum computer" }, { "label": "Modular Architecture", "reason": "The work focuses on connecting and manipulating logical qubits across separate modules via teleportation" }, { "label": "Magic States", "reason": "The paper demonstrates magic-state preparation and injection as part of universal logical control" } ], "emoji": "🧩", "social_summary": "Researchers demonstrate full modular fault-tolerant quantum computing using the compact five-qubit non-CSS code on trapped ions.", "highlights_oneliner": "First modular fault-tolerant demo on $[[5,1,3]]$ code" }, { "arxiv_id": "2609.23756", "title": "Flow-Based Lattice Surgery Optimization with Runtime T Gate Scheduling", "authors": "Raymond Iacobacci, Tianyi Hao, Neer Patel, Siyuan Niu", "arxiv_url": "https://arxiv.org/abs/2609.23756", "pdf_url": "https://arxiv.org/pdf/2609.23756", "summary": "FlowRouter is introduced as the first topological lattice surgery compiler that jointly embeds Clifford routing and stochastic magic-state cultivation within a single 3D spacetime volume. It formulates layer-wide gate routing as a maximum-flow problem at compile time and incorporates realistic, multiplexed cultivation with post-selection at runtime, using delay mechanisms to absorb stochastic timing with minimal overhead.", "motivation": "Compiling logical circuits into lattice surgery operations on the surface code is critical for practical fault tolerance, yet prior compilers rely on idealized, gate-order-dependent routing and assume magic states are free and instantly available. Addressing realistic magic-state cultivation costs and enabling simultaneous multi-gate routing is essential for reducing the true resource overhead of fault-tolerant computation.", "highlights": [ "2.3x spacetime volume reduction and 10.8x faster compilation versus prior static compilers with free magic states", "Maximum-flow formulation embeds many gates of a circuit layer simultaneously, independent of gate order", "2.3x spacetime volume reduction on distance-13 surface code in a realistic cultivation-aware setting" ], "keywords": [ { "label": "Lattice Surgery", "reason": "The paper's core contribution is a compiler for lattice surgery operations on the surface code" }, { "label": "Surface Code", "reason": "The compiler targets fault-tolerant computation on the surface code architecture" }, { "label": "Magic States", "reason": "The work explicitly models stochastic magic-state cultivation cost and scheduling" }, { "label": "Compilation", "reason": "The paper frames routing as a maximum-flow optimization problem for compiling quantum circuits" } ], "emoji": "🌊", "social_summary": "FlowRouter compiles quantum circuits into surface-code lattice surgery, cutting spacetime cost by over 2x with realistic magic-state timing.", "highlights_oneliner": "Flow-based compiler slashes lattice surgery overhead" }, { "arxiv_id": "2609.22669", "title": "Metric Self-Dual Completion and Optimal Additive Hardness for Quantum and Graph-State Distance", "authors": "Rafail Ostrovsky", "arxiv_url": "https://arxiv.org/abs/2609.22669", "pdf_url": "https://arxiv.org/pdf/2609.22669", "summary": "This paper proves that approximating quantum code distance within an additive error of $cN$ is NP-hard, improving the prior $\\Omega(\\sqrt{N})$ gap to the optimal $\\Omega(N)$ gap, resolving an open question. It also strengthens the graph-state distance hardness gap from $\\Omega(N^{1/3})$ to $\\Omega(N)$, using a new deterministic classical construction called the metric self-dual completion that doubles Hamming distances while embedding any code into a self-dual code of linear length.", "motivation": "Determining the hardness of approximating quantum code distance is fundamental to understanding the limits of decoding and code verification, with prior work leaving a substantial gap between the best known hardness and the trivial upper bound of $N$. Resolving these long-standing open questions on optimal additive hardness closes the gap for both quantum CSS codes and graph-state distance problems.", "highlights": [ "Achieves optimal $\\Omega(N)$ additive hardness gap for quantum code distance, improving on the prior $\\Omega(\\sqrt{N})$ result", "Resolves the open question of Kapshikar and Kundu on linear-gap hardness", "Improves graph-state distance hardness from cube-root to linear gap via a new deterministic self-dual code embedding" ], "keywords": [ { "label": "NP-Hardness", "reason": "The paper's central result is a complexity-theoretic hardness of approximation proof" }, { "label": "CSS Codes", "reason": "Hardness results apply to CSS codes with identical $X$ and $Z$ check spaces" }, { "label": "Code Distance", "reason": "The paper focuses on the hardness of approximating minimum distance of quantum and graph-state codes" }, { "label": "Self-Dual Codes", "reason": "The core technique is a deterministic construction converting any code into a self-dual completion" } ], "emoji": "📐", "social_summary": "New complexity proof shows approximating quantum code distance within a linear error is provably NP-hard, resolving open questions.", "highlights_oneliner": "Optimal linear hardness gap for quantum code distance" }, { "arxiv_id": "2609.24201", "title": "High-Rate Quasi-Dyadic Quantum LDPC Codes", "authors": "Alessio Baldelli, Sisi Miao, Laurent Schmalen, Massimo Battaglioni, Marco Baldi", "arxiv_url": "https://arxiv.org/abs/2609.24201", "pdf_url": "https://arxiv.org/pdf/2609.24201", "summary": "The authors design high-rate CSS quantum LDPC codes based on quasi-dyadic matrices with an affine-Frobenius construction, ensuring the component Tanner graphs have girth at least $6$. They derive a closed-form formula for counting length-$4$ cycles in the quaternary Tanner graph representation and show via Monte Carlo simulations that these codes achieve competitive logical error rates under code-capacity and phenomenological noise models.", "motivation": "CSS QLDPC codes offer higher encoding rates than topological codes, but constructing parity-check matrix pairs that satisfy orthogonality while avoiding harmful length-4 cycles for belief-propagation decoding remains a key design challenge. Existing quasi-dyadic constructions were largely dual-containing and thus forced to include such cycles, motivating a new non-dual-containing design.", "highlights": [ "New quasi-dyadic CSS construction achieving girth $\\geq 6$ in both component Tanner graphs", "Closed-form formula for exact count of length-4 cycles in the quaternary parity-check representation", "Competitive logical error rate performance versus state-of-the-art QLDPC codes under two noise models" ], "keywords": [ { "label": "QLDPC Codes", "reason": "The paper's main contribution is a new family of quantum low-density parity-check codes" }, { "label": "CSS Codes", "reason": "The construction follows the CSS framework using two orthogonal classical component codes" }, { "label": "Tanner Graphs", "reason": "Girth and cycle counting of the Tanner graph structure are central to the design and analysis" }, { "label": "Belief Propagation", "reason": "Avoiding short cycles is motivated by improving BP-based decoding performance" } ], "emoji": "🔢", "social_summary": "New quasi-dyadic quantum LDPC codes achieve high rates and cycle-free Tanner graphs for better decoding performance.", "highlights_oneliner": "High-rate QLDPC codes with girth-6 structure" }, { "arxiv_id": "2609.23316", "title": "Simultaneous Reduction of Observables and Measured Qudits in Entanglement-Assisted Quantum Local Recovery", "authors": "Ryutaroh Matsumoto", "arxiv_url": "https://arxiv.org/abs/2609.23316", "pdf_url": "https://arxiv.org/pdf/2609.23316", "summary": "This paper presents a linear-algebraic procedure with cubic complexity in the repair group size that simultaneously computes a minimal set of observables and a reduced repair group of codeword qudits needed to correct a given set of erasures, applicable to both entanglement-assisted and unassisted quantum codes. The method is specialized to codes built from Euclidean and Hermitian orthogonality, yielding closed-form upper bounds on repair group size and a quantum analogue of classical information locality.", "motivation": "Reducing the number of measurements in quantum error correction is important because measurements disturb qubits on many physical platforms, and prior work addressed reducing observables or repair group size but not both simultaneously with tight guarantees. Extending erasure-correction local recovery techniques to jointly minimize observables and measured qudits is needed for more practical fault-tolerant implementations.", "highlights": [ "Cubic-complexity algorithm achieving the smallest possible observable set for erasure correction", "Closed-form upper bounds on reduced repair group size for Euclidean and Hermitian orthogonality codes", "Introduces a quantum counterpart of classical information locality for local recovery" ], "keywords": [ { "label": "Erasure Correction", "reason": "The paper addresses correcting erasures with known error positions in quantum codes" }, { "label": "Local Recovery", "reason": "The work builds on quantum local recovery techniques to minimize measured qudits" }, { "label": "Entanglement-Assisted Codes", "reason": "The procedure applies to entanglement-assisted quantum error-correcting codes" }, { "label": "Repair Groups", "reason": "Reducing the size of repair groups of codeword qudits is a central technical contribution" } ], "emoji": "🛠️", "social_summary": "New algorithm minimizes both measured qudits and observables needed for quantum erasure correction with provable optimality.", "highlights_oneliner": "Minimal measurements for quantum erasure recovery" }, { "arxiv_id": "2609.24933", "title": "A thermal microwave bus for neutral atom quantum computing", "authors": "Matthew J. H. Kendall, Christopher J. Watson, Michael Ben Shem, Jonathan D. Breeze", "arxiv_url": "https://arxiv.org/abs/2609.24933", "pdf_url": "https://arxiv.org/pdf/2609.24933", "summary": "The authors propose a four-level neutral-atom architecture coupling Rydberg states to a microwave cavity to enable long-range, cavity-mediated two-qubit gates without atom shuttling. They introduce a bichromatic Raman gate that virtually populates Rydberg states and cancels dispersive shifts, achieving fidelity $F=0.997$ while being robust to thermal photons and cavity decay, and show that closing periodic boundaries of the toric code with this gate speeds up error correction rounds by $2.3\\times$ and bivariate bicycle codes by $4.8\\times$.", "motivation": "High-fidelity Rydberg blockade gates in neutral atoms are inherently short-ranged, requiring slow atom shuttling for long-range connectivity that becomes a bottleneck for low-overhead qLDPC codes. A cavity-mediated entanglement bus offers a route to non-local gates without physical movement, directly benefiting quantum error correction protocols that need long-range connections such as toric and bivariate bicycle codes.", "highlights": [ "Bichromatic Raman gate achieves fidelity $F=0.997$ while mitigating atomic and cavity decay", "Cavity-mediated gates speed up toric code error correction rounds by $2.3\\times$", "Bivariate bicycle gross code error correction rounds sped up by $4.8\\times$ using the microwave bus" ], "keywords": [ { "label": "Neutral Atoms", "reason": "The architecture is built on neutral-atom optical tweezer arrays" }, { "label": "Rydberg States", "reason": "Long-range coupling is achieved via Rydberg states interacting with a microwave cavity" }, { "label": "Toric Code", "reason": "The paper evaluates speedup of toric code error correction rounds using the proposed bus" }, { "label": "Bivariate Bicycle", "reason": "The technique is applied to accelerate error correction in bivariate bicycle qLDPC codes" } ], "emoji": "📡", "social_summary": "A microwave cavity bus enables long-range gates between neutral atoms, speeding up toric and bicycle code error correction significantly.", "highlights_oneliner": "Cavity bus speeds up neutral-atom error correction" } ] }, "2026-09-21": { "word_cloud": [ { "word": "Color", "weight": 5 }, { "word": "Distillation", "weight": 4 }, { "word": "Networks", "weight": 3 }, { "word": "Connectivity", "weight": 4 }, { "word": "Photonic", "weight": 4 }, { "word": "Interconnect", "weight": 3 }, { "word": "Threshold", "weight": 4 }, { "word": "Critical", "weight": 3 }, { "word": "Ensembles", "weight": 3 }, { "word": "Scheduling", "weight": 3 }, { "word": "Factoring", "weight": 3 }, { "word": "Cavity", "weight": 2 }, { "word": "Modular", "weight": 3 }, { "word": "Overhead", "weight": 3 }, { "word": "Syndrome", "weight": 2 } ], "social_highlights": "Highlights: denser 4.8.8 color codes cut qubit overhead, ensemble choice shifts critical exponents at QEC threshold, ReFINE schedules distillation and coding for rate-fidelity tradeoff, Pinnacle architecture enables RSA-2048 factoring with fixed degree-eight connectivity, single-atom photonic interconnect links modular quantum processors.", "papers": [ { "arxiv_id": "2609.21376", "title": "Denser Planar Color Codes", "authors": "Noah Shutty", "arxiv_url": "https://arxiv.org/abs/2609.21376", "pdf_url": "https://arxiv.org/pdf/2609.21376", "summary": "This work presents periodic superdense syndrome-extraction circuits with twelve $CNOT$ layers for the $4.8.8$ color code in a brickwork layout on the square lattice, which appear to preserve the full code distance. Including ancillas, the construction uses $q=(2d^2+5d-5)/2$ physical qubits for distance $d$, asymptotically $2/3$ as many as the triangular $6.6.6$ color code and $1/2$ as many as the rotated surface code. Circuit-level simulations targeting superconducting architectures show favorable logical error scaling for both planar and toroidal versions at realistic noise rates.", "motivation": "Topological codes like the surface and color codes remain central to fault-tolerant quantum computing due to their local checks and high thresholds, but reducing qubit overhead per logical qubit at fixed distance is a key open problem. Building on prior observations that $4.8.8$ color codes reduce data-qubit overhead compared to $6.6.6$ color codes and surface codes, this paper investigates whether these savings persist once ancilla qubits for syndrome extraction are included.", "highlights": [ "Twelve-layer $CNOT$ circuits preserve full code distance for $4.8.8$ color codes", "Asymptotic qubit-overhead coefficient $q/(kd^2)\\to 1$, versus $3/2$ for $6.6.6$ and $2$ for surface code", "Favorable circuit-level performance demonstrated at $p=10^{-3}$ and $5\\times10^{-4}$ with the Tesseract decoder" ], "keywords": [ { "label": "Color Codes", "reason": "The paper focuses on the $4.8.8$ color code family and its qubit efficiency compared to $6.6.6$ color codes." }, { "label": "Syndrome Extraction", "reason": "Introduces novel twelve-layer superdense $CNOT$ circuits for extracting stabilizers while preserving code distance." }, { "label": "Qubit Overhead", "reason": "Central contribution is reducing the $q/(kd^2)$ scaling coefficient relative to surface and $6.6.6$ codes." }, { "label": "Circuit-level Simulation", "reason": "Uses circuit-level noise simulations with the Tesseract decoder to validate performance on superconducting hardware." } ], "emoji": "🧱", "social_summary": "New superdense circuits make $4.8.8$ color codes denser and more qubit-efficient than surface codes for fault-tolerant memories.", "highlights_oneliner": "Superdense circuits shrink color-code qubit overhead" }, { "arxiv_id": "2609.21886", "title": "Ensemble Dependence of the Critical Exponent at a Quantum Error Correction Threshold", "authors": "Idan Dror, Moshe Goldstein", "arxiv_url": "https://arxiv.org/abs/2609.21886", "pdf_url": "https://arxiv.org/pdf/2609.21886", "summary": "Using a simplified single-step random-unitary encoding-decoding model of quantum error correction, the authors study fidelity and magic near the associated error threshold and show that critical exponents differ depending on whether generic channels or quantum trajectories (canonical vs. grand-canonical-like ensembles) are used. The extracted exponents saturate a recently derived information-theoretic bound, which the authors extend from the grand-canonical to the canonical case and to newly defined intermediate ensembles.", "motivation": "In thermodynamics, ensemble equivalence is typically assumed to hold in the thermodynamic limit, but this paper questions whether that assumption extends to critical exponents in quantum error-correcting systems. Understanding ensemble-dependence at QEC thresholds is important since it reveals that even the existence of a phase transition can hinge on how randomness is treated in the error model.", "highlights": [ "Different critical exponents ($\\nu=1$ vs $\\nu=2$) found for generic channels versus quantum trajectories", "Extracted exponents saturate an information-theoretic bound extended from grand-canonical to canonical ensembles", "Existence of the error-correction threshold transition itself is shown to be ensemble-dependent" ], "keywords": [ { "label": "Critical Exponents", "reason": "The paper's central result is that critical exponents at the QEC threshold depend on ensemble choice." }, { "label": "Random Unitaries", "reason": "The model is built from random unitary encoding-decoding circuits representing a QEC protocol." }, { "label": "Magic", "reason": "Studies the behavior of magic alongside fidelity near the threshold transition." }, { "label": "Statistical Ensembles", "reason": "Compares canonical, grand-canonical, and newly defined intermediate ensembles for the error channel." } ], "emoji": "🌡️", "social_summary": "Shows that critical exponents at a quantum error correction threshold depend on the statistical ensemble used to model errors.", "highlights_oneliner": "Ensemble choice changes QEC threshold exponents" }, { "arxiv_id": "2609.21152", "title": "ReFINE: Scheduling of Distillation and Coding for Rate-Fidelity Tradeoff in Quantum Networks", "authors": "Narges Alavisamani, Matthieu Bloch, Moinuddin Qureshi", "arxiv_url": "https://arxiv.org/abs/2609.21152", "pdf_url": "https://arxiv.org/pdf/2609.21152", "summary": "ReFINE is a demand-aware preemptive scheduler for quantum networks that dynamically decides between serving EPR pairs immediately, running entanglement distillation, or forming Coding-Enhanced Memory (CEM) using quantum error correction. It offers three priority policies—Distillation-First, Memory-First, and Concurrent—that balance service rate against fidelity based on application demands, rather than relying on static combinations of distillation and coding.", "motivation": "Quantum networks require both high fidelity and high service rate of shared EPR pairs, but entanglement distillation improves fidelity at the cost of destroying pairs on failure, while QEC-based memory protection reduces available service rate; existing static approaches ignore fluctuating demand. This work addresses the practical need for adaptive resource allocation to meet diverse application requirements such as BBM92 QKD fidelity thresholds and interferometry service-rate constraints.", "highlights": [ "ReFINE closes 32% of the theoretical fidelity gap for an initial fidelity of 0.8, reaching 0.823", "Improves fidelity gap closure by up to 11.21% over Continuous Distillation", "Improves service-rate gap closure by up to 49.48% over Static Distill+CEM baselines" ], "keywords": [ { "label": "Entanglement Distillation", "reason": "The scheduler decides when to run probabilistic distillation to increase EPR pair fidelity." }, { "label": "Coding-Enhanced Memory", "reason": "Introduces CEM, a QEC-based mechanism to protect EPR pairs against decoherence errors." }, { "label": "Quantum Networks", "reason": "The overall system targets scheduling resources between nodes sharing EPR pairs in a quantum network." }, { "label": "Scheduling Policies", "reason": "Proposes three distinct priority policies (Distillation-First, Memory-First, Concurrent) for resource allocation." } ], "emoji": "🕸️", "social_summary": "ReFINE dynamically schedules entanglement distillation and error-corrected memory to balance fidelity and rate in quantum networks.", "highlights_oneliner": "Adaptive scheduler balances quantum network fidelity and rate" }, { "arxiv_id": "2609.21249", "title": "The Pinnacle Architecture with fixed connectivity of degree eight", "authors": "Paul Webster, Tom Peham, Lawrence Z. Cohen", "arxiv_url": "https://arxiv.org/abs/2609.21249", "pdf_url": "https://arxiv.org/pdf/2609.21249", "summary": "This paper adapts the Pinnacle Architecture for compatibility with superconducting qubits by introducing the Frozen Pinnacle Architecture, which fixes qubit connectivity at degree eight, matching fabrication constraints. The authors show that a $2048$-bit RSA integer can be factored in one month using approximately $120{,}000$ physical qubits at a physical error rate of $10^{-3}$, a code cycle time of $1\\,\\mu s$, and a reaction time of $10\\,\\mu s$.", "motivation": "Prior hardware-agnostic analysis of the Pinnacle Architecture suggested fewer than $100{,}000$ physical qubits could factor RSA-2048, but superconducting qubits require fixed connectivity set at fabrication rather than the reconfigurable connectivity assumed originally. This work resolves whether hardware constraints substantially increase resource overhead for a leading qLDPC-based factoring architecture.", "highlights": [ "Frozen Pinnacle Architecture achieves fixed connectivity degree of eight, comparable to the bicycle architecture's degree seven", "RSA-$2048$ factoring estimated feasible in one month with $\\sim 120{,}000$ physical qubits at $p=10^{-3}$", "Confirms that low spacetime overhead of the original Pinnacle Architecture is not primarily an artifact of hardware-agnostic assumptions" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The Pinnacle Architecture is built on quantum LDPC codes for fault-tolerant computation." }, { "label": "RSA Factoring", "reason": "The paper benchmarks resource estimates against factoring a $2048$-bit RSA integer." }, { "label": "Fixed Connectivity", "reason": "Central contribution is adapting the architecture to a fixed degree-eight connectivity for superconducting qubits." }, { "label": "Resource Estimation", "reason": "Provides concrete physical qubit and runtime estimates for fault-tolerant algorithm execution." } ], "emoji": "🔗", "social_summary": "Adapts the Pinnacle qLDPC architecture to fixed degree-eight connectivity, enabling RSA-2048 factoring with about 120000 qubits.", "highlights_oneliner": "Fixed-connectivity Pinnacle enables RSA-2048 factoring" }, { "arxiv_id": "2609.21961", "title": "Single-atom-based asynchronous photonic interconnect for scalable modular quantum computing", "authors": "Jérémy Raskop, Nadav Kandel, Yaniv Amichy, Yaron Jarach, Tal Kanonich, Andrei Militaru, Johannes Fink, Barak Dayan", "arxiv_url": "https://arxiv.org/abs/2609.21961", "pdf_url": "https://arxiv.org/pdf/2609.21961", "summary": "This paper proposes a memory-assisted quantum interconnect using a single atom trapped in a high-finesse cavity to mediate entanglement between modular quantum processors via a near-deterministic photon-atom controlled-$Z$ gate. Because the atom mediates entanglement asynchronously, photons from the two processors need not be indistinguishable and do not require simultaneous arrival, allowing the entanglement rate to scale linearly rather than quadratically with photon-delivery probability.", "motivation": "Scaling quantum computation beyond a single processor requires reliable interconnects to distribute entanglement across modules, but conventional linear-optics Bell-state measurement protocols suffer quadratic scaling with typically low photon-delivery probability. This work targets removing that bottleneck and the requirement for photon indistinguishability, which are major sources of inefficiency and infidelity in modular architectures.", "highlights": [ "Entanglement rate scales linearly rather than quadratically with photon-arrival probability over a wide parameter range", "Photon-atom controlled-$Z$ gate removes the need for indistinguishable photons from different processors", "Orders-of-magnitude entanglement-rate gain over linear-optics fusion gates predicted under realistic decoherence parameters" ], "keywords": [ { "label": "Photonic Interconnect", "reason": "The paper's core proposal is a photon-mediated interconnect linking modular quantum processors." }, { "label": "Cavity QED", "reason": "Uses a single atom in a high-finesse cavity to implement a deterministic photon-atom gate." }, { "label": "Entanglement Distribution", "reason": "Focuses on heralded, memory-assisted entanglement generation between remote processors." }, { "label": "Modular Quantum Computing", "reason": "Targets scaling beyond a single QPU via interconnects supporting distributed fault-tolerant architectures." } ], "emoji": "🔬", "social_summary": "A single trapped atom enables faster, more robust photonic links between quantum processors for modular quantum computing.", "highlights_oneliner": "Atom-mediated photonic link boosts modular entanglement rates" } ] }, "2026-09-18": { "word_cloud": [ { "word": "Coherent", "weight": 5 }, { "word": "Thresholds", "weight": 4 }, { "word": "NeutralAtoms", "weight": 4 }, { "word": "LDPC", "weight": 4 }, { "word": "Topological", "weight": 3 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Decoding", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "Repeaters", "weight": 2 }, { "word": "Architecture", "weight": 3 }, { "word": "Testability", "weight": 2 }, { "word": "Benchmarking", "weight": 2 }, { "word": "Automorphism", "weight": 2 }, { "word": "Holomorphic", "weight": 2 }, { "word": "Chemistry", "weight": 2 } ], "social_highlights": "Highlights: faster surface-code state prep on neutral atoms, coherent-error thresholds proven for qLDPC and topological codes, a scalability definition for logical qubits, asymptotically good testable quantum codes, limits of automorphism gates mapped, efficient non-Clifford failure-rate estimation, an open QECirc circuit library, real-time FT-Weave compilation, hybrid repeater chains for entanglement distribution, holomorphic QEC geometry, heterogeneous quantum architecture blueprint, local unitary equivalence of orthogonal arrays, and a neutral-atom review for chemistry and materials science.", "papers": [ { "arxiv_id": "2609.20183", "title": "Fast Unitary Preparation of Surface-Code Logical States on Neutral-Atom Hardware", "authors": "Ludwig Schmid, Robert Wille", "arxiv_url": "https://arxiv.org/abs/2609.20183", "pdf_url": "https://arxiv.org/pdf/2609.20183", "summary": "This work introduces a measurement-free, unitary protocol for preparing surface-code Pauli eigenstates tailored to neutral-atom hardware. A bidirectional stabilizer-expanding CNOT cascade grows the code patch from its middle line outward, achieving depth $(d+3)/2$ while preserving fault distance $d$ in the protected direction. Each layer maps directly to a collective atom move plus a single global Rydberg pulse, minimizing costly measurement and shuttling operations.", "motivation": "Measurement-based logical state preparation is especially costly on neutral atoms because measurements are much slower than gates and require shuttling atoms to readout zones. As surface codes reach sub-threshold performance experimentally, reducing the overhead of essential primitives like logical state preparation becomes critical for practical fault-tolerant quantum computing.", "highlights": [ "Bidirectional middle-out CNOT cascade halves preparation depth to $(d+3)/2$", "Each layer maps to one collective atom move plus a single global Rydberg pulse", "Achieves lowest logical error rate and is the only tested scheme below threshold for both logical states" ], "keywords": [ { "label": "Surface Codes", "reason": "The paper focuses on preparing surface-code logical Pauli eigenstates" }, { "label": "Neutral Atoms", "reason": "The protocol is specifically tailored to neutral-atom hardware with Rydberg gates and AOD shuttling" }, { "label": "Unitary Encoding", "reason": "Uses measurement-free CNOT cascades instead of standard measurement-based stabilizer preparation" }, { "label": "Fault Tolerance", "reason": "Preserves fault distance $d$ in the protected error direction during state growth" } ], "emoji": "⚛️", "social_summary": "New measurement-free protocol preps surface-code logical states twice as fast on neutral-atom quantum hardware.", "highlights_oneliner": "Fast unitary surface-code prep for neutral atoms" }, { "arxiv_id": "2609.20537", "title": "Coherent error threshold for quantum LDPC codes", "authors": "Zhengyi Han, Yuanchen Zhao, Yijia Xu, Yixu Wang, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2609.20537", "pdf_url": "https://arxiv.org/pdf/2609.20537", "summary": "This paper proves that general quantum LDPC codes admit a nonzero code capacity threshold against local coherent and general local channel noise. For any qLDPC family with distance $d=\\Omega(\\log n)$, the logical recovery error in diamond distance decays exponentially with $d$ below a constant noise strength, holding for both optimal recovery and minimum-weight decoding.", "motivation": "While stochastic Pauli noise thresholds for qLDPC codes are well understood, coherent errors produce interfering superpositions of error patterns that evade standard analysis, leaving a major gap in fault-tolerance theory. Resolving whether qLDPC codes are robust to coherent noise is essential for realistic hardware where imperfect control causes coherent errors.", "highlights": [ "Establishes nonzero code capacity threshold for qLDPC codes against local coherent noise", "Introduces cluster resummation technique to control interference in error superpositions", "Proves exponential suppression of diamond-distance recovery error for both optimal and minimum-weight decoders" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The central object of study is general quantum low-density parity-check codes" }, { "label": "Coherent Errors", "reason": "Focuses specifically on coherent, non-stochastic noise models" }, { "label": "Thresholds", "reason": "Establishes a rigorous nonzero code capacity threshold result" }, { "label": "Cluster Expansion", "reason": "Introduces cluster resummation as the key technical tool" } ], "emoji": "🧵", "social_summary": "Researchers prove quantum LDPC codes have a real threshold against tricky coherent noise, not just random errors.", "highlights_oneliner": "Coherent noise thresholds proven for qLDPC codes" }, { "arxiv_id": "2609.20549", "title": "Scalable logical qubits", "authors": "Matthias Troyer, Chetan Nayak, John Martinis", "arxiv_url": "https://arxiv.org/abs/2609.20549", "pdf_url": "https://arxiv.org/pdf/2609.20549", "summary": "This paper introduces a formal definition of scalable logical qubits: logical qubits maintained across long computations via repeated quantum error correction, supporting fault-tolerant universal operations with low-latency real-time decoding, and replicable to hundreds or thousands of copies. The authors characterize scalable logical qubits along four coupled dimensions—reliability, scale, capability, and performance—and discuss the trade-offs between them.", "motivation": "As quantum computing moves toward utility-scale applications requiring error rates far below physical qubit capabilities, the field lacks a standardized, measurable definition of progress on logical qubits. A shared framework is needed to make claims about logical qubit performance comparable across different hardware platforms and research groups.", "highlights": [ "Defines scalable logical qubits along four coupled dimensions: reliability, scale, capability, performance", "Requires low-latency real-time decoding and feedback as a core criterion", "Frames replicability to hundreds or thousands of logical qubits as essential for applications" ], "keywords": [ { "label": "Logical Qubits", "reason": "The paper's central concept is defining scalable logical qubits" }, { "label": "Benchmarking", "reason": "Provides a framework to make logical qubit progress measurable and comparable" }, { "label": "Real-Time Decoding", "reason": "Low-latency decoding and feedback is highlighted as a required capability" }, { "label": "Fault Tolerance", "reason": "Scalable logical qubits are tied to universal fault-tolerant operations" } ], "emoji": "📏", "social_summary": "Industry leaders propose a clear, measurable definition of what makes a logical qubit truly scalable.", "highlights_oneliner": "A framework for defining scalable logical qubits" }, { "arxiv_id": "2609.20708", "title": "Proof of a positive coherent-error threshold for topological quantum codes", "authors": "Shiro Tamiya, Masato Koashi", "arxiv_url": "https://arxiv.org/abs/2609.20708", "pdf_url": "https://arxiv.org/pdf/2609.20708", "summary": "This paper rigorously proves that a positive threshold exists for coherent $Z$-rotation errors in quantum LDPC codes with a bounded number of logical qubits, including the surface code and other topological codes. The proof shows maximum-likelihood Pauli recovery suppresses entanglement infidelity exponentially in code distance $d$, up to a prefactor linear in the number of physical qubits, using Fourier analysis combined with cluster expansion of polymer models.", "motivation": "Numerical studies have suggested threshold behavior for the surface code under coherent errors, but no rigorous proof previously existed, leaving a gap given that real device errors like miscalibrated rotations are often coherent rather than stochastic. Closing this gap strengthens the theoretical foundation of QEC for realistic, non-Pauli noise sources.", "highlights": [ "First rigorous proof of a positive threshold for coherent $Z$-rotation errors in topological codes", "Entanglement infidelity suppressed exponentially in code distance under maximum-likelihood recovery", "Combines Fourier analysis with cluster expansion of abstract polymer models to preserve interference effects" ], "keywords": [ { "label": "Coherent Errors", "reason": "The paper addresses coherent $Z$-rotation error models rather than stochastic noise" }, { "label": "Topological Codes", "reason": "Results apply to the surface code and other topological quantum codes" }, { "label": "Thresholds", "reason": "Establishes a rigorous positive threshold proof" }, { "label": "Polymer Models", "reason": "Uses statistical-mechanical cluster expansion of abstract polymer models in the proof" } ], "emoji": "🌀", "social_summary": "Scientists finally prove rigorously that surface codes have a real threshold against coherent rotation errors.", "highlights_oneliner": "Rigorous coherent-error threshold for topological codes" }, { "arxiv_id": "2609.20780", "title": "Asymptotically Good Quantum Locally Testable Codes", "authors": "William Gay, Fernando Granha Jeronimo", "arxiv_url": "https://arxiv.org/abs/2609.20780", "pdf_url": "https://arxiv.org/pdf/2609.20780", "summary": "This paper constructs explicit families of asymptotically good quantum locally testable codes (LTCs) over qubits. The resulting quantum LDPC CSS codes achieve constant rate, constant relative distance, and constant-weight local testers with constant soundness simultaneously.", "motivation": "Locally testable codes let global code membership be verified by examining only a few coordinates, a property long sought together with good rate and distance in the quantum setting. Achieving all these properties simultaneously and explicitly resolves a major open problem bridging classical coding theory techniques and quantum LDPC code constructions.", "highlights": [ "Explicit construction of asymptotically good quantum LTCs over qubits", "Achieves constant rate, constant relative distance, and constant soundness simultaneously", "Builds on higher-dimensional complex generalizations of expander-based LDPC constructions" ], "keywords": [ { "label": "LDPC", "reason": "The codes are quantum LDPC CSS codes with bounded check weights" }, { "label": "Local Testability", "reason": "The paper's core contribution is constant-weight local testers with constant soundness" }, { "label": "CSS Codes", "reason": "The construction is explicitly built as CSS quantum codes" }, { "label": "Expander Codes", "reason": "Techniques build on expander-graph-based constructions generalized to higher dimensions" } ], "emoji": "🧩", "social_summary": "New explicit quantum codes achieve good rate, distance, and local testability all at once, a long-sought goal.", "highlights_oneliner": "Explicit good quantum locally testable codes" }, { "arxiv_id": "2609.19250", "title": "Achieving the limits of automorphism gates", "authors": "Jin Ming Koh, Shayan Majidy, Aranya Chakraborty, Anqi Gong, Shi Jie Samuel Tan, Norman Y. Yao", "arxiv_url": "https://arxiv.org/abs/2609.19250", "pdf_url": "https://arxiv.org/pdf/2609.19250", "summary": "This work develops a general theory of automorphism gates—cheap logical operations using only physical single-qubit Clifford gates and qubit permutations. For stabilizer codes with $k\\geq3$ logical qubits, the authors show the largest attainable logical group is generated by all addressable $S$ and $CX$ gates, construct codes achieving it, and derive tight qubit-count bounds of $n=\\Theta(2^k)$ versus $n=\\Theta(k^2)$ for diagonal-only gate sets.", "motivation": "Fault-tolerant quantum computing trades off versatile expensive operations against cheap specialized ones, and automorphism gates are a leading class of cheap operations, yet no general theory characterized their maximum logical power or minimum code size. Understanding these limits is essential for designing resource-efficient fault-tolerant architectures.", "highlights": [ "Shows largest automorphism-attainable logical group is generated by addressable $S$ and $CX$ gates for $k\\geq3$", "Proves tight qubit costs: $n=\\Theta(2^k)$ for full automorphism power versus $n=\\Theta(k^2)$ for diagonal Clifford gates", "Extends polynomial qubit-cost result to all addressable diagonal gates at any level of the Clifford hierarchy" ], "keywords": [ { "label": "Automorphism Gates", "reason": "The paper's central object of study is transversal automorphism gates using Cliffords and permutations" }, { "label": "Stabilizer Codes", "reason": "Results apply generally to stabilizer and CSS codes encoding multiple logical qubits" }, { "label": "Clifford Hierarchy", "reason": "Bounds extend to addressable diagonal gates at any level of the Clifford hierarchy" }, { "label": "Qubit Overhead", "reason": "Derives tight scaling bounds on physical qubit counts needed for logical gate sets" } ], "emoji": "🔄", "social_summary": "New theory pins down exactly how powerful cheap permutation-and-Clifford gates can be in fault-tolerant codes.", "highlights_oneliner": "Theory of maximal cheap automorphism logical gates" }, { "arxiv_id": "2609.19485", "title": "Efficiently estimating failure rates of fault-tolerant logical non-Clifford blocks", "authors": "Julio C. Magdalena de la Fuente, Thomas R. Scruby", "arxiv_url": "https://arxiv.org/abs/2609.19485", "pdf_url": "https://arxiv.org/pdf/2609.19485", "summary": "This paper presents an algebraic framework for efficiently sampling from the measurement distribution of fault-tolerant circuits implementing diagonal third-level Clifford hierarchy gates, which are otherwise not efficiently simulable. The method provides sufficient conditions for decoding success and yields an overestimate of logical failure rate that becomes tight for circuits fault-tolerant against arbitrary local errors, with non-Clifford overhead independent of the number of logical qubits.", "motivation": "Universal fault-tolerant quantum computation requires non-Clifford gates, but circuits implementing them are generically hard to simulate classically, limiting the ability to benchmark large-scale fault-tolerant designs. An efficient estimation method for non-Clifford block failure rates, scalable independent of qubit count, is crucial for evaluating practical architectures before hardware deployment.", "highlights": [ "Efficient sampling framework for third-level Clifford hierarchy diagonal gate circuits via cohomology invariants", "Non-Clifford simulation overhead independent of the number of logical qubits", "Provides sufficient conditions for decoding success and interfaces with Clifford simulators for larger circuits" ], "keywords": [ { "label": "Non-Clifford Gates", "reason": "The paper targets diagonal gates in the third level of the Clifford hierarchy" }, { "label": "Fault Tolerance", "reason": "Estimates logical failure rates of fault-tolerant circuit blocks" }, { "label": "Simulation", "reason": "Develops an efficient classical sampling method for otherwise hard-to-simulate circuits" }, { "label": "Decoding", "reason": "Provides sufficient conditions for decoding success within the framework" } ], "emoji": "🎲", "social_summary": "New algebraic trick lets researchers efficiently simulate failure rates of tricky non-Clifford quantum gate circuits.", "highlights_oneliner": "Efficient failure-rate estimation for non-Clifford circuits" }, { "arxiv_id": "2609.20182", "title": "QECirc: A Community-Driven, FAIR Library of Quantum Error Correction Circuits", "authors": "Ludwig Schmid, Tom Peham, Robert Wille", "arxiv_url": "https://arxiv.org/abs/2609.20182", "pdf_url": "https://arxiv.org/pdf/2609.20182", "summary": "This paper presents QECirc, a community-driven, open library making quantum error correction circuits Findable, Accessible, Interoperable, and Reusable (FAIR). Each entry links to underlying code, ships in Stim and OpenQASM formats with interactive visualizations, and is checked for correctness before publication, complementing code catalogs like the Error Correction Zoo by providing concrete implementable circuits.", "motivation": "QEC circuits realizing codes—encoders, state-preparation routines, syndrome-extraction schedules—are scattered across papers and ad-hoc repositories in incompatible formats, forcing researchers to repeatedly re-derive the same circuits. A standardized, FAIR resource is needed to enable reproducibility and fair comparison across fault-tolerant architecture research.", "highlights": [ "Provides circuits in both Stim and OpenQASM formats with interactive visualizations", "Every entry is correctness-checked before publication with stabilizer check matrices included", "Complements code catalogs like the Error Correction Zoo by supplying concrete, reusable circuit implementations" ], "keywords": [ { "label": "Open Source", "reason": "QECirc is a community-driven open library for sharing circuits" }, { "label": "FAIR Data", "reason": "The library is explicitly designed around FAIR data principles" }, { "label": "Encoders", "reason": "The library catalogs encoders and logical state-preparation circuits" }, { "label": "Syndrome Extraction", "reason": "Syndrome-extraction schedules are among the circuit types curated" } ], "emoji": "📚", "social_summary": "New open library QECirc collects and standardizes quantum error correction circuits so researchers stop reinventing them.", "highlights_oneliner": "An open FAIR library of QEC circuits" }, { "arxiv_id": "2609.20573", "title": "FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures", "authors": "Wan-Hsuan Lin, Milan Kornjača, Chen Zhao, Sheng-Tao Wang, Jason Cong", "arxiv_url": "https://arxiv.org/abs/2609.20573", "pdf_url": "https://arxiv.org/pdf/2609.20573", "summary": "This paper introduces FT-Weave, a stage-aware real-time compilation framework for fault-tolerant quantum computing that jointly coordinates resource preparation, assignment, teleportation routing, and correction handling, responding dynamically to stochastic resource-preparation outcomes rather than relying on fixed offline schedules. It is instantiated on two neutral-atom early-FTQC architectures (transversal STAR and a $T$-state cultivation architecture), achieving up to $3\\times$ speedup over baseline compilation for 2D transverse-field Ising model simulations.", "motivation": "As FTQC hardware matures beyond simple qubit-count scaling, coordinating resource preparation, routing, and logical execution under stochastic outcomes becomes a critical bottleneck limiting real application throughput. Existing offline scheduling methods assume fixed magic-state factory throughput and cannot adapt to runtime variability, leading to stalls and underutilized hardware.", "highlights": [ "Achieves up to $3\\times$ speedup over baseline compilation on 2D transverse-field Ising model simulations", "Instantiated on two representative neutral-atom EFTQC architectures: transversal STAR and $T$-state cultivation", "Shows that maximizing exposed concurrency does not always minimize execution time due to routing contention" ], "keywords": [ { "label": "Compilation", "reason": "The paper's core contribution is a real-time compilation framework, FT-Weave, for FTQC execution." }, { "label": "Neutral Atoms", "reason": "FT-Weave is instantiated and evaluated on neutral-atom early fault-tolerant architectures." }, { "label": "Magic States", "reason": "Resource preparation and $T$-state cultivation architectures are central to the studied hardware model." }, { "label": "Scheduling", "reason": "The framework coordinates real-time scheduling of teleportation, routing, and correction handling." } ], "emoji": "🧵", "social_summary": "FT-Weave dynamically schedules quantum resource prep and routing in real time, delivering up to 3x speedup for fault-tolerant quantum architectures.", "highlights_oneliner": "Real-time compiler speeds up fault-tolerant quantum execution 3x" }, { "arxiv_id": "2609.19783", "title": "Scalable entanglement distribution using encoded hybrid repeater chains", "authors": "Stav Haldar, Saikat Guha, Don Towsley, Filip Rozpędek", "arxiv_url": "https://arxiv.org/abs/2609.19783", "pdf_url": "https://arxiv.org/pdf/2609.19783", "summary": "This work proposes hybrid quantum repeater architectures that combine fast-multiplexed type-1 memories with long-coherence, low-error type-2 memories, using only a subset of hybrid nodes with error correction while the rest remain simple first-generation repeaters. Through detailed Monte Carlo simulations with circuit-level noise using the three-qubit repetition code, $[[7,1,3]]$ Steane code, and $[[9,1,3]]$ Shor code, the authors show these hybrid chains outperform single-platform architectures in end-to-end entanglement distribution rate.", "motivation": "Long-distance entanglement distribution demands error correction to counteract memory decoherence and swapping noise, but no single quantum memory platform simultaneously offers fast multiplexed generation and long coherence with low gate error. Combining complementary memory technologies into resource-efficient hybrid repeater chains addresses this practical trade-off for scalable quantum networks.", "highlights": [ "Hybrid repeater chains with a subset of error-correcting nodes outperform single-platform architectures in entanglement rate", "Full circuit-level noise model captures imperfect interfaces between type-1 and type-2 memory platforms", "Modified swap-as-soon-as-possible policy with multiplexing significantly reduces memory storage time requirements" ], "keywords": [ { "label": "Quantum Repeaters", "reason": "The paper's central architecture is a hybrid quantum repeater chain for long-distance entanglement distribution." }, { "label": "Steane Code", "reason": "The $[[7,1,3]]$ Steane code is one of the fault-tolerant encodings analyzed for repeater error correction." }, { "label": "Shor Code", "reason": "The $[[9,1,3]]$ Shor code is used as an alternative fault-tolerant encoding scheme in simulations." }, { "label": "Multiplexing", "reason": "Multiplexed link generation and a modified swap policy are key to improving entanglement rates." } ], "emoji": "🔗", "social_summary": "Hybrid quantum repeater chains mixing fast and long-lived memories boost long-distance entanglement rates using Steane and Shor codes.", "highlights_oneliner": "Hybrid memory repeater chains improve entanglement distribution rates" }, { "arxiv_id": "2609.19162", "title": "Holomorphic Quantum Error Correction Codes", "authors": "M. W. AlMasri", "arxiv_url": "https://arxiv.org/abs/2609.19162", "pdf_url": "https://arxiv.org/pdf/2609.19162", "summary": "This paper develops a holomorphic representation of quantum error correction codes in the Segal-Bargmann space, encoding qubits into Schwinger boson modes subject to a homogeneity constraint and deriving differential operator representations of stabilizers, syndrome extraction, and recovery for the three-, five-, seven-, and nine-qubit codes. Restricting to unit-magnitude variables reveals a toroidal space $\\mathbb{T}^{2n}$ where syndromes appear as winding-number translations in $\\mathbb{Z}^{2n}$, while in the full space the code space becomes a holomorphic submanifold of $\\mathbb{CP}^{2^n-1}$ with the Knill-Laflamme condition recast as Fubini-Study orthogonality.", "motivation": "Standard stabilizer-formalism treatments of QEC, while computationally powerful, obscure the underlying geometric and topological structures connecting code spaces, errors, and recovery maps, especially given emerging links between QEC and holographic duality. A geometric, holomorphic reformulation offers a unifying language that connects algebraic QEC theory to Kähler geometry, topology, and semiclassical dynamics.", "highlights": [ "Derives closed-form differential operator representations of stabilizers and recovery for the $3$-, $5$-, $7$-, and $9$-qubit codes", "Shows error syndromes appear as discrete winding-number translations in $\\mathbb{Z}^{2n}$ on a toroidal space $\\mathbb{T}^{2n}$", "Recasts the Knill-Laflamme condition as a Fubini-Study orthogonality condition between code submanifolds in $\\mathbb{CP}^{2^n-1}$" ], "keywords": [ { "label": "Stabilizer Codes", "reason": "The paper reformulates stabilizer QEC codes including the $3$-, $5$-, $7$-, and $9$-qubit codes in holomorphic language." }, { "label": "Segal-Bargmann", "reason": "The Segal-Bargmann holomorphic representation is the central mathematical framework used." }, { "label": "Knill-Laflamme", "reason": "The paper reinterprets the Knill-Laflamme correctability condition geometrically via Fubini-Study orthogonality." }, { "label": "Topological Protection", "reason": "The $U(1)^n$ fiber bundle structure gives a topological protection mechanism against global phase noise." } ], "emoji": "🌀", "social_summary": "A new holomorphic geometric framework recasts stabilizer QEC codes as Kähler manifolds with winding-number error syndromes.", "highlights_oneliner": "Geometric holomorphic reformulation of stabilizer QEC codes" }, { "arxiv_id": "2609.19639", "title": "Quantum computers will not be that different: A blueprint for quantum computer architecture at scale", "authors": "Torsten Hoefler, Matthias Troyer", "arxiv_url": "https://arxiv.org/abs/2609.19639", "pdf_url": "https://arxiv.org/pdf/2609.19639", "summary": "This paper argues that utility-scale quantum computer architecture is fundamentally a cost-performance engineering problem across a coupled quantum-classical system, analogous to classical heterogeneous accelerator design. The authors propose a blueprint organized around clean logical abstractions that hide physical qubit modality details below an instruction set architecture boundary, with specialized hardware for control, readout, and quantum error correction resembling high-performance network stack design.", "motivation": "Quantum computers are often perceived as requiring entirely novel architectural paradigms, but scaling to utility-level computation demands systems engineering discipline similar to classical computing and networking. Drawing on established practices from heterogeneous accelerators and network stacks can guide practical, cost-effective quantum architecture design.", "highlights": [ "Frames utility-scale QPU design as a cost-performance optimization problem across coupled quantum-classical systems", "Proposes an ISA abstraction boundary hiding physical qubit modality details from higher-level architecture", "Draws direct analogies between QEC hardware stacks and high-performance network stack architectures" ], "keywords": [ { "label": "Architecture", "reason": "The paper's central contribution is a systems architecture blueprint for scalable quantum computers." }, { "label": "ISA Abstraction", "reason": "A key proposal is a clean instruction set architecture boundary hiding physical qubit details." }, { "label": "QEC Hardware", "reason": "Specialized local hardware for control, readout, and quantum error correction is a core architectural component discussed." }, { "label": "Heterogeneous Computing", "reason": "The blueprint draws on classical heterogeneous accelerator design principles." } ], "emoji": "🏗️", "social_summary": "Hoefler and Troyer propose treating quantum computer architecture like classical heterogeneous systems, with clean abstractions and specialized QEC hardware.", "highlights_oneliner": "Classical systems-design blueprint for scalable quantum architectures" }, { "arxiv_id": "2609.19811", "title": "Local unitary equivalence of orthogonal arrays and related linear codes", "authors": "Miaomiao Zheng, Yajuan Zang, Xiuling Shan, Zihong Tian", "arxiv_url": "https://arxiv.org/abs/2609.19811", "pdf_url": "https://arxiv.org/pdf/2609.19811", "summary": "This paper studies local unitary (LU) equivalence of orthogonal arrays (OAs) and irredundant orthogonal arrays (IrOAs) constructed from generator matrices, establishing conditions for Fourier-based LU equivalence. For prime alphabets, the authors identify Fourier partners of linear OAs with arrays of their corresponding dual codes, giving an explicit connection between LU equivalence and coding theory, along with new families of LU equivalent OAs from specific linear codes.", "motivation": "Determining when orthogonal arrays correspond to LU equivalent multipartite quantum states, as posed by Goyeneche and Życzkowski, is an important open problem linking combinatorial design theory to quantum entanglement classification. Establishing explicit connections to coding theory via dual codes provides concrete tools for constructing and classifying $k$-uniform and AME quantum states used in error-correcting and entanglement applications.", "highlights": [ "Establishes conditions for Fourier-based $LU$ equivalence of OAs and IrOAs constructed from generator matrices", "Identifies Fourier partners of linear OAs with the arrays of their corresponding dual codes for prime alphabets", "Constructs new families of $LU$ equivalent OAs arising from specific classes of linear codes" ], "keywords": [ { "label": "Orthogonal Arrays", "reason": "Orthogonal arrays are the central combinatorial object studied for LU equivalence classification." }, { "label": "LU Equivalence", "reason": "The paper's main technical contribution is determining local unitary equivalence conditions." }, { "label": "Dual Codes", "reason": "The Fourier partners of linear OAs are identified with arrays from corresponding dual linear codes." }, { "label": "k-Uniform States", "reason": "IrOAs correspond to $k$-uniform multipartite entangled quantum states relevant to error correction." } ], "emoji": "🔢", "social_summary": "New Fourier-based conditions link orthogonal arrays, dual linear codes, and local unitary equivalence of multipartite quantum states.", "highlights_oneliner": "Fourier links orthogonal arrays to dual codes and LU equivalence" }, { "arxiv_id": "2609.20464", "title": "Neutral atom quantum computing for materials science and quantum chemistry", "authors": "J. D. Pritchard", "arxiv_url": "https://arxiv.org/abs/2609.20464", "pdf_url": "https://arxiv.org/pdf/2609.20464", "summary": "This review provides a broad overview of the neutral atom quantum computing platform, covering both digital and analogue paradigms, from large-scale programmable Hamiltonian simulation of topological phases and weighted graph optimization to error-corrected logical qubits with transverse gate operations. It surveys the potential applications of these capabilities specifically for materials science and quantum chemistry problems.", "motivation": "Neutral atom arrays have rapidly emerged as a leading platform combining scalability, programmability, and recent demonstrations of fault-tolerant logical qubit operations, making a comprehensive assessment of their applicability to materials and chemistry problems timely. Understanding the roadmap toward utility-scale logical qubit counts is essential given the demanding resource requirements of quantum chemistry simulations.", "highlights": [ "Surveys neutral atom demonstrations of error-corrected logical qubits with transverse gate operations", "Describes Rydberg blockade-based mapping of Maximum Independent Set graph optimization onto unit-disk graphs", "Argues fault-tolerant platforms with tens to hundreds of logical qubits will be feasible within a few years" ], "keywords": [ { "label": "Neutral Atoms", "reason": "The paper reviews the neutral atom platform as the central quantum computing hardware architecture." }, { "label": "Rydberg Blockade", "reason": "The blockade mechanism underlies analogue simulation and graph optimization mapping described." }, { "label": "Logical Qubits", "reason": "Error-corrected logical qubits with transverse gates are a highlighted recent hardware achievement." }, { "label": "Quantum Chemistry", "reason": "The review specifically targets applications in materials science and quantum chemistry simulation." } ], "emoji": "⚛️", "social_summary": "This review surveys how neutral atom quantum computers, including fault-tolerant logical qubits, could tackle materials science and chemistry problems.", "highlights_oneliner": "Neutral atom platforms surveyed for chemistry and materials applications" } ] }, "2026-09-17": { "word_cloud": [ { "word": "Magic", "weight": 5 }, { "word": "Cultivation", "weight": 5 }, { "word": "Fidelity", "weight": 2 }, { "word": "Flags", "weight": 3 }, { "word": "TensorNetworks", "weight": 3 }, { "word": "Liouvillian", "weight": 3 }, { "word": "Coherent", "weight": 3 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Qudits", "weight": 3 }, { "word": "Kitaev", "weight": 2 }, { "word": "Toric", "weight": 2 }, { "word": "CSS", "weight": 2 }, { "word": "QKD", "weight": 2 }, { "word": "ReedSolomon", "weight": 2 }, { "word": "Photonic", "weight": 3 } ], "social_highlights": "Highlights: flag qubits restore magic state fault distance, exact analytics expose hidden distance loss, tensor networks compare cultivation schemes, Liouvillian framework tracks coherent logical errors, AI-advice certification secures toric codes, qudit stabilizer theory extends to twisted Kitaev models, CSS codes aid underwater QKD, Reed-Solomon bounds hide reference-frame history, algorithmic design automates photonic entangled states.", "papers": [ { "arxiv_id": "2609.17706", "title": "Diagnosing and Restoring the Degraded Fault Distance of Magic State Cultivation", "authors": "Tim Chan, Armands Strikis, Zhu Sun, Zhenyu Cai", "arxiv_url": "https://arxiv.org/abs/2609.17706", "pdf_url": "https://arxiv.org/pdf/2609.17706", "summary": "The authors analytically show, under circuit-level depolarizing noise, that distance-3 and distance-5 $T$-state cultivation have reduced fault distances of 2 and 3 respectively, due to Pauli hook errors propagating into coherent Clifford errors after the final double-check circuit. They derive a general $\\mathcal{O}(n^3)$-time algorithm for computing acceptance probabilities of logical mixed states afflicted with Clifford errors, and design flag qubits that detect the malignant hook errors, improving the pre-escape logical error rate scaling from $\\mathcal{O}(p^3)$ to $\\mathcal{O}(p^5)$.", "motivation": "Recent benchmarks revealed that $T$-state cultivation performs considerably worse than the analogous $S$-state cultivation despite being designed to have the same fault distance, and understanding this discrepancy is essential since cultivation protocols are central to reducing the resource cost of fault-tolerant magic state preparation. This work pinpoints the root mechanistic cause and proposes a concrete fix that restores the intended error suppression.", "highlights": [ "Proves distance-3 and distance-5 $T$-state cultivation have fault distances 2 and 3, not 3 and 5", "Introduces $\\mathcal{O}(n^3)$-time algorithm for acceptance probability under Clifford errors", "Flag-based fix gives $4.9\\times$ logical error rate improvement at $p=10^{-3}$ for $1.36\\times$ attempt cost" ], "keywords": [ { "label": "Magic States", "reason": "The paper studies cultivation of logical $T$ states as a resource for fault-tolerant computation" }, { "label": "Fault Distance", "reason": "Central concept analyzed showing degradation from intended distance-3/5 to 2/3" }, { "label": "Hook Errors", "reason": "Pauli hook errors propagating to coherent Clifford errors are identified as the root cause" }, { "label": "Flag Qubits", "reason": "Proposed flags detect malignant hook errors to restore error suppression" } ], "emoji": "🪄", "social_summary": "Researchers explain why T-state magic state cultivation underperforms and fix it with flag qubits, boosting error suppression nearly 5x.", "highlights_oneliner": "Explains and fixes degraded T-state cultivation fault distance" }, { "arxiv_id": "2609.18922", "title": "Exact logical error rates for magic state cultivation", "authors": "Kwok Ho Wan, Ainhoa Zapirain", "arxiv_url": "https://arxiv.org/abs/2609.18922", "pdf_url": "https://arxiv.org/pdf/2609.18922", "summary": "The authors compute exact acceptance and logical error rates for distance-3 and distance-5 magic state cultivation circuits using Pauli propagation and binary tensor contraction, studying actual $T$ gates rather than the $S$-gate proxy. They provide series expansions of logical error rates through order $(p/(1-p))^{10}$ and confirm that the $d=3$ and $d=5$ circuits have fault distances $d_{\\text{fault}}=2$ and $d_{\\text{fault}}=3$ respectively.", "motivation": "Magic state cultivation achieves very low logical error rates that are prohibitively expensive to resolve via direct Monte Carlo sampling, and it was previously unclear whether the cheaper $S$-gate proxy faithfully represents the true $T$-gate circuit performance. Exact analytical computation resolves this uncertainty and independently confirms the reduced fault distance phenomenon.", "highlights": [ "Exact computation of acceptance and logical error rates for real $T$-gate cultivation circuits", "Series expansion of logical error rate through order $(p/(1-p))^{10}$", "Independently confirms fault distances $d_{\\text{fault}}=2$ and $3$ for $d=3,5$ cultivation" ], "keywords": [ { "label": "Magic States", "reason": "Paper computes exact logical error rates for magic state cultivation circuits" }, { "label": "Pauli Propagation", "reason": "Core technique used to compute exact fault-order contributions" }, { "label": "Tensor Contraction", "reason": "Binary tensor contraction used alongside Pauli propagation for exact simulation" }, { "label": "Colour Codes", "reason": "Cultivation circuits are built on triangular colour codes of distance 3 and 5" } ], "emoji": "🧮", "social_summary": "Exact analytical calculations confirm magic state cultivation circuits secretly have lower fault distance than intended.", "highlights_oneliner": "Exact error rate calculation for T-gate cultivation" }, { "arxiv_id": "2609.19116", "title": "Comparing magic state cultivation methods using matrix product states", "authors": "Tom Hartweg, Asier Piñeiro Orioli", "arxiv_url": "https://arxiv.org/abs/2609.19116", "pdf_url": "https://arxiv.org/pdf/2609.19116", "summary": "The authors use matrix-product state and Clifford-augmented MPS methods to exactly simulate two fold-transversal magic state cultivation schemes, including the Sahay et al. surface-code method and a new partially fault-tolerant fold-transversal $S$-gate scheme. They find the surface-code scheme's $|T\\rangle$ output matches the $|S\\rangle$ proxy at $d=5$, unlike the $\\sim10\\times$ discrepancy seen in colour-code cultivation, and their new scheme achieves $\\sim1.3\\times$ lower space-time cost at $10^{-9}$ logical error rate.", "motivation": "Non-Clifford magic state cultivation circuits are difficult to simulate exactly, leaving the true performance of competing cultivation schemes uncertain and complicating fair comparisons between protocols. Establishing exact benchmarks via tensor-network methods clarifies which schemes genuinely deliver on promised low space-time overheads.", "highlights": [ "Surface-code $|T\\rangle$ and $|S\\rangle$ outputs match at $d=5$, unlike colour-code's $10\\times$ gap", "New fold-transversal $S$-gate scheme achieves $1.3\\times$ lower space-time cost at $10^{-9}$ logical error rate", "MPS/CAMPS match or beat the Clifft near-Clifford simulator on hardest $d=5$ cases" ], "keywords": [ { "label": "Magic States", "reason": "Paper compares cultivation schemes for producing high-fidelity magic states" }, { "label": "Tensor Networks", "reason": "MPS and CAMPS methods are the core simulation tool used" }, { "label": "Surface Codes", "reason": "Fold-transversal schemes are built on the regular surface code" }, { "label": "Pauli Propagation", "reason": "Used as a pre-screening method to speed up exact simulations" } ], "emoji": "🧵", "social_summary": "Tensor network simulations reveal surface-code magic state cultivation performs better than colour-code variants, plus a cheaper new scheme.", "highlights_oneliner": "MPS benchmarks reveal true cultivation scheme performance" }, { "arxiv_id": "2609.18978", "title": "Code-Visible Liouvillian Modes and Coherent Logical Errors in Quantum Codes", "authors": "Marina Gordeychuk, Oleg Kiselev", "arxiv_url": "https://arxiv.org/abs/2609.18978", "pdf_url": "https://arxiv.org/pdf/2609.18978", "summary": "The authors apply observability and minimal realization theory from linear systems to Lindbladian dynamics propagated through an encoding-recovery-decoding scheme, defining a minimal code-visible space via Krylov closure of decodable logical observables. This framework recovers the Knill-Laflamme conditions as a short-time check, reduces Pauli noise on stabilizer codes to a Markov chain on syndrome-logical classes, and characterizes recovery maps as spectral filters revealing coherent noise signatures.", "motivation": "Coherent Hamiltonian drifts behave differently under quantum error correction than stochastic Pauli noise, since Pauli twirling erases phase relations that can manifest as logical rotations and non-monotonic fidelity. A systematic tool connecting continuous physical dynamics to the discrete logical channel is needed to understand which spectral components of noise actually survive recovery and decoding.", "highlights": [ "Defines minimal code-visible space via Krylov closure of decodable logical observables", "Shows Knill-Laflamme conditions emerge as a short-time consistency check within the framework", "Characterizes recovery map choice as a spectral filter on visible Liouvillian modes" ], "keywords": [ { "label": "Liouvillian", "reason": "Paper analyzes Lindbladian/Liouvillian dynamics propagated through the logical channel" }, { "label": "Coherent Noise", "reason": "Focus is on coherent errors and their spectral signatures distinct from Pauli noise" }, { "label": "Knill-Laflamme", "reason": "The conditions are recovered as a short-time consistency check in this framework" }, { "label": "Quantum Memory", "reason": "Storage time estimates derived from dominant visible eigenvalues of the logical channel" } ], "emoji": "🌀", "social_summary": "A new linear-systems framework reveals which coherent noise modes actually survive quantum error correction's recovery and decoding.", "highlights_oneliner": "Observability theory reveals coherent noise signatures in QEC" }, { "arxiv_id": "2609.19090", "title": "Securing quantum error correction against misleading advice from AI agents", "authors": "A. Barış Özgüler", "arxiv_url": "https://arxiv.org/abs/2609.19090", "pdf_url": "https://arxiv.org/pdf/2609.19090", "summary": "The paper identifies an ambiguity in passive syndrome records of an odd-distance toric code where opposite coherent $X$ rotations produce identical syndrome-history distributions yet require opposite phase corrections, and shows how calibration measurements on known encoded states resolve this sign ambiguity. A separate risk evaluator certifies recovery updates only when calibration uncertainty and a justified drift bound guarantee improvement, protecting against harmful AI-adviser recommendations while retaining beneficial updates.", "motivation": "As AI advisers become integrated into adaptive quantum error correction controllers, an adversary or drifting calibration could turn advice into harmful recovery updates, creating a novel security concern for QEC systems. This work addresses the practical need for certified, drift-aware acceptance criteria that protect against misleading advice without sacrificing legitimate improvements.", "highlights": [ "Identifies exact sign ambiguity where opposite coherent rotations yield identical passive syndrome statistics", "Proposes calibration-confidence evaluator that certifies recovery updates under drift and uncertainty", "Simulated attacks show the evaluator rejects harmful updates while retaining beneficial ones" ], "keywords": [ { "label": "Toric Code", "reason": "The odd-distance square toric code is the main testbed for the syndrome ambiguity analysis" }, { "label": "AI Security", "reason": "Paper addresses adversarial or misleading AI advice in QEC control loops" }, { "label": "Calibration", "reason": "Calibration measurements on encoded states resolve the syndrome sign ambiguity" }, { "label": "Coherent Errors", "reason": "Coherent X rotations are the noise model whose sign ambiguity is analyzed" } ], "emoji": "🛡️", "social_summary": "A new certification method protects quantum error correction systems from harmful updates suggested by misleading AI advisers.", "highlights_oneliner": "Certifying QEC recovery updates against adversarial AI advice" }, { "arxiv_id": "2603.29896", "title": "Qudit stabilizers beyond the free case and the twisted Kitaev model", "authors": "Ruslan Maksimau", "arxiv_url": "https://arxiv.org/abs/2603.29896", "pdf_url": "https://arxiv.org/pdf/2603.29896", "summary": "The paper extends the stabilizer formalism to qudits of arbitrary dimension $d$, proving that when the stabilizer subgroup $H$ is free as a $\\mathbb{Z}/d\\mathbb{Z}$-module with no nontrivial scalars, the protected space and normalizer quotient reduce to smaller qudit spaces and Pauli groups as in the qubit case. Removing the freeness assumption, the protected space instead becomes a tensor product of qudit spaces of possibly smaller dimensions, and the shifted free case is characterized as exactly when $N(H)/H$ remains an ordinary qudit Pauli group.", "motivation": "The stabilizer formalism underlies most practical quantum error-correcting codes but its standard theorems assume qubit or prime-dimension qudit settings where subgroups behave freely; general composite-dimension qudits require new algebraic tools. This algebraic generalization is particularly relevant for qudit Kitaev models and their shifted and twisted variants used in topological quantum codes.", "highlights": [ "Extends basic stabilizer theorem to free abelian subgroups of arbitrary-dimension qudit Pauli groups", "Shows non-free stabilizers reduce protected space to tensor products of smaller-dimension qudits", "Characterizes the shifted free case as exactly when $N(H)/H$ stays an ordinary Pauli group" ], "keywords": [ { "label": "Qudits", "reason": "Paper generalizes stabilizer formalism to arbitrary-dimension qudits beyond qubits" }, { "label": "Stabilizer Formalism", "reason": "Core algebraic framework being extended and generalized" }, { "label": "Kitaev Model", "reason": "Twisted and shifted qudit Kitaev models are explicit applications of the theory" }, { "label": "Pauli Group", "reason": "Normalizer quotient structure and its relation to qudit Pauli groups is central" } ], "emoji": "🔢", "social_summary": "A new algebraic theory extends the stabilizer formalism to qudits of any dimension, including twisted Kitaev models.", "highlights_oneliner": "Generalizing stabilizer formalism to arbitrary-dimension qudits" }, { "arxiv_id": "2609.18666", "title": "Impact of a CSS quantum error correction code in underwater quantum key distribution", "authors": "Juliette Florin, Nicolas Le Josse, Arnaud Coatanhay, Gilles Burel", "arxiv_url": "https://arxiv.org/abs/2609.18666", "pdf_url": "https://arxiv.org/pdf/2609.18666", "summary": "The authors develop a stochastic channel model for vertical underwater BB84 QKD incorporating photon loss, geometric spreading, and solar noise, then evaluate two four-qubit CSS quantum error correction codes against this channel using analytical QBER and secure key rate calculations validated by Monte Carlo simulation. They find the standard CSS code achieves a 3 dB SNR gain and a discard variant achieves 4.5 dB gain at the QBER security threshold, but encoding overhead reduces secure key rate except in marginal SNR regimes.", "motivation": "Underwater optical quantum channels suffer severe photon loss and noise that threaten the viability of secure maritime quantum communication, and existing literature lacks rigorous channel models coupling QECC performance to realistic oceanic conditions. This work provides concrete engineering guidance on when quantum error correction actually helps versus hurts underwater QKD throughput.", "highlights": [ "Standard 4-qubit CSS code gives 3 dB SNR gain, discard variant gives 4.5 dB gain at QBER threshold", "Identifies depth-range windows (290-335 m) where QECC enables otherwise infeasible communication", "Shows QECC is beneficial only in marginal SNR regimes; raw BB84 dominates at high SNR" ], "keywords": [ { "label": "CSS Codes", "reason": "Two four-qubit CSS quantum error correction codes are the core codes studied" }, { "label": "QKD", "reason": "The application domain is underwater BB84 quantum key distribution" }, { "label": "Erasure Channel", "reason": "Photon loss in underwater optical channels is modeled as an erasure channel" }, { "label": "Secure Key Rate", "reason": "SKR is the key performance metric evaluated with and without QECC" } ], "emoji": "🌊", "social_summary": "Underwater quantum key distribution gets a boost from CSS error correction, but only in marginal signal conditions.", "highlights_oneliner": "CSS codes evaluated for underwater quantum key distribution" }, { "arxiv_id": "2609.18948", "title": "Optimal Temporal Hiding in Correlated Quantum Reference-Frame Processes", "authors": "Maxim V. Churilov", "arxiv_url": "https://arxiv.org/abs/2609.18948", "pdf_url": "https://arxiv.org/pdf/2609.18948", "summary": "The paper studies finite group-valued temporal reference frames as correlated random-unitary processes, showing that when the carrier contains every irreducible representation, one ancilla-assisted input makes the strategy half-distance equal to total variation distance between trajectory laws, converting temporal hiding into a $q$-ary coding problem. Using nested code structures, the authors derive entropy-converse bounds relating payload, invisible depth, and sector distance, showing nested generalized Reed-Solomon codes achieve these bounds, and connect hiding coherent superpositions to quantum erasure correction.", "motivation": "Reference tokens used repeatedly over time can leak correlated historical information beyond independent noise models, and quantum combs alone do not quantify how much of this temporal process can be hidden from limited experimental access. This work provides an exact operational and coding-theoretic framework connecting classical trajectory privacy to coherent temporal privacy in quantum reference frame processes.", "highlights": [ "Shows strategy half-distance exactly equals total variation distance under full irrep resolution", "Derives entropy-converse bound relating payload, invisible depth, and decoding error", "Connects hiding coherent superpositions across $t$ slots to quantum erasure correction bound $\\log_q K+2t\\leq n$" ], "keywords": [ { "label": "Reference Frames", "reason": "Paper studies temporal quantum reference frame processes and their hiding properties" }, { "label": "Reed-Solomon", "reason": "Nested generalized Reed-Solomon codes are shown to attain the derived bounds" }, { "label": "Erasure Correction", "reason": "Hiding coherent superpositions is shown equivalent to quantum erasure correction" }, { "label": "Total Variation", "reason": "Strategy distance reduces exactly to total variation distance between group element laws" } ], "emoji": "🕰️", "social_summary": "New coding theory bounds quantify how much history a quantum reference frame process can hide over time.", "highlights_oneliner": "Coding-theoretic bounds for hiding quantum reference frame history" }, { "arxiv_id": "2609.18002", "title": "Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement", "authors": "Jaehee Kim, Hon Wai Lau, William J. Munro, Joonsuk Huh, Seungbeom Chin", "arxiv_url": "https://arxiv.org/abs/2609.18002", "pdf_url": "https://arxiv.org/pdf/2609.18002", "summary": "The authors formulate the design of heralded linear optical circuits as a graph-search problem using the linear quantum graph (LQG) picture, representing heralding operations as effective perfect matching (EPM) graphs. This framework enables automated construction and optimization of photonic circuits for generating a broad range of multipartite entangled resource states, including hypergraph magic states, quantum error-correcting codes, general three-qubit states, and caterpillar graph states.", "motivation": "Designing linear optical circuits to generate specific target entangled states has traditionally required intricate manual engineering due to the complexity of possible optical structures. By recasting this design problem as an algorithmic graph-search task, the work aims to systematize and scale up the discovery of heralded resource states essential for photonic quantum information processing.", "highlights": [ "Introduced an algorithmic framework based on EPM bigraph enumeration to automatically design heralded photonic circuits", "Applied the method to generate diverse resource states, including hypergraph magic states, quantum error-correcting codes, and caterpillar graph states", "Substantially reduced the search space for circuit design compared to brute-force approaches using the linear quantum graph representation" ], "keywords": [ { "label": "Linear Optics", "reason": "The paper designs heralded circuits within linear optical quantum computing architectures" }, { "label": "Graph States", "reason": "Target states and circuit structures are represented and searched via graph formalisms like EPM graphs" }, { "label": "Magic States", "reason": "Hypergraph magic states are among the resource states generated by the algorithm" }, { "label": "QEC Codes", "reason": "The framework is used to construct heralded schemes for quantum error correcting codes" } ], "emoji": "🔗", "social_summary": "Researchers turn photonic circuit design into a graph-search algorithm to automatically build heralded multipartite entangled states.", "highlights_oneliner": "Automated graph-search design of heralded photonic entanglement circuits" } ] }, "2026-09-16": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Magic", "weight": 5 }, { "word": "Distillation", "weight": 4 }, { "word": "Hyperbolic", "weight": 3 }, { "word": "Triorthogonal", "weight": 3 }, { "word": "Transmon", "weight": 2 }, { "word": "GKP", "weight": 3 }, { "word": "Bosonic", "weight": 3 }, { "word": "Compiler", "weight": 2 }, { "word": "Stabilizer", "weight": 2 }, { "word": "Metrology", "weight": 2 }, { "word": "Superdense", "weight": 2 }, { "word": "Phantom", "weight": 2 }, { "word": "Synthesis", "weight": 2 }, { "word": "Non-CSS", "weight": 2 } ], "social_highlights": "Highlights: hyperbolic color codes gain polynomial distance, non-CSS simulation reveals fault leaks, phantom codes exposed as hard yet optimal, exact magic state simulation up to distance seven, recursive qubit-recycled distillation shrinks overhead, GKP mitigation overhead characterized, compiler stack surveyed, asymptotically good triorthogonal codes enable constant-overhead magic distillation, pulse-level measurement-free recovery on transmons, sqrt(T) synthesis cuts costs, multiparameter metrology limits derived, bosonic capacity strong converse proven, joint classical-quantum superdense coding boosts LAN rates.", "papers": [ { "arxiv_id": "2609.16125", "title": "Hyperbolic color codes with constant rate and polynomial distance", "authors": "Shun Hasegawa, Hayata Yamasaki", "arxiv_url": "https://arxiv.org/abs/2609.16125", "pdf_url": "https://arxiv.org/pdf/2609.16125", "summary": "The authors construct hyperbolic color codes built on arithmetic hyperbolic manifolds that support polynomial-distance hyperbolic toric codes, achieving both constant encoding rate and polynomial code distance for dimensions $D\\geq 4$. In even dimensions, type-$D/2$ color codes achieve constant rate with polynomial distance, while other cases yield polynomial scaling in both logical qubit number and distance, with explicit exponents derived as functions of $D$ and code type.", "motivation": "Reducing physical qubit overhead motivates high-rate qLDPC codes, and hyperbolic geometries are known to enable constant rate with growing distance, a combination impossible on Euclidean lattices, but prior hyperbolic color codes only achieved logarithmic distance. Relaxed geometric-locality constraints in modern hardware (neutral atoms, ion shuttling) make such non-local high-rate codes practically relevant, especially given color codes' advantages for fault-tolerant protocols like single-shot error correction.", "highlights": [ "First hyperbolic color codes achieving simultaneously constant rate and polynomial distance for $D\\geq 4$", "Explicit polynomial lower-bound exponents derived as functions of dimension $D$ and code type $i$", "Construction generalizes colex triangulations on arithmetic hyperbolic manifolds to build type-$D/2$ color codes" ], "keywords": [ { "label": "Color Codes", "reason": "The paper's central object is a hyperbolic generalization of color codes." }, { "label": "qLDPC", "reason": "The work targets high-rate quantum low-density parity-check code constructions." }, { "label": "Hyperbolic Geometry", "reason": "Constructions rely on arithmetic hyperbolic manifolds enabling constant rate with growing distance." }, { "label": "Code Distance", "reason": "A main contribution is deriving polynomial lower bounds on code distance." } ], "emoji": "🌀", "social_summary": "New hyperbolic color codes achieve both constant encoding rate and polynomial distance, overcoming a longstanding limitation of prior constructions.", "highlights_oneliner": "Constant-rate, polynomial-distance hyperbolic color codes" }, { "arxiv_id": "2609.16159", "title": "Towards Block-Level Fault-Tolerant Quantum Simulation on Small High-Rate Non-CSS Codes", "authors": "Zhuangzhuang Chen, Narayanan Rengaswamy", "arxiv_url": "https://arxiv.org/abs/2609.16159", "pdf_url": "https://arxiv.org/pdf/2609.16159", "summary": "The authors study block-level fault-tolerant Trotter simulation on the high-rate non-CSS $[[8,3,3]]$ code, constructing flagged syndrome-extraction circuits with a circuit-level pseudo-threshold near $1.5\\times10^{-3}$. Applying a symplectic-transvection mapping from logical Trotter circuits to physical circuits, they identify a fault propagation mechanism through the uncomputation network that creates asymmetric logical-$X$/logical-$Z$ failure rates, and evaluate several mitigation strategies.", "motivation": "Most fault-tolerant architecture studies focus on CSS or surface-code-derived constructions, leaving small non-CSS codes with mixed-Pauli checks and limited native transversal gates comparatively unexplored despite their favorable finite-size rates. Understanding whether block-level constructions can preserve fault-tolerant distance for logical dynamics on such codes is essential for expanding near-term useful FTQC testbeds.", "highlights": [ "Established a circuit-level memory pseudo-threshold near $1.5\\times10^{-3}$ for the $[[8,3,3]]$ non-CSS code", "Identified a single-fault mechanism where a shared parity ancilla fault propagates into an undetectable logical operator, reducing effective circuit distance", "Diagnostic protected limit removing malignant first-order fault locations restores pseudo-threshold behavior approaching memory performance" ], "keywords": [ { "label": "Non-CSS Codes", "reason": "The paper focuses on fault tolerance for the mixed-Pauli non-CSS $[[8,3,3]]$ code." }, { "label": "Trotterization", "reason": "Logical Trotter circuits are used as the quantum simulation testbed." }, { "label": "Flag Qubits", "reason": "Flagged syndrome extraction and flag postselection are key fault-tolerance tools studied." }, { "label": "Fault Propagation", "reason": "A central finding concerns fault propagation through the uncomputation network reducing effective distance." } ], "emoji": "🧩", "social_summary": "Researchers uncover how a hidden fault propagation path undermines fault tolerance in logical quantum simulation on a compact non-CSS code.", "highlights_oneliner": "Block-level fault tolerance tested on $[[8,3,3]]$ code" }, { "arxiv_id": "2609.16542", "title": "Phantom Codes: Hardness, Rate Optimal qLDPC Constructions, and Distance Limits", "authors": "Rui Mao, Weixiao Sun, Shengyu Zhang", "arxiv_url": "https://arxiv.org/abs/2609.16542", "pdf_url": "https://arxiv.org/pdf/2609.16542", "summary": "The authors prove that recognizing phantomness of a stabilizer code—where every in-block logical CNOT is realizable via qubit permutation—is at least as hard as Graph Isomorphism, even for $k=2$ CSS codes. They propose the first rate-optimal phantom qLDPC families achieving maximal logical scaling $k=\\Theta(\\log n)$ with distance $d\\geq D$ for any fixed $D$, and prove a no-go theorem showing that phantom families with $k=\\omega(\\sqrt{\\log n})$ and constant check weight $w$ satisfy $d\\leq w$.", "motivation": "Phantom codes eliminate the overhead of logical entangling gates by realizing them purely through physical qubit relabeling, but prior constructions were rare, computationally expensive to find, and lacked growing-dimension qLDPC families. Establishing complexity limits and rate-optimal constructions clarifies the fundamental trade-offs between symmetry-based gate implementation, code distance, and logical dimension scaling.", "highlights": [ "Proved phantomness recognition is at least as hard as Graph Isomorphism, even for $k=2$ CSS codes", "Constructed first rate-optimal phantom qLDPC families achieving $k=\\Theta(\\log n)$ with distance $d\\geq D$ for any fixed $D$", "Proved a distance no-go theorem: constant check weight $w$ forces $d\\leq w$ for phantom families with $k=\\omega(\\sqrt{\\log n})$" ], "keywords": [ { "label": "Phantom Codes", "reason": "The paper's core subject is phantom stabilizer codes with permutation-implemented CNOTs." }, { "label": "Graph Isomorphism", "reason": "A key hardness result reduces phantomness recognition to Graph Isomorphism." }, { "label": "qLDPC", "reason": "The paper constructs rate-optimal low-density parity-check phantom code families." }, { "label": "Logical Gates", "reason": "The motivation centers on eliminating overhead for logical CNOT gates via automorphisms." } ], "emoji": "👻", "social_summary": "New results reveal both hardness of recognizing and optimal constructions for phantom codes that implement logical CNOTs via qubit relabeling alone.", "highlights_oneliner": "Hardness and optimal constructions for phantom codes" }, { "arxiv_id": "2609.16929", "title": "Exact efficient simulation of noisy logical magic states using Clifford stabilizers", "authors": "Yugo Takada, Stephen D. Bartlett, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2609.16929", "pdf_url": "https://arxiv.org/pdf/2609.16929", "summary": "The authors introduce Clifford-stabilizer simulation, an exact and efficient algorithm that maps noisy non-Clifford circuits for preparing logical magic states into equivalent Clifford circuits reproducing the same measurement outcome distribution under circuit-level Pauli errors. The method applies to Pauli-stabilizer measurements, logical Clifford measurements, and transversal non-Clifford gates, achieving polynomial time and space complexity, and is demonstrated via exact simulation of magic state cultivation up to fault distance $7$.", "motivation": "Predicting and improving fault-tolerant quantum computation protocols for magic state preparation, a major space-time overhead source, requires classical simulation tools, but generic non-Clifford circuit simulation is exponentially costly even with Pauli noise. Efficient exact simulation methods are needed to benchmark low-overhead protocols like magic state cultivation at scales beyond what brute-force methods allow.", "highlights": [ "Introduced Clifford-stabilizer simulation achieving exact, polynomial-time simulation of noisy logical magic state preparation", "Method covers Pauli-stabilizer measurements, logical Clifford measurements, and transversal non-Clifford gates", "Performed exact simulation of magic state cultivation up to fault distance $7$, beyond prior explored regimes" ], "keywords": [ { "label": "Magic States", "reason": "The paper's focus is simulating noisy logical magic state preparation protocols." }, { "label": "Stabilizer Formalism", "reason": "The method maps non-Clifford circuits to Clifford circuits using stabilizer techniques." }, { "label": "Magic State Cultivation", "reason": "The demonstrated application is exact simulation of magic state cultivation up to distance $7$." }, { "label": "Circuit-Level Noise", "reason": "The simulation explicitly models circuit-level Pauli error channels." } ], "emoji": "🎩", "social_summary": "A new exact simulation method efficiently benchmarks noisy logical magic state preparation up to fault distance seven.", "highlights_oneliner": "Exact efficient simulation of magic state protocols" }, { "arxiv_id": "2609.17044", "title": "Constant sized support state distillation with qubit recycling", "authors": "Victor Barizien", "arxiv_url": "https://arxiv.org/abs/2609.17044", "pdf_url": "https://arxiv.org/pdf/2609.17044", "summary": "The paper presents a recursive family of magic state distillation protocols producing diagonal states at any level of the Clifford hierarchy, built via code doubling and qubit recycling of idle ancillas. At any fixed hierarchy level, these protocols can achieve arbitrarily high distance while using a fixed number of logical qubits, recovering known efficient protocols and uncovering new ones including a compact $111\\to1$ protocol for $|T\\rangle$ state distillation at distance $7$.", "motivation": "The Eastin-Knill theorem forbids universal transversal gate sets, making magic state injection and distillation essential but costly components of fault-tolerant computation, requiring error rates below $10^{-10}$ that current preparations cannot reach directly. Reducing the resource overhead of distillation, especially the qubit support required at high distance, is a key open problem for practical fault-tolerant architectures.", "highlights": [ "Derived a recursive family of distillation protocols with constant qubit support independent of distance $d$", "Uncovered a new compact $111\\to1$ protocol for $|T\\rangle$ state distillation at distance $7$, the most volume-efficient known", "Extended framework toward multi-output distillation protocols via new code doubling constructions" ], "keywords": [ { "label": "Magic States", "reason": "The paper develops distillation protocols for magic states across the Clifford hierarchy." }, { "label": "Qubit Recycling", "reason": "A core technique reusing idle qubits to reduce protocol support size." }, { "label": "Code Doubling", "reason": "Recursive code doubling constructions are used to build the protocol family." }, { "label": "T-gate Distillation", "reason": "A specific new result targets compact $|T\\rangle$ state distillation." } ], "emoji": "♻️", "social_summary": "A new recursive distillation protocol family uses qubit recycling to keep magic state distillation compact even at high distance.", "highlights_oneliner": "Compact magic state distillation via qubit recycling" }, { "arxiv_id": "2609.17095", "title": "Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes", "authors": "Victoria Wadewitz, Alessandro Ciani", "arxiv_url": "https://arxiv.org/abs/2609.17095", "pdf_url": "https://arxiv.org/pdf/2609.17095", "summary": "The authors apply probabilistic error cancellation (PEC), a quantum error mitigation technique, on top of GKP error correction, comparing Steane-type and teleportation-based decoding for square and hexagonal GKP codes. Using the stabilizer subsystem decomposition, they compute sampling overheads for single- and two-qubit GKP Clifford gates under finite-squeezing noise on data and ancilla modes across one round of error correction.", "motivation": "Continuous-variable GKP codes offer hardware-efficient error correction, but near-term implementations cannot eliminate errors entirely, motivating combining error correction with error mitigation techniques like PEC used successfully in NISQ settings. Understanding how PEC overheads behave when layered on top of GKP error correction reveals nontrivial interactions absent in standard discrete-variable mitigation analyses.", "highlights": [ "Applied PEC on top of GKP error correction using the stabilizer subsystem decomposition to derive effective logical noise channels", "Compared sampling overheads between Steane-type and teleportation-based decoding for square and hexagonal GKP lattices", "Found that PEC overhead multiplicativity fails to hold for sequential GKP operations due to residual displacement noise" ], "keywords": [ { "label": "GKP Codes", "reason": "The paper's central subject is continuous-variable Gottesman-Kitaev-Preskill error correction." }, { "label": "Error Mitigation", "reason": "Probabilistic error cancellation is the mitigation technique studied." }, { "label": "Sampling Overhead", "reason": "A key quantified metric is the PEC sampling overhead under different noise and decoding schemes." }, { "label": "Continuous Variable", "reason": "The codes and noise model operate on continuous-variable bosonic modes." } ], "emoji": "🌊", "social_summary": "Researchers combine error mitigation with GKP quantum error correction, revealing nontrivial overhead behavior for continuous-variable codes.", "highlights_oneliner": "Error mitigation layered on GKP error correction" }, { "arxiv_id": "2609.17465", "title": "Quantum Compiler Design for Fault-Tolerant Quantum Computing", "authors": "Chenghong Zhu, Jiahan Chen, Keming He, Hongshun Yao, Zhaohui Yang, Jin-Guo Liu, Anbang Wu, Xiaotong Ni, Xingsheng Luan, Zhuo Fu, Shenggen Zheng, Xin Wang", "arxiv_url": "https://arxiv.org/abs/2609.17465", "pdf_url": "https://arxiv.org/pdf/2609.17465", "summary": "This survey presents a full-stack view of compiler design for fault-tolerant quantum computation, organizing existing work into logical-level QEC compilation, physical-level QEC realization, and decoder runtime integration. It reviews surface-code lattice-surgery compilers, qLDPC code-surgery frameworks, non-Clifford compilation support, hardware-aware realization across superconducting, trapped-ion, and neutral-atom platforms, and decoder integration mechanisms.", "motivation": "As quantum hardware and QEC experiments progress toward repeated syndrome extraction and logical algorithmic workloads, compilation must move beyond generic circuit optimization to encoding-aware, protocol-structured strategies spanning the full fault-tolerant stack. Understanding cross-layer interactions between logical compilation, hardware realization, and decoder integration is essential to close performance gaps in practical FTQC systems.", "highlights": [ "Organizes FTQC compilation into three interacting layers: logical-level QEC, physical-level realization, and decoder runtime integration", "Reviews lattice-surgery, qLDPC code-surgery, and non-Clifford compilation techniques including magic-state distillation and code switching", "Identifies open challenges in cross-layer optimization, compiler-decoder co-design, and runtime adaptivity" ], "keywords": [ { "label": "Compiler Design", "reason": "The paper is a survey specifically on quantum compilers for FTQC." }, { "label": "Lattice Surgery", "reason": "Surface-code lattice-surgery compilation is a major reviewed topic." }, { "label": "qLDPC", "reason": "Beyond-surface-code qLDPC compilation frameworks are surveyed." }, { "label": "Decoders", "reason": "Real-time decoder integration and runtime systems are a key reviewed layer." } ], "emoji": "🛠️", "social_summary": "This survey maps the full compiler stack needed to turn fault-tolerant quantum algorithms into hardware-ready, decoder-integrated logical operations.", "highlights_oneliner": "Full-stack survey of fault-tolerant quantum compilers" }, { "arxiv_id": "2609.08203", "title": "Asymptotically good binary triorthogonal codes and higher-level transversal gates", "authors": "Rodrigo San-José", "arxiv_url": "https://arxiv.org/abs/2609.08203", "pdf_url": "https://arxiv.org/pdf/2609.08203", "summary": "The author constructs explicit asymptotically good binary CSS codes for every level of the Clifford hierarchy from the third level onward, where a strongly transversal diagonal rotation combined with a correction from the preceding level implements the corresponding logical rotation, using algebraic geometry codes over binary extension fields with alphabet reduction. This yields the first asymptotically good family of binary triorthogonal codes, a stronger correction-free construction with worse parameters, and constant-overhead $T$-state block distillation from noisy inputs.", "motivation": "Triorthogonal codes enable transversal $T$-gates crucial for universal fault-tolerant computation, and finding good triorthogonal codes with small distillation scaling exponents is an active research area, yet asymptotically good binary constructions had not previously been achieved. This work closes that gap using algebraic geometry codes, directly enabling constant-overhead magic state distillation under weak input noise.", "highlights": [ "First asymptotically good family of binary triorthogonal codes constructed via algebraic geometry codes and alphabet reduction", "Explicit constructions for every level of the Clifford hierarchy from the third level onward implementing logical diagonal rotations", "Binary $T$-gate families yield constant-overhead $T$-state block distillation under weak input noise and ideal stabilizer operations" ], "keywords": [ { "label": "Triorthogonal Codes", "reason": "The paper's central contribution is the first asymptotically good binary triorthogonal codes." }, { "label": "Clifford Hierarchy", "reason": "Constructions target transversal gates at every level of the Clifford hierarchy." }, { "label": "Algebraic Geometry Codes", "reason": "The construction technique relies on algebraic geometry codes over binary extension fields." }, { "label": "Magic State Distillation", "reason": "The codes enable constant-overhead $T$-state block distillation." } ], "emoji": "📐", "social_summary": "New algebraic geometry code constructions yield the first asymptotically good binary triorthogonal codes enabling constant-overhead magic state distillation.", "highlights_oneliner": "First asymptotically good binary triorthogonal codes" }, { "arxiv_id": "2609.16133", "title": "Pulse-Level Compilation of Measurement-Free Recovery in Transmon Circuits", "authors": "Yi-Han Yu, Kai Xu, Heng Fan", "arxiv_url": "https://arxiv.org/abs/2609.16133", "pdf_url": "https://arxiv.org/pdf/2609.16133", "summary": "The authors numerically demonstrate that the conditional spectrum of an interacting transmon circuit can compile a local error-correction recovery rule into a fixed open-loop control waveform, avoiding syndrome measurement, decoding, and feedback. In a four-bit repetition-code ring, this input-independent control slows logical coherence decay under Pauli-$X$ noise and stabilizes logical-one population under data relaxation compared to uncorrected references.", "motivation": "Conventional QEC cycles rely on syndrome measurement, classical decoding, and conditional feedback, which places heavy demands on readout fidelity and latency. Measurement-free QEC removes online feedback, and this work shows how to compile the joint syndrome-selection-and-recovery rule directly into hardware-native pulses for scalable, bounded-degree architectures.", "highlights": [ "Conditional dressed spectrum of interacting transmons compiled into a fixed open-loop recovery waveform", "Four-bit repetition-code ring shows slowed logical coherence decay under Pauli-$X$ noise", "Bounded-degree, parallel two-color scheduling enables extension to larger quantum networks" ], "keywords": [ { "label": "Measurement-Free QEC", "reason": "Central theme replacing syndrome measurement and feedback with compiled autonomous recovery" }, { "label": "Transmon Circuits", "reason": "Physical platform used for numerical simulation of the compiled control" }, { "label": "Repetition Code", "reason": "Four-bit repetition-code ring is the demonstration testbed" }, { "label": "Pulse Compilation", "reason": "Core technique of encoding recovery rules into fixed waveforms" } ], "emoji": "🎛️", "social_summary": "Researchers compile quantum error correction recovery directly into fixed pulse sequences on transmon circuits, skipping measurement and feedback entirely.", "highlights_oneliner": "Measurement-free QEC compiled into transmon pulse waveforms" }, { "arxiv_id": "2609.16659", "title": "Approximate synthesis of general single-qubit unitaries over the Clifford+$\\sqrt{T}$ gate set", "authors": "Mathias Weiden, Jae Won Kim, Justin Kalloor, John Kubiatowicz, Costin Iancu", "arxiv_url": "https://arxiv.org/abs/2609.16659", "pdf_url": "https://arxiv.org/pdf/2609.16659", "summary": "The authors extend the integer lattice-point enumeration method to provide the first direct, deterministic, ancilla-free approximate-synthesis algorithm for general single-qubit unitaries over the Clifford+$\\sqrt{T}$ gate set. Using a magic-state catalysis cost model, they show empirical cost scaling of $2.4\\log_2(1/\\varepsilon)$ versus $3.0\\log_2(1/\\varepsilon)$ $T$-states for the optimal Clifford+$T$ construction.", "motivation": "The $T$-count dominates the cost of fault-tolerant circuits since non-Clifford gates require expensive magic-state distillation, and while Clifford+$T$ synthesis is now provably optimal, the finer lattice from the $\\sqrt{T}$ gate had not been directly exploited for general unitary synthesis. This work fills that gap, showing that catalyzed $\\sqrt{T}$ states can substantially lower synthesis cost once amortized.", "highlights": [ "First direct ancilla-free approximate synthesis algorithm for Clifford+$\\sqrt{T}$ general single-qubit unitaries", "Empirical cost scaling of $2.4\\log_2(1/\\varepsilon)$ versus $3.0\\log_2(1/\\varepsilon)$ $T$-states for Clifford+$T$", "Robustness analysis shows advantage persists for $\\sqrt{T}$ state prices below crossover $c^\\star \\approx 4.0$-$5.3$" ], "keywords": [ { "label": "Gate Synthesis", "reason": "Core contribution is a new single-qubit unitary synthesis algorithm" }, { "label": "T-count", "reason": "Primary cost metric compared between gate sets" }, { "label": "Magic States", "reason": "Cost model based on magic-state catalysis of $\\sqrt{T}$ states" }, { "label": "Lattice Methods", "reason": "Algorithm built on integer lattice-point enumeration technique" } ], "emoji": "🔷", "social_summary": "New algorithm synthesizes single-qubit gates using the finer Clifford+sqrt(T) lattice, cutting fault-tolerant circuit costs versus standard Clifford+T.", "highlights_oneliner": "Cheaper single-qubit synthesis via Clifford+$\\sqrt{T}$" }, { "arxiv_id": "2609.16226", "title": "Error-corrected function estimation advantage in multiparameter Hamiltonians", "authors": "Erfan Abbasgholinejad, Lorcán O. Conlon, Sean R. Muleady, Jacob Bringewatt, Ali Fahimniya, Yu-Xin Wang, Alexey V. Gorshkov", "arxiv_url": "https://arxiv.org/abs/2609.16226", "pdf_url": "https://arxiv.org/pdf/2609.16226", "summary": "The authors derive tight bounds on quantum Fisher information for estimating a function of multiple Hamiltonian parameters under Markovian noise by reducing the problem to effective single-parameter embeddings. They identify a functional Hamiltonian-not-in-Lindblad-span condition governing Heisenberg-limited scaling and construct error-correcting codes achieving optimal precision, including in the standard-quantum-limit regime via approximate quantum error correction.", "motivation": "Multiparameter Hamiltonian estimation is fundamentally harder than single-parameter sensing because optimal strategies for different parameters can be incompatible, and no general attainable precision bound was previously known. This work bridges quantum metrology and quantum error correction to establish ultimate limits and demonstrates that directly estimating a target function can beat estimating all parameters separately.", "highlights": [ "Derived necessary and sufficient functional HNLS condition for Heisenberg-limited scaling in function estimation", "Constructed codes removing noise and nuisance parameters while preserving the target signal", "Showed direct function estimation can scale advantage with both time and number of parameters over parameter-then-evaluate approaches" ], "keywords": [ { "label": "Quantum Metrology", "reason": "Paper addresses fundamental precision limits in Hamiltonian parameter estimation" }, { "label": "Heisenberg Limit", "reason": "Central scaling regime analyzed via the HNLS condition" }, { "label": "Approximate QEC", "reason": "Used to attain optimal standard quantum-limit coefficients when HL fails" }, { "label": "Multiparameter Estimation", "reason": "Core problem setting involving noncommuting Hamiltonian generators" } ], "emoji": "📐", "social_summary": "Scientists find fundamental precision limits for estimating functions of multiple noisy Hamiltonian parameters using quantum error correction.", "highlights_oneliner": "Optimal error-corrected estimation of Hamiltonian functions" }, { "arxiv_id": "2609.16608", "title": "Strong converse for the quantum capacity of the pure-loss bosonic channel", "authors": "Mark M. Wilde", "arxiv_url": "https://arxiv.org/abs/2609.16608", "pdf_url": "https://arxiv.org/pdf/2609.16608", "summary": "This paper proves a strong converse for the unconstrained quantum capacity of the pure-loss bosonic channel, showing that entanglement-generation fidelity for any code operating above capacity decays as the reciprocal of the number of channel uses. The proof combines quantum Chebyshev and hockey-stick testing inequalities with a relative-entropy-variance bound derived from a bright/dark mode decomposition of the balanced beam splitter.", "motivation": "A capacity formula alone does not guarantee that codes above capacity fail catastrophically, and bosonic channels' infinite-dimensional spaces make this question subtle since energy is unconstrained. Establishing a strong converse closes this gap for a foundational model of optical attenuation, confirming no code can circumvent the quantum capacity threshold.", "highlights": [ "Proved strong converse holds without energy constraint for arbitrary encoded and correlated input states", "Fidelity bound scales as constant times reciprocal of number of channel uses above capacity", "Derived variance bound via bright/dark mode decomposition at transmissivity $\\eta=1/2$, extended to general $\\eta$ via dilation" ], "keywords": [ { "label": "Bosonic Channels", "reason": "Pure-loss bosonic channel is the physical model studied" }, { "label": "Strong Converse", "reason": "Central information-theoretic result proven in the paper" }, { "label": "Quantum Capacity", "reason": "Quantity whose fundamental limit is established" }, { "label": "Entropy Bounds", "reason": "Proof relies on relative-entropy-variance and hockey-stick inequalities" } ], "emoji": "📉", "social_summary": "New proof shows codes exceeding the pure-loss bosonic channel's quantum capacity inevitably fail, with fidelity vanishing as channel uses grow.", "highlights_oneliner": "Strong converse proven for lossy bosonic quantum capacity" }, { "arxiv_id": "2609.16938", "title": "Classical Communication Protocol based on Joint Classical-Quantum Coding", "authors": "Kristian Skafte Jensen, René Bødker Christensen, Čedomir Stefanović, Petar Popovski", "arxiv_url": "https://arxiv.org/abs/2609.16938", "pdf_url": "https://arxiv.org/pdf/2609.16938", "summary": "The authors introduce a robust quantum communication protocol combining classical error-correcting codes, entanglement distribution, and superdense coding, using classical codes to determine qubit transmission positions and protect superdense-coded data against dark counts and photon loss. They derive conditions guaranteeing error correction under a bounded error-frequency model and show the joint scheme can exceed upper bounds on conventional superdense coding in data rate and energy efficiency.", "motivation": "Superdense coding is a powerful primitive for boosting classical communication rates but is vulnerable to photon loss and detector dark counts in realistic optical links. This work integrates classical error correction with entanglement distribution to make superdense coding practical for short-range quantum networks such as quantum local area networks.", "highlights": [ "Derived conditions on codes guaranteeing successful error correction under a bounded error-frequency model", "Hamming-code configurations exceed conventional superdense-coding rate bounds from $[15,11,3]$ onward with near threefold energy-efficiency gain", "Physical error model based on fiber attenuation and detector efficiency shows best performance for links of a few kilometers or less" ], "keywords": [ { "label": "Superdense Coding", "reason": "Core communication primitive being protected and enhanced" }, { "label": "Classical Codes", "reason": "Hamming and related classical error-correcting codes used to protect transmissions" }, { "label": "Entanglement Distribution", "reason": "Protocol integrates EPR-pair generation directly into communication" }, { "label": "Quantum LAN", "reason": "Target application domain is short-distance quantum local area networks" } ], "emoji": "📡", "social_summary": "New protocol merges classical error correction with superdense coding to boost quantum data rates over short-range optical links.", "highlights_oneliner": "Classical codes boost superdense coding reliability" } ] }, "2026-09-15": { "word_cloud": [ { "word": "Toric", "weight": 5 }, { "word": "Decoding", "weight": 4 }, { "word": "Fermionic", "weight": 3 }, { "word": "Neutral", "weight": 3 }, { "word": "Trapped-Ions", "weight": 3 }, { "word": "Cat", "weight": 3 }, { "word": "Amplitude-Damping", "weight": 3 }, { "word": "Purcell", "weight": 3 }, { "word": "Compilation", "weight": 3 }, { "word": "Variational", "weight": 3 }, { "word": "Dissipation", "weight": 2 }, { "word": "Latency", "weight": 3 }, { "word": "Entanglement", "weight": 2 }, { "word": "Resource", "weight": 2 }, { "word": "Noise", "weight": 4 } ], "social_highlights": "Highlights: CUDA-Q Logical unifies FT compilation and resource estimation, NAQsim speeds neutral-atom logic 2x, fermionic QEC proven never free, Union-Find cuts decoding latency, new codes fight amplitude damping, WISER explores global-control trapped-ion FT, cat-qubit control suppresses leakage, noise-resilient sequential circuits build topological order, broadband Purcell filter enables fast reset/readout, variational circuits probe toric code phase transitions.", "papers": [ { "arxiv_id": "2609.13388", "title": "CUDA-Q Logical: Retargetable Compilation for Fault-Tolerant Quantum Computing", "authors": "Alexander McCaskey, Justin Lietz, Adam Holmes, Kohei Nakaji, Vadym Kliuchnikov, Yifan Hong, Amalee Wilson, Andres Paz, Bettina Heim, Bruno Schmitt, Krysta M. Svore", "arxiv_url": "https://arxiv.org/abs/2609.13388", "pdf_url": "https://arxiv.org/pdf/2609.13388", "summary": "The paper introduces CUDA-Q Logical, an extensible compiler infrastructure that lowers target-independent logical programs through successive layers (logical virtual machine, QEC microcode, physical gate schedules, real-time control plans) while preserving semantics and provenance. Resource estimates are derived directly from compiler artifacts rather than separate analytical formulas, enabling reproducible cross-architecture comparison across QEC codes, execution models, decoders, and hardware.", "motivation": "Fault-tolerant quantum computing requires coordinating diverse QEC codes, execution models, and control strategies, but existing tools are developed in isolation with manual, provenance-losing translation between them. This makes it hard to validate correctness, attribute costs to specific design choices, or fairly compare architectures, motivating a unified compiler stack.", "highlights": [ "Introduces a layered compiler IR that preserves semantics and provenance from logical program to physical schedule", "Derives resource estimates directly from verified compiler-generated schedules rather than separate analytical models", "Demonstrated across workloads including qLDPC surgery and detector-error-model composition, matching independent estimation models" ], "keywords": [ { "label": "Compiler Infrastructure", "reason": "Central contribution is a retargetable multi-layer compiler for fault-tolerant programs" }, { "label": "Resource Estimation", "reason": "Framework unifies compilation with resource estimation derived from schedules" }, { "label": "qLDPC Surgery", "reason": "Demonstrated on qLDPC lattice-surgery-style workloads as a benchmark" }, { "label": "Detector Models", "reason": "Composes detector-error-model artifacts into the compilation pipeline" } ], "emoji": "🛠️", "social_summary": "CUDA-Q Logical unifies fault-tolerant quantum compilation and resource estimation into one traceable, extensible pipeline.", "highlights_oneliner": "A retargetable compiler stack for fault-tolerant quantum computing" }, { "arxiv_id": "2609.14478", "title": "NAQsim: Full-Stack Architecture Simulation Framework for Fast and Space-Efficient Neutral Atom Quantum Computing", "authors": "Yosuke Ueno, Shinichi Sunami, Toshihide Hinokuma, Yasunari Suzuki, Akihisa Goban, Hayata Yamasaki, Teruo Tanimoto, Ilkwon Byun", "arxiv_url": "https://arxiv.org/abs/2609.14478", "pdf_url": "https://arxiv.org/pdf/2609.14478", "summary": "NAQsim is an open-source full-stack simulation framework for evaluating neutral-atom fault-tolerant quantum computing architectures based on transversal gates, spanning software, classical hardware, and quantum device layers. Using NAQsim, the authors identify patch rotations as a major performance bottleneck and design a near-rotation-free architecture, D3-ROT, that achieves substantial speedup with minimal overhead.", "motivation": "Neutral-atom platforms enable fast transversal logical operations but suffer from slow AOD-based atom shuttling, creating a large performance gap versus superconducting qubits that architects lack tools to systematically analyze. A comprehensive cross-stack simulator is needed to expose hidden bottlenecks and guide co-design across compiler, control hardware, and qubit-plane layers.", "highlights": [ "Proposes NAQsim, the first full-stack simulator for transversal-gate neutral-atom FTQC architectures", "Identifies patch rotations as a previously overlooked latency bottleneck via full-stack co-optimization", "D3-ROT architecture achieves a $2.27\\times$ speedup with minimal footprint overhead on FTQC benchmarks" ], "keywords": [ { "label": "Neutral Atoms", "reason": "Focuses on neutral-atom quantum computing hardware and its unique constraints" }, { "label": "Transversal Gates", "reason": "Architecture is based on transversal fault-tolerant gate execution" }, { "label": "Architecture Simulation", "reason": "Core contribution is a full-stack simulation tool spanning software to device" }, { "label": "Patch Rotations", "reason": "Identifies and eliminates patch rotation overhead as key bottleneck" } ], "emoji": "⚛️", "social_summary": "NAQsim simulates full neutral-atom quantum stacks and reveals a rotation-free design that speeds up logical operations by over 2x.", "highlights_oneliner": "Full-stack simulator uncovers neutral-atom rotation bottleneck" }, { "arxiv_id": "2609.15059", "title": "Fermionic quantum error correction is never free", "authors": "Yifan Tang, Ingo Roth, Philippe Faist, Zi-Wen Liu, Jens Eisert, Zhenhuan Liu", "arxiv_url": "https://arxiv.org/abs/2609.15059", "pdf_url": "https://arxiv.org/pdf/2609.15059", "summary": "The authors prove that any exact or sufficiently accurate approximate fermionic quantum error correction code necessarily requires non-Gaussian operations, ruling out free-fermion (quadratic) dynamics as sufficient for QEC. They further show the number of non-Gaussian gates needed for codeword preparation scales at least linearly with both code distance and number of encoded modes, and analyze the limited role of Gaussian operations in entanglement distillation.", "motivation": "Fermionic platforms such as Majorana-based and cold-atom qubits are promising for fault-tolerant computing, but unlike the qubit stabilizer paradigm where classically-simulable Clifford operations suffice, it was unclear whether efficiently simulable fermionic Gaussian operations could support error correction. This work closes that question, revealing a fundamental resource cost tied to non-Gaussianity, phases of matter, and state preparation complexity.", "highlights": [ "Proves no non-trivial fermionic QEC code can have a logical space containing a pure fermionic Gaussian state", "Shows non-Gaussian gate count for codeword preparation grows at least linearly with code distance and number of modes", "Reveals a bosonic-fermionic distinction in Gaussian operations' performance for entanglement distillation" ], "keywords": [ { "label": "Fermionic Codes", "reason": "Central object of study is fermionic quantum error-correcting codes" }, { "label": "Gaussian States", "reason": "Result hinges on incompatibility between QEC and fermionic Gaussian states" }, { "label": "Non-Gaussianity", "reason": "Establishes non-Gaussian resources as necessary overhead for QEC" }, { "label": "Wick's Theorem", "reason": "Proof leverages fundamental incompatibility with Wick's theorem" } ], "emoji": "🧬", "social_summary": "Researchers prove fermionic quantum error correction always demands costly non-Gaussian operations, unlike the qubit stabilizer case.", "highlights_oneliner": "No free lunch: fermionic QEC needs non-Gaussian resources" }, { "arxiv_id": "2609.15612", "title": "Reducing Decoding Latency in Quantum Error Correction by Early Starting Clustering", "authors": "Tommaso Peduzzi, Lukas Bödeker, Markus Müller, Luis Colmenarez", "arxiv_url": "https://arxiv.org/abs/2609.15612", "pdf_url": "https://arxiv.org/pdf/2609.15612", "summary": "The paper introduces Cluster-As-You-Go (CAYG), a modification of the Union-Find decoder that begins clustering and correcting errors during stabilizer measurement rather than waiting for the full QEC cycle to complete. This reduces the residual decoding problem size and post-measurement latency at a modest cost in accuracy, yielding an improved overall speed-accuracy trade-off in surface-code simulations.", "motivation": "Fast, low-latency decoding is essential to avoid the backlog problem where syndrome data accumulates faster than decoders can process it, and existing parallelizable decoders like Union-Find only start after a full cycle completes. Real-time decoding hardware needs strategies that exploit intra-cycle information to reduce this inherent delay.", "highlights": [ "Introduces CAYG, an early-starting variant of Union-Find that clusters errors during stabilizer measurement", "Shows reduced post-measurement idling time can outweigh modest accuracy losses in surface-code simulations", "Preserves decoder scalability while being extensible to other clustering-based LDPC decoders and real-time hardware" ], "keywords": [ { "label": "Union-Find", "reason": "Builds directly on the Union-Find decoder algorithm" }, { "label": "Decoding Latency", "reason": "Central problem addressed is reducing real-time decoding delay" }, { "label": "Surface Code", "reason": "Demonstrated via surface-code simulations" }, { "label": "Backlog Problem", "reason": "Motivated by avoiding syndrome processing backlog in real-time decoding" } ], "emoji": "⏱️", "social_summary": "A new Union-Find variant starts clustering errors mid-cycle, cutting quantum decoding latency with only minor accuracy trade-offs.", "highlights_oneliner": "Faster decoding by clustering errors as they arrive" }, { "arxiv_id": "2609.15924", "title": "Quantum Codes for Generalized Amplitude-damping Noise", "authors": "Sourav Dutta, Anubhab Rudra, Manav Seksaria, Anil Prabhakar, Prabha Mandayam", "arxiv_url": "https://arxiv.org/abs/2609.15924", "pdf_url": "https://arxiv.org/pdf/2609.15924", "summary": "The authors introduce probabilistic approximate quantum error correction (PAQEC), which combines approximate QEC with post-selected recovery, and construct a five-qubit permutation-invariant code that achieves fidelity loss quadratic in damping strength under generalized amplitude-damping (GAD) noise. They formulate PAQEC as a Charnes-Cooper/semidefinite-programming optimization to find optimal recovery maps and construct universal transversal logical gates for the code.", "motivation": "Generalized amplitude-damping noise is a realistic and ubiquitous error source in quantum hardware, yet conventional deterministic QEC codes incur fidelity losses that scale only linearly with damping strength. Noise-adapted, resource-efficient codes tailored to such structured noise are needed for near-term devices, motivating a probabilistic recovery paradigm beyond standard Knill-Laflamme conditions.", "highlights": [ "Constructs a five-qubit permutation-invariant code achieving quadratic fidelity loss under GAD noise via probabilistic recovery", "Formulates PAQEC as an SDP optimization using Charnes-Cooper transformation to find optimal recovery maps", "Presents a syndrome-based recovery protocol and universal transversal logical gate set for the code" ], "keywords": [ { "label": "Amplitude Damping", "reason": "Targets generalized amplitude-damping noise specifically" }, { "label": "Approximate QEC", "reason": "Extends approximate quantum error correction with probabilistic recovery" }, { "label": "Permutation-Invariant", "reason": "Uses a five-qubit permutation-invariant code construction" }, { "label": "SDP Optimization", "reason": "Recovery map found via semidefinite programming formulation" } ], "emoji": "📉", "social_summary": "A new probabilistic quantum code slashes fidelity loss from realistic damping noise, beating standard error correction methods.", "highlights_oneliner": "Probabilistic recovery beats deterministic codes for damping noise" }, { "arxiv_id": "2609.13546", "title": "WISER: Systematic Design-Space Exploration of Fault-Tolerant Global Control Trapped-Ions", "authors": "Scott Jones, Song-qing-hao Yang, Prakash Murali", "arxiv_url": "https://arxiv.org/abs/2609.13546", "pdf_url": "https://arxiv.org/pdf/2609.13546", "summary": "WISER is a cross-layer design-space exploration framework for globally-controlled (WISE) trapped-ion architectures, integrating WISE-specific compilation, noise modeling, and simulation to assess feasibility of fault-tolerant quantum computing under drastically reduced wiring complexity. The study identifies a narrow feasible design space requiring two-ion traps, moderate multiplexing, aggressive recooling, and high-rate bivariate-bicycle codes, revealing a fundamental trade-off between wiring scalability and logical throughput.", "motivation": "Conventional QCCD trapped-ion architectures face severe wiring and power bottlenecks as they scale, and the recently proposed WISE global-control approach alters the hardware-software interface in ways that make QEC feasibility unclear. Systematic architectural exploration is needed to determine whether such restrictive control schemes can still support fault-tolerant workloads.", "highlights": [ "First systematic design-space exploration framework targeting WISE-class globally controlled trapped-ion architectures", "Identifies bivariate-bicycle codes like $[[144,12,6]]$ as the only viable family meeting power constraints", "Finds lower-bound cycle time of $\\approx 100\\,\\text{ms}$ for $<10^{-8}$ logical error, $3\\times$ slower than local control" ], "keywords": [ { "label": "Trapped Ions", "reason": "Focuses on trapped-ion hardware architectures" }, { "label": "Global Control", "reason": "Studies WISE-class globally-controlled qubit architectures" }, { "label": "Bivariate Bicycle", "reason": "Identifies high-rate BB codes as a key viable code family" }, { "label": "Design Exploration", "reason": "Core methodology is cross-layer architectural design-space exploration" } ], "emoji": "🔗", "social_summary": "WISER maps out whether wire-saving global-control trapped-ion computers can support fault-tolerant quantum error correction.", "highlights_oneliner": "Design-space study of globally-controlled trapped-ion QEC" }, { "arxiv_id": "2609.15477", "title": "Engineering dissipation and control pulses for high-fidelity fault-tolerance quantum computing", "authors": "Shao-Wei Xu, Zhe-Yuan Zhang, Yi-Tong Shi, Ye-Hong Chen, Yan Xia", "arxiv_url": "https://arxiv.org/abs/2609.15477", "pdf_url": "https://arxiv.org/pdf/2609.15477", "summary": "The paper proposes an optimally robust control protocol for cat-state qubits stabilized by engineered two-photon dissipation, deriving an effective two-level description and applying shortcut-to-adiabaticity inverse engineering for fast, high-fidelity state transfer. The authors identify an optimal robustness condition against systematic control errors and show dissipative confinement suppresses leakage caused by pure dephasing.", "motivation": "Cat-state qubits offer hardware-efficient fault tolerance via noise-biased error suppression, but achieving fast and robust control while avoiding leakage remains a practical challenge for bosonic encodings. Building robust control protocols that exploit dissipative stabilization is important for realizing high-fidelity operations on near-term superconducting bosonic hardware.", "highlights": [ "Derives an effective two-level model within the cat-state subspace to enable analytic robustness optimization", "Designs a shortcut-to-adiabaticity control protocol achieving fast, high-fidelity state transfer robust to control errors", "Shows dissipative confinement suppresses leakage from pure dephasing, an advantage over purely Hamiltonian schemes" ], "keywords": [ { "label": "Cat Qubits", "reason": "Focuses on dissipative cat-state qubit encoding" }, { "label": "Two-Photon Dissipation", "reason": "Stabilization mechanism engineered via two-photon dissipation" }, { "label": "Shortcut-to-Adiabaticity", "reason": "Control protocol designed using inverse-engineering STA techniques" }, { "label": "Leakage Suppression", "reason": "Shows dissipation suppresses dephasing-induced leakage" } ], "emoji": "🐱", "social_summary": "A new robust control protocol speeds up cat-qubit operations while dissipation naturally suppresses leakage errors.", "highlights_oneliner": "Robust fast control for dissipative cat-state qubits" }, { "arxiv_id": "2609.13383", "title": "Noise-resilient sequential circuits for generating quantum order", "authors": "Konstantin Gattinger, Julian Boesl, Max McGinley, Michael Knap, Frank Pollmann", "arxiv_url": "https://arxiv.org/abs/2609.13383", "pdf_url": "https://arxiv.org/pdf/2609.13383", "summary": "The authors construct classes of unitary sequential circuits that prepare symmetry-breaking and topological orders while remaining resilient to circuit-level Pauli noise, exploiting the spatial structure of target-state syndromes to suppress error propagation using strictly local gates. They demonstrate constructions for a 3D symmetry-breaking example and a 4D toric code, and show that noise-resilience necessitates non-Clifford gates despite the stabilizer nature of target states.", "motivation": "Sequential circuits offer optimal linear-depth state preparation, but circuit-level noise can propagate local errors into damaging nonlocal defects, unlike noise applied after preparation. Understanding how to design noise-resilient preparation circuits is crucial for reliably generating long-range order on near-term noisy hardware.", "highlights": [ "Constructs sequential circuits stable against Pauli noise for both symmetry-breaking and topological order", "Demonstrates a 4D toric code preparation circuit resilient to local circuit-level errors", "Proves noise-resilient preparation of stabilizer states requires non-Clifford gates, and extends to measurement-feedback stabilization" ], "keywords": [ { "label": "Sequential Circuits", "reason": "Core technique is linear-depth sequential state preparation circuits" }, { "label": "Toric Code", "reason": "Demonstrated on a 4D toric code example" }, { "label": "Pauli Noise", "reason": "Focus is on resilience to circuit-level Pauli noise during preparation" }, { "label": "Non-Clifford Gates", "reason": "Shows noise resilience necessitates non-Clifford resources" } ], "emoji": "🌀", "social_summary": "New sequential circuits prepare topological and symmetry-breaking quantum order while resisting damaging circuit-level noise.", "highlights_oneliner": "Noise-resilient circuits for preparing quantum order" }, { "arxiv_id": "2609.14081", "title": "Broadband Purcell Filter for Fast Superconducting Qubit Reset and Readout", "authors": "Yu Zhao, Zhixu Chen, Hanxian Liu, Mingze Liu, Zixing Liu, Hao Pang, Meiyan Wan, Changkun Wu, Liuzhu Zhong, Sai Li, Yuefeng Yuan, Yuxuan Zhou, Ji Jiang, Ji Chu, Song Liu", "arxiv_url": "https://arxiv.org/abs/2609.14081", "pdf_url": "https://arxiv.org/pdf/2609.14081", "summary": "The authors present a broadband Purcell filter architecture that decouples qubit reset and readout paths using two engineered notches (intrinsic and bandstop) plus a dedicated reset stub, allowing independent optimization of both operations. They experimentally demonstrate Purcell-limited relaxation times exceeding $1$ ms over a $1.2$ GHz bandwidth, $500$ ns readout without a Josephson parametric amplifier, and $100$ ns reset with $99.6\\%$ efficiency. A deliberate $\\kappa$-$\\chi$ mismatch in the reset resonator suppresses photon-shot-noise-induced dephasing by a factor of $70$ compared to the readout resonator.", "motivation": "Scalable fault-tolerant quantum computing with superconducting qubits requires fast qubit reset and readout without sacrificing coherence, but conventional shared-resonator schemes force a trade-off between readout SNR optimization and reset speed due to residual photon dephasing. This work resolves that long-standing conflict with a distributed filter architecture, providing a practical hardware route toward faster QEC cycles.", "highlights": [ "Purcell-limited $T_1$ exceeding $1$ ms across a $1.2$ GHz bandwidth", "$500$ ns single-shot readout without a Josephson parametric amplifier and $100$ ns reset at $99.6\\%$ efficiency", "Engineered $\\kappa$-$\\chi$ mismatch reduces photon-shot-noise dephasing by $70\\times$ relative to the readout path" ], "keywords": [ { "label": "Purcell Filter", "reason": "Central device innovation providing broadband decay protection via engineered notches" }, { "label": "Qubit Reset", "reason": "Paper introduces dedicated reset resonators enabling fast, high-fidelity active reset" }, { "label": "Readout Fidelity", "reason": "Demonstrates fast single-shot readout without parametric amplification" }, { "label": "Dephasing Suppression", "reason": "Kappa-chi mismatch design specifically targets photon-shot-noise-induced dephasing" } ], "emoji": "🛡️", "social_summary": "New broadband Purcell filter enables 100 ns qubit reset and 500 ns readout while preserving millisecond coherence times.", "highlights_oneliner": "Decoupled filter enables fast reset and readout" }, { "arxiv_id": "2609.13748", "title": "Shot-based variational simulation of the toric code phase transition: Energy, global entanglement, and noise resilience", "authors": "Hayede Zarei, Mohammad Hossein Zarei", "arxiv_url": "https://arxiv.org/abs/2609.13748", "pdf_url": "https://arxiv.org/pdf/2609.13748", "summary": "The authors construct a parameterized quantum circuit, built from renormalization-inspired techniques, to variationally simulate the toric code ground state under a uniform magnetic field on a torus, using shot-based estimation of energy and global entanglement to detect the topological phase transition. They further introduce a secondary variational circuit for computing global entanglement and analyze the effect of gate noise on the detected transition point.", "motivation": "Detecting topological phase transitions with finite measurement budgets and periodic boundary conditions is challenging for near-term quantum hardware, since standard toric code circuit constructions become unwieldy for larger or asymmetric lattices. This work matters because it demonstrates a scalable, hardware-friendly variational strategy that reliably captures topological order signatures despite noise and finite sampling.", "highlights": [ "Ground-state energy shows a distinct singularity at the transition point, even for minimal lattices and finite shots", "A dedicated variational circuit computes global entanglement, correctly signaling the topological phase transition", "Transition point decreases linearly with gate noise strength, revealing robustness of the topological phase" ], "keywords": [ { "label": "Toric Code", "reason": "Central model studied under periodic boundary conditions and magnetic field perturbation" }, { "label": "Variational Circuits", "reason": "Shot-based parameterized quantum circuits used to simulate ground states" }, { "label": "Global Entanglement", "reason": "New variational circuit introduced to compute this order parameter for topological detection" }, { "label": "Noise Resilience", "reason": "Paper analyzes how gate noise shifts the detected phase transition point" } ], "emoji": "🍩", "social_summary": "Variational circuits reveal the toric code's topological phase transition using finite shots and remain robust against gate noise.", "highlights_oneliner": "Shot-based circuits detect toric code phase transition" } ] }, "2026-09-14": { "word_cloud": [ { "word": "Decoding", "weight": 5 }, { "word": "MagicStates", "weight": 4 }, { "word": "Distributed", "weight": 4 }, { "word": "Syndrome", "weight": 5 }, { "word": "ReinforcementLearning", "weight": 3 }, { "word": "TrappedIons", "weight": 3 }, { "word": "Blossom", "weight": 3 }, { "word": "Surface", "weight": 4 }, { "word": "Postselection", "weight": 3 }, { "word": "Benchmarking", "weight": 3 }, { "word": "MarkovChains", "weight": 2 }, { "word": "FlagQubits", "weight": 2 }, { "word": "DetectorModels", "weight": 3 }, { "word": "Mitigation", "weight": 3 }, { "word": "Trotterized", "weight": 2 } ], "social_highlights": "Highlights: constant-time sparse-blossom decoding, low-cost magic state prep via flag gadgets, first distributed QEC across trapped-ion processors, RL-optimized syndrome extraction, transition-matrix error detection modeling, composable detector error models, spacetime error mitigation cutting sampling costs 63x, and QUOPS benchmark for quantum utility.", "papers": [ { "arxiv_id": "2609.12262", "title": "Sparse-Blossom Decoding in $o(1)$ Time", "authors": "Ryo Mikami, Hayata Yamasaki", "arxiv_url": "https://arxiv.org/abs/2609.12262", "pdf_url": "https://arxiv.org/pdf/2609.12262", "summary": "The authors develop a rigorous parallelization framework for sparse-blossom minimum-weight perfect matching (MWPM) decoding that provably reproduces the output of the standard non-parallel algorithm. For the rotated surface code with distance $d$ below a finite error-rate threshold, they prove the average parallel runtime for $O(d)$ rounds of syndrome extraction is bounded by a quasi-polylogarithmic function of $d$, implying $o(1)$ average decoding time per round.", "motivation": "MWPM decoders provide strong error-suppression guarantees but their runtime traditionally grows with code distance, threatening scalability of fault-tolerant quantum computation as syndrome-extraction backlogs accumulate. This work addresses the need for decoders whose latency does not increase with distance, a requirement for real-time decoding at scale.", "highlights": [ "Proves parallel sparse blossom matches non-parallel sparse blossom's decoding output exactly", "Shows average parallel runtime per syndrome round is $o(1)$ for the rotated surface code below threshold", "Numerically identifies regimes where parallel runtime decreases as code distance $d$ increases" ], "keywords": [ { "label": "MWPM Decoding", "reason": "Paper's central algorithmic focus is minimum-weight perfect matching decoding" }, { "label": "Sparse Blossom", "reason": "Builds directly on and parallelizes the sparse blossom decoder implementation" }, { "label": "Surface Codes", "reason": "Analysis is carried out for the rotated surface code with distance $d$" }, { "label": "Parallel Decoding", "reason": "Core contribution is a hierarchical parallel execution framework for decoding" } ], "emoji": "⏱️", "social_summary": "Researchers prove a parallel version of sparse-blossom decoding can run in constant time per syndrome round as code size grows.", "highlights_oneliner": "Provably fast, scalable parallel MWPM decoding" }, { "arxiv_id": "2609.12698", "title": "Extremely Low-Cost Magic State Preparation toward Fault-Tolerant Quantum Computing", "authors": "Jianshuo Gao, Xiao Yuan, Yuan Yao", "arxiv_url": "https://arxiv.org/abs/2609.12698", "pdf_url": "https://arxiv.org/pdf/2609.12698", "summary": "The authors present a magic-state preparation protocol co-designing stabilizer generator choice with flag gadgets so the syndrome-extraction circuit filters correlated faults across a non-Clifford layer, using a $15$-qubit quantum Reed-Muller code converted to the Steane code via gauge-fixing. The scheme eliminates all accepted logical-error contributions from one- or two-fault events, achieving postselected infidelity $210.2p^3+O(p^4)$ with only $19$ qubits and $82$ CNOT gates.", "motivation": "Magic-state preparation is a dominant overhead in fault-tolerant quantum computation, and existing distillation approaches remain resource intensive, motivating cheaper high-fidelity alternatives. This work shows that the choice of stabilizer-generator basis itself can be actively optimized to expose correlated faults for postselection, reducing cost without sacrificing fidelity.", "highlights": [ "Postselected infidelity scales as $210.2p^3+O(p^4)$, eliminating first- and second-order accepted logical errors", "Achieves $2.2\\times10^{-7}$ infidelity bound at $p=10^{-3}$ with $86.9\\%$ acceptance probability", "Requires only $19$ qubits and $82$ CNOT gates total" ], "keywords": [ { "label": "Magic States", "reason": "Paper's goal is low-cost preparation of non-Clifford magic states" }, { "label": "Flag Qubits", "reason": "Uses flag gadgets co-designed with stabilizer generators for fault filtering" }, { "label": "Reed-Muller Code", "reason": "Employs the $15$-qubit quantum Reed-Muller code for transversal $T$-gate implementation" }, { "label": "Steane Code", "reason": "Gauge-fixes the register into the $[[7,1,3]]$ Steane code" } ], "emoji": "✨", "social_summary": "A new co-designed flag-gadget protocol slashes the cost of preparing high-fidelity magic states for fault-tolerant quantum computing.", "highlights_oneliner": "Cheap, high-fidelity postselected magic-state preparation" }, { "arxiv_id": "2609.13065", "title": "Error Correction in a Distributed Quantum Computer", "authors": "E. M. Ainley, A. Agrawal, T. Araki, A. R. Martínez, D. Main, E. Malinowski, J. A. Blackmore, S. Chen, P. Drmota, M. Mallweger, D. P. Nadlinger, R. Srinivas, S. C. Benjamin, G. Araneda, D. M. Lucas", "arxiv_url": "https://arxiv.org/abs/2609.13065", "pdf_url": "https://arxiv.org/pdf/2609.13065", "summary": "The authors experimentally demonstrate distributed quantum error detection and correction between two trapped-ion processors linked by photonic entanglement, performing remote syndrome measurements on data qubits. They realize a distributed $[[2,1,1]]$ repetition code detecting phase-flip errors in real time, and combine remote syndrome measurements with feedforward to actively correct arbitrary single-qubit Pauli errors on a distributed Bell state.", "motivation": "Scaling fault-tolerant quantum computers to large numbers of logical qubits requires modular architectures and resource-efficient qLDPC codes, both of which depend on non-local stabilizer measurements between separate processors that had not yet been demonstrated. This work provides the first experimental realization of the remote syndrome extraction primitive necessary for distributed QEC across modular quantum networks.", "highlights": [ "First experimental demonstration of distributed quantum error detection and correction across two processors", "Realizes a distributed $[[2,1,1]]$ repetition code detecting phase-flip errors in real time", "Combines remote syndrome measurement with real-time feedforward to correct arbitrary single-qubit Pauli errors on a distributed Bell state" ], "keywords": [ { "label": "Distributed QEC", "reason": "Central theme is error correction across separate modular processors" }, { "label": "Trapped Ions", "reason": "Experiment implemented on trapped-ion quantum processors" }, { "label": "Photonic Interconnects", "reason": "Remote entanglement generated via photonic links between modules" }, { "label": "qLDPC Codes", "reason": "Motivated by enabling high-rate qLDPC code implementations via non-local connectivity" } ], "emoji": "🔗", "social_summary": "Scientists demonstrate the first distributed quantum error correction using entangled links between two separate trapped-ion processors.", "highlights_oneliner": "First demonstration of cross-module quantum error correction" }, { "arxiv_id": "2609.12020", "title": "Reinforcement Learning for Syndrome Extraction", "authors": "John Zhuoyang Ye, Aarav Pabla, Jens Palsberg", "arxiv_url": "https://arxiv.org/abs/2609.12020", "pdf_url": "https://arxiv.org/pdf/2609.12020", "summary": "The authors introduce FastSched, a reinforcement learning approach combined with importance sampling to automatically schedule syndrome-extraction circuits with low logical error rates, addressing the exponential search space of possible extraction orderings. Their tool outperforms the state-of-the-art AlphaSyndrome and PropHunt schedulers, reducing logical error rate by $25.9\\%$ and $71.7\\%$ on average respectively, and by $97.8\\%$ for a distance-$15$ surface code.", "motivation": "Syndrome extraction scheduling significantly affects fault tolerance, but the exponentially large search space of possible circuit orderings makes finding low-logical-error-rate implementations hard, and prior automated tools sacrifice either solution quality or scalability. This work shows that RL with noise-amplified feedback can efficiently learn schedules that generalize to large code distances.", "highlights": [ "Reduces logical error rate by $25.9\\%$ vs AlphaSyndrome and $71.7\\%$ vs PropHunt on average", "Achieves measured LER of $3.62\\times10^{-9}$ at $d=15$, a $97.8\\%$ reduction versus AlphaSyndrome", "Uses noise amplification and importance sampling to make rare logical failures useful RL training signals" ], "keywords": [ { "label": "Reinforcement Learning", "reason": "Core methodology is an RL-based search over scheduling strategies" }, { "label": "Importance Sampling", "reason": "Uses importance sampling to convert amplified-noise failures into LER estimates" }, { "label": "Syndrome Extraction", "reason": "Focuses on scheduling gate orders for extracting error syndromes" }, { "label": "Surface Codes", "reason": "Benchmarks scale up to distance-$15$ surface codes" } ], "emoji": "🎮", "social_summary": "A reinforcement learning scheduler slashes logical error rates in syndrome extraction circuits, beating prior automated tools by up to 97.8 percent.", "highlights_oneliner": "RL-optimized syndrome scheduling beats prior tools" }, { "arxiv_id": "2609.12073", "title": "Modeling Quantum Error Detection with Transition Matrices", "authors": "Rohan S. Kumar, Ben Foxman, Yongshan Ding", "arxiv_url": "https://arxiv.org/abs/2609.12073", "pdf_url": "https://arxiv.org/pdf/2609.12073", "summary": "The authors construct an explicit transition matrix in a code-adapted basis that exactly describes basis-population dynamics of stabilizer codes under circuit-level stochastic Pauli noise, incorporating post-selection via an absorbing state for quantum error detection (QED). They use this framework to identify a leading-order obstruction to stationary logical-only accepted-map descriptions and prove that less frequent checks improve QED efficiency to leading order, validating results on the $[[4,2,2]]$ and $[[5,1,3]]$ codes against Stim Monte Carlo simulations.", "motivation": "Modeling stabilizer code dynamics under noise typically forces a tradeoff between unwieldy full physical superoperators and overly simplistic logical-only channels that ignore probability flow into syndrome sectors. This work fills the gap with an intermediate, exact, and interpretable classical Markov-chain description useful for analyzing multi-cycle error-detection protocols.", "highlights": [ "Derives an exact code-adapted transition matrix for stabilizer codes under circuit-level Pauli noise", "Proves less frequent syndrome checks improve leading-order QED efficiency", "Validates predictions against million-shot Stim simulations on $[[4,2,2]]$ and $[[5,1,3]]$ codes" ], "keywords": [ { "label": "Error Detection", "reason": "Focuses specifically on quantum error detection with post-selection" }, { "label": "Markov Chains", "reason": "Framework recasts stabilizer dynamics as a classical stochastic transition matrix" }, { "label": "Postselection", "reason": "Incorporates rejected outcomes as absorbing states to model postselection" }, { "label": "Small Codes", "reason": "Evaluated on the $[[4,2,2]]$ and $[[5,1,3]]$ codes" } ], "emoji": "🔢", "social_summary": "A new transition-matrix framework exactly models how quantum error detection protocols behave under realistic circuit noise.", "highlights_oneliner": "Exact Markov-chain model of error detection dynamics" }, { "arxiv_id": "2609.13087", "title": "Composing Detector Error Models", "authors": "Vadym Kliuchnikov, Justin Lietz, Fernando Pastawski", "arxiv_url": "https://arxiv.org/abs/2609.13087", "pdf_url": "https://arxiv.org/pdf/2609.13087", "summary": "The authors introduce extended detector error models (EDEMs) that compose in sequence and in parallel to mirror how physical circuit gadgets and their detector contracts assemble, proving conditions under which composing per-gadget EDEMs recovers the full circuit's detector error model. This enables symbolic precompilation of detector error models for adaptive fault-tolerant programs and defines error models and boundary information for decoding windows in real time.", "motivation": "Fault-tolerant computations are often adaptive, with measurement outcomes determining subsequent circuit structure at runtime, meaning the full physical circuit and its detector error model are not known in advance and must be built incrementally from reusable gadgets. This work resolves the key obstruction that detectors typically span gadget boundaries, enabling scalable offline analysis and online decoding of unfolding quantum programs.", "highlights": [ "Proves detectors can be split at gadget boundaries via virtual syndromes", "Enables symbolic precompilation of detector error models for entire circuit families", "Rust prototype reproduces Stim-derived DEMs across four code families and supports decoding-window boundary handling" ], "keywords": [ { "label": "Detector Error Models", "reason": "Central object of study is the composition of detector error models" }, { "label": "Circuit Composition", "reason": "Focuses on sequential and parallel composition of circuit gadgets" }, { "label": "Decoding Windows", "reason": "Defines error models for decoding windows and their boundary information" }, { "label": "Adaptive Circuits", "reason": "Targets fault-tolerant computations with runtime-adaptive control flow" } ], "emoji": "🧩", "social_summary": "New composable detector error models let researchers analyze fault-tolerant quantum circuits gadget by gadget instead of all at once.", "highlights_oneliner": "Modular composition of detector error models" }, { "arxiv_id": "2609.13108", "title": "Spacetime mitigation of logical errors", "authors": "Laurin E. Fischer, Ali Javadi-Abhari, Simon Martiel, Alireza Seif", "arxiv_url": "https://arxiv.org/abs/2609.13108", "pdf_url": "https://arxiv.org/pdf/2609.13108", "summary": "The authors combine error detection with probabilistic error cancellation (PEC) via a spacetime Pauli-Lindblad representation, perturbatively constructing post-selected logical noise from physical noise and syndrome information to mitigate residual logical errors while lowering PEC sampling cost. On the ibm_aachen superconducting processor with $22$ data and $27$ check qubits, the combined protocol recovers transverse-field Ising dynamics through six Trotter steps and reduces inferred sampling overhead by up to a factor of $63$ relative to PEC alone.", "motivation": "Error detection suppresses noise cheaply but leaves residual logical errors, while PEC fully cancels noise at high sampling cost, so combining the two promises accurate mitigation at reduced overhead. This is important for making error mitigation practical on near-term hardware where PEC's exponential sampling cost otherwise limits circuit depth.", "highlights": [ "Introduces a spacetime Pauli-Lindblad representation for post-selected logical noise", "Demonstrates error detection plus first-order PEC on $22$ data and $27$ check qubits", "Reduces inferred sampling overhead by up to a factor of $63$ versus PEC without post-selection" ], "keywords": [ { "label": "Error Mitigation", "reason": "Paper combines error detection and probabilistic error cancellation for mitigation" }, { "label": "Pauli-Lindblad", "reason": "Introduces a spacetime Pauli-Lindblad noise representation" }, { "label": "Postselection", "reason": "Uses syndrome-based post-selection to reduce residual logical error" }, { "label": "Trotterized Dynamics", "reason": "Demonstrated on transverse-field Ising model Trotter simulations" } ], "emoji": "🌀", "social_summary": "Combining error detection with probabilistic error cancellation cuts quantum sampling costs by up to 63 times on real hardware.", "highlights_oneliner": "Hybrid error detection and cancellation cuts sampling cost" }, { "arxiv_id": "2609.12146", "title": "Benchmarking the computational power of quantum computers", "authors": "Timothy Proctor, Oliver Hart, Oliver Widzowski Maupin, Matthew Girling, Daniel Hothem, Daniel Mills, Jordan Hines, Karl Mayer, Jacob S. Nelson, Tyler LeBlond, Zohim Chandani, Diego Forlivesi, Piper C. Wysocki, Boldizsár Poór, Joan M. Dreiling, Annie Park, Adam P. Reed, Brian Estey, Cameron Foltz, Akhil Isanaka, M. S. Allman, Michael Mills, Maxwell D. Urmey, Peter E. Siegfried, Audrey Faricy, Jin-Sung Kim, Cristina Cîrstoiu, Andrew D. Baczewski, Charles H. Baldwin, Robin Blume-Kohout", "arxiv_url": "https://arxiv.org/abs/2609.12146", "pdf_url": "https://arxiv.org/pdf/2609.12146", "summary": "The authors introduce QUOPS, a benchmark quantifying the largest computationally relevant circuit size and execution speed a quantum machine can achieve, applied cross-platform to processors from Quantinuum, Google, and IBM at the physical-qubit level. They also assess a fault-tolerant logical-qubit processor using up to eight $[[7,1,3]]$-encoded logical qubits on Quantinuum Helios-1, finding computational capability must grow five orders of magnitude to reach challenge-problem-scale utility.", "motivation": "Different hardware platforms pursue distinct qubit technologies and architectures, making it hard to fairly compare progress toward quantum utility without a rigorous, platform-agnostic benchmark. This work provides such cross-platform measurement and a way to project fault-tolerant scaling trajectories against real utility-scale challenge problems.", "highlights": [ "Introduces QUOPS, a cross-platform benchmark of quantum computational capability and speed", "Shows computational capability must grow five orders of magnitude to match utility-scale challenge problems", "Benchmarks a fault-tolerant processor using up to eight $[[7,1,3]]$-encoded logical qubits on Quantinuum Helios-1" ], "keywords": [ { "label": "Benchmarking", "reason": "Core contribution is a new cross-platform quantum performance benchmark" }, { "label": "Logical Qubits", "reason": "Evaluates a fault-tolerant processor with $[[7,1,3]]$-encoded logical qubits" }, { "label": "Quantum Utility", "reason": "Compares hardware capability against utility-scale challenge problems" }, { "label": "Steane Code", "reason": "Fault-tolerant logical processor uses the $[[7,1,3]]$ Steane code encoding" } ], "emoji": "📊", "social_summary": "A new cross-platform benchmark called QUOPS measures how quantum computers stack up against real-world utility-scale challenges.", "highlights_oneliner": "Cross-platform benchmark tracking path to quantum utility" } ] }, "2026-09-11": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "Floquet", "weight": 4 }, { "word": "QLDPC", "weight": 3 }, { "word": "Decoders", "weight": 4 }, { "word": "GKP", "weight": 2 }, { "word": "Cat", "weight": 3 }, { "word": "Photonic", "weight": 2 }, { "word": "Stabilizer", "weight": 4 }, { "word": "Clifford", "weight": 2 }, { "word": "Leakage", "weight": 3 }, { "word": "Threshold", "weight": 3 }, { "word": "Majorana", "weight": 2 }, { "word": "Kerr", "weight": 2 }, { "word": "Squeezing", "weight": 2 }, { "word": "Mitigation", "weight": 2 } ], "social_highlights": "Highlights: local cellular-automaton decoders enable spatial fault tolerance, lifted surgery speeds QLDPC measurements, zero-overhead Floquet circuits cut leakage, Majorana Floquet codes tune logical dynamics, photonic Bell-measurement beats linear-optics limit, biased-noise surface code thresholds mapped, low-cost surface-code compilation framework, Rényi coherent information hierarchy proven, GKP time-frequency framework built, conditional-squeezing gate hits 99% fidelity, SISIS refrigerator cools Kerr-cat qubits, semi-Clifford conjecture disproven, MPS probes error-mitigation thresholds.", "papers": [ { "arxiv_id": "2609.11457", "title": "Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes", "authors": "Nathaniel Selub, Aditya Bhardwaj, Ethan Lake", "arxiv_url": "https://arxiv.org/abs/2609.11457", "pdf_url": "https://arxiv.org/pdf/2609.11457", "summary": "This work constructs the first fully spatially local fault-tolerant quantum computer using topological codes in fewer than four spatial dimensions, based on a two-dimensional architecture with only geometrically local quantum/classical operations and bounded-speed communication. The core innovation is a time-translation-invariant cellular-automaton decoder for the surface code that preserves logical information for a time stretched-exponential in the code distance $d$, and operates continuously through state injection, stabilizer preparation, lattice surgery, and readout. The authors also prove that every translation-invariant topological Pauli stabilizer code is locally decodable under phenomenological noise.", "motivation": "Fault-tolerant architectures typically rely on global or semi-global classical processing for decoding, which is difficult to scale in hardware with strictly local control and communication. Achieving fully local decoding is a long-standing open problem crucial for realistic, scalable implementations of topological quantum computation.", "highlights": [ "First fully spatially local FT quantum computer using topological codes below 4D", "Cellular-automaton decoder preserves logical info for stretched-exponential time in $d$", "Proof that all translation-invariant topological Pauli stabilizer codes are locally decodable" ], "keywords": [ { "label": "Local Decoders", "reason": "Central contribution is a decoder using only geometrically local operations" }, { "label": "Surface Code", "reason": "The decoder is built specifically for the surface code architecture" }, { "label": "Cellular Automata", "reason": "Decoding is implemented via a time-translation-invariant cellular-automaton process" }, { "label": "Lattice Surgery", "reason": "The construction supports local decoding during lattice-surgery merges and splits" } ], "emoji": "🧩", "social_summary": "Researchers build the first fully spatially local fault-tolerant quantum computer using a new cellular-automaton decoder for surface codes.", "highlights_oneliner": "Fully local cellular-automaton decoder for surface codes" }, { "arxiv_id": "2609.11723", "title": "Lifted surgery: Fast processing with QLDPC codes", "authors": "Lucas Berent, Lawrence Z. Cohen, Armanda O. Quintavalle", "arxiv_url": "https://arxiv.org/abs/2609.11723", "pdf_url": "https://arxiv.org/pdf/2609.11723", "summary": "The paper introduces lifted surgery, a method enabling fast and parallel code surgery on Abelian group algebra QLDPC codes while preserving their low physical overhead. Using block decompositions and commutative algebra techniques, the authors characterize lifted surgery and construct explicit quantum radial codes such as $[[90,8,10]]$ and $[[198,8,16]]$ for which arbitrary independent logical Pauli operators can be measured in a single syndrome extraction round. Circuit-level noise simulations show comparable logical performance to standard surgery while requiring ten times fewer syndrome measurement rounds.", "motivation": "QLDPC codes promise dramatic reductions in physical qubit overhead for fault-tolerant computing, but the time cost of repeated syndrome extraction during code surgery remains a major bottleneck. Speeding up logical operations without sacrificing the low overhead advantage is essential for QLDPC codes to become practically competitive with surface codes.", "highlights": [ "Introduces lifted surgery exploiting code symmetries for fast, parallel logical measurements", "Constructs explicit $[[90,8,10]]$ and $[[198,8,16]]$ quantum radial codes with single-round addressable surgery", "Achieves comparable logical performance with $10\\times$ fewer syndrome extraction rounds under circuit-level noise" ], "keywords": [ { "label": "QLDPC Codes", "reason": "The paper focuses on low-density parity-check codes for fault tolerance" }, { "label": "Code Surgery", "reason": "Lifted surgery is a new technique for performing logical measurements via surgery" }, { "label": "Group Algebra", "reason": "Constructions rely on Abelian group algebra code structures and symmetries" }, { "label": "Circuit-Level Noise", "reason": "Performance is benchmarked under circuit-level depolarizing noise simulations" } ], "emoji": "⚡", "social_summary": "New lifted surgery technique speeds up QLDPC code logical measurements tenfold while keeping low physical overhead.", "highlights_oneliner": "Fast parallel surgery for QLDPC codes" }, { "arxiv_id": "2609.10666", "title": "Walking Floquet code circuits for zero-overhead leakage reduction", "authors": "Hanna Westerheim, Kaavya Sahay, Shruti Puri", "arxiv_url": "https://arxiv.org/abs/2609.10666", "pdf_url": "https://arxiv.org/pdf/2609.10666", "summary": "The authors introduce two zero-overhead 'walking' circuits, called swirling and sliding, for the honeycomb Floquet code that periodically remove leakage while dynamically protecting logical qubits, unlike prior dynamic hFC circuits these preserve the Pauli error distance. Numerical simulations show these circuits can correct as many leakage errors as Pauli errors and, in certain regimes, outperform the same-distance walking surface code due to a pronounced entropic waterfall effect in the logical error rate.", "motivation": "Leakage errors, arising from mechanisms like atom loss or transmon heating, cause correlated errors that undermine QEC code thresholds and effective distance, and their impact is growing as Pauli error rates improve. Designing leakage-robust circuits without added resource overhead is critical for near-term hardware where leakage constitutes a substantial error budget.", "highlights": [ "Two novel zero-overhead walking circuits (swirling, sliding) preserve Pauli distance while removing leakage", "hFC corrects as many leakage errors as Pauli errors under studied noise models", "Entropic waterfall effect lets hFC outperform same-distance walking surface code in some regimes" ], "keywords": [ { "label": "Floquet Codes", "reason": "The paper builds new circuits for the honeycomb Floquet code" }, { "label": "Leakage", "reason": "Central focus is mitigating leakage errors that exit the computational subspace" }, { "label": "Surface Code", "reason": "Performance is compared directly against the walking surface code" }, { "label": "Zero-Overhead LRU", "reason": "Circuits achieve leakage reduction without additional resource overhead" } ], "emoji": "🌀", "social_summary": "New zero-overhead circuits let honeycomb Floquet codes fight leakage errors as effectively as Pauli errors, sometimes beating surface codes.", "highlights_oneliner": "Leakage-resilient walking circuits for Floquet codes" }, { "arxiv_id": "2609.10683", "title": "Floquet Majorana XYZ Codes with Tunable Logical Dynamics", "authors": "Xinyu Sun, Hong Yao", "arxiv_url": "https://arxiv.org/abs/2609.10683", "pdf_url": "https://arxiv.org/pdf/2609.10683", "summary": "This work constructs Floquet codes from the Majorana XYZ subsystem code with realizations both in qubits and directly in microscopic Majorana modes on an $L\\times L$ lattice, showing that odd $L$ supports one static logical qubit while even $L$ supports two. The authors reveal a parity-dependent algebraic obstruction: for $L=4n$ one logical qubit's conjugate Pauli representative must evolve dynamically through the cycle, whereas for $L=4n+2$ both logical qubits admit time-independent representatives, and this obstruction vanishes for a two-step cycle.", "motivation": "Floquet codes offer dynamically generated fault-tolerant protection with low-weight checks, but connecting these constructions to underlying microscopic Majorana physics has remained elusive. Understanding how lattice parity and measurement schedules control whether logical operators are static or dynamical is important for designing hardware-native Majorana-based fault-tolerant architectures.", "highlights": [ "First Floquet-code family with both local qubit and direct microscopic Majorana realizations", "Reveals parity-dependent obstruction distinguishing static vs. dynamical logical qubits based on $L \\mod 4$", "Shows measurement schedule can switch a logical qubit between static and partially dynamical forms" ], "keywords": [ { "label": "Floquet Codes", "reason": "The construction is a new family of Floquet dynamically generated codes" }, { "label": "Majorana Modes", "reason": "Codes are realized directly in microscopic Majorana fermion representations" }, { "label": "Subsystem Codes", "reason": "Built from the Majorana XYZ subsystem code framework" }, { "label": "Logical Dynamics", "reason": "Focus on how logical Pauli representatives evolve statically or dynamically" } ], "emoji": "🔗", "social_summary": "New Floquet code family built from Majorana modes reveals when logical qubits stay static versus evolve dynamically.", "highlights_oneliner": "Majorana-based Floquet codes with tunable logical dynamics" }, { "arxiv_id": "2609.10698", "title": "Demonstration of a logical Bell-state measurement beyond the linear-optical limit", "authors": "Shreya Kumar, Simon D. Reiß, Peter van Loock, Stefanie Barz", "arxiv_url": "https://arxiv.org/abs/2609.10698", "pdf_url": "https://arxiv.org/pdf/2609.10698", "summary": "The authors experimentally realize a logical Bell-state measurement using a two-qubit repetition code (a quantum parity code) implemented with linear optics, achieving a mean success probability of $(70.8 \\pm 0.4)\\%$, surpassing the fundamental $50\\%$ limit of standard linear-optical BSMs. This improvement requires no additional resource overhead since error-correction codes are needed anyway in fault-tolerant schemes, benefiting quantum communication key rates and graph-state generation for quantum computation.", "motivation": "Bell-state measurements are core primitives for quantum repeaters, measurement-based and fusion-based quantum computation, but passive linear optics fundamentally limits BSM success probability to 50% without ancillas. Demonstrating that error-correction encoding itself can overcome this barrier is an important practical step toward scalable, fault-tolerant photonic quantum technologies.", "highlights": [ "Achieves $(70.8\\pm0.4)\\%$ logical BSM success probability, beating the $50\\%$ linear-optical limit", "Uses a two-qubit quantum parity code requiring no extra resource overhead", "Demonstrates error-corrected BSMs benefit both quantum communication and cluster-state generation" ], "keywords": [ { "label": "Photonic QEC", "reason": "Experiment is performed using linear-optical photonic qubits and encoding" }, { "label": "Bell-State Measurement", "reason": "Central task demonstrated is a logical Bell-state measurement" }, { "label": "Quantum Parity Code", "reason": "Encoding uses a two-qubit repetition/quantum parity code structure" }, { "label": "Fusion-Based Computing", "reason": "Results are relevant to fusion operations in fusion-based quantum computation" } ], "emoji": "💡", "social_summary": "Physicists beat the classic 50% linear-optics limit, demonstrating a logical Bell-state measurement with 70.8% success using error correction.", "highlights_oneliner": "Error-corrected photonic Bell measurement beats linear-optics limit" }, { "arxiv_id": "2609.10876", "title": "Threshold Behavior of ZX and ZY Surface Codes Under Circuit-Level Biased and Crosstalk Noise", "authors": "Pritesh Thakur, Jean-François Van Huele", "arxiv_url": "https://arxiv.org/abs/2609.10876", "pdf_url": "https://arxiv.org/pdf/2609.10876", "summary": "This paper constructs and studies a $ZY$ surface code, replacing $X$-type stabilizers with $Y$-type stabilizers, and compares its threshold behavior to the standard $ZX$ surface code under circuit-level Pauli-$X$ biased noise with and without $XX$ crosstalk. The results show the $ZX$ code's $X$-memory threshold increases with bias while $Z$-memory decreases and saturates, whereas the $ZY$ code's $Y$-memory threshold stays nearly constant across bias, and $XX$ crosstalk reduces $Z$-memory thresholds while leaving $X$-memory mostly unaffected.", "motivation": "Prior work showed $Y$-type stabilizers dramatically improve surface code thresholds under code-capacity dephasing noise using expensive tensor-network decoders, but realistic hardware noise is circuit-level and biased with crosstalk. Extending these tailored-stabilizer insights to more realistic circuit-level noise models is essential for translating threshold gains into practical fault-tolerant hardware.", "highlights": [ "Constructs a $ZY$ surface code with $Y$-type stabilizers replacing $X$-type stabilizers", "$ZY$ code's $Y$-memory threshold remains nearly constant across bias, unlike $ZX$'s $X$-memory", "$XX$ crosstalk noticeably reduces $Z$-memory threshold but leaves $X$-memory threshold largely unaffected" ], "keywords": [ { "label": "Surface Codes", "reason": "Paper studies threshold properties of $ZX$ and $ZY$ variants of the surface code" }, { "label": "Biased Noise", "reason": "Analysis centers on circuit-level Pauli-$X$ biased noise models" }, { "label": "Crosstalk", "reason": "Studies impact of gate-based $XX$ crosstalk noise on thresholds" }, { "label": "Tailored Stabilizers", "reason": "Compares stabilizer structures tailored to dominant noise types" } ], "emoji": "🎚️", "social_summary": "Study reveals how swapping stabilizer types in surface codes changes error thresholds under realistic biased and crosstalk noise.", "highlights_oneliner": "ZY surface code thresholds under biased circuit noise" }, { "arxiv_id": "2609.10965", "title": "Low-cost algorithm-to-execution framework for surface-code quantum computing", "authors": "Yunxin Tang, Zixuan Huo, Junxiang Huang, Zhou You, Zhirao Wang, Zhenai Ding, Yumeng Zeng, Yangyu Lu, Yiming Huang, Zongkang Zhang, Haipeng Xie, Ying Li, Jinzhao Sun, Xiao Yuan, Yuan Yao", "arxiv_url": "https://arxiv.org/abs/2609.10965", "pdf_url": "https://arxiv.org/pdf/2609.10965", "summary": "This work develops a low-cost algorithm-to-execution framework for surface-code quantum computing that constructs dependency-preserving logical schedules and executable workloads from hierarchical algorithm descriptions, jointly optimizing spatial organization, non-Clifford resource supply, and execution schedule. Applied to twenty benchmark circuits and an application-scale elliptic-curve discrete-logarithm workload, the framework reduces space-time volume by up to $241.5\\times$ versus an all-synthesis baseline and lowers routed-latency estimates across all benchmarks via circuit-specific surface-code layouts.", "motivation": "While the theoretical mapping from logical circuits to fault-tolerant operations is well established, real implementation choices like spatial layout, magic state supply, and scheduling are often optimized in isolation, leading to large and unpredictable physical overheads. As fault-tolerant processors move toward executing useful algorithms, an integrated framework linking algorithm structure directly to physical resource costs is critical for practical scalability.", "highlights": [ "Framework links hierarchical algorithm descriptions to traceable fault-tolerant execution workflows", "Achieves up to $241.5\\times$ space-time volume reduction versus all-synthesis non-Clifford baseline", "Circuit-specific surface-code layouts reduce routed latency across all twenty tested benchmarks" ], "keywords": [ { "label": "Surface Code", "reason": "Framework targets execution specifically for surface-code architectures" }, { "label": "Resource Estimation", "reason": "Central goal is estimating and reducing physical space-time costs" }, { "label": "Magic States", "reason": "Optimizes non-Clifford resource-state supply and scheduling" }, { "label": "Compilation", "reason": "Builds dependency-preserving logical schedules from algorithm descriptions" } ], "emoji": "🛠️", "social_summary": "New framework links quantum algorithms directly to surface-code hardware execution, slashing resource costs by over 240 times.", "highlights_oneliner": "End-to-end resource optimization for surface-code execution" }, { "arxiv_id": "2609.11930", "title": "Hierarchy of Rényi Coherent Information in Stabilizer Codes", "authors": "Akash Vijay, Luis Colmenarez, Jong Yeon Lee", "arxiv_url": "https://arxiv.org/abs/2609.11930", "pdf_url": "https://arxiv.org/pdf/2609.11930", "summary": "This paper proves that the Rényi-$n$ coherent information of any finite qubit stabilizer code is nondecreasing in $n \\in \\mathbb{Z}^+$ under independent Bernoulli Pauli noise, following from a general theorem about Rényi entropy differences for linear mappings of random bits into fine and coarse labels. The authors further give the Rényi-$n$ coherent information an operational meaning via postselection on matching syndromes across one data block and $n-1$ auxiliary blocks, showing when this defines a quantum channel and that saturation corresponds to asymptotically perfect recovery.", "motivation": "Rényi coherent information is widely used as a computable proxy to detect decodability transitions in noisy quantum codes, but unlike the von Neumann coherent information it lacked both a proven monotonicity in the Rényi index and a clear operational meaning. Establishing rigorous foundations for this quantity is important since numerical studies have long observed threshold ordering with Rényi index without a proof of why it must hold.", "highlights": [ "Proves Rényi-$n$ coherent information is nondecreasing in $n$ for stabilizer codes under Bernoulli Pauli noise", "Establishes a general theorem on monotonicity of Rényi entropy differences for fine/coarse label mappings", "Gives operational meaning via multi-block matched-syndrome postselection linked to recovery guarantees" ], "keywords": [ { "label": "Coherent Information", "reason": "Central quantity analyzed is the Rényi coherent information" }, { "label": "Stabilizer Codes", "reason": "Results are proven specifically for qubit stabilizer codes" }, { "label": "Decodability", "reason": "Connects the information measure to decodability transitions and recovery" }, { "label": "Rényi Entropy", "reason": "Uses Rényi entropy hierarchy and monotonicity as the key mathematical tool" } ], "emoji": "📈", "social_summary": "Researchers prove Rényi coherent information always increases with index for stabilizer codes and give it operational meaning via postselection.", "highlights_oneliner": "Proving monotonicity and meaning of Rényi coherent information" }, { "arxiv_id": "2609.10802", "title": "A Time-Frequency Framework for GKP Codes", "authors": "Franz Luef, Eduard Ortega", "arxiv_url": "https://arxiv.org/abs/2609.10802", "pdf_url": "https://arxiv.org/pdf/2609.10802", "summary": "This work develops a time-frequency framework for lattice GKP codes, realizing ideal codewords in the modulation space $M^\\infty$ and identifying them via a vector-valued Zak transform with a finite logical fibre over the continuous syndrome torus. Multi-window Gabor analysis represents the logical vector as a finite block of adjoint-lattice coefficients, and the authors prove the normalized block map is an isometry with an explicit recovering projection and stable logical reconstruction. They also construct normalizable GKP approximants via lattice-envelope Gabor multipliers and recover displacement syndromes from phase relations with stability guarantees under perturbations.", "motivation": "GKP codes encode finite-dimensional logical information into non-normalizable, distributional grid states of an oscillator, and a rigorous functional-analytic framework is needed to make the stabilizer, logical, and syndrome structures precise. Connecting GKP codes to time-frequency (Gabor) analysis provides new stable tools for logical reconstruction and syndrome extraction that go beyond ad hoc lattice descriptions.", "highlights": [ "Proved the normalized block map from Gabor coefficients to the logical fibre is an isometry", "Constructed normalizable GKP approximants as lattice-envelope Gabor multipliers with weak-$*$ convergence", "Recovered displacement syndromes from phase relations between coefficient blocks with quantified stability" ], "keywords": [ { "label": "GKP Codes", "reason": "The paper's central object is the lattice GKP bosonic quantum error-correcting code" }, { "label": "Gabor Analysis", "reason": "Multi-window Gabor analysis is used to represent logical vectors as coefficient blocks" }, { "label": "Zak Transform", "reason": "A vector-valued Zak transform identifies codewords with a logical fibre over the syndrome torus" }, { "label": "Modulation Spaces", "reason": "Ideal codewords are realized in the modulation space $M^\\infty$, a key functional-analytic tool" } ], "emoji": "🌀", "social_summary": "Researchers build a time-frequency math framework connecting GKP bosonic codes to Gabor analysis for stable logical decoding.", "highlights_oneliner": "Gabor/Zak framework for GKP code structure" }, { "arxiv_id": "2609.10655", "title": "Conditional-squeezing gate in superconducting circuits", "authors": "Roman Schiaffino, Fernando C. Lombardo, Juan Pablo Paz", "arxiv_url": "https://arxiv.org/abs/2609.10655", "pdf_url": "https://arxiv.org/pdf/2609.10655", "summary": "This paper presents a conditional-squeezing gate that squeezes a SQUID-terminated resonator mode along a qubit-state-dependent direction, using a refocusing technique to suppress unwanted time-dependent Hamiltonian terms during state-dependent parametric resonance. The gate is applied to encode arbitrary qubit states into superpositions of single- and two-mode squeezed states, enabling error-detectable encoding via parity measurements with fidelities above $0.99$.", "motivation": "Bosonic encodings in continuous-variable systems offer hardware-efficient alternatives to multi-qubit error correction, but generating the required non-Gaussian resonator states with high fidelity remains challenging in circuit QED. This work extends controlled-squeezing operations toward practical, high-fidelity encodings that are robust to realistic nonlinearities and dissipation, paving a path toward rotation-symmetric bosonic codes.", "highlights": [ "Generalized the controlled-squeezing gate to a conditional two-mode squeezing operation on a SQUID resonator", "Refocusing technique suppresses spurious time-dependent Hamiltonian terms, substantially improving encoding fidelity", "Achieved encoding fidelities above $0.99$ for arbitrary qubit states under realistic Kerr nonlinearity and dissipation" ], "keywords": [ { "label": "Cat Codes", "reason": "Encodes qubits into superpositions of squeezed states analogous to bosonic cat-code encodings" }, { "label": "Squeezed States", "reason": "The gate generates single- and two-mode squeezed resonator states conditioned on qubit state" }, { "label": "Circuit QED", "reason": "Implementation uses SQUID-terminated resonators dispersively coupled to superconducting qubits" }, { "label": "Error Detection", "reason": "Non-Gaussian encoded states enable error-detectable encoding through parity measurements" } ], "emoji": "🐱", "social_summary": "Physicists design a refocused conditional-squeezing gate that encodes qubits into error-detectable squeezed resonator states with over 99% fidelity.", "highlights_oneliner": "High-fidelity conditional squeezing for bosonic encoding" }, { "arxiv_id": "2609.11034", "title": "Engineered two-photon dissipative confinement of a Kerr-cat qubit using SISIS quantum circuit refrigerator", "authors": "Shumpei Masuda, Tsuyoshi Yamamoto, Shuji Nakamura, Daichi Sugiyama, Akiyoshi Tomonaga", "arxiv_url": "https://arxiv.org/abs/2609.11034", "pdf_url": "https://arxiv.org/pdf/2609.11034", "summary": "This work theoretically investigates a quantum circuit refrigerator (QCR) based on a SISIS junction coupled to a Kerr parametric oscillator, showing it can operate in a regime dominated by two-photon absorption rather than single-photon processes. This enables strong suppression of dephasing-induced leakage while substantially reducing the QCR-induced increase in phase-flip errors compared to conventional SINIS-based QCRs.", "motivation": "Kerr-cat qubits offer strongly biased noise favorable for hardware-efficient error correction, but dephasing-induced leakage out of the qubit subspace threatens this advantage and existing single-photon QCR cooling schemes worsen phase-flip errors. A cooling method that selectively targets leakage via two-photon absorption is needed to preserve the noise bias essential for cat-qubit error correction.", "highlights": [ "Identified an operating regime where SISIS-based QCR cooling is dominated by two-photon absorption", "Demonstrated strong leakage suppression with substantially reduced QCR-induced phase-flip error increase versus SINIS", "Showed bit-flip rates remain comparable while phase-flip rates are markedly lower, preserving noise bias" ], "keywords": [ { "label": "Kerr-Cat Qubits", "reason": "The paper focuses on stabilizing Kerr-cat qubits in a parametrically driven nonlinear resonator" }, { "label": "Quantum Refrigeration", "reason": "Uses a SISIS-based quantum circuit refrigerator to remove excess excitations via quasiparticle tunneling" }, { "label": "Biased Noise", "reason": "Preserving the bit-flip/phase-flip noise bias central to cat-qubit error correction is the key goal" }, { "label": "Leakage Suppression", "reason": "Addresses dephasing-induced leakage out of the qubit computational subspace" } ], "emoji": "❄️", "social_summary": "Engineers propose a SISIS-based quantum circuit refrigerator that cools Kerr-cat qubits via two-photon absorption while limiting phase-flip errors.", "highlights_oneliner": "Two-photon cooling preserves Kerr-cat noise bias" }, { "arxiv_id": "2609.11903", "title": "The generalised semi-Clifford conjecture is false", "authors": "Nadish de Silva, Oscar Lautsch", "arxiv_url": "https://arxiv.org/abs/2609.11903", "pdf_url": "https://arxiv.org/pdf/2609.11903", "summary": "The authors construct a five-qubit gate in the fifth level of the Clifford hierarchy that is not generalised semi-Clifford, disproving the 2007 Zeng-Chen-Chuang conjecture that all hierarchy gates take the form $C_1 \\Pi D C_2$. They further show this gate's inverse does not belong to any level of the Clifford hierarchy, demonstrating the hierarchy is not closed under inverses.", "motivation": "The Clifford hierarchy underlies fault-tolerant gate teleportation and magic-state distillation, and a full algebraic classification of its gates has remained an open problem since Gottesman-Chuang introduced it in 1999. Resolving whether all hierarchy gates admit the generalised semi-Clifford structure clarifies the fundamental algebraic limits of fault-tolerant gate synthesis.", "highlights": [ "Constructed an explicit five-qubit, fifth-level Clifford hierarchy gate that is not generalised semi-Clifford", "Disproved the Zeng-Chen-Chuang generalised semi-Clifford conjecture beyond the third level", "Showed the gate's inverse lies outside the Clifford hierarchy entirely, proving non-closure under inverses" ], "keywords": [ { "label": "Clifford Hierarchy", "reason": "The paper directly studies the algebraic structure of the Clifford hierarchy used in fault tolerance" }, { "label": "Magic States", "reason": "Hierarchy gates are implemented via gate teleportation central to magic-state-based fault tolerance" }, { "label": "Gate Teleportation", "reason": "Fault-tolerant execution of hierarchy gates relies on gate teleportation schemes" }, { "label": "Counterexample", "reason": "A concrete five-qubit counterexample gate is constructed to refute the conjecture" } ], "emoji": "🧩", "social_summary": "Mathematicians disprove a longstanding conjecture about the structure of fault-tolerant quantum gates using a five-qubit counterexample.", "highlights_oneliner": "Counterexample refutes Clifford hierarchy conjecture" }, { "arxiv_id": "2609.10929", "title": "Probing the Error-Mitigation Threshold with Matrix Product States", "authors": "Jia-Yao Zhao, Zhi-Yuan Wei, Michael J. Gullans", "arxiv_url": "https://arxiv.org/abs/2609.10929", "pdf_url": "https://arxiv.org/pdf/2609.10929", "summary": "This paper develops a fixed-bond-dimension matrix-product-state method for replicated transfer dynamics to study error-mitigation thresholds arising from mismatches between actual and characterized noise, which map onto a random-field Ising transition in random circuits. The method extends threshold calculations beyond exact numerics, confirming the absence of a threshold for quenched disorder in 1D, sharpening the annealed all-to-all critical point, and resolving finite-depth thresholds in 2D square and heavy-hex circuit architectures.", "motivation": "Quantum error mitigation depends critically on accurate noise characterization, yet prior exact numerical studies of the resulting threshold phenomena were restricted to small 1D and all-to-all systems, leaving realistic 2D device architectures unexplored. Understanding when noise mismatch causes mitigation to fail is essential for deploying error mitigation reliably on near-term two-dimensional quantum hardware.", "highlights": [ "Developed a fixed-bond-dimension MPS method for replicated transfer dynamics beyond exact propagation limits", "Confirmed absence of an error-mitigation threshold for quenched disorder in 1D at larger system sizes", "Resolved architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuit layouts" ], "keywords": [ { "label": "Error Mitigation", "reason": "The paper's central topic is the threshold behavior of quantum error mitigation protocols" }, { "label": "Matrix Product States", "reason": "A fixed-bond-dimension MPS method is developed to simulate replicated transfer dynamics" }, { "label": "Random-Field Ising", "reason": "The mitigation threshold is mapped onto a random-field Ising model phase transition" }, { "label": "Heavy-Hex", "reason": "Thresholds are resolved for realistic 2D heavy-hex and square circuit architectures" } ], "emoji": "🧵", "social_summary": "Scientists use matrix product states to map error-mitigation failure thresholds in realistic 2D quantum circuit architectures.", "highlights_oneliner": "MPS reveals 2D error-mitigation thresholds" } ] }, "2026-09-10": { "word_cloud": [ { "word": "Magic", "weight": 5 }, { "word": "Cultivation", "weight": 4 }, { "word": "Surface", "weight": 3 }, { "word": "Decoding", "weight": 5 }, { "word": "Neutral", "weight": 3 }, { "word": "Atoms", "weight": 3 }, { "word": "Erasure", "weight": 2 }, { "word": "Belief", "weight": 3 }, { "word": "Propagation", "weight": 2 }, { "word": "Tesseract", "weight": 2 }, { "word": "Fermionic", "weight": 3 }, { "word": "Matchgates", "weight": 2 }, { "word": "Privacy", "weight": 3 }, { "word": "Diamond", "weight": 2 }, { "word": "Clifford", "weight": 3 } ], "social_highlights": "Highlights: entangled magic-state cultivation cuts operations 37%, coded Clifford measurements optimize magic-state schedules, neutral-atom architecture slashes logical errors 100x via loss correction, hybrid BP-Tesseract accelerates QLDPC decoding 15x, fermionic quantum computing tolerates 62% noise, surface-code memories reveal relocated privacy leakage.", "papers": [ { "arxiv_id": "2609.09993", "title": "Direct Cultivation of Entangled $|CS\\rangle$ Magic States", "authors": "Gunsik Min, Jun Heo", "arxiv_url": "https://arxiv.org/abs/2609.09993", "pdf_url": "https://arxiv.org/pdf/2609.09993", "summary": "This work develops a direct cultivation architecture for the entangled non-Clifford state $|CS\\rangle=CS|++\\rangle$, using two commuting Clifford involutions to project onto four usable branches and a minimal six-bit $[6,2,4]$ record to protect the branch label against readout errors. The full factory combines verified $\\mathrm{CAT}_7$ gadgets, Steane error detection, $CZZ$-based controlled checks, and immediate Steane-to-surface expansion, decoded via exact low-order resolution, a precomputed catalogue, and four-coset BP+OSD.", "motivation": "Magic-state cultivation has mainly targeted single-qubit non-Clifford resources like $|T\\rangle$, leaving multiqubit entangled resources like $|CS\\rangle$ underexplored despite their potential to reduce factory overhead. As surface-code architectures scale and non-Clifford state preparation dominates resource budgets, directly cultivating entangled magic states offers a new lever for reducing computational cost.", "highlights": [ "No accepted closed-boundary logical-failure mechanism found through fault order two, with explicit order-three mechanisms characterized", "Optimized $d=5\\rightarrow13$ expansion reduces accepted-output operation count by approximately $35$-$37\\%$", "Direct $|CS\\rangle$ cultivation is cheaper in operation count than the three-$T$ route at lower noise, with ordering reversing between $8\\times10^{-4}$ and $9\\times10^{-4}$" ], "keywords": [ { "label": "Magic States", "reason": "The paper centers on cultivating the entangled $|CS\\rangle$ magic state as a non-Clifford resource" }, { "label": "Cultivation", "reason": "Introduces a direct cultivation architecture as an alternative to distillation for producing magic states" }, { "label": "Surface Codes", "reason": "Uses Steane-to-surface expansion and surface-code patches as part of the factory pipeline" }, { "label": "BP+OSD Decoding", "reason": "Employs four-coset belief propagation with ordered statistics decoding for the cultivation circuit" } ], "emoji": "🪄", "social_summary": "Researchers directly cultivate an entangled two-qubit magic state, cutting operation counts by up to 37% versus standard distillation routes.", "highlights_oneliner": "Direct cultivation of entangled $|CS\\rangle$ magic states with protected branch record" }, { "arxiv_id": "2609.09994", "title": "Coded Clifford Measurements for Multiqubit Magic-State Cultivation", "authors": "Gunsik Min, Jun Heo", "arxiv_url": "https://arxiv.org/abs/2609.09994", "pdf_url": "https://arxiv.org/pdf/2609.09994", "summary": "This paper shows that the classical record layer protecting entangled magic-state branches during cultivation is exactly a binary linear code, with measurement schedules acting as generator matrices and postselection yielding $P_{\\mathrm{wv}}=O(q^d)$ at record distance $d$. The physically realizable Clifford measurement family saturates the Plotkin bound, requiring only six logical measurements for $|CS\\rangle$ and seven for $|CCZ\\rangle$ at distance four, versus eight and twelve for independent repetition.", "motivation": "Magic-state cultivation for entangled resources requires protecting multibit classical branch records, and understanding the coding-theoretic structure of this protection is essential for minimizing overhead. Prior cultivation schemes lacked a formal framework connecting branch-record protection to classical coding theory, limiting optimization of measurement schedules.", "highlights": [ "Proves the branch-record layer for third-level Clifford-hierarchy unitaries $U\\in\\mathcal{C}_3$ is exactly a binary linear code", "Physically realizable Clifford measurements saturate the Plotkin bound, needing only 6 measurements for $|CS\\rangle$ and 7 for $|CCZ\\rangle$ at distance four", "Native-$CZZ$-assisted Steane realization achieves the unique minimum-cost $[6,2,4]$ CS schedule, cutting active locations by $26.6\\%$" ], "keywords": [ { "label": "Magic States", "reason": "Focuses on multiqubit magic-state cultivation for entangled non-Clifford resources" }, { "label": "Coding Theory", "reason": "Connects branch-record protection to binary linear codes and the Plotkin bound" }, { "label": "Clifford Hierarchy", "reason": "Analyzes third-level Clifford-hierarchy unitaries and their commuting Hermitian observables" }, { "label": "Postselection", "reason": "Uses postselection on valid classical records to suppress logical-frame errors" } ], "emoji": "🧩", "social_summary": "Shows magic-state branch records are binary linear codes, enabling optimal measurement schedules that saturate coding bounds.", "highlights_oneliner": "Coding theory optimizes Clifford measurement schedules for magic-state cultivation" }, { "arxiv_id": "2609.10079", "title": "Loss-correcting fault-tolerant quantum computing architecture for neutral atoms", "authors": "Sanaa Sharma, Yutaka Hirano, Akihisa Goban, Hayata Yamasaki, Shinichi Sunami, Prakash Murali", "arxiv_url": "https://arxiv.org/abs/2609.10079", "pdf_url": "https://arxiv.org/pdf/2609.10079", "summary": "This paper comprehensively models qubit loss in neutral-atom FTQC and develops a loss-tolerant transversal-gate architecture that co-designs layout, compilation, and decoding to treat loss as a dynamic program-wide budget. A single-compute-zone physical layout eliminates repeated SLM-AOD handoffs and long-distance shuttling, combined with compiler optimizations respecting RF tone and AOD bandwidth constraints, a loss-aware delayed-erasure decoder, and an end-to-end loss-aware magic state cultivation protocol.", "motivation": "Neutral-atom qubit loss is a dominant error source that standard stochastic-Pauli error correction cannot address, and loss-agnostic compilation and routing decisions can further increase loss exposure. As neutral-atom platforms scale toward large fault-tolerant systems, holistic loss-aware architectural design is needed to bridge the gap between idealized FTQC studies and physically realistic hardware constraints.", "highlights": [ "Reduces accumulated loss per syndrome-extraction round by up to $2.15\\times$ versus a zoned baseline architecture", "Reduces logical error rates by over two orders of magnitude compared to current architectures", "Derives concrete device targets including continuous reloading rates, AOD counts, and shuttling trajectory choices" ], "keywords": [ { "label": "Neutral Atoms", "reason": "The paper targets neutral-atom arrays as the qubit hardware platform" }, { "label": "Qubit Loss", "reason": "Central focus is modeling and correcting qubit loss as a dominant error channel" }, { "label": "Compiler Co-design", "reason": "Develops compilation and routing optimizations jointly with layout and decoding" }, { "label": "Erasure Decoding", "reason": "Uses a loss-aware delayed-erasure decoder to handle detected qubit loss events" } ], "emoji": "⚛️", "social_summary": "New neutral-atom architecture co-designs layout, compilation and decoding to cut qubit loss and slash logical error rates 100-fold.", "highlights_oneliner": "Loss-aware co-design cuts neutral-atom logical error rates by 100x" }, { "arxiv_id": "2609.10056", "title": "Accelerating A*-Based Algorithms for Decoding Quantum Low-Density Parity-Check Codes", "authors": "Lamia Yous, Francisco Garcia Herrero, Mark F. Flanagan", "arxiv_url": "https://arxiv.org/abs/2609.10056", "pdf_url": "https://arxiv.org/pdf/2609.10056", "summary": "This paper proposes a two-stage hybrid decoder for QLDPC codes combining belief propagation (BP) with the A*-based Tesseract decoder, where BP generates hard decisions and soft confidence information that is refined by a gating mechanism before being passed to Tesseract for residual error correction. This hybrid approach substantially reduces decoding complexity while preserving Tesseract's logical error rate performance.", "motivation": "Tesseract's A* search guarantees optimal error patterns for QLDPC codes but suffers from high computational overhead and sequential runtime that limits scalability, while BP is fast but suffers from error floors due to Tanner graph cycles. Combining the speed of BP with the accuracy of Tesseract addresses the critical need for decoders that meet the strict latency requirements of real-time quantum error correction.", "highlights": [ "Achieves at least a $5\\times$ reduction in expanded search nodes across all tested physical error rates", "Peak reduction of nearly $15\\times$ at $p=0.05$ for the $[[126,12,d<11]]$ T1 code", "Approximately $8.8\\times$ node-expansion reduction at $p=0.05$ for the $[[72,12,6]]$ bicycle bivariate code, with LER matching stand-alone Tesseract" ], "keywords": [ { "label": "QLDPC Codes", "reason": "The paper targets decoding of quantum low-density parity-check codes" }, { "label": "Belief Propagation", "reason": "BP decoding is used as the fast first-stage decoder generating soft information" }, { "label": "A* Search", "reason": "Tesseract's A*-based search algorithm is the core exact decoder being accelerated" }, { "label": "Hybrid Decoding", "reason": "Combines BP and Tesseract in a two-stage pipeline with a gating mechanism" } ], "emoji": "🔍", "social_summary": "A hybrid BP plus Tesseract decoder slashes A* search complexity up to 15x while matching optimal logical error rates for QLDPC codes.", "highlights_oneliner": "Hybrid BP-Tesseract decoder cuts QLDPC decoding complexity 15x" }, { "arxiv_id": "2609.09467", "title": "Noise Limits on Fault-Tolerant Fermionic Quantum Computing", "authors": "Owen Allison, Luke Coffman", "arxiv_url": "https://arxiv.org/abs/2609.09467", "pdf_url": "https://arxiv.org/pdf/2609.09467", "summary": "This work establishes an upper noise limit of $p=(8-2\\sqrt{6})/5 \\approx 62\\%$ for fermionic quantum computing using the matchgate plus non-Gaussian resource universal gate set, independent of circuit depth. The bound is derived using Uhlmann-Wootters concurrences applied to a 4-mode fermionic Choi state representing a resourceful gate combined with local depolarizing noise, identifying when the combined channel becomes convex Gaussian.", "motivation": "Determining upper bounds on tolerable noise complements known lower bounds for fault tolerance, revealing the noise regimes where fault-tolerant encoding becomes fundamentally impossible regardless of error-correcting code sophistication. Prior work established such upper limits of around $45\\%$ for Clifford+$T$ circuits, but analogous bounds for fermionic quantum computing with matchgates were previously unknown.", "highlights": [ "Derives a noise threshold of $p=(8-2\\sqrt{6})/5\\approx 62\\%$ for matchgate-based fermionic quantum computing", "Bound is independent of circuit depth, using Uhlmann-Wootters concurrence on a 4-mode fermionic Choi state", "Establishes the best known noise upper bound for fermionic quantum computing, though not directly comparable to qubit-based bounds due to differing noise models" ], "keywords": [ { "label": "Fermionic QC", "reason": "The paper focuses on noise limits specific to fermionic quantum computing models" }, { "label": "Matchgates", "reason": "Uses the matchgate plus non-Gaussian resource universal gate set as the computational model" }, { "label": "Noise Thresholds", "reason": "Derives an upper bound on tolerable local depolarizing noise for universality" }, { "label": "Concurrence", "reason": "Uses Uhlmann-Wootters concurrence to analyze the Choi state of noisy resourceful gates" } ], "emoji": "🌀", "social_summary": "Finds fermionic quantum computers can tolerate up to 62 percent local noise before losing universality, the best known bound for fermions.", "highlights_oneliner": "Depth-independent 62% noise bound for fermionic quantum computation" }, { "arxiv_id": "2609.09334", "title": "Execution-transcript privacy for fault-tolerant surface-code memories", "authors": "Jiachen Shen, Hui Zhong", "arxiv_url": "https://arxiv.org/abs/2609.09334", "pdf_url": "https://arxiv.org/pdf/2609.09334", "summary": "This paper proves that under three stated hypotheses, the channel from a logical qubit to the syndrome/decoder telemetry transcript of a distance-$d$ rotated surface-code memory over $T=\\Theta(d)$ rounds is $e^{-\\Theta(d)}$-close in diamond norm to an input-independent channel, but shows this privacy guarantee is anisotropic: it depends on the code's $Z$-distance $d_Z$ rather than overall code distance under amplitude damping. Experiments on a 156-qubit superconducting processor and distance-1 codes confirm the theory, showing measurable leakage where the sufficient certificate fails and identifying records like lattice-surgery parity readout that do expose the logical input.", "motivation": "Fault-tolerant quantum computers generate massive classical telemetry streams from syndrome measurements and decoder actions that are shared with control infrastructure, raising unaddressed privacy questions about whether this side-channel data can reveal computation on cloud quantum platforms. While stabilizer folklore assumes syndromes are logical-state-independent in the noiseless case, no rigorous theorem previously addressed multi-round observed transcripts under realistic noise, coherent effects, or non-Markovian dynamics.", "highlights": [ "Proves transcript privacy is $e^{-\\Theta(d)}$-close to input-independence under sector-scalar, locality, and Kotecky-Preiss smallness hypotheses", "Shows privacy is anisotropic: governed by $Z$-distance $d_Z$ under amplitude damping rather than overall code distance $d$", "Measured a $d_Z=1$ memory's record identifies input with total variation $\\ge 0.927$; a 156-qubit processor misses the sufficient certificate by $21.5\\times$" ], "keywords": [ { "label": "Surface Codes", "reason": "Analyzes privacy properties specifically for rotated surface-code memories" }, { "label": "Side Channels", "reason": "Investigates classical telemetry as a potential information leakage side channel" }, { "label": "Diamond Norm", "reason": "Uses diamond-norm distance to quantify closeness to input-independent channels" }, { "label": "Amplitude Damping", "reason": "Shows anisotropic privacy behavior specifically under amplitude damping noise" } ], "emoji": "🔒", "social_summary": "Fault-tolerant quantum memories relocate rather than eliminate privacy leaks, with experiments showing measurable transcript leakage under damping noise.", "highlights_oneliner": "Surface-code telemetry privacy depends on Z-distance, not code distance" } ] }, "2026-09-09": { "word_cloud": [ { "word": "LDPC", "weight": 5 }, { "word": "Bivariate", "weight": 4 }, { "word": "Bosonic", "weight": 4 }, { "word": "Toric", "weight": 3 }, { "word": "GKP", "weight": 3 }, { "word": "Trapped-Ion", "weight": 3 }, { "word": "Decoders", "weight": 3 }, { "word": "Transversal", "weight": 3 }, { "word": "Resource", "weight": 3 }, { "word": "Distributed", "weight": 2 }, { "word": "Fermion", "weight": 2 }, { "word": "QAOA", "weight": 3 }, { "word": "Nonstabilizerness", "weight": 2 }, { "word": "Scars", "weight": 2 }, { "word": "Spin", "weight": 2 } ], "social_highlights": "Highlights: weight-8 bivariate bicycle codes beat BB benchmark, toric code thresholds mapped across geometries, first fault-tolerant fermion encoding memory demonstrated, 20,000-qubit trapped-ion attack on 256-bit ECC estimated, CROT gate advances bosonic cat codes, asymmetric codes tailored to QAOA noise, GKP self-correction explained via Arrhenius scaling, transversal fanout aids distributed QC, platform-aware FT compiler released, quantum belief propagation proven convergent, magic quantified in codes, decoder libraries stress-tested, [[4,2,2]] code boosts QAOA, error-detected dynamic circuits scale to 100 qubits, quantum scars yield new codes, spin qubit roadmap to fault tolerance, cat-code non-local CNOTs secure quantum networks.", "papers": [ { "arxiv_id": "2609.06572", "title": "Quantum bivariate bicycle codes with weight-8 checks surpassing the BB benchmark", "authors": "Liangdong Lu, Ruipan Yang, Guanmin Guo", "arxiv_url": "https://arxiv.org/abs/2609.06572", "pdf_url": "https://arxiv.org/pdf/2609.06572", "summary": "The authors extend bivariate bicycle (BB) codes to weight-8 checks (weight-4 generator polynomials), developing an algebraic structure theory including an exact dimension formula $k=2\\dim R/(A,B)$, a symmetry group of size $4\\ell m$, and proof of $d_X=d_Z$. Using an exactly validated search pipeline they certify a census of $53$ codes at $n=144$ that surpass the original BB benchmark, e.g. $[[144,6,d\\ge15]]$ and $[[144,16,10]]$, and $[[72,14,8]]$ at $n=72$.", "motivation": "Bravyi et al.'s BB codes with weight-6 checks set a strong benchmark for QLDPC codes, but they explicitly noted weight-8 check codes could achieve better $(n,k,d)$ trade-offs without a systematic study. This work fills that gap with rigorous algebraic tools and exhaustive distance certification rather than heuristic estimates.", "highlights": [ "Exact dimension formula $k=2\\dim R/(A,B)$ forcing $k$ even, plus a $4\\ell m$-element symmetry group and proof of $d_X=d_Z$", "Certified $[[144,6,d\\ge15]]$ exceeding the BB benchmark distance of $12$, and $[[72,14,8]]$ with $kd^2/n=12.44$, over twice the BB code at same length", "Circuit-level memory simulation shows weight-8 codes reach $\\approx0.1\\%$ pseudo-threshold versus $\\approx0.4\\%$ for BB reference, quantifying the threshold cost" ], "keywords": [ { "label": "QLDPC Codes", "reason": "The paper is centered on quantum low-density parity-check codes as a scalable memory architecture" }, { "label": "Bivariate Bicycle", "reason": "Extends the BB code family with weight-8 stabilizer checks" }, { "label": "Distance Certification", "reason": "Uses an exact bit-mask verifier to exhaustively certify code distances rather than estimate them" }, { "label": "Circuit-Level Noise", "reason": "Evaluates pseudo-thresholds under circuit-level depolarizing noise simulations" } ], "emoji": "🧬", "social_summary": "Researchers build weight-8 bivariate bicycle codes that beat the original BB benchmark, certifying higher distances with exact algebraic tools.", "highlights_oneliner": "Weight-8 BB codes surpass the original BB benchmark" }, { "arxiv_id": "2609.07579", "title": "Geometry Dependence of Error Thresholds in Two-Dimensional Toric Codes", "authors": "D. Lessing, A. Langheld, C. Krämer, J. A. Koziol, K. P. Schmidt", "arxiv_url": "https://arxiv.org/abs/2609.07579", "pdf_url": "https://arxiv.org/pdf/2609.07579", "summary": "The authors map 2D toric codes under bit- or phase-flip errors onto the random-bond Ising model and use replica-exchange Monte Carlo simulations to compute maximum-likelihood error thresholds on the Nishimori line for square, honeycomb, triangular, dice, and kagome lattices. They find that dual-lattice pairs show a characteristic threshold splitting around the self-dual square lattice, with coordination number as the dominant factor but local geometric arrangement also mattering.", "motivation": "Prior threshold studies for general lattice geometries relied on suboptimal decoders like minimum-weight perfect matching, but the rise of near-optimal decoders makes it important to know the true maximum-likelihood limits set by geometry. Understanding how lattice geometry governs thresholds informs the design of scalable fault-tolerant quantum architectures beyond the standard square-lattice surface code.", "highlights": [ "Computed optimal (maximum-likelihood) error thresholds on the Nishimori line for five distinct 2D lattice geometries", "Demonstrated duality-driven splitting of thresholds around the self-dual square lattice for dual-lattice pairs", "Showed average coordination number dominates threshold value but detailed vertex/plaquette arrangement also matters" ], "keywords": [ { "label": "Toric Code", "reason": "Central topological code studied under different lattice geometries" }, { "label": "Random-Bond Ising", "reason": "Maps error correction thresholds onto the RBIM statistical mechanics model" }, { "label": "Nishimori Line", "reason": "Optimal thresholds are computed along this special parameter line" }, { "label": "Monte Carlo", "reason": "Replica-exchange Monte Carlo simulations are the core computational method" } ], "emoji": "🔷", "social_summary": "Physicists compute optimal error thresholds for toric codes on five lattice geometries, revealing a duality-driven threshold splitting effect.", "highlights_oneliner": "Lattice geometry shapes optimal toric code thresholds" }, { "arxiv_id": "2609.08957", "title": "First fault-tolerant quantum memory demonstration for a generalized superfast encoding", "authors": "James Brown, Kenny Heitritter", "arxiv_url": "https://arxiv.org/abs/2609.08957", "pdf_url": "https://arxiv.org/pdf/2609.08957", "summary": "The authors introduce an even-distance $d$ constant-weight variant of the Generalized Superfast Encoding (GSE) fermion-to-qubit mapping, arranging $N$ modes in $d$-qubit blocks on a ring with stabilizer weights of only 4 or 6. They simulate quantum memory experiments under circuit-level depolarizing noise for $[[48,8,6]]$ and $[[64,8,8]]$ codes, observing a threshold of $\\approx4\\times10^{-3}$, the first threshold-like characterization of a fermion mapping.", "motivation": "Fermion-to-qubit encodings like Jordan-Wigner and Bravyi-Kitaev are widely used for quantum simulation but generally lack fault-tolerance under circuit-level noise, while the GSE promised error-correcting properties that had only been demonstrated for error detection. Demonstrating genuine fault-tolerant scaling for GSE closes an important gap for practical fault-tolerant quantum simulation of fermionic systems.", "highlights": [ "Constructed even-distance GSE with constant stabilizer weight 4 or 6 for any even $d$", "Stabilizer set always partitions into four qubit-wise commuting groups enabling compact syndrome extraction", "Observed threshold $\\approx4\\times10^{-3}$ for $[[48,8,6]]$ and $[[64,8,8]]$ codes, the first fault-tolerant memory characterization of a fermion mapping" ], "keywords": [ { "label": "Fermion Encoding", "reason": "Focuses on mapping fermionic modes to qubits with the Generalized Superfast Encoding" }, { "label": "Stabilizer Codes", "reason": "Constructs constant-weight stabilizer generators for quantum error correction" }, { "label": "Circuit-Level Noise", "reason": "Threshold is characterized under realistic circuit-level depolarizing noise" }, { "label": "Syndrome Extraction", "reason": "Qubit-wise commuting stabilizer groups enable compact syndrome-extraction scheduling" } ], "emoji": "🧪", "social_summary": "Scientists demonstrate the first fault-tolerant quantum memory for a fermion-to-qubit encoding, showing threshold-like error suppression.", "highlights_oneliner": "First fault-tolerant memory for a fermion mapping" }, { "arxiv_id": "2609.05625", "title": "Computing 256-bit elliptic curve discrete logarithms in 26 days on a fault-tolerant trapped-ion quantum computer with 20,000 qubits", "authors": "Thomas Häner, Felix Tripier, Jacob Young, Michael Naehrig, Andrii Maksymov, Safwan Alam, Dmitri Maslov, Matthew Parrott, Yvette de Sereville, Jordan Sullivan, Mark Webster, Nicolas Delfosse, John Gamble, Martin Roetteler", "arxiv_url": "https://arxiv.org/abs/2609.05625", "pdf_url": "https://arxiv.org/pdf/2609.05625", "summary": "The authors present optimized resource estimates for solving the 256-bit ECDLP on $\\mathtt{secp256k1}$ using Shor's algorithm on a trapped-ion Walking Cat Architecture, achieving a logical circuit with about $1450$ qubits and $40\\times10^6$ Toffoli gates. Through a fast CCZ magic-state factory, depth-one CCZ state injection, parallelized cat-based measurements, and the CliNR protocol, they estimate the full computation takes $25.7$ days using $19{,}397$ physical qubits with $63\\%$ success probability.", "motivation": "Resource estimates for breaking widely-used cryptographic schemes like ECDLP track the practical progress of fault-tolerant quantum computing and inform cryptographic risk assessments for blockchain and other applications relying on $\\mathtt{secp256k1}$. This work extends prior resource-estimation progress by tailoring architectural and algorithmic optimizations specifically for this application on a concrete hardware platform.", "highlights": [ "Logical circuit requiring only $\\sim1450$ qubits and $40\\times10^6$ Toffoli gates with rigorous success-probability bound of $1-2^{-128}$", "Fast CCZ magic-state factory and depth-one CCZ state injection reduce CCZ gate execution time by a factor of $31$", "Full estimate: $25.7$ days runtime using $19{,}397$ physical qubits achieving $63\\%$ success probability" ], "keywords": [ { "label": "Shor's Algorithm", "reason": "The paper implements Shor's algorithm for solving the elliptic curve discrete logarithm problem" }, { "label": "Resource Estimation", "reason": "Provides detailed physical and logical qubit and gate-count estimates for a cryptographic application" }, { "label": "Trapped Ion", "reason": "Targets a specific trapped-ion Walking Cat Architecture hardware platform" }, { "label": "Magic States", "reason": "Introduces a fast CCZ magic-state factory to accelerate non-Clifford gates" } ], "emoji": "🔐", "social_summary": "Engineers estimate a trapped-ion quantum computer could break 256-bit elliptic curve cryptography in under a month using 20000 qubits.", "highlights_oneliner": "ECDLP resource estimate for trapped-ion architecture" }, { "arxiv_id": "2609.07076", "title": "Single-tone drive-enhanced CROT gate for bosonic quantum error correction", "authors": "Shushen Qin, Long D. H. My, Adrian Copetudo, Amon M. Kasper, Yvonne Y. Gao, Hui Khoon Ng", "arxiv_url": "https://arxiv.org/abs/2609.07076", "pdf_url": "https://arxiv.org/pdf/2609.07076", "summary": "The authors propose a direct circuit-QED implementation of the two-mode controlled-rotation (CROT) gate for rotation-symmetric bosonic codes, using a single-frequency transmon drive coupled to two microwave cavities to enhance cross-Kerr nonlinearity. They provide analytical formulas identifying working regimes, refine them with exact numerics, and demonstrate error-correction performance across different RSB codes within the same circuit.", "motivation": "The CROT gate is central to error correction of rotation-symmetric bosonic codes like cat codes due to its code-agnostic generality and favorable error-propagation properties, but composing it from imperfect primitives typically destroys these properties. A direct, hardware-efficient implementation is needed to realize the practical advantages of bosonic error correction.", "highlights": [ "Achieved single-drive-frequency CROT with sufficient on-off ratio while minimizing mode distortions", "Derived analytical formulas for identifying working regimes, refined with exact numerical optimization", "Demonstrated error-correction performance for different RSB codes implemented within the same circuit" ], "keywords": [ { "label": "Bosonic Codes", "reason": "Targets rotation-symmetric bosonic codes like cat codes for hardware-efficient QEC" }, { "label": "CROT Gate", "reason": "The paper's central contribution is a direct implementation of the controlled-rotation gate" }, { "label": "Circuit QED", "reason": "Implementation uses a transmon coupled to microwave cavities in circuit-QED architecture" }, { "label": "Cross-Kerr", "reason": "Gate is engineered via drive-enhanced cross-Kerr nonlinearity between cavity modes" } ], "emoji": "🐱", "social_summary": "Physicists engineer a single-drive transmon scheme to implement the key CROT gate needed for bosonic cat-code error correction.", "highlights_oneliner": "Direct single-drive CROT gate for cat codes" }, { "arxiv_id": "2609.07235", "title": "Asymmetric quantum error correction efficiently tackles application-specific noise effects", "authors": "Abhishek Yadav, Peter K. Schuhmacher, Michael Epping", "arxiv_url": "https://arxiv.org/abs/2609.07235", "pdf_url": "https://arxiv.org/pdf/2609.07235", "summary": "The authors study how bit-flip versus phase-flip Pauli noise differentially affects QAOA performance on a flight-gate assignment instance, comparing layer-level and gate-level noise models across CNOT-based and native-$R_{ZZ}$ circuit decompositions. They exploit the resulting asymmetry to show that a smaller asymmetric quantum parity code (QPC) can match the performance improvement of a larger symmetric code.", "motivation": "As quantum devices enter the early fault-tolerant era, understanding how small error-correcting codes can boost near-term algorithm performance is increasingly important, yet error correction resources are typically allocated based only on physical error rates rather than application sensitivity. This work shows that tailoring code asymmetry to application-specific noise sensitivity can save resources even under symmetric physical noise.", "highlights": [ "Found bit-flip noise causes larger QAOA performance degradation than phase-flip noise on a flight-gate assignment instance", "Asymmetry is most pronounced in layer-level and native-$R_{ZZ}$ simulations, explained via error propagation analysis", "Demonstrated a smaller asymmetric quantum parity code achieves nearly the same improvement as a larger symmetric code" ], "keywords": [ { "label": "QAOA", "reason": "The application studied is the quantum approximate optimization algorithm" }, { "label": "Asymmetric Codes", "reason": "Central technique is tailoring code asymmetry between bit-flip and phase-flip protection" }, { "label": "Quantum Parity Code", "reason": "Uses the QPC, a generalization of the Shor code, as the illustrative code family" }, { "label": "Noise Bias", "reason": "Analyzes how bit-flip versus phase-flip noise asymmetrically impacts application performance" } ], "emoji": "✈️", "social_summary": "Researchers show error correction tailored to how bit-flip versus phase-flip noise hurts QAOA can save resources on a flight scheduling problem.", "highlights_oneliner": "Asymmetric QEC matched to application noise sensitivity" }, { "arxiv_id": "2609.07702", "title": "Subsystem self-correction of the GKP qubit", "authors": "Brian Chung Hang Cheung, Lasse Bjørn Kristensen, Frederik Nathan, Michael Kastoryano", "arxiv_url": "https://arxiv.org/abs/2609.07702", "pdf_url": "https://arxiv.org/pdf/2609.07702", "summary": "The authors derive the self-correcting behavior of the ideal GKP Hamiltonian from a subsystem code decomposition, showing that detailed-balance jump operators split into a dominant gauge-subsystem part and a boundary term acting on the logical qubit. This boundary term is exponentially suppressed by Gibbs weights near the modular cell edges, producing an effective string tension in modular phase space responsible for Arrhenius-type scaling of the logical lifetime.", "motivation": "Self-correcting quantum memories, where memory time grows as temperature decreases without active intervention, remain elusive despite deep theoretical interest from spin systems and topological phases. Recent suggestions that the GKP bosonic code could be self-correcting motivate a rigorous quantum-information-theoretic explanation of this mechanism, distinct from typical spin-based approaches like the surface code.", "highlights": [ "Derived a subsystem code decomposition showing the GKP Hamiltonian acts trivially on the logical subsystem", "Showed logical errors arise from a boundary term exponentially suppressed by Gibbs weights near modular cell edges", "Established Arrhenius-type scaling of logical lifetime via an effective string tension in modular phase space, confirmed numerically at finite energy" ], "keywords": [ { "label": "GKP Code", "reason": "The paper analyzes self-correction properties of the Gottesman-Kitaev-Preskill bosonic code" }, { "label": "Self-Correction", "reason": "Central theme is passive, temperature-dependent protection without active error correction" }, { "label": "Subsystem Codes", "reason": "Uses subsystem code decomposition to separate logical and gauge degrees of freedom" }, { "label": "Arrhenius Scaling", "reason": "Derives thermally activated scaling law for the logical qubit lifetime" } ], "emoji": "🌡️", "social_summary": "Theorists explain why the GKP bosonic code can self-correct, deriving an Arrhenius-like scaling law for its logical lifetime from first principles.", "highlights_oneliner": "Explaining passive self-correction in GKP qubits" }, { "arxiv_id": "2609.08233", "title": "Transversal Fanout for Fault Tolerant Distributed Quantum Computing: Analysis and Application", "authors": "Seng W. Loke", "arxiv_url": "https://arxiv.org/abs/2609.08233", "pdf_url": "https://arxiv.org/pdf/2609.08233", "summary": "This work develops a resource-efficient method for implementing logical fanout operations, multiple controlled-NOT gates from one control to remote targets, using transversal operations on quantum error-correcting code blocks in distributed fault-tolerant quantum computing. The construction, illustrated with Bivariate Bicycle (BB)-code blocks, reduces non-local operations while preserving the logical fanout action, and is analyzed in terms of physical gate, entanglement, circuit-depth, and ancilla requirements.", "motivation": "Logical fanout is a key primitive for distributed quantum computation, but directly implementing it between encoded blocks can require substantial costly non-local communication. Exploiting transversal logical operations and code block structure offers a systematic path to more scalable distributed fault-tolerant architectures.", "highlights": [ "Constructed distributed fanout circuits exploiting transversal logical operations to reduce non-local operations", "Illustrated the construction using Bivariate Bicycle (BB)-code blocks", "Analyzed physical gate, entanglement, circuit-depth, and ancilla costs, including a distributed global $GCZ$ gate implementation" ], "keywords": [ { "label": "Distributed QC", "reason": "Focuses on fault-tolerant distributed quantum computing across remote nodes" }, { "label": "Transversal Gates", "reason": "Exploits transversal logical operations to reduce communication overhead" }, { "label": "Fanout", "reason": "Logical fanout, multiple CNOTs from one control, is the primitive operation studied" }, { "label": "Bivariate Bicycle", "reason": "BB-code blocks are used to illustrate the distributed fanout construction" } ], "emoji": "🕸️", "social_summary": "A new method uses transversal gates on BB-code blocks to make distributed quantum fanout operations more resource-efficient.", "highlights_oneliner": "Resource-efficient distributed logical fanout circuits" }, { "arxiv_id": "2609.08908", "title": "A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation", "authors": "Srushti Patil, Susan X. Chen, Andreas Juul Bay-Smidt, Stefan Alaric Schäffer, Peter Krogstrup, Stefano Paesani, Gemma C. Solomon", "arxiv_url": "https://arxiv.org/abs/2609.08908", "pdf_url": "https://arxiv.org/pdf/2609.08908", "summary": "The authors introduce a platform-aware compilation framework that recompiles quantum circuits into hardware-compatible fault-tolerant instructions, producing end-to-end resource estimates (physical-qubit count, time-to-solution, classical processing time) across different hardware modalities. They introduce a transversal active volume ($t$-AV) architecture for efficient fault-tolerant execution on platforms with long-range logical connectivity, benchmarking it on Fermi-Hubbard simulation and eigenenergy estimation of trimethylenemethane.", "motivation": "Existing compilation frameworks typically target a single fixed architecture-hardware configuration, making cross-platform resource comparisons difficult for fault-tolerant algorithm design. As diverse qubit modalities (photonic, superconducting, neutral atom) mature, a unified framework is needed to quantify trade-offs in connectivity, clock speed, and noise for early fault-tolerant demonstrations.", "highlights": [ "Introduces the transversal active volume ($t$-AV) compilation architecture for long-range logical connectivity", "Benchmarks end-to-end resource estimates across photonic, superconducting, and neutral-atom platforms", "Shows quantum chemistry simulation of trimethylenemethane achievable with $\\sim10^4$ physical qubits" ], "keywords": [ { "label": "Resource Estimation", "reason": "The paper's central goal is end-to-end physical-qubit and runtime estimation for fault-tolerant algorithms" }, { "label": "Compilation", "reason": "Introduces a platform-aware compiler that recompiles circuits into hardware-specific fault-tolerant instructions" }, { "label": "Active Volume", "reason": "Proposes the transversal active volume ($t$-AV) architecture as a novel compilation strategy" }, { "label": "ZX-calculus", "reason": "Uses ZX-calculus diagrams to represent and compute space-time volumes of transversal logical operations" } ], "emoji": "🧮", "social_summary": "New compiler estimates fault-tolerant quantum computing costs across photonic, superconducting, and neutral-atom hardware platforms.", "highlights_oneliner": "Cross-platform resource estimation via transversal active volume compilation" }, { "arxiv_id": "2609.05857", "title": "Quantum Message Passing Convergence and Vanishing Block-Error Probability for Random LDPC Codes", "authors": "Avijit Mandal, Christophe Piveteau, Joseph M. Renes, Henry D. Pfister", "arxiv_url": "https://arxiv.org/abs/2609.05857", "pdf_url": "https://arxiv.org/pdf/2609.05857", "summary": "The authors construct a two-stage belief propagation with quantum messages (BPQM) decoder for random $q$-ary LDPC codes over symmetric $q$-ary pure-state channels and prove its ensemble-average block-error probability vanishes as blocklength $N\\to\\infty$. They derive double-exponential fidelity decay for regular ensembles with $d_v\\geq3$ using depth-$\\ell$ BPQM with $\\ell=\\Theta(\\log\\log N)$ combined with erasure-based recovery via minimum distance.", "motivation": "BPQM achieves optimal decoding on tree factor graphs for pure-state classical-quantum channels, but real LDPC Tanner graphs contain cycles, leaving open whether reliable decoding extends beyond trees. This work is directly relevant to quantum algorithms like Regev's reduction and decoded quantum interferometry (DQI), which rely on LDPC decoding over pure-state channels.", "highlights": [ "Proves vanishing ensemble-average block-error probability for random $q$-ary LDPC codes under BPQM", "Establishes double-exponential decay of symbol-error probability for regular ensembles with $d_v\\geq3$", "Extends analysis to finite-support irregular LDPC ensembles and justifies BPQM use in DQI algorithms" ], "keywords": [ { "label": "BPQM", "reason": "The paper's core contribution is a two-stage belief propagation with quantum messages decoder" }, { "label": "LDPC Codes", "reason": "Analysis focuses on random $q$-ary low-density parity-check code ensembles" }, { "label": "Pure-state Channels", "reason": "Decoding is performed over symmetric $q$-ary pure-state classical-quantum channels" }, { "label": "DQI", "reason": "Results justify BPQM's use in decoded quantum interferometry algorithms based on Regev's reduction" } ], "emoji": "📡", "social_summary": "Researchers prove quantum belief propagation decoders achieve vanishing error rates for random LDPC codes with cycles.", "highlights_oneliner": "Provable convergence of quantum decoding for cyclic LDPC codes" }, { "arxiv_id": "2609.06177", "title": "Quantifying Nonstabilizerness of Quantum Codes by Removing the Inert Background", "authors": "Yuan Liu, Ke-Mi Xu", "arxiv_url": "https://arxiv.org/abs/2609.06177", "pdf_url": "https://arxiv.org/pdf/2609.06177", "summary": "The authors resolve the difficulty of quantifying nonstabilizerness (magic) in quantum codes by showing the Clifford sector carries no magic and can be removed via a Clifford transformation, leaving an order-three object whose magic is an exactly evaluable fourth moment. This yields closed-form results for Dicke states, cubic-phase codes, and group multiplication states, reducing computations to finite classical counting problems.", "motivation": "Nonstabilizerness is essential for universal quantum computation beyond stabilizer operations, yet standard measures require summing over exponentially many Pauli operators, and no quantitative theory existed for quantum codes. This work addresses that gap by providing tractable closed-form expressions, enabling identification of maximally magical code families.", "highlights": [ "Reduces a 100-qubit Dicke state magic computation from $4^{100}$ terms to a short binomial sum", "Derives a magic bound for cubic-phase codes saturated only by the $D_4$ code", "Establishes a cyclic/zero criterion for group multiplication states identifying maximally magical codes" ], "keywords": [ { "label": "Nonstabilizerness", "reason": "The paper's central subject is quantifying magic resources in quantum codes" }, { "label": "Dicke States", "reason": "Derives closed-form magic formulas specifically for Dicke state code families" }, { "label": "Topological Order", "reason": "Bounds cubic-phase codes related to twisted quantum doubles and non-Abelian topological order" }, { "label": "Clifford Transformation", "reason": "Uses Clifford removal of the inert background as the key structural technique" } ], "emoji": "✨", "social_summary": "New method strips away Clifford noise to exactly quantify quantum magic in codes, solving a long-standing computational bottleneck.", "highlights_oneliner": "Exact magic quantification via Clifford background removal" }, { "arxiv_id": "2609.07035", "title": "Capability-Gated Conformance Testing of Quantum Error-Correction Decoder Libraries", "authors": "Jiachen Shen, Hui Zhong", "arxiv_url": "https://arxiv.org/abs/2609.07035", "pdf_url": "https://arxiv.org/pdf/2609.07035", "summary": "The authors propose an oracle-free conformance testing framework for QEC decoder libraries that checks whether returned corrections explain the syndrome and whether decoders are consistent under bookkeeping-only presentation changes. Testing nine configurations from five public libraries reveals documentation gaps and presentation sensitivity, with a standalone verifier re-deriving all 639 certificates from first principles.", "motivation": "Fault-tolerant quantum computers rely on decoder libraries whose correctness is typically judged only by logical error rate, leaving feasibility, weight optimality, and presentation robustness unchecked. As decoders become critical infrastructure other results depend on, rigorous conformance testing beyond aggregate error-rate benchmarks is needed to catch silent failures.", "highlights": [ "Documentation answers only 4 of 54 capability questions across tested decoder libraries", "Bounded-distance correctness declarations have a 0.0% direct yield despite holding in 62.1% of cases", "One solver produced a correction 26% heavier under mere relabeling, exposing presentation sensitivity" ], "keywords": [ { "label": "Decoders", "reason": "The paper directly tests and audits quantum error-correction decoder software libraries" }, { "label": "Conformance Testing", "reason": "Introduces an oracle-free testing methodology as the paper's core technical contribution" }, { "label": "Minimum Weight", "reason": "Checks decoder guarantees about minimum-weight correction under different problem presentations" }, { "label": "Benchmarking", "reason": "Evaluates real public decoder libraries against declared capability claims" } ], "emoji": "🔍", "social_summary": "Auditors stress-test quantum decoder libraries and find most correctness claims go undocumented or unverified.", "highlights_oneliner": "Oracle-free audit exposes gaps in QEC decoder guarantees" }, { "arxiv_id": "2609.07537", "title": "Toward Fault-Tolerant Variational Optimization: QAOA under [[4,2,2]] Error Detection", "authors": "Matteo Robert Child, Emanuele Dri, Giacomo Vitali, Chiara Vercellino, Alberto Leporati", "arxiv_url": "https://arxiv.org/abs/2609.07537", "pdf_url": "https://arxiv.org/pdf/2609.07537", "summary": "The authors implement a partially fault-tolerant QAOA for Max-Cut using the $[[4,2,2]]$ error-detection code, introducing a novel ancilla-mediated logical $R_{ZZ}$ gate for inter-block interactions. Evaluation across five noise models and two connectivity topologies shows post-selection on stabilizer measurements consistently improves the probability of sampling optimal bitstrings.", "motivation": "Near-term quantum devices remain highly noise-sensitive, and while full fault tolerance is still distant, error-detection codes offer a practical intermediate strategy to improve variational algorithm performance today. This work extends prior single-block $[[4,2,2]]$ approaches by enabling multi-block interactions necessary for larger problem instances.", "highlights": [ "Introduces a novel ancilla-mediated logical $R_{ZZ}$ gate connecting separate $[[4,2,2]]$ code blocks", "Shows post-selection with five stabilizer measurements gives the strongest fidelity improvement", "Demonstrates consistent gains over unencoded circuits across five distinct noise models and connectivities" ], "keywords": [ { "label": "[[4,2,2]] Code", "reason": "The core error-detection code family used to protect the QAOA circuit" }, { "label": "QAOA", "reason": "Max-Cut is solved using the quantum approximate optimization algorithm as the target application" }, { "label": "Post-selection", "reason": "Stabilizer measurement post-selection is the mechanism used to improve solution quality" }, { "label": "Logical Gates", "reason": "Introduces new ancilla-mediated inter-block logical $R_{ZZ}$ gate construction" } ], "emoji": "🎯", "social_summary": "Researchers boost QAOA optimization results using a lightweight error-detection code and a new cross-block logical gate.", "highlights_oneliner": "Error-detected QAOA improves Max-Cut solution quality" }, { "arxiv_id": "2609.08925", "title": "Resilience Beyond the Light Cone: Error-Detected Primitives for Practical Dynamic Circuits", "authors": "Kevin C. Smith, Bibek Pokharel, Satvik Maurya, Maika Takita", "arxiv_url": "https://arxiv.org/abs/2609.08925", "pdf_url": "https://arxiv.org/pdf/2609.08925", "summary": "The authors present a unifying error-detection framework for dynamic-circuit primitives, including fan-out gates, multi-qubit Pauli rotations, and Dicke/W state preparation, that trades infidelity for postselection overhead without extra ancillas. They validate the approach experimentally on a superconducting processor, achieving error-detected long-range Bell pair preparation across 100 qubits and improved W state fidelities up to 20 qubits.", "motivation": "Dynamic circuits with mid-circuit measurement and feedforward can generate long-range entanglement in constant depth, but the growing number of measurements and feedforward latency introduce errors that undermine this advantage. A general, ancilla-free error-detection scheme is needed to make these constant-depth primitives practically useful on near-term hardware.", "highlights": [ "Achieves error-detected 100-qubit long-range Bell pair with fidelity $F=0.59\\pm0.02$, surpassing the entanglement threshold of $0.5$", "Baseline dynamic-circuit implementation fails the threshold at $F=0.39\\pm0.01$, showing clear error-detection benefit", "Demonstrates constant-depth W state preparation up to 20 qubits with fidelity improvements of $\\Delta F\\approx 0.2$" ], "keywords": [ { "label": "Dynamic Circuits", "reason": "The paper's central subject is mid-circuit-measurement-based dynamic circuit primitives" }, { "label": "Error Detection", "reason": "Introduces an ancilla-free error-detection scheme applicable across multiple primitives" }, { "label": "W States", "reason": "Demonstrates constant-depth W state preparation as a key experimental result" }, { "label": "Superconducting Qubits", "reason": "Experiments are performed on a real superconducting quantum processor" } ], "emoji": "🔗", "social_summary": "Scientists detect errors in fast quantum entangling circuits, achieving reliable 100-qubit long-range entanglement on real hardware.", "highlights_oneliner": "Ancilla-free error detection for constant-depth dynamic circuits" }, { "arxiv_id": "2609.05699", "title": "Generating quantum error correcting codes from topological pre-thermal scars", "authors": "William N. Faugno, Frank Barrows, Terry A. Loring, Nathan Goldman, Alexander Cerjan", "arxiv_url": "https://arxiv.org/abs/2609.05699", "pdf_url": "https://arxiv.org/pdf/2609.05699", "summary": "The authors develop a framework using a many-body spectral localizer to identify quantum many-body scars jointly localized in energy and a diagnostic observable, connecting a topological index to graded subspaces. For suitable pairs of same-graded scars, they derive an approximate Knill-Laflamme condition, constructing an explicit approximate quantum code in a one-dimensional bosonic model along with demonstrations in 2D bosonic models and the PXP model.", "motivation": "Quantum many-body scars are rare nonthermal states that could protect quantum information without relying on spectral gaps or exact symmetries, but no general framework existed to identify such states and certify their error-correcting properties without prior knowledge of the scarring mechanism. This work bridges nonthermal-state discovery with certifiable quantum error correction, broadening the toolkit for finding useful behaviors in interacting many-body systems.", "highlights": [ "Develops a many-body spectral localizer method to discover scars without prior knowledge of the scarring mechanism", "Derives an approximate Knill-Laflamme condition from grading symmetry and scar localization", "Explicitly constructs an approximate quantum code in a 1D bosonic model, validated also in 2D bosonic and PXP models" ], "keywords": [ { "label": "Quantum Scars", "reason": "The paper's central physical objects are quantum many-body scars used for information storage" }, { "label": "Spectral Localizer", "reason": "Introduces the many-body spectral localizer as the key discovery tool" }, { "label": "Knill-Laflamme", "reason": "Derives an approximate Knill-Laflamme error-correction condition from scar structure" }, { "label": "PXP Model", "reason": "Demonstrates the scar-identification framework in the well-known PXP constrained model" } ], "emoji": "🌀", "social_summary": "Physicists turn rare nonthermal quantum scars into approximate error-correcting codes using a new spectral localization method.", "highlights_oneliner": "Approximate codes built from many-body quantum scars" }, { "arxiv_id": "2609.07210", "title": "From NISQ to Fault-Tolerance: Applications and Algorithmic Benchmarks for Spin Qubits", "authors": "Frederik Lohof, Florian Ginzel, Wolfgang Lechner", "arxiv_url": "https://arxiv.org/abs/2609.07210", "pdf_url": "https://arxiv.org/pdf/2609.07210", "summary": "The authors provide a roadmap for implementing quantum algorithms on exchange-only (EO) spin qubit hardware, showing that the Parity Twine compilation method complements EO capabilities for tasks like QFT and QAOA. They introduce a native error detection technique for Parity Twine and analyze fermionic fast Fourier transform and Fermi-Hubbard simulation with detailed resource estimates spanning NISQ to fault-tolerant regimes.", "motivation": "Exchange-only spin qubits have recently achieved major hardware milestones, including an 18-qubit integrated QPU with cryo-CMOS control, but a systematic algorithm-driven roadmap connecting near-term capabilities to fault-tolerant goals has been lacking. Quantitative resource estimates and native error-detection strategies are needed to guide hardware design choices as the platform scales.", "highlights": [ "Shows Parity Twine compilation naturally exploits the EO platform's native $DCX$ gate capability", "Introduces an error detection technique native to Parity Twine that also detects leakage errors with high probability", "Provides detailed resource estimates for QFT, QAOA, fermionic FFT, and Fermi-Hubbard simulation across hardware maturity stages" ], "keywords": [ { "label": "Spin Qubits", "reason": "The paper targets exchange-only spin qubit hardware as its core platform" }, { "label": "Parity Twine", "reason": "Central compilation method analyzed for its synergy with EO qubit hardware" }, { "label": "Error Detection", "reason": "Introduces a native error detection technique bridging NISQ and fault-tolerant regimes" }, { "label": "Fermi-Hubbard", "reason": "Used as a utility-scale simulation benchmark for resource estimation" } ], "emoji": "🧬", "social_summary": "Roadmap shows exchange-only spin qubits paired with Parity Twine compilation can bridge NISQ algorithms to fault tolerance.", "highlights_oneliner": "Algorithm roadmap and error detection for spin qubit hardware" }, { "arxiv_id": "2609.07376", "title": "Cat-Code-Protected Controlled Quantum Communication via Non-Local CNOT Gates over Star Quantum Networks", "authors": "Subham Das, Abhishek Sharma, Kailash S", "arxiv_url": "https://arxiv.org/abs/2609.07376", "pdf_url": "https://arxiv.org/pdf/2609.07376", "summary": "The authors propose a controlled quantum communication protocol over star quantum networks that combines cat-state encoding for error correction with optimal non-local $CNOT$ gates for distributed gate implementation. This design avoids physically transmitting the position qubit through the optical fibre, thereby reducing exposure to amplitude damping. Density-matrix simulations show improved fidelity at $50$ km compared to standard protocols, and a CHSH-based security analysis demonstrates robustness against beam-splitter attacks.", "motivation": "Controlled quantum communication is a key primitive for secure multi-party quantum networking, but photon loss and amplitude damping over optical fibres severely limit fidelity at long distances. Existing decoherence mitigation techniques have not been combined with distributed gate protocols for controlled communication, leaving a gap this work addresses for practical star-network deployment.", "highlights": [ "Cat-code encoding combined with non-local $CNOT$ gates achieves higher fidelity than standard protocols at $50$ km", "Protocol avoids transmitting the position qubit through the fibre, reducing amplitude-damping-induced errors", "CHSH test analysis establishes a critical detection threshold $x_{\\text{crit}}$ for beam-splitter eavesdropping attacks" ], "keywords": [ { "label": "Cat Codes", "reason": "Uses cat-state encoding as the error-correction mechanism to protect quantum states against amplitude damping" }, { "label": "Non-Local Gates", "reason": "Employs optimal non-local $CNOT$ gates to implement distributed quantum operations across network nodes" }, { "label": "Amplitude Damping", "reason": "Addresses fidelity loss caused by amplitude damping noise in optical fibre quantum channels" }, { "label": "CHSH Security", "reason": "Analyzes protocol security against beam-splitter attacks using CHSH inequality violation tests" } ], "emoji": "🐱", "social_summary": "Researchers combine cat-code error correction with non-local CNOT gates to boost secure quantum communication fidelity over 50 km optical networks.", "highlights_oneliner": "Cat codes and non-local CNOTs secure long-distance quantum communication" } ] }, "2026-09-08": { "status": "no_arxiv" }, "2026-09-07": { "word_cloud": [ { "word": "Decoders", "weight": 5 }, { "word": "Surface", "weight": 4 }, { "word": "Neutral", "weight": 3 }, { "word": "Atoms", "weight": 3 }, { "word": "qLDPC", "weight": 4 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Tomography", "weight": 2 }, { "word": "Superconducting", "weight": 3 }, { "word": "Radiation", "weight": 2 }, { "word": "Tiling", "weight": 2 }, { "word": "Annealing", "weight": 3 }, { "word": "Lindblad", "weight": 3 }, { "word": "Tensor", "weight": 2 }, { "word": "Thermal", "weight": 2 }, { "word": "Syndrome", "weight": 3 } ], "social_highlights": "Highlights: sim-to-real decoder rankings falter on Willow hardware, 3D neutral-atom control quadruples qLDPC density, new algorithm learns stabilizer codes via product measurements, TETRIS-Q slashes radiation-induced errors via tiling, star-graph repetition codes show exponential thermal lifetime, and Lindblad multiproduct formulas enable 65-qubit error-mitigated simulations.", "papers": [ { "arxiv_id": "2609.04557", "title": "A Sim-to-Real Study of Surface-Code Decoder Benchmarking", "authors": "Shay J. Manor, Leila S. Erhili, Yassine Jebbouri", "arxiv_url": "https://arxiv.org/abs/2609.04557", "pdf_url": "https://arxiv.org/pdf/2609.04557", "summary": "The paper benchmarks six surface-code decoders against real below-threshold hardware data from the Willow processor, using a four-rung ladder of increasingly realistic noise models across three code distances, two bases, and fifteen round counts. It finds that rank agreement between synthetic noise models and hardware only emerges once each operation type is assigned its own error rate, and that device calibration improves absolute error rates but not decoder ranking. The authors also provide the first independent hardware test of NVIDIA's Ising pre-decoder, finding it offers no accuracy-latency advantage at current code distances.", "motivation": "Decoders for quantum error correction are almost universally validated on synthetic circuit-level noise models rather than real hardware, under the untested assumption that rankings transfer and improve with model fidelity. The public release of below-threshold Willow data offers a rare opportunity to test whether this assumption actually holds, with direct implications for how new decoders should be validated.", "highlights": [ "Rank agreement with hardware only appears once each operation type gets its own error rate in the noise model", "Calibrating noise models to the device improves absolute error but not decoder ranking, even inverting at $d=7$", "NVIDIA's Ising pre-decoder shows no accuracy-latency advantage in 278 of 280 hardware evaluations" ], "keywords": [ { "label": "Decoder Benchmarking", "reason": "Core focus is comparing decoder rankings under different noise models against real hardware" }, { "label": "Surface Code", "reason": "Evaluations are performed on the surface code implemented on the Willow processor" }, { "label": "Noise Models", "reason": "Paper studies a ladder of circuit-level noise models of increasing fidelity" }, { "label": "Neural Decoders", "reason": "Includes independent hardware evaluation of NVIDIA's Ising pre-decoder" } ], "emoji": "🧩", "social_summary": "Tests whether synthetic noise-model decoder rankings actually transfer to Google's Willow hardware, finding they often don't.", "highlights_oneliner": "Sim-to-real gap in surface-code decoder rankings" }, { "arxiv_id": "2609.04459", "title": "Efficient Quantum Error Correction from Three Dimensional Qubit Control", "authors": "Kevin Yipu Wu, Ohik Kwon, Maxwell F. Parsons", "arxiv_url": "https://arxiv.org/abs/2609.04459", "pdf_url": "https://arxiv.org/pdf/2609.04459", "summary": "The authors study the $[[144,12,12]]$ bivariate bicycle qLDPC code on a neutral-atom platform with native three-dimensional geometry, comparing planar and 3D qubit embeddings while keeping the code fixed. The 3D embedding achieves roughly $4\\times$ greater logical-qubit density than the planar layout and $42\\times$ greater than a surface-code baseline, while also halving syndrome-extraction time via fewer atom movements and shorter transport distances.", "motivation": "High-rate qLDPC codes promise large reductions in qubit overhead over surface codes, but realizing their nonlocal stabilizer measurements efficiently on real hardware remains a major obstacle. Neutral-atom arrays with dynamic 3D qubit transport offer a natural way to co-design code structure and hardware geometry to overcome this bottleneck.", "highlights": [ "3D embedding yields $\\sim4\\times$ higher logical-qubit density than planar layout and $42\\times$ over surface-code baseline", "Syndrome extraction time for the bivariate bicycle code reduced by roughly $2\\times$ via 3D atom transport", "Fewer movement operations and shorter atom-transport distances demonstrated for nonlocal qLDPC stabilizer measurements" ], "keywords": [ { "label": "qLDPC", "reason": "Studies the $[[144,12,12]]$ bivariate bicycle qLDPC code overhead advantages" }, { "label": "Neutral Atoms", "reason": "Uses neutral-atom architecture with 3D optical tweezer control" }, { "label": "Syndrome Extraction", "reason": "Focuses on efficiently realizing nonlocal syndrome extraction via atom transport" }, { "label": "Qubit Density", "reason": "Introduces logical-qubit density metric to compare planar vs 3D embeddings" } ], "emoji": "🧊", "social_summary": "Shows native 3D neutral-atom control boosts qLDPC code density fourfold and speeds up syndrome extraction twofold.", "highlights_oneliner": "3D neutral-atom layouts boost qLDPC density" }, { "arxiv_id": "2609.04997", "title": "Learning unknown stabilizer codes using product measurements", "authors": "Heather Leitch, Sowmya Tirukkovalluri, Yingkai Ouyang", "arxiv_url": "https://arxiv.org/abs/2609.04997", "pdf_url": "https://arxiv.org/pdf/2609.04997", "summary": "This work presents an algorithm that learns the stabilizer generators of an unknown stabilizer code purely from $N$ copies of codespace states via random single-qubit measurements, requiring no prior structural knowledge. The authors derive lower bounds on $N$ needed for high-probability recovery and an overall success-probability bound, showing that for qLDPC codes the required number of states scales only polylogarithmically with the number of qubits $n$.", "motivation": "Characterizing and verifying quantum error-correcting codes implemented on real devices is essential for fault tolerance, yet standard quantum state tomography scales exponentially with system size. This paper addresses the practical need to efficiently learn and verify unknown stabilizer codes, especially the sparse qLDPC codes central to near-term fault-tolerant architectures.", "highlights": [ "Algorithm recovers stabilizer generators of any unknown stabilizer code using only random single-qubit measurements", "Derives a lower bound on the number of codespace copies $N$ needed for high-probability recovery", "For qLDPC codes, required sample complexity scales polylogarithmically with qubit number $n$" ], "keywords": [ { "label": "Stabilizer Codes", "reason": "Central object of study is learning unknown stabilizer generators" }, { "label": "qLDPC", "reason": "Application to qLDPC codes shows polylogarithmic scaling in $n$" }, { "label": "Tomography", "reason": "Relates to quantum state tomography limitations and sample complexity" }, { "label": "Verification", "reason": "Method enables verifying a device implements its intended code" } ], "emoji": "🔍", "social_summary": "Introduces an algorithm to learn any unknown stabilizer code's generators using only random single-qubit measurements.", "highlights_oneliner": "Learning stabilizer generators from product measurements" }, { "arxiv_id": "2609.05226", "title": "TETRIS-Q: Tiling-based Effective Transient-fault Reduction on Interleaved Superconducting Qubits", "authors": "Marzio Vallero, Gioele Casagranda, Flavio Vella, Paolo Rech", "arxiv_url": "https://arxiv.org/abs/2609.05226", "pdf_url": "https://arxiv.org/pdf/2609.05226", "summary": "TETRIS-Q combines substrate-level phonon barriers with QEC circuit interleaving via a planar-mesh tiling algorithm to suppress radiation-induced correlated qubit faults, without adding overhead to QEC execution or decoding time. Simulating over 51 million quantum circuits, the authors show peak logical error reductions exceeding $99.8\\%$, an $80\\%$ reduction in transient fault duration, and up to three orders of magnitude average logical error rate reduction when combining barriers with interleaving.", "motivation": "Radiation-induced transient faults cause spatially correlated defects across qubits on the same substrate, threatening to undermine the effectiveness of quantum error correction codes as devices scale. Addressing this cross-layer hardware-software problem is critical since existing QEC schemes largely assume independent errors and do not account for such correlated cosmic-ray-like events.", "highlights": [ "Peak logical error rate reductions of more than $99.8\\%$ across over 51 million simulated quantum circuits", "Permeable phonon barriers reduce observable transient fault duration by $80\\%$", "Combining barriers with QEC interleaving yields up to three orders of magnitude logical error rate reduction" ], "keywords": [ { "label": "Radiation Faults", "reason": "Targets suppression of radiation-induced correlated qubit errors" }, { "label": "Surface Code", "reason": "Uses distance-7 rotated surface codes in simulation study" }, { "label": "Phonon Barriers", "reason": "Substrate-level phonon barriers are a key mitigation mechanism" }, { "label": "Tiling", "reason": "Planar-mesh tiling algorithm partitions the chip substrate for interleaving" } ], "emoji": "🧱", "social_summary": "Combines substrate barriers and code interleaving to slash radiation-induced logical errors in superconducting qubits by orders of magnitude.", "highlights_oneliner": "Tiling barriers suppress radiation-induced QEC faults" }, { "arxiv_id": "2609.04408", "title": "Thermal lifetime of the centralized repetition code: From quantum annealing to social dynamics", "authors": "Ari Mizel, Van Molino", "arxiv_url": "https://arxiv.org/abs/2609.04408", "pdf_url": "https://arxiv.org/pdf/2609.04408", "summary": "The authors use a Lindblad equation framework to analyze the thermal lifetime of the centralized (star-graph) repetition code used in quantum annealing correction, showing it provides robust storage of a logical bit despite each qubit having only one ferromagnetic Ising interaction. They demonstrate that the star-graph configuration confers thermal stability that scales exponentially with the number of physical qubits, unlike a comparable 1-dimensional Ising chain.", "motivation": "Quantum annealing correction was proposed to mitigate noise in adiabatic quantum computation, which lacks a formal fault-tolerance threshold theorem, but the thermal robustness of its centralized repetition code structure had not been rigorously analyzed. Understanding this thermal stability is important both for validating QAC as a practical noise mitigation strategy and for its broader connections to social-dynamics-like star-graph models.", "highlights": [ "Centralized repetition code stores a logical bit for a time scaling exponentially with the number of physical qubits $n$", "Exponential thermal protection holds at all finite temperatures $T<\\infty$", "Star-graph configuration achieves thermal stability despite only one Ising bond per qubit, unlike a 1D Ising chain" ], "keywords": [ { "label": "Repetition Code", "reason": "Analyzes the centralized star-graph repetition code structure" }, { "label": "Quantum Annealing", "reason": "Applies to quantum annealing correction (QAC) hardware context" }, { "label": "Lindblad Equation", "reason": "Uses Lindblad master equation framework to model thermal bath coupling" }, { "label": "Thermal Stability", "reason": "Central result is exponential thermal lifetime scaling with system size" } ], "emoji": "🌡️", "social_summary": "Shows the star-graph repetition code used in quantum annealing correction has thermal lifetime growing exponentially with qubit number.", "highlights_oneliner": "Thermal robustness of star-graph repetition codes" }, { "arxiv_id": "2609.05024", "title": "Lindblad Multiproduct Formulas", "authors": "Niall F. Robertson, Andrea D'Urbano, Anton Dekusar, Max Rossmannek, Eric D. Switzer, James R. Garrison, Nicolas Lorente, Igor Pasichnyk, Paolo D'Alberto, Muhammad Osama, Zachary Streeter, Yasuko Eckert, Constantinos Evangelinos, Sergiy Zhuk", "arxiv_url": "https://arxiv.org/abs/2609.05024", "pdf_url": "https://arxiv.org/pdf/2609.05024", "summary": "The paper introduces Lindblad Multiproduct Formulas (L-MPF), a quantum error mitigation technique combining two-dimensional tensor networks with loop-corrected belief propagation to compute mitigation coefficients that can be cheaper to evaluate than the target expectation values themselves. The method incorporates Clifford rescaling and error-bar estimation, and is demonstrated on a 2D discrete time crystal model implemented on 65 qubits of ibm_basquecountry, with a GPU implementation achieving up to $5.6\\times$ speedup of the classical workflow.", "motivation": "Trotter error and hardware noise limit the fidelity of near-term quantum simulations, and prior multiproduct formula approaches to error mitigation can themselves become computationally expensive at scale. This work builds on tensor-network-enhanced dynamic MPF methods to make error mitigation tractable for larger 2D quantum systems where direct observable calculation is hard.", "highlights": [ "Introduces L-MPF combining 2D tensor networks with loop-corrected belief propagation for error mitigation", "Demonstrated on 65-qubit heavy-hexagonal 2D discrete time crystal experiment on ibm_basquecountry", "GPU implementation of the classical workflow achieves up to $5.6\\times$ speedup" ], "keywords": [ { "label": "Error Mitigation", "reason": "Core contribution is a new quantum error mitigation technique" }, { "label": "Tensor Networks", "reason": "Uses 2D tensor networks with loop-corrected belief propagation for computation" }, { "label": "Multiproduct Formulas", "reason": "Builds on and extends dynamic multiproduct formula methods for Trotter error reduction" }, { "label": "Time Crystals", "reason": "Demonstrated on a two-dimensional discrete time crystal model" } ], "emoji": "🕸️", "social_summary": "Combines tensor networks and belief propagation to mitigate errors in 65-qubit quantum simulations with GPU-accelerated speedups.", "highlights_oneliner": "Tensor-network error mitigation for 65 qubits" } ] }, "2026-09-04": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Trapped-Ions", "weight": 3 }, { "word": "GKP", "weight": 2 }, { "word": "Decoding", "weight": 4 }, { "word": "Bivariate", "weight": 2 }, { "word": "Floquet", "weight": 2 }, { "word": "Fracton", "weight": 2 }, { "word": "Magic", "weight": 4 }, { "word": "Thermalization", "weight": 2 }, { "word": "Distillation", "weight": 2 }, { "word": "Benchmarking", "weight": 2 }, { "word": "Distributed", "weight": 2 }, { "word": "Lattice", "weight": 2 }, { "word": "Thermodynamics", "weight": 2 }, { "word": "Stabilizer", "weight": 3 } ], "social_highlights": "Highlights: chain map hierarchy unifies logical gates on qLDPC codes, quantum lattice codes beat concatenated GKP-surface codes, resource-adaptive distributed fault tolerance with noisy Bell pairs, optimized MPS simulations of magic state distillation, trapped-ion compact fault-tolerant architecture validated, free-energy decoding nears maximum-likelihood, frequency-multiplexed gates enable qLDPC syndrome extraction, fractonic Floquet codes frozen in spacetime, thermodynamic costs of syndrome erasure revealed, thermalization yields optimal approximate codes, new hardware benchmark without classical simulation, geometry of magic states mapped, non-local magic solved via entanglement spectrum.", "papers": [ { "arxiv_id": "2609.02999", "title": "Computing with qLDPC Codes by Climbing the Chain Map Hierarchy", "authors": "Rahul Sahay, David M. Long, Vedika Khemani", "arxiv_url": "https://arxiv.org/abs/2609.02999", "pdf_url": "https://arxiv.org/pdf/2609.02999", "summary": "The authors introduce the chain map hierarchy, a family of chain complexes whose homology classes encode logical unitary and code surgery operations at any level of the Clifford hierarchy, extending the homological description of Pauli logicals to Clifford and non-Clifford gates. This framework enables discovery of constant-depth implementations of the full logical Clifford group on toric codes and addressable $CCZ$ gates on $3D$ toric codes, as well as new gates on general qLDPC codes.", "motivation": "While Pauli logicals of qLDPC codes have a clean homological description, logical Clifford and non-Clifford operations have lacked a comparably systematic framework, hindering the discovery of efficient logical gates. Unifying these operations under one formalism opens a principled route to designing new fault-tolerant gate implementations across code families.", "highlights": [ "Defines a chain map hierarchy generalizing homology to encode logical gates at any Clifford hierarchy level", "Discovers constant-depth unitaries for the full logical Clifford group on toric code blocks, including within a single block", "Finds addressable logical $CCZ$ gates on any triple of logical qubits across $3D$ toric code blocks and non-Clifford gates on general qLDPC codes" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The paper's central object is logical computation using quantum LDPC codes" }, { "label": "Chain Complexes", "reason": "The core mathematical tool is a hierarchy of chain complexes generalizing homological descriptions" }, { "label": "Clifford Hierarchy", "reason": "The framework unifies Pauli, Clifford, and non-Clifford logical operations across hierarchy levels" }, { "label": "Toric Code", "reason": "Key results demonstrate new logical gates on 2D and 3D toric code constructions" } ], "emoji": "🧬", "social_summary": "Introduces a chain map hierarchy unifying Pauli, Clifford, and non-Clifford logical gates on qLDPC codes, revealing new constant-depth implementations.", "highlights_oneliner": "Unified homological framework discovers new logical gates on qLDPC codes" }, { "arxiv_id": "2609.03021", "title": "Quantum low-density lattice codes", "authors": "Timo Hillmann, Jens Eisert, Francesco Arzani", "arxiv_url": "https://arxiv.org/abs/2609.03021", "pdf_url": "https://arxiv.org/pdf/2609.03021", "summary": "The authors co-design GKP bosonic codes with their decoders by lifting classical low-density lattice codes (LDLCs) into quantum GKP-LDLC codes, showing that dimensionality-reduced versions achieve code distances and logical error rates comparable to or better than concatenated GKP-surface codes with similar numbers of modes. They further evaluate fully analog message-passing decoders on concatenated GKP-LDPC codes, finding performance close to state-of-the-art hybrid decoders.", "motivation": "GKP codes are a promising bosonic encoding but native code construction and decoding have remained largely intractable due to computationally hard lattice problems, while concatenated approaches dominate current practice. Co-designing the code with an efficient decoder, as done for classical LDLCs, offers a path toward genuinely native GKP quantum error correction.", "highlights": [ "Reduced GKP-LDLC codes with $n\\sim15$-$25$ modes match or exceed distance of distance-3 to distance-5 concatenated surface-GKP codes", "Logical error probability of a $15$-$17$ mode GKP-LDLC beats a $25$-mode ($5\\times5$) surface code baseline at low noise", "Fully analog, linear-time message-passing decoder for concatenated GKP-LDPC codes performs close to hybrid qubit-analog decoders" ], "keywords": [ { "label": "GKP Codes", "reason": "The paper builds bosonic Gottesman-Kitaev-Preskill codes based on lattices" }, { "label": "LDLC", "reason": "Classical low-density lattice codes are lifted to the quantum setting as the core construction" }, { "label": "Message Passing", "reason": "Analog decoders based on message passing are studied for performance" }, { "label": "Code Distance", "reason": "Comparisons of Euclidean distance and logical error rate against surface-GKP codes are central metrics" } ], "emoji": "🔷", "social_summary": "Builds quantum lattice codes from classical low-density lattice codes, beating concatenated GKP-surface codes with analog decoding.", "highlights_oneliner": "Co-designed GKP lattice codes rival concatenated surface-GKP codes" }, { "arxiv_id": "2609.03048", "title": "Resource-adaptive distributed fault tolerance with very noisy Bell pairs", "authors": "Moritz Schmidt, Martin Moureau, Benjamin Rodatz, Boldizsár Poór, Elie Mounzer, Linnea Grans-Samuelsson", "arxiv_url": "https://arxiv.org/abs/2609.03048", "pdf_url": "https://arxiv.org/pdf/2609.03048", "summary": "The authors extend the fault tolerance by construction framework to distributed architectures where modules interact via noisy shared Bell pairs, deriving strategies including entanglement distillation recovery and more dynamical space-time trade-off protocols. They synthesize resource-adaptive circuits for distributed stabilizer measurements and show integrated decoding halves the required distillation code distance versus separate decoding for the surface and color codes.", "motivation": "Distributed quantum computing architectures require fault-tolerant primitives that tolerate interconnect noise far exceeding on-chip gate noise, a regime not addressed by standard fault-tolerance theory. Efficient distributed stabilizer measurement and lattice surgery protocols are essential building blocks for scaling modular quantum computers.", "highlights": [ "Integrated decoding halves the required distillation code distance compared to separate decoding, reducing needed Bell pairs", "Synthesizes resource-adaptive circuits for distributed stabilizer measurements tunable to Bell-pair generation rate or on-chip qubit budget", "Context-aware optimization exploiting hook and readout error robustness further reduces Bell pair counts for surface and color code memories and lattice surgery" ], "keywords": [ { "label": "Distributed QEC", "reason": "The paper's focus is fault tolerance across separated quantum modules" }, { "label": "Bell Pairs", "reason": "Noisy shared entanglement resources are the key interconnect primitive studied" }, { "label": "Entanglement Distillation", "reason": "Distillation protocols are derived and optimized within the fault tolerance framework" }, { "label": "Lattice Surgery", "reason": "Distributed stabilizer measurements are applied to surface and color code lattice surgery" } ], "emoji": "🔗", "social_summary": "Designs resource-adaptive fault-tolerant protocols for distributed quantum computers using very noisy shared Bell pairs.", "highlights_oneliner": "Fault tolerance protocols for modular quantum computers with noisy links" }, { "arxiv_id": "2609.03073", "title": "Optimized Matrix-Product State Simulations of Quantum Error Correction Circuits", "authors": "Asier Piñeiro Orioli, Chen Zhao, Guido Masella, Tommaso Macrì, Hengyun Zhou, Shannon Whitlock", "arxiv_url": "https://arxiv.org/abs/2609.03073", "pdf_url": "https://arxiv.org/pdf/2609.03073", "summary": "The authors demonstrate that matrix product state (MPS) methods, with targeted circuit-level optimizations, can exactly simulate QEC circuits including non-Clifford gates at scales previously inaccessible, reducing bond dimensions and runtime by orders of magnitude. They benchmark examples including a distance-$11$ rotated surface code memory, distance-$9$ logical Bell-state preparation, and a $15$-to-$1$ magic-state distillation circuit simulated with $187$ physical qubits in under $40$ seconds.", "motivation": "Simulating QEC circuits with realistic non-Clifford operations like magic state distillation is essential for validating fault-tolerant protocols, but standard Clifford simulators cannot handle non-Clifford gates and stabilizer-rank methods are limited by magic content. Tensor network methods like MPS offer a complementary route without restrictions on gate types, motivating systematic optimization of their implementation.", "highlights": [ "Circuit-level optimizations reduce MPS bond dimension and simulation time by several orders of magnitude versus naive implementations", "Simulates a $15$-to-$1$ magic-state distillation circuit with hundreds of QEC rounds using only $11$ logical qubits and bond dimension $64$ in under $40$ seconds", "Demonstrates exact simulation of distance-$11$ rotated surface code memories and distance-$9$ logical Bell-state preparation" ], "keywords": [ { "label": "MPS", "reason": "Matrix product state tensor network methods are the core simulation technique" }, { "label": "Magic States", "reason": "Magic state distillation circuits are a key non-Clifford benchmark" }, { "label": "Surface Code", "reason": "Rotated surface code memories are simulated as a primary example" }, { "label": "Non-Clifford Gates", "reason": "The paper targets simulation of circuits beyond stabilizer formalism restrictions" } ], "emoji": "🧮", "social_summary": "Optimized matrix product state techniques simulate large non-Clifford QEC circuits like magic state distillation with modest computing resources.", "highlights_oneliner": "Optimized MPS simulations tackle non-Clifford QEC circuits at scale" }, { "arxiv_id": "2609.03194", "title": "Experimental validation of a compact fault-tolerant architecture for trapped ions", "authors": "Noah Berthusen, Ali Lavasani, Asmae Benhemou, M. S. Allman, Joan Dreiling, Brian Estey, Cameron Foltz, Trent Jacobs, Michael Mills, Annie Jihyun Park, Adam P. Reed, David Hayes, Tzvetan S. Metodi, Andrew C. Potter", "arxiv_url": "https://arxiv.org/abs/2609.03194", "pdf_url": "https://arxiv.org/pdf/2609.03194", "summary": "The authors experimentally validate a fault-tolerant architecture based on the $[[20,2,6]]$ $C_4$-Helix code on Quantinuum's Helios 98-qubit trapped-ion processor, demonstrating repeated QEC with per-cycle logical error $4.6\\times10^{-5}$, full logical Clifford group benchmarking at $2.8\\times10^{-4}$ per two-qubit gate, and a fault-tolerant chain-map interface to a distance-5 surface code producing a heterogeneous three-logical-qubit GHZ state with fidelity above $99.9\\%$. All demonstrations outperform unencoded physical baselines without postselection.", "motivation": "Useful fault-tolerant quantum computation requires more than low-error logical memory; it demands efficient logical encoding, low-overhead operations, and non-Clifford resources working together in an integrated architecture. This work moves beyond bare quantum memory demonstrations to hardware-validate a complete early fault-tolerant computing architecture.", "highlights": [ "Achieves per-cycle logical error of $4.6^{+6.2}_{-2.6}\\times10^{-5}$ using the $[[20,2,6]]$ $C_4$-Helix code on a 98-qubit trapped-ion processor", "Benchmarks the complete two-qubit logical Clifford group under active error correction at $2.8^{+1.0}_{-1.6}\\times10^{-4}$ error per gate", "Demonstrates a fault-tolerant chain-map interface to a distance-5 surface code producing a three-logical-qubit GHZ state with fidelity above $99.9\\%$ without postselection" ], "keywords": [ { "label": "Trapped Ions", "reason": "Experiments are performed on Quantinuum's Helios trapped-ion quantum processor" }, { "label": "C4-Helix Code", "reason": "The $[[20,2,6]]$ C4-Helix code is the central error-correcting code demonstrated" }, { "label": "Logical Clifford", "reason": "Full logical Clifford group benchmarking under active error correction is a key result" }, { "label": "Code Interfacing", "reason": "A chain-map interface links the Helix code with a surface code for a heterogeneous GHZ state" } ], "emoji": "⚛️", "social_summary": "Trapped-ion experiments validate a compact fault-tolerant architecture beating unencoded baselines in memory, gates, and code interfacing.", "highlights_oneliner": "Hardware-validated compact fault-tolerant architecture on trapped ions" }, { "arxiv_id": "2609.03928", "title": "Approximate maximum-likelihood decoding via truncated free energies", "authors": "Yuanqi Liu, Weilei Zeng, Junjie Wu, Lingling Lao", "arxiv_url": "https://arxiv.org/abs/2609.03928", "pdf_url": "https://arxiv.org/pdf/2609.03928", "summary": "The authors introduce approximate maximum-likelihood decoding (AMLD), a black-box framework that recycles discarded candidate samples from stochastic minimum-weight decoders into a per-class truncated free-energy estimator provably bounded between the exact free energy and the empirical minimum weight. AMLD closes up to $83\\%$ of the minimum-weight-to-maximum-likelihood threshold gap on toric and color codes and reduces logical error rate by $13\\%$ on the $[[144,12,12]]$ bivariate-bicycle code relative to minimum-weight decoding.", "motivation": "Maximum-likelihood decoding is information-theoretically optimal but exact evaluation is #P-hard, so practical decoders approximate it via minimum-weight decoding which discards coset degeneracy and leaves a threshold gap. Recovering some of this lost performance cheaply, without matching-based enumeration or code-specific tensor-network contraction, is valuable for improving decoders across diverse code families.", "highlights": [ "Closes up to $83\\%$ of the minimum-weight-decoding to maximum-likelihood threshold gap on toric and color codes", "Improves the $6.6.6$ color code depolarizing threshold from $17.28\\%$ to $18.62\\%$", "Reduces logical error rate by $13\\%$ on the $[[144,12,12]]$ bivariate-bicycle code at $p=0.05$ versus minimum-weight decoding" ], "keywords": [ { "label": "MLD", "reason": "Approximating maximum-likelihood decoding is the paper's central goal" }, { "label": "Free Energy", "reason": "The estimator is based on a truncated free-energy calculation over candidate errors" }, { "label": "Bivariate Bicycle", "reason": "The method is demonstrated on the $[[144,12,12]]$ bivariate-bicycle qLDPC code" }, { "label": "BP-OSD", "reason": "Belief propagation with ordered statistics decoding candidate pools are reused for the estimator" } ], "emoji": "📊", "social_summary": "Recycles discarded decoder candidates into a free-energy estimator that closes much of the gap to optimal maximum-likelihood decoding.", "highlights_oneliner": "Black-box free-energy trick nearly matches optimal decoding thresholds" }, { "arxiv_id": "2609.04081", "title": "Frequency-Multiplexed Parallel Gates for Quantum LDPC Codes in a Two-Dimensional Ion Crystal", "authors": "G. -X. Tang, L. -M. Duan, Y. -K. Wu", "arxiv_url": "https://arxiv.org/abs/2609.04081", "pdf_url": "https://arxiv.org/pdf/2609.04081", "summary": "The authors propose achieving parallel nonlocal entangling gates for qLDPC syndrome measurement on a 2D ion crystal via frequency-multiplexing rather than physical qubit movement, using adiabatic conditions to suppress gate infidelity, crosstalk, and sensitivity to trap frequency drift. Numerical study of a $[[248,10,18]]$ bivariate bicycle code on 512 ions shows moderate laser power suffices for parallelism and a logical error rate of $10^{-12}$ is achievable under realistic noise.", "motivation": "qLDPC codes offer high encoding rates but require nonlocal entangling gates that become slow to implement via physical qubit shuttling as qubit number grows. Frequency-multiplexed gates on 2D ion crystals could remove this scaling bottleneck, making qLDPC codes practical on trapped-ion hardware.", "highlights": [ "Achieves parallel nonlocal entangling gates on a 2D ion crystal via frequency multiplexing instead of physical qubit transport", "Demonstrates robustness against slow trap frequency drift, a leading ion-trap error source, through adiabatic gate design", "Numerically shows logical error rate of $10^{-12}$ for a $[[248,10,18]]$ bivariate bicycle code on 512 ions with moderate laser power" ], "keywords": [ { "label": "Trapped Ions", "reason": "The proposal targets a 2D ion crystal quantum computing platform" }, { "label": "qLDPC Codes", "reason": "Bivariate bicycle qLDPC codes require nonlocal gates addressed by this scheme" }, { "label": "Frequency Multiplexing", "reason": "Parallel gates are enabled by frequency-multiplexed addressing rather than qubit shuttling" }, { "label": "Bivariate Bicycle", "reason": "The $[[248,10,18]]$ bivariate bicycle code is the numerical example studied" } ], "emoji": "🎛️", "social_summary": "Proposes frequency-multiplexed parallel gates on 2D ion crystals to enable efficient qLDPC syndrome measurement without moving qubits.", "highlights_oneliner": "Frequency multiplexing enables parallel qLDPC gates on ion crystals" }, { "arxiv_id": "2609.03703", "title": "Fractalizing spacetime: Floquet codes with fractonic excitations that are immobile in space and time", "authors": "Juliette Soule, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2609.03703", "pdf_url": "https://arxiv.org/pdf/2609.03703", "summary": "The authors generalize fractalization from space to spacetime to construct fracton Floquet codes with syndrome excitations of limited mobility in both space and time, extending fracton order to intrinsically dynamical quantum phases distinct from static fracton phases. These spacetime type-II fracton Floquet codes exhibit an extreme quantum discrete time crystal order with response periods scaling exponentially in linear system size, and a no-strings rule leading to superlinear scaling of fault distance with time.", "motivation": "Fracton order and static fracton codes have been studied extensively in space, but extending these exotic topological phases into the time dimension remains largely unexplored despite its potential relevance to fault-tolerant quantum memory. Understanding spacetime fracton phases could reveal new discrete time crystal phenomena and reduce time overhead in quantum error correction.", "highlights": [ "Extends fractalization construction from space to spacetime, applied to the 3D RBH cluster state", "Constructs spacetime type-II fracton Floquet codes with no topological excitations mobile in space or time", "Response periods scale exponentially in linear system size, yielding an extreme discrete time crystal and superlinear fault-distance scaling with time" ], "keywords": [ { "label": "Fracton Order", "reason": "The paper extends fracton topological order from spatial to spacetime settings" }, { "label": "Floquet Codes", "reason": "Dynamical Floquet quantum error-correcting codes are the code family constructed" }, { "label": "Time Crystals", "reason": "The construction exhibits extreme discrete time crystal order with exponential response periods" }, { "label": "Fault Distance", "reason": "Superlinear scaling of fault distance with time affects QEC time overhead" } ], "emoji": "🧊", "social_summary": "Extends fracton order into spacetime to build Floquet codes with excitations frozen in both space and time.", "highlights_oneliner": "Spacetime fracton Floquet codes yield exponential time crystal order" }, { "arxiv_id": "2609.03825", "title": "Energetic Costs of Subspace Quantum Error Correction", "authors": "Jakub Czartowski, Felix C. Binder", "arxiv_url": "https://arxiv.org/abs/2609.03825", "pdf_url": "https://arxiv.org/pdf/2609.03825", "summary": "This work derives the thermodynamic cost of maintaining a reusable syndrome memory in subspace quantum error-correcting codes, starting from the Knill-Laflamme conditions. It constructs an effective syndrome density matrix whose von Neumann entropy lower-bounds the ideal erasure work, and quantifies the additional entropy generated by projective readout via measurement inefficiency. The framework is applied to stabilizer codes under local Pauli noise, revealing how error-label degeneracy and check weight reduce syndrome-memory costs for codes such as the five-qubit, Steane, generalized Shor, and rotated surface codes.", "motivation": "Quantum error correction is often analyzed purely in terms of logical fidelity, but any repeated syndrome extraction requires erasing accumulated entropy, which incurs an unavoidable energetic cost analogous to Landauer's principle. Understanding this cost hierarchy is essential for assessing the true resource overhead of fault-tolerant quantum computing architectures.", "highlights": [ "Derives a von Neumann entropy lower bound on the ideal work needed to erase syndrome memory from the Knill-Laflamme framework", "Shows that error-label degeneracy and low-weight parity checks reduce the leading-order entropy cost of syndrome extraction", "Quantifies measurement-induced inefficiency by modeling noisy syndrome readout as a binary symmetric channel, separating useful from useless entropy" ], "keywords": [ { "label": "Syndrome Extraction", "reason": "The paper focuses on the entropy generated by syndrome measurement and its erasure cost" }, { "label": "Stabilizer Codes", "reason": "Analysis specializes to stabilizer codes under independent local Pauli noise" }, { "label": "Thermodynamics", "reason": "The central quantity studied is the Landauer-type work cost of quantum error correction" }, { "label": "Knill-Laflamme", "reason": "The derivation is grounded in the Knill-Laflamme conditions for correctable codes" } ], "emoji": "🔥", "social_summary": "Reveals the hidden thermodynamic price of erasing syndrome memory in quantum error correction, linking code structure to energy cost.", "highlights_oneliner": "Thermodynamic cost of syndrome memory in QEC" }, { "arxiv_id": "2609.04121", "title": "Quantum thermalization achieves optimal approximate quantum error correction", "authors": "Aditi Venkatesh, Richard R. Allen, Saúl Pilatowsky-Cameo, Bingtian Ye, Soonwon Choi", "arxiv_url": "https://arxiv.org/abs/2609.04121", "pdf_url": "https://arxiv.org/pdf/2609.04121", "summary": "This work connects quantum thermalization to approximate quantum error correction by treating typical late-time states of thermalizing many-body dynamics as codewords. The authors numerically find a universal relationship between encoding rate, code distance, and thermal entropy density, and prove that a new finite-temperature code family based on the Scrooge ensemble saturates the entropic quantum Singleton bound.", "motivation": "Quantum thermalization hides information about initial conditions from local observers, a mechanism strikingly similar to how quantum codes protect information via nonlocal encoding. Establishing this connection rigorously provides new insight into fundamental limits of both thermalization and error correction, and yields new optimal approximate codes.", "highlights": [ "Uncovers a universal curve relating encoding rate, distance, and thermal entropy density that saturates the quantum Singleton bound at infinite temperature", "Introduces a Scrooge-ensemble based code family proven optimal within entropic constraints at finite temperature", "Shows conserved quantities such as energy limit correctability, with codewords leaking only classical information until differences reach thermal fluctuation scale" ], "keywords": [ { "label": "Thermalization", "reason": "The paper's core mechanism is quantum many-body thermalization producing codeword-like states" }, { "label": "Approximate QEC", "reason": "The framework treats late-time thermal states as approximate quantum error-correcting codewords" }, { "label": "Singleton Bound", "reason": "The paper shows saturation of the entropic quantum Singleton bound by thermalizing dynamics" }, { "label": "Scrooge Ensemble", "reason": "A new optimal code family is built from the Scrooge ensemble, the thermal analogue of Haar-random states" } ], "emoji": "🌡️", "social_summary": "Shows that quantum thermalization naturally builds optimal approximate error-correcting codes, matching the best known coding bounds.", "highlights_oneliner": "Thermalization as optimal approximate quantum coding" }, { "arxiv_id": "2609.04132", "title": "Characterizing Large Scale Quantum Systems with Error Per Circuit Layer", "authors": "Travis Hurant, Arian Vezvaee, Swarnadeep Majumder, Aniket Dalvi, Jude Alnas, Kenneth R. Brown", "arxiv_url": "https://arxiv.org/abs/2609.04132", "pdf_url": "https://arxiv.org/pdf/2609.04132", "summary": "The authors introduce Error Per Circuit Layer (EPCL), an overlap-based circuit-level benchmark that applies identical random circuits to two disjoint registers and measures output overlap decay as a function of depth. EPCL avoids classical simulation of ideal outputs and works with arbitrary gate sets, and the authors validate it theoretically under depolarizing noise and experimentally on 8- and 16-qubit IBM hardware.", "motivation": "Existing circuit-level benchmarks like mirror randomized benchmarking or cross-entropy benchmarking require structured gate sets or costly classical simulation, limiting their scalability to large or modular quantum systems. A benchmark that scales without these constraints is crucial for evaluating aggregate performance in future error-corrected and modular architectures.", "highlights": [ "Introduces EPCL, an overlap-based benchmark requiring no classical simulation of ideal circuit outputs", "Derives expected overlap decay under an ensemble-averaged depolarizing model, establishing when the fit yields an effective layer polarization", "Demonstrates clear EPCL decay experimentally on 8- and 16-qubit IBM quantum hardware, including with non-Clifford gates" ], "keywords": [ { "label": "Benchmarking", "reason": "The paper's central contribution is a new circuit-level quantum benchmarking protocol" }, { "label": "Depolarizing Noise", "reason": "Theoretical predictions are derived under an ensemble-averaged depolarizing noise model" }, { "label": "Randomized Compiling", "reason": "Discusses need for Pauli twirling or randomized compiling to counter coherent errors" }, { "label": "Scalability", "reason": "EPCL is designed to scale to large registers without classical simulation overhead" } ], "emoji": "📏", "social_summary": "Introduces a new overlap-based benchmark that measures large quantum system performance without classical simulation, tested on real IBM hardware.", "highlights_oneliner": "Scalable overlap-based circuit benchmark for quantum hardware" }, { "arxiv_id": "2609.03944", "title": "On the geometry and typicality of quantum magic", "authors": "Zhenhuan Liu, Z-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2609.03944", "pdf_url": "https://arxiv.org/pdf/2609.03944", "summary": "This paper proves that all $n$-qubit states with purity below a threshold $1/(d-a_\\ast)$, $a_\\ast=0.458327\\cdots$, lie within the stabilizer polytope and are thus magic-free, then uses this to bound the inradius and volume of the stabilizer polytope. These bounds establish a sharp phase transition dimension $k_\\star$ for magic in random induced states and show the polytope requires a doubly exponential number of facets to describe exactly.", "motivation": "Quantum magic underlies the classical hardness of simulating quantum circuits and is essential for universal fault-tolerant computation, yet the geometry of the stabilizer polytope defining magic-free states remains poorly understood due to combinatorial complexity. Sharpening geometric bounds clarifies both when magic typically appears in random states and the intrinsic complexity of stabilizer-based resource theories.", "highlights": [ "Proves a purity threshold $\\operatorname{Tr}(\\rho^2)\\le 1/(d-a_\\ast)$ guaranteeing states are magic-free", "Establishes a sharp phase transition in random induced states' magic with transition dimension $k_\\star$ between $\\Omega(d^2/\\log^2 d)$ and $\\mathcal{O}(d^2)$", "Shows the stabilizer polytope requires between $\\exp[\\Omega(d^2/\\log^2 d)]$ and $\\exp[\\mathcal{O}(d^2\\log^2 d)]$ facets, improving prior lower bounds" ], "keywords": [ { "label": "Stabilizer Polytope", "reason": "The paper's main object of study is the geometry of the stabilizer polytope" }, { "label": "Magic States", "reason": "The work quantifies typicality and detection of quantum magic in random states" }, { "label": "Random States", "reason": "Analysis uses Haar-random induced states to study a phase transition in magic" }, { "label": "Convex Geometry", "reason": "Techniques rely on high-dimensional polytope geometry, inradius, and volume estimates" } ], "emoji": "🔷", "social_summary": "Maps the geometry of magic-free quantum states, proving a sharp threshold for when random states become magical.", "highlights_oneliner": "Sharp geometric bounds on the stabilizer polytope" }, { "arxiv_id": "2609.04119", "title": "Non-local Magic: closed-form solution and equivalence with magic of purification", "authors": "Michele Viscardi, Lorenzo Leone, Alioscia Hamma", "arxiv_url": "https://arxiv.org/abs/2609.04119", "pdf_url": "https://arxiv.org/pdf/2609.04119", "summary": "This paper derives an exact closed-form solution for non-local magic under the log-stabilizer fidelity, depending only on the Schmidt spectrum, resolving what was previously a difficult local-unitary optimization. It also introduces the magic of purification, showing it induces a resource theory with stabilizer-code projectors as free states, and proves non-local magic equals the minimum magic of purification along the unitary orbit of the reduced state.", "motivation": "Magic and entanglement capture distinct nonclassical resources, and understanding the intrinsically nonlocal component of magic that cannot be removed by local operations connects these two theories, but prior evaluation required intractable optimization over local unitaries. Finding a closed-form solution and a mixed-state resource-theoretic interpretation deepens understanding of magic's role in many-body complexity and non-stabilizer resource theory.", "highlights": [ "Obtains exact closed-form solution for the log-stabilizer fidelity optimization over local unitaries, depending only on the Schmidt spectrum", "Introduces magic of purification and shows it defines a resource theory with normalized stabilizer-code projectors as free states", "Proves non-local magic equals the minimum magic of purification along the unitary orbit of the reduced density operator" ], "keywords": [ { "label": "Non-stabilizerness", "reason": "The paper studies magic, i.e. non-stabilizerness, as a quantum resource" }, { "label": "Entanglement Spectrum", "reason": "The closed-form solution depends only on the Schmidt spectrum of the bipartite state" }, { "label": "Resource Theory", "reason": "Introduces magic of purification defining a new resource theory with stabilizer-code free states" }, { "label": "Stabilizer Fidelity", "reason": "The log-stabilizer fidelity is the specific magic monotone solved in closed form" } ], "emoji": "✨", "social_summary": "Solves non-local magic exactly using the entanglement spectrum and links it to a new resource theory of purification.", "highlights_oneliner": "Exact solution for non-local quantum magic" } ] }, "2026-09-03": { "word_cloud": [ { "word": "Photonic", "weight": 5 }, { "word": "Fusion", "weight": 4 }, { "word": "Graph", "weight": 4 }, { "word": "Purification", "weight": 3 }, { "word": "Transversal", "weight": 3 }, { "word": "Distillation", "weight": 3 }, { "word": "Spin", "weight": 3 }, { "word": "Shuttling", "weight": 2 }, { "word": "Loss", "weight": 4 }, { "word": "RHG", "weight": 3 }, { "word": "Distributed", "weight": 3 }, { "word": "Sensing", "weight": 2 }, { "word": "Mitigation", "weight": 3 }, { "word": "Clustering", "weight": 2 }, { "word": "Tensor", "weight": 2 }, { "word": "Entanglement", "weight": 3 } ], "social_highlights": "Highlights: RHG outperforms foliated color codes under photon loss, spin-qubit shuttling bus enables transversal gates and magic state distillation, NOBOL cuts entanglement overhead for logical CNOTs, optimal fusion strategies characterized for photonic codes, new purification schemes boost photonic graph state fidelity, entanglement-assisted codes enable distributed phase sensing, dominance-aware clustering improves sample-level error mitigation, belief propagation extended to DMRG for higher-dimensional lattices.", "papers": [ { "arxiv_id": "2609.02428", "title": "Circuit-Level Loss Performance of FFCC and RHG Codes in a Compound Photon-Atom Quantum Architecture", "authors": "Dana Ben Porath, Juval Bechar, Daniel Azses, Yaron Jarach", "arxiv_url": "https://arxiv.org/abs/2609.02428", "pdf_url": "https://arxiv.org/pdf/2609.02428", "summary": "The paper compares the RHG code, the Foliated Floquet Color Code (FFCC), and a reduced FFCC variant within a compound photon-atom architecture that natively generates MBQC resource states via near-deterministic photon-atom $CZ$ gates. Using an architecture-aware circuit-level loss model with delayed heralding and correlated bond-loss propagation, the authors find RHG achieves the highest circuit-level threshold of $2.75\\%$ and generally the lowest logical error rate, though reduced FFCC wins in some low-loss regimes.", "motivation": "Photonic MBQC architectures promise higher error thresholds under loss-dominated noise than circuit-based approaches, but the benefit of reduced-degree foliated codes versus standard RHG cluster states in realistic hardware has been unclear. This work directly benchmarks these code families under a hardware-aware loss model relevant to emerging compound photon-atom quantum computing platforms.", "highlights": [ "RHG code achieves the highest circuit-level threshold at $2.75\\%$ loss", "RHG's threshold advantage disappears only under large excess loss on intermodule $CZ$ connections", "Reduced FFCC outperforms RHG in select low-loss, resource-matched regimes" ], "keywords": [ { "label": "RHG Code", "reason": "One of the two main topological code families benchmarked in the paper" }, { "label": "Foliated Codes", "reason": "FFCC and its reduced variant are foliated Floquet color codes central to the comparison" }, { "label": "Photon-Atom Architecture", "reason": "The compound hardware platform combining photonic and atomic qubits underlies the loss model" }, { "label": "Loss Thresholds", "reason": "Circuit-level thresholds under photon loss are the key performance metric evaluated" } ], "emoji": "💡", "social_summary": "Compares RHG and foliated color codes in a photon-atom quantum computer, finding RHG generally wins under realistic circuit-level photon loss.", "highlights_oneliner": "RHG vs FFCC codes under realistic photon loss" }, { "arxiv_id": "2609.02641", "title": "Transversal Gates and Magic State Distillation in an Optimally Synthesized Spin-Qubit Shuttling Bus", "authors": "Pau Escofet, Andrii Semenov, Niall Murphy, Elena Blokhina, Carmen G. Almudéver, Sergi Abadal, Eduard Alarcón", "arxiv_url": "https://arxiv.org/abs/2609.02641", "pdf_url": "https://arxiv.org/pdf/2609.02641", "summary": "The authors propose a multi-qubit spin-qubit shuttling bus architecture that co-designs syndrome extraction and transversal two-qubit logical gates, achieving all-to-all logical connectivity via coherent spin shuttling. They introduce an ancilla-sharing scheme and a 2D grid extension that reduce inter-qubit distance from $O(N)$ to $O(\\sqrt{N})$, and apply Quantum Reverse Mapping to optimize a 15-to-1 magic state distillation circuit layout.", "motivation": "Fault-tolerant quantum computing needs not just reliable logical memory but efficient logical gates between error-corrected qubits at scale, yet most prior work optimizes syndrome extraction in isolation. This paper bridges physical, error-correction, and logical layers for spin-qubit shuttling platforms, a promising scalable qubit modality.", "highlights": [ "Symmetric shuttling reduces transversal $CNOT$ logical error rate by up to $60\\%$ versus asymmetric shuttling", "Ancilla sharing compresses physical footprint and improves long-range gate fidelity", "2D grid of shuttling tracks cuts worst-case inter-qubit distance from $O(N)$ to $O(\\sqrt{N})$ logical hops" ], "keywords": [ { "label": "Spin Qubits", "reason": "The paper's architecture is built on spin-qubit shuttling hardware" }, { "label": "Transversal Gates", "reason": "Central mechanism enabling logical two-qubit operations across the bus" }, { "label": "Magic States", "reason": "15-to-1 magic state distillation circuit is optimized using the architecture" }, { "label": "Co-design", "reason": "The paper's core contribution is jointly optimizing physical layout, QEC, and logical computation" } ], "emoji": "🚌", "social_summary": "Designs a spin-qubit shuttling bus enabling transversal logical gates and optimized magic state distillation for fault-tolerant quantum computing.", "highlights_oneliner": "Shuttling bus architecture for transversal logic and magic states" }, { "arxiv_id": "2609.01901", "title": "Need One Bell-pair Only (NOBOL) for Low-Overhead Fault-Tolerant Quantum Computing", "authors": "Sean Grzenda, Shahram Babaie, Chunming Qiao", "arxiv_url": "https://arxiv.org/abs/2609.01901", "pdf_url": "https://arxiv.org/pdf/2609.01901", "summary": "NOBOL is a novel protocol enabling logical $CNOT$ operations between distant logical qubits encoded in arbitrary CSS codes using only a single Bell pair, operating solely on the logical $X$ or $Z$ operator subsets rather than the full code block. The authors present multiple circuit realizations, including a depth-optimal logarithmic-depth construction, along with error containment strategies for practical fault-tolerant implementation.", "motivation": "Existing approaches to long-distance logical gates require linear overhead in SWAP operations for monolithic architectures or linear ancilla resources for distributed entanglement generation, both scaling poorly as systems grow. NOBOL addresses this bottleneck by drastically cutting entanglement resource requirements while remaining agnostic to code choice, qubit modality, and architecture type.", "highlights": [ "Logical $CNOT$ between distant qubits achieved using only one Bell pair", "Depth-optimal circuit realization scales logarithmically with logical operator size", "Approach generalizes across arbitrary CSS codes including surface codes and both monolithic and distributed QPU architectures" ], "keywords": [ { "label": "CSS Codes", "reason": "NOBOL is designed to be code-agnostic and applicable to arbitrary CSS codes" }, { "label": "Distributed QC", "reason": "The method targets logical gates across distributed quantum processing units" }, { "label": "Logical CNOT", "reason": "The core primitive optimized by the NOBOL protocol" }, { "label": "Resource Overhead", "reason": "Reducing entanglement and ancilla overhead is the paper's central goal" } ], "emoji": "🔗", "social_summary": "Introduces NOBOL, a protocol enabling logical CNOT gates on distant qubits using just one Bell pair instead of linear ancilla overhead.", "highlights_oneliner": "Logical CNOT with only one entangled pair" }, { "arxiv_id": "2609.02559", "title": "Optimal Fusion Strategies for Quantum Computation", "authors": "Kenneth Goodenough, Andrew Landahl, Joon Lee, Antonio Russo, Kevin Thompson", "arxiv_url": "https://arxiv.org/abs/2609.02559", "pdf_url": "https://arxiv.org/pdf/2609.02559", "summary": "This work fully characterizes fusion strategies for $k=1$ encoded qubits, identifying 'perfect fusion strategies' where all but one physical fusion can fail without causing logical failure. The authors find perfect fusion strategies for quantum parity-check codes, prove that random $[[n,1,d]]$ graph codes admit such strategies with probability exponentially close to $1$, and introduce a new graph parameter connected to maximum LC-equivalent vertex degree.", "motivation": "Fusion-based quantum computation relies on probabilistic photonic fusion operations whose failures can propagate to logical-level errors, making the choice of fusion strategy critical for performance. This paper resolves open questions about which codes admit robust, near-lossless fusion strategies, generalizing and extending known constructions.", "highlights": [ "Complete characterization of perfect fusion strategies for $k=1$ encoded codes", "Perfect fusion strategies found for quantum parity-check codes, resolving an open problem", "Random $[[n,1,d]]$ graph codes admit perfect fusion strategies with probability exponentially close to $1$" ], "keywords": [ { "label": "Fusion-Based QC", "reason": "The paper's central topic is optimizing fusion operations for photonic fusion-based quantum computation" }, { "label": "Graph Codes", "reason": "Random and structured graph codes are analyzed for their fusion robustness" }, { "label": "Stabilizer Codes", "reason": "Analysis relies on stabilizer measurement theory to characterize fusion outcomes" }, { "label": "Parity-Check Codes", "reason": "Quantum parity-check codes are shown to admit perfect fusion strategies" } ], "emoji": "🧩", "social_summary": "Characterizes perfect fusion strategies for photonic quantum codes, showing random graph codes almost always admit near-lossless fusion.", "highlights_oneliner": "Perfect fusion strategies for fusion-based quantum computing" }, { "arxiv_id": "2609.01710", "title": "Purification of photonic graph states", "authors": "Matthias C. Löbl, Aliki A. Capatos, Ming Lai Chan, Peter Lodahl, Anders Søndberg Sørensen, Stefano Paesani", "arxiv_url": "https://arxiv.org/abs/2609.01710", "pdf_url": "https://arxiv.org/pdf/2609.01710", "summary": "The authors develop purification schemes for photonic GHZ states, CSS states, and general graph/stabilizer states, achieving success probabilities up to $1/2$ using only linear optics and photon detectors rather than deterministic entangling gates. Cascaded purification protocols are optimized for various graph states under phenomenological Pauli errors and physical noise models relevant to time-bin-encoded quantum emitter generation.", "motivation": "Solid-state quantum emitters can deterministically generate photonic graph states but suffer from intrinsic noise sources like phonons and nuclear spins, limiting achievable fidelities needed for fusion-based quantum computing. Purification offers a route to boost fidelity without requiring hard-to-implement deterministic photonic entangling gates.", "highlights": [ "Purification schemes achieve success probability up to $1/2$ using only linear optics and detectors", "Generalization from GHZ/CSS states to all photonic graph and stabilizer states", "Cascaded schemes optimized against realistic quantum-emitter noise models including time-bin encoding" ], "keywords": [ { "label": "Graph States", "reason": "The central photonic resource states being purified" }, { "label": "Purification", "reason": "The paper's core contribution is new purification protocols for entanglement" }, { "label": "Quantum Emitters", "reason": "Solid-state spin-photon emitters are the noisy generation source motivating purification" }, { "label": "CSS States", "reason": "CSS and GHZ states form the initial class of states addressed by the schemes" } ], "emoji": "🧬", "social_summary": "Develops linear-optics purification schemes to boost fidelity of photonic graph states generated by noisy quantum emitters.", "highlights_oneliner": "Linear-optics purification for photonic graph states" }, { "arxiv_id": "2609.02098", "title": "An Entanglement-Assisted Stabilizer Framework for Distributed Sensing of Local Phases", "authors": "Huidan Zheng, Ilkwon Sohn, Jun Heo", "arxiv_url": "https://arxiv.org/abs/2609.02098", "pdf_url": "https://arxiv.org/pdf/2609.02098", "summary": "The paper develops an entanglement-assisted stabilizer framework where remote halves of pre-shared ebits serve simultaneously as local phase probes and carriers of an encoded logical subsystem, using an extended EAQEC structure with a graph-code formulation and an illustrative $[[5,1,3;2]]$ construction. The framework shows stabilizer readout attains available quantum Fisher information while preserving logical information via a known Pauli correction after sensing.", "motivation": "Distributed quantum sensing requires spatially separated probes compatible with network-level quantum information processing, but combining metrological sensing with logical-state preservation has remained challenging. This work repurposes EAQEC stabilizer structure not for enhanced sensitivity but to structurally unify local phase sensing, error syndrome identification, and logical-state retention.", "highlights": [ "Stabilizer readout achieves the available quantum Fisher information for local phase estimation", "Post-sensing state differs from original encoded state only by a known, correctable Pauli transformation", "Illustrative $[[5,1,3;2]]$ EAQEC construction demonstrates the graph-code formulation" ], "keywords": [ { "label": "EAQEC Codes", "reason": "Entanglement-assisted quantum error-correcting codes form the structural basis of the framework" }, { "label": "Distributed Sensing", "reason": "The paper targets spatially separated quantum sensing with local phase probes" }, { "label": "Graph Codes", "reason": "A graph-code formulation makes the stabilizer structure explicit" }, { "label": "Fisher Information", "reason": "Quantum Fisher information is the metric used to evaluate sensing performance" } ], "emoji": "📡", "social_summary": "Builds an entanglement-assisted code framework letting shared qubits act as remote sensors while preserving encoded quantum information.", "highlights_oneliner": "EAQEC codes double as distributed phase sensors" }, { "arxiv_id": "2609.01744", "title": "Reliable Sample-Level Quantum Error Mitigation via Dominance-Aware Clustering", "authors": "Mohsen Ghodrati, Kausthubh Chandramouli, Dror Baron", "arxiv_url": "https://arxiv.org/abs/2609.01744", "pdf_url": "https://arxiv.org/pdf/2609.01744", "summary": "The paper studies sample-level quantum error mitigation for recovering task-relevant bitstrings ('centers') from noisy measured distributions, introducing a dominance condition under which majority voting recovers centers with exponentially decreasing error. They propose dominance-aware (DA) refinement, combining responsibility thresholding with a local dominance screen, and show via MaxCut-QAOA experiments that it improves precision and center recovery as purely classical post-processing.", "motivation": "Many quantum optimization algorithms need high-quality bitstring outputs from finite shots, but most existing error mitigation techniques target expectation values rather than individual samples, leaving a gap for tasks like QAOA. This work addresses that gap by identifying conditions for reliable bitstring-level recovery without requiring additional quantum circuit executions.", "highlights": [ "Dominance condition enables majority voting to recover centers with exponentially decreasing error", "Nearest-center clustering (e.g. $k$-modes) shown to fail even with known true centers, motivating DA refinement", "DA refinement improves precision and $k$-modes with DA improves overall center recovery in MaxCut-QAOA experiments" ], "keywords": [ { "label": "Error Mitigation", "reason": "Sample-level quantum error mitigation is the paper's central technique" }, { "label": "QAOA", "reason": "MaxCut-QAOA experiments validate the proposed methods" }, { "label": "Clustering", "reason": "Dominance-aware clustering and k-modes algorithms underpin the recovery procedure" }, { "label": "Majority Voting", "reason": "Qubit-wise majority voting is the key recovery mechanism analyzed" } ], "emoji": "🎯", "social_summary": "Proposes dominance-aware clustering to reliably recover optimal bitstrings from noisy quantum samples without extra circuit runs.", "highlights_oneliner": "Classical post-processing recovers noisy quantum bitstrings" }, { "arxiv_id": "2609.02361", "title": "DMRG using Belief Propagation", "authors": "Hendrik Kühne, Christian B. Mendl", "arxiv_url": "https://arxiv.org/abs/2609.02361", "pdf_url": "https://arxiv.org/pdf/2609.02361", "summary": "The authors introduce BP-DMRG, a variant of the density matrix renormalization group algorithm that incorporates belief propagation to extend DMRG to higher-dimensional and arbitrary lattices lacking canonical tensor network forms. On a $2\\times2$ hexagonal transverse-field Ising model lattice, BP-DMRG achieves fidelities between $0.9$ and $0.99$ and relative energy errors between $10^{-2}$ and $10^{-3}$, and it also successfully finds ground states on randomly generated lattices.", "motivation": "DMRG is the gold-standard method for one-dimensional ground-state tensor network optimization, but its extension to higher-dimensional or unstructured lattices is hindered by the lack of canonical forms. Belief propagation offers a graph-agnostic, memory-efficient contraction alternative, motivating its integration into DMRG for broader applicability despite being an uncontrolled approximation in loopy networks.", "highlights": [ "BP-DMRG achieves fidelities between $0.9$ and $0.99$ on a $2\\times2$ hexagonal lattice transverse-field Ising model", "Relative energy errors of $10^{-2}$ to $10^{-3}$ demonstrated versus true ground state", "Successfully finds ground states on randomly generated lattices, with fidelity improving as transverse field increases" ], "keywords": [ { "label": "Tensor Networks", "reason": "The paper's algorithm operates on tensor network states for many-body ground states" }, { "label": "Belief Propagation", "reason": "BP is the core algorithmic tool integrated into DMRG for lattice-agnostic contraction" }, { "label": "DMRG", "reason": "The density matrix renormalization group algorithm is extended by this work" }, { "label": "Ising Model", "reason": "The transverse-field Ising model is the benchmark system used for evaluation" } ], "emoji": "🕸️", "social_summary": "Combines belief propagation with DMRG to extend ground-state search to higher-dimensional and arbitrary quantum lattices.", "highlights_oneliner": "Belief propagation extends DMRG to arbitrary lattices" } ] }, "2026-09-02": { "word_cloud": [ { "word": "Tensor", "weight": 4 }, { "word": "Noise", "weight": 5 }, { "word": "Sycamore", "weight": 2 }, { "word": "Approximate", "weight": 4 }, { "word": "Encoding", "weight": 4 }, { "word": "Fidelity", "weight": 3 }, { "word": "Bicycle", "weight": 4 }, { "word": "Toffoli", "weight": 4 }, { "word": "Routing", "weight": 3 }, { "word": "Magic", "weight": 2 }, { "word": "GKP", "weight": 4 }, { "word": "Gauge", "weight": 4 }, { "word": "Bosonic", "weight": 3 }, { "word": "Compiler", "weight": 3 }, { "word": "Adaptive", "weight": 3 } ], "social_highlights": "Highlights: tensor networks learn device noise matching Google data, high-rank codes boost approximate error correction, structure-aware routing cuts Toffoli overhead on bicycle codes, GKP stabilizers encode gauge fields in bosonic modes, dynamic IR unifies adaptive error correction with measurement-based computing.", "papers": [ { "arxiv_id": "2609.00169", "title": "Exact learning of quantum noise with tensor networks", "authors": "Nicola Pancotti, Vedika Saravanan, Krysta Svore", "arxiv_url": "https://arxiv.org/abs/2609.00169", "pdf_url": "https://arxiv.org/pdf/2609.00169", "summary": "The authors present a variational framework that learns a quantum device's noise model directly from QEC syndrome and logical-observable data, treating fault-event probabilities as parameters optimized via gradient descent against a binary cross-entropy objective. They instantiate the method with a tensor-network decoder providing exact maximum-likelihood decoding and analytic gradients, and validate it on Google Sycamore data, recovering noise models within $2\\%$ of Google's independently characterized detector error model.", "motivation": "Accurate noise models are essential for near-threshold QEC decoding, but traditional characterization methods like tomography or randomized benchmarking require costly dedicated experiments and can go stale as devices drift. This work matters because it enables in-situ, decoder-agnostic noise learning directly from operational memory-experiment data, including real-time tracking of device drift.", "highlights": [ "Proves the cross-entropy objective attains the information-theoretic minimum logical error rate for expressive enough noise ansatzes", "Recovers noise models matching Google's independently characterized DEM to within $2\\%$ logical error rate agreement", "Demonstrates real-time tracking of synthetic noise drift via warm-started optimization without re-characterization" ], "keywords": [ { "label": "Tensor Networks", "reason": "Uses tensor-network decoders for exact maximum-likelihood decoding and differentiable gradients" }, { "label": "Noise Learning", "reason": "Core contribution is a variational method to learn fault-event probabilities from experimental data" }, { "label": "Detector Error Model", "reason": "Noise is parametrized and compared against the DEM framework used in decoding" }, { "label": "Sycamore", "reason": "Validated using circuit-level experimental data from Google's Sycamore superconducting processor" } ], "emoji": "🕸️", "social_summary": "Researchers use tensor-network decoders to learn quantum device noise directly from error-correction data, matching Google's characterization within two percent.", "highlights_oneliner": "Learning device noise from QEC syndrome data" }, { "arxiv_id": "2609.00778", "title": "High-Rank Encoding Can Improve Approximate Quantum Error Correction", "authors": "Bikun Li, Liang Jiang", "arxiv_url": "https://arxiv.org/abs/2609.00778", "pdf_url": "https://arxiv.org/pdf/2609.00778", "summary": "This paper shows that allowing mixed, high-rank code states rather than restricting to pure rank-one encodings can improve optimal entanglement fidelity in approximate quantum error correction. The authors bound the performance loss from imposing rank-one encoders, proving it is at most quadratic near perfect recovery, and construct an explicit noise family where higher-rank encoders are required to approach perfect recovery.", "motivation": "Conventional QEC code design assumes logical states are encoded as pure code states, a convention inherited from stabilizer formalism intuition, but this may not be optimal under realistic noise. Understanding when mixed-state encodings outperform pure encodings reshapes the design space for approximate quantum error correction, a regime increasingly relevant for near-term and resource-constrained fault tolerance.", "highlights": [ "Proves the loss from restricting to rank-one encoders is bounded and at most quadratic near perfect recovery", "Shows the high-rank encoding advantage is robust to small noise perturbations", "Constructs an explicit noise family where every optimal encoder must map pure inputs to mixed code states" ], "keywords": [ { "label": "Approximate QEC", "reason": "Focuses on approximate rather than exact quantum error correction performance limits" }, { "label": "Entanglement Fidelity", "reason": "Optimizes and bounds entanglement fidelity as the performance metric" }, { "label": "Mixed Encodings", "reason": "Central novelty is using high-rank, mixed-state encoders instead of pure code states" }, { "label": "Code Optimization", "reason": "Uses joint optimization over encoder and recovery to find optimal codes" } ], "emoji": "🌀", "social_summary": "Mixed, high-rank quantum codes can beat pure-state encodings for approximate error correction, new bounds and examples show.", "highlights_oneliner": "Mixed-state codes beat pure encodings" }, { "arxiv_id": "2609.00852", "title": "Structure-Aware Placement and Routing of Multi-Controlled Toffoli on Bivariate Bicycle Code Architectures", "authors": "Anik Basu Bhaumik, Suman Dutta, Siyi Wang, Anupam Chattopadhyay", "arxiv_url": "https://arxiv.org/abs/2609.00852", "pdf_url": "https://arxiv.org/pdf/2609.00852", "summary": "The paper maps optimal-depth multi-controlled Toffoli (MCT) decompositions onto bivariate bicycle (BB) code fault-tolerant architectures via direct $|CCZ\\rangle$ state injection, introducing a structure-aware placement strategy exploiting the binary-tree structure of MCT decompositions. The approach reduces inter-module instruction counts by up to $16.02\\%$ versus naive placement and up to $23.7\\%$ using grid-based factory layouts versus linear architectures, validated with the bicycle-ISA error estimator.", "motivation": "MCT gates are fundamental non-Clifford building blocks for quantum arithmetic and cryptanalysis, but their efficient realization on emerging low-overhead BB-code architectures remains largely unexplored compared to well-studied surface-code compilation. This work matters because it addresses compilation bottlenecks—routing, factory density, layout—that determine practical feasibility of running complex logical circuits on next-generation LDPC-based fault-tolerant hardware.", "highlights": [ "Reduces inter-module instruction counts by up to $16.02\\%$ via decomposition-aware co-location of MCT subtrees", "Shows grid-based magic-state factory layouts yield up to $23.7\\%$ fewer inter-module instructions than linear architectures", "Validates compiled circuits' logical failure probabilities using the Qiskit-community bicycle-ISA error estimator" ], "keywords": [ { "label": "Bivariate Bicycle", "reason": "Targets bivariate bicycle codes as the fault-tolerant hardware architecture" }, { "label": "Toffoli Gates", "reason": "Focuses on compiling multi-controlled Toffoli gate decompositions" }, { "label": "Magic States", "reason": "Uses $|CCZ\\rangle$ state injection from external factories to implement non-Clifford gates" }, { "label": "Compilation", "reason": "Introduces placement and routing strategies for modular fault-tolerant compilation" } ], "emoji": "🧩", "social_summary": "New placement strategy maps Toffoli gate circuits onto bicycle-code quantum architectures, cutting inter-module routing overhead by up to 24 percent.", "highlights_oneliner": "Toffoli gate mapping on bicycle codes" }, { "arxiv_id": "2609.00167", "title": "Encoding Compact U(1) Gauge Fields in Bosonic Modes with GKP Stabilization", "authors": "Victor Ale, Tommaso Rainaldi, Enrique Rico, Felix Ringer, George Siopsis", "arxiv_url": "https://arxiv.org/abs/2609.00167", "pdf_url": "https://arxiv.org/pdf/2609.00167", "summary": "The authors introduce a one-to-one encoding of compact $U(1)$ lattice gauge theory degrees of freedom into bosonic oscillator modes, using a Gottesman-Kitaev-Preskill (GKP)-type stabilizer to enforce the compactness that continuous quadratures otherwise lack. They derive a closed-form finite-squeezing error budget for compact QED$_3$, design syndrome-extraction protocols to detect photon-loss displacement errors, and demonstrate recovery of exponentially small charge-sector energy splittings at percent-level accuracy via real-time spectroscopy on a one-plaquette example.", "motivation": "Simulating lattice gauge theories on quantum hardware is a key target for quantum simulation, but gauge fields live on continuous group manifolds while qubit hardware requires truncation, introducing systematic discretization error. This work matters because bosonic continuous-variable hardware combined with GKP stabilization can represent gauge fields exactly and correctably, avoiding truncation error while offering a controlled path to error correction.", "highlights": [ "Encoding becomes exact in the infinite-squeezing limit, with finite-squeezing errors appearing as computable, correctable shifts rather than uncontrolled leakage", "Derives closed-form finite-squeezing error budget for compact QED$_3$ and designs syndrome extraction to detect photon-loss displacement errors", "Recovers the exponentially small charge-sector energy splitting from real-time spectroscopy at percent-level accuracy against exact results" ], "keywords": [ { "label": "GKP Codes", "reason": "Uses GKP-type stabilizers to enforce compactness of the gauge field encoding" }, { "label": "Lattice Gauge Theory", "reason": "Applies the encoding to compact $U(1)$ lattice gauge theory, specifically QED$_3$" }, { "label": "Bosonic Modes", "reason": "Encodes gauge degrees of freedom into continuous-variable oscillator modes" }, { "label": "Photon Loss", "reason": "Develops syndrome-extraction protocols to detect and correct photon-loss-induced displacement errors" } ], "emoji": "🎛️", "social_summary": "Scientists encode compact gauge fields into oscillator modes using GKP stabilizers, enabling error-correctable quantum simulation of lattice gauge theory.", "highlights_oneliner": "GKP-stabilized bosonic gauge field encoding" }, { "arxiv_id": "2609.01037", "title": "A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs", "authors": "Alex Rice, Chris Heunen, Tobias Grosser", "arxiv_url": "https://arxiv.org/abs/2609.01037", "pdf_url": "https://arxiv.org/pdf/2609.01037", "summary": "This paper introduces a new compiler Intermediate Representation (IR) that treats quantum gates as first-class values, allowing dynamic creation, composition, and classical control of gates rather than the fixed gate-sequence view of the standard circuit model. The IR uniformly captures stochastic gate selection, adaptive error correction, and measurement-based computation, and is shown to compactly express hybrid programs and enable optimizations not possible in circuit-model representations.", "motivation": "Standard quantum compilers assume a static circuit model, but real hybrid quantum-classical applications like adaptive error correction and measurement-based computation require gate choices to depend on runtime data, breaking that assumption. A unified IR that natively supports dynamic, data-dependent gate behavior is important for building compilers that can properly analyze and optimize next-generation fault-tolerant and adaptive quantum programs.", "highlights": [ "Elevates gates to first-class values enabling dynamic creation and classical control within a single IR", "Uniformly expresses stochastic gate selection, adaptive error correction, and measurement-based computation", "Benchmark evaluation shows compact program representation and improved compiler analysis versus circuit-model IRs" ], "keywords": [ { "label": "Compiler IR", "reason": "Central contribution is a new intermediate representation for quantum compilers" }, { "label": "Adaptive QEC", "reason": "IR explicitly supports representing adaptive error correction protocols" }, { "label": "MBQC", "reason": "Framework captures measurement-based quantum computation within the same representation" }, { "label": "Hybrid Programs", "reason": "Targets compilation of hybrid quantum-classical programs with runtime-dependent control flow" } ], "emoji": "🔧", "social_summary": "A new compiler representation treats quantum gates as dynamic values, unifying adaptive error correction and measurement-based computing in one framework.", "highlights_oneliner": "Dynamic IR for adaptive quantum programs" } ] }, "2026-09-01": { "word_cloud": [ { "word": "QLDPC", "weight": 4 }, { "word": "Decoders", "weight": 4 }, { "word": "GKP", "weight": 4 }, { "word": "Bosonic", "weight": 3 }, { "word": "Neutral", "weight": 4 }, { "word": "Rydberg", "weight": 3 }, { "word": "Lattice", "weight": 3 }, { "word": "ZX-Calculus", "weight": 2 }, { "word": "Turbo", "weight": 3 }, { "word": "Magic", "weight": 3 }, { "word": "Topological", "weight": 3 }, { "word": "Qudits", "weight": 3 }, { "word": "Cat", "weight": 3 }, { "word": "Josephson", "weight": 2 }, { "word": "Recovery", "weight": 2 } ], "social_highlights": "Highlights: faster QLDPC decoders beat BP+OSD, tighter bounds for locally recoverable codes, universal recovery for approximate QEC, SpiderLS slashes lattice surgery costs via ZX reduction, deterministic GKP gates in neutral atoms, quantum block turbo codes boost stabilizer performance, stable representations yield protected topological qudits, magic leakage bounded by code distance, neutral atom review of logical qubit progress, no-go theorem for higher-genus bosonic codes, cross-Kerr scheme generates two-mode cat states, and dc-biased Josephson junctions engineer multi-photon dissipation for cat qubits.", "papers": [ { "arxiv_id": "2608.31040", "title": "Fast Fault-Tolerant Decoders for Hypergraph Product and Lifted-Product Codes", "authors": "Asit Kumar Pradhan, Nithin Raveendran, David Declercq, Bane Vasić", "arxiv_url": "https://arxiv.org/abs/2608.31040", "pdf_url": "https://arxiv.org/pdf/2608.31040", "summary": "The authors design low-complexity, fault-tolerant message-passing decoders for QLDPC codes (hypergraph-product and lifted-product) that directly resolve stabilizer-induced trapping sets caused by CNOT hook errors, avoiding the need for explicit correlation variable nodes or costly OSD post-processing. By modeling CNOT faults as equivalent data plus syndrome-bit errors on a phenomenological Tanner graph, they achieve logical error rates comparable to or better than BP+OSD at substantially reduced decoding complexity.", "motivation": "QLDPC codes promise constant-overhead fault tolerance but require decoders that are fast enough to keep pace with syndrome extraction under circuit-level noise, where existing OSD-based approaches are a major latency bottleneck. This work targets that gap by exploiting the structural origin of hook-error-induced trapping sets in hypergraph-product and lifted-product code families.", "highlights": [ "Identifies stabilizer-induced trapping sets from CNOT hook errors as the key decoding bottleneck", "Derives QLDPC decoders directly from classical LDPC parent-code decoders to resolve these trapping sets", "Achieves comparable or lower logical error rates than BP+OSD with significantly lower decoding complexity" ], "keywords": [ { "label": "QLDPC Codes", "reason": "Focuses on decoding hypergraph-product and lifted-product QLDPC code families" }, { "label": "Trapping Sets", "reason": "Central concept explaining decoder failures from CNOT hook errors" }, { "label": "BP+OSD", "reason": "Baseline decoding method compared against for complexity and performance" }, { "label": "Circuit-Level Noise", "reason": "Decoders are designed specifically for fault-tolerant circuit-level noise models" } ], "emoji": "🕸️", "social_summary": "New low-complexity decoders resolve CNOT-induced trapping sets in QLDPC codes, beating BP+OSD at a fraction of the cost.", "highlights_oneliner": "Fast trapping-set-aware decoders for QLDPC codes" }, { "arxiv_id": "2608.28650", "title": "Alphabet-Dependent Bounds for Pure Quantum $(r,\\rho)$-Locally Recoverable Codes", "authors": "Vijay Kumar, Ramakrishna Bandi", "arxiv_url": "https://arxiv.org/abs/2608.28650", "pdf_url": "https://arxiv.org/pdf/2608.28650", "summary": "This letter derives three new alphabet-dependent upper bounds—Griesmer-like, Plotkin-like, and sphere-packing-like—for pure $(r,\\rho)$-quantum locally recoverable codes ($(r,\\rho)$-qLRCs) built via the Hermitian CSS construction. The authors establish an asymptotic hierarchy among these bounds and the previously known alphabet-independent Singleton-like bounds, identifying regimes where each bound is tightest.", "motivation": "Locally recoverable codes are essential for efficient distributed and cloud storage, and quantum extensions inherit this need for local recoverability under erasures, but existing quantum Singleton-like bounds ignore alphabet size and are loose for small qudit dimensions. Tighter, alphabet-dependent bounds are needed to better characterize achievable rate-distance tradeoffs for practical qudit dimensions.", "highlights": [ "Derives Griesmer-like, Plotkin-like, and sphere-packing-like bounds for pure $(r,\\rho)$-qLRCs", "Proves asymptotic ordering: Plotkin-like tighter than Griesmer-like tighter than Singleton-like bounds for $r\\geq 3$", "Maps out relative-distance regions where each bound gives the tightest rate constraint" ], "keywords": [ { "label": "Locally Recoverable Codes", "reason": "Core code family studied, extended to the quantum setting" }, { "label": "CSS Construction", "reason": "Hermitian CSS construction used to build the pure qLRCs analyzed" }, { "label": "Coding Bounds", "reason": "Paper's main contribution is deriving new alphabet-dependent coding bounds" }, { "label": "Erasure Correction", "reason": "qLRCs are designed to tolerate erasures within recovery sets" } ], "emoji": "📐", "social_summary": "Tighter alphabet-dependent bounds sharpen limits on quantum locally recoverable codes for small qudit dimensions.", "highlights_oneliner": "New bounds for quantum locally recoverable codes" }, { "arxiv_id": "2608.28962", "title": "Universal recovery in approximate quantum error correction", "authors": "Dor Elimelech, Victor V. Albert, Alexander Barg", "arxiv_url": "https://arxiv.org/abs/2608.28962", "pdf_url": "https://arxiv.org/pdf/2608.28962", "summary": "Building on their prior error-set theory of approximate quantum error correction (AQEC), the authors establish that a single universal recovery map can simultaneously correct every channel controlled by a given error set, completing the analog of exact QEC's linearity guarantee. They show the environment-leakage distance and Knill-Laflamme Hellinger distance control both worst-case and average-case universal decoding performance, and study the Petz map as an explicit, uniformly good universal recovery operation.", "motivation": "Exact quantum error correction benefits from a powerful linearity property guaranteeing a single recovery map suffices for an entire linear span of correctable errors, but this structure was believed absent in approximate QEC, limiting adversarial-style guarantees for realistic near-correctable codes. Establishing universal recovery in the approximate setting closes this gap and extends adversarial error-set reasoning to AQEC.", "highlights": [ "Proves existence of a single universal recovery map for entire families of channels controlled by an error set", "Shows environment-leakage distance and Knill-Laflamme Hellinger distance govern universal decoding guarantees", "Demonstrates the Petz map achieves uniform average- and worst-case recovery across the full channel family" ], "keywords": [ { "label": "AQEC", "reason": "Paper develops the theory of approximate quantum error correction" }, { "label": "Petz Map", "reason": "Studied as an explicit universal recovery map for error sets" }, { "label": "Knill-Laflamme", "reason": "Hellinger distance generalization of KL conditions used to quantify correctability" }, { "label": "Universal Recovery", "reason": "Central concept of a single decoder correcting an entire error-channel family" } ], "emoji": "🔁", "social_summary": "A single recovery map can now correct entire families of noisy channels even in approximate quantum error correction.", "highlights_oneliner": "Universal decoding proven for approximate QEC" }, { "arxiv_id": "2608.30228", "title": "SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation", "authors": "Hyungseok Kim, Changheon Lee, Seungjik Kim, Enhyeok Jang, Youngmin Kim, Seungwoo Choi, Hanbit Lee, Sungho Pyun, Won Woo Ro", "arxiv_url": "https://arxiv.org/abs/2608.30228", "pdf_url": "https://arxiv.org/pdf/2608.30228", "summary": "SpiderLS is a lattice surgery compiler that applies full ZX-calculus reduction, rather than restricted reduction preserving lattice-surgery-embeddable structures, and translates the resulting diagrams into executable operations via a sequence of compiler passes including execution-order derivation, multi-target grouping, and Pauli-product measurement lowering. The compiler uses explicit patch and Pauli-boundary information to guide structure-aware spacetime routing for surface-code implementations.", "motivation": "Translating fault-tolerant quantum programs into surface-code lattice surgery realizations efficiently is critical since spatial and temporal resources directly determine execution cost, and prior ZX-based compilers restricted reduction to preserve directly embeddable diagram structures, sacrificing potential optimization. SpiderLS removes this restriction to unlock greater spacetime savings.", "highlights": [ "Achieves 49.2% average reduction in spacetime volume over prior ZX-based lattice surgery compilation", "Reduces compilation time by 99.8% compared to the prior ZX-based compiler", "Introduces compiler passes for execution ordering, multi-target grouping, and structure-aware routing" ], "keywords": [ { "label": "Lattice Surgery", "reason": "The compilation target and physical realization model studied" }, { "label": "ZX-Calculus", "reason": "Full ZX diagram reduction used as intermediate representation" }, { "label": "Surface Codes", "reason": "Underlying fault-tolerant code architecture for lattice surgery" }, { "label": "Compiler Optimization", "reason": "Focus on reducing spacetime volume and compilation time" } ], "emoji": "🕷️", "social_summary": "SpiderLS compiler slashes spacetime cost by nearly half and compile time by 99.8% using full ZX-diagram reduction.", "highlights_oneliner": "Full ZX reduction speeds up lattice surgery compilation" }, { "arxiv_id": "2608.30631", "title": "Deterministic Universal Logical Gates for Finite-Energy GKP Qubits in Trapped Neutral Atoms", "authors": "Alok Kumar, Aaron N. Raja, Diksha Thapliyal, Ishitwa Kumar Das, Ajay Wasan1", "arxiv_url": "https://arxiv.org/abs/2608.30631", "pdf_url": "https://arxiv.org/pdf/2608.30631", "summary": "This work proposes a universal logical gate set for finite-energy GKP qubits encoded in the motional states of trapped neutral atoms, using internal electronic states as ancillas for state-dependent conditional displacements to realize single-qubit phase gates, and a transient Rydberg-mediated dipole-dipole interaction for a measurement-free controlled-Z gate. Under magic-trapping conditions with continuous trapping, the protocols achieve average gate fidelities of $0.986$ and $0.985$ at $\\Delta=0.25$ (12 dB squeezing), rising to $0.997$ and $0.995$ at $\\Delta=0.1$.", "motivation": "GKP bosonic codes offer strong hardware-error correction and rich logical operations, and while GKP states have been realized in superconducting cavities and trapped ions, neutral atoms provide a complementary platform with long coherence and tunable interactions that has lacked a complete universal logical gate scheme. This work fills that gap by providing deterministic, measurement-free gates compatible with continuous trapping.", "highlights": [ "Achieves average single-qubit phase gate fidelity of $0.986$ and CZ gate fidelity of $0.985$ at $\\Delta=0.25$", "Fidelities improve to $0.997$ and $0.995$ respectively as squeezing increases to $\\Delta=0.1$", "Realizes a measurement-free controlled-Z gate via transient Rydberg dipole-dipole interaction without blockade" ], "keywords": [ { "label": "GKP Codes", "reason": "Bosonic code encoding used for the logical qubits in this work" }, { "label": "Neutral Atoms", "reason": "Physical platform where motional GKP states are encoded and controlled" }, { "label": "Rydberg Interaction", "reason": "Mechanism enabling the two-qubit controlled-Z gate" }, { "label": "Universal Gate Set", "reason": "Paper delivers both single- and two-qubit gates for universal computation" } ], "emoji": "⚛️", "social_summary": "Neutral-atom GKP qubits get a deterministic, measurement-free universal gate set with fidelities above 0.98.", "highlights_oneliner": "Universal gates for motional GKP qubits in neutral atoms" }, { "arxiv_id": "2608.30775", "title": "Quantum Block Turbo Codes", "authors": "Khaled Jebari, Luiz Anet Neto, Ramesh Pyndiah, Jean-Louis de Bougrenet de la Tocnaye", "arxiv_url": "https://arxiv.org/abs/2608.30775", "pdf_url": "https://arxiv.org/pdf/2608.30775", "summary": "The authors introduce Quantum Block Turbo Codes (QBTCs), the quantum analog of classical Pyndiah block turbo codes built from product codes of two or more constituent stabilizer codes, along with a soft-input soft-output iterative decoding algorithm and probabilistic transposition operations for exchanging information between dimensions. Simulations on a depolarizing channel show a $[[25,1,9]]$ QBTC outperforming minimum-weight decoding and a $[[64,9,9]]$ QBTC exhibiting a clear turbo decoding gain.", "motivation": "Classical turbo codes revolutionized error correction by combining product codes with iterative soft decoding to approach the Shannon limit, but only convolutional turbo codes had previously been adapted to the quantum setting via serial turbo codes. This work completes the analogy by developing the quantum counterpart of block turbo/product codes to gain similar flexibility and performance benefits.", "highlights": [ "Introduces the first quantum analog of classical block turbo (product) codes with iterative SISO decoding", "$[[25,1,9]]$ QBTC achieves logical error rate of $1.6\\times10^{-6}$ at $10^{-2}$ depolarizing rate", "$[[64,9,9]]$ QBTC shows clear turbo decoding gain, reaching $10^{-12}$ WER at $10^{-3}$ depolarizing rate after five iterations" ], "keywords": [ { "label": "Turbo Codes", "reason": "Quantum block turbo codes are the direct quantum analog of classical turbo product codes" }, { "label": "Stabilizer Codes", "reason": "Constituent codes combined into product structure are stabilizer codes" }, { "label": "Iterative Decoding", "reason": "Soft-input soft-output decoding algorithm central to the turbo effect" }, { "label": "Depolarizing Channel", "reason": "Noise model used to benchmark logical error rate performance" } ], "emoji": "🔄", "social_summary": "Quantum Block Turbo Codes bring classical turbo-decoding gains to stabilizer product codes, boosting logical error rates.", "highlights_oneliner": "Quantum analog of classical block turbo codes" }, { "arxiv_id": "2608.31011", "title": "Protected Logical Qudits in Kitaev Quantum Double Models via Stable Representations", "authors": "Naihong Hu, Futao Wang", "arxiv_url": "https://arxiv.org/abs/2608.31011", "pdf_url": "https://arxiv.org/pdf/2608.31011", "summary": "The authors develop a representation-theoretic framework using $\\varepsilon$-stable irreducible representations to construct protected logical qudits in finite-group Kitaev quantum double models, deriving a necessary and sufficient existence criterion and ribbon-projector commutation relations yielding a $d$-dimensional protected logical subspace. They apply this to obtain logical qubits from symmetric and alternating groups $S_n$ ($n\\geq 3$) and $A_4$, a logical qutrit for $A_4$, and arbitrary-dimensional logical qudits from $(\\mathbb{Z}_2)^d \\rtimes \\mathbb{Z}_d$, plus a universal logical qutrit computation scheme for $D(A_4)$.", "motivation": "Topological quantum codes based on Kitaev's quantum double models promise fault-tolerant protection via non-Abelian anyons, but constructing explicit protected logical subspaces for general finite groups has lacked a systematic representation-theoretic criterion. This work provides such a general framework, enabling new logical qudit constructions and a concrete universal computation scheme.", "highlights": [ "Introduces $\\varepsilon$-stable irreducible representations giving a necessary and sufficient criterion for protected logical qudits", "Constructs logical qubits from $S_n$ ($n\\geq3$) and a logical qutrit from $A_4$ via ribbon-projector commutation relations", "Presents $(\\mathbb{Z}_2)^d\\rtimes\\mathbb{Z}_d$ family realizing arbitrary-dimensional protected logical qudits and a universal qutrit scheme for $D(A_4)$" ], "keywords": [ { "label": "Quantum Double Models", "reason": "Kitaev's finite-group quantum double models are the core topological framework" }, { "label": "Ribbon Operators", "reason": "Ribbon-projector commutation relations used to define logical operations" }, { "label": "Topological Qudits", "reason": "Construction yields protected $d$-dimensional logical subspaces" }, { "label": "Representation Theory", "reason": "Stable irreducible representations underpin the existence criterion" } ], "emoji": "🎭", "social_summary": "New representation-theoretic recipe builds protected logical qudits, including qutrits, in Kitaev's topological quantum double models.", "highlights_oneliner": "Stable representations yield protected topological qudits" }, { "arxiv_id": "2608.29438", "title": "The resource cost of magic in a code block", "authors": "Jiachen Shen, Hui Zhong", "arxiv_url": "https://arxiv.org/abs/2608.29438", "pdf_url": "https://arxiv.org/pdf/2608.29438", "summary": "This work bounds the magic (non-stabilizerness) of a post-selected logical measurement outcome by the resources that produced it, working outcome-by-outcome rather than on averaged channels since a channel can be free while individual outcomes measure the magic axis. The main result shows that when resource insertions lie within a bounded-spread exact-recovery skeleton with a threshold linear in code distance $d$, the accepted magic times acceptance probability is bounded by $\\exp[-\\Omega(d\\log d)]$, certified via a circuit implementing one exact stabilizer measurement round with split readout.", "motivation": "Fault-tolerant architectures like surface codes handle Clifford operations cheaply but pay heavily for magic states needed for non-Clifford gates, and techniques like magic-state cultivation rely on delicate non-Pauli logical measurements whose magic leakage was not rigorously bounded. This paper provides a rigorous resource-theoretic accounting of how much magic can leak into accepted post-selected measurement outcomes.", "highlights": [ "Establishes an unconditional bound: accepted magic is at most a constant times summed distance of resource cells from the free set", "Proves accepted magic times acceptance probability decays as $\\exp[-\\Omega(d\\log d)]$ under a bounded-spread exact-recovery skeleton", "Certifies the threshold equal to code distance $d_Z$ via an explicit circuit with one exact stabilizer round and split logical $X$/$Z$ readout" ], "keywords": [ { "label": "Magic States", "reason": "Core resource being quantified in the accepted post-selected outcomes" }, { "label": "Resource Theory", "reason": "Framework used to measure distance from the stabilizer free set" }, { "label": "Post-Selection", "reason": "Central to the adaptive measure-feedforward-accept protocol analyzed" }, { "label": "Magic Cultivation", "reason": "Motivating application involving delicate non-Pauli logical axis measurement" } ], "emoji": "✨", "social_summary": "New bounds show how little magic can leak into post-selected logical measurements, decaying exponentially with code distance.", "highlights_oneliner": "Bounding magic leakage in post-selected code measurements" }, { "arxiv_id": "2608.30783", "title": "Neutral atom quantum computing", "authors": "M. Saffman", "arxiv_url": "https://arxiv.org/abs/2608.30783", "pdf_url": "https://arxiv.org/pdf/2608.30783", "summary": "This review surveys the physics and current experimental status of neutral atom qubit platforms for quantum computing, covering single- and two-qubit gate implementation, array scalability, and recent demonstrations of quantum algorithms and logical qubits. It discusses quantum error correction concepts such as code notation $[[n,k,d]]$, ancilla-based syndrome extraction, and the code rate $r=k/n$, contextualizing neutral atoms within the broader QEC landscape.", "motivation": "Neutral atom qubits, first proposed over 25 years ago, have rapidly matured into a leading platform for large-scale quantum computing, culminating in recent demonstrations of fault-tolerant logical qubits. As quantum advantage is widely believed to require robust QEC, understanding the neutral atom approach's capabilities and outlook is essential for the field's progress.", "highlights": [ "Reviews foundational QEC concepts including $[[n,k,d]]$ code notation and the $n=5$ minimum for single-error correction", "Surveys microwave-driven single-qubit gate implementations achieving universal control via $\\sf R(\\theta,\\phi)$ rotations", "Highlights recent progress toward logical qubits and fault-tolerant error correction in neutral atom arrays" ], "keywords": [ { "label": "Neutral Atoms", "reason": "The paper reviews neutral atom qubits as a leading quantum computing platform" }, { "label": "Logical Qubits", "reason": "Discusses recent demonstrations of logical qubits for fault-tolerant error correction" }, { "label": "Code Distance", "reason": "Explains the $[[n,k,d]]$ notation and code rate $r=k/n$ central to QEC theory" }, { "label": "Rydberg Gates", "reason": "Reviews gate implementations and array scalability underlying atom-based quantum computation" } ], "emoji": "⚛️", "social_summary": "Reviews how neutral atom qubit arrays have rapidly advanced toward fault-tolerant quantum computing with logical qubits.", "highlights_oneliner": "Review of neutral atom qubits and QEC progress" }, { "arxiv_id": "2608.31156", "title": "Bosonic codes from compact phase spaces", "authors": "David Roberts, Aaron Slipper, Alireza Parhizkar, Victor V. Albert, Mohammad Hafezi", "arxiv_url": "https://arxiv.org/abs/2608.31156", "pdf_url": "https://arxiv.org/pdf/2608.31156", "summary": "The authors construct bosonic quantum error-correcting codes on genus-two Riemann surfaces, explicitly building code words as automorphic forms and generating the full tower of code spaces at all weights. They prove a no-go theorem showing that for genus greater than one, the stabilizer group is non-amenable, forcing a strictly positive spectral gap that prevents any normalizable state from satisfying all stabilizer conditions exactly.", "motivation": "Standard Gottesman-Kitaev-Preskill (GKP) codes rely on the amenable $\\mathbb{Z}^2$ stabilizer group, permitting approximate code words of arbitrary precision, but it was unclear whether richer compact phase-space geometries could offer similar or improved code structures. This work extends bosonic code theory to higher-genus surfaces, revealing a fundamental algebraic obstruction absent in the flat GKP case.", "highlights": [ "Explicit construction of code words as automorphic forms on genus-two Riemann surfaces", "Proof that stabilizer groups for genus greater than one are non-amenable, forcing a strictly positive spectral gap", "Demonstration that no normalizable state can exactly satisfy all stabilizer conditions, contrasting with GKP codes" ], "keywords": [ { "label": "Bosonic Codes", "reason": "Core subject is a new family of bosonic quantum error-correcting codes" }, { "label": "GKP Codes", "reason": "Compared against standard Gottesman-Kitaev-Preskill codes with amenable stabilizer group $\\mathbb{Z}^2$" }, { "label": "Riemann Surfaces", "reason": "Codes are constructed on genus-two Riemann surfaces using automorphic forms" }, { "label": "No-Go Theorem", "reason": "Proves non-amenability forces a spectral gap preventing exact stabilizer states" } ], "emoji": "🌀", "social_summary": "Reveals a no-go theorem showing higher-genus bosonic codes cannot achieve exact stabilizer states unlike standard GKP codes.", "highlights_oneliner": "No-go theorem for genus-two bosonic codes" }, { "arxiv_id": "2608.29173", "title": "Probabilistic generation of two-mode binomial cat states using cross-Kerr interactions", "authors": "S. Zhao, A. Metelmann, S. Qvarfort", "arxiv_url": "https://arxiv.org/abs/2608.29173", "pdf_url": "https://arxiv.org/pdf/2608.29173", "summary": "This work proposes a protocol to probabilistically generate two-mode binomial cat states using only Gaussian initial states combined with heralded heterodyne measurements and cross-Kerr interactions between bosonic modes. The scheme is shown to remain robust under realistic dissipation, providing a practical experimental route to these states without requiring non-Gaussian resources such as Fock or NOON states.", "motivation": "Two-mode binomial cat states enable exact quantum error correction due to their fully orthogonal coherent-state components, unlike single-mode cat states whose approximate error correction stems from asymptotically vanishing overlaps. Existing preparation methods require experimentally challenging non-Gaussian initial states, motivating a more practical Gaussian-resource-based approach.", "highlights": [ "Protocol generates two-mode binomial cat states from purely Gaussian initial states via heralded heterodyne measurement", "Uses cross-Kerr interactions realizable in superconducting circuit architectures such as SNAIL-coupled resonators", "Shows robustness of the generated states to dissipation under realistic experimental conditions" ], "keywords": [ { "label": "Cat States", "reason": "Paper focuses on generating two-mode binomial cat states for quantum error correction" }, { "label": "Cross-Kerr", "reason": "Cross-Kerr interactions between bosonic modes are the key resource used" }, { "label": "Continuous Variable", "reason": "Binomial cat states enable exact QEC in continuous-variable quantum computing" }, { "label": "Heralded Measurement", "reason": "Protocol relies on heralded heterodyne measurement for state preparation" } ], "emoji": "🐱", "social_summary": "Proposes generating two-mode binomial cat states from simple Gaussian resources using cross-Kerr interactions and heralded measurement.", "highlights_oneliner": "Gaussian-resource route to binomial cat states" }, { "arxiv_id": "2608.31154", "title": "Engineering multi-photon dissipation with a dc-voltage-biased Josephson junction", "authors": "Marco Paradina, Ambroise Peugeot, Roberto Negrin, Oscar Novat, Tristan Villain, Anil Murani, Jean-Loup Ville, Sébastien Jezouin, Raphaël Lescanne, Audrey Bienfait, Benjamin Huard", "arxiv_url": "https://arxiv.org/abs/2608.31154", "pdf_url": "https://arxiv.org/pdf/2608.31154", "summary": "The authors engineer multi-photon dissipation using a dc-voltage-biased SQUID instead of the conventional parametrically pumped Josephson coupler, avoiding spurious nonlinear terms that typically arise. They demonstrate activation of one-, two-, and four-photon conversion processes from a high-Q mode into a lossy mode, characterizing two-photon dissipation via Wigner tomography.", "motivation": "Multi-photon dissipation is a crucial resource for stabilizing bosonic qubits such as cat qubits, but standard parametric pumping introduces unwanted nonlinear terms that degrade performance. This work establishes dc-biased Josephson junctions as a cleaner reservoir engineering tool, offering a viable path toward improved cat-qubit stabilization.", "highlights": [ "Demonstrates one-, two-, and four-photon dissipation processes using a dc-voltage-biased SQUID", "Avoids spurious nonlinear terms that plague conventional parametrically pumped Josephson couplers", "Characterizes two-photon dissipation via Wigner tomography, validating cat-qubit stabilization potential" ], "keywords": [ { "label": "Cat Qubits", "reason": "Multi-photon dissipation is a key resource for stabilizing cat qubits" }, { "label": "Josephson Junction", "reason": "dc-voltage-biased SQUID is the core device engineering the dissipation" }, { "label": "Reservoir Engineering", "reason": "Establishes dc-biased junctions as a tool for engineered dissipation" }, { "label": "Wigner Tomography", "reason": "Used to characterize the two-photon dissipation process experimentally" } ], "emoji": "🔌", "social_summary": "Engineers clean multi-photon dissipation with a dc-biased Josephson junction, offering a new route to stabilize cat qubits.", "highlights_oneliner": "dc-biased junction enables clean multi-photon dissipation" } ] }, "2026-08-31": { "word_cloud": [ { "word": "Decoders", "weight": 5 }, { "word": "Surface", "weight": 4 }, { "word": "BeliefPropagation", "weight": 4 }, { "word": "Bicycle", "weight": 3 }, { "word": "Neural", "weight": 4 }, { "word": "Concatenated", "weight": 3 }, { "word": "Toric", "weight": 3 }, { "word": "Ytterbium", "weight": 3 }, { "word": "NeutralAtoms", "weight": 2 }, { "word": "Throughput", "weight": 2 }, { "word": "NearMemory", "weight": 2 }, { "word": "MWPM", "weight": 2 }, { "word": "Mitigation", "weight": 3 }, { "word": "Sampling", "weight": 2 }, { "word": "Spectral", "weight": 2 } ], "social_highlights": "Highlights: algebraic theory decodes bivariate bicycle codes, neural BP predicts logical ops linearly for surface codes, near-memory hardware speeds qLDPC BP decoding 9x, hierarchical message passing boosts concatenated code thresholds, dual-isotope ytterbium arrays cut surface code errors, quasi-local decoder rivals MWPM on toric codes, shot-budget analysis questions error mitigation gains on IBM hardware.", "papers": [ { "arxiv_id": "2608.27565", "title": "Spectral Theory of Semisimple Bivariate Bicycle Codes", "authors": "Eric Sabo, Mahir Bilen Can, David Marquis", "arxiv_url": "https://arxiv.org/abs/2608.27565", "pdf_url": "https://arxiv.org/pdf/2608.27565", "summary": "The authors develop an algebraic framework for bivariate bicycle (BB) codes that generalizes classical two-dimensional cyclic code theory, using Frobenius-orbit idempotents to derive formulas for logical dimension $k$ and lower bounds on minimum distance $d$. They construct a structured block-monomial subgroup of coordinate permutations to formalize code symmetries, and provide explicit examples that generate codes analytically without numerical search, plus a BCH-based product code extension.", "motivation": "Bivariate bicycle codes have emerged as promising low-overhead qLDPC codes, but most known constructions rely on computer search rather than structural understanding. Grounding BB codes in classical 2D cyclic code theory provides analytic tools for predicting parameters and symmetries, reducing reliance on brute-force search.", "highlights": [ "Frobenius-orbit idempotent formulas for computing logical dimension $k$ of semisimple BB codes", "Analytic lower bounds on minimum distance $d$ derived from generating polynomials and annihilator ideals", "Explicit first-principles constructions of BB codes and a BCH-based product code extension avoiding numerical search" ], "keywords": [ { "label": "Bicycle Codes", "reason": "The paper's central object is the bivariate bicycle code family and its algebraic structure" }, { "label": "Cyclic Codes", "reason": "Extends classical 2D cyclic code theory to the quantum setting" }, { "label": "Idempotents", "reason": "Frobenius-orbit idempotents are the key algebraic tool used to derive logical dimensions" }, { "label": "Minimum Distance", "reason": "Establishes analytic lower bounds on code distance via generating polynomials" } ], "emoji": "🧮", "social_summary": "Researchers build an algebraic theory of bivariate bicycle qLDPC codes, deriving code parameters analytically instead of via computer search.", "highlights_oneliner": "Algebraic theory for constructing bivariate bicycle codes" }, { "arxiv_id": "2608.27682", "title": "Logical Neural Belief Propagation for Linear-Complexity Decoding of Surface Codes", "authors": "Hee-Youl Kwak, Seong-Joon Park, Dae-Young Yun, Eliya Nachmani, Jae-Won Kim", "arxiv_url": "https://arxiv.org/abs/2608.27682", "pdf_url": "https://arxiv.org/pdf/2608.27682", "summary": "The paper introduces Logical Neural Belief Propagation (L-NBP), a decoder that redirects neural belief propagation from physical-error inference to logical-operator prediction via an end-to-end trainable soft-syndrome classifier. On surface codes, L-NBP matches or outperforms BP-OSD and MWPM while retaining linear decoding complexity $O(n)$, achieving a $17.5\\%$ threshold under depolarizing noise and $0.2\\%$ of BP-OSD's complexity at $d=9$ under circuit-level noise.", "motivation": "Surface code decoding traditionally relies on superlinear methods like MWPM and BP-OSD because plain belief propagation struggles with short cycles and quantum degeneracy. Achieving both high logical accuracy and linear-time decoding is critical for scaling fault-tolerant quantum computation to large code distances.", "highlights": [ "End-to-end trainable NBP plus logical classifier that predicts logical operators instead of physical errors", "Threshold of $17.5\\%$ under depolarizing noise, matching or beating BP-OSD and MWPM", "At $d=9$ under circuit-level noise, matches BP-OSD accuracy using only $0.2\\%$ of its computational complexity" ], "keywords": [ { "label": "Belief Propagation", "reason": "Core decoding algorithm modified into a neural variant" }, { "label": "Surface Codes", "reason": "The decoder is designed and benchmarked specifically for surface codes" }, { "label": "Neural Decoders", "reason": "Uses trainable neural network components for logical-level decoding" }, { "label": "Thresholds", "reason": "Reports a $17.5\\%$ threshold under depolarizing noise as a key performance metric" } ], "emoji": "🧠", "social_summary": "A neural belief-propagation decoder predicts logical operators directly, matching top decoders on surface codes with linear complexity.", "highlights_oneliner": "Linear-time neural decoder for surface codes" }, { "arxiv_id": "2608.27901", "title": "High-Throughput Normalized Min-Sum Belief Propagation Decoding for Quantum LDPC Codes with Near-Memory Processing", "authors": "Jeonggeun Seo, Youngsun Han, Leanghok Hour, Dongmin Kim", "arxiv_url": "https://arxiv.org/abs/2608.27901", "pdf_url": "https://arxiv.org/pdf/2608.27901", "summary": "The authors map normalized Min-Sum BP decoding of the $[[144,12,12]]$ bivariate bicycle qLDPC code onto a DPU-based Processing-in-Memory (PIM) architecture, using 11 tasklets per DPU to decode syndromes in parallel across many DPUs. At $p=0.001$, 2,560 DPUs achieve $1.071\\times10^7$ decodes/s, an $8.8\\times$ throughput improvement over a 16-logical-CPU baseline, with sub-millisecond tail latency suitable for trapped-ion QEC timing constraints.", "motivation": "Real-time QEC decoders must process growing syndrome workloads with predictable low latency, and BP decoding's iterative memory-access pattern creates a bottleneck on conventional CPU architectures. Near-memory computing offers a hardware path to scale qLDPC decoding throughput while meeting strict real-time latency budgets.", "highlights": [ "2,560-DPU configuration reaches $1.071\\times10^7$ decodes/s, an $8.8\\times$ improvement over a 16-CPU baseline", "Measured logical error rate stays below the physical error probability from two BP iterations onward", "Maximum sampled X+Z compute latency stays under 1 ms (about $0.873$ ms at 5 iterations), meeting trapped-ion decoding timing" ], "keywords": [ { "label": "qLDPC Codes", "reason": "Focuses on decoding the $[[144,12,12]]$ bivariate bicycle qLDPC code" }, { "label": "Belief Propagation", "reason": "Uses normalized Min-Sum BP as the decoding algorithm" }, { "label": "Near-Memory Computing", "reason": "Implements decoding on a DPU-based Processing-in-Memory hardware architecture" }, { "label": "Latency", "reason": "Evaluates sub-millisecond tail latency required for real-time trapped-ion QEC" } ], "emoji": "⚡", "social_summary": "Mapping BP decoding of a qLDPC code onto memory-processing hardware achieves near 9x throughput gains with sub-millisecond latency.", "highlights_oneliner": "Near-memory hardware speeds up qLDPC BP decoding" }, { "arxiv_id": "2608.28571", "title": "Learning to Decode Concatenated Quantum Codes with Hierarchical Message Passing", "authors": "Jiahui Wu, Chao Zhang, Zipeng Wu, Shilin Huang", "arxiv_url": "https://arxiv.org/abs/2608.28571", "pdf_url": "https://arxiv.org/pdf/2608.28571", "summary": "The paper presents a neural message-passing decoder for general concatenated stabilizer codes, where soft beliefs propagate bidirectionally across concatenation levels and lightweight neural networks learn only the message aggregation step. On the concatenated $[[15,7,3]]$ quantum Hamming code the decoder nearly doubles the depolarizing pseudo-threshold from $6.5\\%$ to $12.3\\%$ compared to the state-of-the-art bidirectional hard-decision decoder, and on many-hypercube codes a fine-tuned version achieves lower logical-CNOT failure rates than dedicated decoders.", "motivation": "Concatenated codes offer a scalable route to fault tolerance but existing hard-decision hierarchical decoders leave performance on the table by discarding soft information across levels. A learned, generic message-passing framework could unlock better thresholds and extend naturally to non-CSS constructions and circuit-level noise.", "highlights": [ "Depolarizing pseudo-threshold for the $[[15,7,3]]$ concatenated code nearly doubles from $6.5\\%$ to $12.3\\%$", "Fine-tuned decoder for many-hypercube codes beats dedicated decoders on logical-CNOT failure rate under circuit-level noise", "Fixed number of message-passing iterations replaces extensive combinatorial search used by prior decoders" ], "keywords": [ { "label": "Concatenated Codes", "reason": "Decoder is designed specifically for general concatenated stabilizer codes" }, { "label": "Message Passing", "reason": "Core algorithmic technique is hierarchical bidirectional message passing" }, { "label": "Neural Decoders", "reason": "Lightweight neural networks learn message aggregation across levels" }, { "label": "Hypercube Codes", "reason": "Applied to many-hypercube codes with Knill teleportation-based error correction" } ], "emoji": "🔗", "social_summary": "A learned hierarchical message-passing decoder nearly doubles error thresholds for concatenated quantum codes over prior methods.", "highlights_oneliner": "Neural decoder boosts concatenated code thresholds" }, { "arxiv_id": "2608.27568", "title": "Quantifying the Dual-isotope Advantage for Ytterbium-array Surface Codes using Realistic Noise Models", "authors": "Fumiyoshi Kobayashi, Toshi Kusano, Nicholas Fazio, Yuma Nakamura", "arxiv_url": "https://arxiv.org/abs/2608.27568", "pdf_url": "https://arxiv.org/pdf/2608.27568", "summary": "The authors build an experimentally motivated Clifford-compatible noise model for dual-isotope $^{171}$Yb-$^{174}$Yb neutral-atom arrays using generalized Pauli twirling, implemented as an open-source Stim wrapper called DualYbSim. Simulations of rotated and XZZX surface codes show the dual-isotope architecture with in-place ancilla measurement achieves the lowest logical error rates compared to single-isotope shelving or zoned-measurement schemes, with error-budget analysis attributing 74-80% of logical error scaling to Rydberg-state decay.", "motivation": "Neutral-atom platforms are constrained by slow atom transport for syndrome extraction, and dual-species architectures promise constant-time in-place measurement by spectrally separating data and ancilla qubits. Quantifying this advantage with realistic noise models is essential to identify concrete experimental bottlenecks for scaling fault-tolerant quantum computation.", "highlights": [ "Developed DualYbSim, an open-source Stim-compatible noise model for dual-isotope $^{171}$Yb-$^{174}$Yb architectures", "Dual-isotope in-place measurement achieves lowest logical error rates versus shelving or zoned-measurement single-isotope schemes", "Error-budget analysis identifies Rydberg-state decay as dominant, contributing $74$-$80\\%$ of logical error rate scaling" ], "keywords": [ { "label": "Neutral Atoms", "reason": "Focuses on ytterbium neutral-atom array quantum computing platform" }, { "label": "Surface Codes", "reason": "Evaluates rotated and XZZX surface code memories" }, { "label": "Noise Modeling", "reason": "Develops a realistic Clifford-compatible Pauli-twirled noise model via DualYbSim" }, { "label": "Dual-Isotope", "reason": "Central architectural feature separating data and ancilla qubit roles spectrally" } ], "emoji": "🧊", "social_summary": "A realistic noise model shows dual-isotope ytterbium arrays give surface codes lower error rates via in-place ancilla measurement.", "highlights_oneliner": "Dual-isotope atom arrays boost surface code performance" }, { "arxiv_id": "2608.27740", "title": "Error-Adaptive Quasi-local Decoding of the Toric Code", "authors": "Hossein Dehghani, Sarang Gopalakrishnan, Michael Gullans", "arxiv_url": "https://arxiv.org/abs/2608.27740", "pdf_url": "https://arxiv.org/pdf/2608.27740", "summary": "The authors introduce a decoder-level local recoverability diagnostic for the dephased toric code, comparing global MWPM corrections to quasi-local corrections via a matching ratio $R_{\\mathrm{match}}$ and mismatch $\\epsilon_{\\mathrm{match}}=1-R_{\\mathrm{match}}$. Using a two-geometry scaling form, they identify a distance-scaled buffer rule ($a_0=b_0=d/8$) that enables a composite quasi-local RG decoder on the full torus showing a finite-size crossing near $p\\simeq0.09$-$0.10$, below the conventional MWPM threshold scale.", "motivation": "Topological quantum memories require decoders that balance reliability against computational cost, since globally informed decoders like MWPM are accurate but expensive while strictly local rules miss long-range correlations near threshold. Recent recoverability and mixed-state perspectives on noisy quantum memories motivate a principled, geometry-dependent way to design faster local decoders that approach global performance.", "highlights": [ "Defines matching ratio $R_{\\mathrm{match}}$ diagnostic quantifying agreement between local and global (MWPM) decoding decisions", "Two-geometry scaling form organizes mismatch $\\epsilon_{\\mathrm{match}}$ across buffer sizes, revealing a growing recoverability length scale near $p\\sim0.09$", "Tuned composite quasi-local RG decoder with $a_0=b_0=d/8$ shows finite-size crossing at $p\\simeq0.09$-$0.10$ on the full torus" ], "keywords": [ { "label": "Toric Code", "reason": "The dephased toric code is the primary code family studied" }, { "label": "MWPM", "reason": "Global minimum-weight perfect matching serves as the reference decoder for comparison" }, { "label": "Recoverability", "reason": "Central theoretical framework connecting decoding to mixed-state recoverability" }, { "label": "Local Decoders", "reason": "Proposes quasi-local decoding as a scalable alternative to global decoding" } ], "emoji": "🧩", "social_summary": "A new recoverability diagnostic guides a quasi-local decoder for the toric code, approaching global MWPM performance more efficiently.", "highlights_oneliner": "Quasi-local RG decoder tuned via recoverability scaling" }, { "arxiv_id": "2608.28535", "title": "Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware", "authors": "Sumit Chongder", "arxiv_url": "https://arxiv.org/abs/2608.28535", "pdf_url": "https://arxiv.org/pdf/2608.28535", "summary": "This work experimentally studies error mitigation and finite-shot sampling under a fixed execution budget on a 156-qubit IBM Quantum Heron processor, combining calibration-aware qubit selection, zero-noise extrapolation, dynamical decoupling, and readout-error mitigation. It quantifies when mitigation improves mean-squared error versus when finite-shot statistical fluctuations offset mitigation gains, finding mixed and often negative results for adaptive shot-allocation strategies relative to uniform allocation.", "motivation": "Most error-mitigation benchmarks report accuracy gains without accounting for the additional shot budget consumed, leaving unclear whether mitigation actually helps under a realistic fixed measurement budget. Understanding this bias-variance tradeoff is essential for near-term hardware where unlimited sampling is not practical.", "highlights": [ "Adaptive ZNE shot allocation beat uniform allocation at only two of six matched measurement budgets", "Standard ZNE increased bias relative to raw estimation for a bias-sensitive parity observable", "Calibration-aware coupler selection produced accuracy effects comparable to several additional layers of circuit depth" ], "keywords": [ { "label": "Error Mitigation", "reason": "Central technique studied including ZNE, dynamical decoupling, and readout mitigation" }, { "label": "Zero-Noise Extrapolation", "reason": "ZNE and its shot-allocation strategies are a major focus of the experiments" }, { "label": "Shot Budget", "reason": "Paper explicitly studies fixed measurement-shot budgets and sampling tradeoffs" }, { "label": "Superconducting Qubits", "reason": "Experiments run on an IBM Quantum Heron superconducting processor" } ], "emoji": "🎯", "social_summary": "Fixed-budget experiments on IBM hardware reveal error mitigation often fails to beat simple sampling once shot costs are counted.", "highlights_oneliner": "Bias-variance tradeoffs of error mitigation on real hardware" } ] }, "2026-08-28": { "word_cloud": [ { "word": "Overhead", "weight": 5 }, { "word": "Spacetime", "weight": 4 }, { "word": "Expander", "weight": 4 }, { "word": "Decoding", "weight": 4 }, { "word": "LDPC", "weight": 3 }, { "word": "Threshold", "weight": 3 }, { "word": "Rydberg", "weight": 4 }, { "word": "Detuning", "weight": 3 }, { "word": "Echoed", "weight": 2 }, { "word": "Cloud", "weight": 3 }, { "word": "Auditing", "weight": 2 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Encoders", "weight": 2 }, { "word": "Erasure", "weight": 2 }, { "word": "Parallel", "weight": 2 } ], "social_highlights": "Highlights: logarithmic overhead proven unavoidable for fault-tolerant memories, a fast linear-time decoder boosts quantum expander code performance, reseeded random encoders cut cloud fault-injection logical errors by 87%, and echoed Rydberg pulses deliver detuning-robust neutral-atom entangling gates.", "papers": [ { "arxiv_id": "2608.26272", "title": "Fault-tolerant quantum computation cannot be achieved with constant spacetime overhead", "authors": "Kishor Bharti, Tobias Haug, Andrew Tanggara", "arxiv_url": "https://arxiv.org/abs/2608.26272", "pdf_url": "https://arxiv.org/pdf/2608.26272", "summary": "The authors prove that even under optimistic noise models and general adaptive protocols, fault-tolerant preservation of quantum information in a quantum memory incurs an unavoidable logarithmic contribution to the cumulative spacetime overhead. They show this overhead can be amortized across many logical qubits, allowing wide computations like Shor's algorithm to achieve constant relative overhead, and they provide a positive-rate CSS code construction attaining the memory bound along with circuit-size bounds for subsystem spacetime codes.", "motivation": "The threshold theorem established that fault tolerance is possible below a noise threshold, and recent work has driven space and time overheads down to nearly logarithmic scaling, leaving open whether constant spacetime overhead is fundamentally achievable. Resolving this question is critical for understanding the ultimate resource limits of scalable fault-tolerant quantum computers.", "highlights": [ "Proves an unavoidable logarithmic contribution to cumulative spacetime overhead for quantum memory under general adaptive protocols", "Shows the overhead can be shared across many logical qubits, enabling constant relative overhead for wide computations like Shor's algorithm", "Provides a positive-rate CSS code construction attaining the memory bound and circuit-size bounds for subsystem spacetime codes" ], "keywords": [ { "label": "Spacetime Overhead", "reason": "The paper's central subject is proving fundamental lower bounds on combined space and time resources for fault tolerance" }, { "label": "CSS Codes", "reason": "A positive-rate CSS code construction is given that attains the proven memory overhead bound" }, { "label": "Threshold Theorem", "reason": "The result builds on and refines the classical threshold theorem for fault-tolerant quantum computation" }, { "label": "Subsystem Codes", "reason": "Circuit-size bounds are derived for subsystem spacetime codes as part of the analysis" } ], "emoji": "⏳", "social_summary": "Proves that fault-tolerant quantum memories always need a logarithmic spacetime overhead, even in the most optimistic noise scenarios.", "highlights_oneliner": "Fundamental logarithmic limit on fault-tolerance overhead" }, { "arxiv_id": "2608.27211", "title": "The Find Rows and Columns and Decode algorithm for quantum expander codes", "authors": "Dimiter Ostrev", "arxiv_url": "https://arxiv.org/abs/2608.27211", "pdf_url": "https://arxiv.org/pdf/2608.27211", "summary": "This paper introduces the Find Rows and Columns and Decode algorithm, a quantum adaptation of the classical Find Erasures and Decode approach for decoding quantum expander codes. The algorithm runs in linear time and is parallelizable to logarithmic depth, avoiding the overhead of examining subsets of stabilizer generators while requiring less expansion and correcting more errors than Small Set Flip and Small Set Find.", "motivation": "Quantum expander codes, built from hypergraph products of lossless expanders, are attractive LDPC candidates but decoding them efficiently is challenging because small errors can stall simple flip-based decoders. Improving decoding radius and complexity for such codes is essential for practical quantum LDPC-based fault tolerance.", "highlights": [ "Achieves linear-time decoding parallelizable to logarithmic circuit depth", "Attains decoding radius up to a $\\frac{1-3\\delta}{1-2\\delta}$ fraction of the graph's expansion radius for $\\delta<1/3$", "Corrects more errors than Small Set Flip and Small Set Find while avoiding stabilizer-subset overhead" ], "keywords": [ { "label": "Expander Codes", "reason": "The paper's core object of study is quantum expander codes built from hypergraph products of lossless expanders" }, { "label": "Decoding Algorithms", "reason": "Introduces a new decoding algorithm and compares its complexity and radius to existing decoders" }, { "label": "Parallel Decoding", "reason": "The algorithm is shown to be parallelizable to logarithmic depth, relevant for fast fault-tolerant decoding" }, { "label": "LDPC Codes", "reason": "Quantum expander codes are a family of quantum LDPC codes central to the decoding problem addressed" } ], "emoji": "🔗", "social_summary": "Introduces a fast linear-time decoder for quantum expander codes that corrects more errors with less overhead than prior methods.", "highlights_oneliner": "Linear-time decoder improves quantum expander code correction" }, { "arxiv_id": "2608.26600", "title": "Auditing Structured Randomness for Quantum Error Correction under a Bounded Cloud Fault Model", "authors": "Ziqing Guo, Anthony Lawrence, Renyu Wang, Randy Kuang, Ziwen Pan", "arxiv_url": "https://arxiv.org/abs/2608.26600", "pdf_url": "https://arxiv.org/pdf/2608.26600", "summary": "The authors define accepted logical disturbance as an acceptance-weighted measure of harmful logical error and derive its exact Haar-random expectation to audit randomized quantum error correction encoders against fault-injection adversaries in cloud quantum computing settings. They evaluate a polynomial-cost seeded Clifford encoder family via dense linear algebra and stabilizer simulation, showing reseeding reduces mean accepted logical disturbance by 86.7% compared to encoders known in advance to the attacker.", "motivation": "Cloud quantum processors may colocate untrusted workloads with QEC circuits, giving adversaries a fixed, reusable target if the encoder is public and static across runs. This work addresses the gap between exact Haar-random encoders' exponential cost and efficient random ensembles' lack of worst-case corruption guarantees, quantifying the security benefit of per-run reseeding.", "highlights": [ "Reseeding reduces mean accepted logical disturbance from 0.150 to 0.020, an 86.7% reduction, against attackers with prior encoder knowledge", "The fixed distance-three $[[5,1,3]]$ code corrects every tested weight-one Pauli fault", "Only 18.5% of sampled encoders in the selected ensemble achieve exact quantum error correction, highlighting a detection-versus-correction trade-off" ], "keywords": [ { "label": "Cloud QEC", "reason": "The paper specifically targets fault injection risks in cloud-hosted quantum error correction circuits" }, { "label": "Random Encoders", "reason": "Seeded Clifford random encoder ensembles are central to the proposed defense mechanism" }, { "label": "Fault Injection", "reason": "The threat model concerns adversaries injecting faults into shared cloud quantum hardware" }, { "label": "Stabilizer Codes", "reason": "The evaluation uses the $[[5,1,3]]$ stabilizer code and Stim-based stabilizer simulation" } ], "emoji": "🛡️", "social_summary": "Shows that reseeding random quantum encoders slashes accepted logical errors by 87% against cloud-based fault-injection attacks.", "highlights_oneliner": "Auditing randomized QEC encoders against cloud attackers" }, { "arxiv_id": "2608.26446", "title": "Detuning-robust Rydberg entangling gates from echoed pulses", "authors": "Zhubing Jia, Yichao Yu, Xiye Hu, Lintao Li, Jacob Zheng, Christopher Monroe, Jacob P. Covey", "arxiv_url": "https://arxiv.org/abs/2608.26446", "pdf_url": "https://arxiv.org/pdf/2608.26446", "summary": "This work designs Rydberg two-qubit gate pulses that relegate all leading-order detuning errors to single-qubit Z-rotations, which are then removed by an echoed pulse sequence, circumventing the known no-go result that no pulse can make a controlled-Z gate first-order insensitive to detuning. The resulting maximally-entangling ZZ gate maintains infidelity below $10^{-3}$ over a much wider range of single-atom detunings than previous designs, with residual errors dominated by leakage that can be converted into heralded erasures.", "motivation": "Rydberg gate fidelities in neutral atom arrays are currently limited by laser intensity inhomogeneity and detuning errors from frequency miscalibration, field drift, and Doppler shifts, and prior optimal control methods could not remove first-order detuning sensitivity from CZ gates. Overcoming this obstruction reduces demanding hardware requirements on laser stability, field calibration, and atomic temperature, advancing practical fault-tolerant neutral-atom quantum computing.", "highlights": [ "Achieves an entangling ZZ gate with no leading-order response to arbitrary two-atom detuning by echoing away residual Z-rotations", "Maintains infidelity below $10^{-3}$ over a much wider detuning range than prior time-optimal pulse designs", "Shows residual errors are dominated by leakage outside the computational subspace, convertible into heralded erasures" ], "keywords": [ { "label": "Rydberg Gates", "reason": "The paper focuses on two-qubit entangling gates mediated by Rydberg state interactions" }, { "label": "Neutral Atoms", "reason": "The platform under study is neutral atom optical tweezer arrays for quantum computation" }, { "label": "Detuning Robustness", "reason": "The central technical contribution is a pulse design robust to detuning errors on both atoms" }, { "label": "Erasure Conversion", "reason": "Residual leakage errors are shown to be convertible into heralded erasures, aiding fault tolerance" } ], "emoji": "🎯", "social_summary": "Designs echoed Rydberg gate pulses that dodge detuning errors, boosting neutral-atom qubit gate fidelity toward fault tolerance.", "highlights_oneliner": "Echoed pulses make Rydberg gates detuning-robust" } ] }, "2026-08-27": { "word_cloud": [ { "word": "Decoding", "weight": 5 }, { "word": "LDPC", "weight": 4 }, { "word": "Magic", "weight": 5 }, { "word": "Transmon", "weight": 4 }, { "word": "Bosonic", "weight": 3 }, { "word": "Dissipation", "weight": 3 }, { "word": "NoiseBias", "weight": 4 }, { "word": "Readout", "weight": 3 }, { "word": "Leakage", "weight": 3 }, { "word": "TrappedIon", "weight": 2 }, { "word": "ColorCodes", "weight": 2 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Synthesis", "weight": 2 }, { "word": "Certification", "weight": 2 }, { "word": "Geometry", "weight": 2 } ], "social_highlights": "Highlights: single-CPU real-time decoder scales to millions of trapped-ion gates, certified maximum-likelihood decoding for qLDPC codes, efficient sqrt-T magic state preparation cuts synthesis costs, dissipative Fock qubits preserve noise bias, geometric approach to magic in CWS codes, gain-engineered transmon adds noise bias, sub-100ns low-leakage transmon readout achieved.", "papers": [ { "arxiv_id": "2608.25027", "title": "Real-time decoder for a MegaQuOp quantum computer using a single CPU", "authors": "Min Ye, Andrii Maksymov, Nicolas Delfosse", "arxiv_url": "https://arxiv.org/abs/2608.25027", "pdf_url": "https://arxiv.org/pdf/2608.25027", "summary": "The authors present an end-to-end real-time decoding stack for a universal fault-tolerant trapped-ion quantum computer, capable of decoding workloads with millions of logical gates over hundreds of logical qubits. The pipeline generates detector error models on the fly and decodes all logical qubits, logical operations, and magic-state factories on a single CPU.", "motivation": "Real-time decoding at the scale of a MegaQuOp machine executing millions of operations on hundreds of logical qubits has remained an open challenge, with prior work limited to memory blocks or small numbers of logical operations. Solving this is essential to avoid decoding backlogs that would exponentially slow down practical fault-tolerant quantum computation.", "highlights": [ "Demonstrated real-time decoding for up to $408$ logical qubits and one million $T$ gates", "On-the-fly detector error model generation integrated into a streaming decoding pipeline", "Decoding delay under $0.3\\%$ at $p_{\\mathrm{CNOT}}=10^{-4}$ and under $12\\%$ at $p_{\\mathrm{CNOT}}=5\\times10^{-4}$" ], "keywords": [ { "label": "Real-time Decoding", "reason": "The paper's central contribution is a streaming decoder that keeps pace with syndrome generation to avoid backlog." }, { "label": "Trapped-ion", "reason": "The decoding stack is benchmarked on a trapped-ion fault-tolerant quantum computer architecture." }, { "label": "Magic States", "reason": "The decoder handles magic-state factories as part of the universal instruction set." }, { "label": "Detector Error Model", "reason": "On-the-fly DEM generation is a key technical component enabling conditional logical operations." } ], "emoji": "⏱️", "social_summary": "Researchers demonstrate a single-CPU decoder that keeps pace with a trapped-ion quantum computer running millions of logical gates.", "highlights_oneliner": "Single-CPU real-time decoding at MegaQuOp scale" }, { "arxiv_id": "2608.25545", "title": "Certified decoding of quantum LDPC codes", "authors": "Ragavi Krishnamoorthy, Florian Gerhardt, Johannes Knaute, Thomas Klir, Stefan Raimund Maschek, Erik Schulze, Tomislav Maras, Alexander Dotterweich, Loong Kuan Lee, Christian Bauckhage, Nico Piatkowski", "arxiv_url": "https://arxiv.org/abs/2608.25545", "pdf_url": "https://arxiv.org/pdf/2608.25545", "summary": "This work reframes degenerate decoding of qLDPC codes as probabilistic inference in an undirected graphical model, where each logical class's probability is a partition function over a Markov random field generalizing the random-bond Ising mapping. Two decoders are built on this framework: an annealed importance sampling decoder with optimality certificates, and a region-based Bethe free energy decoder that achieves exact maximum-likelihood decoding on surface codes and the $[[72,12,6]]$ bivariate bicycle code.", "motivation": "Degenerate maximum-likelihood decoding of quantum LDPC codes requires comparing entire equivalence classes of errors rather than individual errors, a task the widely-used BP+OSD heuristic sidesteps without offering guarantees. Providing certified, near-optimal decoders is crucial for trusting decoder decisions as qLDPC codes move toward practical fault-tolerant hardware.", "highlights": [ "Certificates of optimality attached to decoding decisions via paired bootstrap tests or exact WISH-based proofs", "Bethe free energy decoder achieves exact ML decoding on all tested surface-code instances at millisecond cost", "Exact degenerate ML decoding made feasible for the $[[72,12,6]]$ bivariate bicycle code using elimination clusters" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The paper targets decoding of quantum low-density parity-check codes including bivariate bicycle codes." }, { "label": "Maximum Likelihood", "reason": "The central goal is achieving certified or exact degenerate ML decoding." }, { "label": "Graphical Models", "reason": "Decoding is framed as probabilistic inference over Markov random fields." }, { "label": "Circuit-level Noise", "reason": "Decoders are tested under code-capacity, phenomenological, and circuit-level noise including spacetime decoding." } ], "emoji": "🧮", "social_summary": "New decoders for quantum LDPC codes attach certificates of optimality, achieving exact maximum-likelihood decoding on key benchmark codes.", "highlights_oneliner": "Certified, near-exact decoding for qLDPC codes" }, { "arxiv_id": "2608.25797", "title": "Fault-tolerant $|\\sqrt{ \\mathrm{T} }\\rangle$ state preparation and injection for more efficient fine-grained quantum circuit synthesis", "authors": "Berat Yenilen, Markus Müller, Manuel Rispler", "arxiv_url": "https://arxiv.org/abs/2608.25797", "pdf_url": "https://arxiv.org/pdf/2608.25797", "summary": "The authors introduce flag fault-tolerant protocols for preparing logical $|\\sqrt{\\mathrm{T}}\\rangle$ magic states on the 3D tetrahedral color code and a smaller morphed variant, verifying fault tolerance and quantifying logical error rates under circuit-level noise. They further reconstruct effective logical channels via process tomography and show synthesis of Haar-random single-qubit unitaries is $20$-$30\\%$ cheaper in space-time cost than with the standard Clifford+$T$ gate set.", "motivation": "Magic-state injection with the Clifford+$T$ gate set is the standard route to universal fault-tolerant quantum computation, but expanding the non-Clifford gate set could reduce compilation overhead if new states can be prepared fault-tolerantly at competitive cost. This work explores whether adding $\\sqrt{\\mathrm{T}}$ as a primitive broadens the design space for more efficient early fault-tolerant quantum computing.", "highlights": [ "Flag fault-tolerant preparation of $|\\sqrt{\\mathrm{T}}\\rangle$ states on 3D tetrahedral color codes verified under circuit-level noise", "Logical process tomography reconstructs effective logical channels for gate injection", "$20$-$30\\%$ reduction in average space-time synthesis cost compared to Clifford+$T$" ], "keywords": [ { "label": "Magic States", "reason": "The paper focuses on fault-tolerant preparation and injection of a new type of magic state." }, { "label": "Color Codes", "reason": "State preparation protocols are developed on the 3D tetrahedral color code." }, { "label": "Gate Synthesis", "reason": "The work evaluates efficiency gains for compiling Haar-random single-qubit unitaries." }, { "label": "Flag Qubits", "reason": "Fault tolerance is achieved using flag-based verification circuits." } ], "emoji": "✨", "social_summary": "New fault-tolerant recipe for preparing square-root-of-T magic states cuts quantum circuit synthesis costs by up to 30 percent.", "highlights_oneliner": "Fault-tolerant sqrt(T) states cut synthesis cost" }, { "arxiv_id": "2608.25959", "title": "Dissipatively Stabilized 0-n Fock Qubits for Noise-Biased Quantum Computing", "authors": "Su Direkci, Simon Lieu, Kyungjoo Noh, Connor T. Hann", "arxiv_url": "https://arxiv.org/abs/2608.25959", "pdf_url": "https://arxiv.org/pdf/2608.25959", "summary": "The authors propose a '0-n' Fock qubit architecture that encodes information in the ground and $n$-th excited states of a nonlinear multi-level system such as a transmon, stabilized via dissipative engineering that acts as decay and gain on intermediate levels. They analytically and numerically show exponential suppression of bit-flip errors with $n$, demonstrating bit-flip probabilities near $10^{-8}$ for controlled-X gates with $n\\geq9$ and megaquop-regime logical error rates in a repetition code at distance $d=9$.", "motivation": "Noise-biased qubits promise fault-tolerant quantum computing with reduced overhead, but this bias is often compromised during entangling gates with non-biased ancilla qubits like transmons. This work seeks a hardware-efficient alternative to cat qubits that preserves noise bias using standard multi-level anharmonic oscillators.", "highlights": [ "Bit-flip errors shown to be exponentially suppressed with the number of levels $n$", "Practical implementation using a multi-mode lossy filter for frequency-selective dissipation", "Bit-flip probabilities approaching $10^{-8}$ for CX gates on cat qubits with $n\\geq 9$ levels" ], "keywords": [ { "label": "Noise Bias", "reason": "The central goal is preserving exponential bias between bit-flip and phase-flip errors." }, { "label": "Bosonic Codes", "reason": "The 0-n Fock qubit is a bosonic-style encoding on a nonlinear multi-level system." }, { "label": "Dissipative Stabilization", "reason": "The encoding relies on engineered decay and gain dissipation to protect the logical manifold." }, { "label": "Repetition Code", "reason": "Syndrome extraction and logical error rates are simulated in a repetition code with distance $d=9$." } ], "emoji": "🌀", "social_summary": "New Fock-state qubit design uses engineered dissipation to preserve noise bias for more efficient fault-tolerant quantum error correction.", "highlights_oneliner": "Noise-biased Fock qubits via engineered dissipation" }, { "arxiv_id": "2608.25414", "title": "Affine-Profile Stabilizer Thresholds for Magic in Codeword-Stabilized Quantum Codes", "authors": "Li-Yi Hsu, En-Jui Kuo", "arxiv_url": "https://arxiv.org/abs/2608.25414", "pdf_url": "https://arxiv.org/pdf/2608.25414", "summary": "The authors develop a CWS-adapted magic-witness framework that isolates codeword coherence in codeword-stabilized quantum codes and converts it into certified lower bounds on robustness of magic. The main result reduces the stabilizer threshold of a CWS coherence witness to a finite-geometric affine-intersection problem over the classical CWS word set, yielding a fixed-parameter algorithm and exact rational certificates for standard nonadditive CWS codes.", "motivation": "Magic is a key resource for universal fault-tolerant quantum computation beyond the efficiently-simulable stabilizer formalism, but exact robustness-of-magic computation is a costly linear program over all stabilizer states. Codeword-stabilized codes unify stabilizer and nonadditive codes, motivating a tractable combinatorial approach to certifying their magic.", "highlights": [ "Exact reduction of stabilizer thresholds to a finite-geometric affine-intersection problem", "Equal-weight superpositions reduce to counting CWS words lying in affine flats of each dimension", "Exact rational certificates obtained for several standard nonadditive CWS code examples" ], "keywords": [ { "label": "CWS Codes", "reason": "The paper's framework is built specifically for codeword-stabilized quantum codes." }, { "label": "Magic States", "reason": "Robustness of magic and stabilizer thresholds are the quantities being certified." }, { "label": "Nonadditive Codes", "reason": "The work applies to nonadditive CWS codes beyond standard stabilizer codes." }, { "label": "Finite Geometry", "reason": "The threshold computation reduces to an affine-incidence problem in finite geometry." } ], "emoji": "📐", "social_summary": "Researchers turn a quantum magic-certification problem into a classical geometry puzzle for codeword-stabilized quantum codes.", "highlights_oneliner": "Geometric certificates for magic in CWS codes" }, { "arxiv_id": "2608.26018", "title": "The Gain-Engineered Transmon", "authors": "Ian Yang, Francesco Adinolfi, Alessandro Bruno, Venus Hasanuzzaman Kamrul, Daniel Z. Haxell, Alexander Grimm", "arxiv_url": "https://arxiv.org/abs/2608.26018", "pdf_url": "https://arxiv.org/pdf/2608.26018", "summary": "The authors experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit by adding a single microwave tone, encoding the qubit in the $|\\mathrm{g}\\rangle$ and $|\\mathrm{f}\\rangle$ states and engineering frequency-selective gain to counteract single-photon loss. They demonstrate an order-of-magnitude enhancement in relaxation time relative to $|\\mathrm{g}\\rangle$-$|\\mathrm{e}\\rangle$ encoding while retaining compatibility with fast, high-fidelity operations.", "motivation": "Engineering noise bias typically requires added hardware complexity that limits scalability, yet biased-noise qubits can substantially reduce the overhead of error correction codes. This work seeks a minimal, hardware-efficient modification to the ubiquitous transmon architecture that achieves noise bias without sacrificing scalability.", "highlights": [ "Order-of-magnitude enhancement in relaxation time versus $|\\mathrm{g}\\rangle$-$|\\mathrm{e}\\rangle$ encoding", "Only a factor-of-two decrease in echo-coherence time despite the gain engineering", "Demonstrated compatibility with fast, high-fidelity operations and improved error-detection performance for binomial, cat, and GKP encodings" ], "keywords": [ { "label": "Noise Bias", "reason": "The paper engineers a dominant error channel in a standard transmon circuit." }, { "label": "Transmon", "reason": "The gain engineering is implemented directly on a standard transmon-readout resonator circuit." }, { "label": "Error Detection", "reason": "The qubit is evaluated as an ancilla for binomial, cat, and GKP code error detection." }, { "label": "Gain Engineering", "reason": "A frequency-selective gain channel is the core mechanism suppressing relaxation errors." } ], "emoji": "🔧", "social_summary": "Scientists add a single microwave tone to a standard transmon circuit to engineer noise bias for hardware-efficient error correction.", "highlights_oneliner": "Simple microwave trick gives transmons noise bias" }, { "arxiv_id": "2608.25484", "title": "Low-leakage superconducting-qubit measurement with sub-100-ns total duration", "authors": "Peter A. Spring, Adrian L. Hesse, Shiyu Wang, Shuhei Tamate, Yasunobu Nakamura", "arxiv_url": "https://arxiv.org/abs/2608.25484", "pdf_url": "https://arxiv.org/pdf/2608.25484", "summary": "The authors demonstrate dispersive readout of a superconducting transmon qubit with a total duration of $97(1)$ ns, combining a large effective resonator decay rate of $\\kappa_{\\mathrm{eff}}/2\\pi=30.8$ MHz with a near-optimal dispersive shift to achieve an assignment error of $0.17(1)\\%$. Using a leakage-sensitive repeated-measurement sequence, they measure a per-measurement leakage rate of $2.7(2)\\times10^{-5}$, only twice the background rate, supported by Floquet simulations showing weakly-coupled multiphoton resonances traversed diabatically.", "motivation": "Fast, accurate, low-leakage measurement is essential for quantum error correction, since idle qubits decohere during measurement while slow, error-prone readout has historically lagged behind gate fidelities in superconducting processors. This work addresses whether small qubit-resonator detuning, typically associated with dense leakage-inducing resonances, can still achieve fast high-fidelity readout without active depletion.", "highlights": [ "Total measurement duration of $97(1)$ ns including ring-down before high-fidelity operations resume", "Assignment error of $0.17(1)\\%$ achieved with only a $58$-ns measurement pulse", "Per-measurement leakage rate of $2.7(2)\\times10^{-5}$, just twice the background leakage rate" ], "keywords": [ { "label": "Dispersive Readout", "reason": "The paper's core technique is dispersive measurement of a transmon qubit via a readout resonator." }, { "label": "Leakage", "reason": "Measurement-induced state transitions and leakage rates are directly quantified and minimized." }, { "label": "Fast Readout", "reason": "Achieving sub-100-ns total measurement duration is the paper's headline result." }, { "label": "Transmon", "reason": "Experiments are performed on a standard transmon-readout resonator circuit." } ], "emoji": "📡", "social_summary": "Physicists achieve sub-100-nanosecond, low-leakage qubit readout, a crucial speedup for practical quantum error correction.", "highlights_oneliner": "Sub-100-ns low-leakage qubit readout demonstrated" } ] }, "2026-08-26": { "word_cloud": [ { "word": "Transversal", "weight": 5 }, { "word": "Magic", "weight": 5 }, { "word": "Entanglement", "weight": 4 }, { "word": "Lattice", "weight": 4 }, { "word": "Surgery", "weight": 4 }, { "word": "Compiler", "weight": 3 }, { "word": "ReedMuller", "weight": 3 }, { "word": "Teleportation", "weight": 3 }, { "word": "Distance", "weight": 3 }, { "word": "CSS", "weight": 2 }, { "word": "Circuits", "weight": 3 }, { "word": "Allocation", "weight": 2 }, { "word": "Resource", "weight": 3 }, { "word": "Rate", "weight": 2 }, { "word": "Stim", "weight": 2 } ], "social_highlights": "Highlights: new transversal-T codes achieve constant rate with growing distance, CircLS compiler slashes lattice surgery error rates fourteenfold via dynamic allocation, and a unified resource theory reveals magic states can teleport without entanglement.", "papers": [ { "arxiv_id": "2608.24000", "title": "Improved Quantum Codes with Transversal T Gates", "authors": "Adam Wills", "arxiv_url": "https://arxiv.org/abs/2608.24000", "pdf_url": "https://arxiv.org/pdf/2608.24000", "summary": "This work presents new families of quantum CSS codes with strongly transversal $T$ gates, significantly improving upon the parameters achieved by Hastings-Haah since 2017-2018. The author develops a framework of divisible decreasing monomial codes, punctured at downward-closed sets on the Boolean hypercube, to construct codes with either improved polynomial rate-distance tradeoffs or, for the first time, constant rate with growing distance. These constructions also achieve the overhead exponent $\\gamma \\to 0$ for magic state distillation, a first for codes with transversal $T$ gates.", "motivation": "Transversal $T$ gates are highly desirable for fault-tolerant quantum computation since they avoid costly magic state distillation overhead, but progress on the achievable code parameters had stalled since 2017-2018. Improving these parameters, especially achieving constant rate with growing distance, directly reduces the resource overhead required for universal fault-tolerant quantum computing.", "highlights": [ "First construction of constant-rate codes with growing distance and transversal $T$ gates", "Closed-form expression derived for the distance of codes punctured at downward-closed sets", "Achieves $\\gamma \\to 0$ overhead exponent for magic state distillation, a first for transversal $T$ codes" ], "keywords": [ { "label": "Transversal Gates", "reason": "The paper focuses on constructing codes where physical $T$ gates implement logical $T$ gates without Clifford corrections." }, { "label": "CSS Codes", "reason": "The constructions are built within the framework of quantum CSS codes." }, { "label": "Reed-Muller Codes", "reason": "Weighted Reed-Muller codes are used as an explicit instantiation of the divisible decreasing monomial code framework." }, { "label": "Magic States", "reason": "The work improves the magic state distillation overhead exponent $\\gamma$ achievable by transversal $T$ codes." } ], "emoji": "✨", "social_summary": "Introduces new quantum codes with transversal T gates that achieve constant rate and growing distance for the first time.", "highlights_oneliner": "New code family boosts transversal T-gate parameters" }, { "arxiv_id": "2608.23819", "title": "CircLS: Compiling Lattice Surgery to Physical Circuits with Dynamic Allocation", "authors": "John Yuehan Zhang", "arxiv_url": "https://arxiv.org/abs/2608.23819", "pdf_url": "https://arxiv.org/pdf/2608.23819", "summary": "CircLS is a compiler that lowers Pauli product measurement (PPM) sequences from lattice surgery to physical Stim circuits via linear-time stabilizer construction rules, completing the pipeline from quantum programs to verifiable, fault-tolerant physical circuits. The compiler additionally introduces dynamic data patch allocation, freeing tiles for reuse as ancilla paths once patches are no longer needed. This reduces allocated spacetime volume by $5.5\\times$ and logical error rate by $14\\times$ compared to prior toolchains producing runnable circuits.", "motivation": "Existing PPM-based lattice surgery compilers operate only at the logical level, leaving the complex and fault-tolerance-critical lowering to physical circuits largely unaddressed, which prevents accurate logical error rate estimation. Bridging this gap is essential for evaluating and optimizing real fault-tolerant quantum programs at the circuit level rather than relying on theoretical logical-level abstractions.", "highlights": [ "Completes the pipeline from quantum program to PPM sequence to verifiable Stim circuit via linear-time stabilizer construction", "Dynamic patch allocation reduces spacetime volume by $5.5\\times$ and logical error rate by $14\\times$", "Shows untested LER formulas can deviate from sampled LER by up to $6.8\\times$" ], "keywords": [ { "label": "Lattice Surgery", "reason": "The paper's core subject is compiling lattice surgery operations to physical circuits." }, { "label": "Stim Circuits", "reason": "CircLS lowers PPM sequences into Stim circuits for simulation and verification." }, { "label": "Fault Tolerance", "reason": "The compilation must preserve code distance to maintain fault tolerance during PPM realization." }, { "label": "Compilers", "reason": "The paper develops a compiler pipeline with dynamic resource allocation for quantum programs." } ], "emoji": "🧩", "social_summary": "Builds a compiler that turns lattice surgery instructions into physical circuits, cutting error rates fourteenfold with dynamic qubit allocation.", "highlights_oneliner": "Compiler lowers lattice surgery to verified physical circuits" }, { "arxiv_id": "2608.24299", "title": "Distributed Resource Theory of Entanglement and Magic", "authors": "Xiao Yuan, Wenhao Zhang, Qiming Ding, You Zhou", "arxiv_url": "https://arxiv.org/abs/2608.24299", "pdf_url": "https://arxiv.org/pdf/2608.24299", "summary": "The authors introduce the distributed resource theory of entanglement and magic (DREAM), where free states are convex mixtures of product local stabilizer states and free operations are local stabilizer circuits assisted by classical communication (LSCC). They show DREAM contains nontrivial resource states that are neither pure entanglement nor pure magic, enabling magic state teleportation between distant parties without consuming entanglement. The framework is generalized to quantum networks, linking shared DREAM resources to teleportation capability quantified by the magic of the teleported state.", "motivation": "Entanglement and magic are typically treated as separate resource currencies for quantum communication and fault-tolerant computation respectively, but distributed fault-tolerant quantum computing requires understanding how these resources interact. Unifying them into a single resource theory reveals previously hidden relationships and enables new protocols, such as teleporting magic without entanglement, that isolated resource theories cannot capture.", "highlights": [ "DREAM identifies resource states that are neither entanglement nor magic under LSCC free operations", "Demonstrates teleportation of magic states between parties using only separable states, without consuming entanglement", "Generalizes results to quantum networks, linking shared resources to teleportation capability via magic of the teleported state" ], "keywords": [ { "label": "Resource Theory", "reason": "The paper builds a unified resource-theoretic framework, DREAM, combining entanglement and magic." }, { "label": "Magic States", "reason": "Magic is one of the two core resources studied and teleported in the framework." }, { "label": "Entanglement", "reason": "Entanglement is the other core resource, and its role relative to magic teleportation is a central question." }, { "label": "Quantum Teleportation", "reason": "The paper studies teleportation of magic states and general quantum states under LSCC operations." } ], "emoji": "🔗", "social_summary": "Unifies entanglement and magic into one resource theory, showing magic states can be teleported without using any entanglement.", "highlights_oneliner": "Unified theory teleports magic without entanglement" } ] }, "2026-08-25": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "Distributed", "weight": 3 }, { "word": "SAT", "weight": 3 }, { "word": "Stabilizer", "weight": 4 }, { "word": "Magic", "weight": 4 }, { "word": "CWS", "weight": 2 }, { "word": "Metrology", "weight": 3 }, { "word": "Entanglement", "weight": 3 }, { "word": "Vertex-Minors", "weight": 2 }, { "word": "ZX-Calculus", "weight": 4 }, { "word": "Clifford", "weight": 3 }, { "word": "Mitigation", "weight": 3 }, { "word": "Tweezer", "weight": 2 }, { "word": "Lattice", "weight": 2 }, { "word": "Sidon", "weight": 2 } ], "social_highlights": "Highlights: molecular tweezer surface codes cut qubit counts, distributed superconducting chips scale to RSA-2048, SAT solvers auto-design biased-noise codes, Sidon sets pinpoint maximal magic in CWS codes, symmetry boosts QEC metrology to Heisenberg limits, vertex-minor theory bounds stabilizer entanglement, ZX-calculus barrier limits T-count reduction on synthesized circuits, ZX benchmarks trim Solovay-Kitaev T-gates, physics-guided linear model mitigates errors with less data.", "papers": [ { "arxiv_id": "2608.21961", "title": "Surface-Code Quantum Error Correction for Molecular Tweezer Arrays: Encoding, Layout, and Correlated Noise", "authors": "Niharika Verma, Utpal Roy", "arxiv_url": "https://arxiv.org/abs/2608.21961", "pdf_url": "https://arxiv.org/pdf/2608.21961", "summary": "This work maps molecular tweezer arrays onto rotated surface codes, showing that the array's molecular groupings and spatial layout jointly determine correlated erasure structure and dipolar exchange noise. Comparing rotational qudit encodings with dimension $D=2$ and $D=4$ under heralded loss, coherent exchange, and imperfect heralding reveals that a $D=4$ encoding with dispersed pairing matches $D=2$'s error threshold using $48$-$49\\%$ fewer molecules, at a $6$-$10\\%$ sub-threshold error cost.", "motivation": "Polar molecules in optical tweezers are an emerging qubit platform with strong dipolar interactions, but how their unique correlated-loss and exchange-noise structure interacts with surface-code decoding was previously unexplored. Understanding this mapping is essential for designing scalable, fault-tolerant molecular quantum architectures.", "highlights": [ "$D=4$ qudit encoding matches $D=2$ error threshold with $48$-$49\\%$ fewer molecules", "Spatial embedding choice creates a $\\sim50\\times$ logical-sector error asymmetry", "Pauli twirling of dipolar exchange overestimates logical error due to excitation-conserving structure" ], "keywords": [ { "label": "Surface Codes", "reason": "Central error-correcting code architecture studied via rotated surface code mapping" }, { "label": "Molecular Qubits", "reason": "Platform of polar molecules in optical tweezer arrays used as physical hardware" }, { "label": "Correlated Erasure", "reason": "Molecular loss induces spatially correlated erasure errors central to the analysis" }, { "label": "Qudit Encoding", "reason": "Comparison of rotational manifold dimensions $D=2$ and $D=4$ for encoding" } ], "emoji": "🧬", "social_summary": "Shows how molecule placement in tweezer arrays reshapes surface-code errors, enabling fewer molecules for the same performance.", "highlights_oneliner": "Molecular tweezer layout shapes surface-code error correction" }, { "arxiv_id": "2608.23159", "title": "Taming Spacetime Overhead and Design Complexity in Distributed Fault-Tolerant Superconducting Quantum Computation", "authors": "Qinjing Yu, Ke Liu", "arxiv_url": "https://arxiv.org/abs/2608.23159", "pdf_url": "https://arxiv.org/pdf/2608.23159", "summary": "The authors present a hardware-grounded co-design and resource-estimation protocol for distributed surface-code architectures built from multiple superconducting quantum processing units, confining noisy inter-chip operations to module boundaries. Using RSA-2048 factorization as a benchmark, they show the distributed design incurs only modest overhead compared to a monolithic baseline, with overhead nearly scale-invariant across a wide range of module capacities.", "motivation": "Scaling fault-tolerant quantum computers to millions of physical qubits is infeasible on a single monolithic chip, motivating distributed architectures, but it was unclear whether slow, noisy inter-chip links would impose prohibitive spacetime overhead. This work provides a rigorous, hardware-anchored assessment answering that question for utility-scale algorithms.", "highlights": [ "Distributed architecture adds only modest resource overhead versus an ideal monolithic baseline for RSA-2048", "Overhead is nearly scale-invariant across a broad module-capacity window", "Runtime is dominated by inter-chip lattice surgery layers, e.g. $242$ vs $9$ rounds for CCZ cultivation" ], "keywords": [ { "label": "Distributed QC", "reason": "Focuses on multi-chip modular quantum computing architectures" }, { "label": "Surface Codes", "reason": "Resource estimation is based on surface-code-based modular processors" }, { "label": "Lattice Surgery", "reason": "Inter-chip logical operations implemented via lattice surgery are analyzed in detail" }, { "label": "Resource Estimation", "reason": "Comprehensive protocol estimates qubit count and runtime for RSA-2048 factorization" } ], "emoji": "🔗", "social_summary": "Finds distributed superconducting quantum chips can scale to break RSA-2048 with only modest extra overhead versus one giant chip.", "highlights_oneliner": "Distributed superconducting QEC scales without heavy overhead" }, { "arxiv_id": "2608.23460", "title": "Satisfying Quantum Codes: Physics-Informed and Hardware-Aware Code Design with SAT Solvers", "authors": "Ben DalFavero, William M. Watkins, Margarite L. LaBorde, Vincent Russo, Ethan Egger, Gregory Quiroz, Ryan LaRose", "arxiv_url": "https://arxiv.org/abs/2608.23460", "pdf_url": "https://arxiv.org/pdf/2608.23460", "summary": "This work formulates quantum error correction code design as a Boolean satisfiability (SAT) problem, proving the underlying design task is NP-complete while demonstrating that modern SAT solvers can nonetheless design practical codes. The authors construct physics-inspired codes with up to $100$ physical qubits in minutes and new hardware-aware codes tailored to biased noise that outperform state-of-the-art surface codes in logical error rate.", "motivation": "Quantum code design has historically been a manual, ad hoc process disconnected from specific problem or hardware noise constraints, with little improvement over the surface code in decades. Automating code discovery via computational search could unlock codes tailored to real device noise profiles and application-specific symmetries.", "highlights": [ "Proves quantum code design is NP-complete, ruling out general efficient algorithms", "SAT solvers design physics-inspired codes with up to $100$ physical qubits in minutes", "New hardware-aware codes for biased noise achieve lower logical error rates than surface codes" ], "keywords": [ { "label": "SAT Solvers", "reason": "Core methodology casting code design as a Boolean satisfiability problem" }, { "label": "NP-Completeness", "reason": "Complexity-theoretic result proven for the quantum code design problem" }, { "label": "Biased Noise", "reason": "Hardware-aware codes are designed specifically for biased noise channels" }, { "label": "Code Design", "reason": "Overall framework automates discovery of physics-inspired and hardware-tailored quantum codes" } ], "emoji": "🧩", "social_summary": "Turns quantum code design into a SAT problem, letting solvers automatically discover codes that beat surface codes under biased noise.", "highlights_oneliner": "SAT solvers automate quantum code discovery" }, { "arxiv_id": "2608.22017", "title": "Quantifying Nonstabilizerness of Codeword-Stabilized Codes", "authors": "Yuan Liu, Ke-Mi Xu", "arxiv_url": "https://arxiv.org/abs/2608.22017", "pdf_url": "https://arxiv.org/pdf/2608.22017", "summary": "The authors develop a quantitative theory of nonstabilizerness (magic) for codeword-stabilized (CWS) codes, showing that it is determined entirely by a classical additive-combinatorics quantity: how codewords collide under translation. They prove the most magical codes correspond to Sidon sets, that no code carries more than twice its logical qubit count in nonstabilizerness, and derive closed-form values for Kerdock codes plus bounds relating nonstabilizerness to transversal non-Clifford gates.", "motivation": "Fault-tolerant quantum computation requires non-Clifford resources that stabilizer codes cannot provide transversally, yet prior to this work there was no quantitative framework for measuring the magic inherent in non-stabilizer codes. Establishing such a theory turns the search for magic-rich codes and transversal gates into tractable classical combinatorial problems.", "highlights": [ "Nonstabilizerness of CWS codes is exactly fixed by a classical difference-set multiplicity function", "Sidon sets achieve maximal nonstabilizerness, bounded by twice the number of logical qubits", "Closed-form nonstabilizerness values obtained for the Kerdock code family" ], "keywords": [ { "label": "Magic States", "reason": "Paper quantifies nonstabilizerness, the resource underlying magic states" }, { "label": "CWS Codes", "reason": "Codeword-stabilized codes are the specific code family analyzed" }, { "label": "Additive Combinatorics", "reason": "Sidon sets and difference-set structures from additive combinatorics underpin the results" }, { "label": "Transversal Gates", "reason": "Results bound non-Clifford transversal gates achievable by a code" } ], "emoji": "✨", "social_summary": "Reveals that a code's magic is governed by simple classical counting of codeword collisions, pinpointing Sidon sets as maximally magical.", "highlights_oneliner": "Classical combinatorics quantifies quantum code magic" }, { "arxiv_id": "2608.21842", "title": "Noise-Symmetry Optimization of Quantum Error-Corrected Metrology", "authors": "Shuyun Su, Shengshi Pang", "arxiv_url": "https://arxiv.org/abs/2608.21842", "pdf_url": "https://arxiv.org/pdf/2608.21842", "summary": "This paper shows that the Knill-Laflamme conditions admit an equivalence class of encodings for a fixed correctable error set, and when the noise possesses unitary symmetries these symmetries generate continuous transformations that can be exploited to boost quantum Fisher information while preserving error correctability. A symmetry-based optimization framework is developed, with criteria for when it enhances sensitivity, demonstrating that for stabilizer-sum Hamiltonians it can convert a vanishing-QFI code into one reaching the standard quantum limit or even Heisenberg scaling.", "motivation": "Quantum error correction is known to protect quantum-enhanced metrology from noise, but merely correcting errors does not guarantee the encoded state remains sensitive to the parameter being estimated. This work addresses that gap by identifying an unexploited encoding freedom that can be systematically optimized for sensitivity without sacrificing error-correcting capability.", "highlights": [ "Identifies a continuous equivalence class of QEC encodings preserved under unitary noise symmetries", "Develops criteria for when symmetry-based optimization enhances quantum Fisher information", "Shows symmetry optimization can turn vanishing-QFI codes into ones achieving standard quantum limit or Heisenberg scaling" ], "keywords": [ { "label": "Quantum Metrology", "reason": "Central application is enhancing sensitivity of parameter estimation with QEC" }, { "label": "Knill-Laflamme", "reason": "Encoding equivalence class derived directly from Knill-Laflamme conditions" }, { "label": "Fisher Information", "reason": "Quantum Fisher information is the metric optimized to gauge sensitivity" }, { "label": "Symmetry", "reason": "Unitary noise symmetries are exploited to generate optimization transformations" } ], "emoji": "🎯", "social_summary": "Shows how exploiting hidden symmetries in error-correcting codes can boost quantum sensor precision up to Heisenberg scaling.", "highlights_oneliner": "Symmetry tricks boost QEC-protected metrology sensitivity" }, { "arxiv_id": "2608.21526", "title": "Asymptotic entanglement in circle stabilizer states and states forbidding arbitrary vertex-minors", "authors": "Kenneth Goodenough, Marcelo Sales", "arxiv_url": "https://arxiv.org/abs/2608.21526", "pdf_url": "https://arxiv.org/pdf/2608.21526", "summary": "This work studies when a stabilizer state can be transformed into another via single-qubit Clifford operations and Pauli measurements (vertex-minor relations), establishing that, assuming Geelen's weak structural conjecture, entanglement in stabilizer states avoiding a fixed vertex-minor is asymptotically constrained. The authors show the distance of sufficiently rank-connected such states grows as $O(\\log n)$ and derive analogous bounds for locally accessible information, using connections to rank functions of multimatroids and 4-regular multigraphs.", "motivation": "Understanding the entanglement structure of stabilizer states is a long-standing question in quantum information theory, particularly regarding how local Clifford operations and measurements can interconvert stabilizer states. This work connects that structural question to graph-minor theory, offering new asymptotic bounds relevant to entanglement generation in real quantum devices.", "highlights": [ "Distance of vertex-minor-forbidding stabilizer states grows only as $O(\\log n)$", "Locally accessible information satisfies matching $\\Omega(n/\\log n)$ bounds under Geelen's conjecture", "Establishes link between rank functions of multimatroids and entanglement in circle stabilizer states" ], "keywords": [ { "label": "Stabilizer States", "reason": "The paper's central objects are stabilizer states and their entanglement" }, { "label": "Vertex-Minors", "reason": "Forbidden vertex-minor structure is the key combinatorial tool used" }, { "label": "Matroid Theory", "reason": "Multimatroid rank functions connect entanglement to graph theory" }, { "label": "Code Distance", "reason": "Asymptotic scaling of code distance is a main quantitative result" } ], "emoji": "🕸️", "social_summary": "Links entanglement limits of stabilizer states to graph-minor theory, showing distance grows only logarithmically under structural constraints.", "highlights_oneliner": "Graph-minor theory bounds stabilizer state entanglement" }, { "arxiv_id": "2608.22801", "title": "An Exactness Barrier for ZX-Calculus Optimization of Synthesized Clifford+T Circuits", "authors": "Chon-Fai Kam, Anuradha Mahasinghe, Kaushika De Silva, Frédéric Cadet, Jingbo Wang", "arxiv_url": "https://arxiv.org/abs/2608.22801", "pdf_url": "https://arxiv.org/pdf/2608.22801", "summary": "This paper proves a single bound explaining why ZX-calculus optimization removes a stable fraction of gates from Solovay-Kitaev circuits but almost nothing from number-theoretically synthesized circuits: the achievable $T$-count for any exactness-preserving optimizer is bounded below by the denominator exponent of the synthesized ring element. The authors derive a depth-independent limit law for Solovay-Kitaev circuits via a free-product normal form connection, and show rigidity certificates proving $99.4$-$99.9\\%$ of synthesized $T$-count is incompressible for the quantum-Shannon-decomposition plus gridsynth pipeline.", "motivation": "Gate synthesis and circuit optimization are typically studied in isolation, and conflicting empirical evidence about how much ZX-calculus rewriting can compress synthesized circuits had lacked a unifying explanation. This work resolves that contradiction with a rigorous exactness barrier, clarifying fundamental limits on $T$-count reduction for exact post-processing methods.", "highlights": [ "Proves a denominator-exponent lower bound on achievable $T$-count for exactness-preserving optimizers", "Shows the exactness barrier separates a $101\\times$ certified factor gap at recursion depth five", "Certifies $99.4$-$99.9\\%$ of synthesized $T$-count as incompressible on the quantum-Shannon-decomposition plus gridsynth pipeline" ], "keywords": [ { "label": "ZX-Calculus", "reason": "Diagrammatic rewriting formalism used for circuit optimization analysis" }, { "label": "T-count", "reason": "Key resource metric bounded by the proven exactness barrier" }, { "label": "Solovay-Kitaev", "reason": "Gate synthesis algorithm whose circuits are analyzed for compressibility" }, { "label": "Gate Synthesis", "reason": "Number-theoretic synthesis methods like gridsynth are central to the study" } ], "emoji": "🚧", "social_summary": "Proves a fundamental barrier showing why ZX-calculus can shrink Solovay-Kitaev circuits but barely touches number-theoretically synthesized ones.", "highlights_oneliner": "A proven limit on ZX-calculus circuit compression" }, { "arxiv_id": "2608.22810", "title": "Numerical Evaluation of ZX Calculus Optimization for Solovay Kitaev Quantum Circuit Synthesis", "authors": "Dulari De Silva, Anuradha Mahasinghe, Chon-Fai Kam, Kaushika De Silva, Frederic Cadet, Jingbo Wang", "arxiv_url": "https://arxiv.org/abs/2608.22810", "pdf_url": "https://arxiv.org/pdf/2608.22810", "summary": "The authors numerically measure how much diagrammatic ZX-calculus post-processing can compress Solovay-Kitaev synthesized Clifford+T circuits, testing $1200$ random single-qubit targets across three recursion depths. Automated rewriting removes $26.6$-$30.1\\%$ of total gate count and $18.5$-$22.2\\%$ of $T$-count, with absolute savings growing with depth while fractional savings plateau and compile-time cost of rewriting grows sharply.", "motivation": "Because $T$-gate count dominates the physical cost of fault-tolerant quantum computation via magic-state distillation, and Solovay-Kitaev synthesis optimizes for convergence rather than economy, quantifying how much structural redundancy can be removed post-synthesis is practically important. This empirical study provides concrete benchmarks for the real-world benefit and cost of ZX-based circuit compilation.", "highlights": [ "ZX rewriting removes $26.6$-$30.1\\%$ of gates and $18.5$-$22.2\\%$ of $T$-count from Solovay-Kitaev circuits", "Fractional savings plateau across a twenty-five-fold change in circuit length despite growing absolute savings", "Compile-time cost of the rewriting layer grows sharply with recursion depth, eventually dominating synthesis time" ], "keywords": [ { "label": "ZX-Calculus", "reason": "Diagrammatic rewriting is the optimization technique numerically evaluated" }, { "label": "Solovay-Kitaev", "reason": "Circuit synthesis algorithm whose outputs are benchmarked" }, { "label": "T-count", "reason": "Primary cost metric measured before and after optimization" }, { "label": "Magic States", "reason": "T-gate cost relevance is tied to magic-state distillation overhead" } ], "emoji": "📉", "social_summary": "Benchmarks how much ZX-calculus rewriting can trim T-gates from Solovay-Kitaev circuits across 1200 random targets.", "highlights_oneliner": "Empirical benchmark of ZX-based circuit compression" }, { "arxiv_id": "2608.23109", "title": "Physics-Guided Linear Mapper for Quantum Error Mitigation", "authors": "Tulsi Chaudhari, Krishna Bhatia, Shalini Devendrababu, Srinjoy Ganguly, Luis Gerardo Ayala Bertel", "arxiv_url": "https://arxiv.org/abs/2608.23109", "pdf_url": "https://arxiv.org/pdf/2608.23109", "summary": "The authors introduce the Physics-Guided Linear Mapper (PGLM), a quantum error mitigation method that uses seven interpretable features derived from circuit complexity and device calibration data instead of black-box machine learning. On 52 simulated benchmark circuits of $1$--$4$ qubits, PGLM achieves $50.1\\%$ RMSE reduction on $3$-qubit circuits and $32.3\\%$ on $4$-qubit circuits, with a circuit-size-aware deployment policy yielding $32.6\\%$ aggregate improvement.", "motivation": "Traditional QEM methods like zero-noise extrapolation and probabilistic error cancellation suffer from exponential sampling overhead, and recent ML-QEM approaches address scalability but require large training datasets and lack physical interpretability. This work aims to combine data efficiency and interpretability by embedding physical noise-scaling knowledge directly into a lightweight linear model suitable for near-term NISQ deployment.", "highlights": [ "$50.1\\%$ RMSE reduction on $3$-qubit circuits and $32.3\\%$ on $4$-qubit circuits in noise-accumulation regimes", "Data-efficient training using only $50$--$200$ circuits, an order of magnitude less than neural network approaches", "Sub-millisecond inference with interpretable coefficients showing circuit depth and CNOT count dominate error prediction" ], "keywords": [ { "label": "Error Mitigation", "reason": "The paper's central goal is a new quantum error mitigation technique, PGLM, for NISQ devices." }, { "label": "Interpretability", "reason": "PGLM is explicitly designed as an interpretable, physics-guided alternative to black-box ML-QEM models." }, { "label": "Machine Learning", "reason": "The method is framed as a data-efficient linear ML model contrasted against neural-network-based ML-QEM approaches." }, { "label": "NISQ Devices", "reason": "The work targets practical deployment on noisy intermediate-scale quantum hardware and calibration data." } ], "emoji": "📉", "social_summary": "Researchers propose a fast, interpretable physics-guided linear model that mitigates quantum errors using far less training data than neural networks.", "highlights_oneliner": "Interpretable physics-based linear model for quantum error mitigation" } ] }, "2026-08-24": { "word_cloud": [ { "word": "Steane", "weight": 4 }, { "word": "Trapped", "weight": 3 }, { "word": "Ions", "weight": 3 }, { "word": "Transversal", "weight": 3 }, { "word": "Modular", "weight": 4 }, { "word": "Lattice", "weight": 3 }, { "word": "Surgery", "weight": 3 }, { "word": "Surface", "weight": 3 }, { "word": "Chamon", "weight": 4 }, { "word": "Fracton", "weight": 4 }, { "word": "Decoders", "weight": 3 }, { "word": "Toric", "weight": 4 }, { "word": "Translation", "weight": 3 }, { "word": "Mitigation", "weight": 4 }, { "word": "Schwinger", "weight": 3 } ], "social_highlights": "Highlights: tunable non-Clifford rotations demonstrated in trapped-ion Steane code, modular superconducting architectures compared for space-time costs, Chamon fracton code extended to four dimensions with new decoder, translation-invariant codes classified as toric code copies, practical NISQ error suppression reviewed, symmetry-based mitigation tested for the Schwinger model.", "papers": [ { "arxiv_id": "2608.20676", "title": "Continuous-angle logical rotations in the Steane code", "authors": "Eric Huang, Daiwei Zhu, Matteo Ippoliti, Christopher Monroe, Michael J. Gullans", "arxiv_url": "https://arxiv.org/abs/2608.20676", "pdf_url": "https://arxiv.org/pdf/2608.20676", "summary": "The authors experimentally realize continuous-angle logical $Z$ rotations in the $[[7,1,3]]$ Steane code on the IonQ Forte trapped-ion processor by applying a transversal physical $Z$ rotation of angle $\\theta$ followed by syndrome extraction and decoding, inducing a syndrome-dependent logical rotation. They analytically model the effect of dephasing noise on the logical angle and dephasing rate, and use logical Ramsey interferometry and process tomography to confirm the predicted noisy logical rotation. A two-round protocol with $+\\theta$ and $-\\theta$ rotations demonstrates cancellation of the logical angle with low dephasing for trivial syndromes.", "motivation": "Non-Clifford gates are essential for universal fault-tolerant quantum computation, but the Eastin-Knill theorem forbids transversal universality, forcing reliance on costly magic-state distillation or Clifford+$T$ synthesis. This work explores an alternative route to continuously tunable non-Clifford logical gates via transversal rotations combined with standard error correction, potentially reducing overhead for small-angle rotations useful in quantum simulation.", "highlights": [ "First experimental demonstration of continuous-angle logical $Z$ rotations in the $[[7,1,3]]$ Steane code on trapped-ion hardware", "Logical Ramsey interferometry reveals coherent syndrome-dependent logical rotations matching an analytic dephasing model", "Two-round $+\\theta,-\\theta$ protocol shows cancellation of net logical rotation angle with suppressed logical dephasing" ], "keywords": [ { "label": "Steane Code", "reason": "The paper's central experimental platform is the $[[7,1,3]]$ Steane code" }, { "label": "Non-Clifford Gates", "reason": "Demonstrates continuous-angle logical rotations, a non-Clifford resource for universal computation" }, { "label": "Trapped Ions", "reason": "Experiments performed on the IonQ Forte trapped-ion quantum processor" }, { "label": "Transversal Gates", "reason": "Uses transversal physical rotations combined with error correction to induce logical gates" } ], "emoji": "🔄", "social_summary": "Scientists demonstrate tunable non-Clifford logical rotations in a 7-qubit Steane code using trapped ions.", "highlights_oneliner": "Trapped-ion demo of continuous logical rotations" }, { "arxiv_id": "2608.20462", "title": "To Scale Up or To Scale Out: Evaluating Space-Time Costs of Compiled Logical Circuits on Modular Superconducting Quantum Processors", "authors": "Nikiforos Paraskevopoulos, Sebastian de Bone, Mick Christophersen, Simon Storz, A. Mert Bozkurt, Arno Bargerbos, Sebastian Feld", "arxiv_url": "https://arxiv.org/abs/2608.20462", "pdf_url": "https://arxiv.org/pdf/2608.20462", "summary": "This work compares chiplet-based ('scale up') and distributed ('scale out') modular superconducting quantum architectures using a compiler-based stress test that measures space-time cost of executing dense logical entangling workloads via surface code lattice surgery. The analysis spans varying network node counts, code distances, Bell-state fidelities, and Bell-pair generation times, revealing that distributed architectures suffer up to exponential space-time performance penalties relative to a monolithic baseline.", "motivation": "Superconducting QPUs face fabrication yield and footprint limits that stall scaling in the hundred-qubit regime, motivating modular integration strategies analogous to scale-up/scale-out paradigms in classical computing. Understanding the trade-offs between chiplet-based and distributed architectures is critical for designing cost-effective, fault-tolerant quantum systems at scale.", "highlights": [ "Distributed architectures show up to exponential space-time cost penalties versus an effectively monolithic baseline", "Identified two scaling regimes: noise-dominated (insufficient Bell-state fidelity/rate) and connectivity-dominated (lattice-surgery routing congestion)", "Determined threshold of $\\geq 96\\%$ Bell-pair fidelity and $\\geq 1\\,\\text{MHz}$ generation rate needed to suppress inter-node errors" ], "keywords": [ { "label": "Modular Architectures", "reason": "Compares scale-up chiplet versus scale-out distributed superconducting QPU designs" }, { "label": "Lattice Surgery", "reason": "Uses surface code lattice surgery to implement logical entangling operations across modules" }, { "label": "Surface Codes", "reason": "Cost analysis is based on surface code schemes at various code distances" }, { "label": "Bell Pairs", "reason": "Bell-state fidelity and generation rate are key parameters driving the space-time cost analysis" } ], "emoji": "🧩", "social_summary": "Compares chiplet versus distributed superconducting quantum architectures, finding distributed networks can incur exponential overhead costs.", "highlights_oneliner": "Scale-up vs scale-out cost analysis for modular QPUs" }, { "arxiv_id": "2608.20775", "title": "The four-dimensional Chamon code", "authors": "Zhipeng Liang, Xuan Wang", "arxiv_url": "https://arxiv.org/abs/2608.20775", "pdf_url": "https://arxiv.org/pdf/2608.20775", "summary": "This paper investigates the four-dimensional (4D) Chamon code, constructed via the 4D XYZ product of two 2D toric codes, establishing the correspondence between its algebraic structure and the 4D lattice geometry. The authors show the code supports three types of restricted-mobility excitations analogous to the 3D Chamon code, and develop a two-layer decoder exploiting hyperplane symmetry and a projection-induced 2D toric-code structure that outperforms BP-OSD.", "motivation": "Fracton models are of interest for quantum memory applications due to their exponentially growing ground-state degeneracy and mobility-restricted excitations, yet higher-dimensional generalizations like the 4D Chamon code remain poorly characterized and lack efficient decoders. Understanding its excitations and developing high-performance decoding is essential to assess its viability and to generalize insights from 3D fracton codes.", "highlights": [ "Established explicit correspondence between the 4D Chamon code's algebraic structure and the 4D lattice geometry", "Identified three types of restricted-mobility excitations (monopoles, dipoles, quadrupoles) mirroring the 3D Chamon code", "Developed a two-layer decoder using hyperplane symmetry and toric-code projection, substantially outperforming BP-OSD" ], "keywords": [ { "label": "Fracton Codes", "reason": "The paper studies the 4D Chamon code as a fracton model with restricted-mobility excitations" }, { "label": "Chamon Code", "reason": "Central subject is generalizing the 3D Chamon code to four dimensions" }, { "label": "Decoders", "reason": "Introduces a novel two-layer decoding strategy compared against BP-OSD" }, { "label": "Ground-State Degeneracy", "reason": "Exponentially growing GSD is a key characterizing feature discussed" } ], "emoji": "🧊", "social_summary": "Researchers generalize the exotic 3D Chamon fracton code to four dimensions and build a decoder beating BP-OSD.", "highlights_oneliner": "4D fracton code with new decoder design" }, { "arxiv_id": "2608.20981", "title": "A Classification of Translation-Invariant Quantum Codes in Any Dimension", "authors": "Andrew Li, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2608.20981", "pdf_url": "https://arxiv.org/pdf/2608.20981", "summary": "This paper classifies $D$-dimensional translation-invariant quantum codes based on length-$D$ chain complexes, including multivariate multicycle codes where the number of variables equals the number of cycles. The authors prove that such codes are equivalent to copies of $D$-dimensional toric codes, generalizing the known two-dimensional classification result.", "motivation": "While 2D translation-invariant quantum codes are known to reduce simply to copies of the toric code, higher-dimensional translation invariance permits richer phenomena including multiple toric code types and infinite families of fracton codes, making classification nontrivial. Establishing rigorous classification results in higher dimensions clarifies which translation-invariant constructions yield genuinely new topological behavior versus trivial toric code copies.", "highlights": [ "Proves $D$-dimensional translation-invariant codes from length-$D$ chain complexes reduce to copies of $D$-dimensional toric codes", "Covers multivariate multicycle codes where variable count equals cycle count", "Generalizes the established 2D translation-invariant code classification to arbitrary dimension $D$" ], "keywords": [ { "label": "Toric Codes", "reason": "Main classification result shows equivalence to copies of $D$-dimensional toric codes" }, { "label": "Translation Invariance", "reason": "Central structural property used to constrain and classify the quantum codes" }, { "label": "Chain Complexes", "reason": "Codes are constructed from length-$D$ chain complexes as the mathematical foundation" }, { "label": "Fracton Codes", "reason": "Contrasts classification results against the richer fracton code landscape in higher dimensions" } ], "emoji": "📐", "social_summary": "Mathematicians prove higher-dimensional translation-invariant quantum codes reduce to copies of toric codes.", "highlights_oneliner": "Classifying translation-invariant codes in any dimension" }, { "arxiv_id": "2608.20453", "title": "Practical Error Suppression and Mitigation for Reliable Quantum Computing", "authors": "Han-Ze Li, Mengjie Yang, Xianquan Yan, Dax Enshan Koh, Ching Hua Lee, Ruizhe Shen", "arxiv_url": "https://arxiv.org/abs/2608.20453", "pdf_url": "https://arxiv.org/pdf/2608.20453", "summary": "This review provides a practical overview of error suppression and mitigation methods relevant to the transitional regime between NISQ processing and early fault-tolerant quantum computation, covering hardware-aware circuit design, coherent-error suppression, readout mitigation, noise extrapolation, classical inference, and software workflows. It further discusses how these mitigation techniques can be adapted to encoded and logical-qubit settings to complement quantum error correction and suppress residual logical errors.", "motivation": "As quantum hardware begins supporting repeated syndrome measurements and partial error correction, error suppression, mitigation, and correction are increasingly complementary rather than separate strategies, yet a unified practical treatment across this transition is lacking. This review aims to consolidate current techniques and their applicability across the NISQ-to-FTQC transition to guide reliable near-term quantum computation.", "highlights": [ "Surveys hardware error sources and matching suppression/mitigation techniques across current quantum platforms", "Discusses inverse-channel mitigation as applicable both to physical NISQ circuits and residual logical/syndrome-conditioned channels", "Examines adaptation of mitigation techniques to encoded and logical-qubit settings alongside quantum error correction" ], "keywords": [ { "label": "Error Mitigation", "reason": "Central topic covering multiple mitigation strategies for near-term quantum hardware" }, { "label": "NISQ", "reason": "Focuses on the transitional regime between NISQ and fault-tolerant computation" }, { "label": "Readout Errors", "reason": "Reviews readout mitigation as one key error suppression technique" }, { "label": "Logical Qubits", "reason": "Discusses adapting mitigation techniques for encoded logical-qubit operations" } ], "emoji": "🛠️", "social_summary": "Reviews practical error suppression and mitigation strategies bridging NISQ hardware and early fault-tolerant quantum computing.", "highlights_oneliner": "Survey of error suppression across NISQ-FTQC transition" }, { "arxiv_id": "2608.21103", "title": "Symmetry Constrained Quantum Error Mitigation for the Schwinger Model", "authors": "Alexander Tomlinson, Graham Van Goffrier, Bipasha Chakraborty, Zhenyu Cai", "arxiv_url": "https://arxiv.org/abs/2608.21103", "pdf_url": "https://arxiv.org/pdf/2608.21103", "summary": "This work exploits parity and fermion-number symmetries of the (1+1)-dimensional Schwinger model under depolarizing noise to perform symmetry verification in two settings: post-selection during adiabatic state preparation with real-time chiral condensate measurements, and symmetry verification within a variational quantum eigensolver (VQE). Post-selection reduces chiral condensate bias by up to 60%, and combined with global-noise calibration from smaller lattices recovers noiseless values within statistical uncertainty, while symmetry verification in VQE improves energy estimates but not the optimized parameters or state fidelity.", "motivation": "Lattice gauge theory simulations on near-term quantum hardware are hindered by noise, and while symmetries provide natural consistency checks for error mitigation, their practical effectiveness across different computational workflows is not well understood. This study clarifies when and where symmetry verification is genuinely beneficial, offering practical guidance for quantum simulations of gauge theories.", "highlights": [ "Symmetry-sector post-selection removes up to 60% of noise-induced bias in the chiral condensate", "Global-noise calibration from small lattices recovers noiseless chiral condensate values on larger lattices within statistical uncertainty", "Symmetry verification in VQE improves energy estimates but does not improve optimized parameters or state fidelity" ], "keywords": [ { "label": "Schwinger Model", "reason": "The (1+1)-dimensional Schwinger model is the lattice gauge theory studied throughout" }, { "label": "Symmetry Verification", "reason": "Core error mitigation technique exploiting parity and fermion-number symmetries" }, { "label": "VQE", "reason": "Symmetry verification is tested within variational quantum eigensolver optimization" }, { "label": "Lattice Gauge Theory", "reason": "Application domain motivating the use of physical symmetries for error mitigation" } ], "emoji": "⚛️", "social_summary": "Tests symmetry-based error mitigation in Schwinger model simulations, finding benefits depend heavily on where it's applied.", "highlights_oneliner": "Symmetry verification tested on Schwinger model simulations" } ] }, "2026-08-21": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Syndrome", "weight": 4 }, { "word": "Neutral", "weight": 3 }, { "word": "Atoms", "weight": 3 }, { "word": "Compilation", "weight": 3 }, { "word": "Hypergraph", "weight": 2 }, { "word": "Resource", "weight": 3 }, { "word": "Metaheuristic", "weight": 2 }, { "word": "Distillation", "weight": 2 }, { "word": "Toric", "weight": 3 }, { "word": "Potts", "weight": 2 }, { "word": "Nishimori", "weight": 2 }, { "word": "ZX-Calculus", "weight": 2 }, { "word": "Hyperbolic", "weight": 2 }, { "word": "Tanner", "weight": 2 } ], "social_highlights": "Highlights: depth-optimal qLDPC syndrome circuits via Tanner symmetries, ONEX compiling high-rate codes onto neutral atoms for 42x faster syndrome extraction, metaheuristic error-budget allocation cutting resource costs 33%, new tricritical link between Potts models and Z3 toric codes, and lecture notes unifying circuits via ZX-calculus and hyperbolic codes.", "papers": [ { "arxiv_id": "2608.19917", "title": "Disassembling qLDPC codes for depth-optimal parity-check circuits", "authors": "Minh T. P. Nguyen, Maximilian Rimbach-Russ, Stefano Bosco", "arxiv_url": "https://arxiv.org/abs/2608.19917", "pdf_url": "https://arxiv.org/pdf/2608.19917", "summary": "The authors exploit edge symmetries in Tanner graphs of qLDPC codes built from small components to design syndrome-extraction circuits directly from the underlying components rather than the full code. For Lifted Product and Balanced Product codes this yields analytical constructions with provably optimal or near-optimal $CNOT$ depth, and for Quantum Tanner codes it produces depth-optimal circuits on all tested instances up to nearly $600$ data qubits.", "motivation": "While qLDPC code constructions and decoders have advanced rapidly toward scalable fault-tolerant quantum computing, efficient syndrome-extraction circuits remain comparatively underexplored despite being essential for practical implementation. Existing interleaved parity-check circuits are typically designed case-by-case, motivating a general, component-based approach that scales with code family structure.", "highlights": [ "Analytical depth-optimal or near-optimal $CNOT$ circuits for Lifted Product and Balanced Product codes", "Depth-optimal circuits achieved for every tested Quantum Tanner code instance", "Scales to codes with nearly $600$ data qubits by disassembling codes into components rather than working with the full Tanner graph" ], "keywords": [ { "label": "qLDPC Codes", "reason": "Central code family whose syndrome extraction circuits are optimized" }, { "label": "Syndrome Extraction", "reason": "Main technical problem addressed by the paper" }, { "label": "Tanner Graphs", "reason": "Edge symmetries of Tanner graphs are exploited for circuit design" }, { "label": "Circuit Depth", "reason": "Depth optimality of $CNOT$ circuits is the key performance metric" } ], "emoji": "🧩", "social_summary": "Researchers design depth-optimal syndrome-extraction circuits for qLDPC codes by exploiting symmetries in their smaller building blocks.", "highlights_oneliner": "Component-based depth-optimal circuits for qLDPC codes" }, { "arxiv_id": "2608.20164", "title": "Architecture and Compilation Co-Design for High-Rate Quantum Product Codes on Neutral Atom Arrays", "authors": "Adrian Liu, Wan-Hsuan Lin, Daniel Bochen Tan, Qian Xu, Jason Cong", "arxiv_url": "https://arxiv.org/abs/2608.20164", "pdf_url": "https://arxiv.org/pdf/2608.20164", "summary": "The paper introduces ONEX, a compilation framework that decomposes 2D physical execution planning for high-rate qLDPC product codes into independent 1D subproblems solvable via SMT to provable depth-optimality. Applied to hypergraph product codes on neutral atom arrays, ONEX achieves $3.7\\times$–$6.1\\times$ and $29.8\\times$–$42.1\\times$ higher clock rates than 1D constructive and general 2D compilers, scaling to codes with $2{,}500$ data qubits, and extends to zoned layouts and lifted-product codes.", "motivation": "High-rate qLDPC codes promise dramatically reduced physical qubit overhead compared to the surface code, but realizing them on neutral atom arrays requires solving an NP-hard atom-rearrangement compilation problem for non-local syndrome extraction. Efficient, structure-aware compilation is thus a critical bottleneck for scaling qLDPC-based fault-tolerant quantum computing on this promising hardware platform.", "highlights": [ "SMT-based 1D execution planning yields provably depth-optimal solutions", "Up to $42.1\\times$ higher clock rates versus general 2D compilers on codes with $2{,}500$ data qubits", "Extension to zoned layouts and lifted-product codes reveals broader architectural trade-offs" ], "keywords": [ { "label": "Neutral Atoms", "reason": "Hardware platform targeted for qLDPC code execution" }, { "label": "Hypergraph Product", "reason": "Primary code family used as evaluation benchmark" }, { "label": "Compilation", "reason": "Core contribution is a compiler/framework for physical execution planning" }, { "label": "SMT Solvers", "reason": "Satisfiability modulo theories encoding used to achieve depth-optimal solutions" } ], "emoji": "⚛️", "social_summary": "ONEX compiles high-rate qLDPC codes onto neutral atom arrays, boosting syndrome extraction speed by up to 42 times.", "highlights_oneliner": "Depth-optimal qLDPC compilation for atom arrays" }, { "arxiv_id": "2608.19249", "title": "Adaptive Error Budget Allocation for Fault-Tolerant Quantum Resource Estimation: A Metaheuristic Approach", "authors": "Asif Akhtab Ronggon, Tasnuva Farheen", "arxiv_url": "https://arxiv.org/abs/2608.19249", "pdf_url": "https://arxiv.org/pdf/2608.19249", "summary": "This work proposes a training-free, derivative-free optimization framework using metaheuristics (simulated annealing and quantum particle swarm optimization) to adaptively allocate error budgets across logical operations, $T$-state distillation, and rotation synthesis directly on the Azure Quantum Resource Estimator. Evaluated across $433$ circuits from $31$ families, both methods reduce space-time cost by more than $33\\%$ on average, with the Gini coefficient of allocation identified as a diagnostic for expected improvement.", "motivation": "Uniform error budget allocation in fault-tolerant resource estimation ignores circuit-specific structure, leading to overprovisioned subsystems and inflated space-time overhead, while prior supervised-learning solutions require costly offline training data. A flexible, instance-specific allocation method is needed to make FTQC resource estimation pipelines more efficient without additional data generation costs.", "highlights": [ "Training-free derivative-free search achieves over $33\\%$ average space-time cost reduction", "Two structurally distinct metaheuristics agree within $1.34\\%$ points, showing robustness of the approach", "Gini coefficient of optimized allocation identified as an interpretable diagnostic for improvement potential" ], "keywords": [ { "label": "Resource Estimation", "reason": "Central topic is system-level FTQC resource estimation" }, { "label": "Error Budget", "reason": "Core object being adaptively allocated across subsystems" }, { "label": "Metaheuristics", "reason": "Simulated annealing and particle swarm optimization drive the framework" }, { "label": "T Distillation", "reason": "One of the resource-dependent subsystems being optimized" } ], "emoji": "🧮", "social_summary": "A training-free metaheuristic framework adaptively allocates error budgets, cutting fault-tolerant quantum resource costs by over 33 percent.", "highlights_oneliner": "Metaheuristic error-budget optimization for FTQC resources" }, { "arxiv_id": "2608.20268", "title": "Learning Potts Models and $Z_3$ Toric Codes: Higher and Ordinary Nishimori Criticality", "authors": "Rushikesh A. Patil, Malte Pütz, Rohit Mukherjee, Guo-Yi Zhu, Simon Trebst, Andreas W. W. Ludwig", "arxiv_url": "https://arxiv.org/abs/2608.20268", "pdf_url": "https://arxiv.org/pdf/2608.20268", "summary": "The authors identify a higher Nishimori line in the learning phase diagram of the 2D $q$-state Potts model ($21$) local recovery sets via shared entanglement", "Establishes a Singleton-like bound relating length, dimension, distance, locality, availability, and entanglement", "Provides explicit constructions from Tamo-Barg, fiber-product, Hermitian, and Suzuki algebraic-geometry codes" ], "keywords": [ { "label": "Locally Recoverable", "reason": "Core topic is locally recoverable codes with availability for erasure recovery" }, { "label": "Entanglement Assisted", "reason": "Uses shared entanglement to relax CSS orthogonality constraints" }, { "label": "Singleton Bound", "reason": "Derives a Singleton-like tradeoff bound for the new code family" }, { "label": "AG Codes", "reason": "Explicit constructions use algebraic-geometry codes like Hermitian and Suzuki codes" } ], "emoji": "🗄️", "social_summary": "Entanglement enables quantum locally recoverable codes to have multiple simultaneous erasure recovery sets, improving distributed storage tradeoffs.", "highlights_oneliner": "Entanglement unlocks availability in quantum local recovery codes" }, { "arxiv_id": "2608.07783", "title": "Multistage Rewinding Decoder for QLDPC Codes", "authors": "Milad Taghipour, Dimitris Chytas, Bane Vasić", "arxiv_url": "https://arxiv.org/abs/2608.07783", "pdf_url": "https://arxiv.org/pdf/2608.07783", "summary": "The paper proposes a multistage decoding framework that identifies unreliable variable nodes using a heuristic metric combining log-likelihood reliability, hard-decision oscillations, unsatisfied check counts, and soft information, then performs guided rewinds within a beam-search framework to escape trapping sets and degenerate errors. A pruning metric based on residual syndrome weight and posterior reliability keeps the search tractable while achieving competitive performance with order-10 BP-OSD.", "motivation": "Iterative message-passing decoders like BP and min-sum suffer from classical trapping sets and QLDPC-specific degenerate errors caused by short cycles and low-weight stabilizers, limiting their reliability for practical fault-tolerant hardware. Improving iterative decoders without the high complexity of OSD is essential for scalable real-time QLDPC decoding on platforms like BB codes and neutral atoms.", "highlights": [ "Introduces a heuristic ranking metric combining multiple decoder dynamics to flag unreliable variable nodes", "Performs guided rewinds via beam search with pruning based on residual syndrome weight and reliability", "Achieves performance competitive with BP-OSD-10 and improves LP Tanner code decoding by two orders of magnitude over min-sum" ], "keywords": [ { "label": "QLDPC Decoding", "reason": "Focuses on decoding quantum LDPC codes under circuit-level noise" }, { "label": "Trapping Sets", "reason": "Targets failure dynamics from classical trapping sets and degenerate errors" }, { "label": "Beam Search", "reason": "Uses beam-search framework to manage candidate rewind configurations" }, { "label": "Belief Propagation", "reason": "Builds on message-passing BP decoder with rewinding enhancements" } ], "emoji": "🔁", "social_summary": "A new rewinding beam-search decoder helps belief propagation escape trapping sets in quantum LDPC codes.", "highlights_oneliner": "Guided rewinds escape trapping sets in QLDPC decoding" }, { "arxiv_id": "2608.09913", "title": "From Koszul-Complex Stabilizer Models to Superselection Profiles: Topological Rigidity and Nonsplit Extensions", "authors": "Hao Song", "arxiv_url": "https://arxiv.org/abs/2608.09913", "pdf_url": "https://arxiv.org/pdf/2608.09913", "summary": "This work introduces the topological superselection profile $\\mathscr{S}_\\sigma$ for translation-invariant CSS codes, unifying the toric-code hierarchy and bivariate-bicycle codes via Koszul-complex stabilizer models, with cohomology layers $E_\\sigma^\\ell$ encoding excitation sectors, fusion, and translation action. A matrix-level Schanuel-lemma method proves rigidity, showing that for regular Koszul models the nonzero layer and degree uniquely determine translation symmetry-enriched topological order, while nonsplit extensions of 3D toric codes reveal SET data invisible to individual cohomology layers.", "motivation": "Classifying translation-symmetry-enriched topological phases in qLDPC codes connects fundamental questions in topological quantum matter with practical code design, extending prior work on charge modules via Ext functors that left open how much SET order is determined by excitation data. Understanding this rigidity and the role of inter-layer gluing is important for both fault-tolerant code construction and the broader theory of translation-invariant stabilizer models.", "highlights": [ "Defines the topological superselection profile $\\mathscr{S}_\\sigma$ unifying excitation data across dimensions via derived Ext functors", "Proves a Schanuel-lemma-based rigidity theorem determining translation SET order from a single nonzero cohomology layer", "Finds eight nonsplit-extension 3D toric code models sharing identical cohomology layers but distinct translation SET phases via inter-layer gluing" ], "keywords": [ { "label": "Stabilizer Codes", "reason": "Studies translation-invariant CSS stabilizer code models including toric and BB codes" }, { "label": "Homological Algebra", "reason": "Uses Koszul complexes, Ext functors, and Schanuel's lemma to analyze codes" }, { "label": "SET Phases", "reason": "Central focus on translation-symmetry-enriched topological order classification" }, { "label": "Toric Code", "reason": "Framework unifies toric-code hierarchy and generalizations like BB codes" } ], "emoji": "🧩", "social_summary": "A homological framework reveals when translation symmetry-enriched topological order in stabilizer codes is uniquely determined by excitation data.", "highlights_oneliner": "Homological rigidity theory for translation-symmetric stabilizer codes" }, { "arxiv_id": "2608.09915", "title": "Decoupling 2D translation-invariant topological CSS codes", "authors": "Yifei Wang, Zhongyi Ni, Mingxin He, Jinguo Liu, Yingfei Gu", "arxiv_url": "https://arxiv.org/abs/2608.09915", "pdf_url": "https://arxiv.org/pdf/2608.09915", "summary": "The authors prove that every 2D translation-invariant topological CSS code on qubits, after passing to the maximal anyon-preserving superlattice, admits a local unitary decoupling into stacks of toric codes and product states. They provide an efficient algorithm to explicitly construct this decoupling map, along with bounds on required supercell size and operator spreading, showing no ancillas are needed generically.", "motivation": "Previous constructions decoupling translation-invariant CSS codes into toric code stacks broke more translation symmetry than strictly necessary, leaving open whether a fundamental obstruction prevents further simplification. Resolving this question clarifies the classification of topological codes and has implications for practical code design and hardware layout using minimal symmetry breaking.", "highlights": [ "Proves no obstruction exists beyond removing anyon-permuting translations for decoupling into toric codes", "Provides an efficient constructive algorithm for the local unitary decoupling map", "Establishes bounds on supercell size and operator spreading, extending to finite systems with boundaries" ], "keywords": [ { "label": "CSS Codes", "reason": "The paper studies translation-invariant topological CSS codes as its central object" }, { "label": "Toric Code", "reason": "Decoupling target is shown to be stacks of toric codes and product states" }, { "label": "Local Unitaries", "reason": "The decoupling map is constructed as a local unitary circuit" }, { "label": "Anyons", "reason": "Anyon-permuting translations and anyon-preserving superlattices are key to the analysis" } ], "emoji": "🧩", "social_summary": "Proves any 2D translation-invariant topological qubit code can be locally decoupled into simple toric code stacks.", "highlights_oneliner": "Toric code decoupling with no hidden obstructions" }, { "arxiv_id": "2608.09215", "title": "A Heterogeneous Distributed Architecture for Quantum Simulation", "authors": "John Stack, Sitong Liu, Abhinav Anand, Inder Monga, Yuan Liu, Erhan Saglamyurek, Pedro L. S. Lopes, Frank Mueller, Katherine Klymko", "arxiv_url": "https://arxiv.org/abs/2608.09215", "pdf_url": "https://arxiv.org/pdf/2608.09215", "summary": "This work introduces a heterogeneous distributed fault-tolerant architecture combining a magic-state core with extensible one-dimensional lanes of cold-storage nodes supporting parallel random access to Pauli string parities. Evaluated on Fermi-Hubbard and sparse SYK simulations up to $450$ logical qubits, the architecture matches or beats homogeneous distributed designs using far fewer $T$-state factories.", "motivation": "Scaling fault-tolerant quantum computers via architectural distribution risks large overheads from communication and resource duplication, especially for highly non-local fermionic simulation workloads. A specialized storage architecture that efficiently accesses non-local Pauli strings could make otherwise impractical simulations feasible while reducing costly magic-state resource duplication.", "highlights": [ "Introduces a lane-based cold-storage system enabling parallel random access to Pauli string parities", "Achieves within $1.4\\times$ the wall-clock time of a homogeneous architecture using $4\\times$ fewer $T$-factories", "At matched $T$-factory counts, the proposed architecture is roughly $2\\times$ faster" ], "keywords": [ { "label": "Fault Tolerance", "reason": "The architecture targets fault-tolerant quantum computation with magic state resources" }, { "label": "Magic States", "reason": "A dedicated magic core and $T$-state factories are central architectural components" }, { "label": "Distributed Architecture", "reason": "The paper proposes a heterogeneous distributed system of specialized storage modules" }, { "label": "Fermionic Simulation", "reason": "Evaluated on Fermi-Hubbard and sparse SYK fermionic quantum simulation workloads" } ], "emoji": "🗄️", "social_summary": "Proposes a distributed quantum architecture with specialized storage lanes that speeds up fermionic simulations using fewer magic factories.", "highlights_oneliner": "Storage-lane architecture accelerates fault-tolerant fermionic simulation" }, { "arxiv_id": "2608.09347", "title": "Binary code rate bounds via classical--quantum channels", "authors": "Omar Alrabiah, Venkatesan Guruswami", "arxiv_url": "https://arxiv.org/abs/2608.09347", "pdf_url": "https://arxiv.org/pdf/2608.09347", "summary": "The paper derives the Plotkin, Elias-Bassalygo, and both MRRW bounds for binary code rate-distance tradeoffs from a single unifying 'pretty good criterion' based on the pretty good measurement on classical-quantum channels. New channels, the mixed-qubit channel and masked mixed-qubit channel, are introduced that strictly improve both MRRW bounds for all relevant distance parameters $0<\\delta<1/2$.", "motivation": "Rate-distance tradeoffs are foundational in classical coding theory, and the MRRW bounds have stood as the best known bounds for decades without unified derivation methods to systematically improve them. Recasting these bounds through quantum measurement theory opens a principled channel-design approach to discover new, tighter bounds.", "highlights": [ "Unifies Plotkin, Elias-Bassalygo, and MRRW bounds via a single pretty-good-measurement criterion", "Introduces mixed-qubit channel (MQC) strictly improving the first MRRW bound for all $0<\\delta<1/2$", "Introduces masked MQC (2MQC) strictly improving the second MRRW bound throughout the same interval" ], "keywords": [ { "label": "MRRW Bounds", "reason": "The paper's main results improve the classical MRRW rate-distance bounds" }, { "label": "CQ Channels", "reason": "Classical-quantum channels underpin the unifying derivation framework" }, { "label": "Pretty Good Measurement", "reason": "The 'pretty good criterion' based on PGM is the central technical tool" }, { "label": "Rate-Distance Tradeoff", "reason": "The paper concerns fundamental limits on binary code rate versus relative distance" } ], "emoji": "📐", "social_summary": "Uses quantum measurement theory to unify and improve classical binary code rate-distance bounds including MRRW.", "highlights_oneliner": "Quantum channels sharpen classical coding bounds" }, { "arxiv_id": "2608.08051", "title": "Quantum Decision Theory for Displacement Detection with Finite-Energy GKP States", "authors": "Seid Koudia, Symeon Chatzinotas", "arxiv_url": "https://arxiv.org/abs/2608.08051", "pdf_url": "https://arxiv.org/pdf/2608.08051", "summary": "This work develops a quantum-decision-theoretic framework for detecting phase-space displacements using finite-energy, $d$-level GKP probes, deriving Bayesian minimum-error probabilities and Neyman-Pearson receiver-operating characteristics for single-mode and entanglement-assisted architectures. Finite-energy effects are captured via exact theta-series displacement kernels and loss/amplification is mapped to an effective Gaussian random-displacement channel.", "motivation": "Detecting weak phase-space displacements is central to quantum sensing and metrology, and understanding whether GKP-encoded probes can outperform standard Gaussian receivers under realistic finite-squeezing and loss conditions is an open practical question. This analysis clarifies when entanglement and non-Gaussian structure genuinely aid displacement detection versus simpler optimized strategies.", "highlights": [ "Derives exact Bayesian and Neyman-Pearson receiver performance for finite-energy GKP displacement detection", "Shows entanglement removes preparation-dependent blind directions but does not beat optimized single-mode GKP in the noiseless case", "Identifies finite-squeezing and lossy regimes where GKP probes outperform benchmarked Gaussian receivers" ], "keywords": [ { "label": "GKP Codes", "reason": "Finite-energy GKP states are the physical probes used for displacement detection" }, { "label": "Quantum Hypothesis Testing", "reason": "The framework relies on Bayesian and Neyman-Pearson quantum decision theory" }, { "label": "Displacement Detection", "reason": "The core task is discriminating presence versus absence of a phase-space displacement" }, { "label": "Bosonic Channels", "reason": "Loss and amplification are modeled as effective Gaussian bosonic channels" } ], "emoji": "🔍", "social_summary": "Shows finite-energy GKP quantum states can outperform standard Gaussian sensors for detecting tiny phase-space displacements.", "highlights_oneliner": "GKP probes for optimal displacement detection" }, { "arxiv_id": "2608.08130", "title": "Preserving Heisenberg-Limited Metrological Information during Storage via Correlated-Noise Correction", "authors": "Hang Xu, Xue-Ke Song, Jingzheng Huang, Tailong Xiao, Guihua Zeng", "arxiv_url": "https://arxiv.org/abs/2608.08130", "pdf_url": "https://arxiv.org/pdf/2608.08130", "summary": "The authors propose a correlated-noise correction (CNC) protocol that protects quantum metrological probes during the storage phase, after sensing has occurred, by correlating probe errors with auxiliary qubits via fixed two-body entangling gates. Syndromes are extracted only once after storage, and the protocol is shown to preserve quantum Fisher information under dephasing, bit-flip, and amplitude-damping noise for single- and multi-qubit probes.", "motivation": "Existing quantum error correction for metrology focuses almost exclusively on protecting probes during signal encoding, implicitly assuming immediate measurement, while real quantum information tasks often require storing probes before further processing. Environmental noise during this storage stage can erode Heisenberg-limited precision, motivating a dedicated correction scheme targeting memory errors rather than sensing errors.", "highlights": [ "Introduces a single-shot syndrome extraction scheme protecting Fisher information during storage", "Demonstrates that partial correction suffices if the probe is measured immediately, while full recovery is needed for reuse", "Extends the protocol from single-qubit to multi-qubit probes across multi-round sensing-storage-processing cycles" ], "keywords": [ { "label": "Quantum Metrology", "reason": "The work targets preserving Heisenberg-limited precision in quantum sensing tasks" }, { "label": "Quantum Fisher Information", "reason": "QFI preservation is the central metric analyzed throughout the paper" }, { "label": "Error Correction", "reason": "A correlated-noise correction protocol using entangling gates and syndrome extraction is proposed" }, { "label": "Quantum Memory", "reason": "The protocol specifically addresses noise incurred during probe storage stages" } ], "emoji": "🧲", "social_summary": "Introduces a correction scheme that protects quantum sensing precision while probes sit in noisy memory before use.", "highlights_oneliner": "Correcting storage-stage noise in quantum sensors" }, { "arxiv_id": "2608.08403", "title": "Deep Holes in the Clifford Hierarchy", "authors": "Ian Teixeira, David Meyer", "arxiv_url": "https://arxiv.org/abs/2608.08403", "pdf_url": "https://arxiv.org/pdf/2608.08403", "summary": "The paper determines the covering radius of the topological closure of the single-qubit Clifford hierarchy within $SU(2)\\cong S^3$, showing this closure is a union of $18$ great circles with covering radius $\\arccos\\sqrt{5/6}$. The extremal 'deep hole' points form a single orbit of size $192$ under Clifford multiplication, equivalently giving the minimum all-level Clifford fidelity as $5/6$.", "motivation": "The Clifford hierarchy governs which logical gates can be implemented fault-tolerantly via transversal or gate-teleportation constructions, making its precise geometric structure important for understanding limits on universal fault-tolerant gate sets. Prior work established density results for the single-qubit hierarchy but left open the exact worst-case distance to the hierarchy's closure, which this paper resolves exactly.", "highlights": [ "Proves the covering radius of the single-qubit Clifford hierarchy closure is $\\arccos\\sqrt{5/6}$", "Identifies deep holes as a single orbit of $192$ points under Clifford group action", "Shows the minimum all-level Clifford fidelity over one-qubit unitaries equals $5/6$" ], "keywords": [ { "label": "Clifford Hierarchy", "reason": "The paper's central object is the structure and closure of the Clifford hierarchy" }, { "label": "Covering Radius", "reason": "The main result computes the exact covering radius of the hierarchy's closure" }, { "label": "Fault Tolerance", "reason": "Clifford hierarchy geometry relates to constraints on fault-tolerant logical gates" }, { "label": "Gate Synthesis", "reason": "Results bound how well arbitrary unitaries can be approximated by hierarchy gates" } ], "emoji": "🔺", "social_summary": "Pins down the exact worst-case gap between arbitrary single-qubit gates and the Clifford hierarchy.", "highlights_oneliner": "Exact geometry of Clifford hierarchy gaps" }, { "arxiv_id": "2608.09504", "title": "Genuinely Unextendible Product Bases from Maximum Distance Separable Codes", "authors": "Mao-Sheng Li", "arxiv_url": "https://arxiv.org/abs/2608.09504", "pdf_url": "https://arxiv.org/pdf/2608.09504", "summary": "This paper constructs genuinely unextendible product bases (GUPBs) for any number of parties $N\\geq3$ using classical maximum distance separable (MDS) codes, resolving a previously open existence problem. The construction combines MDS rigidity, Fourier mode deletion, and a stopper state to guarantee genuine unextendibility, yielding genuinely entangled subspaces and explicit multipartite bound entangled states with associated GME witnesses.", "motivation": "Whether genuinely unextendible product bases exist for general multipartite systems had remained unresolved, limiting explicit constructions of genuinely entangled subspaces and multipartite bound entanglement. Leveraging classical MDS codes provides an algebraic, constructive bridge from error correction to multipartite entanglement theory, enabling new detectable bound entangled states.", "highlights": [ "Resolves the open existence problem for GUPBs for arbitrary $N\\geq3$ parties using MDS codes", "Constructs genuinely entangled subspaces whose normalized projectors are PPT across every bipartition", "Provides GME witnesses detecting these bound entangled states beyond fully decomposable witnesses" ], "keywords": [ { "label": "MDS Codes", "reason": "Classical maximum distance separable codes are the algebraic tool underlying the construction" }, { "label": "Bound Entanglement", "reason": "The construction yields explicit multipartite bound entangled states" }, { "label": "Unextendible Bases", "reason": "Genuinely unextendible product bases are the paper's central combinatorial object" }, { "label": "Entanglement Witnesses", "reason": "GME witnesses are constructed to detect the resulting entangled states" } ], "emoji": "🔗", "social_summary": "Uses classical MDS error-correcting codes to build long-sought genuinely unextendible product bases and bound entangled states.", "highlights_oneliner": "MDS codes unlock genuinely unextendible product bases" } ] }, "2026-08-10": { "word_cloud": [ { "word": "GALA", "weight": 5 }, { "word": "Neutral", "weight": 4 }, { "word": "Atoms", "weight": 4 }, { "word": "Reconfigurable", "weight": 3 }, { "word": "Automorphisms", "weight": 3 }, { "word": "Transversal", "weight": 3 }, { "word": "Rate", "weight": 3 }, { "word": "Compact", "weight": 2 }, { "word": "QCORE", "weight": 5 }, { "word": "Control", "weight": 4 }, { "word": "ClosedLoop", "weight": 3 }, { "word": "Calibration", "weight": 2 }, { "word": "RealTime", "weight": 3 }, { "word": "Scalability", "weight": 2 }, { "word": "Feedback", "weight": 2 } ], "social_highlights": "Highlights: GALA introduces compact, rate-1/2 self-dual qLDPC codes optimized for neutral-atom hardware with ultra-low logical error rates, QCORE unifies real-time quantum control, calibration, feedback, and tile-local error correction into one scalable architecture.", "papers": [ { "arxiv_id": "2608.07431", "title": "Designer Codes from GALA: Compact, Self-Dual, and Rate-1/2 QEC on Reconfigurable Atom Arrays", "authors": "Willers Yang, Casey Duckering, Arpit Dua", "arxiv_url": "https://arxiv.org/abs/2608.07431", "pdf_url": "https://arxiv.org/pdf/2608.07431", "summary": "The paper introduces GALA codes, constructed via group-action lifts over a product group $G = H_k \\times C_m$ (or $H_k \\ltimes C_m^k$), where a small non-abelian factor $H_k$ provides active orthogonality reaching rate $1/2$ with above-weight distance, while a large abelian factor $C_m$ supplies symmetries enabling code automorphisms and simple AOD move schedules. The construction yields hardware-compatible codes such as a compact self-dual $[[132,30,12]]$, a girth-6 $[[672,336,12]]$, and barrier-breaking $[[1752,880,14]]$ and $[[2232,1120,16]]$ codes, all with transversal Clifford gates and low logical error rates under realistic neutral-atom hardware constraints.", "motivation": "Near-term neutral-atom quantum computers support only hundreds of qubits with limited reconfigurability via crossed acousto-optic deflectors (AODs), making the overhead-reduction promise of high-rate quantum LDPC codes hard to realize in practice. This work matters because it turns hardware compatibility and logical capability into explicit design inputs for code search, producing codes that are simultaneously compact, high-rate, and directly implementable on reconfigurable atom arrays.", "highlights": [ "Compact self-dual $[[132,30,12]]$ code with almost girth-6 structure achieving below $10^{-8}$ logical error rate at $10^{-3}$ physical error rate with a $3.1$ms syndrome-extraction cycle", "Girth-6 rate-$1/2$ $[[672,336,12]]$ code with a $6.76$ms cycle and extrapolated logical error rate below $10^{-10}$", "Barrier-breaking rate-$1/2$ $[[1752,880,14]]$ and $[[2232,1120,16]]$ codes with certified distances exceeding check weights, smaller than any previously known hardware-compatible rate-$1/2$ codes" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The paper constructs high-rate quantum low-density parity-check codes via group-action lifts." }, { "label": "Neutral Atoms", "reason": "Codes are explicitly designed for implementation on reconfigurable neutral-atom arrays with AODs." }, { "label": "Code Automorphisms", "reason": "Abelian symmetry factors provide code automorphisms enabling simple AOD move schedules." }, { "label": "Transversal Gates", "reason": "GALA codes support fold-transversal Clifford gates via ZX-dual variants." } ], "emoji": "\ta6f", "social_summary": "Researchers design GALA quantum codes tailored to neutral-atom hardware, achieving rate-$1/2$ error correction with ultra-low logical error rates.", "highlights_oneliner": "Group-theoretic quantum codes engineered for reconfigurable atom-array hardware" }, { "arxiv_id": "2608.06875", "title": "QCORE: A Quantum-Control-Oriented Real-Time Execution Architecture with Extensible Closed-Loop Services and Shared AI Acceleration", "authors": "Heyue Li, Yanshu Guo, Qichun Liu, Tiefu Li, Zhihua Wang, Hanjun Jiang", "arxiv_url": "https://arxiv.org/abs/2608.06875", "pdf_url": "https://arxiv.org/pdf/2608.06875", "summary": "QCORE is a QPU-side digital control reference architecture that partitions task management, shared resources, hard-real-time execution, and long-timescale services into four hardware blocks to unify control, readout, feedback, calibration, and error correction under bounded latency. It introduces a fast-result sideband for same-round feedback, a Measurement Packet interface, and mechanisms including Tile-local QEC and versioned safe-point commit, evaluated via transaction-level, event-driven, and quantum-behavioral models.", "motivation": "Existing quantum control platforms typically optimize only a subset of control, readout, feedback, calibration, and error correction, creating latency and resource-sharing bottlenecks as processors scale. A unified real-time execution architecture that closes feedback loops and integrates error correction is essential for scalable, reliable quantum processor operation.", "highlights": [ "At background load $0.8$, $P_{99}$ latency of the shared Measurement Packet/Event feedback path is $(1.984\\pm0.004)L_{\\max}$", "Closed-loop operation reduces mean frequency error by $83.2\\%\\pm0.8\\%$ and lowers state-assignment error at maximum readout drift from $10.39\\%\\pm0.54\\%$ to $5.37\\%\\pm0.29\\%$", "Tile-local QEC reduces modeled global-boundary demand yielding a $2.08\\times$ capacity-normalized scaling estimate with zero unsafe transactions across $100{,}000$ configuration trials" ], "keywords": [ { "label": "Control Architecture", "reason": "QCORE is a QPU-side real-time digital control reference architecture." }, { "label": "Closed-Loop Feedback", "reason": "The system implements same-round feedback via a fast-result sideband to correct frequency and readout errors." }, { "label": "Tile-local QEC", "reason": "Error correction is partitioned locally into tiles to reduce global-boundary resource demand." }, { "label": "Real-Time Systems", "reason": "The architecture emphasizes bounded latency and hard-real-time execution for scalable control." } ], "emoji": "\ta83", "social_summary": "QCORE unifies quantum control, feedback, calibration, and error correction into one real-time architecture, cutting errors and boosting scalability.", "highlights_oneliner": "Real-time control architecture unifying feedback, calibration, and QEC" } ] }, "2026-08-07": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "Codes", "weight": 4 }, { "word": "Syndrome", "weight": 4 }, { "word": "Transversal", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "Neutral", "weight": 2 }, { "word": "Atoms", "weight": 2 }, { "word": "Cat", "weight": 3 }, { "word": "Topological", "weight": 3 }, { "word": "Mitigation", "weight": 4 }, { "word": "Benchmarking", "weight": 2 }, { "word": "Entanglement", "weight": 2 }, { "word": "Symmetry", "weight": 2 }, { "word": "Diffusion", "weight": 2 }, { "word": "Calibration", "weight": 2 } ], "social_highlights": "Highlights: self-calibrating LDPC fault tolerance, Clifford circuit classification for CSS codes, globally-controlled architectures, error-detected Iceberg surgery, optimal syndrome timing cutting logical errors, chiral topological approximate codes, biased-noise round scheduling, phase-error-transparent cat code gates, time-reversal symmetry simplifying QEC proofs, black-hole-linked information loss measure, symmetry-guided AME state construction, cross-stack mitigation benchmarking, diffusion-model-based error mitigation.", "papers": [ { "arxiv_id": "2608.05686", "title": "Provably Efficient Self-Calibrating Quantum Fault Tolerance", "authors": "Weiyuan Gong, Hong-Ye Hu", "arxiv_url": "https://arxiv.org/abs/2608.05686", "pdf_url": "https://arxiv.org/pdf/2608.05686", "summary": "The authors establish a theoretical framework showing that syndrome measurements collected during normal quantum error correction can serve as a provably efficient calibration signal for drifting control parameters. They prove that the detection rate forms a locally strongly convex surrogate objective for a broad class of control-induced errors, enabling online optimization that converges to an $\\varepsilon$ detection rate within $O(1/\\varepsilon^2)$ epochs, independent of code distance for quantum LDPC codes.", "motivation": "Fault-tolerant quantum computation requires physical error rates to remain continuously below threshold, but analog control parameters inevitably drift over the long timescales needed for useful computation, making periodic recalibration impractical. This work resolves the open question of whether merging calibration into computation via syndrome measurements admits provable efficiency guarantees rather than being a purely heuristic approach.", "highlights": [ "Proves detection rate is locally strongly convex, enabling online calibration from syndrome data alone", "Establishes $O(1/\\varepsilon^2)$ epoch convergence for time-independent drifts and guarantees for time-dependent drifts", "Shows convergence rate is independent of code distance for quantum LDPC codes, validated on neutral-atom and Clifford simulations" ], "keywords": [ { "label": "Self-Calibration", "reason": "Core idea of repurposing syndrome measurements to calibrate hardware during computation" }, { "label": "LDPC Codes", "reason": "Convergence guarantees are shown to be independent of code distance for quantum LDPC codes" }, { "label": "Online Optimization", "reason": "Framework relies on online convex optimization theory to prove convergence" }, { "label": "Neutral Atoms", "reason": "Pulse-level simulations are performed on neutral-atom array hardware" } ], "emoji": "🎛️", "social_summary": "Shows syndrome measurements can provably and efficiently self-calibrate quantum hardware drift during ongoing error correction.", "highlights_oneliner": "Provable self-calibration using syndrome measurements alone" }, { "arxiv_id": "2608.05688", "title": "Beyond transversality: structure of Clifford circuits for CSS codes", "authors": "Victor V. Albert", "arxiv_url": "https://arxiv.org/abs/2608.05688", "pdf_url": "https://arxiv.org/pdf/2608.05688", "summary": "This work characterizes four groups of Clifford circuits relevant to fault-tolerant logical operations on CSS codes, showing every code-preserving Clifford circuit decomposes into Z-diagonal and X-diagonal circuits, and defining two-fold transversal and automorphism groups with explicit normal forms. Among 136 analyzed CSS codes, 78 achieve their full logical Clifford group via two-fold-transversal circuits, including codes with distances $3,4,5,6,8,12$ and various rates.", "motivation": "Transversal gates are a key resource for fault tolerance but are severely limited by no-go theorems, so understanding the broader structure of code-preserving Clifford circuits is essential for finding richer sets of low-overhead logical operations. This paper extends beyond simple transversality to systematically classify and construct such circuits across many CSS code families.", "highlights": [ "Proves every code-preserving Clifford circuit decomposes into Z-diagonal and X-diagonal layers", "Finds 78 of 136 analyzed CSS codes realize their full logical Clifford group via two-fold-transversal circuits", "Constructs three new CSS code families from bipartite grids, cut-complements, and quadrics with large logical images (e.g. order $\\geq 460{,}800$ for the gross code)" ], "keywords": [ { "label": "CSS Codes", "reason": "Central object of study is Clifford circuit structure for CSS quantum codes" }, { "label": "Transversal Gates", "reason": "Paper extends beyond standard transversality to classify fault-tolerant logical operations" }, { "label": "Clifford Group", "reason": "Analysis focuses on decomposing and classifying Clifford circuits and their logical images" }, { "label": "Code Automorphisms", "reason": "Defines automorphism circuit groups and normal forms using permutations and diagonal gates" } ], "emoji": "🧩", "social_summary": "Classifies Clifford circuit structures for CSS codes, finding many codes realize their full logical Clifford group transversally.", "highlights_oneliner": "Structural classification of Clifford circuits beyond transversality" }, { "arxiv_id": "2608.05821", "title": "Quantum error correction with global control", "authors": "Roberto Menta, Lindsay Bassman Oftelie, Ashkan Abedi, Francesco Cioni, Marco Polini, Seth Lloyd, Francesco Caravelli, Vittorio Giovannetti", "arxiv_url": "https://arxiv.org/abs/2608.05821", "pdf_url": "https://arxiv.org/pdf/2608.05821", "summary": "The authors introduce the first globally-controlled quantum architecture with zero qubit overhead, where every physical qubit is a computational qubit protected under a single error-correcting scheme. They identify cyclic stabilizer codes realizable through global iSWAP and single-qubit gates, achieving QEC thresholds nearly seven orders of magnitude larger than previous global-control estimates, with further improvement when limited local measurement sites are added.", "motivation": "Scaling superconducting quantum processors to fault-tolerant qubit counts is hindered by the wiring problem, and while global control sidesteps this, prior global architectures incurred steep overheads from separating computational and auxiliary qubit correction. This work removes that overhead entirely, making global control a practical path toward scalable fault tolerance.", "highlights": [ "Introduces globally-controlled architecture with zero qubit overhead, unifying computational and auxiliary roles", "Achieves QEC thresholds nearly seven orders of magnitude higher than prior global-control estimates", "Demonstrates a tunable trade-off between wiring simplicity and fault-tolerant performance via limited local measurement sites" ], "keywords": [ { "label": "Global Control", "reason": "Central architecture concept avoiding per-qubit wiring via global operations" }, { "label": "Cyclic Codes", "reason": "Identifies a class of cyclic stabilizer codes compatible with global iSWAP gates" }, { "label": "Wiring Problem", "reason": "Directly addresses the scalability bottleneck from individual qubit control wiring" }, { "label": "Thresholds", "reason": "Reports dramatically improved QEC thresholds compared to earlier global architectures" } ], "emoji": "🌐", "social_summary": "Proposes a zero-overhead globally-controlled quantum architecture with dramatically improved error correction thresholds.", "highlights_oneliner": "Zero-overhead global-control architecture for QEC" }, { "arxiv_id": "2608.06187", "title": "Error-detected surgery on Iceberg codes", "authors": "Andrea Di Fini, Samuel Crew, Laura Pecorari, Guido Pupillo", "arxiv_url": "https://arxiv.org/abs/2608.06187", "pdf_url": "https://arxiv.org/pdf/2608.06187", "summary": "This paper constructs explicit error-detecting surgery gadgets for high-rate Iceberg codes $[[2N,2N-2,2]]$ to perform fault-detected measurements of logical Pauli products, framing surgery as gauging a logical operator symmetry. The authors classify logical Pauli operators under the code's permutation automorphism group, reducing construction to one gadget per orbit, and verify fault-detection via circuit-level simulations.", "motivation": "High-rate error-detecting codes like the Iceberg code are attractive for near-term demonstrations of fault-tolerant components, but performing logical measurements via code surgery while preserving fault-detection properties has remained a practical challenge. This work provides a systematic, gauging-based construction making error-detected Pauli-based computation experimentally accessible.", "highlights": [ "Constructs explicit fault-detecting surgery gadgets for Iceberg codes $[[2N,2N-2,2]]$", "Classifies logical Pauli operators via the code's permutation automorphism group, reducing gadgets to one per orbit", "Verifies expected post-selected logical error rates through circuit-level simulations, suited for neutral-atom platforms" ], "keywords": [ { "label": "Iceberg Codes", "reason": "Paper's construction targets the high-rate Iceberg code family $[[2N,2N-2,2]]$" }, { "label": "Code Surgery", "reason": "Surgery gadgets for logical Pauli measurements are the central technical contribution" }, { "label": "Gauging", "reason": "Surgery is framed as gauging a logical operator symmetry of the code" }, { "label": "Neutral Atoms", "reason": "Gadgets require reconfigurable long-range connectivity available on neutral-atom platforms" } ], "emoji": "🧊", "social_summary": "Builds fault-detecting surgery gadgets for Iceberg codes, enabling near-term error-detected Pauli-based computation experiments.", "highlights_oneliner": "Fault-detected code surgery for Iceberg codes" }, { "arxiv_id": "2608.06242", "title": "Exponential logical-error reduction in quantum memories via optimal syndrome-measurement timing", "authors": "Tobias Haug, Kishor Bharti, Leandro Aolita", "arxiv_url": "https://arxiv.org/abs/2608.06242", "pdf_url": "https://arxiv.org/pdf/2608.06242", "summary": "The authors propose a phenomenological logical-noise model treating syndrome-measurement timing as an optimizable control parameter, analytically showing the optimal measurement interval scales inversely with code distance $d$ and yields exponential logical-error reduction relative to constant-interval schedules. They also develop an adaptive timing strategy based on measured syndrome activity that outperforms fixed-interval protocols, especially for short strong noise bursts.", "motivation": "Syndrome-measurement timing in quantum error correction is typically treated as a fixed clock cycle, but the trade-off between idling error accumulation and measurement-induced faults suggests timing itself can be optimized for better performance. This matters because even modest timing improvements could yield large reductions in logical error rates without new hardware, as shown using real Google device parameters.", "highlights": [ "Analytically derives optimal syndrome-measurement interval scaling inversely with code distance $d$", "Shows exponential reduction in logical-error rate versus constant-interval schedules", "Predicts up to $40\\%$ logical-error-rate reduction per unit time using Google's Nature 638 (2025) experimental parameters" ], "keywords": [ { "label": "Syndrome Timing", "reason": "Central optimization target is the timing interval between syndrome measurements" }, { "label": "Surface Codes", "reason": "Simulations validate the model on rotated surface-code quantum memories" }, { "label": "Adaptive Control", "reason": "Develops an adaptive timing strategy responding to measured syndrome activity" }, { "label": "Logical Error Rate", "reason": "Main metric optimized and reduced exponentially by the proposed scheme" } ], "emoji": "⏱️", "social_summary": "Optimizing syndrome-measurement timing exponentially reduces logical error rates in quantum memories, validated with real device data.", "highlights_oneliner": "Optimal timing yields exponential error suppression" }, { "arxiv_id": "2608.06258", "title": "Approximate Quantum Error Correction at Chiral Topological Edges", "authors": "Yuntai Song, Zejun Liu, Zhencheng Wang, Jong Yeon Lee, Bowen Shi", "arxiv_url": "https://arxiv.org/abs/2608.06258", "pdf_url": "https://arxiv.org/pdf/2608.06258", "summary": "This work introduces approximate quantum error-correcting codes realized by chiral edges of two-dimensional topologically ordered phases, combining a robust gapped bulk with flexible gapless edge CFTs. The authors derive an exact relation between coherent-information loss under local erasure and relative entropy, obtaining power-law scaling exponents and constructing a power-law-range recovery map for Abelian code subspaces, supported by numerical lattice simulations.", "motivation": "While topologically ordered phases and critical CFTs each separately realize forms of quantum error correction, exact topological codes require zero correlation length while CFT-based approximate codes require fine-tuning to criticality. This paper bridges the two by using chiral edge theories, providing a more physically robust and flexible framework for approximate QEC grounded in condensed matter phases.", "highlights": [ "Derives exact relation between coherent-information loss and relative entropy for chiral edge codes", "Shows power-law scaling of coherent-information loss with erased region size, with 2D chiral edge codes at least as robust as dimensionally-reduced CFT codes", "Constructs a state-independent power-law-range recovery map for Abelian code subspaces, verified numerically for compact free boson and Ising CFT examples" ], "keywords": [ { "label": "Topological Order", "reason": "Codes are realized via gapped bulk topologically ordered 2D phases" }, { "label": "Chiral CFT", "reason": "Gapless chiral edge conformal field theories provide the encoding flexibility" }, { "label": "Coherent Information", "reason": "Key robustness diagnostic quantifying information loss under erasure" }, { "label": "Recovery Maps", "reason": "Explicit power-law-range recovery map constructed for Abelian code subspaces" } ], "emoji": "🌀", "social_summary": "Chiral topological edges realize approximate quantum error-correcting codes combining bulk robustness with edge CFT flexibility.", "highlights_oneliner": "Approximate QEC from chiral topological edge theories" }, { "arxiv_id": "2608.05518", "title": "X-Z Round Scheduling for the Surface Code with Defects under Biased Noise", "authors": "Lakshika Rathi, Pau Escofet, Joshua Viszlai, Margaret Martonosi", "arxiv_url": "https://arxiv.org/abs/2608.05518", "pdf_url": "https://arxiv.org/pdf/2608.05518", "summary": "This paper studies the optimal ratio for scheduling $X$- and $Z$-type stabilizer measurement rounds in defect-adapted surface codes under biased noise, finding that the optimal ratio depends primarily on noise bias $\\eta$ and is largely independent of code distance. The approach reduces logical error rate by up to $4.25\\times$ at $1\\%$ defect rate and $8.46\\times$ at $2\\%$ defect rate for a distance-$13$ code, with further gains against CNOT crosstalk.", "motivation": "Real superconducting devices inevitably have fabrication defects requiring separate $X$/$Z$ syndrome extraction rounds, and separately exhibit biased noise where dephasing dominates, but the joint interaction of these two hardware realities had not been systematically studied. Understanding this interaction lets manufacturers tune scheduling directly from calibration data to significantly boost fault-tolerant performance without extra simulation overhead.", "highlights": [ "Shows optimal $X$-to-$Z$ round-scheduling ratio depends mainly on noise bias $\\eta$, not code distance", "Achieves up to $4.25\\times$ and $8.46\\times$ logical error rate reduction at $1\\%$ and $2\\%$ defect rates respectively for distance-$13$ code", "Demonstrates up to $4.5\\times$ logical error reduction against CNOT crosstalk by separating $X$/$Z$ rounds" ], "keywords": [ { "label": "Surface Code", "reason": "Study centers on the surface code adapted for hardware defects" }, { "label": "Biased Noise", "reason": "Optimization exploits asymmetric dephasing-dominated noise via scheduling" }, { "label": "Defect Adaptation", "reason": "Focuses on hardware defects requiring alternating XX/ZZ check schedules" }, { "label": "Round Scheduling", "reason": "Core contribution is optimizing the ratio of X versus Z measurement rounds" } ], "emoji": "🗓️", "social_summary": "Optimizing X versus Z check scheduling in defective surface codes cuts logical error rates several-fold under biased noise.", "highlights_oneliner": "Bias-aware scheduling boosts defect-tolerant surface codes" }, { "arxiv_id": "2608.05992", "title": "Towards fault-tolerance with universal phase-error-transparent gates for high-spin cat codes", "authors": "Kelvin Onggadinata, Si Yan Koh, Arghya Maity, Kuan Eng Johnson Goh, Bent Weber, Kay Jin Lim, Hui Khoon Ng, Teck Seng Koh", "arxiv_url": "https://arxiv.org/abs/2608.05992", "pdf_url": "https://arxiv.org/pdf/2608.05992", "summary": "This work constructs a universal logical gate set that is error-transparent to phase errors for the high-spin cat code, a hardware-efficient QEC encoding in nuclear spins used in donor-in-silicon architectures. The authors identify the logical $X$ gate as the primary implementation challenge, propose multi-tone microwave driving for a logical $CZ$ gate, and show via simulation that error-transparent gates significantly outperform non-transparent ones and may be necessary to surpass the break-even point.", "motivation": "High-dimensional nuclear spins offer a hardware-efficient alternative to multi-qubit encodings, with spin cat codes providing intrinsic robustness against the dominant phase-error channel in donor-in-silicon systems, but this potential is wasted without gate operations that preserve the code's error-correcting structure. This paper charts a concrete path to fault tolerance in this platform by ensuring gate errors remain traceable and correctable.", "highlights": [ "Constructs a universal error-transparent logical gate set for the high-spin cat code", "Identifies the logical $X$ gate as the key challenge and proposes multi-tone microwave driving for logical $CZ$", "Shows error-transparent gates significantly outperform non-transparent ones, potentially enabling break-even performance" ], "keywords": [ { "label": "Cat Codes", "reason": "Encoding is based on the high-spin cat code in nuclear spin systems" }, { "label": "Error Transparency", "reason": "Central technique ensuring phase errors propagate traceably through gates" }, { "label": "Nuclear Spins", "reason": "Physical platform is donor-in-silicon high-dimensional nuclear spin qubits" }, { "label": "Universal Gates", "reason": "Paper constructs a complete universal logical gate set for the encoding" } ], "emoji": "🐱", "social_summary": "Builds error-transparent universal gates for high-spin cat codes to enable fault tolerance in silicon nuclear spin qubits.", "highlights_oneliner": "Error-transparent gates for high-spin cat codes" }, { "arxiv_id": "2608.06304", "title": "Time-Reversal Selection Rules for Quantum Error Correction", "authors": "Eric Kubischta, Ian Teixeira", "arxiv_url": "https://arxiv.org/abs/2608.06304", "pdf_url": "https://arxiv.org/pdf/2608.06304", "summary": "The paper applies time-reversal symmetry to quantum error-correcting codes, showing that a time-reversal-invariant logical qubit encoded on an odd number of spins forms a Kramers doublet, which forces every even-weight Pauli operator to act as a scalar. This automatically satisfies all even-weight Knill-Laflamme conditions, implying that single-qubit error detection is sufficient to guarantee correction. The authors also reinterpret the Rains shadow enumerator in terms of error-resolved overlaps between a code and its time-reversed image.", "motivation": "Symmetry principles have long simplified the search for quantum codes with desirable error-correcting properties, but time-reversal symmetry has not been systematically exploited for this purpose. Establishing parity selection rules from time reversal could simplify code verification and design by reducing the number of independent Knill-Laflamme conditions that must be checked.", "highlights": [ "Kramers doublet structure forces all even-weight Paulis to act as scalars on the code space", "Single-qubit detection is shown to imply correction under time-reversal symmetry", "Rains shadow enumerator reinterpreted via error-resolved overlaps with the time-reversed code" ], "keywords": [ { "label": "Time Reversal", "reason": "Central symmetry principle used to derive selection rules on the code" }, { "label": "Kramers Doublet", "reason": "Structural consequence of time-reversal invariance on odd-spin logical qubits" }, { "label": "Knill-Laflamme", "reason": "Error-correction conditions shown to be automatically satisfied for even-weight errors" }, { "label": "Rains Enumerator", "reason": "Weight enumerator reinterpreted through time-reversal overlaps" } ], "emoji": "🔄", "social_summary": "Shows time-reversal symmetry forces quantum codes to auto-satisfy key correction conditions, simplifying error correction proofs.", "highlights_oneliner": "Time-reversal symmetry simplifies quantum code conditions" }, { "arxiv_id": "2608.05535", "title": "Quantum information loss", "authors": "James Fullwood, Wu-zhong Guo, Boyu Yang", "arxiv_url": "https://arxiv.org/abs/2608.05535", "pdf_url": "https://arxiv.org/pdf/2608.05535", "summary": "The authors introduce a measure of quantum information loss for prepare-evolve-measure scenarios, minimizing over pure-state ensemble decompositions and POVMs to obtain an intrinsic loss quantity $K(\\rho,\\mathcal{E})$ for any state-channel pair. They prove that vanishing information loss on a codespace is equivalent to a 'universal pristineness' condition, which in turn is shown to be equivalent to the Knill-Laflamme conditions for perfect quantum error correction.", "motivation": "Quantifying information loss in open quantum system dynamics has remained ambiguous, since entropy differences alone fail to capture dynamical details of dissipative processes. Connecting this operational notion of loss to the Knill-Laflamme conditions and to black hole evaporation provides a unifying, channel-theoretic perspective on information recovery.", "highlights": [ "Defined an intrinsic information-loss measure $K(\\rho,\\mathcal{E})$ bounded between $0$ and $S(\\rho)$", "Proved equivalence between universal pristineness and the Knill-Laflamme error-correction conditions", "Applied the framework to show the Hayden-Preskill evaporation channel becomes asymptotically universally pristine" ], "keywords": [ { "label": "Knill-Laflamme", "reason": "Central equivalence result linking error correction conditions to information loss" }, { "label": "Information Loss", "reason": "New quantifiable measure developed for quantum channels" }, { "label": "Black Holes", "reason": "Framework applied to the Hayden-Preskill evaporation model" }, { "label": "Quantum Channels", "reason": "State-channel pairs form the basis of the proposed measure" } ], "emoji": "🕳️", "social_summary": "Introduces a new information-loss measure linking quantum error correction conditions to black hole evaporation dynamics.", "highlights_oneliner": "Channel-theoretic information loss meets error correction" }, { "arxiv_id": "2608.05781", "title": "Symmetry-guided construction and exact certification of absolutely maximally entangled states", "authors": "Samuel Bevins, Yunus Bidav", "arxiv_url": "https://arxiv.org/abs/2608.05781", "pdf_url": "https://arxiv.org/pdf/2608.05781", "summary": "The authors construct new Hermitian self-dual MDS codes with parameters $[12,6,7]_{25}$, $[18,9,10]_{121}$, and $[18,9,10]_{169}$, which via nonbinary stabilizer constructions yield new AME states including $\\text{AME}(12,5)$, $\\text{AME}(18,11)$, and $\\text{AME}(18,13)$. Symmetry constraints from a regular $\\mathbb{Z}_3^2$ automorphism group reduce the search space, and results are certified using exact field arithmetic and graph-state cut-rank checks.", "motivation": "Absolutely maximally entangled states are extremal resources for quantum error correction and multipartite entanglement, but constructing and certifying them for larger system sizes and local dimensions remains computationally challenging. Exploiting symmetry to reduce search complexity while ensuring rigorous exact certification addresses a key bottleneck in discovering new AME states.", "highlights": [ "Discovered new $[12,6,7]_{25}$ code not monomially equivalent to Reed-Solomon codes", "Symmetry reduction using $\\mathbb{Z}_3^2$ orbit structure splits self-duality constraints into independent blocks", "Exact certification via field arithmetic, minor enumeration, and graph-state cut-rank computations" ], "keywords": [ { "label": "AME States", "reason": "Primary entanglement resource constructed in the paper" }, { "label": "MDS Codes", "reason": "Self-dual maximum-distance-separable codes underlying the constructions" }, { "label": "Stabilizer Codes", "reason": "Nonbinary stabilizer formalism used to derive AME states" }, { "label": "Automorphism Groups", "reason": "Symmetry group structure used to reduce the code search space" } ], "emoji": "🔷", "social_summary": "Constructs new maximally entangled quantum states using symmetry-guided MDS codes with exact mathematical certification.", "highlights_oneliner": "New AME states via symmetric self-dual MDS codes" }, { "arxiv_id": "2608.05202", "title": "Quantum Error Management in Practice: A Cross-Stack Benchmark", "authors": "Daniel Sierra-Sosa, Begonya Garcia-Zapirain, Cristian Marquez, Kelly Garces", "arxiv_url": "https://arxiv.org/abs/2608.05202", "pdf_url": "https://arxiv.org/pdf/2608.05202", "summary": "This work benchmarks three commercial error suppression and mitigation solutions—IBM Qiskit Runtime, Q-CTRL Performance Management, and Qedma QESEM—on a 156-qubit IBM Heron r3 processor across Sampler and Estimator workloads. Q-CTRL achieved the best results on structured Sampler circuits, while for Estimator tasks, QESEM and Q-CTRL reduced aggregate mean absolute error by factors of $4.70$ and $3.10$ respectively relative to raw execution, with distinct QPU-time tradeoffs.", "motivation": "As quantum processors exceed one hundred qubits, noise still limits useful computation and full fault-tolerant error correction remains impractical, making error suppression and mitigation critical near-term tools. Independent, identical-hardware comparisons of commercial mitigation stacks have been scarce, leaving practitioners without clear guidance on accuracy versus cost tradeoffs.", "highlights": [ "Q-CTRL delivered best exact-output success across all tested Sampler circuits including quantum phase estimation and mirror circuits", "QESEM reduced Estimator aggregate mean absolute error to $0.0188$ versus $0.0883$ for raw execution", "QESEM used $7.5$ to $11.1\\times$ more QPU time than Q-CTRL despite better accuracy" ], "keywords": [ { "label": "Error Mitigation", "reason": "Core focus comparing commercial mitigation techniques" }, { "label": "Benchmarking", "reason": "Cross-stack comparison methodology on identical hardware" }, { "label": "NISQ", "reason": "Study targets noisy intermediate-scale quantum hardware performance" }, { "label": "Superconducting Qubits", "reason": "Experiments run on IBM's 156-qubit Heron r3 processor" } ], "emoji": "📊", "social_summary": "Benchmarks IBM, Q-CTRL, and Qedma error mitigation tools on a 156-qubit processor, revealing accuracy versus runtime tradeoffs.", "highlights_oneliner": "Cross-stack benchmark of commercial error mitigation tools" }, { "arxiv_id": "2608.05382", "title": "Quantum Error Mitigation with Diffusion-Like Models", "authors": "Yuval Idan, Ofek Nourian, Elad Mentovich, Taylor L. Patti, Eliahu Cohen", "arxiv_url": "https://arxiv.org/abs/2608.05382", "pdf_url": "https://arxiv.org/pdf/2608.05382", "summary": "The authors propose an AI-assisted error-mitigation framework where sequential local weak measurements in random Pauli bases model a quantum diffusion-like forward process producing basis-dependent dephasing and locally depolarizing dynamics. Machine-learning models, including LSTMs and attention-based architectures like Vision Transformers and U-Nets, are trained to invert this process and reconstruct pre-noise states, including from local-to-global reconstruction tasks.", "motivation": "While quantum error correction progress continues toward fault tolerance, error mitigation remains essential for extending circuit depth on near-term and early fault-tolerant devices. Drawing an analogy between weak-measurement-induced decoherence and classical diffusion models offers a promising avenue for leveraging modern generative AI techniques to reverse noise.", "highlights": [ "Formulated weak-measurement sequences as a quantum analogue of diffusion model forward processes", "LSTM models sufficed for single-qubit and separable multi-qubit denoising, while entangled states required Vision Transformer and U-Net architectures", "Demonstrated local-to-global state reconstruction from locally accessible reduced density matrices" ], "keywords": [ { "label": "Error Mitigation", "reason": "Core goal of reconstructing pre-noise quantum states" }, { "label": "Diffusion Models", "reason": "Machine learning technique adapted from classical generative diffusion models" }, { "label": "Weak Measurement", "reason": "Physical mechanism used to model the noisy forward process" }, { "label": "Neural Networks", "reason": "LSTM and attention-based architectures used for denoising" } ], "emoji": "🌫️", "social_summary": "Uses AI diffusion models trained on weak-measurement noise to reconstruct clean quantum states and mitigate errors.", "highlights_oneliner": "AI diffusion models denoise quantum states" } ] }, "2026-08-06": { "word_cloud": [ { "word": "Stabilizer", "weight": 3 }, { "word": "Erasure", "weight": 4 }, { "word": "Covariant", "weight": 2 }, { "word": "Charge", "weight": 2 }, { "word": "Resource", "weight": 3 }, { "word": "Compilation", "weight": 2 }, { "word": "NeutralAtoms", "weight": 3 }, { "word": "Rydberg", "weight": 2 }, { "word": "Toric", "weight": 2 }, { "word": "Anyons", "weight": 4 }, { "word": "Braiding", "weight": 3 }, { "word": "TrappedIons", "weight": 2 }, { "word": "Cavity", "weight": 2 }, { "word": "Dephasing", "weight": 3 }, { "word": "AmplitudeDamping", "weight": 2 } ], "social_highlights": "Highlights: new locality measure predicts optimal repair groups for locally recoverable codes, charge conservation imposes diffusive speed limits on covariant erasure encoding, a compiler framework enables detailed fault-tolerant resource estimation, a survey charts neutral-atom progress toward toric code demonstrations, trapped-ion experiments reconstruct non-Abelian anyon braiding via measurement alone, a microwave drive suppresses cavity dephasing from flux noise, and lightweight quantum filters shield states from amplitude damping.", "papers": [ { "arxiv_id": "2608.04403", "title": "Information locality of a quantum locally recoverable code", "authors": "Ryutaroh Matsumoto", "arxiv_url": "https://arxiv.org/abs/2608.04403", "pdf_url": "https://arxiv.org/pdf/2608.04403", "summary": "This paper proposes a quantum counterpart of classical information locality for stabilizer codes built via Hermitian orthogonality, along with a linear-algebraic procedure to compute a smaller repair group and minimize the number of measured observables during erasure decoding. Explicit stabilizer code examples show that the previous $(r,\\delta)$ quantum locality definition overestimates the necessary repair group size, while a naive translation of classical information locality can underestimate it.", "motivation": "Quantum error correction can tolerate twice as many erasures as errors, and reducing the number of measurements needed for erasure recovery is important on hardware platforms where measurements are costly or disturb qubits. Prior symbol-locality definitions for quantum codes inherited a known overestimation flaw from the classical setting, motivating a more accurate information-locality framework tailored to stabilizer codes.", "highlights": [ "Introduces quantum information locality for stabilizer codes via Hermitian orthogonality", "Gives a linear algebraic method to find a minimal repair group and minimize measured observables", "Shows via explicit examples that prior quantum $(r,\\delta)$ locality overestimates, and naive translation underestimates, repair costs" ], "keywords": [ { "label": "Locally Recoverable Codes", "reason": "The paper's central object is quantum locally recoverable codes and their locality parameters." }, { "label": "Stabilizer Codes", "reason": "The proposed information locality is constructed for quantum stabilizer codes via Hermitian orthogonality." }, { "label": "Erasure Correction", "reason": "The work focuses on minimizing resources needed to correct erasures in quantum codes." }, { "label": "Repair Groups", "reason": "A key contribution is computing smaller repair groups for decoding." } ], "emoji": "🧩", "social_summary": "Proposes a quantum information locality measure for stabilizer codes that more accurately predicts the minimal repair group needed for erasure correction.", "highlights_oneliner": "Quantum information locality refines erasure-repair group sizing" }, { "arxiv_id": "2608.04953", "title": "Diffusive Speed Limits for U(1)-Covariant Quantum Error Correction", "authors": "Jianqi Sheng", "arxiv_url": "https://arxiv.org/abs/2608.04953", "pdf_url": "https://arxiv.org/pdf/2608.04953", "summary": "This paper studies one-dimensional $U(1)$-covariant quantum error-correcting encoders under flagged erasure, combining complementary-channel geometry, charge-sector Haar analysis, and connected-moment expansions. It shows Charge-Haar codes saturate a universal adjacent-charge bound giving an exact $n^{-1/2}$ extensive-erasure law, while local number-conserving brickwork circuits face an $\\Omega(n^2)$ encoding-time lower bound due to charge diffusion, with an $O(n^3)$ upper bound proven for the classical component.", "motivation": "Continuous symmetries such as $U(1)$ charge conservation are known to obstruct exact quantum error correction, and understanding the true resource and time costs of covariant encoding is essential for symmetry-constrained quantum memories. This work addresses the open question of how quickly geometrically local, charge-conserving circuits can reach optimal erasure protection.", "highlights": [ "Charge-Haar codes achieve the universal adjacent-charge lower bound with an exact $n^{-1/2}$ erasure-error scaling", "Proves an $\\Omega(n^2)$ lower bound on encoding time for local number-conserving circuits due to charge diffusion", "Establishes an $O(n^3)$ mixing upper bound for the classical component of the encoding channel" ], "keywords": [ { "label": "U(1) Symmetry", "reason": "The paper studies quantum error correction under strict $U(1)$ charge conservation constraints." }, { "label": "Covariant Codes", "reason": "Charge-Haar codes and covariant encoders are the central objects analyzed." }, { "label": "Erasure Codes", "reason": "The analysis is framed around flagged erasure correction and its scaling laws." }, { "label": "Circuit Complexity", "reason": "Encoding-time lower and upper bounds for local brickwork circuits are a key result." } ], "emoji": "🌊", "social_summary": "Reveals that charge conservation forces quadratic time costs for locally encoding quantum information against erasure.", "highlights_oneliner": "Charge diffusion limits speed of covariant QEC encoding" }, { "arxiv_id": "2608.04573", "title": "Resource Estimation for Fault-Tolerant Quantum Programs", "authors": "Bonan Su, Yuan Feng, Li Zhou, Mingsheng Ying", "arxiv_url": "https://arxiv.org/abs/2608.04573", "pdf_url": "https://arxiv.org/pdf/2608.04573", "summary": "This paper presents a quantum programming language with programmer-visible abstractions for error-correction schemes, paired with a resource-estimation framework that performs cross-layer program-hardware analysis. Evaluations on large-scale fault-tolerant algorithm implementations, including components typically treated as black boxes, demonstrate substantial resource savings and fine-grained, accurate estimates.", "motivation": "Fault-tolerant quantum computation incurs heavy overhead from error correction, but existing languages either force low-level hardware manipulation or hide error-correction details, limiting resource optimization. A framework that exposes error-correction abstractions while enabling systematic resource trade-off exploration is needed to make fault-tolerant program design more efficient.", "highlights": [ "Introduces a language with programmer-visible error-correction abstractions for fault-tolerant programming", "Provides cross-layer program-hardware analysis enabling systematic resource trade-off exploration", "Demonstrates substantial resource savings and fine-grained estimates on large-scale algorithm implementations" ], "keywords": [ { "label": "Resource Estimation", "reason": "The paper's core contribution is a framework for fault-tolerant resource estimation." }, { "label": "Quantum Compilation", "reason": "A programming language abstraction layer for error-correction schemes is developed." }, { "label": "Fault Tolerance", "reason": "The work targets fault-tolerant quantum program implementations and their overheads." }, { "label": "Cross-Layer Analysis", "reason": "The framework performs program-hardware co-analysis for resource trade-offs." } ], "emoji": "🛠️", "social_summary": "Introduces a quantum programming language and framework that gives detailed, accurate resource estimates for fault-tolerant quantum algorithms.", "highlights_oneliner": "Programmable abstractions enable precise fault-tolerant resource estimation" }, { "arxiv_id": "2608.05010", "title": "Neutral Atom Quantum Computing: Principles, Routes, Progress, and Challenges", "authors": "Junchao Wang, Zeyuan Wang, Lei Li, Feng Wang, Shibo Liang, Keduo Yan", "arxiv_url": "https://arxiv.org/abs/2608.05010", "pdf_url": "https://arxiv.org/pdf/2608.05010", "summary": "This review systematically surveys neutral-atom quantum computing, covering qubit encoding, atom trapping, Rydberg interactions, blockade gate mechanisms, and reconfigurable architectures across optical tweezer, optical lattice, and dipole trap technical routes. It reviews progress from 2000 to 2026 including thousand-qubit systems, logical qubits, and quantum error correction demonstrations such as toric code experiments and encoding rates exceeding $1/2$.", "motivation": "Neutral atom platforms have rapidly emerged as a leading route to scalable quantum computing due to natural qubit uniformity, room-temperature operation, and all-to-all connectivity via atom rearrangement. As the field moves from proof-of-principle demonstrations toward fault-tolerant architectures, a comprehensive review of progress and bottlenecks is valuable for guiding future research.", "highlights": [ "Surveys thousand-qubit-scale systems including a $6100$-atom array and continuous $3000$-qubit operation", "Reviews toric code error correction demonstrations and encoding rates exceeding $1/2$", "Analyzes core bottlenecks: scalability-fidelity trade-offs, atom loss, laser industrialization, and interconnection" ], "keywords": [ { "label": "Neutral Atoms", "reason": "The paper reviews neutral-atom quantum computing hardware as its central topic." }, { "label": "Rydberg Gates", "reason": "Rydberg blockade interactions underlie the quantum logic gate mechanisms discussed." }, { "label": "Toric Code", "reason": "Toric code error correction demonstrations on neutral atom hardware are highlighted." }, { "label": "Reconfigurable Arrays", "reason": "Optical tweezer atom rearrangement and reconfigurable architectures are surveyed." } ], "emoji": "⚛️", "social_summary": "Surveys the rapid rise of neutral-atom quantum computing from thousand-qubit arrays to toric code error correction demonstrations.", "highlights_oneliner": "Comprehensive review of neutral-atom quantum computing progress" }, { "arxiv_id": "2608.04103", "title": "Reconstructing non-Abelian braiding and fusion without anyon transport", "authors": "Lucy Byles, Matthew D. Horner, Benjamin T. H. Varcoe, Jiannis K. Pachos", "arxiv_url": "https://arxiv.org/abs/2608.04103", "pdf_url": "https://arxiv.org/pdf/2608.04103", "summary": "This work introduces a measurement-only protocol using temporally ordered ribbon operations to reconstruct non-Abelian braiding and fusion primitives of the quantum double model $D(S_3)$ without physically transporting anyons, experimentally realized on Quantinuum's H2 trapped-ion processors with a reduced two-qutrit encoding. The protocol achieves average normalized fidelities of $\\overline{\\mathcal{F}}_R=0.9988$ for braiding and $\\overline{\\mathcal{F}}_F=0.9987$ for fusion, and combines them to produce a non-Clifford braid and non-stabilizer resource state.", "motivation": "Non-Abelian anyons promise fault-tolerant, universal quantum computation, but implementing extended anyonic transport processes on current hardware incurs prohibitive resource overhead. A measurement-only approach that avoids physical anyon transport could make topological quantum computing primitives experimentally accessible on near-term devices.", "highlights": [ "Realizes measurement-only reconstruction of $D(S_3)$ braiding and fusion via ancilla-assisted ribbon operations", "Achieves average fidelities $\\overline{\\mathcal{F}}_R=0.9988$ and $\\overline{\\mathcal{F}}_F=0.9987$ on Quantinuum H2 trapped ions", "Combines primitives to generate a non-Clifford braid and non-stabilizer resource state for topological encodings" ], "keywords": [ { "label": "Non-Abelian Anyons", "reason": "The paper's core physics is the braiding and fusion of non-Abelian anyons in a quantum double model." }, { "label": "Quantum Double Model", "reason": "The $D(S_3)$ quantum double model provides the topological order studied." }, { "label": "Trapped Ions", "reason": "The protocol is experimentally realized on Quantinuum H2 trapped-ion processors." }, { "label": "Measurement-Only", "reason": "The protocol avoids anyon transport by using measurement-only ribbon operation techniques." } ], "emoji": "🪢", "social_summary": "Demonstrates non-Abelian anyon braiding and fusion on trapped-ion qubits using measurements alone, without moving any anyons.", "highlights_oneliner": "Measurement-only anyon braiding realized on trapped ions" }, { "arxiv_id": "2608.04494", "title": "Dynamically suppressing cavity dephasing induced by frequency fluctuations of a coupled nonlinear mode", "authors": "Yunwei Lu, Xinyuan You, Ziwen Huang, Sébastien Léger, Jens Koch, Yao Lu", "arxiv_url": "https://arxiv.org/abs/2608.04494", "pdf_url": "https://arxiv.org/pdf/2608.04494", "summary": "This paper introduces Stark-Assisted Flux-noise Evasion (SAFE), a hardware-efficient protocol using a weak off-resonant microwave drive on a nonlinear Josephson element to protect a coupled superconducting cavity from inherited dephasing. Analytical predictions confirmed by Monte Carlo simulations show SAFE extends cavity dephasing time by more than an order of magnitude while keeping drive-induced decoherence subdominant.", "motivation": "High-coherence superconducting cavities are promising quantum information platforms, but their control via nonlinear Josephson elements inherits frequency-fluctuation dephasing that erodes the noise bias critical for error correction protocols like cat codes. Protecting cavities from this inherited dephasing without costly hardware overhead is essential for realizing bias-preserving fault-tolerant architectures.", "highlights": [ "Introduces SAFE, a weak off-resonant drive protocol suppressing cavity dephasing inherited from a flux-tunable transmon", "Confirms analytical predictions with Monte Carlo simulations under realistic $1/f$ flux noise parameters", "Extends cavity dephasing time by more than an order of magnitude with subdominant drive-induced decoherence" ], "keywords": [ { "label": "Cavity Dephasing", "reason": "The central problem addressed is dephasing of a superconducting cavity inherited from a coupled nonlinear mode." }, { "label": "Flux Noise", "reason": "The protocol specifically targets $1/f$ flux noise in a flux-tunable transmon." }, { "label": "Noise Bias", "reason": "Preserving the noise bias used in error-correction protocols motivates the work." }, { "label": "Bosonic Codes", "reason": "High-coherence cavities are a hardware platform relevant to bosonic error-correction codes." } ], "emoji": "🛡️", "social_summary": "Introduces a weak microwave drive protocol that shields superconducting cavities from dephasing inherited from noisy control elements.", "highlights_oneliner": "Microwave drive protocol suppresses inherited cavity dephasing" }, { "arxiv_id": "2608.04822", "title": "Quantum States Protection under Environmental Noise", "authors": "Kai Wang, Zhen-Yang Peng", "arxiv_url": "https://arxiv.org/abs/2608.04822", "pdf_url": "https://arxiv.org/pdf/2608.04822", "summary": "This work introduces a quantum filter circuit scheme using single- and multi-control qubits to protect quantum states against amplitude-damping noise while preserving high success probability. It shows that many-body states with fixed quantum Hamming weight can be perfectly protected against amplitude damping, whereas states with the largest Hamming weight difference set a lower bound on achievable protection fidelity.", "motivation": "Amplitude-damping noise from energy relaxation is a dominant and irreversible decoherence mechanism that cannot be captured by simple Pauli noise models, posing a persistent challenge for quantum technologies. Developing resource-efficient protection schemes that avoid the overhead of full quantum error correction is important for near-term noisy quantum devices.", "highlights": [ "Introduces quantum filter circuits with single- and multi-control qubits for amplitude-damping noise protection", "Shows fixed quantum Hamming weight states can be perfectly protected against amplitude damping", "Demonstrates increasing control qubits consistently improves average fidelity for arbitrary input states" ], "keywords": [ { "label": "Amplitude Damping", "reason": "The paper specifically targets protection against amplitude-damping noise channels." }, { "label": "Quantum Filters", "reason": "The proposed protection scheme is based on quantum filter circuit structures." }, { "label": "Hamming Weight", "reason": "Protection fidelity is analyzed in terms of quantum Hamming weight of many-body states." }, { "label": "Resource Efficiency", "reason": "The scheme avoids full quantum error correction, offering a lighter-weight protection alternative." } ], "emoji": "🔬", "social_summary": "Proposes lightweight quantum filter circuits that protect states from amplitude-damping noise without full error correction overhead.", "highlights_oneliner": "Filter circuits shield quantum states from amplitude damping" } ] }, "2026-08-05": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Neutral", "weight": 3 }, { "word": "Decoding", "weight": 4 }, { "word": "Surface", "weight": 4 }, { "word": "MWPM", "weight": 2 }, { "word": "Lattice", "weight": 4 }, { "word": "Magic", "weight": 4 }, { "word": "Compilation", "weight": 3 }, { "word": "Simulation", "weight": 3 }, { "word": "Photonic", "weight": 3 }, { "word": "Emitters", "weight": 2 }, { "word": "Darwinism", "weight": 3 }, { "word": "Shor", "weight": 2 }, { "word": "Superconducting", "weight": 3 }, { "word": "Readout", "weight": 2 } ], "social_highlights": "Highlights: Cornucopia codes cut overhead with neutral atoms, THQLink enables microsecond real-time surface code decoding, Harvest speeds magic state compilation 17.8x, sparse error detection boosts lattice gauge simulations, photon properties linked to Pauli errors, Shor code reveals Darwinism-QEC tradeoff, 0-pi qubit gains protected readout.", "papers": [ { "arxiv_id": "2608.02773", "title": "Quantum error correction at ultra-low overhead", "authors": "Zhide Lu, Weikang Li, Dong-Ling Deng", "arxiv_url": "https://arxiv.org/abs/2608.02773", "pdf_url": "https://arxiv.org/pdf/2608.02773", "summary": "The authors introduce Cornucopia codes, a family of hardware-efficient quantum LDPC codes achieving encoding rates exceeding $1/2$ with pseudo-thresholds above $0.4\\%$ under circuit-level noise. Leveraging affine-permutation code constructions co-designed with reconfigurable neutral-atom connectivity, syndrome extraction completes in $12$ entangling layers independent of code size. A single $[[2844,1426,18]]$ block achieves extrapolated logical error rates as low as $1.9\\times10^{-31}$ per logical qubit per cycle, dramatically reducing qubit overhead compared to bivariate bicycle codes.", "motivation": "Quantum error correction has long faced trade-offs between encoding efficiency, error thresholds, and hardware feasibility, limiting practical fault-tolerant scaling. This work demonstrates that structured, atom-rearrangement-based code geometries can break these trade-offs, bringing ultra-low overhead QEC within reach of near-term neutral-atom processors.", "highlights": [ "Encoding rate exceeding $1/2$ with pseudo-threshold above $0.4\\%$", "$[[2844,1426,18]]$ code achieves logical error rate $2.6\\times10^{-16}$ at $p=0.1\\%$", "Requires over $68{,}000$ fewer physical qubits than comparable bivariate bicycle code implementations" ], "keywords": [ { "label": "qLDPC Codes", "reason": "Paper introduces Cornucopia, a new family of quantum low-density parity-check codes" }, { "label": "Neutral Atoms", "reason": "Code geometry co-designed with reconfigurable neutral-atom array connectivity" }, { "label": "Encoding Rate", "reason": "Central metric optimized, achieving rate exceeding $1/2$" }, { "label": "Circuit-level Noise", "reason": "Thresholds evaluated under standard circuit-level noise model" } ], "emoji": "🧺", "social_summary": "New Cornucopia codes pack over a thousand logical qubits per block using neutral-atom rearrangement, slashing quantum error correction overhead.", "highlights_oneliner": "Ultra-high-rate qLDPC codes via atom rearrangement" }, { "arxiv_id": "2608.03948", "title": "Real-time decoding of quantum error correction codes using high-performance computing", "authors": "Lingling Lao, Qiang Wang, Yuanqi Liu, Yantong Liu, Haowen Wang, Yitao Chen, Yankang Zhao, Zhenwei Wu, Wei Zhang, Yong Dong, Yingwen Liu, Mingche Lai, Junjie Wu", "arxiv_url": "https://arxiv.org/abs/2608.03948", "pdf_url": "https://arxiv.org/pdf/2608.03948", "summary": "This work proposes THQLink, an architecture connecting quantum control systems to high-performance computing clusters via the TH-Express network for real-time QEC decoding. The system achieves a mean round-trip latency of $2.944\\,\\mu s$ with only $130$ ns incremental overhead per hop, and demonstrates real-time decoding of surface codes up to distance $19$ using a matching-based decoder on CPUs with a parallel window strategy.", "motivation": "Real-time decoding is critical for fault-tolerant quantum computing since decoders must process syndromes within microsecond timescales to avoid exponential data backlog. Scaling to large numbers of logical qubits requires substantial computational resources, motivating tight integration between quantum processors and HPC infrastructure.", "highlights": [ "Mean round-trip latency of $2.944\\,\\mu s$ with $130$ ns per additional hop", "Real-time decoding at $1\\,\\mu s$ per QEC round for surface code up to $d=19$", "Parallel window strategy enables scalable CPU-based matching decoding" ], "keywords": [ { "label": "Real-time Decoding", "reason": "Core focus is meeting microsecond-scale decoding latency requirements" }, { "label": "MWPM", "reason": "Uses matching-based decoder for surface codes" }, { "label": "HPC Integration", "reason": "Proposes tight coupling between quantum control systems and HPC clusters" }, { "label": "Surface Codes", "reason": "Demonstrated decoding scalability up to distance 19 surface codes" } ], "emoji": "⚡", "social_summary": "THQLink links quantum processors to supercomputers, achieving microsecond real-time decoding of surface codes up to distance 19.", "highlights_oneliner": "HPC-linked real-time decoder hits microsecond latency" }, { "arxiv_id": "2608.03315", "title": "Harvest: Resource-Aware Quantum Compilation for Magic State Protocols", "authors": "Jannik Pflieger, Aleksandra Świerkowska, Emmanouil Giortamis, Pramod Bhatotia", "arxiv_url": "https://arxiv.org/abs/2608.03315", "pdf_url": "https://arxiv.org/pdf/2608.03315", "summary": "Harvest is a resource-aware lattice-surgery compiler that co-optimizes magic-state consumption, circuit-aware placement, and congestion-aware routing under a protocol-agnostic resource model, reclaiming unused layout footprint after scheduling. Across QAOA, QFT, and QASMBench benchmarks, Harvest achieves up to $17.8\\times$ speedup over sequential execution and reclaims up to $72.0\\%$ of unused magic-state patches.", "motivation": "Fault-tolerant quantum computing via lattice surgery requires careful joint optimization of placement, routing, scheduling, and magic-state supply, since decoupling these leads to unnecessary trade-offs between execution time and layout footprint. Existing compilers often hard-code a single magic-state generation protocol, limiting flexibility and efficiency.", "highlights": [ "Average speedup of $4.83\\times$, up to $17.8\\times$, over sequential execution", "Improves schedule length by up to $1.35\\times$ via circuit-aware placement", "Reclaims up to $72.0\\%$ of unused magic-state patches and $33.9\\%$ of routing patches" ], "keywords": [ { "label": "Lattice Surgery", "reason": "Compiler targets topological code operations via lattice surgery" }, { "label": "Magic States", "reason": "Co-optimizes magic-state distillation and cultivation supply protocols" }, { "label": "Compilation", "reason": "Presents a resource-aware compiler for fault-tolerant quantum programs" }, { "label": "Routing", "reason": "Introduces congestion-aware routing across the 2D patch layout" } ], "emoji": "🌾", "social_summary": "Harvest compiler co-optimizes magic-state supply, placement and routing, speeding up fault-tolerant quantum programs by up to 17.8x.", "highlights_oneliner": "Resource-aware compiler co-optimizes magic states and routing" }, { "arxiv_id": "2608.02944", "title": "The Utility of Sparse Error Detection in Quantum Simulations", "authors": "Henry Froland, Dorota M. Grabowska, Sebastian Grieninger, Jeremy Hartse, Anne L. Lashbrook, Zhiyao Li, Ziyuan Li, Sarah J. M. Powell, Martin J. Savage, Xiaojun Yao, Nikita A. Zemlevskiy", "arxiv_url": "https://arxiv.org/abs/2608.02944", "pdf_url": "https://arxiv.org/pdf/2608.02944", "summary": "This work studies sparse error detection for simulating the lattice Schwinger model using the Iceberg code family $[[N+2,N,2]]$ and Hypercube code family $[[2^N,N,2]]$. Noisy classical simulations with realistic near-term error rates show that infrequent syndrome measurements combined with physics-aware postselection improve observable estimation, with large single code blocks advantageous absent connectivity constraints.", "motivation": "Recent demonstrations of logical qubits across diverse hardware platforms suggest near-term fault tolerance is becoming feasible, motivating heterogeneous simulations that mix error detection and correction to extend the scientific reach of quantum computers. Lightweight error-detecting codes offer reduced qubit and gate overhead compared to full QEC, making them attractive for near-term lattice gauge theory simulations.", "highlights": [ "Embeds lattice Schwinger model into Iceberg $[[N+2,N,2]]$ and Hypercube $[[2^N,N,2]]$ code families", "Large code blocks outperform multi-block embeddings absent connectivity constraints", "Additional error-detection rounds systematically drive observable errors toward the code's noise floor" ], "keywords": [ { "label": "Error Detection", "reason": "Focuses on sparse error-detecting codes rather than full correction" }, { "label": "Lattice Gauge Theory", "reason": "Simulates the lattice Schwinger model as a physics application" }, { "label": "Iceberg Code", "reason": "One of the two code families studied for embedding the simulation" }, { "label": "Postselection", "reason": "Uses physics-aware postselection to improve observable accuracy" } ], "emoji": "🧊", "social_summary": "Sparse error-detecting codes like Iceberg and Hypercube boost accuracy of near-term quantum simulations of lattice gauge theories.", "highlights_oneliner": "Error detection improves near-term lattice simulations" }, { "arxiv_id": "2608.03005", "title": "Quantifying Pauli Errors in Single-Photon Resource-State Generation", "authors": "Yuktee Gupta, Andrew C. Doherty, Sahand Mahmoodian", "arxiv_url": "https://arxiv.org/abs/2608.03005", "pdf_url": "https://arxiv.org/pdf/2608.03005", "summary": "This paper proposes a scheme to compute Pauli error rates in photonic QEC using experimental observables from single photons produced by quantum emitters, via first-order coherence and cross-correlation measurements. The emitted wavefunctions are expressed as matrix-product states, enabling analytic computation of stabilizer expectation values, Pauli error probabilities, and error maps after Bell-state measurements.", "motivation": "Fusion-based photonic quantum computing requires high-quality resource states, and quantum emitters offer a deterministic alternative to probabilistic fusion-generated states, but characterizing their error profiles for QEC purposes has remained an open challenge. Connecting measurable photon observables directly to Pauli error rates provides experimentalists with actionable targets for emitter quality.", "highlights": [ "Derives analytic Pauli error probabilities from photon coherence and cross-correlation measurements", "Shows noise bias differs by emitter type: $Z$ errors in three-level, $X$ errors in four-level emitters", "Four-level emitters reduce coherent-leakage-induced depolarizing noise by a factor of two" ], "keywords": [ { "label": "Photonic QEC", "reason": "Targets fusion-based photonic quantum error correction" }, { "label": "Quantum Emitters", "reason": "Uses observables from single-photon quantum emitter sources" }, { "label": "Pauli Errors", "reason": "Central quantity computed is Pauli error probability from noise parameters" }, { "label": "MPS", "reason": "Represents emitted photon wavefunctions as matrix-product states" } ], "emoji": "💡", "social_summary": "Researchers link measurable photon properties directly to Pauli error rates, guiding emitter design for fusion-based photonic quantum computing.", "highlights_oneliner": "Mapping photon observables to Pauli error rates" }, { "arxiv_id": "2608.03944", "title": "Exact Tradeoff Between Quantum Error Correction and Quantum Darwinism: An Information-Theoretic No-Go Theorem", "authors": "Arghya Maity, Kelvin Onggadinata, Teck Seng Koh", "arxiv_url": "https://arxiv.org/abs/2608.03944", "pdf_url": "https://arxiv.org/pdf/2608.03944", "summary": "The authors construct an exactly solvable block-environment model using the logical GHZ block of the Shor $[[9,1,3]]$ code coupled to $N$ environment qubits, deriving logical fidelity, Holevo information, and Darwinistic redundancy for arbitrary environment size and imperfect recovery. Eliminating the shared decoherence parameter yields an exact tradeoff relation and a model-independent no-go theorem showing high logical fidelity precludes Darwinistic redundancy.", "motivation": "Quantum error correction and Quantum Darwinism represent opposing consequences of system-environment coupling—preserving quantum information versus proliferating classical records—yet no quantitative connection between them had previously been established. Understanding this tradeoff sheds light on fundamental limits linking information protection and the emergence of classical objectivity from quantum systems.", "highlights": [ "Exactly solvable model links Shor $[[9,1,3]]$ code fidelity to Darwinistic redundancy", "Derives exact tradeoff relation between post-recovery logical fidelity and redundancy", "Proves model-independent no-go theorem: high fidelity precludes redundant classical records" ], "keywords": [ { "label": "Quantum Darwinism", "reason": "Explores the tradeoff between QEC and Darwinistic redundancy emergence" }, { "label": "Shor Code", "reason": "Uses the logical GHZ block of the Shor $[[9,1,3]]$ code as the model system" }, { "label": "No-Go Theorem", "reason": "Proves a model-independent bound linking fidelity and redundancy" }, { "label": "Holevo Information", "reason": "Computes Holevo information as part of the redundancy analysis" } ], "emoji": "🌱", "social_summary": "A solvable Shor-code model proves protecting quantum information and objective classical records are fundamentally at odds.", "highlights_oneliner": "No-go theorem links QEC fidelity and Darwinism" }, { "arxiv_id": "2608.03325", "title": "Protected measurements for protected superconducting qubits", "authors": "Xanda C Kolesnikow, Thomas B Smith, Andrew C Doherty", "arxiv_url": "https://arxiv.org/abs/2608.03325", "pdf_url": "https://arxiv.org/pdf/2608.03325", "summary": "This work presents a concrete scheme for performing protected measurements of the $0$-$\\pi$ qubit in two orthogonal bases without breaking its intrinsic error protection. The measurement protection relies on quantum non-demolition properties, allowing faults on ancillary measurement qubits to be tolerated while preserving the logical qubit's noise resilience.", "motivation": "Protected superconducting qubits like the $0$-$\\pi$ qubit promise dramatically suppressed error rates for fault-tolerant computing with fewer physical qubits, but no prior proposal existed for measuring them without compromising their protection. As experimental efforts push these qubits into low-error regimes, reliable protected readout becomes essential for practical fault-tolerant control.", "highlights": [ "First concrete proposal for protected readout of the $0$-$\\pi$ qubit", "Measurements performed in two orthogonal logical bases", "QND nature of measurement tolerates faults on ancillary qubits" ], "keywords": [ { "label": "0-π Qubit", "reason": "Central hardware platform is the protected $0$-$\\pi$ superconducting qubit" }, { "label": "QND Measurement", "reason": "Protection relies on quantum non-demolition measurement properties" }, { "label": "Protected Qubits", "reason": "Focuses on preserving intrinsic hardware-level error protection" }, { "label": "Fault Tolerance", "reason": "Aims to enable fault-tolerant universal control of protected qubits" } ], "emoji": "🛡️", "social_summary": "New protocol enables protected readout of the 0-pi superconducting qubit without sacrificing its built-in error protection.", "highlights_oneliner": "First protected readout scheme for 0-π qubit" } ] }, "2026-08-04": { "word_cloud": [ { "word": "GKP", "weight": 5 }, { "word": "Decoders", "weight": 5 }, { "word": "Surface", "weight": 3 }, { "word": "Lattice", "weight": 4 }, { "word": "GHZ", "weight": 2 }, { "word": "Sensing", "weight": 3 }, { "word": "Bosonic", "weight": 3 }, { "word": "Readout", "weight": 2 }, { "word": "Topological", "weight": 3 }, { "word": "Neutral", "weight": 2 }, { "word": "Cat", "weight": 2 }, { "word": "Gauge", "weight": 2 }, { "word": "Sparse", "weight": 2 }, { "word": "Fisher", "weight": 2 }, { "word": "Barnes-Wall", "weight": 2 } ], "social_highlights": "Highlights: loss-tolerant GKP decoding, microwave cat-bus neutral-atom architecture, Pangaea's heterogeneous topological bus, Zero-G's fast pre-decoder pairing, Barnes-Wall GKP decoding speedup, Oraqle readout benchmarking, Gauss's law lattice gauge codes, maximum-utility GHZ decoding, fault-tolerant Heisenberg sensing, sublinear T-count sparse state prep, and finite-syndrome Fisher information compression.", "papers": [ { "arxiv_id": "2608.00830", "title": "Measurement-Based Loss Tolerance in Graph-GKP Codes through Syndrome-Resolved Pauli-Frame Decoding", "authors": "Seid Koudia, Symeon Chatzinotas", "arxiv_url": "https://arxiv.org/abs/2608.00830", "pdf_url": "https://arxiv.org/pdf/2608.00830", "summary": "The authors develop a causal decoding framework unifying graph-state redundancy with GKP analog error information for loss-tolerant measurement-based quantum computation under pure loss and quantum-limited amplification. Local GKP recovery yields a continuous syndrome record, a confidence score, and a possible located-erasure conversion, all of which feed into a syndrome-resolved posterior over graph branches that determines the outgoing logical Pauli frame. Numerical simulations reveal squeezing-dependent loss tolerance and finite-depth pseudothresholds for square and hexagonal GKP lattices.", "motivation": "Photonic and bosonic fault-tolerant architectures must handle loss, finite squeezing, and probabilistic operations simultaneously, and prior approaches typically treat local bosonic decoding and graph-level loss tolerance as separate, serially composed problems. Unifying these mechanisms into a single causal statistical layer is needed to properly exploit both multiple logical representatives on graph codes and continuous GKP syndrome information for scalable photonic quantum computation.", "highlights": [ "Introduces confidence-dependent conversion of low-confidence GKP outcomes into located erasures usable by graph redundancy", "Derives decoder-conditioned branch restriction and syndrome-resolved logical fusion for concatenated graph-GKP modules", "Identifies finite-depth pseudothresholds and task-dependent loss tolerance across squeezing levels for square and hexagonal GKP lattices" ], "keywords": [ { "label": "GKP Codes", "reason": "The paper builds its bosonic recovery layer on Gottesman-Kitaev-Preskill encoding of continuous displacement noise" }, { "label": "Graph Codes", "reason": "Multiple physical representatives of logical observables on graph states underpin the loss-tolerance mechanism" }, { "label": "Loss Tolerance", "reason": "The central goal is measurement-based tolerance to photon loss and amplification noise" }, { "label": "Pauli Frame Tracking", "reason": "The decoder updates an outgoing logical Pauli frame based on syndrome-resolved posteriors" } ], "emoji": "📡", "social_summary": "Combines graph-state redundancy with GKP analog syndromes to build a causal, loss-tolerant decoder for photonic quantum computing.", "highlights_oneliner": "Causal decoder fuses GKP syndromes with graph redundancy for loss tolerance" }, { "arxiv_id": "2608.01111", "title": "Fault-tolerant quantum computing with a microwave Cat Bus", "authors": "Yanyan Chen, Xinyang Yu, Yueyang Min, Zhihao Zhang, Shuaifan Cao, Xiaopeng Li", "arxiv_url": "https://arxiv.org/abs/2608.01111", "pdf_url": "https://arxiv.org/pdf/2608.01111", "summary": "The authors propose a shuttling-free neutral-atom architecture achieving all-to-all connectivity via a microwave 'Cat Bus,' a cavity mode stabilized in a bosonic cat state that resonantly entangles remote Rydberg atoms through parallelized one-to-many $CZ^n$ gates. They derive the cat-atom error channel and design a hardware-aware minimum-depth syndrome-extraction schedule, benchmarking against hypergraph-product codes to show a $180$-fold cycle-time reduction and threshold improvements from $0.55\\%$ to $0.72$-$0.80\\%$.", "motivation": "Neutral-atom qLDPC architectures are bottlenecked by the mechanical latency of optical-tweezer shuttling, forcing costly space-time trade-offs in fault-tolerant compilation. Replacing physical atom transport with a bosonic-cat-mediated photonic interconnect could remove this kinematic bottleneck while retaining hardware-level error resilience against photon loss.", "highlights": [ "180-fold reduction in syndrome-extraction cycle time at $N=10^5$ data qubits versus atom-rearrangement architectures", "Error threshold increases from $0.55\\%$ to $0.72\\%$ under matched depolarizing noise, and $0.80\\%$ under hardware-derived noise", "Derives a minimum-depth syndrome-extraction schedule using native cat-atom $CZ^n$ gates for hypergraph-product codes" ], "keywords": [ { "label": "Neutral Atoms", "reason": "The architecture is built on Rydberg-atom qubits requiring all-to-all connectivity" }, { "label": "Cat Codes", "reason": "The microwave Cat Bus uses an autonomously stabilized bosonic cat state to mediate entangling gates" }, { "label": "qLDPC Codes", "reason": "Hypergraph-product codes are used to benchmark the architecture's error-correction performance" }, { "label": "Thresholds", "reason": "The paper reports improved fault-tolerance thresholds under matched and hardware-derived noise models" } ], "emoji": "🐱", "social_summary": "A microwave cat-state bus enables shuttling-free, all-to-all connected neutral-atom quantum computing with much faster error correction cycles.", "highlights_oneliner": "Cat-state microwave bus replaces atom shuttling for fast QEC" }, { "arxiv_id": "2608.01887", "title": "The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus", "authors": "Sheir Yarkoni, Chen Scheim, Daniel Hakshuri, Nadav Katz", "arxiv_url": "https://arxiv.org/abs/2608.01887", "pdf_url": "https://arxiv.org/pdf/2608.01887", "summary": "Pangaea introduces a fault-tolerant architecture using an auxiliary gauge-code quantum bus strip to mediate logical operations between remote patches of 2D topological codes while preserving nearest-neighbor physical connectivity, effectively realizing a 3D generalization of lattice surgery. The scheme requires only $O(dN_L)$ physical qubits for multi-qubit interactions among $N_L$ distance-$d$ logical qubits, versus $O(d^2N_L)$ for standard planar architectures, and is verified via pseudo-threshold simulations of long-range CNOT primitives between surface and color codes.", "motivation": "Superconducting fault-tolerant processors face a connectivity bottleneck because scalable logical operations across many encoded qubits require routing beyond the limited nearest-neighbor physical connectivity of the hardware. Existing lattice-surgery approaches either need increased physical connectivity or incur large qubit overheads, motivating a bus-mediated approach that supports heterogeneous code patches with reduced resource cost.", "highlights": [ "Achieves $O(dN_L)$ physical-qubit scaling for multi-qubit interactions, up to $10\\times$ savings versus planar architectures at 50 logical qubits", "Verifies fault-tolerant long-range measurement-based CNOT for both surface-surface and surface-color joint parity measurements", "Demonstrates a native heterogeneous 15-to-1 magic-state distillation module built using the quantum bus" ], "keywords": [ { "label": "Lattice Surgery", "reason": "The quantum bus is framed as a 3D generalization of lattice surgery for joint logical operations" }, { "label": "Surface Codes", "reason": "Surface-code patches are one of the topological code types connected by the bus" }, { "label": "Color Codes", "reason": "Surface-color joint parity measurements are explicitly verified in the architecture" }, { "label": "Magic States", "reason": "A 15-to-1 magic-state distillation module is constructed using the heterogeneous bus" } ], "emoji": "🌍", "social_summary": "Pangaea uses a gauge-code quantum bus to connect distant topological code patches, cutting qubit overhead tenfold versus planar surface codes.", "highlights_oneliner": "Quantum bus links heterogeneous topological codes with less overhead" }, { "arxiv_id": "2608.02030", "title": "Zero-G: A Pre-Decoder-Aware Decoder for Quantum Error Correction", "authors": "Peter Wegmann, Theofilos Augoustis, Aleksandra Świerkowska, Emmanouil Giortamis, Pramod Bhatotia", "arxiv_url": "https://arxiv.org/abs/2608.02030", "pdf_url": "https://arxiv.org/pdf/2608.02030", "summary": "Zero-G is a stochastic approximate minimum-weight perfect matching decoder specifically designed to exploit the sparse residual syndromes produced by pre-decoders, unlike existing strong decoders built for dense syndromes. It dynamically trades latency for accuracy and decouples hardware control from the decoding core, enabling deployment on both FPGAs and CPUs, achieving a $10\\times$ latency improvement with sub-$350$ns decoding at code distances up to $d=15$.", "motivation": "Real-time decoding is essential for fault-tolerant quantum computing since undecoded syndromes accumulate into an unbounded backlog, and while pre-decoders promise speedups by sparsifying residual syndromes, existing strong decoders cannot exploit this sparsity in practice. This gap motivates a decoder co-designed with pre-decoding pipelines to realize the theoretical speedup.", "highlights": [ "Achieves $10\\times$ latency improvement over existing strong decoders at matching accuracy", "Sub-$350$ns worst-case decoding latency at code distances up to $d=15$", "Scales to 640 logical qubits on a single 128-core CPU and 32 logical qubits on an AMD Versal V80 FPGA" ], "keywords": [ { "label": "MWPM", "reason": "Zero-G is a stochastic approximate minimum-weight perfect matching decoder" }, { "label": "Pre-Decoders", "reason": "The decoder is explicitly co-designed to exploit sparse residual syndromes from pre-decoding" }, { "label": "Real-Time Decoding", "reason": "The paper targets meeting strict latency budgets to avoid decoding backlog" }, { "label": "FPGA", "reason": "Zero-G supports heterogeneous deployment across FPGAs and CPUs" } ], "emoji": "⚡", "social_summary": "Zero-G is a sparsity-aware decoder that pairs with pre-decoders to achieve tenfold faster real-time quantum error correction.", "highlights_oneliner": "Sparse-syndrome-aware decoder speeds up real-time QEC" }, { "arxiv_id": "2608.00601", "title": "Symplectic Barnes-Wall GKP Codes: Deterministic $O(N \\log^2 N)$ Decoding and Logarithmic Rate Scaling", "authors": "Shanxiang Lyu", "arxiv_url": "https://arxiv.org/abs/2608.00601", "pdf_url": "https://arxiv.org/pdf/2608.00601", "summary": "This work constructs an explicit symplectic realization of the Barnes-Wall lattice yielding multimode GKP codes with encoding rate $R=\\frac{1}{2}\\log_2 N$ and a deterministic $O(N\\log^2 N)$ bounded-distance decoder. A recursive generator $G_{m+1}$ built from $R_m = I+\\Omega$ preserves symplectic integrality and the exact Barnes-Wall decoding structure through isometric isomorphisms, with the code distance held constant at $\\Delta^2=1$.", "motivation": "GKP lattice codes require efficient decoders and well-understood distance-rate tradeoffs to be practical, but many multimode lattice constructions lack both explicit symplectic structure and fast deterministic decoding algorithms. Leveraging the well-studied Barnes-Wall lattice and its fast decoding algorithms offers a path to space-efficient GKP codes compatible with non-local modular connectivity.", "highlights": [ "Explicit recursive symplectic generator construction guaranteeing valid quantum stabilizers", "Deterministic $O(N\\log^2 N)$ bounded-distance decoding inherited from Barnes-Wall lattice structure", "Logarithmic encoding rate $R=\\frac{1}{2}\\log_2 N$ achieved with constant code distance $\\Delta^2=1$" ], "keywords": [ { "label": "GKP Codes", "reason": "The construction produces multimode Gottesman-Kitaev-Preskill bosonic codes" }, { "label": "Barnes-Wall Lattice", "reason": "The symplectic realization is built directly on the Barnes-Wall lattice family" }, { "label": "Decoding Complexity", "reason": "The paper's central contribution is a deterministic $O(N\\log^2 N)$ decoding algorithm" }, { "label": "Rate-Distance Tradeoff", "reason": "The paper explicitly analyzes logarithmic rate scaling against constant code distance" } ], "emoji": "🔷", "social_summary": "A new symplectic Barnes-Wall lattice construction gives fast, deterministic decoding for multimode GKP bosonic codes.", "highlights_oneliner": "Fast deterministic decoder for Barnes-Wall GKP codes" }, { "arxiv_id": "2608.01939", "title": "Oraqle: An Empirical Analysis of Qubit Readout and Discriminators in Quantum Error Correction", "authors": "Emmanouil Giortamis, Aleksandra Świerkowska, Sandra Stankovic, Felix Gust, Benjamin Lienhard, Pramod Bhatotia", "arxiv_url": "https://arxiv.org/abs/2608.01939", "pdf_url": "https://arxiv.org/pdf/2608.01939", "summary": "Oraqle is an end-to-end benchmarking framework evaluating how qubit-state readout characteristics, readout duration, and ML discriminator co-design affect QEC performance, using real experimentally extracted readout datasets across multiple QEC codes and hardware regimes. The study finds measurement duration can be cut substantially with negligible logical-error penalty, discriminator complexity has minimal impact since residual errors stem from device physics, and readout's effect on logical error rate is conditional on hardware maturity.", "motivation": "Readout is the decoder's sole source of ground truth in the QEC measure-decode-correct loop, yet it is also the slowest and most error-prone operation, with its co-design with FPGA-hosted ML discriminators poorly understood. A systematic, empirical, systems-level study is needed to determine which readout and discriminator design choices actually matter for logical error rates.", "highlights": [ "Measurement duration can be cut to about 600ns with negligible logical error rate penalty, reclaiming roughly 40% of readout latency", "Discriminator architecture complexity barely affects QEC performance since ~99.8% of residual misclassifications are device-physics limited", "Readout's impact on logical error rate is conditional on hardware regime, with the relevant window widening as devices mature" ], "keywords": [ { "label": "Readout", "reason": "The paper is centered on empirically analyzing qubit-state readout in the QEC loop" }, { "label": "ML Discriminators", "reason": "FPGA-hosted machine-learning discriminators for syndrome classification are a key co-design axis studied" }, { "label": "Benchmarking", "reason": "Oraqle is an end-to-end benchmarking framework across codes and hardware regimes" }, { "label": "Logical Error Rate", "reason": "The study quantifies how readout choices propagate to logical error rate across six QEC codes" } ], "emoji": "📊", "social_summary": "Oraqle benchmarks real readout data to show measurement time can be cut sharply without hurting quantum error correction performance.", "highlights_oneliner": "Empirical study of readout and discriminators in QEC" }, { "arxiv_id": "2608.00165", "title": "Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\\mathbb Z_2$ Lattice Gauge Theory", "authors": "Neel S. Modi, Lento Nagano, Masazumi Honda, Nobuyuki Yoshioka, Christian W. Bauer", "arxiv_url": "https://arxiv.org/abs/2608.00165", "pdf_url": "https://arxiv.org/pdf/2608.00165", "summary": "The authors generalize prior $\\mathbb{Z}_2$ Gauss's-law-based quantum error-correcting codes, robust only against single-qubit errors, to a family robust against arbitrary $t$-qubit errors for any positive integer $t$, deriving the optimal code within this family by minimizing physical qubit count for a given distance. They compare these Gauss's law codes against other efficient QECCs on physical qubit overhead, encoded Hamiltonian locality, and logical error rate in the code capacity setting.", "motivation": "Simulating lattice gauge theories on quantum computers benefits from error-correcting codes that naturally exploit the theory's own gauge symmetry constraints rather than generic domain-agnostic codes applied per degree of freedom. Extending single-error-robust Gauss's law codes to arbitrary distance is important for practically encoding gauge theory Hamiltonians with reduced locality and qubit overhead.", "highlights": [ "Generalizes Gauss's law QECCs to robustness against arbitrary $t$-qubit errors for any positive integer $t$", "Derives the optimal Gauss's law code minimizing physical qubits for a given code distance", "Shows reduced physical qubit overhead versus domain-agnostic codes for $t \\le 3$ (distance $d \\le 7$) and reduced encoded Hamiltonian locality" ], "keywords": [ { "label": "Lattice Gauge Theory", "reason": "The codes are built from Gauss's law constraints in $\\mathbb{Z}_2$ lattice gauge theory" }, { "label": "Gauss's Law", "reason": "The core error-correcting mechanism exploits Gauss's law constraints as code structure" }, { "label": "Code Distance", "reason": "The paper derives codes optimized for arbitrary code distance $d$" }, { "label": "Hamiltonian Locality", "reason": "The comparison metric of encoded Hamiltonian locality is central to evaluating code efficiency" } ], "emoji": "🔗", "social_summary": "Gauss's law constraints in $\\mathbb{Z}_2$ lattice gauge theory yield optimal quantum codes robust against arbitrary numbers of qubit errors.", "highlights_oneliner": "Gauss's law codes generalized to arbitrary error distance" }, { "arxiv_id": "2608.00160", "title": "Optimal Decoding for Measurement-Based GHZ State Preparation: The Maximum-Utility Decoder", "authors": "Misha Yutushui, Theo Haas, Simon Trebst", "arxiv_url": "https://arxiv.org/abs/2608.00160", "pdf_url": "https://arxiv.org/pdf/2608.00160", "summary": "The authors frame decoding for measurement-based GHZ state preparation as minimum Bayesian risk inference, introducing a maximum-utility decoder (MUD) that maximizes the expected continuous long-range order of the decoded state rather than binary logical recovery as in MWPM or MLD. A scalable two-stage decoder—gauge-aware edge-weighted MWPM refined by a CNN trained on the utility function—achieves near-optimal performance, closing up to 87% of the gap between bare-MWPM and optimal decoding thresholds at sizes up to $N=256\\times256$.", "motivation": "Standard decoders like MWPM and MLD optimize binary logical recovery, but GHZ-state preparation quality is better characterized by continuous long-range order, meaning conventional decoders can bottleneck state-of-the-art measurement-based protocols. A decoding framework explicitly targeting the operational figure of merit is needed to fully realize the benefits of low-depth measurement-based GHZ preparation.", "highlights": [ "Introduces the maximum-utility decoder generalizing MWPM and MLD via Bayesian risk minimization over a chosen utility function", "Two-stage decoder combining gauge-aware MWPM with a CNN closes up to 87% of the gap to optimal decoding thresholds at $N=256\\times256$", "Shows gauge-aware MWPM alone, at no extra cost over bare MWPM, already performs near-optimally" ], "keywords": [ { "label": "GHZ States", "reason": "The paper targets optimal decoding for measurement-based preparation of GHZ states" }, { "label": "Bayesian Decoding", "reason": "MUD is derived from minimum Bayesian risk inference over a utility function" }, { "label": "MWPM", "reason": "A gauge-aware minimum weight perfect matching stage forms part of the scalable decoder" }, { "label": "Neural Decoders", "reason": "A convolutional neural network refines the decoder to approach optimal utility" } ], "emoji": "🎯", "social_summary": "A new Bayesian maximum-utility decoder optimizes GHZ state quality directly, nearly closing the gap to optimal decoding performance.", "highlights_oneliner": "Bayesian utility-maximizing decoder for GHZ preparation" }, { "arxiv_id": "2608.00171", "title": "Fault-Tolerant Heisenberg-Limited Quantum Sensing", "authors": "Lorcan O. Conlon, Yu-Xin Wang, Erfan Abbasgholinejad, Victor V. Albert, Michael J. Gullans, Alexey V. Gorshkov", "arxiv_url": "https://arxiv.org/abs/2608.00171", "pdf_url": "https://arxiv.org/pdf/2608.00171", "summary": "The paper imports fault-tolerant quantum computing techniques into quantum sensing by considering a biased noise model where phase-flip errors are exponentially suppressed relative to bit-flip errors occurring with probability $p$. Using an $N$-qubit repetition code, the authors show that Heisenberg scaling can be maintained for sensing times up to $T\\propto 1/p^{(N+1)/2}$, a dramatic improvement over the $T\\propto 1/p$ limit achievable without fault-tolerant protocols.", "motivation": "Quantum sensors promise sensitivity beyond classical limits, but quantum advantages such as Heisenberg scaling are typically fragile and quickly destroyed by realistic noise and imperfect calibration. Bringing fault-tolerance concepts, previously developed for quantum computing, into the sensing domain offers a principled way to protect metrological advantage against noise.", "highlights": [ "Established a biased noise model linking bit-flip probability $p$ to exponentially suppressed phase-flip errors", "Showed Heisenberg scaling persists up to sensing time $T\\propto 1/p^{(N+1)/2}$ using an $N$-qubit repetition code", "Demonstrated substantial improvement over the standard $T\\propto 1/p$ bound achievable without fault-tolerant protocols" ], "keywords": [ { "label": "Repetition Code", "reason": "The core protocol uses an $N$-qubit repetition code to protect the sensing advantage." }, { "label": "Heisenberg Limit", "reason": "The paper's central goal is preserving Heisenberg-limited scaling under noise." }, { "label": "Biased Noise", "reason": "The model relies on an asymmetric noise structure where phase-flips are exponentially rarer than bit-flips." }, { "label": "Fault Tolerance", "reason": "The approach directly imports fault-tolerant quantum computing concepts into sensing protocols." } ], "emoji": "🎯", "social_summary": "Researchers show fault-tolerant repetition codes can extend Heisenberg-limited quantum sensing far beyond previous noise limits.", "highlights_oneliner": "Fault tolerance extends Heisenberg-limited sensing under biased noise" }, { "arxiv_id": "2608.00414", "title": "Sparse Quantum State Preparation with Sublinear T-Count", "authors": "Jingquan Luo, Lvzhou Li", "arxiv_url": "https://arxiv.org/abs/2608.00414", "pdf_url": "https://arxiv.org/pdf/2608.00414", "summary": "This work studies the fault-tolerant cost, measured in $T$-count, of preparing $s$-sparse $n$-qubit quantum states within the Clifford+$T$ model. The authors present a new synthesis algorithm achieving $\\widetilde{O}(\\min\\{s,\\ n^{3/4}\\sqrt{s}\\}+\\sqrt{s\\log(1/\\varepsilon)}+\\log(1/\\varepsilon))$ $T$-gates, the first sublinear dependence on $s$ for sufficiently large support, complemented by a matching lower bound of $\\Omega(\\min\\{s,\\sqrt{ns}\\})$ in the small-support regime.", "motivation": "Sparse state preparation is a fundamental primitive in quantum algorithms, and minimizing $T$-count is crucial since $T$-gates dominate the cost of fault-tolerant quantum computation. Prior upper bounds scaled linearly in the sparsity parameter $s$, leaving open whether more efficient sublinear constructions were possible, a gap this paper substantially closes.", "highlights": [ "Achieved sublinear $T$-count scaling in $s$ for sufficiently large support via a new synthesis algorithm", "Introduced a support-aware synthesis theorem for sparse Boolean functions as a key technical tool", "Proved matching lower bound $\\Omega(\\min\\{s,\\sqrt{ns}\\})$ showing linear dependence is unavoidable in the small-support regime" ], "keywords": [ { "label": "T-count", "reason": "The paper's central cost metric is the number of $T$-gates needed for state preparation." }, { "label": "Sparse States", "reason": "The work specifically targets preparation of $s$-sparse quantum states." }, { "label": "Clifford+T", "reason": "The fault-tolerant cost model used throughout is the Clifford+$T$ gate set." }, { "label": "Lower Bounds", "reason": "The paper proves matching lower bounds on $T$-count for small-support states." } ], "emoji": "🧮", "social_summary": "New algorithm prepares sparse quantum states with sublinear T-gate cost, narrowing the gap to matching lower bounds.", "highlights_oneliner": "Sublinear T-count algorithm for sparse state preparation" }, { "arxiv_id": "2608.02333", "title": "Finite-Syndrome Compression of Quantum Fisher Information", "authors": "Jianqi Sheng", "arxiv_url": "https://arxiv.org/abs/2608.02333", "pdf_url": "https://arxiv.org/pdf/2608.02333", "summary": "This paper formulates and solves the problem of compressing a fine-grained classical-quantum noise record into at most $M$ syndrome flags while minimizing loss of quantum Fisher information (QFI). It proves an exact identity expressing lost SLD QFI as a state-weighted squared distance between fine and coarse SLD scores, reformulating optimal syndrome design as an operator-valued clustering problem, and derives exact results including a chromatic-number threshold for code recovery and a closed-form optimum $F_M^{\\star}=[M\\sin(\\pi/M)/\\pi]^2$ for a planar random-Pauli model.", "motivation": "Readable error records, as used in quantum error correction and erasure conversion, can preserve metrological information that would otherwise be lost to noise, but real detectors and ancillas can only store finitely many syndrome values. Understanding exactly how much quantum Fisher information is lost under finite syndrome resolution is essential for designing practical, information-theoretically optimal quantum sensing protocols.", "highlights": [ "Derived an exact identity linking lost SLD QFI to squared distances between fine and coarse SLD scores", "Reformulated optimal finite-syndrome design as an operator-valued clustering problem with a zero-loss common-SLD condition", "Obtained closed-form optimum $F_M^{\\star}=[M\\sin(\\pi/\\pi M)]^2$-type result with deficit $\\pi^2/(3M^2)+O(M^{-4})$ for a planar random-Pauli noise model" ], "keywords": [ { "label": "Quantum Fisher Info", "reason": "The paper's central metric is the symmetric-logarithmic-derivative quantum Fisher information." }, { "label": "Syndrome Compression", "reason": "The core problem addressed is compressing error syndromes into a finite number of flags." }, { "label": "Error Correction", "reason": "The framework connects to Knill-Laflamme conditions and exact code recovery via a chromatic-number threshold." }, { "label": "Pauli Noise", "reason": "A key case study analyzes a planar random-Pauli noise model with closed-form optimal compression." } ], "emoji": "🔍", "social_summary": "New theory reveals exactly how much quantum sensing information is lost when noise syndromes are compressed into finite flags.", "highlights_oneliner": "Exact bounds on quantum Fisher information loss from syndrome compression" } ] }, "2026-08-03": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "Surface", "weight": 5 }, { "word": "Lattice", "weight": 4 }, { "word": "Erasure", "weight": 4 }, { "word": "Decoders", "weight": 4 }, { "word": "Neutral-Atom", "weight": 3 }, { "word": "Distributed", "weight": 3 }, { "word": "Leakage", "weight": 3 }, { "word": "Neural", "weight": 3 }, { "word": "Toric", "weight": 3 }, { "word": "Syndrome", "weight": 2 }, { "word": "Stabilizer", "weight": 2 }, { "word": "Anyon", "weight": 2 }, { "word": "Hamiltonians", "weight": 2 }, { "word": "Loss", "weight": 2 } ], "social_highlights": "Highlights: mitten qLDPC codes for neutral-atom processors, noisy-link tolerance in distributed lattice surgery, moonwalking erasure surface codes without mid-circuit checks, syndrome-based qubit loss inference, QAdapt's noise-adaptive neural pre-decoding, and gapped parent Hamiltonians for deformed toric code phases.", "papers": [ { "arxiv_id": "2607.28795", "title": "High-rate qLDPC processors", "authors": "Aditya Bhardwaj, Muzhou Ma, Nadine Meister, Robbie King, Dolev Bluvstein, John Preskill, Madelyn Cain, Qian Xu, Hsin-Yuan Huang", "arxiv_url": "https://arxiv.org/abs/2607.28795", "pdf_url": "https://arxiv.org/pdf/2607.28795", "summary": "The authors introduce mitten codes, a family of qLDPC codes based on non-abelian groups with encoding rate $20\\%$ and check weight $9$, achieving distance $18$ or greater with only a few hundred data qubits. Mitten codes support a modular logical toolkit including Clifford operations via surgery gadgets, parallel logical measurements, and simultaneous magic-state injection across all logical qubits.", "motivation": "Building qLDPC processors that are simultaneously high-rate, hardware-friendly, and fast-to-decode has remained an open challenge for scaling fault-tolerant quantum computation beyond the surface code. Exploiting non-abelian group structure allows mitten codes to evade distance bounds that constrain abelian qLDPC constructions, enabling compact, high-performance codes.", "highlights": [ "The $[[300,60,14]]$ mitten code reaches a block logical error rate of $\\sim 10^{-11}$ per round at $0.1\\%$ physical error rate without extrapolation", "15 billion surgery experiments on the $[[540,108,18]]$ code at $0.1\\%$ PER yielded only two logical failures, demonstrating $\\sim 10^{10}$ logical operations", "sQetch, a new distance estimator, is orders of magnitude faster than prior tools and underlies an end-to-end design pipeline mapping to neutral-atom and superconducting hardware" ], "keywords": [ { "label": "qLDPC Codes", "reason": "The paper's central contribution is a new family of qLDPC codes called mitten codes." }, { "label": "Non-abelian Groups", "reason": "Mitten codes are constructed from non-abelian group structures that evade abelian distance bounds." }, { "label": "Lattice Surgery", "reason": "The codes support high-rate surgery gadgets for logical measurements and Clifford operations." }, { "label": "Neutral Atoms", "reason": "The design pipeline maps efficiently onto neutral atom and superconducting hardware with sub-millisecond decoding latency." } ], "emoji": "🧶", "social_summary": "Researchers unveil mitten codes, non-abelian qLDPC codes reaching ultra-low logical error rates with fast decoding for neutral-atom hardware.", "highlights_oneliner": "Non-abelian qLDPC codes enabling high-rate fault-tolerant processors" }, { "arxiv_id": "2607.29186", "title": "Towards the Characterization of Logical Errors in Distributed Lattice Surgery", "authors": "Nitish Kumar Chandra, Reza Nejabati, Eneet Kaur", "arxiv_url": "https://arxiv.org/abs/2607.29186", "pdf_url": "https://arxiv.org/pdf/2607.29186", "summary": "This work analyzes distributed lattice surgery between two surface-code patches hosted on separate quantum processors under heterogeneous noise, focusing on the $XX$ merge operation. Using a phenomenological noise model with distinct bulk and seam error rates approximating circuit-level noise, the authors characterize logical errors in the resulting H-shaped spacetime diagram and estimate thresholds with an MWPM decoder.", "motivation": "Distributed quantum computing offers a scalable alternative to monolithic processors, but inter-module operations mediated by shared entanglement are typically noisier than local gates, threatening fault-tolerant performance. Understanding how this heterogeneous noise affects lattice surgery is essential for designing practical modular surface-code architectures.", "highlights": [ "Characterized logical $ZZ$ errors during an $XX$ merge across two QPUs using a phenomenological noise model with bulk and seam error rates", "Estimated MWPM decoder thresholds showing merge performance remains robust even when the seam is significantly noisier than the bulk", "Provided practical guidance on selecting optimal surface-code distance $d$ and required local-gate and entangled-pair fidelities" ], "keywords": [ { "label": "Distributed QC", "reason": "The paper studies distributed quantum computing architectures connecting quantum modules via entanglement." }, { "label": "Lattice Surgery", "reason": "The core subject is the merge operation, a fundamental lattice surgery subroutine." }, { "label": "Surface Codes", "reason": "Rotated surface-code patches are used as the underlying error-correcting code." }, { "label": "MWPM Decoder", "reason": "Thresholds are estimated using a minimum-weight perfect matching decoder." } ], "emoji": "🔗", "social_summary": "Study shows distributed surface-code merge operations tolerate noisy entanglement links between separate quantum processors.", "highlights_oneliner": "Characterizing errors in distributed surface-code merges" }, { "arxiv_id": "2607.29443", "title": "Erasure surface code circuit without mid-circuit erasure checks", "authors": "Margaret Pavlovich, Ivan Rojkov, Chen Wang, Shruti Puri", "arxiv_url": "https://arxiv.org/abs/2607.29443", "pdf_url": "https://arxiv.org/pdf/2607.29443", "summary": "The authors study conditions for achieving erasure-like error correction performance in the surface code without relying on hardware-costly mid-circuit erasure checks, instead using end-of-line three-state readout. They introduce the moonwalking surface code, a time-reversed variant of the walking surface code, combined with a branch-and-bound decoder tailored to skip-gate leaked-qubit noise.", "motivation": "Erasure errors can be corrected twice as effectively as generic Pauli errors, motivating qubit designs that convert leakage into erasures, but mid-circuit erasure checks add significant hardware overhead. A zero-overhead alternative using only end-of-circuit readout could make erasure-scaling advantages practically accessible.", "highlights": [ "Introduced the moonwalking surface code, a zero-overhead time-reversed variant of the walking surface code", "Showed erasure-like logical error rate scaling is achievable with three-state measurement when leaked qubits cause skipped two-qubit gates", "Developed a branch-and-bound decoder that explicitly incorporates the noise structure of the skip-gate leaked-qubit effect" ], "keywords": [ { "label": "Erasure Errors", "reason": "The paper focuses on achieving the erasure error-correction advantage without mid-circuit checks." }, { "label": "Surface Codes", "reason": "The moonwalking surface code is a new circuit variant of the surface code." }, { "label": "Leakage", "reason": "Leaked qubits and their effect on two-qubit gates are central to the noise model studied." }, { "label": "Decoders", "reason": "A custom branch-and-bound decoder is designed for the skip-gate leaked-qubit noise structure." } ], "emoji": "🚶", "social_summary": "New moonwalking surface code achieves erasure-level error correction benefits without costly mid-circuit erasure check hardware.", "highlights_oneliner": "Zero-overhead erasure advantage via moonwalking surface code" }, { "arxiv_id": "2607.29603", "title": "Qubit Loss Inference with Stabilizer Codes without Leakage Detection Units", "authors": "Shin Nishio, Takeaki Uno, Fumiyoshi Kobayashi, Takahiko Satoh, Dan E. Browne", "arxiv_url": "https://arxiv.org/abs/2607.29603", "pdf_url": "https://arxiv.org/pdf/2607.29603", "summary": "This work investigates whether qubit loss in stabilizer codes can be inferred directly from repeated syndrome measurement statistics rather than dedicated leakage-detection units (LDUs). The authors derive a sufficient detectability condition based on anticommutation between stabilizer checks after removing lost-qubit support, formulate an inference problem relaxed to minimum set cover, and validate the approach on the rotated surface code for trapped-ion and neutral-atom platforms.", "motivation": "Qubit loss is a major obstacle for fault-tolerant quantum computation across photonic, neutral-atom, and trapped-ion platforms, and conventional leakage-detection units impose significant space-time overhead and can introduce new errors. Inferring loss location purely from existing syndrome data could reduce hardware overhead while maintaining fault tolerance.", "highlights": [ "Derived a sufficient condition for loss detectability based on emergent anticommutation between stabilizer checks after removing lost-qubit support", "Formulated the loss-inference problem as a relaxed minimum set cover problem solved via a greedy heuristic", "Showed inference-based and adaptive protocols reduce logical error rate versus a noisy-LDU baseline while requiring fewer space-time overheads on trapped-ion and neutral-atom platforms" ], "keywords": [ { "label": "Qubit Loss", "reason": "The paper's central problem is inferring and correcting qubit loss events." }, { "label": "Stabilizer Codes", "reason": "The detectability condition and inference method are derived for general stabilizer codes." }, { "label": "Surface Codes", "reason": "Evaluations are performed on the rotated surface code via circuit-level simulations." }, { "label": "Set Cover", "reason": "The exact loss-inference problem is relaxed to a minimum set cover formulation." } ], "emoji": "🕳️", "social_summary": "Researchers infer qubit loss locations from syndrome data alone, avoiding costly leakage-detection hardware in trapped-ion and neutral-atom systems.", "highlights_oneliner": "Inferring qubit loss from syndromes, no LDUs needed" }, { "arxiv_id": "2607.28422", "title": "QAdapt: A Noise-Adaptive Neural Pre-Decoding Framework for Quantum Error Correction", "authors": "Ran Miao, Rui Luo, Xiaohan Shan, Xiaoming Sun", "arxiv_url": "https://arxiv.org/abs/2607.28422", "pdf_url": "https://arxiv.org/pdf/2607.28422", "summary": "QAdapt is a noise-adaptive neural pre-decoding framework for surface-code quantum error correction that captures local spatiotemporal correlations in syndrome data and sequentially adapts to evolving noise while mitigating catastrophic forgetting. It forwards a residual syndrome to a conventional global decoder, improving robustness under simulation-to-hardware distribution shift.", "motivation": "Fault-tolerant quantum computing performance is limited not only by physical noise but also by decoder latency, which is exacerbated by strong, heterogeneous, nonstationary hardware noise that degrades fixed neural decoders trained on simulated data. A decoder-compatible adaptive layer is needed to keep pace with evolving hardware conditions without costly full retraining.", "highlights": [ "Consistently reduces logical error rate across 110 synthetic out-of-distribution noise configurations for rotated surface-code memory circuits", "Achieves up to $5.79\\%$ reduction in logical error rate on Google's Willow benchmark data without target-domain fine-tuning", "Reduces backend decoding latency on the residual syndrome by up to $9.32\\%$" ], "keywords": [ { "label": "Neural Decoders", "reason": "QAdapt is a neural network-based pre-decoding module for QEC." }, { "label": "Surface Codes", "reason": "The framework is evaluated on rotated surface-code memory circuits." }, { "label": "Distribution Shift", "reason": "The paper addresses simulation-to-hardware noise distribution shift affecting decoder performance." }, { "label": "Continual Learning", "reason": "QAdapt sequentially adapts to evolving noise while mitigating catastrophic forgetting." } ], "emoji": "🧠", "social_summary": "QAdapt adapts neural pre-decoders to shifting hardware noise, cutting logical errors and latency on Google's Willow chip data.", "highlights_oneliner": "Noise-adaptive neural pre-decoder for surface codes" }, { "arxiv_id": "2607.28740", "title": "Gapped Parent Hamiltonians for the Strongly Deformed Toric Code", "authors": "Nandagopal Manoj, Zack Weinstein, Jason Alicea", "arxiv_url": "https://arxiv.org/abs/2607.28740", "pdf_url": "https://arxiv.org/pdf/2607.28740", "summary": "The authors rigorously construct local gapped parent Hamiltonians for strongly deformed toric code states, which exhibit $m$ anyon condensation alongside perimeter-law Wilson loop scaling under an exact 1-form symmetry. The Hamiltonians contain Wilson loop sums with exponentially decaying coefficients, placing these states within a trivial gapped phase under standard locality bounds.", "motivation": "Local non-unitary deformations of topologically ordered wavefunctions can produce peculiar states that challenge conventional notions of gapped quantum matter, since anyon condensation and perimeter-law Wilson loop scaling typically do not coexist in gapped ground states. Resolving whether such states admit genuine gapped parent Hamiltonians clarifies the boundaries of gapped phase classification and evades a recent no-go theorem.", "highlights": [ "Constructed local gapped parent Hamiltonians for strongly deformed toric code states using exponentially decaying Wilson loop sums", "Demonstrated that perimeter-law Wilson loop scaling does not imply spontaneously broken 1-form symmetry within this locality class", "Evaded a recent no-go theorem by relaxing its assumptions in a way shown to be benign in the thermodynamic limit" ], "keywords": [ { "label": "Toric Code", "reason": "The paper studies the strongly deformed toric code and its parent Hamiltonians." }, { "label": "Anyon Condensation", "reason": "The deformed states exhibit $m$ anyon condensation, a key phenomenon analyzed." }, { "label": "1-form Symmetry", "reason": "Wilson loops charged under an exact 1-form symmetry play a central role in the analysis." }, { "label": "Gapped Phases", "reason": "The work addresses the classification of gapped quantum phases under locality bounds." } ], "emoji": "🌀", "social_summary": "Physicists build gapped parent Hamiltonians for deformed toric code states, revealing subtle limits of gapped phase classification.", "highlights_oneliner": "Gapped Hamiltonians for exotic deformed toric code states" } ] }, "2026-07-31": { "word_cloud": [ { "word": "LDPC", "weight": 5 }, { "word": "Lifted", "weight": 4 }, { "word": "Surgery", "weight": 4 }, { "word": "Decoder", "weight": 3 }, { "word": "Floquet", "weight": 3 }, { "word": "ColorCode", "weight": 3 }, { "word": "Atoms", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "Metrology", "weight": 2 }, { "word": "Silicon", "weight": 2 }, { "word": "Shuttling", "weight": 2 }, { "word": "Simulation", "weight": 2 }, { "word": "Stabilizer", "weight": 2 }, { "word": "AOD", "weight": 2 }, { "word": "Toric", "weight": 1 } ], "social_highlights": "Highlights: rate-1/5 qLDPC codes hit teraquop with hundreds of qubits, canonical lifted-product codes gain a logical gate toolkit, a new lifting method grows lifted-product codes, Floquet schedules enable single-shot multicycle codes, an ASIC decoder cuts latency via temporal parallelism, ZX-calculus automates color-code compilation, SymFT doubles Stim's simulation speed, no-go theorems limit non-Clifford metrology gains, electron shuttling enables robust silicon nuclear spin QEC, and single-AOD primitives speed neutral-atom rearrangements.", "papers": [ { "arxiv_id": "2607.27644", "title": "Quantum LDPC codes with design rate 1/5 and good performance below 1000 physical qubits", "authors": "Yifan Hong", "arxiv_url": "https://arxiv.org/abs/2607.27644", "pdf_url": "https://arxiv.org/pdf/2607.27644", "summary": "This paper introduces ZSZ-LP codes, a new family of quantum LDPC codes with design rate $1/5$ and check weight $9$, built from balanced products of classical LDPC codes sharing non-abelian $\\mathbb{Z}_\\ell \\rtimes \\mathbb{Z}_m$ group symmetries. The codes approach the teraquop regime with only a few hundred physical qubits under $0.1\\%$ circuit-level noise, decoded via GPU-accelerated Relay-BP with millisecond latencies. The work also builds syndrome extraction circuits for reconfigurable atom arrays and equivariant logical Pauli bases that compress the design space for code surgery.", "motivation": "Constant-rate quantum LDPC codes promise asymptotic overhead advantages over surface codes, but finding finite-length instances with strong practical performance at hardware-relevant sizes remains a key bottleneck for near-term fault tolerance. This work targets trapped-ion and neutral-atom platforms by co-designing codes, decoders, and syndrome-extraction schedules for realistic hardware constraints.", "highlights": [ "New $\\mathbb{Z}_\\ell \\rtimes \\mathbb{Z}_m$-symmetric ZSZ-LP code family with rate $1/5$ and check weight $9$", "Teraquop-level performance reached with only a few hundred physical qubits under $0.1\\%$ circuit noise", "Greedy syndrome-extraction scheduling for reconfigurable atom arrays with 30-60 ms rearrangement times" ], "keywords": [ { "label": "qLDPC", "reason": "Paper introduces a new quantum LDPC code family (ZSZ-LP) with rate $1/5$" }, { "label": "Relay-BP", "reason": "Decoding is performed using GPU-accelerated Relay-belief-propagation decoders" }, { "label": "Atom Arrays", "reason": "Syndrome extraction circuits are tailored for reconfigurable neutral-atom hardware" }, { "label": "Code Surgery", "reason": "Equivariant logical Pauli bases are constructed to compress code surgery design space" } ], "emoji": "🧩", "social_summary": "New rate-1/5 quantum LDPC codes reach teraquop performance with just hundreds of qubits on atom-array hardware.", "highlights_oneliner": "Compact rate-1/5 qLDPC codes for near-term hardware" }, { "arxiv_id": "2607.28605", "title": "Logical computation with canonical lifted product codes", "authors": "Han Zheng, Guo Zheng, Liang Jiang, Qian Xu", "arxiv_url": "https://arxiv.org/abs/2607.28605", "pdf_url": "https://arxiv.org/pdf/2607.28605", "summary": "This work co-designs a family of canonical lifted-product (LP) codes with cyclic symmetry together with a full logical instruction set, showing that these codes admit a canonical logical basis with conjugate operators organized into cyclic row/column orbits analogous to hypergraph-product codes. This structure enables constant-depth automorphism and fold-transversal Clifford gates, modular code surgery using a small number of reusable seed gadgets, parallel logical Pauli-product measurements, and parallel magic-state injection.", "motivation": "High-rate qLDPC codes offer dramatic overhead reductions over surface codes, but generic fault-tolerance techniques like code surgery are hard to make efficient and modular without exploiting code structure. By co-designing code and logic together, this work makes ultra-high-rate architectures practically actionable for fault-tolerant computation.", "highlights": [ "Canonical logical basis with cyclic row/column orbit structure for LP codes", "Modular surgery via only 2-4 reusable seed gadgets for codes with over a thousand logical qubits", "Parallel logical Pauli-product measurements and magic-state injection enabled by compact extractors" ], "keywords": [ { "label": "Lifted Product", "reason": "Focuses on lifted-product qLDPC codes with cyclic symmetry" }, { "label": "Code Surgery", "reason": "Introduces modular graph code surgery with reusable seed gadgets" }, { "label": "High-Rate Codes", "reason": "Targets ultra-high-rate quantum architectures with many logical qubits" }, { "label": "Clifford Gates", "reason": "Enables constant-depth automorphism and fold-transversal Clifford gates" } ], "emoji": "🔗", "social_summary": "Canonical lifted-product codes get a full logical toolkit, enabling efficient surgery and gates on high-rate qLDPC architectures.", "highlights_oneliner": "Full logical instruction set for high-rate LP codes" }, { "arxiv_id": "2607.28621", "title": "Lifting Lifted Product Codes", "authors": "Yuta Hirasaki, Jong Yeon Lee", "arxiv_url": "https://arxiv.org/abs/2607.28621", "pdf_url": "https://arxiv.org/pdf/2607.28621", "summary": "This paper develops a systematic algebraic method for lifting lifted product (LP) codes to larger LP codes via group extensions and graph lifts, preserving the local Tanner graph structure while relating code parameters and logical operators through chain and cochain maps. The construction yields LP codes with improved parameters, enables transfer of code-surgery gadgets across lifts with reduced space overhead, and supports parallel product surgery for lifted clustered cyclic codes.", "motivation": "Lifted product codes such as bivariate bicycle codes are among the best-performing finite-size qLDPC codes, but systematic methods for generating larger, better instances while preserving useful structure are limited. This general lifting framework extends beyond prior BB-restricted approaches, offering a broader route to code discovery and efficient logical operations.", "highlights": [ "General algebraic lifting procedure applicable to any LP code, generalizing prior BB-restricted lifts", "Improved code parameters found for lifted BB and clustered cyclic (CC) codes", "Reduced ancillary space overhead for code surgery via chain-map transfer across lifts" ], "keywords": [ { "label": "Lifted Product", "reason": "Central object of study is lifted product qLDPC codes" }, { "label": "Group Extensions", "reason": "Lifting construction is based on group extensions and graph lifts" }, { "label": "Code Surgery", "reason": "Transfers code-surgery gadgets across lifts with lower overhead" }, { "label": "Coherent Information", "reason": "Studies coherent information crossings for thermodynamic code families" } ], "emoji": "📈", "social_summary": "A new algebraic lifting method grows lifted-product qLDPC codes into larger instances with better parameters and cheaper surgery.", "highlights_oneliner": "Systematic lifting method for growing LP codes" }, { "arxiv_id": "2607.27521", "title": "Floquet Abelian Multicycle Codes", "authors": "Alexey A. Kovalev", "arxiv_url": "https://arxiv.org/abs/2607.27521", "pdf_url": "https://arxiv.org/pdf/2607.27521", "summary": "This paper introduces Floquet Abelian multicycle (AMC) codes by deriving a quotient-lattice representation of general level-$j$, $D$-dimensional AMC complexes over finite Abelian group algebras, lifting the lattice to spacetime and rotating the circuit-time direction to obtain periodic schedules of native two-qubit $XX$ and $ZZ$ measurements. Explicit AMC4 examples locally equivalent to four-dimensional toric codes yield Floquet memories with parameters $[[108,6,5]]$, $[[144,6,8]]$, and $[[324,6,10]]$, achieving an estimated pseudothreshold near $1.2\\%$ under measurement-native noise.", "motivation": "Higher-dimensional toric and hypergraph-product codes support single-shot decoding via homological redundancy, but their high-weight stabilizers are impractical to measure directly. Extending Floquet-style measurement-only realizations to Abelian multicycle codes allows this redundancy to be harnessed via compact two-qubit measurement circuits.", "highlights": [ "Quotient-lattice and spacetime-lifting construction turning AMC complexes into Floquet measurement schedules", "New Floquet memories $[[108,6,5]]$, $[[144,6,8]]$, $[[324,6,10]]$ from level-2 AMC4 codes", "Estimated pseudothreshold of approximately $1.2\\%$ under the EM3 measurement-native noise model" ], "keywords": [ { "label": "Floquet Codes", "reason": "Introduces a Floquet measurement-only realization of AMC codes" }, { "label": "Single-Shot QEC", "reason": "AMC codes support single-shot error correction via redundant stabilizers" }, { "label": "4D Toric Codes", "reason": "AMC4 instances are locally equivalent to four-dimensional toric codes" }, { "label": "ZX Calculus", "reason": "Uses rotated ZX networks to derive two-qubit measurement schedules" } ], "emoji": "🌀", "social_summary": "Floquet-style measurement schedules turn Abelian multicycle codes into compact, single-shot-capable quantum memories.", "highlights_oneliner": "Measurement-only Floquet realization of multicycle codes" }, { "arxiv_id": "2607.27930", "title": "Design of a Quantum Error Correction Decoder Exploiting Temporal Parallelism", "authors": "Leo Itoh, Takuya Kasamura, Hidetsugu Irie, Junichiro Kadomoto", "arxiv_url": "https://arxiv.org/abs/2607.27930", "pdf_url": "https://arxiv.org/pdf/2607.27930", "summary": "This work proposes a microarchitecture implementing sandwich decoding with the Union-Find algorithm exploiting temporal parallelism, realized as an ASIC design. Logic synthesis and simulation show a 35% average latency reduction at code distance $d=21$ compared to a conventional batch Union-Find decoder, while maintaining a comparable logical error threshold of approximately $1.5\\%$ under phenomenological noise.", "motivation": "Fault-tolerant quantum computing requires decoding faster than the microsecond-scale syndrome measurement cycle to avoid exponential slowdown from error backlog, yet temporal-parallelism decoding proposals have remained largely theoretical. This paper closes that gap by providing a concrete ASIC microarchitecture demonstrating practical latency gains.", "highlights": [ "35% average and 12% worst-case latency reduction versus batch Union-Find decoder at $d=21$", "ASIC implementation via logic synthesis validates practicality of sandwich decoding", "Maintains threshold near $1.5\\%$ under phenomenological noise despite added parallelism" ], "keywords": [ { "label": "Union-Find", "reason": "Decoder is based on the Union-Find decoding algorithm" }, { "label": "ASIC", "reason": "Concrete hardware implementation via ASIC logic synthesis" }, { "label": "Decoder Latency", "reason": "Focuses on reducing decoding latency via temporal parallelism" }, { "label": "Surface Codes", "reason": "Decoder is evaluated at surface-code-scale distance $d=21$" } ], "emoji": "⚡", "social_summary": "A new ASIC decoder design cuts quantum error correction latency by 35 percent using temporal parallelism.", "highlights_oneliner": "ASIC decoder speeds up Union-Find via parallelism" }, { "arxiv_id": "2607.28504", "title": "Spacetime Layout and Logical Compilation of Color Code", "authors": "Qinjing Yu, Ke Liu", "arxiv_url": "https://arxiv.org/abs/2607.28504", "pdf_url": "https://arxiv.org/pdf/2607.28504", "summary": "This paper establishes a logical compilation framework for the color code based on its anyon-condensation and domain-wall structure, introducing a spacetime block-diagram representation of logical patches and operations with derived block-assembly rules. A correspondence with ZX diagrams enables semantics-preserving transformations, and a code-derived compilation strategy converts ZX representations of algorithms into valid color-code spacetime layouts, automated and demonstrated across multiple algorithmic benchmarks.", "motivation": "Utility-scale fault-tolerant quantum computing requires compiling abstract algorithms into concrete spacetime resource layouts, a process well-developed for surface codes but underexplored for color codes despite their transversal-gate advantages. This work advances the color code from isolated logical primitives toward full-stack, automated compilation.", "highlights": [ "Spacetime block-diagram representation capturing color-code logical patches, pipes, and ports", "ZX-correspondence enabling semantics-preserving transformations of block layouts", "Automated compilation pipeline demonstrated on nine algorithmic benchmarks" ], "keywords": [ { "label": "Color Code", "reason": "Framework is specifically developed for the 2D color code" }, { "label": "ZX Calculus", "reason": "Uses ZX diagram correspondence for compilation semantics" }, { "label": "Compilation", "reason": "Introduces an automated logical compilation pipeline" }, { "label": "Lattice Surgery", "reason": "Block-assembly rules govern logical patch operations akin to surgery" } ], "emoji": "🎨", "social_summary": "A new framework automates compiling quantum algorithms into color-code spacetime layouts using ZX-calculus correspondence.", "highlights_oneliner": "Automated compilation framework for color codes" }, { "arxiv_id": "2607.28600", "title": "SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates", "authors": "Wang Fang, Huazhe Lou, Riling Li", "arxiv_url": "https://arxiv.org/abs/2607.28600", "pdf_url": "https://arxiv.org/pdf/2607.28600", "summary": "SymFT is a high-throughput simulator for Clifford-dominated circuits with Pauli rotations, stochastic Pauli noise, mid-circuit measurements, and measurement-controlled feedback, combining symbolic Clifford-Pauli frame factorization with adaptive stabilizer-coordinate planning that avoids per-shot tableau updates. Across tested near-Clifford circuits, SymFT achieves $2.51$-$2.56\\times$ speedup over Stim for surface-code circuits and $1.86$-$3.51\\times$ over Clifft for magic-state cultivation and distillation, exceeding a prior simulator's throughput by over two orders of magnitude for cultivation circuits.", "motivation": "Fault-tolerant protocols mix cheap stabilizer subcircuits with costly non-Clifford operations needed for universality, making exact sampling of realistic circuits computationally expensive. Faster simulators are essential for validating magic-state cultivation, distillation, and other near-term fault-tolerance protocols at scale.", "highlights": [ "Symbolic Clifford-Pauli frame factorization decouples noise/feedback signs from branch-probability sampling", "Adaptive stabilizer-coordinate planning avoids costly per-shot tableau updates", "Up to $2.56\\times$ speedup over Stim and over $100\\times$ over prior simulator SOFT on cultivation circuits" ], "keywords": [ { "label": "Circuit Simulation", "reason": "Paper presents a new simulator for fault-tolerant quantum circuits" }, { "label": "Magic States", "reason": "Benchmarks include magic-state cultivation and distillation circuits" }, { "label": "Stabilizer Formalism", "reason": "Uses stabilizer-destabilizer tableau and coordinate planning" }, { "label": "Pauli Noise", "reason": "Simulates stochastic Pauli noise and Pauli feedback" } ], "emoji": "💻", "social_summary": "SymFT simulates fault-tolerant quantum circuits over twice as fast as Stim using symbolic Clifford-Pauli frames.", "highlights_oneliner": "Faster simulator for near-Clifford fault-tolerant circuits" }, { "arxiv_id": "2607.27342", "title": "Restrictions on non-Clifford fault tolerance and ruling out beyond-SQL quantum metrology", "authors": "Constantin Cedillo Vayson de Pradenne, Ishaan Kannan, Harald Putterman, Jordan Cotler", "arxiv_url": "https://arxiv.org/abs/2607.27342", "pdf_url": "https://arxiv.org/pdf/2607.27342", "summary": "This paper proves that any stabilizer code of distance $d\\geq 3$ with a transversal logical action at level $D$ of the Clifford hierarchy must have a stabilizer check of weight at least $2^D$, and that $r$-level concatenation satisfies $r \\leq \\lfloor \\log_2 n/D \\rfloor$, forbidding concatenation for beyond-SQL metrology. It further shows transversal small-angle rotations require checks of weight $\\Omega(1/(n|\\theta|^2))$ for nontrivial logical action, and proves a broader no-go theorem that constant-strength signal-aligned noise rules out any asymptotic quantum advantage over the standard quantum limit in AC or DC sensing under very general protocols.", "motivation": "Quantum metrology's promised quadratic speedup over the standard quantum limit is threatened by signal-aligned noise, and encoding sensors transversally in quantum codes was seen as a potential workaround; understanding the structural limits of transversal non-Clifford gates is central to both this metrology question and fault-tolerant computing broadly. This work closes off that route by connecting stabilizer weight lower bounds to fundamental metrological no-go results.", "highlights": [ "Proves checks of weight at least $2^D$ are required for transversal logical gates at Clifford hierarchy level $D$", "Shows concatenation is fundamentally limited to $r=1$ for beyond-SQL transversal sensing", "General no-go theorem rules out asymptotic quantum advantage over SQL under constant-strength signal-aligned noise" ], "keywords": [ { "label": "Clifford Hierarchy", "reason": "Central results bound transversal gates by their Clifford hierarchy level" }, { "label": "Quantum Metrology", "reason": "Applies fault-tolerance bounds to rule out beyond-SQL sensing advantages" }, { "label": "Transversal Gates", "reason": "Studies restrictions on transversal non-Clifford logical operations" }, { "label": "No-Go Theorem", "reason": "Proves a broad no-go result against quantum metrological advantage" } ], "emoji": "🚫", "social_summary": "New no-go theorems show transversal fault tolerance cannot rescue quantum metrology from beating the standard quantum limit.", "highlights_oneliner": "Fundamental limits on transversal gates and metrology" }, { "arxiv_id": "2607.27527", "title": "Noise-resilient and Scalable Quantum Error Correction for Nuclear Spin Qubits in Silicon with Electron Shuttling", "authors": "Wayne M. Witzel, Matthew D. Grace, Dwight R. Luhman", "arxiv_url": "https://arxiv.org/abs/2607.27527", "pdf_url": "https://arxiv.org/pdf/2607.27527", "summary": "The authors introduce electron pair interferometry (EPI), a protocol using arrays of quantum dots with isoelectronic nuclear spin qubits, where singlet-initialized electron pairs are shuttled to nuclear spin sites to coherently transfer nuclear parity information onto measurable electron spin states. Combined with global NMR-based dynamical decoupling and selective hyperfine-induced $Z_\\pi$ rotations, the scheme yields a complete, noise-robust gate set tailored to CSS quantum error correction. The protocol shows low sensitivity to charge noise and characterized sensitivity to DC and AC magnetic field inhomogeneity.", "motivation": "Nuclear spin qubits in silicon offer exceptionally long coherence times due to their isolation from the environment, but this same isolation makes control, entanglement, and measurement difficult to scale. Building on prior donor-based entanglement demonstrations, this work seeks a scalable, noise-resilient scheme compatible with quantum dot architectures and error correction to overcome these engineering bottlenecks.", "highlights": [ "Introduces electron pair interferometry (EPI) to coherently map nuclear spin parity onto singlet/triplet electron states", "Constructs a universal gate set tailored to CSS quantum error correction using global NMR, dynamical decoupling, and hyperfine-induced $Z_\\pi$ rotations", "Demonstrates very low sensitivity to charge noise and characterizes robustness against DC/AC magnetic field inhomogeneity" ], "keywords": [ { "label": "Nuclear Spin Qubits", "reason": "The paper's core qubit platform is isoelectronic nuclear spins in silicon quantum dots" }, { "label": "Electron Shuttling", "reason": "Electron pairs are shuttled across dot arrays to mediate nuclear spin interactions" }, { "label": "CSS Codes", "reason": "The gate set is explicitly tailored to Calderbank-Shor-Steane quantum error correction" }, { "label": "Dynamical Decoupling", "reason": "Global NMR is used to implement DD for noise robustness during control" } ], "emoji": "🧲", "social_summary": "Researchers propose electron pair interferometry to entangle and measure silicon nuclear spin qubits while staying robust to noise for error correction.", "highlights_oneliner": "Noise-robust nuclear spin QEC via electron shuttling" }, { "arxiv_id": "2607.28149", "title": "Efficient atom rearrangements for quantum error correction primitives with a single AOD", "authors": "Tom Hartweg, Asier Piñeiro Orioli, Hugo Perrin, Samuel Crew", "arxiv_url": "https://arxiv.org/abs/2607.28149", "pdf_url": "https://arxiv.org/pdf/2607.28149", "summary": "The authors introduce new primitives to shear, rotate, and reflect 2D atom arrays in neutral-atom quantum computers using a single dynamic crossed acousto-optic deflector (AOD) pair, achieving logarithmic scaling in AOD stroke count with array size via (nega-)binary and geometric decompositions. As an example, a $90^{\\circ}$ rotation implementing a transversal Hadamard gate on a distance-$d$ rotated surface code is realized in $3\\lfloor\\log_2(d-1)\\rfloor + 4$ AOD strokes and $O(d^{1/3})$ constant-jerk time, compared to $O(d^2)$ strokes and $O(d^{7/3})$ time for atom-by-atom rearrangement.", "motivation": "Neutral atom platforms leverage mid-circuit atom reconfiguration to reduce logical gates to geometric rearrangements, but naive atom-by-atom movement scales poorly and threatens fidelity and throughput at scale. As neutral atom QEC demonstrations mature toward larger surface codes and LDPC codes, efficient movement schedules become essential to realize practical fault-tolerant logical operations.", "highlights": [ "Introduces single-AOD primitives for shearing, rotating, and reflecting 2D atom arrays", "Achieves AOD stroke count scaling logarithmically in linear array size via binary and geometric decompositions", "Implements transversal Hadamard via $90^{\\circ}$ rotation on distance-$d$ surface code in $3\\lfloor\\log_2(d-1)\\rfloor+4$ strokes and $O(d^{1/3})$ time, versus $O(d^2)$ strokes and $O(d^{7/3})$ time atom-by-atom" ], "keywords": [ { "label": "Neutral Atoms", "reason": "The hardware platform is neutral-atom quantum computers using optical tweezers" }, { "label": "Surface Codes", "reason": "The rotated surface code and transversal Hadamard gate are the main QEC primitive studied" }, { "label": "Atom Rearrangement", "reason": "The paper's central technique is geometric rearrangement of atoms via AOD movement" }, { "label": "AOD Control", "reason": "A single acousto-optic deflector pair is used to efficiently implement array transformations" } ], "emoji": "🔬", "social_summary": "New AOD movement primitives cut atom rearrangement time exponentially, speeding up quantum error correction gates in neutral-atom processors.", "highlights_oneliner": "Fast single-AOD atom moves for surface code gates" } ] }, "2026-07-30": { "word_cloud": [ { "word": "CSS", "weight": 4 }, { "word": "Transversal", "weight": 3 }, { "word": "Stabilizer", "weight": 4 }, { "word": "MacWilliams", "weight": 5 }, { "word": "Fluxonium", "weight": 3 }, { "word": "Erasure", "weight": 4 }, { "word": "Modular", "weight": 3 }, { "word": "LatticeSurgery", "weight": 2 }, { "word": "Percolation", "weight": 3 }, { "word": "ToricCode", "weight": 2 }, { "word": "Entanglement", "weight": 3 }, { "word": "Coherent", "weight": 3 }, { "word": "RandomizedCompiling", "weight": 2 }, { "word": "Sensing", "weight": 2 }, { "word": "MonteCarlo", "weight": 2 } ], "social_highlights": "Highlights: new algorithm finds diagonal logical gates in CSS codes, MCMC speeds up logical error rate estimation, modular architectures tolerate noisy interfaces with efficient GHZ prep, fluxonium enables hardware-efficient erasure detection, minimal counterexamples break MacWilliams extension for stabilizer codes, percolation reveals topological phase transitions, spin kinematics explain MacWilliams transforms, sensing noise converted into erasures, randomized compiling preserves recoverable coherent-error information.", "papers": [ { "arxiv_id": "2607.26477", "title": "Finding diagonal logical gates in CSS codes and circuits", "authors": "Andreas Bauer", "arxiv_url": "https://arxiv.org/abs/2607.26477", "pdf_url": "https://arxiv.org/pdf/2607.26477", "summary": "This paper develops efficient algorithms to find all locality-preserving diagonal logical gates of a given CSS code or CSS-type syndrome-extraction circuit, composed from a prescribed set of ansatz gates. The method rephrases code-space preservation as computing the kernel of a 'pullback' map $A^{*}$ between finite abelian 2-groups, implemented via a fast filtration technique with $O(n^3)$ runtime for $n$-qubit codes.", "motivation": "Non-Clifford logical gates and magic state schemes are a central bottleneck for fault-tolerant quantum computation, and systematically discovering transversal, folding, or spacetime logical gates in arbitrary CSS codes has been a longstanding computational challenge. This work provides a unified, efficient search framework applicable across qLDPC codes, syndrome-extraction circuits, and qudit generalizations.", "highlights": [ "Reformulates gate-finding as computing the kernel of an abelian group homomorphism $A^{*}$", "Fast filtration algorithm achieves $O(n^3)$ runtime for naive dense implementation", "Extends beyond transversal gates to spacetime logical gates and qudit codes" ], "keywords": [ { "label": "CSS Codes", "reason": "The paper's algorithms specifically target diagonal logical gates for CSS-type stabilizer codes" }, { "label": "Transversal Gates", "reason": "The method finds transversal and more general locality-preserving logical gates" }, { "label": "Clifford Hierarchy", "reason": "The focus is on diagonal non-Clifford gates within the Clifford hierarchy" }, { "label": "Spacetime Codes", "reason": "The technique generalizes to finding logical gates inserted into syndrome-extraction circuits in spacetime" } ], "emoji": "🧮", "social_summary": "Introduces a fast algorithm to systematically discover fault-tolerant diagonal logical gates in CSS quantum codes and circuits.", "highlights_oneliner": "Fast algorithm to find diagonal logical gates in CSS codes" }, { "arxiv_id": "2607.27153", "title": "Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance", "authors": "Michael Mullan, Matthew Weippert, Winton Brown", "arxiv_url": "https://arxiv.org/abs/2607.27153", "pdf_url": "https://arxiv.org/pdf/2607.27153", "summary": "This work introduces a pruning algorithm to isolate the minimal-weight 'malignant core' of uncorrectable error patterns and a new family of subregion Metropolis-Hastings MCMC algorithms that interpolate between Monte Carlo and single-step MCMC. These techniques dramatically accelerate estimation of logical error rates at the ultra-low error regimes ($<10^{-10}$) required for utility-scale quantum computation.", "motivation": "Estimating logical failure rates at the extremely low physical error rates needed for practical quantum algorithms is computationally infeasible via direct Monte Carlo, requiring on the order of $10^{12}$ simulation runs. Building on Bravyi-Vargo MCMC methods, this paper addresses the slow convergence bottleneck by exploiting structural properties of typical failure patterns.", "highlights": [ "Pruning algorithm isolates the low-weight malignant core from correctable 'fluff' errors", "Subregion MCMC family interpolates between Monte Carlo and Metropolis sampling via a tunable resampling fraction", "Achieves order-of-magnitude speedup in simulations reaching utility-scale logical error rates" ], "keywords": [ { "label": "MCMC", "reason": "The paper develops a novel subregion Metropolis-Hastings MCMC family for QEC simulation" }, { "label": "Minimum Weight", "reason": "The method focuses on estimating the minimum weight of uncorrectable error patterns $w_{\\text{min}}$" }, { "label": "Logical Error Rate", "reason": "The core goal is accurately estimating logical failure rates at low physical error rates $p$" }, { "label": "Fault Tolerance", "reason": "The methods are used to debug circuits and decoders for fault-tolerant implementations" } ], "emoji": "🎲", "social_summary": "Speeds up simulation of ultra-low quantum error rates using a novel subregion MCMC method and error-pattern pruning.", "highlights_oneliner": "Faster MCMC methods for estimating low logical error rates" }, { "arxiv_id": "2607.27204", "title": "Fault-Tolerant Logical Operations and Efficient State Preparation in Modular Quantum Architectures with Noisy Interfaces", "authors": "Siddardha Chelluri, Riccardo Mengoni, Tom Darras, Julien Laurat, Eleni Diamanti, Ioannis Lavdas", "arxiv_url": "https://arxiv.org/abs/2607.27204", "pdf_url": "https://arxiv.org/pdf/2607.27204", "summary": "This paper performs circuit-level simulations of fault-tolerant nonlocal CNOT gates via lattice surgery between rotated surface code QPUs connected by noisy Bell pairs, showing interfaces can tolerate up to an order of magnitude more noise than intra-QPU errors. The authors also develop an ancilla-efficient distributed GHZ state preparation protocol, showing ancilla minimization reduces to a vertex-cover problem solvable via a polynomial-time heuristic.", "motivation": "Modular architectures with interconnected QPUs are a leading path to scale beyond monolithic device limitations, but noisy inter-module links pose a unique fault-tolerance challenge not captured by standard logical-memory benchmarks. Quantifying interface noise tolerance and reducing entanglement/ancilla overhead for distributed state preparation is essential for realizing scalable distributed quantum error correction.", "highlights": [ "Interfaces tolerate noise up to 10x higher than intra-QPU noise with minor threshold reduction", "Nonlocal fault-tolerant CNOTs via lattice surgery simulated at circuit level between noisy-linked QPUs", "Ancilla-efficient GHZ state protocol reduces to vertex-cover problem with polynomial-time heuristic" ], "keywords": [ { "label": "Surface Codes", "reason": "The rotated surface code is used to encode logical qubits in each QPU" }, { "label": "Lattice Surgery", "reason": "Nonlocal CNOT gates are implemented via lattice surgery across modules" }, { "label": "Modular Architecture", "reason": "The paper studies distributed quantum computing across multiple interconnected QPUs" }, { "label": "GHZ States", "reason": "An efficient protocol is developed for distributed fault-tolerant logical GHZ state preparation" } ], "emoji": "🔗", "social_summary": "Shows modular quantum computers can tolerate noisy inter-module links and introduces efficient distributed GHZ state prep.", "highlights_oneliner": "Fault-tolerant gates and states across noisy modular QPUs" }, { "arxiv_id": "2607.27123", "title": "Hardware-efficient erasure-error detection with an integer fluxonium", "authors": "Junyoung An, Helin Zhang, Jeffrey M. Gertler, Kate Azar, Renée DePencier Piñero, Michael Gingras, Junghyun Kim, Bethany M. Niedzielski, Ilan T. Rosen, Mollie E. Schwartz, Joel Î-j. Wang, Terry P. Orlando, Jeffrey A. Grover, Max Hays, Kyle Serniak, William D. Oliver", "arxiv_url": "https://arxiv.org/abs/2607.27123", "pdf_url": "https://arxiv.org/pdf/2607.27123", "summary": "The authors demonstrate erasure conversion and mid-circuit erasure detection in a single integer fluxonium qubit, where states $|g\\rangle,|f\\rangle$ encode logical information and $|e\\rangle$ acts as the erasure state. By suppressing direct $|f\\rangle\\to|g\\rangle$ transitions and enabling ancilla-free readout, they achieve an 8.4-fold increase in $|f\\rangle$ lifetime and reduce single-qubit gate error from $0.061(2)\\%$ to $0.030(5)\\%$.", "motivation": "Erasure-error detection improves quantum error correction efficiency by localizing errors in space and time, but implementing it typically requires extra hardware overhead such as ancilla qubits or specialized readout. This work shows a hardware-efficient path using the intrinsic level structure of an integer fluxonium to realize erasure conversion without additional resources.", "highlights": [ "Integer fluxonium suppresses direct $|f\\rangle\\to|g\\rangle$ decay, converting errors into detectable erasures via $|f\\rangle\\to|e\\rangle$", "Ancilla-free mid-circuit erasure checks enabled by nullified resonant-frequency shift between logical states", "Discarding detected erasures yields 8.4x longer $|f\\rangle$ lifetime and reduces gate error to $0.030(5)\\%$" ], "keywords": [ { "label": "Erasure Qubits", "reason": "The paper demonstrates erasure conversion and detection using a fluxonium-based erasure qubit" }, { "label": "Fluxonium", "reason": "An integer fluxonium device is the physical platform used for the erasure scheme" }, { "label": "Mid-Circuit Readout", "reason": "Ancilla-free mid-circuit erasure checks are enabled using the same readout resonator" }, { "label": "Gate Fidelity", "reason": "Discarding erasure events improves single-qubit gate error rates" } ], "emoji": "⚡", "social_summary": "Demonstrates hardware-efficient erasure detection in a superconducting fluxonium qubit, boosting gate fidelity nearly 2x.", "highlights_oneliner": "Erasure detection using an integer fluxonium qubit" }, { "arxiv_id": "2607.26214", "title": "Minimal Counterexamples of the MacWilliams Extension Theorem for Stabilizer Codes", "authors": "Ali Assem Mahmoud", "arxiv_url": "https://arxiv.org/abs/2607.26214", "pdf_url": "https://arxiv.org/pdf/2607.26214", "summary": "This paper systematically constructs minimal counterexamples showing the MacWilliams extension theorem fails for qudit stabilizer codes, since the label alphabet $\\mathbb{F}_{q^2}$ over $\\mathbb{F}_q$ has non-cyclic socle. For every prime power $q$, pairs of $[[q+1,q-1]]_q$ stabilizer codes are constructed with weight-preserving isomorphisms that extend to no monomial transformation, and exhaustive search establishes length $3$ as minimal for qubits.", "motivation": "The classical MacWilliams extension theorem underlies code equivalence theory, and whether weight-preserving isomorphisms of stabilizer groups are always realized by local Cliffords was an open rigidity question posed by Gluesing-Luerssen and Pllaha. This work resolves the question systematically at the smallest possible scales, connecting the extension problem to the broader LU-LC equivalence circle of questions in quantum error correction.", "highlights": [ "Constructs $[[q+1,q-1]]_q$ counterexample pairs for every prime power $q$ with inequivalent codespaces sharing Shor-Laflamme enumerators", "Proves by exhaustive search that length $3$ is the minimal qubit counterexample, essentially unique", "Identifies minimal full-support lengths: $4$ for non-extendable isometries, $5$ for non-monomially-equivalent weight isometries via $[[5,2]]$ codes" ], "keywords": [ { "label": "Stabilizer Codes", "reason": "The paper studies weight-preserving isomorphisms specifically for qudit stabilizer codes" }, { "label": "MacWilliams Theorem", "reason": "The central object of study is the failure of the MacWilliams extension theorem" }, { "label": "Code Equivalence", "reason": "The paper addresses whether weight isomorphisms imply local Clifford equivalence" }, { "label": "LU-LC Equivalence", "reason": "The open problem is connected to the local-unitary local-Clifford equivalence question" } ], "emoji": "🧩", "social_summary": "Constructs minimal quantum code examples showing the classical MacWilliams extension theorem fails for stabilizer codes.", "highlights_oneliner": "Minimal counterexamples to MacWilliams extension for stabilizer codes" }, { "arxiv_id": "2607.26707", "title": "Microscopic study of topological phase transitions: Percolation point of view", "authors": "Keisuke Kataoka, Ikuo Ichinose", "arxiv_url": "https://arxiv.org/abs/2607.26707", "pdf_url": "https://arxiv.org/pdf/2607.26707", "summary": "This paper studies decoherence-induced transitions between topologically ordered states in the color code and toric code using topological entanglement negativity (TEN) and 1-form symmetry disorder parameters, interpreted as first- and zeroth-dimensional simplicial homological objects. A new quasi-local TEN (QLTEN) measure and explosive percolation (EP) analysis reveal how decohered regions grow and correlate with the survival or loss of logical qubits.", "motivation": "Understanding how quantum decoherence drives transitions between topological phases is essential for characterizing the resilience of topological quantum memories, yet the microscopic mechanisms connecting entanglement and symmetry indicators during such transitions remain poorly understood. This work bridges the gap by mapping decoherence-induced transitions onto percolation theory to gain intuitive, local geometric insight into logical qubit loss.", "highlights": [ "Introduces quasi-local TEN (QLTEN) to visualize spatial growth of decohered regions", "Interprets TEN and 1-form symmetry order as first- and zeroth-homological simplicial objects respectively", "Finds color code and toric code respond differently to explosive percolation patterns despite strong correlations" ], "keywords": [ { "label": "Color Code", "reason": "One of the two topological codes studied under decoherence is the color code" }, { "label": "Toric Code", "reason": "The toric code on a triangular lattice is the second case study under decoherence" }, { "label": "Percolation", "reason": "Decoherence-induced transitions are analyzed via percolation and explosive percolation theory" }, { "label": "Entanglement Negativity", "reason": "Topological entanglement negativity is the key indicator of topological order used" } ], "emoji": "🕸️", "social_summary": "Uses percolation theory and a new local entanglement measure to reveal how decoherence destroys topological order.", "highlights_oneliner": "Percolation-based view of decoherence-induced topological transitions" }, { "arxiv_id": "2607.27173", "title": "Classical and Quantum MacWilliams Transforms as Spin Kinematics", "authors": "Eric Kubischta, Ian Teixeira", "arxiv_url": "https://arxiv.org/abs/2607.27173", "pdf_url": "https://arxiv.org/pdf/2607.27173", "summary": "This paper derives the MacWilliams transform for both classical and quantum weight enumerator theories as a Wigner-$D$ rotation between two canonical bases in a spin representation, arising purely from splitting errors into trivial and nontrivial components. The framework shows that changing code length $n$ preserves the rotation at spin $n/2$, while changing the rotation axis moves between different classical and quantum weight enumerator theories.", "motivation": "MacWilliams transforms appear across many disparate weight enumerator theories for classical codes, qubits, and qudits, but their unifying structure has remained obscure. This work reveals spin as the hidden common engine, offering a unified representation-theoretic lens connecting seemingly unrelated classical and quantum coding theories.", "highlights": [ "Derives MacWilliams transform as a Wigner-$D$ rotation between canonical bases at spin $n/2$", "Shows length $n$ changes leave the rotation element unchanged, just reappearing at different spin", "Demonstrates changing rotation axis unifies classical and quantum weight enumerator theories" ], "keywords": [ { "label": "MacWilliams Transform", "reason": "The paper's central object is deriving the MacWilliams transform via spin kinematics" }, { "label": "Weight Enumerators", "reason": "The framework applies to classical and quantum weight enumerator theories" }, { "label": "Representation Theory", "reason": "Wigner-$D$ rotations and spin representations are the mathematical tools used" }, { "label": "Qudit Codes", "reason": "The quantum weight enumerator theories addressed include qudit stabilizer codes" } ], "emoji": "🌀", "social_summary": "Reveals that the MacWilliams transform in classical and quantum codes arises naturally from spin rotation kinematics.", "highlights_oneliner": "Spin kinematics unifies classical and quantum MacWilliams transforms" }, { "arxiv_id": "2607.26502", "title": "Converting Quantum Sensing Noise into Erasures", "authors": "Xingyu Liu, Zhaotong Cui, Binke Xia, Yuegang Li, Hongjing Li, Jingzheng Huang, Guihua Zeng", "arxiv_url": "https://arxiv.org/abs/2607.26502", "pdf_url": "https://arxiv.org/pdf/2607.26502", "summary": "This work establishes a noise-model-agnostic necessary and sufficient condition for converting realistic sensing noise into erasures, identifying which noise components can be removed without harming the signal via a passive dimension-lifted scheme. The protocol requires no detailed noise knowledge or active control and is experimentally validated in single-photon phase sensing, recovering standard-quantum-limit precision under Pauli noise using orbital angular momentum as an ancilla.", "motivation": "Erasures are far more favorable than unflagged Pauli-type errors for quantum sensing, but realistic sensing noise typically acts within the same Hilbert space as the signal, making it hard to detect and mitigate. This paper provides a practical, general route to convert such damaging in-band noise into benign, heralded erasures for robust quantum sensing.", "highlights": [ "Derives a general necessary and sufficient condition for erasure-convertible noise components", "Passive dimension-lifted scheme requires no active control or detailed noise characterization", "Experimentally recovers standard-quantum-limit precision in single-photon phase sensing under Pauli noise" ], "keywords": [ { "label": "Erasure Conversion", "reason": "The core contribution is a general theory for converting sensing noise into erasures" }, { "label": "Quantum Sensing", "reason": "The application domain is precision phase sensing under realistic noise" }, { "label": "Pauli Noise", "reason": "The experimental demonstration targets erasure conversion of a Pauli-noise channel" }, { "label": "Orbital Angular Momentum", "reason": "Orbital angular momentum modes serve as the ancilla for the erasure scheme" } ], "emoji": "📡", "social_summary": "Converts harmful quantum sensing noise into detectable erasures using a passive scheme, restoring standard-quantum-limit precision.", "highlights_oneliner": "Turning sensing noise into erasures for better precision" }, { "arxiv_id": "2607.26756", "title": "Label and Recover Coherent Errors: Randomized Compiling Does Not Destroy Coherent-Error Information", "authors": "Kushagra Vyas", "arxiv_url": "https://arxiv.org/abs/2607.26756", "pdf_url": "https://arxiv.org/pdf/2607.26756", "summary": "This paper proves an exact Fisher-information conservation law showing that randomized compiling (RC) does not erase coherent-error information but relocates it into the discarded twirl labels (the per-shot random gate choices). By retaining these labels and correlating them with measurement outcomes, the coherent error parameters can be recovered at the quantum Fisher-information limit, with no extra circuit overhead, unbiased under standard incoherent noise channels.", "motivation": "Coherent errors accumulate quadratically with circuit depth and are considered especially damaging, which is why randomized compiling was developed to convert them into benign stochastic noise by averaging over twirl gates. The prevailing assumption that this averaging destroys all coherent-error information has shaped diagnostic practice, so showing that this information is fully recoverable from data already being collected has major implications for calibration and error characterization at no added cost.", "highlights": [ "Proved an exact Fisher-information conservation law showing coherent-error information is preserved in twirl labels rather than destroyed by RC", "Verified the conservation law to machine precision across $12$ circuit families and confirmed recovery experimentally on a $127$-qubit IBM Quantum processor (ibm_marrakesh)", "Labeled estimator recovered injected coherent phases to within $0.0063$ rad of the true value across all depths, while the standard marginal estimator returned near-zero signal" ], "keywords": [ { "label": "Randomized Compiling", "reason": "The paper directly analyzes the standard RC technique used to convert coherent errors into stochastic noise" }, { "label": "Coherent Errors", "reason": "The central subject is recovering information about coherent (systematic) gate errors typically considered erased by twirling" }, { "label": "Fisher Information", "reason": "The core theoretical result is an exact Fisher-information conservation law underpinning the recovery method" }, { "label": "Gate Calibration", "reason": "The recovered coherent-error parameters can be used to improve gate calibration without extra experimental cost" } ], "emoji": "🎯", "social_summary": "Shows randomized compiling doesn't erase coherent-error info—it's hidden in discarded twirl labels and fully recoverable at zero extra cost.", "highlights_oneliner": "Recovering hidden coherent-error data from twirl labels" } ] }, "2026-07-29": { "word_cloud": [ { "word": "qLDPC", "weight": 4 }, { "word": "Decoders", "weight": 3 }, { "word": "Iceberg", "weight": 3 }, { "word": "Postselection", "weight": 2 }, { "word": "Floquet", "weight": 4 }, { "word": "Distributed", "weight": 3 }, { "word": "Fidelity", "weight": 5 }, { "word": "Recovery", "weight": 2 }, { "word": "Blind", "weight": 3 }, { "word": "Cryptography", "weight": 2 }, { "word": "Prethermal", "weight": 3 }, { "word": "Sampling", "weight": 3 }, { "word": "Magic", "weight": 2 }, { "word": "Mitigation", "weight": 4 }, { "word": "Nucleus", "weight": 2 } ], "social_highlights": "Highlights: AI discovers better qLDPC codes, IBM hardware shows Iceberg-code error suppression, single-nucleus nodes enable distributed fault tolerance, faster tighter approximate QEC bounds, verifiable blind error cancellation, error-mitigated 74-qubit prethermal dynamics revealed, and spacetime codes certify high-fidelity hard sampling.", "papers": [ { "arxiv_id": "2607.25865", "title": "OmniQEC: discovering practical quantum error-correcting codes by an AI scientist", "authors": "Ge Yan, Shanchuan Li, Pengyue Ma, Qixin Zhang, Pingchuan Ma, Jianping Wang, Min-Hsiu Hsieh, Yuxuan Du", "arxiv_url": "https://arxiv.org/abs/2607.25865", "pdf_url": "https://arxiv.org/pdf/2607.25865", "summary": "OmniQEC is an LLM-orchestrated AI scientist that automates discovery of practical quantum error-correcting codes by coordinating code generation, screening, syndrome-extraction synthesis, and decoder-based circuit evaluation. It uses a slow-fast synergistic workflow, combining cheap code-level proxies with physically grounded circuit-level evaluation fed back into the search loop. Discovered codes outperform BB codes $[[72,12,6]]$ and $[[144,12,12]]$ under matched physical-qubit budgets.", "motivation": "QEC code design must jointly satisfy competing requirements from code structure, hardware constraints, syndrome extraction, and decoding, making purely expert-driven search increasingly insufficient as the qLDPC design space grows. This work builds on early AI-driven QEC discovery efforts using reinforcement learning, Bayesian optimization, and LLM-guided program search, pushing towards implementation-level rather than purely algebraic optimization.", "highlights": [ "LLM-orchestrated iterative discovery process spanning code generation to circuit-level decoder evaluation", "Outperforms $[[72,12,6]]$ and $[[144,12,12]]$ BB codes under matched 98 and 240 physical-qubit budgets", "Evaluated across four qLDPC families, three LLM backends, and 14 physical-qubit budgets" ], "keywords": [ { "label": "qLDPC", "reason": "The paper focuses on discovering codes across four qLDPC construction families" }, { "label": "LLM Agents", "reason": "OmniQEC uses large language models as an orchestrator to drive the code discovery process" }, { "label": "Code Discovery", "reason": "Core contribution is an automated AI-driven search for practical QEC codes" }, { "label": "Decoders", "reason": "Circuit-level evaluation relies on decoder-based logical performance assessment" } ], "emoji": "🤖", "social_summary": "An LLM-driven AI scientist automatically discovers quantum error-correcting codes that beat state-of-the-art bivariate bicycle codes.", "highlights_oneliner": "LLM-guided AI discovers better qLDPC codes" }, { "arxiv_id": "2607.24947", "title": "Realizing Error Suppression in Partially Fault-Tolerant Quantum Simulations with IBM Quantum Computers", "authors": "Henry Froland, Dorota M. Grabowska, Sebastian Grieninger, Jeremy Hartse, Anne L. Lashbrook, Zhiyao Li, Ziyuan Li, Sarah J. M. Powell, Martin J. Savage, Xiaojun Yao, Nikita A. Zemlevskiy", "arxiv_url": "https://arxiv.org/abs/2607.24947", "pdf_url": "https://arxiv.org/pdf/2607.24947", "summary": "Using IBM's ibm_boston superconducting processor, the authors demonstrate partially fault-tolerant encoded quantum simulations of the Ising model in 1+1D and 2+1D that outperform unencoded circuits, encoding 42 logical qubits with 21 blocks of the $[[4,2,2]]$ Iceberg code across up to 136 physical qubits. They pair fault-tolerant syndrome extraction with non-fault-tolerant logical operations and introduce Observable-Ranked Postselection, a selective filtering technique based on syndrome correlations that avoids the prohibitive shot loss of full postselection.", "motivation": "Quantum error-detecting codes offer a near-term path to improved simulation fidelity without requiring the full overhead of fault-tolerant logical gate sets. Demonstrating measurable accuracy gains on real superconducting hardware for lattice simulations is an important step toward practical near-term quantum advantage in dynamics simulation.", "highlights": [ "Encoded 42 logical qubits using 21 blocks of the $[[4,2,2]]$ Iceberg code on up to 136 physical qubits", "Introduced Observable-Ranked Postselection to recover accuracy without full syndrome postselection shot loss", "Achieved 2-6% accuracy improvement in 1+1D and over 200% improvement in 2+1D late-time simulations" ], "keywords": [ { "label": "Iceberg Code", "reason": "The paper uses the $[[4,2,2]]$ error-detecting Iceberg code as its core encoding" }, { "label": "Error Detection", "reason": "Focuses on partially fault-tolerant error detection rather than full fault tolerance" }, { "label": "Postselection", "reason": "Introduces Observable-Ranked Postselection as a key syndrome-based filtering technique" }, { "label": "Lattice Simulation", "reason": "Application is quantum simulation of the Ising model in 1+1D and 2+1D" } ], "emoji": "🧊", "social_summary": "IBM quantum hardware simulations of the Ising model show error suppression using the compact Iceberg error-detecting code.", "highlights_oneliner": "Iceberg code boosts Ising model simulations on IBM hardware" }, { "arxiv_id": "2607.24907", "title": "Fault-tolerant distributed quantum computing with a single nucleus per node", "authors": "Yotam Vaknin, Shoham Jaocby, Roi Nevo, Aleksander Kubica, Alex Retzker", "arxiv_url": "https://arxiv.org/abs/2607.24907", "pdf_url": "https://arxiv.org/pdf/2607.24907", "summary": "This work shows that distillation-free fault-tolerant distributed quantum computing is possible by engineering a communication error bias where photonic Bell pairs suffer mostly phase errors that manifest only as measurement errors, suppressible by repeated measurement. This allows Floquet codes to require only a single data qubit per node and general stabilizer codes just one additional ancilla, with high thresholds demonstrated for both quantum memory and lattice surgery-based logical operations.", "motivation": "Distributed quantum architectures face a severe asymmetry between high-fidelity in-node operations and noisy, low-coherence inter-node links, and prior approaches required costly Bell pair or GHZ distillation using multiple ancillary nuclei per node. Given the extreme scarcity of strongly coupled nuclear spins in emerging platforms, minimizing per-node qubit overhead while tolerating noisy communication qubits is critical for practical scaling.", "highlights": [ "Floquet codes need only a single data qubit per node, eliminating dedicated distillation", "Tolerable phase noise on communication links exceeds 10% with minimal or no distillation", "Lattice surgery achieves logical-operation thresholds close to the quantum memory threshold" ], "keywords": [ { "label": "Floquet Codes", "reason": "Floquet codes are shown to require only a single data qubit per node under the biased-noise scheme" }, { "label": "Noise Bias", "reason": "The core technique engineers a communication error bias that is exploited by syndrome extraction design" }, { "label": "Distributed QC", "reason": "The paper targets architectures with small nodes linked via noisy optical Bell pairs" }, { "label": "Lattice Surgery", "reason": "Lattice surgery is analyzed as a robust method for logical operations in this distributed setting" } ], "emoji": "🔗", "social_summary": "A biased-noise scheme lets distributed quantum computers use just one nucleus per node without costly entanglement distillation.", "highlights_oneliner": "Distillation-free distributed QC with one nucleus per node" }, { "arxiv_id": "2607.24968", "title": "Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction", "authors": "Jing Wu, Michele Grossi, Doga Kurkcuoglu, Silvia Zorzetti", "arxiv_url": "https://arxiv.org/abs/2607.24968", "pdf_url": "https://arxiv.org/pdf/2607.24968", "summary": "This Letter introduces an efficient framework for approximate quantum error correction (AQEC) that exploits duality between recovery channels and environment decoupling to derive a tighter analytical lower bound on entanglement fidelity than the standard transpose channel bound. A principal component analysis-based dimension reduction exploits decayed Kraus operator weights, achieving a 33-fold computational speedup for thermal loss channels while preserving rigorous accuracy.", "motivation": "Finding optimal recovery channels for AQEC via semidefinite programming is computationally intractable at scale due to exponential growth in Kraus operators, while existing analytical near-optimal maps only work near the Knill-Laflamme regime. This limits practical optimization of both discrete- and continuous-variable QEC codes, motivating scalable approaches applicable across physical platforms.", "highlights": [ "Derives a tighter analytical entanglement fidelity lower bound than the transpose channel limit", "Introduces PCA-based dimension reduction exploiting decayed noise Kraus operator weights", "Achieves a $33\\times$ computational speedup for thermal loss channels with rigorous accuracy" ], "keywords": [ { "label": "AQEC", "reason": "The paper's central subject is approximate quantum error correction optimization" }, { "label": "Fidelity Bounds", "reason": "Derives tighter analytical lower bounds on entanglement fidelity" }, { "label": "Recovery Channels", "reason": "Optimization targets the recovery channel maximizing entanglement fidelity" }, { "label": "Dimension Reduction", "reason": "Uses PCA to reduce Kraus operator dimensionality for tractable optimization" } ], "emoji": "📉", "social_summary": "A new duality-based framework speeds up approximate quantum error correction optimization by 33 times with tighter fidelity guarantees.", "highlights_oneliner": "Faster, tighter bounds for approximate QEC" }, { "arxiv_id": "2607.25704", "title": "Verifiable blind probabilistic error cancellation", "authors": "Bo Yang, Elham Kashefi, Harold Ollivier", "arxiv_url": "https://arxiv.org/abs/2607.25704", "pdf_url": "https://arxiv.org/pdf/2607.25704", "summary": "This paper introduces verifiable blind probabilistic error cancellation (VBPEC), the first composably secure verification protocol against a fully malicious adversary that integrates probabilistic error cancellation (PEC) into delegated quantum computation. VBPEC extends trap-based verification from deterministic pass/fail checks to statistical tests, achieving perfect blindness, exponentially small security error, and no quantum-space overhead beyond additional repetitions.", "motivation": "Quantum error mitigation techniques like PEC are becoming central to near-term quantum computing but rely on hardware-specific trust assumptions, leaving delegated cloud-based quantum computations without rigorous end-to-end security guarantees. Prior verifiable blind quantum computation protocols did not incorporate error mitigation, motivating a framework that actively cancels noise while preserving cryptographic verifiability.", "highlights": [ "First composably secure verification protocol integrating PEC against fully malicious servers", "Achieves perfect blindness with exponentially small security error and no quantum-space overhead", "Extends trap-based verification from deterministic checks to statistical tests benefiting from QEM" ], "keywords": [ { "label": "PEC", "reason": "The protocol integrates probabilistic error cancellation as its core mitigation technique" }, { "label": "Blind Computation", "reason": "VBPEC builds on verifiable blind quantum computation for delegated security" }, { "label": "Composable Security", "reason": "Security is formalized within the abstract cryptography composable security framework" }, { "label": "Error Mitigation", "reason": "The work addresses quantum error mitigation reliability in a cryptographic delegation setting" } ], "emoji": "🔒", "social_summary": "A new cryptographic protocol lets users securely delegate error-mitigated quantum computations to untrusted servers.", "highlights_oneliner": "Secure verification meets error cancellation for delegated QC" }, { "arxiv_id": "2607.24937", "title": "Resolving Structure in Prethermal Floquet Dynamics with Precision Quantum Computation", "authors": "Eyal Leviatan, Tasneem Watad, Roy Perry, Lukas Broers, Mohammed Zuhair Mullath, Ori Alberton, Itai Arad, Yosi Atia, Eyal Bairey, Shaul Barkan, Matan Ben Dov, Asaf Berkovitch, Ewout van den Berg, Itsik Cohen, Omri Golan, Ilya Gurwich, Avieli Haber, Barak A. Katzir, Oded Kenneth, Roei Levi, Yotam Y. Lifshitz, Yaron Lukovsky, Ron Melcer, Adiel Meyer, Boris Muratov, Aviad Panahi, Gili Schul, Tali Shnaider, Maor Shutman, Alireza Seif, Tomonori Shirakawa, Asif Sinay, Vincent P. Su, Hayk Tepanyan, Omri Trebitch, Assaf Zubida, Dorit Aharonov, Hrant Gharibyan, Abhinav Kandala, Seiji Yunoki, Netanel H. Lindner", "arxiv_url": "https://arxiv.org/abs/2607.24937", "pdf_url": "https://arxiv.org/pdf/2607.24937", "summary": "Using the QESEM error mitigation software on an IBM Heron r3 processor, this work measures magnetization dynamics of a Floquet Ising magnet on a heavy-hex lattice with percent-level precision across up to 74 qubits, resolving long-lived subharmonic prethermal oscillations. The measurements reach regimes where tensor-network and sparse Pauli-path classical simulations fail or remain truncation-dependent, and finite-size scaling suggests the oscillatory response persists in the thermodynamic limit, validated by cross-platform trapped-ion experiments.", "motivation": "Non-equilibrium many-body dynamics, particularly prethermal Floquet phenomena like discrete time-crystalline order, are notoriously hard to access classically at the system sizes and evolution times needed to extract physical properties, since entanglement growth overwhelms tensor-network and Pauli-path methods. Demonstrating that error-mitigated quantum processors can reliably resolve such physics establishes them as genuine scientific instruments beyond digital simulators.", "highlights": [ "Resolves subharmonic prethermal oscillations in up to 74-qubit heavy-hex Floquet Ising systems", "Surpasses leading tensor-network and sparse Pauli-path classical simulations in accessible regimes", "Cross-validated results on Quantinuum System Model H2 and Helios trapped-ion hardware" ], "keywords": [ { "label": "Error Mitigation", "reason": "QESEM error mitigation software is central to achieving percent-level measurement precision" }, { "label": "Floquet Systems", "reason": "The experiment studies prethermal dynamics in a periodically driven Ising magnet" }, { "label": "Prethermalization", "reason": "Core physics goal is resolving long-lived prethermal subharmonic oscillations" }, { "label": "Cross-Platform", "reason": "Results are validated across superconducting and trapped-ion hardware platforms" } ], "emoji": "🌀", "social_summary": "Error-mitigated 74-qubit quantum hardware reveals long-lived prethermal oscillations beyond the reach of classical simulation.", "highlights_oneliner": "Quantum hardware resolves prethermal Floquet oscillations" }, { "arxiv_id": "2607.25941", "title": "Sampling hard circuits with verifiably high fidelity", "authors": "Simon Martiel, Jay-U Chung, Alireza Seif, Soumik Ghosh, Ian Hincks, Abhinav Deshpande, Bill Fefferman, Jay M. Gambetta, Ali Javadi-Abhari", "arxiv_url": "https://arxiv.org/abs/2607.25941", "pdf_url": "https://arxiv.org/pdf/2607.25941", "summary": "This work introduces structured circuits with provable sampling hardness that also admit encoding in a quantum code, enabling simultaneous high-fidelity execution and verification via syndrome measurement. Demonstrated on a $70$-qubit, depth-$70$ Clifford circuit doped with $468$ $T$ gates using $97$ physical qubits in spacetime codes, the method suppresses gate error rates by $10\\times$ after syndrome post-selection and certifies a fidelity lower bound of $0.284$ with 95% confidence.", "motivation": "Sampling-based quantum advantage demonstrations have struggled to combine complexity-theoretic hardness guarantees with practical error suppression and rigorous verification on noisy hardware. Existing fidelity proxy benchmarks require strong noise assumptions, so a device-dependent certificate with weaker assumptions is valuable for credible near-term quantum advantage claims.", "highlights": [ "Structured circuits combine provable hardness guarantees with quantum code encodability", "Demonstrated on a $70$-qubit, depth-$70$ Clifford circuit doped with $468$ $T$ gates using $97$ physical qubits", "Achieved $10\\times$ gate error suppression and a fidelity lower bound of $0.284$ at 95% confidence" ], "keywords": [ { "label": "Spacetime Codes", "reason": "The demonstration encodes the hard sampling circuit using spacetime quantum codes" }, { "label": "Quantum Advantage", "reason": "Structured circuits target complexity-theoretic hardness for sampling-based advantage" }, { "label": "Magic States", "reason": "The construction promotes a stabilizer state to a magic state via $T$-gate doping" }, { "label": "Fidelity Certification", "reason": "Syndrome measurements provide a device-dependent fidelity lower bound certificate" } ], "emoji": "🎯", "social_summary": "A new circuit design lets researchers certify high fidelity while sampling classically hard quantum circuits using error-detecting codes.", "highlights_oneliner": "Verifiably high-fidelity hard sampling via quantum codes" } ] }, "2026-07-28": { "word_cloud": [ { "word": "Stabilizer", "weight": 5 }, { "word": "Approximate", "weight": 3 }, { "word": "Cat", "weight": 4 }, { "word": "CNOT", "weight": 3 }, { "word": "Bias", "weight": 3 }, { "word": "Pauli", "weight": 4 }, { "word": "Converse", "weight": 2 }, { "word": "Leakage", "weight": 4 }, { "word": "Coupler", "weight": 3 }, { "word": "Superconducting", "weight": 3 }, { "word": "GKP", "weight": 4 }, { "word": "Verification", "weight": 2 }, { "word": "Readout", "weight": 3 }, { "word": "Transmon", "weight": 3 }, { "word": "TensorNetwork", "weight": 3 } ], "social_highlights": "Highlights: approximate QEC extends Knill-Laflamme framework, bias-preserving cat-cat CNOT gate unveiled, strong converse proven for stabilizer codes over Pauli channels, hybrid coupler slashes CZ gate leakage, formal verification tools reason about continuous-variable systems including GKP, fast-load/fast-clear pulses curb transmon readout errors, MPStab merges stabilizers with tensor networks.", "papers": [ { "arxiv_id": "2607.22995", "title": "Theory of approximate quantum error correction and the error-set model", "authors": "Dor Elimelech, Victor V. Albert, Alexander Barg", "arxiv_url": "https://arxiv.org/abs/2607.22995", "pdf_url": "https://arxiv.org/pdf/2607.22995", "summary": "The authors develop an error-set model for approximate quantum error correction (AQEC) that recovers a restricted form of Knill-Laflamme linearity, extending code distance, erasure-error equivalence, and asymptotic goodness to the approximate setting. They introduce two new code parameters, the environment-leakage distance and the Knill-Laflamme Hellinger distance, yielding uniform fidelity guarantees via Bény-Oreshkov worst-case and Petz average-case frameworks. Partition-based constructions across diverse Hilbert spaces produce the first known asymptotically good AQEC code families for fermionic systems, Rydberg-blockaded systems, and deletion errors.", "motivation": "Exact QEC benefits from a rich linear structure via the Knill-Laflamme conditions, but this structure was long believed to break down for approximate quantum error correction, leaving AQEC theory fragmented and channel-specific. Establishing a unifying error-set framework for AQEC is important for extending rigorous performance guarantees and code constructions to realistic noisy and exotic physical platforms.", "highlights": [ "Restricted Knill-Laflamme linearity is shown to survive in the approximate setting under a spectral constraint on coefficient matrices", "Introduces environment-leakage distance and Knill-Laflamme Hellinger distance as new code parameters governing worst-case and average-case fidelity", "First asymptotically good AQEC code families constructed for fermionic systems, 1D Rydberg-blockaded systems, and deletion errors" ], "keywords": [ { "label": "Approximate QEC", "reason": "The paper's central subject is a general theory of approximate quantum error correction" }, { "label": "Knill-Laflamme", "reason": "The work generalizes and restricts the Knill-Laflamme conditions to the approximate regime" }, { "label": "Code Distance", "reason": "New distance-like parameters are derived to characterize AQEC performance" }, { "label": "Fermionic Codes", "reason": "The paper yields the first asymptotically good codes for fermionic systems among other platforms" } ], "emoji": "🧩", "social_summary": "Researchers extend exact quantum error correction's powerful linear structure to approximate codes, unlocking new asymptotically good code families.", "highlights_oneliner": "Generalizing Knill-Laflamme structure to approximate QEC" }, { "arxiv_id": "2607.22852", "title": "Bias-preserving cat-cat CNOT gate via vacuum-conditional beam-splitter", "authors": "Yufeng, Ye, Connor T. Hann, Kyungjoo Noh, Harald Putterman, Ron Belyansky, Arne L. Grimsmo, Oskar Painter", "arxiv_url": "https://arxiv.org/abs/2607.22852", "pdf_url": "https://arxiv.org/pdf/2607.22852", "summary": "The authors propose a purely unitary CNOT gate scheme between two dissipative cat qubits that preserves the exponential bit-flip noise bias, avoiding the non-idealities of dissipation-engineered gate schemes. The gate relies on a vacuum-conditional beam-splitter interaction and cross-Kerr engineering between cat and auxiliary bosonic modes. Simulations suggest that with sufficient component lifetimes and nonlinearity precision, the scheme could enable logical memories with error rates below $10^{-6}$ using a distance-$7$ repetition code of $13$ cat qubits.", "motivation": "Cat qubits offer strong noise bias that is highly attractive for hardware-efficient error correction, but implementing bias-preserving entangling gates like CNOT without degrading this bias has remained a major obstacle. A coherent, dissipation-free gate design is motivated by the need to avoid non-idealities from engineered-dissipation approaches while retaining the noise-bias advantage in logical operations.", "highlights": [ "Proposes a fully unitary bias-preserving CNOT gate between dissipative cat qubits", "Projects megaquop-regime logical memory with error rates below $10^{-6}$ using a $d=7$ repetition code of $13$ cat qubits", "Identifies cross-Kerr engineering with $\\chi/K\\sim10^{3}$ as the key hardware requirement, suggesting a quarton-coupler-inspired route" ], "keywords": [ { "label": "Cat Qubits", "reason": "The paper's core hardware platform is dissipative cat qubits with biased noise" }, { "label": "CNOT Gate", "reason": "The main contribution is a bias-preserving entangling gate design" }, { "label": "Noise Bias", "reason": "Preserving exponential bit-flip bias through gates is the central goal" }, { "label": "Cross-Kerr", "reason": "Engineering cross-Kerr vs self-Kerr nonlinearities is central to the proposed implementation" } ], "emoji": "🐱", "social_summary": "A new unitary CNOT gate design keeps cat qubits' powerful noise bias intact, paving a path toward megaquop logical memories.", "highlights_oneliner": "Unitary bias-preserving CNOT for cat qubits" }, { "arxiv_id": "2607.23450", "title": "A strong converse for stabilizer codes over Pauli channels via the blowing-up lemma", "authors": "Marco Tomamichel", "arxiv_url": "https://arxiv.org/abs/2607.23450", "pdf_url": "https://arxiv.org/pdf/2607.23450", "summary": "The paper proves a strong converse for quantum communication over Pauli channels restricted to stabilizer codes, showing entanglement fidelity decays exponentially once the rate exceeds the coherent information. This pins down the $\\varepsilon$-quantum capacity of stabilizer codes for every $\\varepsilon<1$ and shows the capacity vanishes for antidegradable channels like depolarizing noise with $p\\in[1/4,3/4]$. The proof leverages the blowing-up lemma of Ahlswede, Gács and Körner rather than additivity or semidefinite relaxation arguments.", "motivation": "Determining sharp capacity thresholds for quantum communication is a foundational question, and prior strong converse results for stabilizer codes have relied on additivity assumptions or semidefinite relaxations that can be loose. Establishing a rigorous, relaxation-free strong converse clarifies exactly when constant tolerated error rates fail to buy additional communication rate.", "highlights": [ "Proves exponential entanglement-fidelity decay above coherent information for stabilizer codes on Pauli channels", "Shows zero $\\varepsilon$-capacity for antidegradable depolarizing channels with $p\\in[1/4,3/4]$ within the stabilizer class", "Demonstrates that partial-transposition (Rains/PPT) bounds provably fail to certify this strong converse for $p\\in[1/4,1/2)$" ], "keywords": [ { "label": "Stabilizer Codes", "reason": "The strong converse result is proven specifically for the class of stabilizer codes" }, { "label": "Pauli Channels", "reason": "The communication model considered is Pauli channels including depolarizing noise" }, { "label": "Strong Converse", "reason": "The paper's main theorem is a strong converse theorem for quantum capacity" }, { "label": "Coherent Information", "reason": "Coherent information sets the rate threshold central to the converse statement" } ], "emoji": "📉", "social_summary": "A new proof shows stabilizer codes over Pauli channels hit a hard capacity wall, with fidelity collapsing exponentially beyond coherent information.", "highlights_oneliner": "Strong converse bounds for stabilizer code capacity" }, { "arxiv_id": "2607.23463", "title": "Purcell-Engineered Hybrid Coupler for Leakage-Suppressed Robust CZ Gates", "authors": "Hui Wang, Feng Bao, Yan-Jun Zhao, Xun-Wei Xu", "arxiv_url": "https://arxiv.org/abs/2607.23463", "pdf_url": "https://arxiv.org/pdf/2607.23463", "summary": "The authors propose a Purcell-engineered notch-filter hybrid coupler for superconducting CZ gates that combines coherent interaction engineering with leakage-selective dissipation via a nonlinear transmon coupler coupled to a Purcell filter and notch resonator. Dressed-eigenstate analysis and Lindblad master-equation simulations show substantially reduced leakage and improved worst-case fidelity compared to an optimized single-transmon coupler. The optimized gate achieves $F_{\\rm avg}=99.74\\%$, $F_{\\rm min}=99.62\\%$, and maximum leakage probability of $1.6\\times10^{-3}$, roughly a twentyfold reduction versus baseline.", "motivation": "As coherent control errors shrink, leakage to non-computational states has become a critical bottleneck for high-fidelity gates, since it persists across error-correction cycles and creates hard-to-mitigate correlated errors. Engineered dissipation offers a complementary design axis to conventional coherent pulse-shaping approaches for suppressing this leakage in scalable superconducting architectures.", "highlights": [ "Achieves $F_{\\rm avg}=99.74\\%$ and $F_{\\rm min}=99.62\\%$ for the CZ gate with engineered leakage-selective dissipation", "Reduces maximum leakage probability from about $3\\times10^{-2}$ to $1.6\\times10^{-3}$, a nearly twentyfold improvement", "Demonstrates robustness of the low-leakage operating regime across broad filter and notch parameter ranges" ], "keywords": [ { "label": "CZ Gates", "reason": "The paper's primary target is a high-fidelity controlled-Z gate design" }, { "label": "Leakage Suppression", "reason": "Suppressing leakage to non-computational states is the central engineering goal" }, { "label": "Engineered Dissipation", "reason": "The hybrid coupler exploits leakage-selective dissipation as a design tool" }, { "label": "Superconducting Qubits", "reason": "The architecture is built from transmon qubits and Purcell-filter couplers" } ], "emoji": "🛠️", "social_summary": "A new hybrid coupler design slashes leakage in superconducting CZ gates twentyfold using engineered dissipation alongside coherent control.", "highlights_oneliner": "Dissipation-engineered coupler for low-leakage CZ gates" }, { "arxiv_id": "2607.23137", "title": "Reasoning about Continuous-Variable Quantum Systems", "authors": "Tianshi Yu, Gilles Barthe, Minbo Gao, Mingsheng Ying, Li Zhou", "arxiv_url": "https://arxiv.org/abs/2607.23137", "pdf_url": "https://arxiv.org/pdf/2607.23137", "summary": "The authors develop formal semantics and sound verification methods for a core continuous-variable quantum programming language, addressing the underdeveloped semantic foundations of CVQC. A key contribution is identifying closed positive quadratic forms as a well-behaved quantitative predicate domain capable of representing finite expectations, domains of finiteness, and infinite penalties for unbounded, infinite-dimensional systems. The framework is validated through case studies, including establishing a second moment bound for the GKP error-correcting code.", "motivation": "Continuous-variable quantum computing is both a natural model for physical quantum systems and an abstraction for photonic hardware, yet unlike discrete-variable quantum programs it lacks mature formal verification tools. Rigorous program logics for CVQC are important for verifying correctness of protocols such as bosonic error-correcting codes that inherently operate over continuous, infinite-dimensional domains.", "highlights": [ "Introduces closed positive quadratic forms as semantic predicates for infinite-dimensional CV quantum programs", "Establishes closure properties including well-defined weakest preconditions for the new predicate domain", "Applies the framework to derive a second moment bound for the GKP error-correcting code" ], "keywords": [ { "label": "GKP Codes", "reason": "One case study applies the verification framework to the GKP bosonic code" }, { "label": "Formal Verification", "reason": "The paper develops program logic and weakest-precondition reasoning for quantum programs" }, { "label": "Continuous Variable", "reason": "The work targets continuous-variable quantum computing semantics" }, { "label": "Quadratic Forms", "reason": "Closed positive quadratic forms are the core semantic predicate domain introduced" } ], "emoji": "📐", "social_summary": "New formal verification tools for continuous-variable quantum programs enable rigorous correctness proofs, including a bound for the GKP code.", "highlights_oneliner": "Formal semantics for continuous-variable quantum programs" }, { "arxiv_id": "2607.23681", "title": "Mitigation of Measurement-Induced State Transitions via a Fast-Load and Fast-Clear Readout", "authors": "Wei-En Lin, Li-Chieh Hsiao, Chen-Hsun Ma, Erh-Hsiang Yeh, Wei-Lun Peng, Hsi-Sheng Goan, Cen-Shawn Wu, Yueh-Nan Chen, Yung-Fu Chen, Chung-Ting Ke, Chii-Dong Chen", "arxiv_url": "https://arxiv.org/abs/2607.23681", "pdf_url": "https://arxiv.org/pdf/2607.23681", "summary": "The authors systematically study offset-charge-dependent measurement-induced state transitions (MIST) in a charge-sensitive transmon and engineer fast-load and fast-clear pulses that suppress resonator photon overshoots without requiring complex waveforms or feedback. Using active gate-voltage control and Floquet branch analysis, they map transition probability against offset charge $n_g$ and photon number, validating a hardware-free strategy to reduce readout and post-readout errors. A three-step pulse scheme is shown to consistently minimize total error probability across both stages.", "motivation": "Fast, high-fidelity QND readout is essential for quantum error correction protocols like the surface code, which require millions of rapid syndrome measurements, but higher measurement photon numbers needed for speed and SNR trigger measurement-induced state transitions that break QND behavior. Practical, hardware-free pulse-shaping mitigation strategies are therefore critical for scaling readout in fault-tolerant architectures.", "highlights": [ "Maps $n_g$-dependent MIST probability against resonator photon number, matching Floquet branch analysis predictions", "Demonstrates fast-load/fast-clear pulses suppress photon overshoots and reduce readout error without complex control", "Shows a three-step pulse scheme minimizes total readout and post-readout error, outperforming square pulses experimentally and numerically" ], "keywords": [ { "label": "MIST", "reason": "Measurement-induced state transitions are the central phenomenon studied and mitigated" }, { "label": "Transmon Readout", "reason": "The work focuses on dispersive readout of charge-sensitive transmon qubits" }, { "label": "Pulse Shaping", "reason": "Fast-load and fast-clear pulse engineering is the proposed mitigation technique" }, { "label": "QND Measurement", "reason": "Preserving quantum non-demolition readout behavior is a key performance metric" } ], "emoji": "📡", "social_summary": "Engineers use simple fast-load and fast-clear pulses to curb measurement-induced errors in transmon qubit readout without complex feedback.", "highlights_oneliner": "Pulse engineering to mitigate readout-induced qubit transitions" }, { "arxiv_id": "2607.24258", "title": "MPStab: an hybrid stabilizers tensor-network quantum circuit simulator", "authors": "Giulio Crognaletti, Mattia Robbiano, Michele Grossi, Matteo Robbiati", "arxiv_url": "https://arxiv.org/abs/2607.24258", "pdf_url": "https://arxiv.org/pdf/2607.24258", "summary": "The authors present MPStab, a quantum circuit simulator combining stabilizer formalism with tensor networks to extend classical simulation limits beyond either technique alone. The package targets regimes with both entanglement and non-stabilizerness, exploring performance across several interesting simulation regimes. MPStab builds on a recently introduced hybrid stabilizer-tensor-network formalism and provides core functionalities for practical use.", "motivation": "Classical simulation of quantum circuits is bottlenecked by either exponential state-space growth or, in structured methods, by entanglement or non-stabilizerness individually, limiting the reach of pure stabilizer or pure tensor-network simulators. Combining stabilizer and tensor-network techniques is motivated by the need to push the classical simulability boundary further, helping delineate where genuine quantum advantage begins.", "highlights": [ "Introduces MPStab, a practical software package implementing hybrid stabilizer-tensor-network simulation", "Explores simulator performance across multiple regimes combining entanglement and non-stabilizerness", "Builds on and extends a recently proposed hybrid formalism into a usable simulation tool" ], "keywords": [ { "label": "Tensor Networks", "reason": "The simulator core relies on matrix product state tensor-network techniques" }, { "label": "Stabilizer Formalism", "reason": "Stabilizer simulation is combined with tensor networks in the hybrid approach" }, { "label": "Non-stabilizerness", "reason": "Magic/non-stabilizerness is identified as a key complexity resource the simulator targets" }, { "label": "Classical Simulation", "reason": "The paper's overarching goal is extending classical simulability boundaries for quantum circuits" } ], "emoji": "🧮", "social_summary": "MPStab merges stabilizer methods with tensor networks to push classical quantum circuit simulation into harder, more realistic regimes.", "highlights_oneliner": "Hybrid stabilizer-tensor-network circuit simulator" } ] }, "2026-07-27": { "word_cloud": [ { "word": "Topological", "weight": 5 }, { "word": "Anyons", "weight": 4 }, { "word": "Bosonic", "weight": 3 }, { "word": "Kagome", "weight": 3 }, { "word": "Thresholds", "weight": 4 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Coherent", "weight": 3 }, { "word": "Shuttling", "weight": 3 }, { "word": "Cumulant", "weight": 2 }, { "word": "Flag", "weight": 3 }, { "word": "Homology", "weight": 2 }, { "word": "Spin", "weight": 2 }, { "word": "Threshold", "weight": 3 }, { "word": "Noise", "weight": 3 }, { "word": "Stabilizers", "weight": 2 } ], "social_highlights": "Highlights: rigorous thresholds for non-Abelian mixed-state codes, algebraic unification of bosonic Tiger codes, ILP-designed flag-based fault-tolerant state prep, cumulant framework turning coherent noise into a resource, shuttling-based spin qubit arrays hitting 10% damage tolerance, exotic Z2×Z2×Z2 kagome topological order, and watts-based reframing of the threshold theorem.", "papers": [ { "arxiv_id": "2607.21706", "title": "Mixed-state topological order and error-correction thresholds in non-Abelian codes: rigorous results", "authors": "Sun Woo P. Kim, Max McGinley", "arxiv_url": "https://arxiv.org/abs/2607.21706", "pdf_url": "https://arxiv.org/pdf/2607.21706", "summary": "The authors develop a rigorous mathematical technique for bounding recovery thresholds of two-dimensional topological codes—including surface codes, non-Abelian quantum doubles, and string-net codes—under arbitrary local noise channels, not restricted to Pauli errors. They prove that below an explicit noise strength, encoded logical information can be recovered with high fidelity, and that the noise-corrupted code state retains long-range entanglement and emergent higher-form symmetries characteristic of mixed-state topological order.", "motivation": "Error-correction thresholds are usually established numerically or under restrictive stochastic Pauli noise assumptions, leaving a gap in rigorous understanding for non-Abelian codes and general noise. This work closes that gap by proving robust recoverability and persistence of topological order analytically, extending confidence in fault tolerance beyond idealized noise models.", "highlights": [ "Rigorous proof of recovery thresholds under arbitrary local noise for a broad class of 2D topological codes", "Establishes persistence of mixed-state topological order via long-range entanglement and emergent higher-form symmetries", "Framework extends to non-Abelian quantum doubles, string-net codes, higher dimensions, and correlated noise" ], "keywords": [ { "label": "Topological Codes", "reason": "Focuses on surface codes, quantum doubles, and string-net codes as the code family analyzed" }, { "label": "Mixed-State Order", "reason": "Central result concerns persistence of mixed-state topological order under noise" }, { "label": "Rigorous Bounds", "reason": "Provides mathematically proven noise thresholds rather than numerical estimates" }, { "label": "Non-Abelian Anyons", "reason": "Extends analysis to non-Abelian quantum double models beyond standard Abelian codes" } ], "emoji": "🧮", "social_summary": "Proves rigorous noise thresholds for recovering logical info in surface codes and non-Abelian topological codes under general noise.", "highlights_oneliner": "Rigorous thresholds for non-Abelian topological code recovery" }, { "arxiv_id": "2607.22460", "title": "Algebraic structure of Tiger codes", "authors": "Clément Poirson, Anthony Leverrier, Christophe Vuillot", "arxiv_url": "https://arxiv.org/abs/2607.22460", "pdf_url": "https://arxiv.org/pdf/2607.22460", "summary": "This work gives a rigorous algebraic treatment of Tiger codes, a family of multimode bosonic quantum codes unifying cat, paircat, and two-mode binomial codes, proving finite generation of annihilation-type constraints and constructing an explicit orthonormal basis linked to the homology of an underlying chain complex. The authors develop a Fourier transform over the codespace, extend the framework to non-linear number constraints, and characterize polynomial phase gates that preserve the codespace and their placement in the Clifford hierarchy.", "motivation": "Bosonic codes such as cat and binomial codes have been studied largely on a case-by-case basis, lacking a unifying mathematical structure connecting their logical operators and gate implementations. Establishing a rigorous algebraic and homological foundation for Tiger codes enables systematic design of logical gates and clarifies the mathematical underpinnings of a broad class of continuous-variable encodings.", "highlights": [ "Proves finite generation of annihilation-type constraints and constructs explicit orthonormal basis via homology", "Develops a Fourier-theoretic dual $X$-/$Z$-type description of the codespace", "Derives structural criteria for polynomial phase gates $e^{iP(\\hat{\\boldsymbol{n}})}$ preserving the codespace and their Clifford hierarchy level" ], "keywords": [ { "label": "Bosonic Codes", "reason": "Tiger codes are a multimode bosonic quantum code family unifying cat and binomial codes" }, { "label": "Homology", "reason": "Logical structure is governed by homology of an underlying chain complex" }, { "label": "Fourier Duality", "reason": "Fourier transform over codespace yields dual X- and Z-type descriptions" }, { "label": "Clifford Hierarchy", "reason": "Polynomial phase gates are classified by their level in the Clifford hierarchy" } ], "emoji": "🐯", "social_summary": "Establishes a rigorous algebraic and homological framework unifying cat, paircat, and binomial bosonic quantum codes.", "highlights_oneliner": "Algebraic foundations for Tiger bosonic codes" }, { "arxiv_id": "2607.22498", "title": "Automated Flag-based Fault-Tolerant State Preparation using Integer Linear Programming", "authors": "Ben Criger, Aaron Hankin, Justin J. Burau, Abigail R. Perry", "arxiv_url": "https://arxiv.org/abs/2607.22498", "pdf_url": "https://arxiv.org/pdf/2607.22498", "summary": "The authors formulate flag-based fault-tolerant stabilizer state preparation as an integer linear program using the circuit gauge operator formalism, producing circuits with equal or lower gate counts than prior state-of-the-art methods while detecting up to three errors. They apply this to derive a Steane error correction gadget for the $[[24,10,4]]$ two-block group algebra code and demonstrate it experimentally on Quantinuum's System Model H2.", "motivation": "Manual circuit design for fault-tolerant state preparation is feasible only for small codes like the $[[7,1,3]]$ Steane code, but scaling to larger and more efficient qLDPC codes requires automated optimization tools. Reducing gate counts directly improves logical error rates and reliability, which is critical for near-term demonstrations of practical fault tolerance.", "highlights": [ "ILP-based method achieves equal or lower gate counts than SAT-based and flag-at-origin state-of-the-art techniques", "Derives a Steane gadget for the $[[24,10,4]]$ two-block group algebra code detecting up to three errors", "Experimental demonstration on Quantinuum H2 achieves logical block error rate ~$0.00014$ with ~$1.6\\%$ post-selection" ], "keywords": [ { "label": "Flag Qubits", "reason": "Uses flag-based circuits to detect faults during state preparation" }, { "label": "Integer Programming", "reason": "Formulates circuit optimization as an integer linear program" }, { "label": "qLDPC Codes", "reason": "Applied to the $[[24,10,4]]$ two-block group algebra code, a qLDPC code family" }, { "label": "Steane EC", "reason": "Derives a Steane-type error correction gadget for logical ancillas" } ], "emoji": "🚩", "social_summary": "Uses integer linear programming to automatically design low-gate-count fault-tolerant state preparation circuits, tested on real hardware.", "highlights_oneliner": "ILP-optimized flag circuits tested on Quantinuum H2" }, { "arxiv_id": "2607.22503", "title": "Correlated Coherent Errors in Stabilizer Codes: A General Cumulant Framework and Interference-Based Error Suppression", "authors": "Rohan N Rajmohan, Antoine Brillant, Peter Groszkowski, Alireza Seif, Jens Koch, Aashish Clerk", "arxiv_url": "https://arxiv.org/abs/2607.22503", "pdf_url": "https://arxiv.org/pdf/2607.22503", "summary": "The authors derive the exact logical channel induced by repeated QEC cycles under correlated coherent $Z$ noise, using a cumulant-expansion framework that is non-perturbative and applies to arbitrary stabilizer codes and correlation structures. They introduce PROSE (protected stabilizer eigenspace) encoding, which selects the optimal codespace to exploit noise correlations, showing it can reduce logical infidelity below the uncorrelated baseline even under positive correlations.", "motivation": "Stochastic Pauli error models dominate QEC analysis, but real hardware exhibits correlated coherent errors in space and time that behave qualitatively differently and remain poorly understood analytically. This work fills that gap with a general framework, revealing that correlated coherent noise can be turned into a resource rather than a liability through smart codespace selection.", "highlights": [ "Derives exact non-perturbative expression for logical infidelity under correlated coherent $Z$ noise", "Introduces PROSE encoding that selects optimal stabilizer eigenspace to suppress errors via interference", "Shows positive noise correlations can reduce logical infidelity below the uncorrelated baseline when combined with logical Pauli twirling" ], "keywords": [ { "label": "Coherent Noise", "reason": "Focuses on correlated coherent $Z$ errors rather than stochastic Pauli noise" }, { "label": "Cumulant Expansion", "reason": "Core analytical technique used to derive the logical channel non-perturbatively" }, { "label": "PROSE Encoding", "reason": "Proposed error-suppression strategy selecting the optimal stabilizer eigenspace" }, { "label": "Pauli Twirling", "reason": "Combined with PROSE to further suppress correlated coherent error effects" } ], "emoji": "🌀", "social_summary": "Introduces a general framework and PROSE encoding that turns correlated coherent noise into a resource for reducing logical errors.", "highlights_oneliner": "Turning correlated coherent noise into a resource" }, { "arxiv_id": "2607.22429", "title": "A route to damage tolerance exceeding $10\\%$ in shuttling-equipped quantum processors", "authors": "Quinten Eggerickx, Simon C. Benjamin", "arxiv_url": "https://arxiv.org/abs/2607.22429", "pdf_url": "https://arxiv.org/pdf/2607.22429", "summary": "This study adapts the CAbLECAR method for semiconductor spin-qubit shuttling architectures to the surface code, using route-solving software to find ancilla pathways around lattice defects while respecting stabilizer commutation and hook error constraints. Detector error models fed into Stim show that $10\\%$ physical damage retains roughly half the pristine equivalent code distance, improving to $0.60$ for smaller arrays.", "motivation": "Solid-state qubit platforms inevitably suffer from fabrication defects and drop-outs, threatening the regularity that fault-tolerant architectures like the surface code typically assume. Demonstrating that shuttling-based architectures can tolerate substantial damage by oversizing arrays offers a practical path toward resilient large-scale quantum processors on imperfect hardware.", "highlights": [ "Adapts CAbLECAR ancilla-shuttling method to damaged surface-code lattices with route-solving software", "Finds $10\\%$ lattice damage yields $d_{\\text{equiv}}\\approx 0.48\\,d_{\\text{pristine}}$ in the large-array limit", "Shows smaller arrays retain a higher fraction ($\\approx 0.60$) of pristine equivalent distance under damage" ], "keywords": [ { "label": "Surface Code", "reason": "The damage-tolerance study is performed on the surface code architecture" }, { "label": "Spin Qubits", "reason": "Targets semiconductor electron spin-qubit systems with shuttling capability" }, { "label": "Ancilla Shuttling", "reason": "Uses the CAbLECAR method where ancillas follow bespoke shuttling paths" }, { "label": "Fault Tolerance", "reason": "Evaluates logical error rates and equivalent code distance under hardware damage" } ], "emoji": "🛤️", "social_summary": "Shows shuttling-based spin-qubit surface codes can tolerate over 10 percent hardware damage by oversizing arrays.", "highlights_oneliner": "Damage-tolerant surface codes via ancilla shuttling" }, { "arxiv_id": "2607.22296", "title": "Unconventional $\\mathbb{Z}_2\\times\\mathbb{Z}_2\\times\\mathbb{Z}_2$ topological order in the kagome XY toric code", "authors": "C. Kölbl, M. Vieweg, K.P. Schmidt", "arxiv_url": "https://arxiv.org/abs/2607.22296", "pdf_url": "https://arxiv.org/pdf/2607.22296", "summary": "The authors analytically show that the XY toric code on the kagome lattice, built from $XY$ hexagonal and triangular plaquette operators plus conserved star operators, realizes a $\\mathbb{Z}_2\\times\\mathbb{Z}_2\\times\\mathbb{Z}_2$ topologically ordered phase in the large hexagonal-plaquette limit, exploiting an exact local $\\mathbb{Z}_2$-symmetry on dodecagons. This phase hosts 64 Abelian anyons with restricted mobility on three colored sublattices and quantum dimension eight, arising from six independent Wilson loop operators acting as emergent one-form symmetries.", "motivation": "Discovering topological phases richer than the standard toric and color codes expands the theoretical landscape of anyon models and potential quantum error-correcting codes. This unconventional phase's larger anyon content and multiple emergent symmetries could inspire new stabilizer code constructions with enhanced encoding capacity.", "highlights": [ "Analytically proves a $\\mathbb{Z}_2\\times\\mathbb{Z}_2\\times\\mathbb{Z}_2$ topologically ordered phase via exact local symmetry on dodecagons", "Identifies 64 Abelian anyons with restricted sublattice mobility and quantum dimension eight", "Formulates a corresponding CSS topological stabilizer code for encoding quantum information" ], "keywords": [ { "label": "Kagome Lattice", "reason": "The toric code model is constructed on the kagome lattice geometry" }, { "label": "Topological Order", "reason": "Central result establishes a novel $\\mathbb{Z}_2^3$ topologically ordered phase" }, { "label": "Anyons", "reason": "Phase hosts 64 Abelian anyons with restricted mobility on colored sublattices" }, { "label": "CSS Codes", "reason": "A corresponding CSS stabilizer code is formulated from the model" } ], "emoji": "🔷", "social_summary": "Reveals a rich new topological phase with 64 anyons in the kagome XY toric code, enabling a novel CSS stabilizer code.", "highlights_oneliner": "Unconventional triple-Z2 topological order discovered" }, { "arxiv_id": "2607.22276", "title": "The Threshold Theorem in Watts: Fault Tolerance as a Question About Objective Probability", "authors": "Amit Hagar", "arxiv_url": "https://arxiv.org/abs/2607.22276", "pdf_url": "https://arxiv.org/pdf/2607.22276", "summary": "This philosophical paper reinterprets the fault-tolerance threshold theorem through a resource-bounded notion of objective probability, in which the probability of a physical state depends on the energy-over-time resources needed to realize it relative to available resources. The author argues that the original threshold theorem omitted four resource costs—calibration, decoding, coherence time budget, and entropy flush via ancillas—and proposes translating FTQC feasibility into a measurable quantity: watts per decade of suppressed logical error.", "motivation": "The three-decade debate over whether the threshold theorem applies to real physical devices has been framed as a dispute over noise-model assumptions, without a unifying quantitative measure to settle it empirically. By reframing feasibility as a resource-bounded probability measured in watts per decade of error suppression, this work aims to convert a philosophical disagreement into an empirically testable claim.", "highlights": [ "Applies a resource-bounded interpretation of objective probability to fault-tolerant quantum computing", "Identifies four previously zero-priced resources: calibration, decoding, coherence budget, and entropy flush", "Proposes watts per decade of suppressed logical error as a measurable quantity to empirically settle the FTQC feasibility debate" ], "keywords": [ { "label": "Threshold Theorem", "reason": "Central subject is the reinterpretation of the fault-tolerance threshold theorem" }, { "label": "Resource Bounds", "reason": "Uses a resource-bounded measure of objective probability to analyze feasibility" }, { "label": "Philosophy QC", "reason": "Applies philosophy of physics concepts to quantum computing feasibility debates" }, { "label": "Energy Cost", "reason": "Proposes watts per decade of error suppression as the key measurable metric" } ], "emoji": "⚡", "social_summary": "Reframes the fault-tolerance threshold theorem as a measurable resource cost problem, in watts per decade of error suppression.", "highlights_oneliner": "Philosophical reframing of FTQC feasibility as energy cost" } ] }, "2026-07-24": { "word_cloud": [ { "word": "Duality", "weight": 4 }, { "word": "Thresholds", "weight": 4 }, { "word": "Fusion", "weight": 3 }, { "word": "Rotations", "weight": 3 }, { "word": "Floquet", "weight": 4 }, { "word": "Reservoir", "weight": 3 }, { "word": "Entanglement", "weight": 4 }, { "word": "NeutralAtoms", "weight": 4 }, { "word": "Roadmap", "weight": 2 }, { "word": "Neurons", "weight": 3 }, { "word": "SyndromeDecoding", "weight": 3 }, { "word": "Nuclei", "weight": 4 }, { "word": "Qubitization", "weight": 3 }, { "word": "GaugeTheory", "weight": 4 }, { "word": "SelfCorrection", "weight": 3 } ], "social_highlights": "Highlights: duality symmetry pins optimal thresholds, balanced fusion sharpens analog rotation gates, Floquet dissipation enables remote logical entanglement, neutral atom roadmap charts scalable path, neurons mirror QEC redundancy, fault-tolerant algorithms simulate atomic nuclei, gauge averaging stabilizes self-correcting classical memory.", "papers": [ { "arxiv_id": "2607.21160", "title": "Duality constrains optimal thresholds in quantum error correction", "authors": "Lucas H. English, Haoyuan Luo, Yangming Wang, Basudha Srivastava, Stephen D. Bartlett, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2607.21160", "pdf_url": "https://arxiv.org/pdf/2607.21160", "summary": "The authors show via a statistical mechanical mapping that all zero-rate em-symmetric CSS codes (where $X$- and $Z$-type parity-check matrices are equivalent up to permutations) share the same optimal code capacity threshold at leading order in a replica limit. This follows from a generalized Kramers-Wannier self-duality that fixes the clean critical point, and the framework extends to concatenated codes via renormalization group flow on hierarchical lattices.", "motivation": "Error correction thresholds are commonly used to compare code families, yet a unifying theoretical explanation for why many topological and LDPC codes achieve similar thresholds has been lacking. This work provides a common statistical mechanics framework connecting duality, thresholds, and sub-threshold logical error suppression across code families.", "highlights": [ "Proves em-symmetric zero-rate CSS codes share a universal optimal threshold at leading replica order", "Establishes a generalized Kramers-Wannier self-duality fixing the clean critical point", "Shows self-duality is preserved under code concatenation, mapping optimal decoding to RG flow on hierarchical lattices" ], "keywords": [ { "label": "CSS Codes", "reason": "The duality result applies specifically to em-symmetric CSS code families" }, { "label": "Thresholds", "reason": "Central quantity constrained to a universal value by the paper's duality argument" }, { "label": "Statistical Mechanics", "reason": "Uses a stat-mech mapping to analyze code performance and phase transitions" }, { "label": "Concatenated Codes", "reason": "Shows self-duality is preserved under concatenation and links to RG flow" } ], "emoji": "🪞", "social_summary": "Shows that many quantum codes are mathematically forced to share the same optimal error correction threshold through hidden duality symmetry.", "highlights_oneliner": "Duality fixes universal thresholds across CSS codes" }, { "arxiv_id": "2607.20756", "title": "Suppressing errors in analog logical rotation gates via balanced fusion", "authors": "Sam McArdle, Alexander M. Dalzell, Fernando G. S. L. Brandão", "arxiv_url": "https://arxiv.org/abs/2607.20756", "pdf_url": "https://arxiv.org/pdf/2607.20756", "summary": "This work introduces 'balanced fusion', a technique that improves the error scaling of analog logical rotation gates from $O(p\\varphi)$ to $O(p\\varphi^{1.5})$ without requiring fallback synthesis, where $p$ is the physical error rate and $\\varphi$ the rotation angle. The improvement stems from a refined analysis of coherent error accumulation in these rotations.", "motivation": "Analog logical rotations are attractive for early fault-tolerant algorithms because they avoid costly magic state synthesis, but their non-fault-tolerant error scaling limits their use for larger angles. Improving this scaling makes analog rotations more viable as an alternative to cultivation-powered rotation synthesis.", "highlights": [ "Improves error scaling of analog logical rotations from $O(p\\varphi)$ to $O(p\\varphi^{1.5})$", "Introduces the 'balanced fusion' technique built on an improved coherent-error accumulation analysis", "Avoids the need for fallback synthesis while extending viability to a wider range of rotation angles" ], "keywords": [ { "label": "Analog Rotations", "reason": "Core object of study: logical rotation gates implemented in an analog, non-discretized manner" }, { "label": "Coherent Errors", "reason": "Improved analysis of coherent error accumulation underlies the proposed technique" }, { "label": "Early Fault Tolerance", "reason": "Targets near-term fault-tolerant algorithms that rely on analog rotations" }, { "label": "Magic States", "reason": "Alternative approach compared against cultivation-powered magic state rotation synthesis" } ], "emoji": "🎯", "social_summary": "Introduces balanced fusion to make analog logical rotation gates more accurate without costly fallback synthesis.", "highlights_oneliner": "Better error scaling for analog logical rotations" }, { "arxiv_id": "2607.21360", "title": "Floquet Reservoir Engineering for Remote Logical Entanglement", "authors": "Mingxing Yao, Aashish A. Clerk", "arxiv_url": "https://arxiv.org/abs/2607.21360", "pdf_url": "https://arxiv.org/pdf/2607.21360", "summary": "The authors propose dissipative Floquet protocols that interleave continuously-running dissipation with periodic unitary gates to stabilize remote entanglement between logical qubits, going beyond standard time-independent dissipative engineering. These protocols implement an autonomous form of entanglement distillation and provide enhanced protection against waveguide loss, demonstrated for a cat-qubit and transmon superconducting circuit implementation.", "motivation": "Dissipative state preparation is a powerful tool for generating remote entanglement, but time-independent protocols are fundamentally limited by time-entanglement tradeoffs. Introducing Floquet-engineered dissipation overcomes these limits and leverages existing hardware capabilities for more robust logical-qubit networking.", "highlights": [ "Introduces Floquet dissipative protocols combining continuous dissipation with periodic unitary gates", "Overcomes time-entanglement limits of standard dissipative stabilization approaches", "Demonstrates enhanced waveguide-loss protection using cat qubits and transmons in a superconducting circuit example" ], "keywords": [ { "label": "Reservoir Engineering", "reason": "Central technique of controlled dissipative dynamics used for state preparation" }, { "label": "Cat Qubits", "reason": "Used as the example physical implementation of the protocol" }, { "label": "Remote Entanglement", "reason": "Main target application: stabilizing entanglement between distant logical qubits" }, { "label": "Floquet Protocols", "reason": "Novel periodic driving scheme interleaved with dissipation defines the approach" } ], "emoji": "🌊", "social_summary": "Periodically driven dissipation protocols stabilize remote entanglement between logical qubits beyond standard limits.", "highlights_oneliner": "Floquet dissipation for robust remote entanglement" }, { "arxiv_id": "2607.21554", "title": "Strategic Plan for Neutral Atom Quantum Computation", "authors": "Adrian J. Menssen, Tout Wang, Michael Gullans, Tom Manovitz, Jacob M. Taylor, Jason Cong, Josiah Sinclair, Ziv Aqua, Daniel J. Blumenthal, J. Pablo Bonilla Ataides, Johannes Borregaard, Antoine Browaeys, Paola Cappellaro, Soonwon Choi, Alexandre Cooper, Robin Côté, Jacob P. Covey, Alexandre Dauphin, Ivana Dimitrova, Matt Eichenfield, Dirk Englund, Jacob Freedman, Akihisa Goban, Brandon Grinkemeyer, Andi Gu, Ruonan Han, Dominik Hangleiter, Aram W. Harrow, Liang Jiang, Eun-ah Kim, Felix W. Knollmann, Aleksander Kubica, Thierry Lahaye, Lucas Lassabliere, Joonho Lee, Bingzhao Li, Mo Li, Wan-Hsuan Lin, Mikhail D. Lukin, Varun Menon, Thomas Propson, Akbar Safari, Mark Saffman, Pascal Scholl, Alexander Schuckert, Giulia Semeghini, Jonathan Simon, David Spierings, Daniel Bochen Tan, Shai Tsesses, Vladan Vuletic, Hanrui Wang, Hanyu Wang, Susanne Yelin, Johannes Zeiher, Hengyun Zhouckert, Giulia Semeghini, Jonathan Simon, David Spierings, Daniel Bochen Tan, Shai Tsesses, Vladan Vuletic, Hanrui Wang, Hanyu Wang, Susanne Yelin, Johannes Zeiher, Hengyun Zhou", "arxiv_url": "https://arxiv.org/abs/2607.21554", "pdf_url": "https://arxiv.org/pdf/2607.21554", "summary": "This community roadmap outlines a strategic plan for neutral atom quantum computing, covering practical quantum advantage definitions, hardware scaling, qubit encodings, below-threshold logical performance, continuous reloading, fast readout, and scalable photonic control. It also addresses quantum error correction, circuit compilation, and networking multiple processors for distributed quantum computing.", "motivation": "Neutral atom platforms recently achieved below-threshold error correction, spurred by improved gate fidelities and reconfigurable atom arrays, positioning the field near practical quantum utility. This paper, resulting from an NSF town hall, consolidates community input to chart a coordinated path forward for scaling and application development.", "highlights": [ "Defines practical quantum advantage and verification approaches specific to neutral atom systems", "Outlines hardware roadmap covering scaling, qubit encodings, continuous reloading, and fast readout", "Proposes directions in quantum error correction, compilation, and distributed networking of multiple processors" ], "keywords": [ { "label": "Neutral Atoms", "reason": "Central hardware platform discussed throughout the roadmap" }, { "label": "Roadmap", "reason": "Paper is explicitly a strategic community planning document" }, { "label": "Below Threshold", "reason": "Highlights recent demonstration of below-threshold logical qubit performance" }, { "label": "Distributed QC", "reason": "Discusses networking multiple neutral atom processors together" } ], "emoji": "🗺️", "social_summary": "Community roadmap charts the path to scalable, practical quantum advantage using neutral atom processors.", "highlights_oneliner": "Strategic roadmap for neutral atom quantum computing" }, { "arxiv_id": "2607.20534", "title": "Quantum error correction and biological error correction: A structural analogy between qubits and neurons", "authors": "Ian Whitehouse, Anıl Zenginoğlu, Franz Klein, Mohe Edeen Abu Maizer, Wilson Smith, Skylar Chan, Siri Duddella, Wolfgang Losert", "arxiv_url": "https://arxiv.org/abs/2607.20534", "pdf_url": "https://arxiv.org/pdf/2607.20534", "summary": "The authors draw a structural analogy between quantum error correction, where stabilizer syndromes drive decoding and recovery within a codespace, and error handling in neural circuits, where redundant neural encoding and constraint-based dynamics may support a biological codespace. They build a minimal three-neuron leaky-integrate-and-fire model whose reduced classical master equation structurally matches the continuous-time recovery generator of the three-qubit repetition code.", "motivation": "Understanding how biological neural systems achieve reliable computation from noisy components is a longstanding open question, and quantum error correction offers a mathematically precise framework for constraint-based error suppression. Drawing this analogy may inspire brain-inspired decoding algorithms for QEC as well as new frameworks for understanding neural robustness.", "highlights": [ "Constructs a structural dictionary mapping QEC concepts (codespace, syndromes, decoding) onto neural circuit analogues", "Derives a minimal 3-neuron leaky integrate-and-fire model reducing to a classical master equation", "Shows this classical model structurally matches the continuous-time recovery generator of the 3-qubit repetition code" ], "keywords": [ { "label": "Repetition Code", "reason": "Used as the quantum baseline compared against the neural model" }, { "label": "Neuroscience", "reason": "Applies QEC concepts to model neural circuit error handling" }, { "label": "Redundant Encoding", "reason": "Shared organizing principle between QEC and biological error correction" }, { "label": "Syndrome Decoding", "reason": "Central QEC mechanism mapped onto neural constraint-violation signals" } ], "emoji": "🧠", "social_summary": "Draws a structural parallel between quantum error correction and how noisy neurons achieve reliable brain computation.", "highlights_oneliner": "Mapping quantum error correction onto neural circuits" }, { "arxiv_id": "2607.21563", "title": "Fault-tolerant quantum algorithms for simulating atomic nuclei", "authors": "James Benstead, Michael Garn, Neil Gaspar, Sean Greenaway, Angus Kan, Lloyd La Ronde, Chandan Sarma, Paul Stevenson", "arxiv_url": "https://arxiv.org/abs/2607.21563", "pdf_url": "https://arxiv.org/pdf/2607.21563", "summary": "This work constructs qubitization-based fault-tolerant quantum algorithms for simulating atomic nuclei using shell-model and no-core-shell-model Hamiltonians with three-body chiral effective field theory interactions, providing the first Toffoli gate and qubit resource estimates for such simulations. Optimized block-encoding circuits reduce Toffoli counts by $70\\%$ and $40\\%$ for Hamiltonians with and without three-body terms respectively, compared to prior implementations.", "motivation": "Fault-tolerant quantum simulation has focused heavily on chemistry and condensed matter, leaving nuclear structure—despite its similarity to electronic structure problems—largely unexplored. Concrete resource estimates for nuclear simulation help identify which problems are near-term feasible and where further algorithmic innovation is needed.", "highlights": [ "Provides first fault-tolerant resource estimates for simulating atomic nuclei via shell-model Hamiltonians", "Shows $^{32}$Mg and $^{219}$At resource estimates are comparable to Femoco chemistry benchmarks", "Achieves $70\\%$ and $40\\%$ Toffoli count reductions via optimized state-preparation and selection circuits" ], "keywords": [ { "label": "Qubitization", "reason": "Core algorithmic framework underlying the fault-tolerant simulation approach" }, { "label": "Nuclear Structure", "reason": "Application domain: simulating atomic nuclei via shell-model Hamiltonians" }, { "label": "Resource Estimation", "reason": "Paper reports Toffoli gate and qubit counts for the proposed algorithms" }, { "label": "Block Encoding", "reason": "Technique used to encode Hamiltonians for quantum simulation" } ], "emoji": "⚛️", "social_summary": "Delivers the first fault-tolerant quantum resource estimates for simulating atomic nuclei structure.", "highlights_oneliner": "First resource estimates for nuclear quantum simulation" }, { "arxiv_id": "2607.20605", "title": "Perturbatively Stable Self-Correcting Classical Memory from Gauge Averaging", "authors": "Ryan Thorngren", "arxiv_url": "https://arxiv.org/abs/2607.20605", "pdf_url": "https://arxiv.org/pdf/2607.20605", "summary": "This paper proves that the self-correcting classical memory in 3d Wegner gauge theory remains stable under arbitrarily small Hamiltonian perturbations, using a new technique called 'gauge averaging' that shows explicitly broken gauge symmetries can be effectively restored by thermal fluctuations. The stability of the self-correcting phase is shown to be fluctuation-stabilized, improving with temperature up to a critical $T_c > 0$.", "motivation": "Self-correcting quantum and classical memories that resist noise without active error correction are a long-sought goal, but their robustness to generic perturbations has been difficult to establish rigorously. This work provides a rigorous stability proof for a canonical model, strengthening the theoretical foundation for passive error correction.", "highlights": [ "Proves perturbative stability of self-correcting memory in 3d Wegner gauge theory", "Introduces 'gauge averaging' to show broken gauge symmetries are restored by fluctuations", "Shows robustness to perturbations increases with temperature up to a critical $T_c > 0$" ], "keywords": [ { "label": "Self-Correction", "reason": "Central property being proven stable under perturbations" }, { "label": "Gauge Theory", "reason": "3d Wegner gauge theory is the model system studied" }, { "label": "Perturbation Stability", "reason": "Main technical result concerns robustness to Hamiltonian perturbations" }, { "label": "Passive Memory", "reason": "Relates to classical memories that self-correct without active decoding" } ], "emoji": "🧲", "social_summary": "Proves that a 3d gauge theory's self-correcting memory survives small perturbations thanks to fluctuation-restored symmetry.", "highlights_oneliner": "Stability proof for self-correcting gauge theory memory" } ] }, "2026-07-23": { "word_cloud": [ { "word": "Syndrome", "weight": 5 }, { "word": "Decoders", "weight": 5 }, { "word": "Surface", "weight": 4 }, { "word": "GKP", "weight": 3 }, { "word": "LDPC", "weight": 4 }, { "word": "Belief", "weight": 2 }, { "word": "Annealing", "weight": 2 }, { "word": "TrappedIons", "weight": 2 }, { "word": "GraphNeuralNet", "weight": 2 }, { "word": "Nonlocality", "weight": 2 }, { "word": "Teleportation", "weight": 2 }, { "word": "Dequantisation", "weight": 2 }, { "word": "BiasedNoise", "weight": 3 }, { "word": "PostSelection", "weight": 2 }, { "word": "Hardware", "weight": 2 } ], "social_highlights": "Highlights: decoder comparability across software stacks, hardware-in-the-loop syndrome validation, annealing-discovered quantum codes, microwave sympathetic cooling for ions, physics-informed graph neural decoders, RL-scheduled cluster belief propagation, robust logical Bell nonlocality, latency-aware punctured teleportation codes, dequantised Pauli correlation encoding, biased-noise fault-tolerance review, ML-based syndrome post-selection.", "papers": [ { "arxiv_id": "2607.19446", "title": "Decoder Comparability Across Quantum Software Stacks: Repeated-Round Surface and Digitized-GKP Syndrome Replay", "authors": "Dennis Delali Kwesi Wayo, Chinonso Onah, Rodrigo Alves Dias, Leonardo Goliatt, Zaher Mundher Yaseen Sven Groppe", "arxiv_url": "https://arxiv.org/abs/2607.19446", "pdf_url": "https://arxiv.org/pdf/2607.19446", "summary": "The authors present a contract-preserving comparison of decoder behavior (BP, MWPM, UF) across four syndrome-generation software stacks (PennyLane, Qiskit, Cirq, LiDMaS+) for repeated-round surface-code and digitized-GKP circuits. Using a fixed replay interface spanning $24,000$ request/response lines with zero parse failures, they show stable within-family decoder ordering ($BP0.75$, and their existential bound guarantees a solution for $R>0.7158$, improving the prior $R>0.7495$ threshold. The results extend to the Max-LINSAT problem over arbitrary MDS codes via a novel Brascamp–Lieb-type inequality.", "motivation": "DQI offers a quantum advantage for OPI beyond classical heuristics, but follow-up improvements were limited to average-case analyses. Establishing worst-case quantum algorithms and tighter existential bounds clarifies the true reach of quantum advantage for these coding-theoretic optimization problems.", "highlights": [ "Worst-case quantum algorithm for OPI beyond the DQI regime", "Achieves $s=1$ solutions for $R>0.75$, matching average-case bounds", "Improves existential threshold from $R>0.7495$ to $R>0.7158$" ], "keywords": [ { "label": "OPI Problem", "reason": "Solves the Optimal Polynomial Intersection problem" }, { "label": "DQI", "reason": "Goes beyond decoded quantum interferometry" }, { "label": "MDS Codes", "reason": "Extends results to Max-LINSAT over MDS codes" }, { "label": "Brascamp-Lieb", "reason": "Uses a Brascamp–Lieb-type inequality in the MDS setting" } ], "emoji": "📐", "social_summary": "Designed a worst-case quantum algorithm for polynomial intersection that surpasses decoded quantum interferometry and tightens existential bounds via a Brascamp-Lieb inequality.", "highlights_oneliner": "Worst-case quantum OPI beyond DQI" }, { "arxiv_id": "2607.14484", "title": "Syndrome-as-Header: A Quantum Label-Switching Architecture via Uncorrectable Error Injection", "authors": "IlKwon Sohn, Ju-Bong Kim, Kwangil Bae, Wooyeong Song, Wonhyuk Lee", "arxiv_url": "https://arxiv.org/abs/2607.14484", "pdf_url": "https://arxiv.org/pdf/2607.14484", "summary": "The authors propose Syndrome-as-Header (SAH), a quantum label-switching architecture that embeds routing labels into the syndrome structure of an encoded payload using Uncorrectable Error Injection (UEI). Core routers extract the syndrome header, suppress correctable channel-error deviations, and swap labels without measuring or decoding the logical payload, supporting FAST forwarding and a VERIFICATION mode. In NSFNet timing benchmarks with per-hop QEC, SAH eliminates external-header/payload alignment constraints, converting timing uncertainty into memory-residence latency.", "motivation": "Scaling quantum networks beyond point-to-point links requires packet forwarding tolerant to control-plane timing jitter, but existing optical-burst and quantum-wrapper schemes rely on jitter-prone external classical headers. Embedding routing information directly in the quantum syndrome domain removes the alignment bottleneck that causes guard-window and delay-line budget failures.", "highlights": [ "Routing labels embedded in syndrome structure via Uncorrectable Error Injection", "Label swapping without measuring or decoding the logical payload", "Acceptance $0.947$ and throughput $3.649\\times 10^3$ blocks/s at $\\sigma_{cp}=10\\,\\mu s$, $T_2=1$ ms" ], "keywords": [ { "label": "Quantum Networks", "reason": "Targets packet forwarding in scalable quantum networks" }, { "label": "Syndrome Header", "reason": "Embeds routing labels in the QEC syndrome domain" }, { "label": "Error Injection", "reason": "Uses Uncorrectable Error Injection to map labels" }, { "label": "Label Switching", "reason": "Implements a quantum label-switching architecture" } ], "emoji": "🚦", "social_summary": "Proposed embedding network routing labels into quantum error-correction syndromes, letting routers switch labels without decoding payloads and removing timing-alignment bottlenecks.", "highlights_oneliner": "Routing labels hidden in QEC syndromes" }, { "arxiv_id": "2607.14175", "title": "Transducer leakage error suppression using invariant-based shortcut", "authors": "Shi-Qiang Qiao, Zheng Shan, Xue-Ke Song, Shi-Lei Su, Liu Ye, Dong Wang", "arxiv_url": "https://arxiv.org/abs/2607.14175", "pdf_url": "https://arxiv.org/pdf/2607.14175", "summary": "The authors propose an optimal invariant-based inverse engineering method to suppress transducer leakage errors in spin-superconducting hybrid quantum systems, where virtual photons mediate energy exchange between a spin qubit and a transmon qubit. The scheme reduces leakage probability from the computational to non-computational subspace to as low as $0.01$ and achieves state-population fidelities above $99\\%$. Using the optimized pulses, high-fidelity iSWAP gates and remote entangled-state preparation are realized within the computational subspace.", "motivation": "Hybrid spin-superconducting systems combine the long coherence of semiconductor spin qubits with the fast, high-fidelity operations of transmons, but their multi-level structure introduces leakage errors during photon-mediated coupling. Traditional adiabatic methods are too slow relative to decoherence times, motivating faster shortcut-to-adiabaticity control that resists leakage and control errors.", "highlights": [ "Leakage probability from computational to non-computational subspace suppressed to a minimum of $0.01$", "High-fidelity iSWAP gate and remote entanglement preparation exceeding $99\\%$ fidelity under realistic decoherence", "Outperforms conventional $\\pi$-pulse, DRAG, counter-diabatic, and LBFGS-GRAPE schemes in robustness against control errors" ], "keywords": [ { "label": "Leakage Suppression", "reason": "Core goal is minimizing transitions out of the computational subspace in a transducer" }, { "label": "Invariant Engineering", "reason": "Uses Lewis-Riesenfeld invariant-based inverse engineering for optimized pulse design" }, { "label": "Hybrid Systems", "reason": "Targets spin-superconducting hybrid quantum platforms with transmon and spin qubits" }, { "label": "iSWAP Gate", "reason": "Demonstrates high-fidelity iSWAP gate operations and entanglement preparation" } ], "emoji": "🔀", "social_summary": "Suppressing leakage errors in hybrid spin-superconducting qubits using shortcut-to-adiabaticity pulse control to achieve high-fidelity gates and entanglement.", "highlights_oneliner": "Invariant-based leakage suppression in hybrid qubits" } ] }, "2026-07-16": { "word_cloud": [ { "word": "Cat", "weight": 5 }, { "word": "LDPC", "weight": 3 }, { "word": "Decoding", "weight": 4 }, { "word": "Bosonic", "weight": 3 }, { "word": "Qudits", "weight": 2 }, { "word": "Foliation", "weight": 2 }, { "word": "Tensor", "weight": 3 }, { "word": "Surface", "weight": 2 }, { "word": "Concatenation", "weight": 2 }, { "word": "Reed-Solomon", "weight": 2 }, { "word": "Dissipation", "weight": 2 }, { "word": "Speculation", "weight": 2 }, { "word": "Latency", "weight": 2 }, { "word": "Biased", "weight": 2 }, { "word": "Stabilizer", "weight": 2 } ], "social_highlights": "Highlights: high-rate CPM-based quantum LDPC codes from pair partitions, foliating qudit codes into graph states, tensor network decoding under correlated errors, universal multi-mode cat qubit gates via dissipation, Clifford-only Reed-Solomon Tornado codes for biased cat qubits, streaming QEC resource simulation, and verified speculative window decoding.", "papers": [ { "arxiv_id": "2607.14091", "title": "Pair-Partition Constructions for CPM-Based Quantum LDPC Codes", "authors": "Koki Okada, Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2607.14091", "pdf_url": "https://arxiv.org/pdf/2607.14091", "summary": "The authors construct binary CSS quantum LDPC codes from circulant permutation matrices (CPMs), parameterized by column weight $J$, row weight $L$, and prime lift size $P$. A $J \\times J$ array of pair partitions imposes paired-difference equations on the CPM exponents to guarantee CSS orthogonality while excluding short cycles. They report several finite girth-six examples including $[[372,130,16]]$ and $[[518,228,16]]$ codes with distances established by exhaustive low-weight exclusion.", "motivation": "Quantum LDPC codes require sparse stabilizer checks for efficient syndrome extraction and sparse-graph decoding, and quasi-cyclic CPM constructions offer compact explicit descriptions. Coupling two exponent tables to guarantee CSS orthogonality while controlling girth is a longstanding design challenge that this work addresses algebraically.", "highlights": [ "$(J,L)=(4,12)$ girth-six code $[[372,130,16]]$ with rate $0.349$", "$(J,L)=(4,14)$ girth-six code $[[518,228,16]]$ with rate $0.440$", "Distances certified by exhaustive low-weight exclusion and explicit non-stabilizer witnesses" ], "keywords": [ { "label": "CSS Codes", "reason": "Constructs Calderbank-Shor-Steane quantum stabilizer codes" }, { "label": "CPM-LDPC", "reason": "Builds codes from circulant permutation matrices" }, { "label": "Pair Partitions", "reason": "Uses pair partitions to impose CSS orthogonality" }, { "label": "Girth", "reason": "Focuses on girth-six sparse-graph constraints" } ], "emoji": "🔗", "social_summary": "Constructs high-rate quantum LDPC codes from circulant permutation matrices using pair partitions that guarantee orthogonality and exclude short cycles.", "highlights_oneliner": "Pair-partition CPM-based quantum LDPC codes" }, { "arxiv_id": "2607.13784", "title": "Foliated Quantum Error Correction for Qudits", "authors": "Gözde Üstün, Simon J. Devitt, Jason Saied", "arxiv_url": "https://arxiv.org/abs/2607.13784", "pdf_url": "https://arxiv.org/pdf/2607.13784", "summary": "The paper presents a framework for foliating any Pauli-based quantum error-correcting code over prime-dimensional qudits, producing a qudit graph state suitable for fault-tolerant measurement-based quantum computing. Examples include the qudit toric code, the $d$-dimensional perfect $[[5,1,3]]$ code, and a generalized CSS honeycomb code for arbitrary prime dimension $d$. Numerical thresholds for the foliated qudit toric code are shown to be comparable to the non-foliated version.", "motivation": "Measurement-based quantum computing is natural for platforms like photonics where high-dimensional states are readily available, but foliation frameworks had been restricted mostly to qubits. Extending foliation to arbitrary prime-dimensional qudit codes broadens the range of codes usable in these architectures.", "highlights": [ "General foliation framework for any Pauli-based code over prime-dimensional qudits", "Worked examples: qudit toric, perfect $[[5,1,3]]$, and CSS honeycomb codes", "Foliated qudit toric thresholds comparable to non-foliated version via HDRG decoder" ], "keywords": [ { "label": "Qudits", "reason": "Works with prime-dimensional qudit systems" }, { "label": "Foliation", "reason": "Foliates codes into graph states for MBQC" }, { "label": "Graph States", "reason": "Produces qudit graph states for measurement-based computing" }, { "label": "Toric Code", "reason": "Numerical thresholds computed for qudit toric code" } ], "emoji": "🍃", "social_summary": "Introduces a general method to foliate any qudit stabilizer code into graph states for fault-tolerant measurement-based quantum computing.", "highlights_oneliner": "Foliating qudit codes for measurement-based QEC" }, { "arxiv_id": "2607.13570", "title": "Tensor Network decoding under inter-qubit correlated errors", "authors": "Yue Yan, SiYing Wang, ZhiXin Xia, HanNuo Yuan, CanWei Shi, Xiang-Bin Wang", "arxiv_url": "https://arxiv.org/abs/2607.13570", "pdf_url": "https://arxiv.org/pdf/2607.13570", "summary": "The authors extend maximum-likelihood tensor network decoding to inter-qubit correlated error models, which previous constructions could not handle. They introduce binary indices and two transformations to build a multi-index tensor network, then use reparametrization, elimination, and index classification to decompose huge-dimensional tensors into efficiently contractible lower-dimensional ones. Simulations show a higher finite-size threshold than MWPM under a correlated (ENN) error model.", "motivation": "Tensor network decoders achieve optimal thresholds for the surface code under independent single-qubit noise, but realistic systems suffer correlated errors from crosstalk and non-Markovian effects. Whether the tensor network advantage survives correlated noise was previously unknown due to construction and contractibility challenges.", "highlights": [ "Multi-index tensor network construction handling correlated errors", "Tensor decomposition making the network efficiently contractible under tractability conditions", "Higher finite-size threshold than MWPM for the ENN correlated error model" ], "keywords": [ { "label": "Tensor Networks", "reason": "Uses tensor network maximum-likelihood decoding" }, { "label": "Correlated Errors", "reason": "Targets inter-qubit correlated noise models" }, { "label": "Surface Code", "reason": "Decodes the 2D surface code" }, { "label": "Thresholds", "reason": "Compares finite-size thresholds against MWPM" } ], "emoji": "🕸️", "social_summary": "Extends optimal tensor network decoding to correlated qubit errors, beating minimum-weight matching thresholds on the surface code.", "highlights_oneliner": "Tensor network decoding for correlated errors" }, { "arxiv_id": "2607.13975", "title": "Universal Quantum Computation with Multi-Mode Schrödinger Cat States Stabilized by Non-Local Dissipation Engineering", "authors": "Jesper Lind-Olsen, Jonas Lidal, Tron Omland, Joakim Bergli", "arxiv_url": "https://arxiv.org/abs/2607.13975", "pdf_url": "https://arxiv.org/pdf/2607.13975", "summary": "The paper introduces a universal gate set for dissipatively stabilized multi-mode Schrödinger cat qubits built from a chain of Kerr nonlinear oscillators coupled through engineered non-local dissipation. Arbitrary single-qubit control is achieved via $X$-axis rotations and $\\pi/2$ $Z$-rotations, and entangling $XX(\\pi/2)$ gates are realized by coupling two arrays through a single oscillator each. Numerical simulations demonstrate high-fidelity gates under realistic photon loss, disorder, and low-dimensional theory validity.", "motivation": "Multi-mode cat states can be dissipatively stabilized as robust quantum memories with noise biased toward specific errors, but a framework for universal computation on them was missing. Establishing universal gates makes these states a candidate architecture for hardware-efficient bosonic quantum computing.", "highlights": [ "Universal single-qubit control via $X$ rotations and $\\pi/2$ $Z$-rotations", "Entangling $XX(\\pi/2)$ gate via single-oscillator coupling between arrays", "High-fidelity gate simulations analyzed under photon loss and disorder" ], "keywords": [ { "label": "Cat Qubits", "reason": "Encodes logical information in Schrödinger cat states" }, { "label": "Bosonic Codes", "reason": "Uses harmonic oscillator manifolds for QEC" }, { "label": "Dissipation Engineering", "reason": "Stabilizes states via non-local engineered dissipation" }, { "label": "Universal Gates", "reason": "Introduces a universal gate set" } ], "emoji": "🐱", "social_summary": "Proposes a universal gate set for dissipatively stabilized multi-mode cat qubits, enabling hardware-efficient bosonic quantum computation.", "highlights_oneliner": "Universal gates for multi-mode cat qubits" }, { "arxiv_id": "2607.13105", "title": "Clifford-Only Quantum Reed-Solomon Codes and a Tornado Concatenation for Biased-Noise Cat Qubits", "authors": "Cheng-You Ho, Justin Luo, Henry Ng, Simba Shi, Daniel Wang", "arxiv_url": "https://arxiv.org/abs/2607.13105", "pdf_url": "https://arxiv.org/pdf/2607.13105", "summary": "Exploiting the extreme noise bias of dissipative cat qubits, the authors promote a classical Reed-Solomon code into a Clifford-only bit-flip quantum code, the $[[21,9,d_X=6,d_Z=1]]$ code, avoiding the non-Clifford quantum Fourier transform of standard quantum RS codes. They introduce a Tornado architecture concatenating this outer RS code with an inner distance-three repetition code to form a $[[63,9,18]]$ code decoded in two stages. Monte Carlo simulations show logical error rate scaling as $p_L \\propto p^6$, steeper than parent codes.", "motivation": "Cat qubits suppress one Pauli error channel exponentially, leaving only a single dominant error type, making full general QEC machinery unnecessary. This lets any classical linear code become a Clifford stabilizer code, turning the rich classical coding toolbox into directly usable quantum codes.", "highlights": [ "Clifford-only $[[21,9,6]]$ bit-flip RS code fully simulable in Stim", "Tornado $[[63,9,18]]$ concatenation with two-stage decoder", "Logical error rate scales as $p_L \\propto p^6$, reaching $5.3\\times10^{-3}$ at $p=0.1$" ], "keywords": [ { "label": "Cat Qubits", "reason": "Targets biased-noise dissipative cat qubits" }, { "label": "Reed-Solomon", "reason": "Promotes classical RS codes to quantum codes" }, { "label": "Concatenation", "reason": "Tornado two-layer concatenated architecture" }, { "label": "Biased Noise", "reason": "Exploits strong noise asymmetry for single-error correction" } ], "emoji": "🌪️", "social_summary": "Turns classical Reed-Solomon codes into Clifford-only quantum codes for biased cat qubits, with a Tornado concatenation giving steep error suppression.", "highlights_oneliner": "Clifford-only RS codes for cat qubits" }, { "arxiv_id": "2607.13351", "title": "StreamingQEC: Streaming Quantum Error Correction in Tightly Integrated Quantum-Classical Systems via Certified Recurrence", "authors": "Panayiotis Christou, Shuwen Kan, Hao Wang, Ying Mao", "arxiv_url": "https://arxiv.org/abs/2607.13351", "pdf_url": "https://arxiv.org/pdf/2607.13351", "summary": "StreamingQEC is a system-level simulator that translates fault-tolerant logical workloads into resource-constrained streaming-QEC pipelines covering readout, syndrome transport, decoding, feedback, and control. It combines explicit discrete-event simulation, an automatic staged-fluid mode for fast design-space exploration, and a certified recurrence mechanism that compresses repeated transitions when scheduling state and metrics match. Using a decoder-runtime dataset of nearly 10,000 measurements, it achieves large host-side speedups while preserving decoding-event counts.", "motivation": "Existing QEC simulators target circuits, noise, and decoders but ignore how QEC workloads contend for controller, compute, accelerator, and communication resources during protected logical execution. System architects need tools that connect workload cadence to resource placement, queueing, and end-to-end completion time.", "highlights": [ "Certified recurrence gives $24.0\\times$ host-side speedup preserving 59.7 million decoding events", "Scales beyond $1.22$ billion events in recurrent simulation", "Staged-fluid mode achieves $2.60\\%$ mean makespan error across 17 configurations" ], "keywords": [ { "label": "QEC Simulator", "reason": "System-level simulator for streaming QEC pipelines" }, { "label": "Discrete-Event", "reason": "Uses discrete-event simulation for reference semantics" }, { "label": "Resource Scheduling", "reason": "Models controller, compute, accelerator contention" }, { "label": "Decoder Runtime", "reason": "Built on a decoder-runtime measurement dataset" } ], "emoji": "⚙️", "social_summary": "Introduces a system-level simulator modeling how quantum error correction workloads contend for classical resources, with massive speedups via certified recurrence.", "highlights_oneliner": "System-level simulator for streaming QEC pipelines" }, { "arxiv_id": "2607.13062", "title": "The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop", "authors": "Rylan Malarchick", "arxiv_url": "https://arxiv.org/abs/2607.13062", "pdf_url": "https://arxiv.org/pdf/2607.13062", "summary": "This paper builds the previously missing verifier side of speculative window decoding, which hides decoder latency by guessing cross-boundary decisions and verifying lazily. It establishes a predictability bracket showing achievable accuracy near $0.999$ within three rounds, a machine-checked (Lean4) worst-case blast-radius bound showing mispredictions add no error floor, and a compiler pass with runtime executor deriving and validating a restart policy. A second decoder confirms which results are decoder-agnostic versus matching-specific.", "motivation": "Real-time QEC faces a latency problem as syndrome rounds arrive on fixed hardware cadence, and window decoding creates serial cross-boundary bottlenecks that speculation aims to remove. Prior work SWIPER and ARTERY built predictors but never built the verifier side that determines whether speculation is safe and worthwhile.", "highlights": [ "Predictability bracket reaching $\\approx 0.999$ accuracy within three rounds", "Machine-checked Lean4 blast-radius bound proving no added error floor", "Decoder-agnostic predict-verify-recover wrapper validated on surface code and union-find" ], "keywords": [ { "label": "Window Decoding", "reason": "Analyzes speculative window decoding pipelines" }, { "label": "Speculation", "reason": "Builds the verifier side of speculative decoding" }, { "label": "Lean4", "reason": "Machine-checked probability core in Lean4" }, { "label": "Latency", "reason": "Addresses real-time decoder latency hiding" } ], "emoji": "🔮", "social_summary": "Builds the missing verifier half of speculative window decoding, with a machine-checked bound proving speculation adds no logical error floor.", "highlights_oneliner": "Verifying speculative window decoders" } ] }, "2026-07-15": { "word_cloud": [ { "word": "Surface", "weight": 4 }, { "word": "Superconducting", "weight": 3 }, { "word": "Defect", "weight": 3 }, { "word": "Holographic", "weight": 3 }, { "word": "HaPPY", "weight": 2 }, { "word": "Trapped-ion", "weight": 2 }, { "word": "Phantom", "weight": 3 }, { "word": "Hypergraph", "weight": 3 }, { "word": "qLDPC", "weight": 3 }, { "word": "Transversal", "weight": 2 }, { "word": "Decoders", "weight": 3 }, { "word": "Side-channel", "weight": 3 }, { "word": "Syndrome", "weight": 2 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Hermitian", "weight": 2 } ], "social_highlights": "Highlights: Excluding defective qubits boosts logical fidelity on a 120-qubit processor, holographic codes reveal gravity-like signatures on trapped ions, phantom qLDPC codes enable free logical entangling gates, decoder syndrome data leaks running algorithms as a side-channel, and Jordan-form techniques yield record-beating stabilizer codes.", "papers": [ { "arxiv_id": "2607.12118", "title": "Error correction on an array of superconducting qubits with defective components", "authors": "Julien M. Drouet, Xanda C. Kolesnikow, Campbell K. McLauchlan, Georgia M. Nixon, Seok-Hyung Lee, Dominic J. Williamson, Stephen D. Bartlett, Benjamin J. Brown, Robin Harper", "arxiv_url": "https://arxiv.org/abs/2607.12118", "pdf_url": "https://arxiv.org/pdf/2607.12118", "summary": "This work implements and compares strategies for operating distance-5 surface codes on a 120-qubit superconducting processor with defective components, showing that actively excluding underperforming qubits and couplers dramatically reduces logical error rates. The authors demonstrate up to $2.8\\times$ improvement in logical errors per round from defect exclusion versus a defect-ignorant approach ($1.62\\%$ vs $4.49\\%$), while defect-aware decoding yields only modest gains. Combined with leakage post-selection, the defect-exclusion strategy enables a $d=5$ code to outperform the best $d=3$ code in one basis.", "motivation": "Fabrication of large solid-state qubit arrays inevitably produces components with varying performance, and defective qubits or couplers threaten the high thresholds required for error correction. Understanding how to accommodate such defects experimentally is essential as devices scale up beyond a handful of qubits.", "highlights": [ "Up to $2.8\\times$ reduction in logical error per round by excluding defects ($1.62\\%$ vs $4.49\\%$)", "Stability experiment shows $6.3\\%$ per-round failure suppression only when defects are excluded, reviving measurement-based logic gates", "Leakage post-selection combined with defect exclusion lets a $d=5$ code beat the best $d=3$ code in one basis" ], "keywords": [ { "label": "Surface Codes", "reason": "Experiments run distance-5 rotated surface codes for memory and stability" }, { "label": "Defect Exclusion", "reason": "Core strategy of adapting the code to remove underperforming components" }, { "label": "Superconducting Qubits", "reason": "Demonstrated on a 120-qubit square-lattice superconducting processor" }, { "label": "Leakage Postselection", "reason": "Used in combination with defect exclusion to further suppress errors" } ], "emoji": "🩹", "social_summary": "Demonstrated that excluding defective qubits from a 120-qubit superconducting processor slashes logical error rates and revives measurement-based logic gates.", "highlights_oneliner": "Defect exclusion boosts surface-code performance" }, { "arxiv_id": "2607.12047", "title": "Observation of gravity-like signatures in holographic codes on a quantum computer", "authors": "Debopriyo Biswas, Gong Cheng, Krishnanand Karthikeyan, Diana Muñoz-Valencia, Vincent P. Su, Hrant Gharibyan, Daiwei Zhu, Grant Salton, Evgeny Epifanovsky, Martin Roetteler, Christopher Monroe, John Preskill, Norbert M. Linke, ChunJun Cao, Crystal Noel", "arxiv_url": "https://arxiv.org/abs/2607.12047", "pdf_url": "https://arxiv.org/pdf/2607.12047", "summary": "This work implements the HaPPY holographic quantum error-correcting code, a hyperbolic tensor network, on a trapped-ion quantum computer and provides the first experimental confirmation of the Faulkner-Lewkowycz-Maldacena formula in this model. By enriching the code with non-stabilizerness (magic), the authors observe entropic precursors expected of emergent gravity and measure a construction whose entropy behaves like a highly quantum wormhole.", "motivation": "The AdS/CFT correspondence suggests spacetime geometry emerges from boundary entanglement, and quantum error-correcting codes provide a concrete finite-dimensional setting to explore this holographic duality. Programmable quantum computers now allow experimental testing of how quantum matter modifies emergent geometry, a feature beyond fixed-background holographic codes.", "highlights": [ "First experimental confirmation of the Faulkner-Lewkowycz-Maldacena formula in the HaPPY code", "Injection of magic reveals entropic precursors of emergent gravity via proto-area entropy", "Demonstrated a code construction with entropy signatures reminiscent of a quantum wormhole" ], "keywords": [ { "label": "HaPPY Code", "reason": "The holographic tensor-network QEC code implemented on hardware" }, { "label": "AdS/CFT", "reason": "Holographic duality framework the experiment tests" }, { "label": "Trapped Ions", "reason": "Quantum computing platform used for the implementation" }, { "label": "Magic", "reason": "Non-stabilizerness added to observe gravity-like entropic signatures" } ], "emoji": "🕳️", "social_summary": "Ran a holographic error-correcting code on a trapped-ion quantum computer, revealing gravity-like signatures and confirming a key formula of emergent spacetime.", "highlights_oneliner": "Emergent gravity signatures from holographic codes" }, { "arxiv_id": "2607.12948", "title": "Logical Entangling with Phantom Codes in Hypergraph Products", "authors": "Keming He, Ziao Tang, Zetong Li, Ge Bai, Xin Wang", "arxiv_url": "https://arxiv.org/abs/2607.12948", "pdf_url": "https://arxiv.org/pdf/2607.12948", "summary": "This paper studies phantom codes, which implement every ordered in-block logical CNOT through physical qubit permutations and Pauli-frame updates, within binary CSS hypergraph product (HGP) codes. The authors prove that, up to natural equivalences, the simplex-repetition family is the unique HGP family satisfying the phantom condition, and evaluate it under circuit-level noise for logical GHZ preparation and Trotterized many-body simulation, showing advantages over rotated surface-code baselines.", "motivation": "Logical entangling gates are a dominant source of spacetime overhead in fault-tolerant quantum computation, and phantom codes promise to reduce this by avoiding extra physical operations. Determining whether this mechanism is compatible with low-weight qLDPC stabilizer structure is central to designing low-overhead architectures.", "highlights": [ "Proved the simplex-repetition family is the unique HGP family satisfying the phantom condition", "Retained low-weight stabilizer checks while enabling permutation-based in-block logical CNOTs", "Demonstrated circuit-level advantages over rotated surface codes in GHZ preparation and Trotterized simulation" ], "keywords": [ { "label": "Phantom Codes", "reason": "Codes implementing logical CNOTs via permutations and Pauli-frame updates" }, { "label": "Hypergraph Product", "reason": "CSS code family within which the phantom condition is analyzed" }, { "label": "qLDPC", "reason": "Low-weight stabilizer structure targeted for low-overhead fault tolerance" }, { "label": "Neutral Atoms", "reason": "Reconfigurable atom arrays are the natural hardware for nonlocal operations" } ], "emoji": "🔗", "social_summary": "Identified a unique quantum LDPC code family that implements logical entangling gates for free through qubit permutations, cutting fault-tolerant overhead.", "highlights_oneliner": "Permutation-based logical CNOTs in qLDPC codes" }, { "arxiv_id": "2607.12174", "title": "Anticipating Decoder Side-channel Attacks in Fault-tolerant Quantum Computers", "authors": "Shashvat Shukla, Dan E. Browne, Shin Nishio", "arxiv_url": "https://arxiv.org/abs/2607.12174", "pdf_url": "https://arxiv.org/pdf/2607.12174", "summary": "This work identifies a new class of side-channel attacks against fault-tolerant quantum computers, in which syndrome data sent to the decoder can be used to infer which logical circuit is being executed. The authors introduce the concept of gate fingerprints—patterns in syndrome data revealing logical operations—focusing on Clifford+$T$ computation in the surface code, and show how this information can compromise algorithm confidentiality.", "motivation": "As quantum computing matures into an applied technology, protecting quantum computers against information security attacks becomes increasingly important. Decoder systems, which process large amounts of syndrome data at low latency, represent an overlooked attack surface for extracting private computational information.", "highlights": [ "Introduced gate fingerprints as identifiable patterns in syndrome data revealing logical operations", "Analyzed how Clifford+$T$ operations in the surface code produce distinguishable fingerprints", "Recommended that decoder systems be secured or built by a trusted party to prevent side-channel leakage" ], "keywords": [ { "label": "Side-channel", "reason": "New class of attacks exploiting decoder syndrome data" }, { "label": "Gate Fingerprints", "reason": "Introduced concept describing syndrome patterns of logical operations" }, { "label": "Decoders", "reason": "Decoder systems identified as the vector for the attack" }, { "label": "Clifford+T", "reason": "Computation model analyzed in the surface code setting" } ], "emoji": "🕵️", "social_summary": "Revealed that syndrome data feeding quantum error-correction decoders can leak which algorithm is running, exposing a new side-channel security risk.", "highlights_oneliner": "Syndrome data leaks logical circuit identity" }, { "arxiv_id": "2607.12242", "title": "Quantum Codes from $r$-Nearly Self-Orthogonal Linear Codes via Jordan Canonical Form over $\\mathbb{F}_{q^2}$", "authors": "Liangdong Lu, Ruipan Yang, Yang Liu, Qiang Fu, Guanmin Guo", "arxiv_url": "https://arxiv.org/abs/2607.12242", "pdf_url": "https://arxiv.org/pdf/2607.12242", "summary": "This paper introduces a Jordan-canonical-form framework for constructing $q$-ary quantum stabilizer codes from arbitrary classical linear codes over $\\mathbb{F}_{q^2}$ without requiring the dual-containing (self-orthogonality) condition. By measuring the obstruction $r=\\mathrm{Rank}(HH^{\\dagger})$ and systematically reducing the rank via rank-one perturbations along the Jordan basis, they build an explicit Hermitian self-orthogonal code yielding quantum codes with parameters $[[n+r,2k-n+r,\\geq d]]_q$. The construction produces several record codes improving on Grassl's tables.", "motivation": "The Hermitian self-orthogonality requirement has long restricted which classical codes can be used to build quantum stabilizer codes, excluding many good codes. Relaxing this dual-containing condition is an important direction in quantum coding theory, building on earlier nearly-self-orthogonal Construction X approaches.", "highlights": [ "Removed the dual-containing requirement using a Jordan-canonical-form decomposition $A=PJ_AP^{-1}$", "Derived quantum codes with parameters $[[n+r,2k-n+r,\\geq d]]_q$ with a distance-preservation criterion", "Produced record quantum codes that improve or supplement the best-known parameters in Grassl's tables" ], "keywords": [ { "label": "Stabilizer Codes", "reason": "Constructs $q$-ary quantum stabilizer codes from classical linear codes" }, { "label": "Jordan Form", "reason": "Canonical-form decomposition drives the rank-reduction construction" }, { "label": "Hermitian Duality", "reason": "Self-orthogonality with respect to Hermitian inner product is the relaxed condition" }, { "label": "Record Codes", "reason": "New codes improve on Grassl's best-known parameter tables" } ], "emoji": "🧮", "social_summary": "Introduced a Jordan-form technique to build quantum codes from any classical linear code, bypassing self-orthogonality and beating best-known parameters.", "highlights_oneliner": "Quantum codes without self-orthogonality requirement" } ] }, "2026-07-14": { "word_cloud": [ { "word": "Color", "weight": 4 }, { "word": "Decoders", "weight": 5 }, { "word": "Neural", "weight": 3 }, { "word": "Holographic", "weight": 3 }, { "word": "Magic", "weight": 2 }, { "word": "Bulk", "weight": 2 }, { "word": "Diagonalization", "weight": 3 }, { "word": "Dual-rail", "weight": 2 }, { "word": "Ising", "weight": 2 }, { "word": "Readout", "weight": 4 }, { "word": "Mamba", "weight": 3 }, { "word": "Superconducting", "weight": 2 }, { "word": "Repeaters", "weight": 3 }, { "word": "Bacon-Shor", "weight": 3 }, { "word": "Distributed", "weight": 2 } ], "social_highlights": "Highlights: AI pre-decoders slashing color-code error rates and runtimes, a certified boundary-magic witness for state-dependent holographic entropy, dual-rail code-space recovery extending sample-based quantum diagonalization, a Mamba-based discriminator for fast scalable qubit readout, and asymmetry-aided Bacon-Shor repeaters enabling decoder-free distributed computing.", "papers": [ { "arxiv_id": "2607.10058", "title": "Fast and accurate AI-based pre-decoders for color codes", "authors": "Jan Olle, Christopher Chamberland, Muyuan Li, Igor Baratta", "arxiv_url": "https://arxiv.org/abs/2607.10058", "pdf_url": "https://arxiv.org/pdf/2607.10058", "summary": "This work introduces AI-based pre-decoders for triangular color codes, presenting a novel neural-network architecture that maps color-code stabilizers onto a 2D grid for convolutional processing along with data-processing techniques to handle syndrome-extraction circuits containing feedforward operations. Because pre-decoders act locally—performing spacelike corrections on physical qubits and timelike corrections on stabilizer measurements—they are compatible with parallel block-wise decoding and lattice-surgery protocols. Combined with Chromobius as the global decoder, the pipeline improves both logical failure rates and runtimes as the code distance grows.", "motivation": "Color codes offer advantages over surface codes such as transversal logical Clifford gates and simpler lattice surgery, but their practical deployment is held back by slower decoders and worse logical failure rates. Narrowing this performance gap is crucial for making color codes viable for large-scale fault-tolerant quantum computation.", "highlights": [ "At $d=31$ and $p=0.3\\%$, the pre-decoder + Chromobius pipeline improves logical failure rate by $347\\times$", "Runtime reduced by $7.33\\times$ compared to raw Chromobius decoding alone", "Performance gains become more pronounced as code distance increases, with early GPU results below $1\\mu s$" ], "keywords": [ { "label": "Color Codes", "reason": "The paper targets triangular color codes as an alternative to surface codes" }, { "label": "Pre-decoders", "reason": "Introduces local AI-based pre-decoders compatible with block-wise decoding" }, { "label": "Neural Networks", "reason": "Uses a novel convolutional architecture for stabilizer mapping" }, { "label": "Chromobius", "reason": "Uses Chromobius as the global decoder in the pipeline" } ], "emoji": "🎨", "social_summary": "Introducing AI-based pre-decoders for color codes that slash logical error rates and decoding runtimes, bringing color codes closer to practical fault-tolerant computing.", "highlights_oneliner": "AI pre-decoders boost color code decoding" }, { "arxiv_id": "2607.10663", "title": "Certified boundary-magic witness for state-dependent proto-area in a holographic code", "authors": "Luis Lozano", "arxiv_url": "https://arxiv.org/abs/2607.10663", "pdf_url": "https://arxiv.org/pdf/2607.10663", "summary": "This paper studies a four-qubit product-EPR holographic code and examines seven deformations to identify which nonlocal operations produce state-dependent boundary entropy. It shows that only matter-controlled bond motion yields a leading quadratic logical-state dependence of the boundary entropy, and constructs a certified finite-code boundary witness by projecting the stabilizer-Rényi quadratic form away from pairwise Pauli tangents. Total stabilizer Rényi magic is shown not to characterize the effect, establishing a finite-code witness rather than a universal magic law.", "motivation": "Quantum error correction provides a finite-dimensional formulation of bulk reconstruction and area terms in holography, motivating study of nonstabilizer deformations that make boundary entropy depend on the logical state. Understanding which deformations produce state-dependent proto-area connects error-correcting code structure to gravitational backreaction.", "highlights": [ "Only matter-controlled bond motion produces leading quadratic logical-state dependence of boundary entropy", "A certified boundary witness is positive for bond-moving deformation and zero for six comparisons", "Total stabilizer Rényi magic is nonzero even without boundary response, so it does not characterize the effect" ], "keywords": [ { "label": "Holographic Codes", "reason": "Studies a product-EPR holographic quantum error-correcting code" }, { "label": "Magic", "reason": "Analyzes stabilizer Rényi magic as a possible characterization" }, { "label": "Proto-area", "reason": "Investigates state-dependent proto-area boundary entropy response" }, { "label": "Bulk Reconstruction", "reason": "Connects QEC to holographic bulk reconstruction and area operators" } ], "emoji": "🌌", "social_summary": "Establishing a certified finite-code witness that identifies which nonlocal deformations make holographic boundary entropy depend on the logical state.", "highlights_oneliner": "Certified witness for holographic state-dependent area" }, { "arxiv_id": "2607.10227", "title": "Code-space recovery for sample-based quantum diagonalization beyond native symmetry constraints", "authors": "Byeongyong Park, Sanha Kang, Doyeol Ahn, Keunhong Jeong", "arxiv_url": "https://arxiv.org/abs/2607.10227", "pdf_url": "https://arxiv.org/pdf/2607.10227", "summary": "This paper introduces code-space recovery for sample-based quantum diagonalization (SQD), engineering recoverable structure through encoding rather than assuming native symmetry constraints in the target problem. Using a dual-rail representation where each logical qubit maps to a physical pair ($|0\\rangle \\to |01\\rangle$, $|1\\rangle \\to |10\\rangle$), code-space violations in noisy samples become detectable and repairable. Combined with self-consistent recovery, the method is benchmarked on transverse- and mixed-field Ising models with up to 36 spin sites.", "motivation": "SQD performance often relies on recovery procedures exploiting native constraints like particle-number symmetry, but many eigenvalue problems provide no such guaranteed constraint. Engineering recoverable structure through encoding broadens SQD applicability to a wider class of problems.", "highlights": [ "Dual-rail encoding makes code-space violations in noisy samples detectable and repairable", "Code-space recovery yields lower projected Ritz energies than unencoded baselines", "Advantage holds even at smaller projected-basis dimensions despite added circuit overhead" ], "keywords": [ { "label": "SQD", "reason": "Extends sample-based quantum diagonalization beyond native constraints" }, { "label": "Dual-rail", "reason": "Uses dual-rail encoding to create detectable code-space violations" }, { "label": "Ising Models", "reason": "Benchmarks on transverse- and mixed-field Ising models" }, { "label": "Eigenvalue Problems", "reason": "Targets general eigenvalue problems lacking symmetry constraints" } ], "emoji": "🔀", "social_summary": "Engineering recoverable structure via dual-rail encoding to extend sample-based quantum diagonalization to problems lacking native symmetry constraints.", "highlights_oneliner": "Encoded recovery extends SQD applicability" }, { "arxiv_id": "2607.11668", "title": "Multi-Stage Mamba-Based Architecture for Fast and Scalable Superconducting Qubit Readout", "authors": "Luca Otting, Xiaorang Guo, Emmanouil Giortamis, Benjamin Lienhard, Pramod Bhatotia, Martin Schulz", "arxiv_url": "https://arxiv.org/abs/2607.11668", "pdf_url": "https://arxiv.org/pdf/2607.11668", "summary": "This paper presents a multi-stage qubit state discriminator based on the Mamba model, enabling efficient sequence modeling with linear complexity for superconducting qubit readout. A first stage performs initial state discrimination, followed by a refinement stage that identifies and mitigates relaxation-induced errors, forming an end-to-end pipeline. The lightweight model achieves a geometric mean readout fidelity of 0.906 while reducing parameter size by 49.6% compared to state-of-the-art feed-forward approaches.", "motivation": "Qubit readout is the most error-prone and latency-critical stage in superconducting quantum computers, and frequency-multiplexed architectures suffer from crosstalk that degrades fidelity. Fast, accurate readout is essential for real-time feedback in mid-circuit measurement and quantum error correction toward fault-tolerant computing.", "highlights": [ "Achieves geometric mean readout fidelity of 0.906, with optimal model reaching 0.911", "Reduces parameter size by 49.6% while outperforming state-of-the-art methods", "Maintains 0.893 fidelity at 500 ns readout, giving up to 26% reduction in logical error rate" ], "keywords": [ { "label": "Qubit Readout", "reason": "Focuses on superconducting qubit state discrimination" }, { "label": "Mamba", "reason": "Uses the Mamba sequence model with linear complexity" }, { "label": "Machine Learning", "reason": "ML-based discriminator replacing feed-forward neural networks" }, { "label": "Readout Fidelity", "reason": "Key metric optimized alongside latency and model size" } ], "emoji": "📡", "social_summary": "Presenting a lightweight multi-stage Mamba discriminator that delivers faster, more accurate superconducting qubit readout while shrinking model size for fault-tolerant computing.", "highlights_oneliner": "Mamba model speeds up qubit readout" }, { "arxiv_id": "2607.11238", "title": "Asymmetry-aided measurement-based quantum repeaters and distributed quantum computing with a decoder-free client", "authors": "Wooyeong Song, Sungyeon Kook, Wonhyuk Lee, IlKwon Sohn", "arxiv_url": "https://arxiv.org/abs/2607.11238", "pdf_url": "https://arxiv.org/pdf/2607.11238", "summary": "This paper treats logical-qubit transmission and computation jointly by recognizing that a measurement-based quantum repeater is a two-dimensional code foliated along the transmission axis, concentrating channel loss on the transmitted sector. Matching code distance to this structural asymmetry, a rectangular Bacon-Shor subsystem code transmits a logical qubit far more efficiently than transmission-unaware encodings. The framework is extended to a central-to-client round trip with a distance-preserving code switch, enabling distributed quantum computation with a decoder-free client.", "motivation": "Distributed quantum computation requires moving logical qubits across lossy optical links, yet this transmission layer is usually designed separately from the computation it serves. Treating transmission and computation on equal footing within a unified code-design perspective changes how distributed computation can be organized.", "highlights": [ "Over continental distances, cost-optimal repeater density is about an order of magnitude lower than a $[[48,6,8]]$ benchmark", "Asymmetric Bacon-Shor code needs roughly half the repeaters of a symmetric code of equal size", "Joint decoding at the central node enables distributed computation with a decoder-free client" ], "keywords": [ { "label": "Quantum Repeaters", "reason": "Uses measurement-based quantum repeaters for loss-tolerant transmission" }, { "label": "Bacon-Shor", "reason": "Employs rectangular Bacon-Shor subsystem codes matched to loss asymmetry" }, { "label": "Distributed Computing", "reason": "Targets distributed quantum computation over optical links" }, { "label": "Code Switch", "reason": "Introduces a distance-preserving code switch joining transmission and computation" } ], "emoji": "🛰️", "social_summary": "Matching code asymmetry to channel loss lets rectangular Bacon-Shor codes transmit logical qubits far more efficiently, enabling distributed computing with a decoder-free client.", "highlights_oneliner": "Asymmetric codes for efficient quantum repeaters" } ] }, "2026-07-13": { "word_cloud": [ { "word": "footprints", "weight": 4 }, { "word": "fusion", "weight": 4 }, { "word": "Ising", "weight": 4 }, { "word": "categories", "weight": 3 }, { "word": "thresholds", "weight": 5 }, { "word": "syndrome", "weight": 3 }, { "word": "diagrammatic", "weight": 3 }, { "word": "field", "weight": 3 }, { "word": "mitigation", "weight": 4 }, { "word": "noise", "weight": 4 }, { "word": "extrapolation", "weight": 4 }, { "word": "benchmarks", "weight": 3 }, { "word": "artefacts", "weight": 3 }, { "word": "hardware", "weight": 3 }, { "word": "decoding", "weight": 3 } ], "social_highlights": "Highlights: Diagrammatic field theory links fusion-category footprints to decoding thresholds, Richardson zero-noise extrapolation is shown to generate artefactual improvements and comes with practical benchmarking sanity checks.", "papers": [ { "arxiv_id": "2607.08911", "title": "A diagrammatic field theory of quantum error correction", "authors": "Steven Rayan", "arxiv_url": "https://arxiv.org/abs/2607.08911", "pdf_url": "https://arxiv.org/pdf/2607.08911.pdf", "summary": "This paper builds a field-theoretic framework for quantum error correction based on fusion-space codes in unitary fusion categories, introducing admissible clusters, total-charge sectors, and orthogonal footprint projectors that record locally visible boundary data left by error histories. It distinguishes diagnostic footprint algebras from syndrome-admissible commuting algebras, proves that exact correctability is equivalent to fibrewise Knill–Laflamme conditions yielding a measure-then-recover factorization, and derives a conditional Peierls-type threshold theorem with $\\Pr_L(\\mathrm{fail}) \\le C|\\Omega_L|e^{-cL}$ for growing code families under local stochastic noise. The Ising-anyon examples show complementary logical diagnostics and genuine decoding ambiguity via Majorana bilinear errors sharing the same measured footprint but differing by a logical bit flip, and the work points to representation-theoretic and algebro-geometric directions involving tube algebras, Yangian-type structures, and Higgs-bundle spectral curves.", "motivation": "Many geometrically defined quantum codes, such as toric, surface, and string-net codes, naturally carry topological or field-theoretic structure that is not fully captured by standard stabilizer or subspace language. Unifying quantum error correction with extended topological and conformal field theory clarifies how syndromes arise from local field-theoretic data, informs decoder and threshold constructions in anyonic and fusion-category codes, and opens connections to representation theory and algebraic geometry that may guide scalable architectures.", "highlights": [ "Defines categorical footprints and syndrome-admissible commuting algebras for fusion-space codes", "Shows fibrewise Knill–Laflamme conditions imply measure-then-recover factorization of correction", "Proves a conditional Peierls-type threshold theorem for growing fusion-category code families" ], "keywords": [ { "label": "Fusion categories", "reason": "The codes are defined as fusion-space codes in unitary fusion categories, and admissible clusters and total-charge projectors are built from this categorical data." }, { "label": "Footprints", "reason": "The core formalism introduces locally visible error footprints and diagnostic footprint algebras that encode measured boundary data and decoding ambiguity." }, { "label": "Ising anyons", "reason": "Concrete constructions and decoding phenomena are illustrated using Ising-anyon puncture codes and explicit Majorana bilinear errors." }, { "label": "Thresholds", "reason": "A conditional Peierls-type threshold theorem bounds $\\Pr_L(\\mathrm{fail})$ for growing code families under local stochastic noise and decoder balance assumptions." } ], "emoji": "🧬", "social_summary": "Reveal how fusion-category field theory encodes quantum error-correcting footprints, syndromes, and thresholds, with explicit Ising-anyon examples and a Peierls-type decay of logical failure.", "highlights_oneliner": "Field-theoretic footprints and thresholds for fusion-category codes" }, { "arxiv_id": "2607.09360", "title": "Benchmarking Error Mitigation: Artefactual Improvements in Zero-Noise Extrapolation", "authors": "Dominik Köster, Wolfgang Mauerer", "arxiv_url": "https://arxiv.org/abs/2607.09360", "pdf_url": "https://arxiv.org/pdf/2607.09360.pdf", "summary": "This paper analyzes Richardson zero-noise extrapolation and exposes a failure mode where, once noise amplification pushes expectation values to an observable floor, the extrapolation degenerates into a fixed rescaling of a single noisy measurement, producing a bogus apparent improvement independent of amplification. Hardware experiments on IQM Euro-Q-Exa confirm this \"horoscope effect\" under ordinary folding, with circuit depth eroding the signal so that extrapolated estimates decouple from the true value and overshoot the ideal by up to $21\\%$. The authors introduce a matched-cost garbage-folding negative control that carries no usable signal yet reports larger apparent improvements than genuine folding, and distil a zero-cost reporting checklist for Richardson ZNE benchmarks to flag artefacts from data already collected.", "motivation": "Zero-noise extrapolation, especially Richardson variants, is widely and often implicitly used to benchmark quantum error mitigation on NISQ hardware, with reported improvements taken as evidence of physical noise reduction. Demonstrating that post-processing arithmetic alone can manufacture large, unphysical improvements when signals are destroyed, and providing practical controls and reporting criteria, is crucial to ensure that QEM benchmarks genuinely reflect device performance rather than statistical artefacts.", "highlights": [ "Derives a collapse regime where Richardson ZNE becomes deterministic rescaling once noise drives signals to a floor", "Demonstrates the horoscope effect on real hardware with ordinary folding, yielding up to $21\\%$ overshoot of the ideal value", "Introduces garbage-folding negative controls and a no-cost reporting checklist to distinguish genuine mitigation from artefacts" ], "keywords": [ { "label": "Zero-noise", "reason": "The work focuses on Richardson zero-noise extrapolation, analyzing its behaviour under noise amplification and extrapolation to the $\\lambda=0$ limit." }, { "label": "Mitigation", "reason": "It scrutinizes quantum error mitigation benchmarks, showing when mitigation claims are artefacts and proposing checks to validate reported improvements." }, { "label": "Horoscope effect", "reason": "The central phenomenon is a specific artefactual improvement regime, termed the horoscope effect, where extrapolation arithmetic fabricates gains from destroyed signals." }, { "label": "Benchmarks", "reason": "The paper provides a matched-cost negative control and a concise reporting checklist aimed at making ZNE benchmarking protocols credible and reproducible." } ], "emoji": "📉", "social_summary": "Expose how Richardson zero-noise extrapolation can fabricate error-mitigation gains from destroyed signals, and provide hardware-tested controls and a simple checklist to safeguard benchmarks.", "highlights_oneliner": "Artefactual improvements and checks for Richardson ZNE" } ] }, "2026-07-10": { "word_cloud": [ { "word": "Magic", "weight": 5 }, { "word": "Entanglement", "weight": 5 }, { "word": "Bosonic", "weight": 4 }, { "word": "Teleportation", "weight": 4 }, { "word": "Surface", "weight": 4 }, { "word": "Routing", "weight": 3 }, { "word": "Neutral", "weight": 3 }, { "word": "Cat", "weight": 4 }, { "word": "Leakage", "weight": 3 }, { "word": "Spin", "weight": 3 }, { "word": "Mana", "weight": 4 }, { "word": "Purification", "weight": 4 }, { "word": "Decoder", "weight": 3 }, { "word": "Holography", "weight": 3 }, { "word": "FPGA", "weight": 3 } ], "social_highlights": "Highlights: compile hard-looking circuits into efficiently simulable tensor networks, formalize magic gate teleportation, simulate hardware-tailored FTQC, boost GKP magic states, link non-local magic to entanglement, refine holographic reconstruction, parallelize decoding, stabilize cat qubits, route spin qubits, quantify magic for purification, and enable low-latency neutral-atom feedback.", "papers": [ { "arxiv_id": "2607.08396", "title": "Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks", "authors": "Aydin Deger, Stergios Koutsioumpas, Mark Webster, Hasan Sayginel, Joschka Roffe, Dan E. Browne", "arxiv_url": "https://arxiv.org/abs/2607.08396", "pdf_url": "https://arxiv.org/pdf/2607.08396.pdf", "summary": "This paper introduces code-compiled quantum circuits in which logical circuits of high-rate CSS codes are compiled through an encoder so that post-encoding layers consist only of single-qubit diagonal gates and permutations, enabling efficient matrix product state simulation even with large entanglement, nonstabilizerness, and non-Gaussianity. Simulation cost is entirely governed by the encoder bond dimension, independent of circuit depth, and an exact phase-polynomial backend is provided for monomial subfamilies whose cost is set by higher-degree phase terms. The authors demonstrate an infinite polar CSS code family where the physical bond dimension stays bounded by the encoding cost while logical entanglement would grow exponentially, and propose using compiled MPS references for direct fidelity estimation of nontrivial logical circuits from local Pauli readout alone.", "motivation": "Classical simulability of Clifford, matchgate, and low-entanglement circuits has long underpinned resource theories of magic and quantum advantage, but these metrics are often treated as direct indicators of hardness. This work shows that high entanglement and magic do not necessarily preclude efficient tensor-network simulation when leveraged through code structure, sharpening our understanding of which circuit families genuinely require quantum hardware and enabling practical benchmarking tools for early fault-tolerant devices.", "highlights": [ "Define code-compiled quantum circuits with CSS encoders and diagonal-transversal dynamics", "Show encoder bond dimension bounds simulation cost regardless of circuit depth", "Use compiled MPS references for sample-efficient logical fidelity estimation" ], "keywords": [ { "label": "CSS codes", "reason": "Logical circuits of high-rate CSS codes with enhanced symmetries are the core of the code-compiled construction." }, { "label": "MPS", "reason": "Matrix product state representations enable efficient classical simulation of deep, highly entangled compiled circuits." }, { "label": "Polar codes", "reason": "An infinite polar CSS family is used to show bounded physical bond dimension despite growing logical entanglement." }, { "label": "Magic", "reason": "The work addresses circuits with substantial nonstabilizerness as a resource yet still classically simulable via compilation." } ], "emoji": "🔁", "social_summary": "Reveal that highly entangled, magic-heavy circuits can be efficiently simulated by compiling logical CSS circuits into tensor-network-friendly physical dynamics.", "highlights_oneliner": "Compiling CSS-logical circuits into efficiently simulable MPS dynamics" }, { "arxiv_id": "2607.08508", "title": "Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward", "authors": "Yunzhe Zheng, Allen Zang, Aleksander Kubica", "arxiv_url": "https://arxiv.org/abs/2607.08508", "pdf_url": "https://arxiv.org/pdf/2607.08508.pdf", "summary": "The authors develop a general theory of magic gate teleportation protocols, which implement non-Clifford gates on arbitrary inputs without revealing information, and show that after Pauli backpropagation these protocols amount to encoding the input into a stabilizer code heralded by measurement outcomes followed by a logical non-Clifford gate. They construct protocols for any resource state obtained by commuting Pauli rotations on a stabilizer state and give an efficient synthesis algorithm, while proving that useful resource states for such teleportation are necessarily Clifford-equivalent to diagonal states, implying that the distilled output of the $[[5,1,3]]$ protocol is not useful in this framework. They further identify conditions under which feedforward operators can be implemented as Pauli operators, simplifying fault-tolerant implementations and enabling integration with Pauli frame updates.", "motivation": "Gate teleportation and magic states are central to implementing non-Clifford gates in fault-tolerant architectures where transversal universality is impossible due to Eastin–Knill. By structurally characterizing which nonstabilizer resource states are truly useful for information-hiding teleportation and how to implement Pauli-only feedforward, this work refines resource theories of magic and informs algorithmic fault-tolerance and distillation protocol design.", "highlights": [ "Show MGT protocols encode inputs into heralded stabilizer codes plus logical non-Clifford gates", "Construct MGT circuits for commuting Pauli-rotation resource states with efficient synthesis", "Prove useful MGT resources are Clifford-equivalent to diagonal states and simplify feedforward to Pauli operators" ], "keywords": [ { "label": "Magic states", "reason": "The work classifies nonstabilizer resource states that are useful for magic gate teleportation." }, { "label": "Teleportation", "reason": "Gate teleportation protocols are the operational setting for implementing non-Clifford gates." }, { "label": "Stabilizer codes", "reason": "MGT is shown to effectively encode inputs into heralded stabilizer codes before applying logical gates." }, { "label": "Feedforward", "reason": "Conditions are derived for implementing feedforward corrections as Pauli operators, easing fault-tolerant execution." } ], "emoji": "✨", "social_summary": "Clarify which magic states truly enable information-hiding gate teleportation and how Pauli-only feedforward can simplify fault-tolerant non-Clifford gates.", "highlights_oneliner": "Structure and resources for magic gate teleportation" }, { "arxiv_id": "2607.08767", "title": "Plaquette: A hardware-aware design platform for fault-tolerant quantum computers", "authors": "Raul Conchello Vendrell, Carlos Díaz López, Ish Dhand, Kshitij Kapoor, Davide Laureti, Marcello Massaro, Pranjal Nayak, Ivan Ogloblin, Martin B. Plenio, Shreya Prasanna Kumar, Matteo Santandrea, Varun Seshadri, Antal Száva, Trevor Vincent, Raphael Weber", "arxiv_url": "https://arxiv.org/abs/2607.08767", "pdf_url": "https://arxiv.org/pdf/2607.08767.pdf", "summary": "Plaquette is a theoretical framework and software suite that computes logical performance of fault-tolerant architectures directly from realistic hardware error models specified as Kraus operators, open-system dynamics, or reconstructed channels. It automatically compiles these models into representations tailored to four sampler classes: stabilizer sampling for Pauli noise, a new XPauli sampler for leakage and environment sectors, near-Clifford samplers for coherent errors, and full-state simulation for reference, with XPauli and near-Clifford validated against exact simulations and shown to outperform Pauli twirling for various platforms. Using case studies of superconducting leakage, neutral-atom intermediate-state scattering, and trapped-ion heating, the authors show that discrepancy with Clifford-only simulations depends strongly on platform and process, motivating use of the most accurate available sampler for thresholds, error budgets, and overhead estimates.", "motivation": "Scalable stabilizer-based simulators typically assume stochastic Pauli noise, which can misrepresent leakage, coherent, and non-Markovian errors present in real devices. By bridging microscopic open-system physics to logical performance with hardware-aware sampling, this work provides a crucial tool for designing and evaluating fault-tolerant architectures under realistic noise, guiding experimental priorities and resource estimates.", "highlights": [ "Introduce Plaquette framework mapping physical error channels to logical FTQC performance", "Develop XPauli and near-Clifford samplers for leakage and coherent errors", "Demonstrate platform-dependent discrepancies between Pauli-twirled and hardware-aware simulations" ], "keywords": [ { "label": "Leakage", "reason": "XPauli sampling specifically targets leakage and environment-sector dynamics in hardware models." }, { "label": "Neutral atoms", "reason": "One case study analyzes intermediate-state scattering noise in neutral-atom architectures." }, { "label": "Trapped ions", "reason": "Heating in trapped-ion platforms is simulated to assess logical performance under realistic errors." }, { "label": "Samplers", "reason": "Multiple sampler classes connect error channels to logical metrics, including stabilizer, XPauli, near-Clifford, and full-state." } ], "emoji": "🧪", "social_summary": "Connect microscopic hardware noise to logical performance with Plaquette’s hardware-aware samplers for leakage, coherent errors, and realistic fault-tolerant threshold estimates.", "highlights_oneliner": "Hardware-aware simulation platform for realistic FTQC performance" }, { "arxiv_id": "2607.07833", "title": "Improved GKP magic states from error-corrected non-Gaussian quantum states", "authors": "Sharon David, Jack Davis, Ulysse Chabaud, Francesco Arzani", "arxiv_url": "https://arxiv.org/abs/2607.07833", "pdf_url": "https://arxiv.org/pdf/2607.07833.pdf", "summary": "This work extends the Gottesman–Kitaev–Preskill framework for bosonic magic state generation by showing that error correction of simple non-Gaussian input states, such as superpositions of coherent or Fock states, can significantly improve the quality of encoded GKP magic states compared to Gaussian inputs like vacuum. The authors demonstrate that many such non-Gaussian preparations reduce overall resource costs for complete magic state distillation by about a factor of $3$ and analyze why the best states avoid projection near stabilizer states during error correction, contrary to previous symmetry-based conjectures. They identify spectral features of the error-corrected states that correlate with distillation performance, providing guidance for designing bosonic encodings and resource states for continuous-variable fault-tolerant computation.", "motivation": "GKP codes enable bosonic quantum error correction and magic state distillation, but prior schemes focused on Gaussian inputs and symmetry arguments to assess resource-state suitability. By systematically leveraging non-Gaussian bosonic states to produce higher-quality encoded magic and revising the understanding of what makes inputs useful, this work helps reduce overheads for CV-based fault-tolerant architectures and broadens the design space for bosonic resource engineering.", "highlights": [ "Show non-Gaussian bosonic inputs yield higher-quality encoded GKP magic states", "Reduce magic state distillation resources by about factor $3$ in some cases", "Identify that avoiding projections near stabilizer states, not just symmetry, governs input suitability" ], "keywords": [ { "label": "GKP", "reason": "Gottesman–Kitaev–Preskill bosonic codes provide the encoded magic-state framework studied." }, { "label": "Bosonic", "reason": "Continuous-variable bosonic modes are the physical substrate for the error-corrected resource states." }, { "label": "Magic states", "reason": "Encoded magic states are improved via non-Gaussian inputs to lower distillation overheads." }, { "label": "Non-Gaussian", "reason": "Superpositions of coherent and Fock states introduce non-Gaussianity that enhances magic-state quality." } ], "emoji": "🐱", "social_summary": "Show that error-corrected non-Gaussian bosonic states can yield significantly better GKP magic, cutting distillation overhead by about a factor of three.", "highlights_oneliner": "Non-Gaussian bosonic inputs boost GKP magic" }, { "arxiv_id": "2607.07808", "title": "Non-Local Magic from the Entanglement Spectrum", "authors": "Gianpaolo Torre, Fabio Franchini, Salvatore Marco Giampaolo", "arxiv_url": "https://arxiv.org/abs/2607.07808", "pdf_url": "https://arxiv.org/pdf/2607.07808.pdf", "summary": "The paper derives a representation of non-local magic, a measure of genuinely non-local non-stabilizer correlations, in terms of Walsh–Hadamard autocorrelations of the entanglement spectrum, making its harmonic structure explicit. Using this formulation, the authors prove that non-local magic is upper-bounded by an entanglement entropy and obtain exact analytical results for broad classes of quantum states, including volume-law states and ground states of one-dimensional gapped and critical systems. Their analysis shows that the spectral organization of the entanglement spectrum is the key ingredient controlling non-local magic, enabling systematic investigation of its scaling behavior and resource content.", "motivation": "Non-local magic has emerged as a refined resource measure beyond local nonstabilizerness, but its direct computation is numerically intractable for large systems and poorly understood analytically. By re-expressing it through entanglement-spectrum autocorrelations and tying its magnitude to entanglement structure, this work advances analytical resource theory for many-body states and clarifies how entanglement patterns govern non-classical computational power.", "highlights": [ "Express non-local magic via Walsh–Hadamard autocorrelations of the entanglement spectrum", "Prove an entanglement-entropy upper bound on non-local magic", "Derive exact scaling results for volume-law, gapped, and critical one-dimensional states" ], "keywords": [ { "label": "Magic", "reason": "Non-local magic quantifies non-stabilizer correlations relevant to computational resources." }, { "label": "Spectrum", "reason": "The entanglement spectrum’s harmonic organization underpins the derived representation of non-local magic." }, { "label": "Autocorrelations", "reason": "Walsh–Hadamard autocorrelations capture the harmonic content of the spectrum linked to magic." }, { "label": "Criticality", "reason": "Ground states of critical one-dimensional systems are analyzed for their non-local magic scaling." } ], "emoji": "🔗", "social_summary": "Relate non-local magic to entanglement-spectrum autocorrelations, yielding analytic bounds and scaling laws for many-body resourcefulness.", "highlights_oneliner": "Link non-local magic to entanglement-spectrum harmonics" }, { "arxiv_id": "2607.08684", "title": "Entanglement Wedge Reconstruction without Holographic Quantum Error Correction", "authors": "Seiji Terashima", "arxiv_url": "https://arxiv.org/abs/2607.08684", "pdf_url": "https://arxiv.org/pdf/2607.08684.pdf", "summary": "This paper argues that entanglement wedge reconstruction in AdS/CFT should be distinguished from stronger holographic quantum error correction (HQEC) claims and shows via locality arguments that region-independent logical bulk operators with multiple code-preserving boundary representatives must commute with complementary-region algebras, as in HaPPY-type tensor codes. The author contends that ordinary finite-$N$ holographic CFTs lack such invisible protected sectors for supergravity fields, since low-energy local observables like smeared stress tensors can detect the support and gravitational dressing of bulk operators up to center or superselection data, making HQEC inappropriate in this context. Instead, entanglement wedge reconstruction is interpreted as subregion complementarity, where each boundary region has its own code-preserving low-energy algebra and region-adapted bulk interpretation rather than shared logical operators.", "motivation": "HQEC-inspired tensor-network models have popularized the view that AdS/CFT implements quantum error correcting codes with redundant bulk encodings, but the extent to which this applies to finite-$N$ CFTs has been debated. By separating entanglement wedge reconstruction from full HQEC and emphasizing subregion-specific bulk descriptions, this work refines conceptual foundations of holography and clarifies the limits of QEC analogies in gravitational dualities.", "highlights": [ "Show locality constraints required for region-independent logical operators with multiple boundary reconstructions", "Argue finite-$N$ holographic CFTs lack invisible protected sectors for supergravity bulk fields", "Reinterpret entanglement wedge reconstruction as subregion complementarity without HQEC" ], "keywords": [ { "label": "AdS", "reason": "Anti-de Sitter holography provides the spacetime setting for entanglement wedge reconstruction." }, { "label": "HQEC", "reason": "Holographic quantum error correction is critically examined and distinguished from subregion reconstruction." }, { "label": "Stress tensor", "reason": "Smeared stress tensors are key observables that detect bulk support and dressing in finite-$N$ CFTs." }, { "label": "Complementarity", "reason": "Subregion complementarity replaces shared logical-operator narratives in the proposed interpretation." } ], "emoji": "🌀", "social_summary": "Reframe entanglement wedge reconstruction as subregion complementarity, showing why full holographic quantum error correction fails in finite N CFTs.", "highlights_oneliner": "Separate holographic QEC from entanglement wedge reconstruction" }, { "arxiv_id": "2607.08386", "title": "Parallel QEC Decoding Applied to Distributed Quantum Computing", "authors": "Gabriele Incardona, Davide Ferrari, Michele Amoretti", "arxiv_url": "https://arxiv.org/abs/2607.08386", "pdf_url": "https://arxiv.org/pdf/2607.08386.pdf", "summary": "The authors propose a novel parallel quantum error correction decoding approach that combines belief propagation with ordered statistics decoding, enhancing performance over standard BP. Their main idea is to preprocess error vectors from belief propagation by applying singular value decomposition locally to subregions of the lattice, allowing more efficient identification of likely error patterns. They apply this decoder to distributed quantum computing architectures and evaluate its complexity, accuracy, and scalability, showing benefits for large-scale systems.", "motivation": "Efficient decoders are crucial for fault-tolerant and distributed quantum computing, where latency and scalability constraints demand parallelizable algorithms beyond minimum-weight matching. By incorporating local SVD preprocessing into BP-based ordered statistics decoding, this work explores a path to more powerful yet scalable decoders suited to distributed architectures and constrained communication topologies.", "highlights": [ "Combine belief propagation with ordered statistics decoding in a parallel framework", "Use local SVD preprocessing of BP error vectors over lattice subregions", "Evaluate complexity, accuracy, and scalability for distributed quantum computing architectures" ], "keywords": [ { "label": "Decoders", "reason": "Belief propagation and ordered statistics decoding form the core QEC decoding strategy." }, { "label": "SVD", "reason": "Singular value decomposition is applied locally to preprocess error information and enhance decoding." }, { "label": "Distributed", "reason": "The decoder is tailored and evaluated for distributed quantum computing environments." }, { "label": "Belief", "reason": "Belief propagation provides probabilistic error estimates that seed the ordered statistics procedure." } ], "emoji": "📘", "social_summary": "Develop a parallel decoder that blends belief propagation, ordered statistics, and local SVD to improve QEC performance in distributed quantum architectures.", "highlights_oneliner": "Parallel BP-OSD decoder with local SVD" }, { "arxiv_id": "2607.08363", "title": "Stroboscopic Stabilization of Cat Qubits", "authors": "Timo Hillmann, Franco Nori, Fernando Quijandría", "arxiv_url": "https://arxiv.org/abs/2607.08363", "pdf_url": "https://arxiv.org/pdf/2607.08363.pdf", "summary": "This paper proposes a stroboscopic stabilization protocol for dissipatively stabilized cat qubits based on repeated interactions with an auxiliary two-level system mediated by a quadratic Hamiltonian, avoiding engineered two-photon dissipation and reservoir engineering. The approach preserves the intrinsic noise bias of cat qubits, extends naturally to squeezed cat encodings inspired by a lattice viewpoint akin to GKP qubits, and renders single-photon loss errors partially correctable. The authors perform a comprehensive characterization including oscillator and auxiliary-qubit decoherence, compare against previous phase-flip-protection schemes, and discuss concatenation with surface and quantum LDPC codes.", "motivation": "Cat qubits offer exponentially suppressed bit-flip errors with biased noise, but existing stabilization relies on platform-specific two-photon dissipation and suffers from spurious channels. By introducing a more broadly compatible, interaction-based stabilization protocol that exploits squeezed-cat lattice symmetries and addresses realistic decoherence, this work advances practical bosonic encodings and their integration into multi-layer fault-tolerant architectures.", "highlights": [ "Introduce stroboscopic cat-qubit stabilization via auxiliary two-level system and quadratic coupling", "Preserve noise bias and partially correct single-photon loss for squeezed cat qubits", "Characterize full decoherence and compare favorably to prior phase-flip-focused schemes" ], "keywords": [ { "label": "Cat qubits", "reason": "The work focuses on dissipative stabilization of cat-code logical qubits with biased noise." }, { "label": "Squeezing", "reason": "Squeezed cat encodings and their lattice symmetry are central to the protocol design." }, { "label": "Ancilla", "reason": "An auxiliary two-level system mediates repeated interactions that stabilize the oscillator." }, { "label": "Surface", "reason": "Concatenation with surface and LDPC codes is discussed as a path to full fault tolerance." } ], "emoji": "🐈", "social_summary": "Propose a stroboscopic, ancilla-mediated scheme to stabilize squeezed cat qubits, preserving noise bias and partially correcting single-photon loss without engineered reservoirs.", "highlights_oneliner": "Ancilla-driven stroboscopic stabilization of squeezed cat qubits" }, { "arxiv_id": "2607.07822", "title": "Routing Techniques for Error Corrected Silicon Spin Qubit Quantum Architectures", "authors": "Julian Shen, Ludwig Schmid, Robert Wille", "arxiv_url": "https://arxiv.org/abs/2607.07822", "pdf_url": "https://arxiv.org/pdf/2607.07822.pdf", "summary": "The authors present a compilation framework for silicon spin qubit architectures based on the snakes on a plane model, which uses a $2$D surface code and qubit teleportation (snake surgery) to mitigate errors. Within this framework they formulate qubit shuttling as a constrained routing problem on a graph and propose two routing classes: shortest-path algorithms that construct explicit collision-free paths and rotation-based algorithms that resolve congestion via cyclic rotations, along with defect-handling and initial-mapping strategies. Benchmarking across architectural settings shows that shortest-path methods excel in sparse, low-defect regimes while rotation-based routing performs better in dense, high-defect environments, providing one of the first high-level compilation tools for error-corrected spin-qubit processors.", "motivation": "Silicon spin qubits promise excellent scaling, but most compilation techniques target NISQ-era physical circuits and neglect logical, error-corrected routing challenges. By building on snakes on a plane surface-code architectures and explicitly addressing routing under defects and shuttling constraints, this work helps bridge the gap between physical spin-qubit layouts and high-level logical algorithm deployment.", "highlights": [ "Model spin-qubit shuttling in snakes-on-a-plane surface-code architectures as constrained routing", "Design shortest-path and rotation-based routing algorithms with defect-handling and mapping strategies", "Show complementary performance of path versus rotation methods across defect densities and connectivity" ], "keywords": [ { "label": "Spin qubits", "reason": "Silicon spin qubits are the target hardware for the routing and compilation framework." }, { "label": "Routing", "reason": "Qubit movement is cast as a constrained routing problem with path and rotation strategies." }, { "label": "Surface", "reason": "A $2$D surface code underlies the snakes-on-a-plane architecture and teleportation-based error correction." }, { "label": "Teleportation", "reason": "Snake surgery uses teleportation to mitigate errors during routing in the architecture." } ], "emoji": "🧭", "social_summary": "Introduce routing algorithms for error-corrected silicon spin qubit architectures using snakes-on-a-plane surface codes and qubit teleportation.", "highlights_oneliner": "Routing spin qubits in snakes-on-a-plane surface-code architectures" }, { "arxiv_id": "2607.08626", "title": "A Nonstabilizerness Resource Law for Universal Quantum State Purification", "authors": "Keming He, Enji Xiong, Xin Wang", "arxiv_url": "https://arxiv.org/abs/2607.08626", "pdf_url": "https://arxiv.org/pdf/2607.08626.pdf", "summary": "This work develops a quantitative resource theory of magic for universal quantum state purification, where higher-fidelity states are distilled from multiple noisy copies, and shows that classically simulable operations cannot achieve nontrivial universal fidelity gain. For two-copy purification in odd dimensions, the authors prove an exact linear mana law relating required magic to target fidelity and success probability, and for multi-qubit systems they establish a two-sided linear robustness law that becomes exact for a single qubit. They also construct an explicit successful purification map that makes the magic–fidelity tradeoff transparent, connecting magic resources to error mitigation and fault-tolerant information processing.", "motivation": "Magic resources are known to enable universal fault-tolerant computation, but their quantitative role in state purification and error mitigation has been unclear, especially given no-go theorems for classically simulable dynamics. By deriving exact and approximate linear resource laws for mana and robustness in purification tasks, this work links nonstabilizerness directly to achievable fidelity improvements, informing the design and costing of magic-powered mitigation protocols.", "highlights": [ "Show classically simulable operations cannot provide nontrivial universal purification fidelity gain", "Prove an exact linear mana law for two-copy purification in odd dimensions", "Establish a two-sided linear robustness law for multi-qubit systems and construct an explicit optimal purification map" ], "keywords": [ { "label": "Mana", "reason": "An exact linear mana law quantifies the magic cost of universal purification in odd dimensions." }, { "label": "Robustness", "reason": "A two-sided linear robustness law relates nonstabilizerness to multi-qubit purification performance." }, { "label": "Purification", "reason": "Universal state purification serves as the operational task linking magic to fidelity gain." }, { "label": "Magic", "reason": "Nonstabilizerness resources are central to exceeding classical simulability in purification protocols." } ], "emoji": "🧊", "social_summary": "Quantify how much magic is needed for universal state purification by proving linear mana and robustness laws that link nonstabilizerness to achievable fidelity gains.", "highlights_oneliner": "Linear magic laws for universal purification" }, { "arxiv_id": "2607.08687", "title": "Low-latency FPGA-based electronic control system for fast preparation of defect-free atom arrays", "authors": "Ya-Dong Hu, Dong-Qi Ma, Tian-Yang Zhang, Liang Chen, Yi-Chen Zhang, Xiao-Kang Zhong, Wen-Yi Zhu, Hong-Jie Fan, Qing-Xuan Jie, Yan-Lei Zhang, Gang Li, Xi-Feng Ren, Xu-Liang Zhang, Guang-Can Guo, Zhu-Bo Wang, Chang-Ling Zou", "arxiv_url": "https://arxiv.org/abs/2607.08687", "pdf_url": "https://arxiv.org/pdf/2607.08687.pdf", "summary": "The authors present an FPGA-based electronic control system (PXIe-QC100) for neutral atom quantum computing that integrates photon counting, real-time decision-making, and waveform generation within a PXIe architecture, eliminating the PC from feedback loops and achieving total feedback latency of $282\\,\\mathrm{\\mu s}$. They experimentally validate the system by assembling defect-free atom arrays from $24$ stochastically loaded tweezers, reaching $\\~96\\%$ filling in a single rearrangement and boosting the success probability of generating a $10$-atom defect-free array from $65.7\\%$ to $95.4\\%$ through five feedback-controlled rounds. The design establishes necessary electronic infrastructure for mid-circuit measurement and real-time quantum error correction on neutral-atom platforms and projects further latency reductions to below $35\\,\\mathrm{\\mu s}$ for $64$ atoms with architectural refinements.", "motivation": "Neutral atom arrays have achieved gate fidelities and scales surpassing QEC thresholds, but lack dedicated, low-latency control hardware for real-time feedback, forcing post-processed error correction. By implementing a modular FPGA-based system that tightly couples detection, decision, and actuation at sub-millisecond latency, this work removes a key bottleneck toward practical mid-circuit measurement, active QEC, and scalable defect-free array preparation in neutral-atom processors.", "highlights": [ "Implement a PXIe FPGA-based control system with $282\\,\\mathrm{\\mu s}$ total feedback latency", "Demonstrate defect-free rearrangement of atom arrays with $\\~96\\%$ single-round filling and $95.4\\%$ ten-atom success after five rounds", "Project latency below $35\\,\\mathrm{\\mu s}$ for $64$ atoms via architectural refinements enabling real-time QEC" ], "keywords": [ { "label": "FPGA", "reason": "Field-programmable gate arrays provide low-latency, integrated control for detection and waveform generation." }, { "label": "Neutral atoms", "reason": "The system targets neutral-atom arrays as a scalable quantum computing platform surpassing QEC thresholds." }, { "label": "Feedback", "reason": "Real-time feedback loops assemble defect-free arrays and underpin mid-circuit measurement and QEC." }, { "label": "Tweezers", "reason": "Optical tweezers host stochastically loaded atoms whose positions are rearranged by the control system." } ], "emoji": "🎛️", "social_summary": "Build an FPGA-based control system that cuts neutral-atom feedback latency to microseconds, enabling fast defect-free arrays and real-time QEC capability.", "highlights_oneliner": "Microsecond-latency FPGA control for defect-free neutral-atom arrays" } ] }, "2026-07-09": { "word_cloud": [ { "word": "Bosonic", "weight": 5 }, { "word": "Analog", "weight": 4 }, { "word": "Covariant", "weight": 4 }, { "word": "Grid", "weight": 5 }, { "word": "Mitigation", "weight": 4 }, { "word": "Hierarchy", "weight": 3 }, { "word": "Holography", "weight": 5 }, { "word": "Geometries", "weight": 3 }, { "word": "Fractal", "weight": 3 }, { "word": "Hamiltonian", "weight": 3 }, { "word": "Entanglement", "weight": 4 }, { "word": "Overheads", "weight": 2 }, { "word": "Symmetry", "weight": 4 }, { "word": "Decoder", "weight": 3 }, { "word": "Noise", "weight": 5 } ], "social_highlights": "Highlights: Construct non-Abelian covariant analog codes, push grid-state SPAM errors below $10^{-3}$, extend BBGKY mitigation to arbitrary circuits, and analyze uberholography in pure-state geometries.", "papers": [ { "arxiv_id": "2607.07607", "title": "Covariant Approximate Quantum Codes for Protected Analog Computation", "authors": "Mariia Elovenkova, Hong-Ye Hu, Susanne F. Yelin", "arxiv_url": "https://arxiv.org/abs/2607.07607", "pdf_url": "https://arxiv.org/pdf/2607.07607.pdf", "summary": "The paper constructs explicit $SU(d)$-covariant approximate quantum error-correcting codes that exploit permutation symmetry to distribute logical information uniformly over $N$ subsystems, achieving worst-case purified distance scaling as $\\Theta(1/N)$ for one-, two-, and three-qudit erasures at known locations. It extends reduced-state analysis to general flagged local noise and provides a near-optimal Petz-map decoder for single-qudit erasure, then uses these codes as building blocks for symmetry-preserving encoded analog Hamiltonian dynamics with block-structured dynamical Lie algebras and controlled symmetry breaking for universality.", "motivation": "Continuous-symmetry-compatible quantum error correction is blocked in the exact setting by Eastin–Knill, yet is crucial for robust analog quantum simulation and continuous-time computation. This work advances approximate covariant codes that respect non-Abelian symmetries while enabling protection of analog dynamics, bridging a gap between digital fault tolerance and symmetry-preserving analog architectures.", "highlights": [ "Explicit $SU(d)$-covariant approximate codes with purified distance scaling $\\Theta(1/N)$ under qudit erasures", "Reduced-state framework for flagged local noise and conjectured optimal scaling for general $k$-qudit erasure", "Symmetry-preserving encoded analog dynamics via block-structured dynamical Lie algebras and controlled symmetry breaking" ], "keywords": [ { "label": "Covariant Codes", "reason": "The main contribution is constructing non-Abelian $SU(d)$-covariant approximate quantum codes compatible with continuous symmetries." }, { "label": "Permutation", "reason": "Permutation symmetry of physical subsystems is exploited to uniformly spread logical information and control reduced states." }, { "label": "Petz Decoder", "reason": "An explicit near-optimal decoder based on the Petz recovery map is derived for single-qudit erasure." }, { "label": "Analog", "reason": "The codes are used to engineer protected analog Hamiltonian dynamics and dynamical Lie algebras for universal analog computation." } ], "emoji": "⚙️", "social_summary": "Develop explicit $SU(d)$-covariant approximate codes and analog dynamics to protect symmetry-preserving quantum simulations against local erasures and noise.", "highlights_oneliner": "Non-Abelian covariant analog AQECCs" }, { "arxiv_id": "2607.06718", "title": "Quantum error correction of a grid-state qubit with state preparation and measurement errors below $10^{-3}$", "authors": "Sara Turcotte, Lucas St-Jean, Amélie L. Pessonneaux, Ross Shillito, Bohdan Kulchytskyy, Eliott Ouellet, Jean Olivier Simoneau, Florian Hopfmueller, Matthew Hamer, Pascal Lemieux, Dany Lachance-Quirion, Baptiste Royer, Nicholas E. Frattini", "arxiv_url": "https://arxiv.org/abs/2607.06718", "pdf_url": "https://arxiv.org/pdf/2607.06718.pdf", "summary": "This work demonstrates repeat-until-success preparation of cardinal and magic states of a single-mode grid-state (GKP) qubit in a superconducting architecture, leveraging high-performance quantum error correction in a bosonic oscillator coupled to an auxiliary qubit. Together with an improved measurement protocol that corrects finite-energy envelope effects and auxiliary qubit readout errors while enhancing robustness to photon loss, the experiments achieve combined state-preparation-and-measurement errors below $10^{-3}$, a two-orders-of-magnitude improvement over previous grid-state implementations.", "motivation": "Bosonic grid codes are a leading candidate for hardware-efficient fault-tolerant quantum computing, but their progress has been bottlenecked by large state-preparation-and-measurement ($\\text{SPAM}$) errors. Achieving transmon-level $\\text{SPAM}$ performance for GKP qubits is historically significant because it removes a major practical barrier to deploying bosonic QEC in scalable superconducting processors.", "highlights": [ "Repeat-until-success preparation of both cardinal and magic grid states in a single-mode GKP qubit", "Improved measurement protocol correcting finite-energy envelope and auxiliary qubit readout errors while enhancing photon-loss robustness", "Combined state-preparation-and-measurement error below $10^{-3}$, a two-order-of-magnitude improvement over prior grid-state qubits" ], "keywords": [ { "label": "Grid States", "reason": "The paper focuses on Gottesman–Kitaev–Preskill grid-state qubits encoded in oscillator Hilbert spaces." }, { "label": "SPAM", "reason": "A central achievement is reducing state preparation and measurement errors to below $10^{-3}$, comparable to transmon qubits." }, { "label": "Superconducting", "reason": "Experiments are performed in a superconducting circuit QED platform combining high-coherence oscillators with an auxiliary qubit." }, { "label": "Photon", "reason": "The measurement protocol increases robustness to single-photon loss, the dominant error channel for the bosonic mode." } ], "emoji": "📐", "social_summary": "Push grid-state qubit experiments to transmon-level SPAM performance by combining repeat-until-success GKP state preparation with robust measurement below $10^{-3}$ error.", "highlights_oneliner": "Ultra-low-SPAM GKP grid qubit" }, { "arxiv_id": "2607.06752", "title": "Feynman's clock and hierarchy-informed sampling for quantum error mitigation", "authors": "Theo Saporiti", "arxiv_url": "https://arxiv.org/abs/2607.06752", "pdf_url": "https://arxiv.org/pdf/2607.06752.pdf", "summary": "The letter extends the BBGKY Informed Sampling Mitigation (BBGKY-ISM) scheme from noisy spin-chain simulations to arbitrary quantum circuits by mapping circuit executions to Feynman's clock Hamiltonian dynamics of a corresponding quantum system. It shows that the classical and quantum overheads for reconstructing the system's time evolution via Hadamard tests on partial circuit executions scale polynomially in the circuit size, number of qubits, and number of time steps, and numerically demonstrates systematic, controllable error reduction on tunable Bell-state preparation circuits under state-of-the-art noise.", "motivation": "Near-term NISQ devices cannot support full-blown quantum error correction, making efficient mitigation techniques essential for practical quantum algorithms. Generalizing BBGKY-based hierarchy-informed sampling to arbitrary circuits and proving polynomial overhead provides historically relevant progress toward scalable, circuit-level error mitigation that remains useful even in early fault-tolerant regimes.", "highlights": [ "Mapping arbitrary circuits to Feynman clock Hamiltonians enabling BBGKY-ISM on circuit executions", "Polynomial classical and quantum overheads in $N_{\\text{Q}}$, $N_{\\text{G}}$ and $N_{\\text{T}}$ for time-series reconstruction via Hadamard tests", "Systematic and controllable error reduction demonstrated on tunable Bell-state preparation under realistic quantum noise" ], "keywords": [ { "label": "Mitigation", "reason": "The core goal is quantum error mitigation via the BBGKY-ISM scheme rather than full error correction." }, { "label": "BBGKY", "reason": "A BBGKY-like hierarchy of equations informs the sampling and constraining of the reconstructed dynamics." }, { "label": "Feynman Clock", "reason": "Feynman’s clock Hamiltonian is used to map circuit execution to quantum system dynamics amenable to BBGKY analysis." }, { "label": "Bell States", "reason": "Numerical tests focus on tunable Bell-state preparation circuits to benchmark the mitigation performance." } ], "emoji": "🧪", "social_summary": "Extend BBGKY hierarchy-informed sampling to arbitrary circuits using Feynman’s clock, delivering polynomial-overhead quantum error mitigation with tunable strength.", "highlights_oneliner": "BBGKY-ISM mitigation for circuits" }, { "arxiv_id": "2607.06870", "title": "Phase transitions and uberholography of holographic pure-state geometries", "authors": "Ning Bao, Keiichiro Furuya, Jacob March", "arxiv_url": "https://arxiv.org/abs/2607.06870", "pdf_url": "https://arxiv.org/pdf/2607.06870.pdf", "summary": "The paper analyzes error-correcting properties of pure-state holographic geometries obtained via the surface/state correspondence, replacing mixed boundary subregions by Ryu–Takayanagi (RT) geodesic boundaries of their entanglement wedges. In $\\text{AdS}_3/\\text{CFT}_2$ it derives a cross-ratio threshold relation $\\eta'/\\eta = e^{\\Delta H/2}$ governing connected/disconnected entanglement-wedge transitions when punching two holes, shows that recursive hole-punching underlying uberholography cannot begin within an RT boundary while an untouched asymptotic boundary can still fractalize with fractal dimension $\\alpha \\approx 0.786$, and compares procedure-dependent upper bounds on holographic code price and distance.", "motivation": "Holographic duality realizes bulk gravity as a quantum error-correcting code, and understanding code parameters in more general pure-state geometries refines this dictionary. Studying phase transitions in entanglement wedges and uberholographic fractalization with RT boundaries advances the historical effort to quantify holographic code price, distance, and reconstruction in complex geometries.", "highlights": [ "Derivation of a modified cross-ratio threshold $\\eta'/\\eta = e^{\\Delta H/2}$ for entanglement-wedge connectivity with RT boundaries", "Demonstration that uberholographic recursive hole-punching cannot originate inside RT boundaries while asymptotic boundaries still fractalize with $\\alpha \\approx 0.786$", "Procedure-dependent upper bounds on holographic code price and distance comparing RT-retaining versus RT-tracing strategies" ], "keywords": [ { "label": "Uberholography", "reason": "The work explores fractal support of bulk operators and uberholographic behavior with fractal dimension $\\alpha \\approx 0.786$." }, { "label": "RT Surfaces", "reason": "Ryu–Takayanagi geodesic boundaries replace mixed regions via the surface/state correspondence and source $\\Delta H$ in the threshold relation." }, { "label": "Entanglement", "reason": "Entanglement-wedge reconstruction and connected/disconnected phase transitions are central to the error-correcting analysis." }, { "label": "Price", "reason": "The paper studies holographic code price and distance bounds for bulk subregions in pure-state geometries." } ], "emoji": "🌀", "social_summary": "Probe phase transitions and uberholography in pure-state holographic geometries, revealing modified entanglement thresholds and fractal code support with RT boundaries.", "highlights_oneliner": "Uberholography in pure-state holography" } ] }, "2026-07-08": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "Bosonic", "weight": 5 }, { "word": "LDPC", "weight": 5 }, { "word": "Toric", "weight": 4 }, { "word": "Lattice", "weight": 4 }, { "word": "Routing", "weight": 4 }, { "word": "Decoders", "weight": 5 }, { "word": "Syndrome", "weight": 4 }, { "word": "Entanglement", "weight": 4 }, { "word": "Cat", "weight": 3 }, { "word": "GKP", "weight": 5 }, { "word": "Wigner", "weight": 3 }, { "word": "Neural", "weight": 4 }, { "word": "Bicycle", "weight": 4 }, { "word": "QCNN", "weight": 3 } ], "social_highlights": "Highlights: Color-code lattice surgery with pipe diagrams, strictly local tile-code architectures, finite-resource bosonic codes, multi-layer qLDPC routing, multipartite toric entanglement, adaptive neural decoding, Wigner learning, and BB-protected QCNNs.", "papers": [ { "arxiv_id": "2607.05501", "title": "Towards Lattice Surgery Compilation for the Color Code Using Pipe Diagrams", "authors": "Laura S. Herzog, Gilad Kishony, Robert Wille, Austin Fowler", "arxiv_url": "https://arxiv.org/abs/2607.05501", "pdf_url": "https://arxiv.org/pdf/2607.05501.pdf", "summary": "This paper extends pipe-diagram lattice-surgery compilation from the surface code to the triangular color code on the $6.6.6$ lattice, establishing a correspondence to ZX-calculus descriptions of computation. It provides distance-independent constructions of color-code pipe diagrams, explicit correlation surfaces, stabilizers, and syndrome-extraction circuits, enabling both spacetime-level optimization and microscopic compilation for color-code architectures.", "motivation": "Lattice surgery has become a standard way to implement logical gates in topological codes, but most compiler abstractions and tools target the surface code. Generalizing flexible pipe-diagram methods to color codes matters because color codes offer reduced qubit overhead and transversal Clifford gates, opening automated compilation paths for alternative fault-tolerant architectures.", "highlights": [ "Pipe-diagram representation for triangular $6.6.6$ color codes", "ZX-diagram correspondence for color-code lattice surgery", "Distance-independent constructions of syndrome-extraction circuits" ], "keywords": [ { "label": "Color Codes", "reason": "Central code family studied, using the triangular $6.6.6$ lattice for lattice-surgery compilation." }, { "label": "Pipe Diagrams", "reason": "Key intermediate representation enabling spacetime optimization of lattice-surgery protocols." }, { "label": "ZX Calculus", "reason": "Diagrammatic framework used to map computational descriptions to color-code pipe diagrams." }, { "label": "Lattice Surgery", "reason": "Fault-tolerant gate implementation paradigm that the compilation framework targets and generalizes." } ], "emoji": "🧩", "social_summary": "Develop automated pipe-diagram lattice-surgery compilation for color codes, linking ZX diagrams to compact spacetime-optimized syndrome circuits.", "highlights_oneliner": "Pipe diagrams for color-code lattice surgery" }, { "arxiv_id": "2607.05897", "title": "Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices", "authors": "Yoonjin Bae, Chae-Yeun Park", "arxiv_url": "https://arxiv.org/abs/2607.05897", "pdf_url": "https://arxiv.org/pdf/2607.05897.pdf", "summary": "This work designs SWAP-based routing schemes that implement syndrome extraction for four planar tile-code families using only nearest-neighbor interactions on a 2D square lattice. Using routed circuits decoded with BP+OSD under the SI1000 noise model, it quantifies the threshold reduction from connectivity constraints and shows that routed tile codes become more qubit-efficient than the surface code below a crossover physical error rate $p^{*}\\approx0.08\\%$.", "motivation": "Surface-code architectures offer high thresholds but poor encoding efficiency, motivating search for alternatives with lower qubit overhead yet similar locality. Tile codes are promising qLDPC candidates, so characterizing their thresholds, routing overhead, and resource footprint under strictly local hardware constraints is key for practical fault-tolerant architectures.", "highlights": [ "Exhaustive SWAP routing for tile-code syndrome extraction on 2D lattices", "BP+OSD threshold estimates under SI1000 with and without routing", "Resource-footprint crossover where tile codes beat surface codes" ], "keywords": [ { "label": "Tile Codes", "reason": "Main qLDPC family analyzed for strictly local planar architectures and resource efficiency." }, { "label": "Routing", "reason": "SWAP-based nearest-neighbor routing schemes enabling syndrome extraction on square lattices." }, { "label": "Thresholds", "reason": "Circuit-level error thresholds quantified under SI1000 noise with connectivity constraints." }, { "label": "Surface Code", "reason": "Baseline architecture used to compare qubit efficiency and crossover behavior of tile codes." } ], "emoji": "📐", "social_summary": "Quantify how strictly local tile-code architectures can outperform surface codes in qubit efficiency despite routing-induced threshold penalties.", "highlights_oneliner": "Strictly local routed tile-code architectures" }, { "arxiv_id": "2607.06404", "title": "Bosonic quantum error-correcting codes with finite stellar rank", "authors": "Rui Wang, Adithi Udupa, Timo Hillmann, Ulysse Chabaud, Alessandro Ferraro, Giulia Ferrini", "arxiv_url": "https://arxiv.org/abs/2607.06404", "pdf_url": "https://arxiv.org/pdf/2607.06404.pdf", "summary": "The paper introduces stellar rank as a resource measure to design and benchmark bosonic codes under finite non-Gaussian resources, focusing on cat and Gottesman–Kitaev–Preskill (GKP) encodings. It reveals trade-offs between state approximability, energy, and logical protection under photon loss and dephasing, and directly optimizes encodings at fixed stellar rank, finding noise-adapted grid-like and rotation-symmetric structures and rank thresholds for surpassing break-even.", "motivation": "Bosonic codes promise hardware-efficient error correction but rely on costly non-Gaussian resources whose practical limits shape code performance. Establishing an operational resource measure like stellar rank clarifies how preparation constraints impact cat and GKP codes and guides the design of noise-adapted bosonic encodings under realistic hardware capabilities.", "highlights": [ "Define stellar rank as a finite non-Gaussian resource measure", "Characterize energy–protection trade-offs for cat and GKP under loss and dephasing", "Optimize bosonic encodings at fixed stellar rank to surpass break-even" ], "keywords": [ { "label": "Stellar Rank", "reason": "Central resource metric quantifying non-Gaussianity used to constrain and optimize bosonic codes." }, { "label": "Bosonic Codes", "reason": "Primary setting, including cat and GKP encodings, analyzed under finite-resource preparation." }, { "label": "Photon Loss", "reason": "Key noise model where grid-like optimized encodings and rank thresholds are identified." }, { "label": "Dephasing", "reason": "Noise regime where approximately rotation-symmetric encodings emerge at low stellar rank." } ], "emoji": "🌟", "social_summary": "Show how finite stellar-rank resources reshape optimal cat and GKP bosonic codes and enable noise-adapted encodings that beat break-even.", "highlights_oneliner": "Finite-resource bosonic codes via stellar rank" }, { "arxiv_id": "2607.06177", "title": "Using Tanner Spectral Reduction to Improve Multi-Layer Optical Lattice Routing for Hypergraph-Product and Bivariate Bicycle qLDPC Codes", "authors": "Joshua M. Courtney", "arxiv_url": "https://arxiv.org/abs/2607.06177", "pdf_url": "https://arxiv.org/pdf/2607.06177.pdf", "summary": "This paper characterizes the Tanner-graph spectrum of hypergraph-product/lifted-product and bivariate-bicycle codes, giving closed-form relations such as $\\beta_{\\text{HGP}}=(1+\\beta_{\\text{base}})/2$ and a diameter identity $D_{T}=2D_{\\text{base}}$. Using Fourier spectral reduction, it reduces BB Tanner spectral analysis to $lm$ independent $2\\times2$ singular-value decompositions and composes these insights into a multi-layer acousto-optic lens routing protocol that can yield $\\sim50$–$300\\times$ per-cycle wall-clock advantages over single-layer baselines.", "motivation": "qLDPC codes dramatically reduce qubit overhead, but routing data and ancilla qubits in neutral-atom and ion architectures is a major practical bottleneck. Spectral analysis of Tanner graphs and multi-layer 3D optical routing strategies matter for turning abstract qLDPC designs into hardware-efficient architectures with manageable syndrome-extraction depth.", "highlights": [ "Closed-form spectral and diameter identities for HGP/LP Tanner graphs", "Fourier reduction of BB Tanner spectrum to $2\\times2$ SVDs", "Multi-layer AOL routing with large per-cycle wall-clock speedups" ], "keywords": [ { "label": "Tanner Graphs", "reason": "Graph representation whose spectrum and diameter are analytically characterized for routing." }, { "label": "Hypergraph Product", "reason": "Important qLDPC construction whose spectral parameters inform routing depth and protocol design." }, { "label": "Bicycle Codes", "reason": "Bivariate bicycle codes receive specialized Fourier spectral reduction and routing analysis." }, { "label": "Optical Lattices", "reason": "Multi-layer acousto-optic hardware platform targeted for efficient 3D routing of qLDPC codes." } ], "emoji": "🎛️", "social_summary": "Analyze qLDPC Tanner spectra and propose multi-layer optical routing that can cut syndrome-cycle wall-clock times by up to hundreds of times.", "highlights_oneliner": "Spectral-guided multi-layer qLDPC routing" }, { "arxiv_id": "2607.06050", "title": "Genuine Multi-Entropy in the Toric Code", "authors": "Sriram Akella, Norihiro Iizuka, Akihiro Miyata", "arxiv_url": "https://arxiv.org/abs/2607.06050", "pdf_url": "https://arxiv.org/pdf/2607.06050.pdf", "summary": "The authors study genuine multi-entropy as a probe of multipartite entanglement in the toric code, analyzing four-partite partitions of stabilizer ground states, ground-state superpositions, and excited states. They conjecture that for stabilizer states with $q\\ge4$ parties and replica index $n1$. It analyzes the Hermitian hull and dual distance of generalized extended codes $\\mathcal{C}({\\bf u},a)$ in terms of the position of ${\\bf u}$ relative to $\\mathcal{C}+\\mathcal{C}^{\\perp_{\\rm H}}$ and its interaction with minimum-weight codewords of $\\mathcal{C}^{\\perp_{\\rm H}}$, yielding criteria to independently tune hull dimension and Hermitian dual distance. Applying these results via the Hermitian construction, the authors obtain $267$ new entanglement-assisted qubit codes (with $n \\leq 40$) and $14$ new qutrit codes (with $n \\leq 25$), confirming improvements for $236$ qubit and $8$ qutrit parameter sets over existing tables.", "motivation": "Entanglement-assisted quantum error-correcting codes rely on classical codes with controlled Hermitian hulls and dual distances, and improving known parameters directly impacts fault-tolerant performance. A structural theory of generalized extended codes over $\\mathbb{F}_{q^2}$ enables systematic construction of better EA qubit and qutrit codes and advances the state of the art in Grassl-like code tables.", "highlights": [ "Structural equivalence between generalized extended codes and Hermitian duals", "Criteria to control Hermitian hull dimension and Hermitian dual distance in $\\mathcal{C}({\\bf u},a)$", "Construction of hundreds of new, improved EA qubit and qutrit codes" ], "keywords": [ { "label": "Extended Codes", "reason": "Generalized extended codes over $\\mathbb{F}_{q^2}$ are the main classical objects analyzed." }, { "label": "Hermitian Hull", "reason": "Key invariant whose dimension is tuned to enable entanglement-assisted constructions." }, { "label": "EAQECCs", "reason": "Entanglement-assisted quantum codes derived from the classical extended-code framework." }, { "label": "Qutrit", "reason": "Higher-dimensional EA codes are constructed and improved alongside qubit codes." } ], "emoji": "🔗", "social_summary": "Develop a structural theory of generalized extended codes to tune Hermitian hulls, yielding hundreds of improved entanglement-assisted qubit and qutrit codes.", "highlights_oneliner": "Generalized extended codes for improved EAQECCs" }, { "arxiv_id": "2607.01364", "title": "Decohered toric code under quantum damping noise and its mapping to a classical spin model", "authors": "Nihar Ranjan Dash, Sanjoy Dutta, R. Srikanth, Subhashish Banerjee", "arxiv_url": "https://arxiv.org/abs/2607.01364", "pdf_url": "https://arxiv.org/pdf/2607.01364.pdf", "summary": "The authors study toric codes under generalized amplitude-damping (GAD) and squeezed GAD channels, including thermal and non-Markovian effects, and map the resulting decohered states to Ashkin-Teller-type classical spin models via a double Hilbert-space formalism. They also Pauli-twirl the GAD and squeezed GAD channels to obtain asymmetric depolarizing models, compute logical failure probabilities as functions of temperature and squeezing, and relate channel parameters to spin coupling constants. For the Pauli-twirled squeezed GAD channel, they show that higher temperature raises logical-$XX$ and $ZZ$ failure probabilities, while squeezing can reduce logical-$ZZ$ failures, suggesting avenues to tailor noise for improved topological protection.", "motivation": "Realistic noise in quantum devices often includes coherent damping components not captured by simple Pauli models, limiting the accuracy of threshold and decoding analyses for topological codes. Extending statistical-mechanical mappings of toric codes to generalized and squeezed amplitude-damping channels clarifies how damping parameters and squeezing affect logical performance and may inform noise engineering strategies.", "highlights": [ "Mapping toric codes under GAD and squeezed GAD to Ashkin-Teller-type spin models", "Pauli twirling to asymmetric depolarizing channels with derived logical failure probabilities", "Identification of temperature and squeezing effects on logical-$XX$ and $ZZ$ errors" ], "keywords": [ { "label": "Toric", "reason": "Canonical topological code whose damping behavior and spin-model mapping are analyzed." }, { "label": "Damping", "reason": "Generalized and squeezed amplitude-damping channels serve as the main noise models." }, { "label": "Ashkin", "reason": "Ashkin-Teller-type classical spin models represent the mapped decohered code." }, { "label": "Squeezing", "reason": "Quantum squeezing modifies GAD behavior and logical error probabilities." } ], "emoji": "🌀", "social_summary": "Map toric codes under generalized and squeezed amplitude damping to classical spin models, revealing how temperature and squeezing shape logical failure probabilities.", "highlights_oneliner": "Toric under damping mapped to spin models" }, { "arxiv_id": "2607.02444", "title": "Optimal Stabilizer Testing and Learning with Limited Quantum Memory", "authors": "Srinivasan Arunachalam, Louis Schatzki", "arxiv_url": "https://arxiv.org/abs/2607.02444", "pdf_url": "https://arxiv.org/pdf/2607.02444.pdf", "summary": "This paper analyzes stabilizer-state testing and learning when an algorithm receives sequential copies of an unknown $n$-qubit state but may store only $k$ qubits of coherent memory between measurements. It shows that under such memory constraints, the sample complexity of stabilizer testing becomes $\\Theta(n-k)$ and non-adaptive stabilizer learning requires $\\Theta(n^2/k)$ copies, establishing that the usual separation between constant-copy testing and $\\Theta(n)$ learning disappears when memory is limited. Using combinatorial techniques on the stochastic orthogonal group and likelihood-ratio bounds, the authors also prove an exponential lower bound for purity testing even when coherence can be maintained throughout the protocol, identifying coherent quantum memory as a crucial resource for efficient stabilizer testing.", "motivation": "Stabilizer states are central to fault-tolerant quantum computing, and understanding the resource requirements for testing and learning them in realistic streaming, memory-limited settings is vital. By quantifying how limited quantum memory impacts sample complexity, the work clarifies that memory is not just an implementation detail but a fundamental resource shaping the feasibility of tomography and property testing.", "highlights": [ "Derivation of $\\Theta(n-k)$ sample complexity for stabilizer testing with $k$-qubit memory", "Non-adaptive stabilizer learning shown to require $\\Theta(n^2/k)$ copies", "Exponential lower bound for purity testing under coherent-memory protocols" ], "keywords": [ { "label": "Stabilizer", "reason": "Focuses on testing and learning properties of stabilizer states in memory-limited models." }, { "label": "Memory", "reason": "Coherent quantum memory size $k$ is the key resource constraint affecting sample complexity." }, { "label": "Testing", "reason": "Property testing of stabilizer and purity is analyzed under streaming constraints." }, { "label": "Learning", "reason": "Non-adaptive learning of stabilizer states is shown to have $\\Theta(n^2/k)$ scaling." } ], "emoji": "🧠", "social_summary": "Characterize how limited coherent quantum memory destroys the usual separation between stabilizer testing and learning, with optimal $\\Theta(n-k)$ and $\\Theta(n^2/k)$ sample bounds.", "highlights_oneliner": "Memory-limited stabilizer testing and learning theory" } ] }, "2026-07-02": { "word_cloud": [ { "word": "mitigation", "weight": 4 }, { "word": "bosonic", "weight": 5 }, { "word": "cat", "weight": 5 }, { "word": "leakage", "weight": 5 }, { "word": "transmons", "weight": 4 }, { "word": "couplers", "weight": 4 }, { "word": "superconducting", "weight": 4 }, { "word": "gates", "weight": 3 }, { "word": "entanglement", "weight": 3 }, { "word": "symmetry", "weight": 3 }, { "word": "noise", "weight": 4 }, { "word": "fidelity", "weight": 3 }, { "word": "mobility", "weight": 3 }, { "word": "distributed", "weight": 3 }, { "word": "erasure", "weight": 4 } ], "social_highlights": "Highlights: symmetry-optimized error mitigation, bias-preserving dual-rail cat encoding, cyclic control for fast CZ gates, layered mitigation for fiber QPUs, and engineered leakage mobility in transmon architectures.", "papers": [ { "arxiv_id": "2607.01072", "title": "Optimizing Symmetry Informed Probabilistic Error Cancellation", "authors": "Tom O'Leary, Daniel J. Egger, Dieter Jaksch", "arxiv_url": "https://arxiv.org/abs/2607.01072", "pdf_url": "https://arxiv.org/pdf/2607.01072.pdf", "summary": "This paper combines quantum error detection with probabilistic error cancellation, optimizing symmetry measurement configurations to improve accuracy and reduce variance of mitigated observables. The authors cast the choice of noisy symmetry measurements as a classical optimization problem and demonstrate gains for GHZ-state distributions and time dynamics of a generalized superfast encoded Fermi-Hubbard model, including reduced overhead by measuring stabilizer subsets on larger lattices.", "motivation": "Probabilistic error cancellation has emerged as a powerful quantum error mitigation strategy, yet its performance is limited by sampling overhead and sensitivity to measurement noise. Integrating circuit-specific symmetry-based detection with PEC advances near-term, pre-fault-tolerant hardware by importing design principles from fault-tolerant architectures into practical noise-tailored mitigation.", "highlights": [ "Optimized symmetry measurements enhance PEC accuracy and lower estimator variance.", "Demonstrated PEC+QED improvements for GHZ outputs and encoded Fermi-Hubbard dynamics.", "Showed stabilizer subset measurements can reduce mitigation overhead on larger systems." ], "keywords": [ { "label": "Mitigation", "reason": "Central focus is probabilistic error cancellation enhanced by tailored symmetry-informed mitigation strategies." }, { "label": "Symmetry", "reason": "Symmetry measurements and their optimized configurations are the key tool for combining QED with PEC." }, { "label": "GHZ", "reason": "GHZ-state output distributions serve as a primary benchmark to assess the benefit of optimized PEC+QED." }, { "label": "FermiHubbard", "reason": "Time dynamics of an encoded Fermi-Hubbard model provide a realistic application of the mitigation scheme." } ], "emoji": "🎛️", "social_summary": "Optimize symmetry-informed error mitigation to boost probabilistic error cancellation, cutting variance and improving observables for GHZ states and encoded Fermi-Hubbard simulations.", "highlights_oneliner": "Symmetry-optimized probabilistic error mitigation" }, { "arxiv_id": "2607.00786", "title": "Bias-Preserving Gates and Quantum Error Correction With Dual-Rail Cat Codes", "authors": "Debjyoti Biswas, Nikhil Sharma, Alberto Salvador, Rui Wang, Mats Granath, Adithi Udupa, Giulia Ferrini", "arxiv_url": "https://arxiv.org/abs/2607.00786", "pdf_url": "https://arxiv.org/pdf/2607.00786.pdf", "summary": "The paper introduces the dual-rail cat code, a concatenated bosonic encoding that nests an inner cat code inside an outer dual-rail structure to combine erasure detection with bias-tailored correction. The authors analyze its error-correction properties, propose deterministic single-photon-loss correction via an outer repetition code, and construct a universal bias-preserving logical gate set using only beam-splitter interactions while maintaining an erasure-biased noise structure.", "motivation": "Bosonic encodings have evolved to reduce hardware overhead and exploit noise bias, yet individual schemes like dual-rail and cat codes each face limitations in loss handling or gate design. By unifying erasure-resilient dual-rail encodings with bias-preserving cat architectures, this work advances hardware-efficient, bias-preserving fault-tolerant schemes that better match dominant physical noise such as photon loss.", "highlights": [ "Defined the dual-rail cat code combining cat and dual-rail advantages.", "Designed deterministic single-photon-loss correction via concatenation with a repetition code.", "Implemented a universal bias-preserving logical gate set using only beam splitters." ], "keywords": [ { "label": "Cat", "reason": "Inner cat code encodes logical states with strong phase-flip bias and underpins bias-preserving operations." }, { "label": "DualRail", "reason": "Outer dual-rail structure converts photon loss into erasure errors enabling efficient detection and correction." }, { "label": "Bosonic", "reason": "The encoding exploits bosonic modes and their infinite-dimensional Hilbert spaces for hardware-efficient QEC." }, { "label": "Erasure", "reason": "Noise bias is framed in terms of erasure-like photon-loss errors that the code detects and corrects deterministically." } ], "emoji": "🐱", "social_summary": "Combine cat and dual-rail encodings to build a bosonic dual-rail cat code with bias-preserving gates and deterministic photon-loss correction for more hardware-efficient fault tolerance.", "highlights_oneliner": "Bias-preserving dual-rail cat encoding" }, { "arxiv_id": "2607.00660", "title": "Overcoming the Speed-Fidelity Trade-off in Fast CZ Gates via Cyclic Control", "authors": "Ze-An Zhao, Hai-Feng Zhang, Tian-Le Wang, Xiao-Yan Yang, Peng Wang, Ren-Ze Zhao, Sheng Zhang, Zhi-Fei Li, Yuan Wu, Zi-Hao Fu, Sheng-Ri Liu, Peng Duan, Guo-Ping Guo", "arxiv_url": "https://arxiv.org/abs/2607.00660", "pdf_url": "https://arxiv.org/pdf/2607.00660.pdf", "summary": "This work introduces a cyclic control strategy that expands the control-parameter space to restore controllability in fast two-qubit gates subject to short-timescale waveform distortions. Implemented on a superconducting controlled-$Z$ gate, the method robustly suppresses coherent errors without increasing gate duration, reducing average coherent error from $0.27\\%$ to $0.12\\%$ across multiple gates as validated by cross-entropy benchmarking.", "motivation": "As experimental platforms pursue shorter gate times to reduce decoherence, waveform distortions induce control asymmetries that compromise the closure of cyclic evolutions and limit fidelity. Techniques that break the speed-fidelity trade-off at the control level are vital for integrating high-speed gates into fault-tolerant architectures without incurring extra error-correction overhead.", "highlights": [ "Introduced cyclic control with expanded parameter space for fast gates.", "Demonstrated coherent error suppression in a superconducting CZ gate without longer durations.", "Achieved average coherent error reduction from $0.27\\%$ to $0.12\\%$ via cross-entropy benchmarking." ], "keywords": [ { "label": "CZ", "reason": "The controlled-$Z$ gate is the experimental testbed where cyclic control is applied and characterized." }, { "label": "Cyclic", "reason": "Cyclic control of evolutions underpins the strategy for restoring symmetry and precision in fast gates." }, { "label": "Waveforms", "reason": "Short-timescale waveform distortions are the primary control imperfection the method is designed to overcome." }, { "label": "Benchmarking", "reason": "Cross-entropy benchmarking quantifies coherent error suppression enabled by the new control scheme." } ], "emoji": "⚡", "social_summary": "Break the speed–fidelity compromise by using cyclic control on superconducting CZ gates, cutting coherent errors nearly in half without lengthening gate times.", "highlights_oneliner": "Cyclic control for fast high-fidelity CZ" }, { "arxiv_id": "2607.00735", "title": "Experimental Quantification of Layered Error Suppression in Fiber-Interconnected Quantum Data Centers", "authors": "Seyed Navid Elyasi, Sima Bahrani, Rui Wang, Dimitra Simeonidou, Paolo Monti, Rui Lin", "arxiv_url": "https://arxiv.org/abs/2607.00735", "pdf_url": "https://arxiv.org/pdf/2607.00735.pdf", "summary": "The authors experimentally quantify error suppression for remote two-qubit gates in fiber-interconnected superconducting quantum processing units using layered mitigation techniques. Employing a quantum collisional model to emulate communication-induced noise on IBM hardware, they show over $20\\%$ improvement in operational fidelity from combining entanglement purification, Pauli twirling, and readout mitigation, and assess regimes where purification alone is nearly as effective as the full stack.", "motivation": "Distributed quantum data center architectures are proposed to overcome monolithic scaling limits, but remote gates suffer from transduction and fiber-channel noise that degrade entanglement and fidelity. Systematic experimental evaluation of layered error-suppression strategies in realistic interconnected settings is essential to make distributed fault-tolerant computation feasible and to guide design of optical-superconducting interfaces.", "highlights": [ "Demonstrated $>20\\%$ fidelity improvement for remote gates in fiber-interconnected QPUs.", "Used entanglement purification, Pauli twirling, and readout mitigation as a layered suppression stack.", "Showed that for long interconnections, purification alone can match the combined approach’s fidelity." ], "keywords": [ { "label": "Distributed", "reason": "Work targets quantum data center architectures with multiple interconnected QPUs rather than monolithic processors." }, { "label": "Purification", "reason": "Entanglement purification is a core mitigation tool evaluated for remote gate fidelity enhancement." }, { "label": "Twirling", "reason": "Pauli twirling is layered to symmetrize and suppress specific communication-induced noise processes." }, { "label": "Readout", "reason": "Readout mitigation is included to correct measurement errors and contribute to overall fidelity gains." } ], "emoji": "🔗", "social_summary": "Quantify how layered entanglement purification, Pauli twirling, and readout mitigation boost remote gate fidelity in fiber-connected superconducting quantum data centers.", "highlights_oneliner": "Layered mitigation for fiber-linked QPUs" }, { "arxiv_id": "2607.00688", "title": "Leakage Mobility and Passive Leakage Removal in Transmons with Tunable Couplers", "authors": "Taneli Tolppanen, Gonzalo Martín-Vázquez, Sasu Tuohino, Matti Silveri", "arxiv_url": "https://arxiv.org/abs/2607.00688", "pdf_url": "https://arxiv.org/pdf/2607.00688.pdf", "summary": "This paper analyzes leakage dynamics in transmon arrays with tunable couplers, quantifying leakage hopping rates and their dependence on nonlinearity and frequency detuning even when single-excitation exchange or $ZZ$ interactions are canceled. The authors show leakage hopping remains in the $0.8$–$10$ MHz range, identify detuning and next-nearest-neighbor frequency spread requirements ($1$–$4$ MHz) to localize leakage, and propose two passive leakage removal units based on a coupler-plus-pumped transmon and a junction readout scheme.", "motivation": "Leakage outside the computational subspace has long been recognized as a critical yet hard-to-correct error channel, capable of causing correlated errors and undermining standard QEC codes. Understanding and harnessing leakage mobility in popular transmon-with-coupler architectures enables architectural strategies that both suppress harmful propagation and route excitations toward passive removal units without active gate overhead.", "highlights": [ "Quantified leakage hopping rates of $0.8$–$10$ MHz in transmons with tunable couplers.", "Showed transmon detuning and $1$–$4$ MHz next-nearest-neighbor spreads can localize leakage and suppress long-range hopping.", "Proposed two passive leakage removal units using a pumped transmon coupler and a junction readout scheme." ], "keywords": [ { "label": "Leakage", "reason": "Central object of study, encompassing both mobility of non-computational excitations and their passive removal." }, { "label": "Transmons", "reason": "Superconducting transmon qubits form the primary hardware platform considered for leakage dynamics." }, { "label": "Couplers", "reason": "Tunable couplers mediate interactions and strongly influence leakage hopping channels in the lattice." }, { "label": "Detuning", "reason": "Frequency detuning and spreads are engineered to localize leakage and control its propagation range." } ], "emoji": "🚰", "social_summary": "Map and control leakage mobility in transmon-coupler architectures, quantifying hopping rates and designing passive units that route and remove leakage without extra gate overhead.", "highlights_oneliner": "Engineered leakage mobility and passive removal" } ] }, "2026-07-01": { "word_cloud": [ { "word": "LDPC", "weight": 5 }, { "word": "syndrome", "weight": 4 }, { "word": "erasure", "weight": 5 }, { "word": "surface", "weight": 3 }, { "word": "barren", "weight": 3 }, { "word": "variance", "weight": 4 }, { "word": "hardware", "weight": 3 }, { "word": "compression", "weight": 5 }, { "word": "postselection", "weight": 4 }, { "word": "mitigation", "weight": 5 }, { "word": "decoder", "weight": 4 }, { "word": "Pauli", "weight": 5 }, { "word": "coupling", "weight": 4 }, { "word": "memory", "weight": 2 }, { "word": "qubits", "weight": 3 } ], "social_highlights": "Highlights: spatially coupled CSS codes reach the hashing bound, CryoZip slashes cryogenic QEC bandwidth, erasure-based postselection boosts NISQ fidelity, and Pauli-weight learning optimizes error mitigation training.", "papers": [ { "arxiv_id": "2606.32001", "title": "Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding", "authors": "Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2606.32001", "pdf_url": "https://arxiv.org/pdf/2606.32001.pdf", "summary": "This paper derives a five-message density-evolution recursion for spatially coupled MacKay-Neal/Hsu-Anastasopoulos type CSS codes on the quantum erasure channel with hard-erasure decoding, decomposing it into $Z$-side and $X$-side constituent systems and associated potentials. It proves that seeded belief-propagation decoding on finite-degree factor graphs saturates to a BP threshold $\\epsilon_{\\mathrm{pot}}=\\min\\{j_{Z}/k,1-j_{X}/k\\}$, and in the $X/Z$ equal-rate specialization with $j_{Z}+j_{X}=k$ this threshold coincides with the hashing-bound parameter $\\epsilon_{\\mathrm{hash}}=(1-R_{Q}^{\\mathrm{des}})/2$ for the designed quantum rate. The result provides a deterministic, asymptotic density-evolution level proof that spatially coupled MN/HA CSS ensembles achieve the quantum-erasure hashing bound under seeded BP, while noting that finite-length concentration and block-error guarantees remain open.", "motivation": "Building on classical LDPC and spatially coupled ensembles where BP decoding approaches MAP thresholds, this work extends punctured MN/HA constructions into the CSS setting to analyze quantum LDPC performance on the erasure channel. Achieving the hashing bound with finite-degree, BP-decodable quantum codes is central to practical high-rate quantum memories and communication, making this density-evolution saturation theorem an important step toward capacity-approaching, structurally simple QEC designs.", "highlights": [ "Five-message CSS density-evolution recursion with constituent potentials", "Seeded spatial coupling saturates BP threshold $\\epsilon_{\\mathrm{pot}}=\\min\\{j_{Z}/k,1-j_{X}/k\\}$", "$X/Z$ equal-rate family achieves the quantum-erasure hashing bound under BP" ], "keywords": [ { "label": "CSS codes", "reason": "The construction and analysis focus on Calderbank-Shor-Steane codes built from punctured MN/HA ensembles." }, { "label": "Spatial coupling", "reason": "Spatially coupled factor graphs drive BP saturation to the DE potential threshold and enable hashing-bound performance." }, { "label": "Hashing bound", "reason": "The main theoretical result is that BP thresholds reach the quantum-erasure hashing bound for the equal-rate family." }, { "label": "Belief propagation", "reason": "Seeded BP decoding on finite-degree graphs is the decoding mechanism whose threshold is characterized via density evolution." } ], "emoji": "⚙️", "social_summary": "Show how spatially coupled MN/HA CSS codes with seeded BP decoding can reach the quantum-erasure hashing bound via a rigorous density-evolution analysis.", "highlights_oneliner": "Spatially coupled CSS codes hit hashing bound" }, { "arxiv_id": "2606.30805", "title": "CryoZip: An Efficient Cryogenic Compressor for Quantum Error Correction Syndromes", "authors": "Guanchen Tao, Alexander Knapen, Jacob Mack, Gokul Subramanian Ravi, Qirui Zhang, Mehdi Saligane, Dennis Sylvester", "arxiv_url": "https://arxiv.org/abs/2606.30805", "pdf_url": "https://arxiv.org/pdf/2606.30805.pdf", "summary": "CryoZip is a cross-stack cryogenic compression framework that works with lightweight quantum error correction predecoders to reduce $4\\,\\mathrm{K}$ to room-temperature syndrome data transmission under realistic circuit-level noise. Targeting sparse syndrome vectors from codes such as surface, color, and bivariate bicycle codes, it uses a sliding-window compression architecture sized to meet strict decoding latency constraints and maximize energy efficiency, implemented in $22\\,\\mathrm{nm}$ FDSOI characterized at $4\\,\\mathrm{K}$. Hardware evaluation shows up to $48\\times$ compression (about $1.8\\times$ higher than prior compressors), $4$–$26\\times$ energy savings, and, when paired with a predecoder, more than $14238\\times$ bandwidth reduction and $42\\times$ energy savings including realistic QEC interface overheads.", "motivation": "As fault-tolerant architectures scale to $10^{5}$–$10^{6}$ physical qubits, the limited bandwidth and $\\sim1.5\\,\\mathrm{W}$ cooling budget at $4\\,\\mathrm{K}$ make syndrome links from cryogenic qubits to room-temperature decoders a critical systems bottleneck. By co-designing compression algorithms, architecture, and cryogenic CMOS technology, CryoZip addresses this emerging QEC data-movement challenge, enabling more scalable, energy-efficient control and decoding pipelines for large quantum processors.", "highlights": [ "Sliding-window cryogenic compressor tailored to sparse QEC syndromes", "Up to $48\\times$ compression and $4$–$26\\times$ energy savings at $4\\,\\mathrm{K}$", "Over $14238\\times$ bandwidth reduction when combined with a QEC predecoder" ], "keywords": [ { "label": "Cryogenics", "reason": "The work targets electronics operating at $4\\,\\mathrm{K}$ inside dilution refrigerators with tight cooling budgets." }, { "label": "Compression", "reason": "It introduces a specialized sliding-window compression architecture for sparse QEC syndrome streams." }, { "label": "Syndrome", "reason": "The primary data handled and compressed are QEC syndrome vectors from various stabilizer code families." }, { "label": "CMOS", "reason": "The design is implemented and characterized in $22\\,\\mathrm{nm}$ FDSOI CMOS technology at cryogenic temperatures." } ], "emoji": "📡", "social_summary": "Introduce CryoZip, a cryogenic CMOS compressor that dramatically reduces QEC syndrome bandwidth and energy while respecting strict decoding latency at scale.", "highlights_oneliner": "Cryogenic compression slashes QEC bandwidth" }, { "arxiv_id": "2606.31428", "title": "The limits of erasure-based postselection for quantum error mitigation", "authors": "Sam J. Griffiths, Jamie Friel, Brian Vlastakis", "arxiv_url": "https://arxiv.org/abs/2606.31428", "pdf_url": "https://arxiv.org/pdf/2606.31428.pdf", "summary": "This work develops a simulational and theoretical framework for heralded erasure noise and postselection, introducing the open-source library erado with two equivalent circuit-level implementations (ErasureCircuitSampler and ErasurePass) that apply erasure dynamics to arbitrary Qiskit circuits. Using this model, the authors study quantum Fourier transform performance under erasure channels, noisy erasure checks, and gate depolarising noise, showing a worked example where postselection can fully mitigate the erasure channel for erasure check error rates below $3.0\\%$ and quantifying how fidelity gains scale with erasure probability $p_{e}$ and relax towards the $T_{1}\\to\\infty$ gate-noise limit. They further demonstrate that a postselected dual-rail system can surpass an estimated fundamental noise floor for QFT at the kiloquop scale where a comparable single-rail system cannot, highlighting regimes where erasure-based postselection is a viable near-term error mitigation strategy before large-scale QEC.", "motivation": "Heralded erasures are easier to correct than unheralded stochastic errors, motivating architectures that engineer erasure-dominant noise, such as dual-rail transmons and photonic qubits. By systematically analyzing postselection overheads and fidelity improvements in realistic circuit-level erasure models, this work clarifies when erasure-based mitigation can extend NISQ capabilities and how it might complement or defer the need for full-fledged fault-tolerant QEC.", "highlights": [ "Introduces erado for circuit-level erasure noise and postselection simulation", "Shows postselection can fully mitigate erasure channel for erasure checks with $q<3.0\\%$", "Demonstrates postselected dual-rail QFT surpasses a kiloquop noise floor unlike single-rail" ], "keywords": [ { "label": "Erasures", "reason": "The core noise model and mitigation strategy revolve around heralded erasure errors in qubit architectures." }, { "label": "Postselection", "reason": "Discarding shots with detected erasures is the central error mitigation mechanism analyzed and benchmarked." }, { "label": "Dual-rail", "reason": "Dual-rail qubit encodings are studied as erasure-dominant architectures that benefit from postselection." }, { "label": "Simulation", "reason": "The erado library provides circuit-level simulation tools to study erasure noise and mitigation in Qiskit." } ], "emoji": "🚦", "social_summary": "Explore how erasure-based postselection, implemented via the erado library, can significantly boost QFT fidelity on dual-rail qubits within realistic NISQ noise regimes.", "highlights_oneliner": "Erasure postselection boosts NISQ fidelity" }, { "arxiv_id": "2606.31195", "title": "Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation", "authors": "Fadhil Fatih Shiddiq, Darell Timothy Tarigan, Hadyan Luthfan Prihadi, Jusak S. Kosasih, Yanoar P. Sarwono, Leong-Chuan Kwek, Freddy Permana Zen", "arxiv_url": "https://arxiv.org/abs/2606.31195", "pdf_url": "https://arxiv.org/pdf/2606.31195.pdf", "summary": "The paper introduces Pauli weight Quantum Error Mitigation (Pi-QEM), a systematic framework for selecting training observables in learning-based QEM using prior knowledge of Pauli string weights. By linking the variance $\\text{Var}_{\\Theta}[f(\\hat{P}_{k})]$ of parameterized quantum circuits to locality-dependent barren plateau structures, Pi-QEM identifies low-weight Pauli strings as statistically informative, high-variance observables and excludes high-weight global terms with suppressed variance that degrade training. Numerical simulations of molecular systems, including the $\\text{H}_{2}$ molecule under Jordan–Wigner mapping on a noisy IBM backend, show that training on a minimal subset such as a single dominant low-weight observable can reduce ground-state energy estimation error by up to $34.01\\%$, while shrinking the training set from $\\\\mathcal{O}(MN)$ to $\\\\mathcal{O}(M|\\\\mathcal{P}_{\\text{sub}}|)$ with $|\\\\mathcal{P}_{\\text{sub}}|\\ll N$.", "motivation": "Near-term devices cannot afford the qubit overhead of full QEC, making machine-learning based QEM an attractive alternative, yet existing methods often require measurements of every Pauli term and suffer from barren plateaus. Pi-QEM leverages the structure of Hamiltonians and cost landscapes to focus training on informative, local observables, improving mitigation accuracy and scalability for variational chemistry and other NISQ workloads.", "highlights": [ "Defines Pi-QEM using Pauli-weight informed observable selection and variance criteria", "Connects observable variance to locality-driven barren plateau behavior in PQCs", "Achieves up to $34.01\\%$ reduction in ground-state energy error using a single dominant local term" ], "keywords": [ { "label": "Pauli weight", "reason": "Training observables are chosen based on the Pauli string weight, distinguishing local from global Hamiltonian terms." }, { "label": "Machine learning", "reason": "Regression tree models and learning-based QEM provide the mitigation mechanism trained on selected observables." }, { "label": "Barren plateaus", "reason": "The framework exploits the link between variance and barren plateau structures to avoid uninformative training data." }, { "label": "Chemistry", "reason": "Applications to molecular systems like $\\text{H}_{2}$ demonstrate Pi-QEM’s benefits for quantum chemistry simulations." } ], "emoji": "🧠", "social_summary": "Present Pi-QEM, a Pauli-weight guided learning framework that trains on a few local observables to cut energy errors and measurement costs in NISQ quantum chemistry.", "highlights_oneliner": "Pauli-weight learning sharpens error mitigation" } ] }, "2026-06-30": { "word_cloud": [ { "word": "Magic", "weight": 4 }, { "word": "Photonic", "weight": 4 }, { "word": "Ancilla", "weight": 5 }, { "word": "Cat", "weight": 5 }, { "word": "Kerr", "weight": 4 }, { "word": "Repetition", "weight": 3 }, { "word": "Molecular", "weight": 2 }, { "word": "Fusion", "weight": 4 }, { "word": "Thresholds", "weight": 5 }, { "word": "LDPC", "weight": 4 }, { "word": "Bosonic", "weight": 4 }, { "word": "Decoders", "weight": 3 }, { "word": "Syndrome", "weight": 3 }, { "word": "Gates", "weight": 4 }, { "word": "Noise", "weight": 5 } ], "social_highlights": "Highlights: unify magic-state factories via borrowed-identity circuits, design a fault-tolerant photon-atom architecture, boost QLDPC performance with biased ancillas, engineer flying Kerr cats, map logical loss in Kerr-cat gates, benchmark repetition-code readout, streamline ML-assisted quantum chemistry, and expose fusion-based noise floors.", "papers": [ { "arxiv_id": "2606.28518", "title": "Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search", "authors": "Shraddha Singh, Craig Gidney, Cody Jones", "arxiv_url": "https://arxiv.org/abs/2606.28518", "pdf_url": "https://arxiv.org/pdf/2606.28518.pdf", "summary": "The paper introduces a weaker \"borrowed-identity\" criterion for magic-state distillation circuits, requiring the circuit to act as identity only on a single input state rather than the full codespace, and applicable at all levels of the Clifford hierarchy. Using this condition with two-group symmetry, a brute-force numerical search recovers all known distance-$2$ factories within the search range, including entangled-output and multi-output constructions, and yields parent circuits whose output magic-state type (e.g., $|T\\rangle$, $|CS\\rangle$, $|CCZ\\rangle$) can be chosen at compile time. The framework also extends beyond CSS codes, unifying synthillation and non-CSS catalytic factories previously derived via unrelated methods.", "motivation": "Magic-state distillation is a dominant overhead in fault-tolerant architectures because non-Clifford resources typically require many noisy input states and large factories to reach target logical error rates. Historically, numerical searches for distillation protocols have been constrained by transversal-gate requirements and specific code structures, so a more general, hierarchy-wide search framework that unifies diverse factories directly impacts the resource efficiency of large-scale quantum algorithms.", "highlights": [ "Define borrowed-identity circuits that relax transversal constraints for magic-state distillation", "Recover and unify all distance-$2$ factories in the search range, including multi-output and entangled-output designs", "Produce parent circuits that support multiple magic-state types and extend to non-CSS and catalytic constructions" ], "keywords": [ { "label": "Magic states", "reason": "Core focus is on distilling non-Clifford resource states like $|T\\rangle$, $|CS\\rangle$, and $|CCZ\\rangle$ with reduced overhead." }, { "label": "Factories", "reason": "Work develops and unifies magic-state distillation factory circuits, including multi-output and entangled-output variants." }, { "label": "Clifford hierarchy", "reason": "Borrowed-identity condition is formulated to apply uniformly across all levels of the Clifford hierarchy." }, { "label": "CSS codes", "reason": "Framework recovers CSS-based factories but also generalizes beyond CSS to synthillation and non-CSS catalytic schemes." } ], "emoji": "✨", "social_summary": "Unify diverse magic-state distillation factories with a new borrowed-identity search framework that recovers known protocols and enables flexible, multi-type resource generation.", "highlights_oneliner": "Unified search for versatile magic-state factories" }, { "arxiv_id": "2606.30385", "title": "Blueprint for a fault-tolerant compound photon-atom quantum architecture", "authors": "Geva Arwas, Doron Azoury, Daniel Azses, Orel Bechler, Dana Ben Porath, Barak Dayan, David Dentelski, Yaron Jarach, Nadav Kandel, Aviad Landau, Yair Margalit, Alexander Poddubny, Michael Slutsky, Konstantin Yavilberg", "arxiv_url": "https://arxiv.org/abs/2606.30385", "pdf_url": "https://arxiv.org/pdf/2606.30385.pdf", "summary": "The authors propose a compound quantum architecture where cavity-QED-mediated, near-deterministic photon-atom CZ gates provide reusable atomic resources for generating large-scale photonic cluster states used in measurement-based quantum computing. They detail physical protocols based on single $^{87}$Rb atoms in high-cooperativity optical cavities to realize fast state preparation, measurement, photon emission, and entangling operations on tens-of-nanosecond timescales, enabling effectively unrestricted connectivity through atomic reuse. A hardware-aware noise model on the Raussendorf-Harrington-Goyal lattice yields a photon-loss threshold near $2.6\\%$ per physical gate (about $15\\%$ per trajectory), with Clifford logical gates implemented transversally or fold-transversally and non-Clifford resources supplied via code teleportation or magic-state cultivation within foliated cluster-state constructions.", "motivation": "Existing matter-based platforms struggle to combine scalability, high connectivity, and fault tolerance, while purely photonic schemes suffer from probabilistic entangling gates and resource inefficiency. A concrete, hardware-informed blueprint that hybridizes photonic connectivity with atomic determinism and evaluates thresholds on realistic cluster-state QEC structures directly informs architectures for utility-scale, fault-tolerant machines.", "highlights": [ "Introduce a photon-atom architecture with near-deterministic cavity-QED CZ gates for cluster-state generation", "Demonstrate RHG-lattice fault tolerance with a photon-loss threshold around $2.6\\%$ per physical gate", "Implement the full Clifford set transversally or fold-transversally and outline non-Clifford resource-state routes in foliated MBQC" ], "keywords": [ { "label": "Cluster states", "reason": "Large-scale photonic cluster states on RHG lattices form the computational backbone of the MBQC architecture." }, { "label": "Cavity QED", "reason": "High-cooperativity atom-cavity systems enable fast, near-deterministic photon-atom CZ gates and photon generation." }, { "label": "RHG lattice", "reason": "Fault tolerance and thresholds are analyzed using the Raussendorf-Harrington-Goyal 3D cluster-state code structure." }, { "label": "Photon loss", "reason": "A detailed noise model yields photon-loss thresholds critical for assessing practicality of the architecture." } ], "emoji": "🔗", "social_summary": "Design a hybrid photon-atom architecture that uses cavity-QED cluster states to reach fault-tolerant thresholds with fast operations and high connectivity.", "highlights_oneliner": "Hybrid photon-atom blueprint for fault tolerance" }, { "arxiv_id": "2606.30592", "title": "Untangling QLDPC Codes with Biased Noise Ancilla", "authors": "Runjiang Bi, Kathleen Chang, Shruti Puri", "arxiv_url": "https://arxiv.org/abs/2606.30592", "pdf_url": "https://arxiv.org/pdf/2606.30592.pdf", "summary": "This work studies QLDPC syndrome-extraction circuits under ancilla noise biased toward phase flips, showing that ancilla-only bias can suppress distance-reducing hook errors and reduce short cycles in the Tanner graph without modifying the code. Using bicycle bivariate and cyclic hypergraph product codes under realistic nonlocal connectivity, they demonstrate that ancilla phase-flip dominance significantly increases effective fault distance and mitigates belief-propagation degradation due to short loops. For physical error rates around $2\\times 10^{-3}$ and ancilla bit-flip errors $50$–$100$ times less likely than phase flips, they observe nearly an order-of-magnitude reduction in logical error rate, indicating a practical QEC advantage even when full bias cannot be maintained.", "motivation": "QLDPC codes promise higher rates and distances than surface codes but suffer from complex connectivity, hook errors from ancilla propagation, and belief-propagation failures induced by short Tanner-graph loops. Exploiting realistic noise bias only on ancilla qubits offers a hardware-aligned route to improve logical performance and decoding without redesigning codes or requiring fully bias-preserving logical gates.", "highlights": [ "Show that ancilla-only biased noise suppresses hook errors and short loops in QLDPC syndrome extraction", "Demonstrate nearly an order-of-magnitude logical error reduction at $p\\approx 2\\times 10^{-3}$ with ancilla phase-flip bias", "Validate the advantage across bicycle bivariate and cyclic hypergraph product codes and multiple BP-style decoders" ], "keywords": [ { "label": "QLDPC", "reason": "The study targets high-rate quantum low-density parity-check codes such as bicycle bivariate and hypergraph product codes." }, { "label": "Ancilla bias", "reason": "Central idea is to engineer phase-biased noise on ancilla qubits while leaving data qubits unbiased." }, { "label": "Hook errors", "reason": "Biased ancillas reduce multi-qubit hook errors that otherwise lower the effective distance of the code." }, { "label": "Belief propagation", "reason": "Performance is evaluated using BP-based decoders whose sensitivity to short Tanner-graph cycles is mitigated by the bias." } ], "emoji": "🎯", "social_summary": "Exploit phase-biased ancilla qubits to tame hook errors and short loops in QLDPC codes, yielding up to tenfold lower logical error rates without changing the codes.", "highlights_oneliner": "Biased ancillas boost QLDPC performance" }, { "arxiv_id": "2606.30075", "title": "Programmable generation of flying cat-qubits", "authors": "Cecilia Erneman, Zeidan Zeidan, Göran Johansson, Maryam Khanahmadi", "arxiv_url": "https://arxiv.org/abs/2606.30075", "pdf_url": "https://arxiv.org/pdf/2606.30075.pdf", "summary": "The authors propose protocols to directly generate propagating two-component cat-qubit states from vacuum in nonlinear bosonic oscillators using time-dependent two-photon drives, considering both Kerr-based and engineered two-photon-dissipation-based schemes. They show that by shaping the two-photon pump and applying a tailored single-photon drive, one can simultaneously generate, emit, and perform logical rotations on a cat qubit whose quantum information is shared between the source oscillator and an itinerant temporal mode. Numerical analysis including photon loss and pure dephasing indicates that high-fidelity temporal-mode shaping and logical control remain robust under realistic noise, suggesting routes to programmable bosonic quantum networks and error-correctable flying encodings.", "motivation": "Bosonic cat encodings are attractive for noise resilience and fault-tolerant operations, but current approaches typically prepare stationary cat states before releasing them, limiting flexibility for networking and in-flight processing. A continuously coupled source that can programmatically generate and manipulate flying cat qubits in specific temporal modes directly addresses needs in modular architectures, quantum repeaters, and distributed bosonic computation.", "highlights": [ "Develop continuous-generation schemes for flying cat qubits using Kerr and two-photon-dissipation mechanisms", "Achieve full logical control of propagating cat qubits via optimized two-photon and single-photon drives", "Demonstrate robustness of temporal-mode shaping and logical rotations against realistic photon loss and dephasing" ], "keywords": [ { "label": "Cat qubits", "reason": "Work centers on two-component bosonic cat encodings used as logical qubits in a propagating form." }, { "label": "Kerr nonlinearity", "reason": "Engineered Kerr interactions provide one of the main mechanisms for two-photon-driven cat-state generation." }, { "label": "Dissipation", "reason": "Two-photon dissipation is harnessed as an alternative stabilization and generation pathway for flying cats." }, { "label": "Waveguides", "reason": "The cat states are emitted into a waveguide as itinerant temporal modes suitable for networking." } ], "emoji": "🐱", "social_summary": "Generate and steer flying cat qubits directly into a waveguide, using shaped two-photon drives for robust, programmable bosonic networking.", "highlights_oneliner": "Programmable generation of flying cat qubits" }, { "arxiv_id": "2606.29890", "title": "Preparation-Space Diagnostics and Logical Information Loss in a Driven Kerr-Cat Qubit", "authors": "Stephen Wiggins", "arxiv_url": "https://arxiv.org/abs/2606.29890", "pdf_url": "https://arxiv.org/pdf/2606.29890.pdf", "summary": "This paper compares classical phase-space transport diagnostics with open-system quantum evolution for a driven Kerr-cat qubit, mapping how gate pulses deform the double-well structure and corrupt a logical bit over a disk of coherent-state preparations. It shows that the logical corruption depends sensitively on the full temporal pulse protocol: sudden quenches induce strong separatrix turnstiles and nearly erase logical distinguishability, whereas smooth Gaussian ramps of the same peak amplitude largely preserve the encoded bit. Classical finite-time sensitivity fields and Loschmidt echoes computed near the pulse end accurately predict regions of later quantum information loss, and scans over pulse parameters, cat size, and engineered two-photon dissipation delineate where classical transport pictures track quantum logical degradation.", "motivation": "Kerr-cat qubits promise hardware-efficient bosonic error correction, yet their logical robustness during fast gates is governed by nonlinear dynamics that are hard to intuit. Bridging classical phase-space transport with quantum information metrics offers practical diagnostics to design gate protocols and dissipation engineering that avoid logical erasure in realistic, driven cat devices.", "highlights": [ "Demonstrate that gate-induced logical loss in a Kerr-cat qubit depends on full pulse shape, not just amplitude", "Use finite-time sensitivity and Loschmidt echo fields to predict quantum logical erasure across preparation space", "Show that engineered two-photon dissipation can suppress classical leakage and significantly enhance logical retention" ], "keywords": [ { "label": "Kerr cats", "reason": "The study focuses on parametrically driven Kerr-cat oscillators encoding a logical bit in double-well phase space." }, { "label": "Loschmidt echo", "reason": "A key diagnostic relates operator growth to later logical information loss in the open quantum system." }, { "label": "Phase space", "reason": "Classical transport structures and sensitivity ridges in phase space underpin the analysis of logical corruption." }, { "label": "Pulses", "reason": "Temporal pulse protocols for gates are varied and shown to control the extent of logical bit degradation." } ], "emoji": "🌀", "social_summary": "Map how pulse shapes drive logical erasure in Kerr-cat qubits by linking classical transport and Loschmidt echoes to quantum information loss.", "highlights_oneliner": "Phase-space view of Kerr-cat logical loss" }, { "arxiv_id": "2606.30606", "title": "Repetition-code-based readout error detection and correction across hardware platforms and generations", "authors": "Csaba Czabán, Orsolya Kálmán, Sergey N. Filippov, Zoltán Zimborás", "arxiv_url": "https://arxiv.org/abs/2606.30606", "pdf_url": "https://arxiv.org/pdf/2606.30606.pdf", "summary": "The authors experimentally benchmark repetition-code-based readout error detection and correction across IBM Heron superconducting processors and Quantinuum H1/H2 trapped-ion devices, varying code distance, hardware generation, and encoding layout. By redundantly encoding each data qubit in ancillas immediately before measurement and decoding via post-selection or majority voting, they correct readout errors at the level of individual shots, unlike standard expectation-value mitigation. Results show consistent improvements in readout fidelity on all platforms and generations, but reveal that on superconducting hardware extra gate errors quickly offset benefits from larger code distances, while trapped-ion devices with much lower gate error rates sustain advantages from higher redundancy.", "motivation": "Measurement noise is a major bottleneck for near-term quantum algorithms, yet most mitigation focuses on correcting averaged observables rather than producing cleaner samples. Systematic, cross-platform evaluation of simple classical coding techniques like repetition codes clarifies when and how redundant pre-measurement encoding can deliver practical, hardware-dependent gains in readout quality.", "highlights": [ "Implement shot-level readout error detection and correction using repetition codes across superconducting and trapped-ion devices", "Show consistent readout fidelity gains on all tested hardware generations compared to unencoded baselines", "Identify hardware-dependent tradeoffs where gate errors limit useful code distance on superconducting chips but not on trapped ions" ], "keywords": [ { "label": "Repetition codes", "reason": "Redundant encoding with simple repetition codes underpins the readout error detection and correction protocol." }, { "label": "Readout", "reason": "The work targets measurement noise and evaluates improvements in single-shot readout fidelity." }, { "label": "Superconducting", "reason": "IBM Heron superconducting processors are one of the main platforms in the cross-generation study." }, { "label": "Trapped ions", "reason": "Quantinuum H1 and H2 trapped-ion systems provide a contrasting low-gate-error platform where larger code distances remain beneficial." } ], "emoji": "📏", "social_summary": "Benchmark repetition-code readout schemes across superconducting and trapped-ion devices, showing when extra redundancy truly improves single-shot measurement fidelity.", "highlights_oneliner": "Cross-platform benchmarks of repetition-code readout" }, { "arxiv_id": "2606.30551", "title": "Bridging the NISQ and Fault-Tolerant Regimes: Generative-ML-Assisted Quantum Selected CI for Molecular Simulations", "authors": "Anurag K. S. V., Ashish Kumar Patra, Manas Mukherjee, Ruchika Bhat, Sai Shankar P., Rahul Maitra, Jaiganesh G", "arxiv_url": "https://arxiv.org/abs/2606.30551", "pdf_url": "https://arxiv.org/pdf/2606.30551.pdf", "summary": "This work develops a hybrid quantum-classical workflow for quantum chemistry that integrates a Linear Scaling CNOT UCCSD (LCNot-UCCSD) ansatz into Quantum Selected Configuration Interaction (QSCI), reducing parameter initialization from $\\\\mathcal{O}(N^6)$ CCSD to $\\\\mathcal{O}(N^4)$ MP2 amplitudes. It further introduces QSCI-RBM, which replaces stochastic configuration recovery with a Restricted Boltzmann Machine generative model to compactly expand the variational subspace. Benchmarked on multiple molecules, error levels, and potential energy surface scans, and embedded in DMET for realistic systems like Amantadine and a SARS-CoV-2 main protease complex, the approach achieves high-accuracy energies using substantially fewer classical resources than prior state-of-the-art simulations.", "motivation": "Accurate electronic-structure calculations for realistic protein-ligand systems are classically expensive, while current quantum hardware cannot support the deep fault-tolerant circuits needed for straightforward quantum algorithms. By combining more scalable ansatz initialization with generative machine learning inside a QSCI framework, this work aims to make chemically accurate, resource-efficient simulations feasible on near-term or early fault-tolerant quantum platforms.", "highlights": [ "Replace $\\\\mathcal{O}(N^6)$ CCSD initialization with $\\\\mathcal{O}(N^4)$ MP2-based LCNot-UCCSD within QSCI", "Introduce QSCI-RBM, using a Restricted Boltzmann Machine for compact generative subspace expansion", "Demonstrate accurate DMET-QSCI(LCNot-UCCSD)-RBM simulations for industry-relevant protein-ligand systems with reduced classical cost" ], "keywords": [ { "label": "QSCI", "reason": "Quantum Selected Configuration Interaction forms the backbone of the proposed quantum-sampling-based diagonalization workflow." }, { "label": "UCCSD", "reason": "The LCNot-UCCSD ansatz provides a linearly scaling CNOT structure and efficient parameter initialization." }, { "label": "RBM", "reason": "Restricted Boltzmann Machines act as generative models for subspace expansion in QSCI-RBM." }, { "label": "DMET", "reason": "Density Matrix Embedding Theory is used to apply the method to large, realistic molecular fragments." } ], "emoji": "🧬", "social_summary": "Combine scalable LCNot-UCCSD and RBM-based QSCI to simulate realistic protein-ligand chemistry with far fewer classical resources than existing quantum-inspired workflows.", "highlights_oneliner": "ML-assisted QSCI for scalable quantum chemistry" }, { "arxiv_id": "2606.28490", "title": "The subthreshold issue of fusion-based quantum computing", "authors": "Matthias C. Löbl, Love A. M. Pettersson, Jan Dragašević, Susan X. Chen, Oliver A. D. Sandberg", "arxiv_url": "https://arxiv.org/abs/2606.28490", "pdf_url": "https://arxiv.org/pdf/2606.28490.pdf", "summary": "The paper analyzes the sub-threshold regime of fusion-based quantum computing (FBQC) and shows that fusion failure, unlike photon loss, imposes a fundamental noise floor on logical error rates that cannot be eliminated by hardware improvements alone in all-linear-optics architectures. In FBQC, fusion failures and photon loss are often combined into a single erasure budget, but the authors argue that this obscures the persistent contribution of fusion failure that limits how far logical error can be suppressed at reasonable code distances. They further demonstrate that incorporating quantum emitter spins into fusion-based architectures can reduce this noise floor by orders of magnitude at lower qubit overhead, substantially improving prospects for achieving target logical error rates such as $\\sim 10^{-10}$ required by many applications.", "motivation": "Photonic FBQC is attractive for its natural connectivity and compatibility with high-rate qLDPC codes, but most prior work has focused on thresholds rather than the absolute overhead needed to reach application-level logical error rates. Clarifying how fusion failures constrain sub-threshold performance, and how quantum emitters can alleviate this, is crucial for assessing the true scalability of photonic fault-tolerant architectures.", "highlights": [ "Identify a fusion-failure-induced noise floor that limits sub-threshold logical error suppression in all-linear-optics FBQC", "Show that treating fusion failure and photon loss as a single erasure budget can mask persistent logical noise", "Demonstrate that adding quantum emitter spins to FBQC can lower the noise floor by orders of magnitude at reduced overhead" ], "keywords": [ { "label": "FBQC", "reason": "Fusion-based quantum computing is the central architectural paradigm studied for photonic fault tolerance." }, { "label": "Fusions", "reason": "Probabilistic fusion gates and their failure rates are shown to impose a fundamental noise floor." }, { "label": "Erasures", "reason": "Fusion failures and photon loss contribute erasures whose treatment critically affects logical performance analysis." }, { "label": "Emitters", "reason": "Quantum emitter spins are proposed to dramatically reduce the noise floor compared to all-linear-optics schemes." } ], "emoji": "⚖️", "social_summary": "Reveal how fusion failures set a hard noise floor in photonic fusion-based computing and how quantum emitters can dramatically lower it at modest overhead.", "highlights_oneliner": "Fusion-failure noise floors in FBQC" } ] }, "2026-06-29": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "Topological", "weight": 5 }, { "word": "Phases", "weight": 4 }, { "word": "Hybrid", "weight": 4 }, { "word": "Neural", "weight": 4 }, { "word": "Networks", "weight": 3 }, { "word": "Superconducting", "weight": 3 }, { "word": "Lattices", "weight": 3 }, { "word": "Pauli", "weight": 3 }, { "word": "Classifier", "weight": 4 }, { "word": "States", "weight": 4 }, { "word": "Measurements", "weight": 3 }, { "word": "Hardware", "weight": 3 }, { "word": "Nonlocal", "weight": 4 }, { "word": "Features", "weight": 3 } ], "social_highlights": "Highlights: Hybrid quantum-classical neural networks classify topological surface code phases on superconducting hardware and robustly distinguish topological ground states from product states under single-qubit Pauli errors.", "papers": [ { "arxiv_id": "2606.28201", "title": "Hybrid Quantum-Classical Neural Networks for Recognizing Quantum Phases", "authors": "Colin Scarato, Johannes Knörzer, Markus K. Hoffmann, Leon C. Sander, Luca Hofele, Shengpu Wang, Kilian Hanke, Ashay Sathe, Dominic Hagmann, Alexander Flasby, Michael J. Hartmann, Petr Zapletal, Andreas Wallraff, Christoph Hellings", "arxiv_url": "https://arxiv.org/abs/2606.28201", "pdf_url": "https://arxiv.org/pdf/2606.28201.pdf", "summary": "The paper introduces a hybrid quantum-classical neural network that combines a hardware-efficient parameterized quantum circuit with a classical feedforward network to recognize quantum phases of surface code lattices up to $4\\times4$ sites under a magnetic field. The jointly trained architecture operates directly on quantum data from superconducting hardware and learns nonlocal features that distinguish topological ground states of the surface code from a featureless ensemble of product states, maintaining strong classification performance even in the presence of single-qubit Pauli errors. The demonstrated classifier achieves above $85\\%$ single-shot accuracy and exceeds $99\\%$ accuracy when averaging over ten measurements, highlighting favorable sample complexity compared to purely classical approaches.", "motivation": "Identifying quantum phases, especially topological phases without local order parameters, has historically required resource-intensive classical methods and sophisticated many-body diagnostics. By leveraging hybrid quantum-classical neural networks operating directly on quantum data, this work advances scalable characterization of strongly correlated and topological states, which is crucial for understanding surface-code-based architectures and next-generation quantum materials.", "highlights": [ "Hybrid quantum-classical classifier trained on superconducting hardware for surface code phases", "Robust discrimination of topological ground states from product states under any single-qubit Pauli error", "Single-shot phase recognition with $>85\\%$ accuracy and $>99\\%$ accuracy with measurement averaging" ], "keywords": [ { "label": "Surface Codes", "reason": "The classifier is explicitly trained and evaluated on topological ground states of surface code lattices and their product-state counterparts." }, { "label": "Hybrid Networks", "reason": "The central contribution is a jointly trained architecture combining a parameterized quantum circuit with a classical feedforward neural network." }, { "label": "Topological Phases", "reason": "The method targets nonlocal signatures of topological quantum phases that lack conventional local order parameters." }, { "label": "Superconducting Hardware", "reason": "Training and inference are performed with superconducting quantum processors in the optimization loop, demonstrating hardware-efficient implementation." } ], "emoji": "🧠", "social_summary": "Combine quantum circuits and classical nets to classify topological surface code phases on real hardware, robustly distinguishing ground states from product states with high accuracy.", "highlights_oneliner": "Hybrid neural networks recognize surface code phases" } ] }, "2026-06-26": { "word_cloud": [ { "word": "LDPC", "weight": 5 }, { "word": "Surface", "weight": 5 }, { "word": "Decoders", "weight": 5 }, { "word": "Subsystem", "weight": 4 }, { "word": "Transversal", "weight": 4 }, { "word": "Magic", "weight": 4 }, { "word": "Catalyst", "weight": 4 }, { "word": "Topological", "weight": 5 }, { "word": "Spin", "weight": 3 }, { "word": "Bicycle", "weight": 3 }, { "word": "AG", "weight": 3 }, { "word": "Lattice", "weight": 4 }, { "word": "Transformer", "weight": 4 }, { "word": "Dyadic", "weight": 3 }, { "word": "Gauge", "weight": 3 } ], "social_highlights": "Highlights: high-rate girth-8 quantum LDPC, transversal non-Clifford quantum group codes, scalable foundation decoders, reusable dyadic phase catalysts, and anticommuting topological subsystem codes.", "papers": [ { "arxiv_id": "2606.27130", "title": "Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts", "authors": "Koki Okada, Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2606.27130", "pdf_url": "https://arxiv.org/pdf/2606.27130.pdf", "summary": "This paper constructs a high-rate $2/3$ quantum LDPC CSS code from a $(3,18)$-regular two-branch finite-field base combined with a circulant-permutation-matrix lift of degree $P=101$, yielding parameters $[[34542,23032,d\\le 310]]$. The Tanner graphs of $H_X$ and $H_Z$ separately have girth $8$, and decoder experiments using log-likelihood-ratio joint belief propagation with deterministic post-processing show no failures in $10^8$ trials at physical error rate $p=0.01$ and estimate a finite-length transition near $p=0.029$.", "motivation": "Quantum LDPC codes are central to reducing overhead in fault-tolerant architectures compared with low-rate surface-code-style layouts, but explicit finite-length, high-rate constructions with strong decoding performance remain scarce. This work provides a concrete, structurally controlled CSS LDPC code that simultaneously achieves sparsity, exact orthogonality, large girth, and excellent finite-length decoder performance, informing constant-overhead fault-tolerant quantum computation.", "highlights": [ "Constructs $(3,18)$-regular CSS LDPC code with $[[34542,23032,d\\le 310]]$", "Achieves Tanner-graph girth $8$ for both $H_X$ and $H_Z$", "Demonstrates no logical failures in $10^8$ trials at $p=0.01$ with LLR BP and post-processing" ], "keywords": [ { "label": "QLDPC", "reason": "Central object is a $(3,18)$-regular quantum LDPC CSS code with high rate and large blocklength." }, { "label": "CSS", "reason": "The construction explicitly produces a Calderbank-Shor-Steane code with exact $H_X H_Z^T=0$ orthogonality." }, { "label": "Girth", "reason": "Design enforces same-type Tanner graph girth $8$ to mitigate short cycles in belief-propagation decoding." }, { "label": "Belief", "reason": "Decoder performance is studied using log-likelihood-ratio joint belief propagation with deterministic post-processing." } ], "emoji": "📐", "social_summary": "Introduce a structured high-rate quantum LDPC CSS code with girth 8 and strong BP decoding, advancing explicit designs for low-overhead fault-tolerant architectures.", "highlights_oneliner": "High-rate girth-8 quantum LDPC construction" }, { "arxiv_id": "2606.27211", "title": "Quantum group codes for non-Clifford logic: enhanced decoding, addressability and parallelizability", "authors": "Jean Gasnier, Virgile Guémard", "arxiv_url": "https://arxiv.org/abs/2606.27211", "pdf_url": "https://arxiv.org/pdf/2606.27211.pdf", "summary": "This work introduces quantum group codes, a class of quantum CSS codes built from classical quasi group codes that support transversal multi-control-$Z$ gates which are both addressable and parallelizable, enabling efficient logical non-Clifford circuits. Using a lifting procedure for classical algebraic-geometry codes based on class field theory, the authors construct good quantum group codes over alphabet $\\mathbb{F}_{q^2}$ with transversal $\\mathsf{C}^m\\mathsf{Z}$ and addressable, parallelizable $\\mathsf{C}^{m-1}\\mathsf{Z}$ gates, together with a quasi-quadratic time decoder of linear decoding radius that improves on previous cubic-time decoding for quantum AG codes.", "motivation": "Existing fault-tolerant schemes suffer large space-time overhead and rely heavily on magic-state distillation, motivating codes that natively support non-Clifford transversal gates at higher levels of the Clifford hierarchy. By relaxing LDPC constraints and leveraging algebraic-geometry structures, this work advances non-LDPC quantum codes that offer improved computational capabilities, decoding complexity, and circuit-level efficiency for magic-state distillation and non-Clifford logic.", "highlights": [ "Defines quantum group codes from quasi group codes supporting transversal multi-control-$Z$", "Applies class-field-theory-based lifting of AG codes to obtain good quantum group codes over $\\mathbb{F}_{q^2}$", "Provides quasi-quadratic time decoder with linear radius, improving on cubic-time decoders for quantum AG codes" ], "keywords": [ { "label": "Group", "reason": "Quantum group codes arise from classical quasi group codes and underpin the transversal gate structure." }, { "label": "Transversal", "reason": "The codes support transversal $\\mathsf{C}^m\\mathsf{Z}$ and addressable, parallelizable $\\mathsf{C}^{m-1}\\mathsf{Z}$ gates for non-Clifford logic." }, { "label": "AG", "reason": "Algebraic-geometry codes and their lifts via class field theory are the core tool for constructing these quantum codes." }, { "label": "Decoding", "reason": "A quasi-quadratic time decoder with linear decoding radius reduces complexity compared to previous cubic-time AG decoders." } ], "emoji": "✨", "social_summary": "Design quantum group codes with transversal multi-control Z gates and faster decoding, cutting the cost of non-Clifford logic and magic-state distillation.", "highlights_oneliner": "Transversal non-Clifford quantum group codes" }, { "arxiv_id": "2606.27119", "title": "Efficient foundation decoders for fault-tolerant quantum computing", "authors": "Ge Yan, Shanchuan Li, Shiyi Xiao, Pengyue Ma, Hanyan Cao, Feng Pan, Yuxuan Du", "arxiv_url": "https://arxiv.org/abs/2606.27119", "pdf_url": "https://arxiv.org/pdf/2606.27119.pdf", "summary": "The paper proposes neural transfer unification (NTU), a unified transfer-learning framework that aligns decoding tasks across code distances via algebraic scale-invariant structures in scalable code families, enabling efficient construction of high-capacity foundation decoders. Instantiated as NTU-Transformer for planar surface codes under circuit-level noise and bivariate bicycle codes, the approach outperforms correlation-aware matching on the $[[361,1,19]]$ code, scales to $[[625,1,25]]$ surpassing standard matching through transfer adaptation, and exceeds Relay-BP for the $[[72,12,6]]$ bivariate bicycle code in the low-physical-error regime.", "motivation": "As code distance grows, foundation decoders face steep scaling in syndrome generation and neural optimization, threatening practicality for large-scale fault-tolerant processors. By exploiting scale invariance and reusing knowledge across distances, this work shifts neural decoding from distance-specific training to amortized, reusable foundation decoders, pointing toward scalable, potentially real-time decoding for diverse quantum LDPC and topological code families.", "highlights": [ "Introduces NTU to align decoding across code distances using shared algebraic structures", "Implements NTU-Transformer that beats correlation-aware matching on surface code $[[361,1,19]]$ and scales to $[[625,1,25]]$", "Demonstrates improved performance over Relay-BP for bivariate bicycle code $[[72,12,6]]$ in low-error regime" ], "keywords": [ { "label": "Transformer", "reason": "A transformer-based neural architecture, NTU-Transformer, realizes the NTU framework for QEC decoding." }, { "label": "Surface", "reason": "Planar surface codes under circuit-level noise are a main testbed, including codes $[[361,1,19]]$ and $[[625,1,25]]$." }, { "label": "Bicycle", "reason": "Bivariate bicycle codes such as $[[72,12,6]]$ are another target family where NTU improves over Relay-BP." }, { "label": "Transfer", "reason": "Neural transfer unification reuses decoding knowledge across code distances to overcome scaling barriers." } ], "emoji": "📚", "social_summary": "Unify neural decoders across code distances with NTU-Transformer, boosting surface and bicycle code performance while slashing training costs for scalable fault-tolerant quantum processors.", "highlights_oneliner": "Cross-distance neural foundation decoders" }, { "arxiv_id": "2606.27358", "title": "Cultivating logical catalysts for fault-tolerant dyadic phase rotations", "authors": "Yichen Xu, Xiao Wang", "arxiv_url": "https://arxiv.org/abs/2606.27358", "pdf_url": "https://arxiv.org/pdf/2606.27358.pdf", "summary": "This paper introduces a surface-code cultivation protocol for reusable logical catalyst states that implement exact fine dyadic phase gates $Z^{2^{-b}}$ via phase kickback, using catalysts that are eigenstates of high-period Clifford circuits $U$ supported on $O(2^b)$ logical qubits. As a concrete example, the authors construct a catalyst for $\\sqrt{T}=Z^{1/8}$ using a nine-qubit brickwork Clifford circuit, cultivating it from nine distance-$3$ rotated-surface-code blocks through logical-$U$ checks, syndrome extraction, postselection, code growth, and complementary-gap decoding, achieving leading error-corrected scaling with a single verification round and demonstrating distance-$7$ growth with logical leakage rate $\\sim 10^{-6}$ at physical error rate $p=10^{-3}$ in around seven expected attempts.", "motivation": "Standard magic-state protocols for single-qubit non-Clifford gates require repeated logical checks and incur approximation errors and growing online depth with target accuracy. By trading offline, phase-specific catalyst cultivation for exactness, reusability, and constant online non-Clifford depth, this work offers a new route to implementing fixed fine dyadic phases in surface-code architectures with restricted transversal gate sets.", "highlights": [ "Introduces reusable logical catalyst states for exact dyadic phase gates $Z^{2^{-b}}$ via phase kickback", "Constructs a $\\sqrt{T}=Z^{1/8}$ catalyst from nine distance-$3$ rotated-surface-code blocks using a brickwork Clifford circuit", "Shows single-round verification achieves leading scaling and grows the catalyst to distance-$7$ with leakage $\\sim 10^{-6}$ at $p=10^{-3}$" ], "keywords": [ { "label": "Catalyst", "reason": "Reusable logical catalyst states central to implementing exact dyadic phase rotations by phase kickback." }, { "label": "Surface", "reason": "The protocol is designed for rotated surface-code blocks and surface-code-based fault-tolerant architectures." }, { "label": "Dyadic", "reason": "Targets fine dyadic phase gates $Z^{2^{-b}}$ such as $\\sqrt{T}=Z^{1/8}$ as fixed non-Clifford resources." }, { "label": "Kickback", "reason": "Phase kickback from controlled-$U$ gadgets is the mechanism used to apply the logical dyadic phase." } ], "emoji": "🔮", "social_summary": "Cultivate reusable surface-code catalyst states for exact dyadic phase rotations, enabling constant-depth non-Clifford gates like square-root T with strong fault tolerance.", "highlights_oneliner": "Reusable dyadic phase catalyst states" }, { "arxiv_id": "2606.26226", "title": "Toric code made subsystem: a framework for topological subsystem codes using anticommuting quantum spin liquids", "authors": "Vaibhav Sharma, Sumiran Pujari", "arxiv_url": "https://arxiv.org/abs/2606.26226", "pdf_url": "https://arxiv.org/pdf/2606.26226.pdf", "summary": "The authors present a framework for constructing topological subsystem codes from anticommuting quantum spin liquid models that can be viewed as spatial modifications of the toric code, replacing stabilizer-code structure with an extensive set of anticommuting local conserved operators that generate massive ground-state degeneracy as subsystem degrees of freedom. They introduce anticommuting charge (ACC) codes where the underlying many-body topological order ensures topological properties, and provide detailed square-lattice and kagome-lattice examples requiring weight-$4$ and weight-$3$ local check measurements, respectively, featuring an extensive number of local gauge qubits undisturbed by check operators.", "motivation": "Subsystem codes and topological stabilizer codes each offer distinct advantages for fault-tolerant architectures, but combining their strengths while retaining locality and hardware compatibility is challenging. By leveraging anticommuting quantum spin liquids to engineer topological subsystem codes with flexible lattice geometries and undisturbed gauge-qubit sectors, this work opens a new ACC code family that may enhance encoding rates, thresholds, and hardware adaptability.", "highlights": [ "Defines anticommuting charge (ACC) topological subsystem codes from anticommuting quantum spin liquids", "Constructs explicit square-lattice and kagome-lattice ACC codes with weight-$4$ and weight-$3$ check operators", "Highlights extensive local gauge qubits left undisturbed by check operators, forming a new gauge sector" ], "keywords": [ { "label": "Subsystem", "reason": "The proposed codes encode information in subsystems, combining subsystem-code features with topological order." }, { "label": "Toric", "reason": "Constructions are spatial modifications of the toric code, inheriting many-body topological order." }, { "label": "Spin", "reason": "Anticommuting quantum spin liquid models provide the physical and mathematical basis for ACC codes." }, { "label": "Gauge", "reason": "An extensive set of local gauge qubits remains undisturbed by check operators, defining the subsystem structure." } ], "emoji": "🌀", "social_summary": "Build a new family of anticommuting charge topological subsystem codes from quantum spin liquids, blending toric-style order with rich gauge sectors on flexible lattices.", "highlights_oneliner": "Anticommuting topological subsystem ACC codes" } ] }, "2026-06-25": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "LDPC", "weight": 4 }, { "word": "Decoder", "weight": 5 }, { "word": "Threshold", "weight": 5 }, { "word": "Topology", "weight": 4 }, { "word": "Majorana", "weight": 4 }, { "word": "Toric", "weight": 4 }, { "word": "Fermionic", "weight": 4 }, { "word": "Routing", "weight": 4 }, { "word": "Magic", "weight": 4 }, { "word": "Mitigation", "weight": 4 }, { "word": "Readout", "weight": 4 }, { "word": "MPO", "weight": 3 }, { "word": "Bicycle", "weight": 3 }, { "word": "Transformer", "weight": 3 } ], "social_highlights": "Highlights: high-rate STAR simulation architecture with bicycle codes, Majorana-Pauli stabilizers for fermionic phases, tensor-network readout mitigation, parallel hardware-friendly routing codes, and evolutionary search for higher-distance fermion encodings.", "papers": [ { "arxiv_id": "2606.25011", "title": "Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation", "authors": "Refaat Ismail, Milan Kornjača, Hong-Ye Hu, Nishad Maskara, Sheng-Tao Wang, Hengyun Zhou, Chen Zhao", "arxiv_url": "https://arxiv.org/abs/2606.25011", "pdf_url": "https://arxiv.org/pdf/2606.25011.pdf", "summary": "The paper introduces a high-rate STAR architecture for fault-tolerant local-lattice Hamiltonian simulation that co-designs the algorithm, QEC code, and neutral-atom hardware. It uses translation symmetries to select tunable self-dual bivariate bicycle codes, enabling transversal logical Clifford operations and parallel STAR injections across all $k$ logical qubits in a block.", "motivation": "Fault-tolerant simulation requires reducing encoding, Clifford, and synthesis overhead together rather than optimizing them separately. The work matters because high-rate codes can substantially lower the qubit cost of early FTQC while preserving the STAR-style advantage for small-angle rotations.", "highlights": [ "High-rate STAR architecture for local Hamiltonian simulation", "Bicycle codes enable parallel STAR injections", "8x8 Ising simulation at about 2240 qubits" ], "keywords": [ { "label": "STAR", "reason": "Core fault-tolerant simulation framework optimized for rotation-state preparation and low synthesis overhead." }, { "label": "Bicycle", "reason": "Code family used to obtain a tunable high-rate self-dual lattice code structure." }, { "label": "Neutral atoms", "reason": "Target hardware whose translation symmetries map to low-depth native operations." }, { "label": "Hamiltonian", "reason": "Application domain driving the resource estimates and architecture design." } ], "emoji": "✨", "social_summary": "Designs a high-rate STAR stack that combines bicycle codes and neutral-atom symmetry to cut the qubit cost of fault-tolerant simulation.", "highlights_oneliner": "High-rate parallel STAR simulation" }, { "arxiv_id": "2606.25048", "title": "Majorana-Pauli stabilizer codes and duality webs of fermionic topological phases", "authors": "Meng Sun, Zongyuan Wang, Nathanan Tantivasadakarn, Yu-An Chen", "arxiv_url": "https://arxiv.org/abs/2606.25048", "pdf_url": "https://arxiv.org/pdf/2606.25048.pdf", "summary": "The paper defines Majorana-Pauli stabilizer codes, extending stabilizer-code constructions to intrinsically fermionic lattice models with stabilizers built from generalized Pauli operators and Majorana operators. Using this framework, it constructs an exact fermionic toric code realization and derives anyons, fusion, and braiding directly from the stabilizer algebra.", "motivation": "Bosonic topological orders already have elegant exact stabilizer descriptions, but fermionic topological phases have lacked a comparably systematic one. This matters because a common stabilizer language can connect fermionic phases, dualities, and error-correcting code structure in a unified way.", "highlights": [ "Majorana-Pauli stabilizer formalism for fermions", "Exact stabilizer realization of fermionic toric code", "Extends to supercohomology fermionic SPTs" ], "keywords": [ { "label": "Majorana", "reason": "Fermionic operator ingredient that extends stabilizers beyond purely Pauli generators." }, { "label": "Toric", "reason": "Main exactly solvable example realized as a fermionic topological order." }, { "label": "Duality", "reason": "Web of anyon condensation and gauging relations connecting phases." }, { "label": "Supercohomology", "reason": "Class of fermionic SPT phases covered by the construction." } ], "emoji": "🧩", "social_summary": "Extends stabilizer codes to fermionic phases, deriving an exact fermionic toric code and a broad duality web of topological orders.", "highlights_oneliner": "Fermionic stabilizers and dualities" }, { "arxiv_id": "2606.25974", "title": "Tensor network characterization and mitigation of readout errors", "authors": "Yuchen Guo, Shuo Yang", "arxiv_url": "https://arxiv.org/abs/2606.25974", "pdf_url": "https://arxiv.org/pdf/2606.25974.pdf", "summary": "The paper presents a unified tensor-network framework that models correlated readout noise as a matrix product operator and trains it by likelihood optimization on calibration data. The learned MPO is then used for mitigation in nonlocal estimation, sampling, shadows, tomography, and can be combined with two-dimensional tensor-network QEC decoders through joint inference.", "motivation": "Readout errors are a major bottleneck in near-term experiments, and uncorrelated correction models miss spatial correlations from crosstalk and hardware-specific measurement effects. The work matters because scalable mitigation of correlated readout noise is essential for reliable data extraction in NISQ and decoder-assisted settings.", "highlights": [ "MPO model for correlated readout noise", "Likelihood training from calibration data", "Joint inference with QEC decoders in 2D" ], "keywords": [ { "label": "MPO", "reason": "Tensor-network representation used to model correlated measurement noise efficiently." }, { "label": "Readout", "reason": "Noise source targeted by the characterization and mitigation framework." }, { "label": "Mitigation", "reason": "Primary task improved by the learned correlated-noise model." }, { "label": "Calibration", "reason": "Data source used to fit the MPO likelihood model." } ], "emoji": "📚", "social_summary": "Builds an MPO-based framework to learn and mitigate correlated readout noise, with scalable inference and decoder integration.", "highlights_oneliner": "Tensor-network readout mitigation" }, { "arxiv_id": "2606.25330", "title": "Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity", "authors": "Jiaxuan Zhang, Zhao-Yun Chen, Peng Duan, Jia-Ning Li, Tian-Hao Wei, Qing-Yang Hou, Wei-Cheng Kong, Yu-Chun Wu, Guo-Ping Guo", "arxiv_url": "https://arxiv.org/abs/2606.25330", "pdf_url": "https://arxiv.org/pdf/2606.25330.pdf", "summary": "The paper introduces routing codes, a new qLDPC family engineered to keep high encoding rates while reducing connectivity demands, non-local coupling length, and routing complexity. Explicit instances achieve parallel non-local couplings that simplify superconducting wiring and neutral-atom movement, while circuit-level simulations show roughly an $8\\times$ qubit-overhead reduction relative to surface codes at comparable logical error rates.", "motivation": "High-rate qLDPC codes often assume idealized all-to-all hardware, which obscures the cost of realistic connectivity and wiring constraints. This work matters because practical fault tolerance depends not only on code parameters but also on whether the code can be routed and implemented efficiently on real devices.", "highlights": [ "High-rate qLDPC family with routing constraints", "Parallel non-local couplings eliminate wire crossings", "About 8x lower qubit overhead than surface codes" ], "keywords": [ { "label": "LDPC", "reason": "Main code class whose practical implementation is improved by the routing construction." }, { "label": "Routing", "reason": "Core design principle that shapes connectivity and coupling paths." }, { "label": "Parallel", "reason": "Distinctive hardware feature that removes coupling crossings and scheduling bottlenecks." }, { "label": "Superconducting", "reason": "Primary platform motivating wiring and crosstalk constraints." } ], "emoji": "🛠️", "social_summary": "Introduces routing codes that keep qLDPC rates high while making long-range couplings shorter, parallel, and hardware-friendly.", "highlights_oneliner": "Parallel hardware-friendly LDPCs" }, { "arxiv_id": "2606.25870", "title": "Evolving Quantum Error-Correcting Encodings for Molecular Simulation", "authors": "Kenny Heitritter, James Brown, Tarini Hardikar", "arxiv_url": "https://arxiv.org/abs/2606.25870", "pdf_url": "https://arxiv.org/pdf/2606.25870.pdf", "summary": "The paper studies LLM-driven evolutionary program synthesis as a design tool for fermion-to-qubit encodings, using an external verifier to score candidate constructors. Applied to generalized superfast encoding, the search discovers interpretable encodings with exact code distance $5$ on tested molecules and distance $6$ on one $20$-mode instance, plus a later circulant family with a five-qubits-per-mode floor on several instances.", "motivation": "Encoding design for molecular simulation involves many coupled discrete choices that are difficult to optimize by hand. The work matters because search-driven synthesis can discover structured encodings beyond known distance limits while keeping correctness grounded in an exact verifier.", "highlights": [ "LLM-guided search for fermion encodings", "Exact distance 5 and 6 on tested molecules", "Five-qubits-per-mode floor with circulant family" ], "keywords": [ { "label": "GSE", "reason": "Encoding family targeted by the evolutionary search." }, { "label": "Distance", "reason": "Main correctness metric improved beyond prior molecular constructions." }, { "label": "Circulant", "reason": "Structured constructor family discovered in the second search." }, { "label": "Verifier", "reason": "Exact scoring loop that filters and certifies candidate programs." } ], "emoji": "🧬", "social_summary": "Uses LLM-guided evolutionary search to discover higher-distance fermion encodings for molecular simulation with exact verification.", "highlights_oneliner": "Evolutionary fermion encoding search" } ] }, "2026-06-24": { "word_cloud": [ { "word": "Syndrome", "weight": 5 }, { "word": "Surface", "weight": 4 }, { "word": "GKP", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "Decoding", "weight": 5 }, { "word": "Magic", "weight": 4 }, { "word": "Cat", "weight": 4 }, { "word": "Factory", "weight": 3 }, { "word": "Photonic", "weight": 4 }, { "word": "Reconciliation", "weight": 4 }, { "word": "Repetition", "weight": 4 }, { "word": "Threshold", "weight": 4 }, { "word": "Latency", "weight": 3 }, { "word": "Nonisometric", "weight": 2 } ], "social_highlights": "Highlights: adaptive syndrome skipping in surface-$GKP$ codes, LLM-driven discovery of $qLDPC$ families, compact $CCZ$ factory design, picosecond cat-state generation, speculative window decoder analysis, ultra-low-rate reconciliation trade-offs", "papers": [ { "arxiv_id": "2606.24469", "title": "When to Skip Syndrome Extraction in Surface-GKP Codes", "authors": "Vaughn Sohn, Changhun Oh", "arxiv_url": "https://arxiv.org/abs/2606.24469", "pdf_url": "https://arxiv.org/pdf/2606.24469.pdf", "summary": "This paper proposes an adaptive skipping scheme for surface-$GKP$ codes that decides each round whether to measure both, one, or neither set of outer-code stabilizers. The decision uses analog reliability information from inner $GKP$ correction to compare the value of reusing prior syndromes against performing fresh noisy extraction. Circuit-level simulations show that the method can reduce measurement overhead while maintaining logical error rates comparable to or better than full measurement.", "motivation": "Repeated syndrome extraction is standard because single-round syndromes are ambiguous when extraction itself is noisy, but it adds substantial gate, ancilla, and time overhead. The work matters because bosonic architectures make high-fidelity ancilla preparation expensive, so reducing unnecessary extraction can directly lower total noise and resource cost.", "highlights": [ "Adaptive four-action syndrome policy", "Fewer stabilizer measurements than baseline", "Comparable or lower logical error rates" ], "keywords": [ { "label": "Surface-GKP", "reason": "The code family targeted by the adaptive syndrome-skipping strategy." }, { "label": "Syndrome", "reason": "The paper optimizes when to extract, reuse, or skip syndrome data." }, { "label": "Ancilla", "reason": "GKP ancilla consumption is a major resource bottleneck being reduced." }, { "label": "Reliability", "reason": "Decision-making is based on competing reliability estimates from analog information." } ], "emoji": "🧭", "social_summary": "Adaptive skipping uses inner $GKP$ analog data to cut surface-code measurement overhead without sacrificing logical performance.", "highlights_oneliner": "Skip less, measure smarter" }, { "arxiv_id": "2606.24808", "title": "Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution", "authors": "Zidu Liu, Florian Marquardt", "arxiv_url": "https://arxiv.org/abs/2606.24808", "pdf_url": "https://arxiv.org/pdf/2606.24808.pdf", "summary": "This paper introduces structured concept evolution, a search framework that combines a large language model with an algebraic mutation grammar to discover lifted-product $qLDPC$ code families. The method evolves structured concepts rather than raw code designs, varying group algebra, protograph geometry, and base space to generate competitive CSS constructions. The authors report a diverse set of codes, including abelian and non-abelian families, benchmarked under code-capacity depolarizing noise with $BP+OSD$ decoding.", "motivation": "Designing good $qLDPC$ codes is a difficult discrete search problem because promising families must balance sparsity, rate, and distance while remaining structurally valid. This matters because scalable fault-tolerant quantum computing needs code families that improve beyond conventional surface-code-style overheads.", "highlights": [ "LLM-guided code evolution framework", "Discovers lifted-product families", "Finds competitive non-abelian constructions" ], "keywords": [ { "label": "qLDPC", "reason": "The target family of sparse high-rate quantum codes." }, { "label": "LLM", "reason": "Large language models are used as the search engine." }, { "label": "Lifted", "reason": "Lifted-product codes are the discovered construction class." }, { "label": "Protograph", "reason": "Protograph geometry is one mutation axis in the search grammar." } ], "emoji": "🧠", "social_summary": "Structured concept evolution lets a language model discover new $qLDPC$ code families beyond standard designs.", "highlights_oneliner": "LLM-designed quantum LDPC codes" }, { "arxiv_id": "2606.24170", "title": "Low Spatial Cost CCZ Magic State Factory", "authors": "Sungyeon Kook, Yujin Kang, Ilkwon Sohn, Jun Heo", "arxiv_url": "https://arxiv.org/abs/2606.24170", "pdf_url": "https://arxiv.org/pdf/2606.24170.pdf", "summary": "This paper presents a design framework that reconstructs gate-based distillation as compact joint-measurement architectures implementable with the surface code. Using an eight-to-three $CCZ$ distillation protocol, the authors reduce the required surface-code patch footprint while preserving the single-fault-detection property and leading-order error suppression. They also show how the same approach can extend to $T$-state factories and other multiqubit resource-state factories.", "motivation": "Non-Clifford resource generation is a major bottleneck in fault-tolerant quantum computing because algorithms such as factoring and quantum chemistry require many costly resource states. The work matters because surface-code layouts strongly affect qubit count, and reducing factory area can lower the dominant hardware cost of large-scale computation.", "highlights": [ "Compact surface-code CCZ factory", "Preserves single-fault detection", "Cuts spatial cost substantially" ], "keywords": [ { "label": "CCZ", "reason": "The resource state being distilled and optimized." }, { "label": "Factory", "reason": "The paper redesigns magic-state factory layout and cost." }, { "label": "Surface", "reason": "The construction is implemented in surface-code hardware." }, { "label": "Lattice", "reason": "The patch-level geometry is central to the compact design." } ], "emoji": "✨", "social_summary": "Recasting $CCZ$ distillation as joint measurements yields a smaller surface-code factory with the same core error-detection structure.", "highlights_oneliner": "Smaller CCZ factory layout" }, { "arxiv_id": "2606.24002", "title": "Picosecond Schrödinger cat states for ultrafast optical quantum processing", "authors": "Mamoru Endo, Kan Takase, Takefumi Nomura, Tatsuki Sonoyama, Kazuma Takahashi, Sachiko Takasu, Daiji Fukuda, Takahiro Kashiwazaki, Asuka Inoue, Takeshi Umeki, Peter van Loock, Petr Marek, Radim Filip, Warit Asavanant, Akira Furusawa", "arxiv_url": "https://arxiv.org/abs/2606.24002", "pdf_url": "https://arxiv.org/pdf/2606.24002.pdf", "summary": "This paper demonstrates multi-photon generalized photon subtraction in picosecond optical wave packets, addressing the temporal-mode bottleneck that limits non-Gaussian state-generation rates. The experiment uses photon-number-resolving detection and pulsed homodyne characterization matched to $10$-ps modes at a $5$-MHz pump rate, reconstructing Wigner functions with up to four negative regions for four-photon heralding. The resulting effective cat-state amplitude reaches $\\alpha_{\\mathrm{eff}}=1.69$, which is relevant for cat-code and breeding-based optical architectures.", "motivation": "Universal fault-tolerant optical quantum computing requires non-Gaussian states, but their generation has been slowed by low heralding probabilities and long temporal modes. This work matters because faster temporal modes directly raise the achievable resource rate for scalable photonic processing.", "highlights": [ "Picosecond cat-state generation", "Up to four Wigner negatives", "Effective cat amplitude $1.69$" ], "keywords": [ { "label": "Cat", "reason": "Schrödinger cat states are the central non-Gaussian resource." }, { "label": "Photonic", "reason": "The experiment is an optical quantum-processing platform." }, { "label": "Heralding", "reason": "Photon-number-resolved heralding enables state preparation." }, { "label": "Temporal", "reason": "Picosecond temporal modes remove the rate bottleneck." } ], "emoji": "🐱", "social_summary": "Generates picosecond cat states that push optical quantum processing toward higher-rate, scalable non-Gaussian resources.", "highlights_oneliner": "Picosecond optical cat states" }, { "arxiv_id": "2606.24048", "title": "An Analysis of Speculative Window Decoders for Quantum Error Correction", "authors": "Jocelyn Li, Margaret Martonosi", "arxiv_url": "https://arxiv.org/abs/2606.24048", "pdf_url": "https://arxiv.org/pdf/2606.24048.pdf", "summary": "This paper analyzes speculative window decoding as a performance optimization for real-time decoding in fault-tolerant quantum computing. It evaluates how slower gate speeds, speculation accuracy, decoder latency, processor count, and workload parallelism affect throughput across different quantum technologies and decoding regimes. The work identifies design principles for when speculation helps most and when non-speculative decoding is preferable.", "motivation": "Real-time decoding is a key requirement for fault-tolerant quantum computers because decoding latency can bottleneck the entire error-correction loop. The paper matters because prior speculative-decoding studies were narrow in scope, mostly focused on fast superconducting systems, surface codes, and matching decoders.", "highlights": [ "Analyzes speculative window decoding", "Studies slow-gate regimes", "Finds when non-speculative wins" ], "keywords": [ { "label": "Decoders", "reason": "The paper studies decoder performance and scheduling." }, { "label": "Speculation", "reason": "Speculative execution is the central performance idea." }, { "label": "Latency", "reason": "Decoder latency strongly shapes the trade-off being analyzed." }, { "label": "Throughput", "reason": "Performance gains are evaluated in terms of real-time throughput." } ], "emoji": "📚", "social_summary": "Analyzes speculative window decoding across hardware regimes to identify when faster prediction helps and when it does not.", "highlights_oneliner": "When speculative decoding pays" }, { "arxiv_id": "2606.23726", "title": "Ultra-Low-Rate Information Reconciliation: Repetition Coding or Dedicated Codes?", "authors": "Erdem Eray Cil, Laurent Schmalen", "arxiv_url": "https://arxiv.org/abs/2606.23726", "pdf_url": "https://arxiv.org/pdf/2606.23726.pdf", "summary": "This paper compares repetition-based ultra-low-rate information reconciliation with dedicated ultra-low-rate codes for $CV$-$QKD$. It shows that repetition coding offers a favorable performance-complexity trade-off, with only a moderate frame-error-rate penalty while reducing decoding complexity by about $2\\times$. The authors frame the result within multidimensional reconciliation and emphasize implementation-constrained operating points.", "motivation": "At low signal-to-noise ratios, $CV$-$QKD$ needs very efficient reconciliation to maintain secret-key extraction and range. The work matters because practical systems are often limited not only by error performance but by decoder throughput, latency, and hardware cost.", "highlights": [ "Repetition beats complexity limits", "Dedicated codes win FER", "Moderate FER penalty for $2\\times$ simpler decoding" ], "keywords": [ { "label": "Reconciliation", "reason": "The paper focuses on information reconciliation for $CV$-$QKD$." }, { "label": "Repetition", "reason": "Repetition-based schemes are the main baseline and proposal." }, { "label": "LDPC", "reason": "Dedicated low-rate LDPC codes are the competing design class." }, { "label": "Complexity", "reason": "Implementation complexity is a primary optimization criterion." } ], "emoji": "🔐", "social_summary": "Compares ultra-low-rate reconciliation options and shows repetition coding can be the better practical choice under implementation limits.", "highlights_oneliner": "Repetition vs dedicated codes" } ] }, "2026-06-23": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "Decoding", "weight": 5 }, { "word": "Bosonic", "weight": 4 }, { "word": "Threshold", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "Cat", "weight": 4 }, { "word": "Dynamical", "weight": 4 }, { "word": "Mitigation", "weight": 4 }, { "word": "Concatenated", "weight": 4 }, { "word": "Holography", "weight": 3 }, { "word": "Decoupling", "weight": 4 }, { "word": "Bell", "weight": 3 }, { "word": "Postselection", "weight": 3 } ], "social_highlights": "Highlights: transformer decoders estimate thresholds and improve post-selection, Bunny codes exploit expanded superconducting gates, HLP reduces nonlocal couplings, RS-cat Bell measurement boosts fusion primitives, RL-LS improves QLDPC decoding, holographic proto-area tests nongeometry, three-layer FTQC architecture, arbitrary-dimension Hamming bound, symmetry-averaged virtual distillation, circuit replication profiling, finite-shot PEC-CDR windows, quantum advantage in tolerant junta testing, universal optimal tracking decoupling", "papers": [ { "arxiv_id": "2606.22194", "title": "Machine Learning Optimal Quantum Error Correction Thresholds", "authors": "Dominik Seip, Luis Colmenarez, Markus Schmitt, Markus Müller", "arxiv_url": "https://arxiv.org/abs/2606.22194", "pdf_url": "https://arxiv.org/pdf/2606.22194", "summary": "This paper connects coherent information ($CI$) to the binary cross-entropy loss used in training neural-network decoders, proving that $CI$ lower-bounds the achievable loss for decoders that track logical operators across noisy channels. The authors build a transformer-based maximum-likelihood decoder to estimate $CI$ and evaluate it on the surface code under code-capacity, phenomenological, and circuit-level noise, obtaining threshold estimates that match known limits and improved logical-error performance over minimum-weight perfect matching. They also introduce a confidence-based soft post-selection method and prove optimality for post-selection strategies based on $MLD$ cosets.", "motivation": "Quantum error correction thresholds mark the boundary where codes stop protecting information, so estimating them accurately is central to fault-tolerant design. The paper matters because it links an information-theoretic quantity to modern machine-learning training loss, creating a practical bridge between decoder optimization and threshold estimation.", "highlights": [ "CI lower-bounds decoder loss", "Transformer threshold estimates match theory", "Soft post-selection is proven optimal" ], "keywords": [ { "label": "Thresholds", "reason": "The core contribution is estimating optimal $QEC$ thresholds from learned decoders." }, { "label": "Transformers", "reason": "A transformer architecture is used as the neural decoder and estimator." }, { "label": "Coherent Info", "reason": "The paper establishes a direct link between $CI$ and decoder loss." }, { "label": "Surface Code", "reason": "Performance is benchmarked on the surface code under multiple noise models." } ], "emoji": "⚡", "social_summary": "Trains a transformer decoder to estimate threshold limits and deliver stronger surface-code decoding with optimal soft post-selection.", "highlights_oneliner": "Transformer thresholds for QEC" }, { "arxiv_id": "2606.22853", "title": "Bunny Codes: Broadening Superconducting Quantum Error Correction Capability through Advanced Control Engineering", "authors": "Runshi Zhou, Xingye Yuan, Linghang Kong, Fang Zhang, Kai Zhang, Zhaohui Yang, Jianxin Chen", "arxiv_url": "https://arxiv.org/abs/2606.22853", "pdf_url": "https://arxiv.org/pdf/2606.22853", "summary": "This work identifies translationally symmetric $qLDPC$ codes that can be executed on two-dimensional nearest-neighbor superconducting hardware by leveraging an expanded native two-qubit gate set, specifically $CNOT$ and $CXSWAP$. The authors exhaustively search for implementable syndrome-extraction circuits and find that the resulting Bunny codes preserve the performance of direct long-range implementations while reducing hardware complexity. Circuit-level simulations show weight-$6$ Bunny codes with improved code rate and, in some cases, logical error rates an order of magnitude below comparable toric codes.", "motivation": "Superconducting processors are limited by sparse connectivity, which has historically favored local codes such as the surface code. This paper matters because it shows that better control engineering and richer native gates can substitute for long-range couplers while enabling higher-rate $qLDPC$ codes.", "highlights": [ "Nearest-neighbor implementation of nonlocal stabilizers", "Weight-6 codes with higher rate than toric", "Circuit simulations show order-of-magnitude gains" ], "keywords": [ { "label": "qLDPC", "reason": "The codes are a class of low-density parity-check quantum codes." }, { "label": "Superconducting", "reason": "The proposal targets superconducting hardware constraints and gate sets." }, { "label": "CXSWAP", "reason": "The expanded native gate pool includes $CXSWAP$ alongside $CNOT$." }, { "label": "Syndrome", "reason": "The main engineering focus is efficient syndrome extraction circuits." } ], "emoji": "🐇", "social_summary": "Designs Bunny codes that fit superconducting nearest-neighbor hardware while preserving high-rate, low-logical-error performance.", "highlights_oneliner": "Bunny codes for superconducting hardware" }, { "arxiv_id": "2606.22594", "title": "Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses", "authors": "Zi-Han Chen, Ming-Cheng Chen, Chao-Yang Lu, Jian-Wei Pan", "arxiv_url": "https://arxiv.org/abs/2606.22594", "pdf_url": "https://arxiv.org/pdf/2606.22594", "summary": "The paper proposes the Hierarchical Logical Processor ($HLP$), which concatenates a high-rate $CSS$ code with the rotated surface code to reduce the frequency of long-range couplings needed for direct $qLDPC$ implementation. It introduces elongated rotated-surface-code patches called shuttle buses and uses transversal hybrid-unit $CNOT$ gates to couple one shuttle bus to multiple patches, enabling efficient level-1 syndrome extraction and parallel logical Pauli measurements. Circuit-level simulations show substantially better qubit efficiency, lower space overhead, and faster correction cycles than standard rotated-surface-code and yoked-surface-code baselines.", "motivation": "Direct $qLDPC$ implementations promise better encoding efficiency but usually require nonlocal couplings every round of syndrome extraction. The work matters because it provides a hierarchical architecture that keeps the advantages of high-rate codes while dramatically reducing the frequency of costly long-range operations.", "highlights": [ "Long-range couplings needed only every $\\Theta(d_0)$ rounds", "Shuttle buses enable parallel logical measurements", "Higher qubit efficiency and shorter cycles than baselines" ], "keywords": [ { "label": "HLP", "reason": "The main architecture introduced is the Hierarchical Logical Processor." }, { "label": "Shuttle", "reason": "Shuttle buses are the key geometric resource in the design." }, { "label": "Rotated", "reason": "The architecture is built around the rotated surface code." }, { "label": "Concatenation", "reason": "The scheme concatenates a high-rate code with a surface code." } ], "emoji": "🧱", "social_summary": "Builds a hierarchical processor that cuts nonlocal coupling frequency while boosting encoding efficiency and logical measurement throughput.", "highlights_oneliner": "Hierarchical processor with shuttle buses" }, { "arxiv_id": "2606.22832", "title": "Linear optical Bell state measurement for rotation-symmetric cat codes", "authors": "Issa Oe, Suguru Endo, Rui Asaoka", "arxiv_url": "https://arxiv.org/abs/2606.22832", "pdf_url": "https://arxiv.org/pdf/2606.22832", "summary": "The authors develop a Bell-state measurement ($BSM$) protocol for rotation-symmetric cat ($RS$-cat) codes using only a half beam splitter and photon-number-resolving detectors. By exploiting the modular photon-number structure of $RS$-cat states, the protocol extracts both number-modulo and phase information, becoming deterministic for sufficiently large amplitudes $\\alpha$ in the ideal loss-free limit. They numerically study photon loss, identify regimes where higher-order symmetry helps, and show that post-selection can improve success probability.", "motivation": "Efficient Bell-state measurement is a key primitive for long-distance quantum communication and fusion-based quantum computation. This paper matters because it offers a low-optical-complexity measurement protocol tailored to bosonic codes that are finite-energy and experimentally relevant.", "highlights": [ "Deterministic $BSM$ at large $\\alpha$", "Higher symmetry can help under loss", "Post-selection improves success probability" ], "keywords": [ { "label": "Cat Codes", "reason": "The protocol is specifically designed for rotation-symmetric cat codes." }, { "label": "Bell", "reason": "The central task is Bell-state measurement and discrimination." }, { "label": "Photon Loss", "reason": "Performance is analyzed under lossy optical channels." }, { "label": "Postselection", "reason": "The paper shows how post-selection boosts success rates." } ], "emoji": "🐱", "social_summary": "Demonstrates a low-complexity Bell measurement for rotation-symmetric cat codes using beam splitters, detectors, and post-selection.", "highlights_oneliner": "Bell measurement for cat codes" }, { "arxiv_id": "2606.20926", "title": "Learning-Based List Sequential Belief Propagation Decoding of Quantum LDPC Codes", "authors": "Mohsen Moradi, Taejoon Kim, Remi A. Chou", "arxiv_url": "https://arxiv.org/abs/2606.20926", "pdf_url": "https://arxiv.org/pdf/2606.20926", "summary": "This paper proposes a reinforcement-learning-based list sequential belief-propagation decoder ($RL$-$LS$ $BP$) for $QLDPC$ codes. The method extends learned sequential variable-node scheduling by keeping the main $RL$-$S$ decoding trajectory while also exploring a competing branch biased toward the second-most likely Pauli symbol, then ranking candidate trajectories with a cumulative path metric. Simulations on benchmark codes over the depolarizing channel show improved decoding performance over the base learned decoder and favorable comparison with existing $BP$-based methods.", "motivation": "Standard $BP$ struggles on $QLDPC$ codes because short cycles and degeneracy create convergence problems. The paper matters because it combines learned scheduling with list exploration to better resolve local ambiguities without abandoning the message-passing framework.", "highlights": [ "List search improves learned BP decoding", "Second-best Pauli branch is explored", "Benchmark performance beats standard BP variants" ], "keywords": [ { "label": "BP", "reason": "Belief propagation is the decoding backbone being improved." }, { "label": "Reinforcement", "reason": "The scheduling policy is learned by reinforcement learning." }, { "label": "List", "reason": "The decoder adds list-style branch exploration and pruning." }, { "label": "Depolarizing", "reason": "Results are reported on the depolarizing channel." } ], "emoji": "📚", "social_summary": "Combines reinforcement learning and list search to make belief-propagation decoding more robust on $QLDPC$ codes.", "highlights_oneliner": "List-enhanced learned BP decoding" }, { "arxiv_id": "2606.22598", "title": "Nonlinear Geometrizability of State-Dependent Proto-Area in Approximate Holographic Codes", "authors": "Ruiliang Li", "arxiv_url": "https://arxiv.org/abs/2606.22598", "pdf_url": "https://arxiv.org/pdf/2606.22598", "summary": "The paper studies whether state-dependent proto-area data from approximate recovery can be generated by a single local bulk metric, deriving exact finite-resolution criteria and near-$AdS_3$ necessary-and-sufficient conditions for regular proto-area two-jets to arise from metric two-jets. It frames the finite network case as a polyhedral realization problem with primal and dual certificates, and identifies the continuum tangent space as the range of a rank-two geodesic $X$-ray transform. The work also derives a metric-forced Jacobi equation and a gauge-invariant quadratic obstruction, showing how some codes realize first-order nongeometry or responses whose first obstruction is quadratic.", "motivation": "Holographic codes aim to recover bulk geometry from boundary data, but state dependence can create data that are not compatible with one metric. This paper matters because it sharpens the notion of when approximate recovery data are genuinely geometric versus intrinsically nongeometric.", "highlights": [ "Finite-resolution geometricity criteria are derived", "Quadratic obstruction detects nongeometry", "Metric perturbation reconstructed modulo diffeomorphisms" ], "keywords": [ { "label": "Holography", "reason": "The setting is approximate holographic coding and bulk reconstruction." }, { "label": "Proto-area", "reason": "The object studied is state-dependent proto-area data." }, { "label": "Geometry", "reason": "The paper tests whether data come from a single local metric." }, { "label": "Jacobi", "reason": "A Jacobi equation governs the nonlinear geometric response." } ], "emoji": "🌀", "social_summary": "Derives exact tests for when state-dependent proto-areas in holographic codes can come from a single local bulk metric.", "highlights_oneliner": "When proto-area becomes geometry" }, { "arxiv_id": "2606.22418", "title": "A Three-Layer Architecture for Fault-Tolerant Quantum Computing", "authors": "Zhirao Wang, Zhou You, Yiming Huang, Tianyi Li, Ying Li, Xiao Yuan, Yuan Yao", "arxiv_url": "https://arxiv.org/abs/2606.22418", "pdf_url": "https://arxiv.org/pdf/2606.22418", "summary": "This paper proposes a hardware-agnostic three-layer architectural framework for fault-tolerant quantum computing, modeled after classical computer architecture. The central $Fault$-$Tolerance$ layer mediates between application-level logical programs and hardware-level execution, and the authors characterize its five internal components, the interfaces among them, and the execution, correction, and adaptation paths needed for logical synthesis, resource management, decoding, and runtime control. An end-to-end example illustrates the workflow for fault-tolerant quantum algorithms within this unified abstraction.", "motivation": "Fault-tolerant quantum systems are becoming modular and heterogeneous, which makes cross-layer organization increasingly important. The paper matters because it provides a universal architecture rather than a hardware-specific protocol, helping standardize future system design.", "highlights": [ "Three-layer abstraction for FTQC", "Fault-Tolerance layer organizes control and decoding", "End-to-end pipeline example included" ], "keywords": [ { "label": "Architecture", "reason": "The paper is explicitly about a system-level architectural framework." }, { "label": "Control", "reason": "Runtime adaptation and execution control are central components." }, { "label": "Decoding", "reason": "The intermediate layer includes decoding and correction paths." }, { "label": "Resources", "reason": "Resource management is one of the core interfaces in the model." } ], "emoji": "🏛️", "social_summary": "Proposes a three-layer fault-tolerant architecture that unifies logical programs, decoding, resource management, and hardware execution.", "highlights_oneliner": "Three-layer FTQC architecture" }, { "arxiv_id": "2606.22538", "title": "The Quantum Hamming Bound in Arbitrary Local Dimension", "authors": "Yu-Xuan Zhang, Jing-Ling Chen", "arxiv_url": "https://arxiv.org/abs/2606.22538", "pdf_url": "https://arxiv.org/pdf/2606.22538", "summary": "The paper proves the finite-length quantum Hamming bound for exact subspace codes in arbitrary local dimension, resolving the nonbinary case for all $q\\ge3$. The argument reduces any possible violation to a two-center Hamming-ball intersection inequality normalized by the Lloyd response, then handles the $q\\ge4$ and qutrit boundary cases with a half-gap linear-programming argument and a quadratic-filtered certificate, respectively. The result shows that degeneracy can merge error sectors but cannot defeat the Hamming count.", "motivation": "The quantum Hamming bound is the sphere-packing limit underlying exact quantum error correction, and degeneracy has long been the obstruction in finite-length settings. This paper matters because it closes the nonbinary finite-length gap and gives a dimension-general theorem rather than a code-family-specific bound.", "highlights": [ "Nonbinary Hamming bound proven for all $q\\ge3$", "Two-center intersection reduction is central", "Degeneracy cannot violate the bound" ], "keywords": [ { "label": "Hamming", "reason": "The main theorem is the quantum Hamming bound." }, { "label": "Nonbinary", "reason": "The proof resolves the arbitrary local-dimension case." }, { "label": "Degeneracy", "reason": "The analysis addresses degeneracy as the key obstacle." }, { "label": "Sphere", "reason": "The argument is formulated as a sphere-packing problem." } ], "emoji": "📏", "social_summary": "Proves the quantum Hamming bound for arbitrary local dimension, closing the finite-length nonbinary gap.", "highlights_oneliner": "Hamming bound in all dimensions" }, { "arxiv_id": "2606.21962", "title": "Quantum Error Suppression via Symmetry-Averaged Virtual Distillation", "authors": "Canyu He, Chunhua Zeng, Ruyu Yang, Yongdan Yang", "arxiv_url": "https://arxiv.org/abs/2606.21962", "pdf_url": "https://arxiv.org/pdf/2606.21962", "summary": "The paper introduces symmetry-averaged virtual distillation ($SAVD$), which first averages symmetry-labeled implementations into a symmetry-averaged output ensemble and then applies virtual distillation to that ensemble. This preconditioning leaves the symmetry-invariant target contribution intact while averaging residual components across symmetry-related branches, thereby improving the spectral structure seen by $VD$. Numerical demonstrations on the isotropic Heisenberg chain show improved accuracy under both coherent algorithmic errors and hardware noise.", "motivation": "Near-term quantum simulation is limited by the coexistence of algorithmic approximation error and device noise, which are often treated separately. The paper matters because it combines symmetry handling and virtual distillation into a single state-level suppression pipeline.", "highlights": [ "Symmetry averaging precedes virtual distillation", "Residual branches are averaged at density-matrix level", "Heisenberg simulations show improved accuracy" ], "keywords": [ { "label": "Distillation", "reason": "Virtual distillation is the second-stage amplification method." }, { "label": "Symmetry", "reason": "Symmetry averaging is the protocol's key preconditioning step." }, { "label": "Mitigation", "reason": "The work is an error-suppression and mitigation framework." }, { "label": "Heisenberg", "reason": "Numerical tests are performed on the isotropic Heisenberg chain." } ], "emoji": "🧪", "social_summary": "Combines symmetry averaging with virtual distillation to suppress both algorithmic and hardware errors in quantum simulations.", "highlights_oneliner": "Symmetry-averaged virtual distillation" }, { "arxiv_id": "2606.20968", "title": "Profiling the Effective Limits of Error Mitigation via Circuit Replication", "authors": "Jeremie Pope, Swaroop Ghosh", "arxiv_url": "https://arxiv.org/abs/2606.20968", "pdf_url": "https://arxiv.org/pdf/2606.20968", "summary": "The paper studies circuit replication as a simple supplemental mitigation strategy under real-world noise profiles, using $QAOA$ for the Maxcut problem as the testbed. By profiling multiple replication counts, the authors find that replication can reduce output variability and stabilize inference strength, though the benefit depends strongly on graph size and workload depth. The work frames replication as a lightweight complement to more elaborate mitigation methods rather than a replacement for them.", "motivation": "Current-era quantum hardware is noisy and resource-constrained, making expensive mitigation methods hard to deploy broadly. This paper matters because it evaluates an overlooked, low-overhead technique and clarifies where it can still be practically useful.", "highlights": [ "Replication stabilizes noisy $QAOA$ outputs", "Benefits depend on graph size", "Useful as supplemental mitigation" ], "keywords": [ { "label": "Replication", "reason": "The central idea is repeating the circuit multiple times." }, { "label": "QAOA", "reason": "Maxcut via $QAOA$ is the experimental benchmark." }, { "label": "Maxcut", "reason": "The workload analyzed is the Maxcut optimization problem." }, { "label": "Noise", "reason": "Real-world noise profiles drive the study's conclusions." } ], "emoji": "🔁", "social_summary": "Profiles circuit replication and shows it can stabilize noisy $QAOA$ outputs as a lightweight mitigation aid.", "highlights_oneliner": "Replication as mitigation support" }, { "arxiv_id": "2606.21686", "title": "Finite-shot operating windows for probabilistic error cancellation and Clifford data regression", "authors": "Vicenzo Scavino", "arxiv_url": "https://arxiv.org/abs/2606.21686", "pdf_url": "https://arxiv.org/pdf/2606.21686", "summary": "This paper derives finite-shot mean-square-error boundaries for probabilistic error cancellation ($PEC$), Clifford data regression ($CDR$), and no mitigation for noisy Pauli-observable estimation. It proves that exact $PEC$ removes bias at the cost of quasi-probability variance overhead, while $CDR$ can win in a finite operating window but suffers a calibration floor from model mismatch; the window scales like $B_{PEC=CDR}(p)\\propto 1/(\\delta_1^2 p)$. The paper also proves a target-response projection theorem and supports the theory with closed-form two-qubit calculations and $QAOA$ simulations.", "motivation": "Choosing between mitigation schemes usually depends on both hardware noise and finite-shot sampling effects, but the boundary between methods is often unclear. This paper matters because it gives explicit performance regimes for $PEC$ and $CDR$ rather than treating mitigation quality as asymptotic or abstract.", "highlights": [ "Finite-shot MSE boundaries derived", "CDR has a finite dominance window", "Projection theorem explains calibration floors" ], "keywords": [ { "label": "PEC", "reason": "Probabilistic error cancellation is one of the two main methods analyzed." }, { "label": "CDR", "reason": "Clifford data regression is compared against $PEC$ and no mitigation." }, { "label": "Variance", "reason": "Finite-shot variance overhead is central to the analysis." }, { "label": "Calibration", "reason": "Mismatch in calibration sets the dominant operating window." } ], "emoji": "🎯", "social_summary": "Maps the finite-shot regimes where probabilistic error cancellation or Clifford data regression gives the best observable estimates.", "highlights_oneliner": "When PEC beats CDR" }, { "arxiv_id": "2606.23194", "title": "Quantum Advantage in Tolerant Junta Testing", "authors": "Avishay Tal, Weiqiang Yuan", "arxiv_url": "https://arxiv.org/abs/2606.23194", "pdf_url": "https://arxiv.org/pdf/2606.23194", "summary": "The paper proves the first super-polynomial quantum advantage for tolerant $k$-junta testing in the adaptive setting. It shows that tolerant junta testing near the $1/2$-noise regime can be solved with $\\mathrm{poly}(k)$ quantum queries, while any classical algorithm requires at least $k^{\\Omega(\\log k)}$ queries in the stated parameter range. The classical lower bound uses a new hard distribution built from an approximate-junta planted with an error-correcting-code structure.", "motivation": "Tolerant property testing is a central problem in theoretical computer science because it asks whether a function is close to a structured class rather than exactly inside it. The paper matters because it separates quantum and classical query complexity in a regime where the advantage is super-polynomial, not merely polynomial.", "highlights": [ "First super-polynomial quantum advantage", "Adaptive tolerant junta testing solved efficiently", "New code-based hard distribution for lower bounds" ], "keywords": [ { "label": "Junta", "reason": "The target property is tolerant $k$-junta testing." }, { "label": "Adaptive", "reason": "The quantum advantage is proven in the adaptive setting." }, { "label": "Queries", "reason": "The separation is in oracle query complexity." }, { "label": "Lower Bound", "reason": "A new classical lower-bound construction is developed." } ], "emoji": "🧠", "social_summary": "Proves a super-polynomial quantum advantage for tolerant junta testing using a poly$k$ quantum algorithm and a new classical lower bound.", "highlights_oneliner": "Quantum advantage for junta testing" }, { "arxiv_id": "2606.21762", "title": "Dynamical Decoupling using Universal Optimal Tracking", "authors": "Amit Devra, Emanuel Malvetti, Niklas J. Glaser, Abhishek Agarwal, Ivan Rungger, Santana Lujan, Max Werninghaus, Stefan Filipp, Leo Van Damme, Steffen J. Glaser", "arxiv_url": "https://arxiv.org/abs/2606.21762", "pdf_url": "https://arxiv.org/pdf/2606.21762", "summary": "The paper introduces a universal optimal-tracking framework for designing dynamical decoupling ($DD$) sequences that is state-independent and dynamically compensates residual block errors. By monitoring the qubit evolution at predefined waypoints, the method constructs non-periodic pulse schedules that preserve refocusing while suppressing error accumulation over long idle times. The authors combine $GRAPE$ and a genetic algorithm to optimize sequences and validate the approach experimentally on superconducting hardware, with additional simulations showing robustness to time-dependent noise.", "motivation": "Dynamical decoupling is one of the oldest and most widely used techniques for suppressing decoherence, but standard periodic sequences accumulate residual imperfections over long durations. The paper matters because it modernizes $DD$ design with an optimization framework that is both universal and practical across hardware platforms.", "highlights": [ "State-independent tracking improves $DD$ design", "Non-periodic sequences suppress accumulated errors", "Experimental superconducting validation reported" ], "keywords": [ { "label": "Decoupling", "reason": "The paper is centered on dynamical decoupling sequence design." }, { "label": "Tracking", "reason": "Optimal tracking is the key new control concept." }, { "label": "GRAPE", "reason": "Gradient-based optimization is used to refine sequences." }, { "label": "Superconducting", "reason": "The sequences are experimentally demonstrated on superconducting hardware." } ], "emoji": "🎛️", "social_summary": "Introduces universal optimal tracking for dynamical decoupling and validates robust non-periodic sequences on superconducting hardware.", "highlights_oneliner": "Optimal-tracking dynamical decoupling" } ] }, "2026-06-22": { "status": "no_arxiv" }, "2026-06-19": { "word_cloud": [ { "word": "LDPC", "weight": 5 }, { "word": "Surface", "weight": 5 }, { "word": "Decoder", "weight": 5 }, { "word": "Syndrome", "weight": 5 }, { "word": "Topology", "weight": 4 }, { "word": "Stabilizer", "weight": 5 }, { "word": "Chirality", "weight": 4 }, { "word": "Fracton", "weight": 4 }, { "word": "Metrology", "weight": 3 }, { "word": "Pauli", "weight": 4 }, { "word": "Trotter", "weight": 4 }, { "word": "Symmetry", "weight": 4 }, { "word": "Grid", "weight": 4 }, { "word": "Noise", "weight": 4 }, { "word": "Connectivity", "weight": 3 } ], "social_highlights": "Highlights: planar nearest-neighbour qLDPC memories, open-boundary vine codes on square grids, frontier-style approximate decoding, many-body chirality in stabilizer states, random qutrit codes without strings, space-group topological CSS codes, subsystem metrology codes, Pauli-propagation noise mitigation, VQE resource optimization, master-equation syndrome twins, symmetry-restored Trotter mitigation", "papers": [ { "arxiv_id": "2606.19482", "title": "Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid", "authors": "Boren Gu, Tamas Noszko, Vincent Steffan, Jens Niklas Eberhardt, Joschka Roffe, Jens Eisert, Stergios Koutsioumpas", "arxiv_url": "https://arxiv.org/abs/2606.19482", "pdf_url": "https://arxiv.org/pdf/2606.19482.pdf", "summary": "The paper introduces a family of qLDPC codes that combine planar open boundaries, finite-size advantages over surface codes, and syndrome extraction using only nearest-neighbour gates on a square grid. It uses dynamically generated check-data connectivity via nearest-neighbour iSWAP walks, yielding constant-depth stabilizer measurement independent of code size and intrinsic leakage removal by alternating check and data roles. The authors report strong finite-size instances such as a $[[323,14,15]]$ code and per-logical error-rate improvements of up to $1000\\times$ over rotated surface-code memories at about $30$ circuit qubits per logical qubit.", "motivation": "Surface codes are attractive for superconducting hardware because they rely on local connectivity, but their low encoding rate creates a large physical-qubit overhead. This work matters because it shows that high-rate qLDPC advantages can survive compilation into strictly planar nearest-neighbour circuits, narrowing the gap between theory and hardware practicality.", "highlights": [ "Planar qLDPC memories", "Constant-depth syndrome extraction", "Up to $1000\\times$ logical improvement" ], "keywords": [ { "label": "qLDPC", "reason": "The core contribution is a high-rate quantum low-density parity-check code family." }, { "label": "Nearest", "reason": "Implementation is restricted to nearest-neighbour gates on a square grid." }, { "label": "iSWAP", "reason": "iSWAP walks generate connectivity and perform measurement dynamically." }, { "label": "Leakage", "reason": "The syndrome protocol naturally removes leakage by swapping check and data roles." } ], "emoji": "🧩", "social_summary": "Introduces planar qLDPC memories that work with only nearest-neighbour gates and can dramatically outperform rotated surface-code patches at finite size.", "highlights_oneliner": "Planar qLDPC with local gates" }, { "arxiv_id": "2606.20263", "title": "Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid", "authors": "Georgia M. Nixon, Campbell K. McLauchlan, Charles C. L. van Rest", "arxiv_url": "https://arxiv.org/abs/2606.20263", "pdf_url": "https://arxiv.org/pdf/2606.20263.pdf", "summary": "The paper introduces vine codes, a family of qLDPC codes implementable on a planar square grid using nearest-neighbour $i$SWAP and $CZ$ gates native to superconducting platforms. The construction generalizes directional codes to open boundaries with routing qubits, and extensive searches identify promising instances such as $[[121,4,6]]$, $[[221,6,7]]$, and $[[234,9,6]]$. The authors verify circuit distances, show reduced qubit counts relative to the surface code, and report simulation evidence that vine codes can outperform the surface code at a near-term noise rate of $10^{-3}$; they also define flip-vine codes with transversal Clifford gates and generalized open boundaries.", "motivation": "The surface code remains the standard because it fits planar superconducting hardware, but its qubit overhead is high. This paper matters because it shows that open-boundary qLDPC codes can keep hardware locality while reducing physical-qubit cost and preserving useful fault-tolerant features.", "highlights": [ "Open-boundary vine codes", "Fewer qubits than surface code", "Transversal Clifford variants" ], "keywords": [ { "label": "Vine", "reason": "Vine codes are the paper's new low-overhead qLDPC family." }, { "label": "Routing", "reason": "Routing qubits enable open boundaries on a square grid." }, { "label": "Transversal", "reason": "Flip-vine codes support single-qubit transversal Clifford gates." }, { "label": "Superconducting", "reason": "The design targets native superconducting gates $i$SWAP and $CZ$." } ], "emoji": "🌿", "social_summary": "Presents vine codes on a square grid, reducing qubit overhead while staying compatible with superconducting nearest-neighbour hardware.", "highlights_oneliner": "Open-boundary qLDPC on grids" }, { "arxiv_id": "2606.20513", "title": "Approximating optimal decoding of quantum LDPC codes with narrow frontiers", "authors": "Anthony Leverrier, Rüdiger Urbanke", "arxiv_url": "https://arxiv.org/abs/2606.20513", "pdf_url": "https://arxiv.org/pdf/2606.20513.pdf", "summary": "The paper introduces the Frontier decoder, a pruned dynamic-programming method for sparse quantum decoding problems that processes error variables in a chosen order and merges prefixes with identical residual syndrome and logical label. By retaining only a narrow scored frontier, it approximates logical-coset posterior masses while keeping the exact recursion as a special case when no pruning is used. The decoder achieves thresholds close to optimal for the surface and color codes in code-capacity noise, and strong circuit-level performance with average retained list size below $100$ for the gross code $[[144,12,12]]$ at physical error rate $0.001$.", "motivation": "Quantum decoding is hard because the relevant inference problem grows exponentially with code size. This work matters because it reframes decoding around boundary states rather than individual errors, giving a principled route to low-latency approximate inference for high-performance codes.", "highlights": [ "Narrow-frontier decoding", "Near-optimal thresholds", "Low-latency complexity" ], "keywords": [ { "label": "Frontier", "reason": "The proposed decoder is built around a narrow retained frontier." }, { "label": "Pruning", "reason": "Score-based pruning controls complexity while preserving posterior mass." }, { "label": "Posterior", "reason": "The method approximates logical-coset posterior masses." }, { "label": "Boundary", "reason": "Residual syndrome and logical label define the compressed boundary state." } ], "emoji": "📚", "social_summary": "Builds a Frontier decoder that compresses decoding around boundary states and reaches near-optimal performance with very small retained lists.", "highlights_oneliner": "Decoding via narrow frontiers" }, { "arxiv_id": "2606.20472", "title": "Many-body chirality of topological stabilizer states", "authors": "Tyler D. Ellison, Dongjin Lee, Zhi Li, Amin Moharramipour, Yasamin Panahi, Beni Yoshida", "arxiv_url": "https://arxiv.org/abs/2606.20472", "pdf_url": "https://arxiv.org/pdf/2606.20472.pdf", "summary": "The paper defines many-body chirality as an obstruction to transforming a quantum state into its complex conjugate using finite-depth local operations. It rigorously proves this property for stabilizer realizations of $\\mathbb{Z}_d^{(k)}$ anyon theories, showing that complex conjugation is locally implementable if and only if the anyon data are mirror invariant. The work identifies chiral behavior invisible to standard diagnostics, proves the obstruction is intrinsically four-partite, and shows that $d>2$ states possess intrinsic many-body imaginarity even when they are not many-body chiral.", "motivation": "Chirality is usually diagnosed by response properties or quasiparticle statistics, not directly from a single ground-state wavefunction. This work matters because it gives a quantum-information-theoretic definition of chirality and reveals entanglement structure that conventional invariants miss.", "highlights": [ "Many-body chirality", "Mirror-invariance criterion", "Intrinsic imaginarity" ], "keywords": [ { "label": "Chirality", "reason": "The paper introduces many-body chirality as its central concept." }, { "label": "Stabilizer", "reason": "Results are proved for stabilizer realizations of anyon theories." }, { "label": "Anyon", "reason": "Mirror invariance is characterized in terms of anyon data." }, { "label": "Imaginarity", "reason": "The work proves intrinsic many-body imaginarity for $d>2$ states." } ], "emoji": "🧭", "social_summary": "Defines many-body chirality for stabilizer states and shows when complex conjugation cannot be implemented by local operations.", "highlights_oneliner": "Chirality from entanglement" }, { "arxiv_id": "2606.19873", "title": "Random Local Stabilizer Codes in Three Dimensions without String or Self-Similar Fractal Logical Operators", "authors": "Han Yan", "arxiv_url": "https://arxiv.org/abs/2606.19873", "pdf_url": "https://arxiv.org/pdf/2606.19873.pdf", "summary": "The paper introduces qutrit random cubic codes, a family of local $qutrit$ CSS stabilizer Hamiltonians with cube-check structure inspired by Haah's code but with spatially varying stabilizers. It proves that the models retain the no-string property while numerically showing the absence of self-similar fractal logical operators and distinct finite-size degeneracy behavior, including a smallest ground-state degeneracy exponent $k=2$ for odd $L$ and $k=4$ for even $L$. The work argues that constrained randomness can alter logical-operator structure and improve prospects for self-correction in three-dimensional stabilizer codes.", "motivation": "String logical operators are a major obstacle to self-correcting quantum memories because they enable constant-energy-barrier errors. This paper matters because it demonstrates a route beyond translation-invariant fracton behavior while preserving the no-string advantage in three dimensions.", "highlights": [ "No-string cubic codes", "No fractal operators", "Improved self-correction prospects" ], "keywords": [ { "label": "Fracton", "reason": "The work is motivated by and contrasts with fracton-code behavior." }, { "label": "Qutrit", "reason": "The new family is built from local qutrit CSS stabilizer Hamiltonians." }, { "label": "Random", "reason": "Spatially varying stabilizers are the key design ingredient." }, { "label": "No-string", "reason": "The main theorem proves absence of string logical operators." } ], "emoji": "🧊", "social_summary": "Shows that random three-dimensional stabilizer codes can avoid both string and fractal logical operators, pointing toward better self-correction.", "highlights_oneliner": "3D codes beyond fractons" }, { "arxiv_id": "2606.20548", "title": "Topological Codes Based on Space Groups", "authors": "Chong-Yuan Xu, Ze-Chuan Liu, Yong Xu", "arxiv_url": "https://arxiv.org/abs/2606.20548", "pdf_url": "https://arxiv.org/pdf/2606.20548.pdf", "summary": "The paper introduces space-group codes, a CSS construction whose checks are built from group-algebra templates over space groups combining translations with point-group operations. It develops ring-module and invariant-theory tools to analyze topological properties, anyon-sector data, and locality, and shows that these codes can exhibit stronger locality than prior translation-only constructions. The framework broadens the design space for topological codes and is positioned toward hardware co-design, including implementations with reconfigurable atom arrays.", "motivation": "Most algebraic topological-code constructions assume translation invariance, which narrows the available code families. This work matters because it extends the algebraic toolkit beyond pure translations and suggests new geometries with improved locality for experimental platforms.", "highlights": [ "Space-group CSS codes", "Point-group checks", "Improved locality" ], "keywords": [ { "label": "Space", "reason": "Space groups are the organizing mathematical structure." }, { "label": "CSS", "reason": "The construction is a class of CSS codes." }, { "label": "Locality", "reason": "The paper emphasizes favorable locality properties for implementation." }, { "label": "Atom", "reason": "Reconfigurable atom arrays are a target hardware platform." } ], "emoji": "🏛️", "social_summary": "Extends topological-code design from translations to space groups, opening a larger algebraic and hardware-friendly code landscape.", "highlights_oneliner": "Topological codes from space groups" }, { "arxiv_id": "2606.19628", "title": "Subsystem Quantum Error Correction for Noisy Quantum Metrology", "authors": "Qiushi Liu, Sisi Zhou", "arxiv_url": "https://arxiv.org/abs/2606.19628", "pdf_url": "https://arxiv.org/pdf/2606.19628.pdf", "summary": "The paper shows that subsystem error correction can simplify noisy quantum metrology while still reaching the Heisenberg limit. It derives general conditions for subsystem stabilizer codes to achieve Heisenberg-limited precision and demonstrates syndrome-free protocols using at most one ancilla qubit for broad noise classes. The framework is extended to dynamical error correction, where Floquet codes protect time-dependent metrological signals at Heisenberg scaling.", "motivation": "Quantum error correction has already been used to improve sensing, but existing approaches often rely on many clean ancillae and complicated encoding/decoding. This work matters because it reduces operational overhead and broadens error-corrected metrology to subsystem and Floquet settings.", "highlights": [ "Heisenberg-limited sensing", "One-ancilla protocols", "Floquet protection" ], "keywords": [ { "label": "Metrology", "reason": "The paper targets precision estimation under noise." }, { "label": "Subsystem", "reason": "Subsystem stabilizer codes are the main framework." }, { "label": "Floquet", "reason": "Time-dependent signals are protected using Floquet codes." }, { "label": "Ancilla", "reason": "Protocols use at most a single ancilla qubit." } ], "emoji": "🎯", "social_summary": "Shows that subsystem codes can deliver Heisenberg-limited metrology with minimal ancilla overhead and extends the idea to Floquet sensing.", "highlights_oneliner": "Subsystem codes for sensing" }, { "arxiv_id": "2606.20441", "title": "Computing noise-canceling observables via Pauli propagation", "authors": "Andrew Eddins, Caleb Johnson, Alberto Baiardi, Francesco Tacchino, Ewout van den Berg, Roy Elkabetz, Vinay Tripathi, Swarnadeep Majumder, Max Rossmannek, Liran Shirizly, Abhinav Kandala", "arxiv_url": "https://arxiv.org/abs/2606.20441", "pdf_url": "https://arxiv.org/pdf/2606.20441.pdf", "summary": "The paper embeds Pauli propagation inside a hybrid error-mitigation framework that reduces quantum sampling overhead while lowering truncation error compared with classical Pauli propagation alone. A target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on hardware, and the authors prototype two implementations and benchmark them on canonical models. Experiments on $56$ superconducting qubits show the tradeoffs of the truncation strategies and illustrate how classical and quantum resources can be combined to estimate observables beyond the limits of either approach alone.", "motivation": "Classical simulation methods and quantum hardware each face a different bottleneck: truncation growth on the classical side and sampling overhead on the quantum side. This work matters because it merges the two into a practical mitigation workflow aimed at improving observable estimation on near-term processors.", "highlights": [ "Hybrid mitigation workflow", "Noise-canceling observables", "$56$-qubit experiment" ], "keywords": [ { "label": "Pauli", "reason": "Pauli propagation is the classical simulation engine." }, { "label": "Mitigation", "reason": "The method is explicitly an error-mitigation framework." }, { "label": "Observables", "reason": "It targets direct estimation of modified observables." }, { "label": "Superconducting", "reason": "Hardware experiments were performed on $56$ superconducting qubits." } ], "emoji": "⚙️", "social_summary": "Combines Pauli propagation with hardware measurements to reduce sampling cost and truncation error in noise-mitigated observable estimation.", "highlights_oneliner": "Pauli propagation meets mitigation" }, { "arxiv_id": "2606.20153", "title": "Optimizing resource allocation for accuracy in noisy variational quantum algorithms", "authors": "Harshit Verma, Thomas Ayral, Alexia Auffèves, Robert Whitney", "arxiv_url": "https://arxiv.org/abs/2606.20153", "pdf_url": "https://arxiv.org/pdf/2606.20153.pdf", "summary": "The paper develops a phenomenological metric-noise-resource methodology for optimizing noisy variational algorithms, using VQE simulations to model the trade-off between circuit size, iteration count, algorithmic accuracy, and hardware noise. It identifies the sweet spot that minimizes total gate-operation cost for a target accuracy, and also determines the circuit size that maximizes accuracy under a fixed resource budget. The framework yields closed-form optimality conditions from empirical scaling laws and applies to both the Hamiltonian Variational Ansatz and the $RY$ ansatz.", "motivation": "Variational algorithms are attractive on noisy intermediate-scale hardware, but their performance depends on a delicate balance between depth, noise, and iteration count. This work matters because it turns that balance into a quantitative optimization problem for time and energy efficiency on realistic devices.", "highlights": [ "Noise-resource optimization", "Optimal circuit size", "Closed-form scaling laws" ], "keywords": [ { "label": "VQE", "reason": "The methodology is demonstrated on variational quantum eigensolvers." }, { "label": "Resource", "reason": "The paper optimizes gate-operation cost and energy/time use." }, { "label": "Scaling", "reason": "Empirical scaling relations drive the optimization." }, { "label": "Ansatz", "reason": "Results are extracted for the HVA and $RY$ ansätze." } ], "emoji": "📈", "social_summary": "Turns noisy variational algorithm design into a resource-optimization problem and finds the circuit-size sweet spot for target accuracy.", "highlights_oneliner": "Optimize VQE resource use" }, { "arxiv_id": "2606.19848", "title": "QMCtwin: Master-Equation Simulation of Syndrome Statistics Beyond Pauli Noise", "authors": "Tong Shen, Huo Chen, Benchen Huang, Tyler Takeshita, Arian Vezvaee, Izhar Medalsy, Daniel A. Lidar", "arxiv_url": "https://arxiv.org/abs/2606.19848", "pdf_url": "https://arxiv.org/pdf/2606.19848.pdf", "summary": "The paper presents QMCtwin, a sign-problem-suppressed quantum Monte Carlo framework for simulating master-equation QEC circuits and extracting syndrome statistics beyond Pauli-twirled models. Applied to a full syndrome-extraction round of a distance-$7$ rotated surface code with $97$ physical qubits, the method incorporates relaxation, dephasing, coherent miscalibration, residual $ZZ$ crosstalk, and drive detuning. The simulations reveal syndrome biases and syndrome-to-string-parity correlations absent in stochastic Pauli descriptions, and the authors introduce information-theoretic diagnostics to compare realistic and Pauli-twirled noise models.", "motivation": "Decoder performance depends on how faithfully a noise model captures the syndrome statistics produced by hardware, not just on aggregate error rates. This work matters because it provides a path to realistic, decoder-facing digital twins that retain coherent and correlated open-system effects hidden by simplified models.", "highlights": [ "Master-equation digital twin", "Beyond Pauli noise", "Syndrome correlations exposed" ], "keywords": [ { "label": "Monte Carlo", "reason": "QMCtwin is a quantum Monte Carlo simulation framework." }, { "label": "Syndrome", "reason": "The main output is syndrome statistics for decoding." }, { "label": "Twirl", "reason": "It compares realistic dynamics with Pauli-twirled models." }, { "label": "Crosstalk", "reason": "Residual $ZZ$ crosstalk is part of the open-system noise model." } ], "emoji": "🧪", "social_summary": "Uses quantum Monte Carlo master-equation simulation to reveal syndrome statistics and correlations hidden by Pauli-noise approximations.", "highlights_oneliner": "Syndrome twins beyond Pauli noise" }, { "arxiv_id": "2606.20242", "title": "Mitigating Trotter Errors via Post-Processed Symmetry Restoration", "authors": "Sangjin Lee, Sangkook Choi", "arxiv_url": "https://arxiv.org/abs/2606.20242", "pdf_url": "https://arxiv.org/pdf/2606.20242.pdf", "summary": "The paper proposes a symmetry-based Trotter error mitigation protocol that uses classical post-processing to project out symmetry-violating components of Trotterized dynamics. By applying symmetry transformations to the initial state or interleaving them between Trotter layers, then averaging outcomes, the method preserves ideal dynamics while suppressing errors for non-local spatial symmetries, anti-unitary time-reversal symmetries, and local gauge symmetries. Benchmarks on the $1$D XY model and the $1$D Schwinger model show suppression of leading-order Trotter error and gauge violations with only $\\mathcal{O}(1)$ extra circuit depth.", "motivation": "Trotterization is a standard route to quantum simulation, but it often breaks the symmetries that define the target physics. This work matters because symmetry restoration offers a depth-preserving way to recover physically admissible dynamics on near-term devices.", "highlights": [ "Symmetry restoration", "Gauge twirling", "$\\mathcal{O}(1)$ overhead" ], "keywords": [ { "label": "Trotter", "reason": "The paper directly mitigates Trotterization errors." }, { "label": "Symmetry", "reason": "Symmetry restoration is the core mitigation mechanism." }, { "label": "Gauge", "reason": "Gauge twirling is used for the Schwinger model." }, { "label": "Post-processed", "reason": "Classical post-processing combines symmetry-transformed measurements." } ], "emoji": "🛡️", "social_summary": "Mitigates Trotterization errors by restoring symmetries in post-processing, with benchmarks on the XY and Schwinger models.", "highlights_oneliner": "Restore symmetry after Trotterization" } ] }, "2026-06-18": { "word_cloud": [ { "word": "Walsh", "weight": 5 }, { "word": "Parity", "weight": 5 }, { "word": "Syndrome", "weight": 5 }, { "word": "Leakage", "weight": 4 }, { "word": "Photonic", "weight": 4 }, { "word": "Spatial", "weight": 4 }, { "word": "Hypercube", "weight": 4 }, { "word": "Registers", "weight": 3 }, { "word": "Postselection", "weight": 3 }, { "word": "Neutral", "weight": 4 }, { "word": "Hamming", "weight": 4 }, { "word": "Calibration", "weight": 3 }, { "word": "Interference", "weight": 3 }, { "word": "Routing", "weight": 3 } ], "social_highlights": "Highlights: characterizes nested Walsh parity-check filters on a cloud photonic processor, measures leakage suppression and syndrome routing in an eight-mode single-photon register", "papers": [ { "arxiv_id": "2606.18408", "title": "Characterization of nested Walsh parity-check filters in a single-photon eight-mode register on a cloud photonic processor", "authors": "Emma Tully, Jonathan Washburn, Megan Simons", "arxiv_url": "https://arxiv.org/abs/2606.18408", "pdf_url": "https://arxiv.org/pdf/2606.18408", "summary": "The paper characterizes two nested Walsh parity-check filters on Quandela's Belenos cloud photonic processor using a single-photon eight-mode spatial register indexed by the vertices of $Q_3$. It demonstrates the classical $[8,7,2]$ single-parity-check code and the $[8,4,4]$ extended Hamming code as first-quantized path/mode encodings, focusing on leakage suppression and syndrome routing rather than active error correction or photon-loss protection. Across more than $340{,}000$ postselected detections, the authors report low residual leakage for neutral inputs, strong selectivity in the face-parity channels, and depth-dependent behavior dominated by calibration and compilation systematics.", "motivation": "Nested parity-check structures matter because experimentally accessible subspaces can reveal leakage and syndrome information even when full fault-tolerant correction is not yet implemented. This work is important as a photonic demonstration of how classical code geometry can be mapped into measurable mode-selective filters on cloud hardware.", "highlights": [ "Residual DC leakage as low as $0.02\\%$ to $1.1\\%$ for neutral inputs", "Face-parity syndrome channels routed with $94\\%$ to $99\\%$ selectivity", "Suppression remained far below non-neutral controls across one to three compiled applications" ], "keywords": [ { "label": "Walsh", "reason": "The experiment implements nested Walsh parity-check filters that define the measured neutral and parity-checked subspaces." }, { "label": "Hamming", "reason": "The $[8,4,4]$ extended Hamming code is one of the two central classical code structures studied." }, { "label": "Leakage", "reason": "Residual leakage is the main performance metric used to quantify filter fidelity and suppression." }, { "label": "Photonic", "reason": "The implementation is performed on a cloud-accessible single-photon photonic processor." } ], "emoji": "🔆", "social_summary": "Demonstrate nested Walsh filters on a cloud photonic chip, showing low leakage and high-selectivity syndrome routing in an eight-mode single-photon register.", "highlights_oneliner": "Nested Walsh filters on photons" } ] }, "2026-06-17": { "word_cloud": [ { "word": "Decoding", "weight": 5 }, { "word": "Surface", "weight": 5 }, { "word": "LDPC", "weight": 5 }, { "word": "Lindbladian", "weight": 4 }, { "word": "Thresholds", "weight": 4 }, { "word": "Syndrome", "weight": 3 }, { "word": "Bias", "weight": 4 }, { "word": "Network", "weight": 3 }, { "word": "Topological", "weight": 4 }, { "word": "Degeneracy", "weight": 3 }, { "word": "Coset", "weight": 3 }, { "word": "Ensembles", "weight": 2 }, { "word": "Gadget", "weight": 3 }, { "word": "Stabilizers", "weight": 3 }, { "word": "Rotations", "weight": 2 } ], "social_highlights": "Highlights: QEC-enabled Lindbladian learning, PTAS decoders for topological and colour codes, new coset LDPC constructions, impulse decoding for degeneracy, random-matrix ensembles in surface codes, network-aware distributed QEC, and optimized biased XZZX schemes.", "papers": [ { "arxiv_id": "2606.18188", "title": "Learning Arbitrary Lindbladians with Quantum Error Correction", "authors": "Nikita Romanov, Petr Ivashkov, Weiyuan Gong, Ishaan Kannan, Andi Gu, Hong-Ye Hu, Susanne F. Yelin", "arxiv_url": "https://arxiv.org/abs/2606.18188", "pdf_url": "https://arxiv.org/pdf/2606.18188.pdf", "summary": "The paper introduces an ansatz-free algorithm for learning arbitrary sparse Lindbladians, achieving standard quantum limit precision for general components and Heisenberg scaling for Hamiltonian parts not masked by dissipation. It uses a recursive random stabilizer-code construction to selectively suppress dominant Lindbladian terms while maintaining sensitivity to weaker unknown contributions, enabling scalable characterization of open-system generators.", "motivation": "Characterizing unknown open-system dynamics traditionally requires strong structural assumptions on Hamiltonians and dissipators, limiting applicability to realistic devices. This work leverages quantum error correction as an active probe to reach fundamental precision limits for Lindbladian learning without prior structural knowledge, crucial for diagnosing noise in future fault-tolerant architectures.", "highlights": [ "Ansatz-free sparse Lindbladian learning at optimal precision limits", "Heisenberg-limited Hamiltonian estimation without prior support knowledge", "Recursive random stabilizer-code construction for term suppression" ], "keywords": [ { "label": "Lindbladians", "reason": "Central object of study is reconstructing the generator of open-system Lindblad dynamics." }, { "label": "Stabilizers", "reason": "Uses random stabilizer codes recursively to filter Lindbladian terms during learning." }, { "label": "Metrology", "reason": "Achieves standard-quantum-limit and Heisenberg-limited precision for different generator components." }, { "label": "OpenSystems", "reason": "Targets characterization of unknown open quantum systems under dissipation and Hamiltonian evolution." } ], "emoji": "🧪", "social_summary": "Use quantum error-correcting codes as a metrological tool to learn arbitrary sparse Lindbladians at optimal precision, without assuming prior structure on the open-system dynamics.", "highlights_oneliner": "QEC-enabled optimal Lindbladian learning" }, { "arxiv_id": "2606.18145", "title": "A polynomial-time approximation scheme for minimum-weight decoding of topological codes", "authors": "Shouzhen Gu, Lily Wang, Aleksander Kubica", "arxiv_url": "https://arxiv.org/abs/2606.18145", "pdf_url": "https://arxiv.org/pdf/2606.18145.pdf", "summary": "This work proves that minimum-weight decoding of $2$D translationally invariant topological stabilizer codes admits a polynomial-time approximation scheme, yielding recovery operators within a factor $(1+\\varepsilon)$ of minimum weight for any constant $\\varepsilon>0$. By adapting Arora-style PTAS techniques for Euclidean problems to point-like excitations connected by string-like errors, the scheme extends to certain higher-dimensional codes and provides near-optimal decoders with provable performance guarantees.", "motivation": "Exact minimum-weight decoding for many topological codes is NP-hard, casting doubt on the feasibility of optimal decoders in practice. Showing that approximate minimum-weight decoding is efficiently achievable clarifies the computational landscape of decoding and guides the design of practical decoders for fault-tolerant topological memories.", "highlights": [ "PTAS for minimum-weight decoding of $2$D TTI topological codes", "Extension to selected higher-dimensional codes and quantum memories", "Near-optimal color-code decoder correcting up to $(1-\\varepsilon)d/2$ errors" ], "keywords": [ { "label": "PTAS", "reason": "Core contribution is a polynomial-time approximation scheme for minimum-weight decoding." }, { "label": "Topological", "reason": "Targets topological stabilizer codes such as toric and color codes in $2$D and beyond." }, { "label": "Decoders", "reason": "Provides an explicit approximate minimum-weight decoder with provable guarantees." }, { "label": "Syndrome", "reason": "Formulates decoding via point-like excitations and string-like error connections from syndromes." } ], "emoji": "📐", "social_summary": "Prove that minimum-weight decoding of many topological codes admits an efficient PTAS, enabling near-optimal recovery in polynomial time despite NP-hardness of exact decoding.", "highlights_oneliner": "PTAS for topological code decoding" }, { "arxiv_id": "2606.18035", "title": "Approximately Decoding the Colour Code", "authors": "Mark Walters", "arxiv_url": "https://arxiv.org/abs/2606.18035", "pdf_url": "https://arxiv.org/pdf/2606.18035.pdf", "summary": "The paper constructs a polynomial-time algorithm that approximately solves minimum-weight decoding for the $(6.6.6)$ planar colour code with $X$ errors, achieving error sets within a factor $(1+\\varepsilon)$ of optimal for any $\\varepsilon>0$. As a corollary, it yields a decoder that can provably correct all errors of weight up to $(1-\\varepsilon)d/2$ in a distance-$d$ colour code, showing that approximate decoding is not NP-hard even though exact decoding is.", "motivation": "Previous results established NP-hardness of exact minimum-weight decoding for colour codes, leaving open whether good approximations were tractable. Demonstrating an arbitrarily good polynomial-time approximation algorithm reshapes our understanding of decoding complexity and motivates the search for practical approximate decoders with strong guarantees.", "highlights": [ "Polynomial-time $(1+\\varepsilon)$-approximate decoder for planar colour code", "Provable correction up to $(1-\\varepsilon)d/2$ error weight", "Shows approximate minimum-weight decoding is not NP-hard" ], "keywords": [ { "label": "ColourCodes", "reason": "Focuses on approximate decoding for the planar colour code under $X$ errors." }, { "label": "Approximation", "reason": "Central result is a $(1+\\varepsilon)$ approximation to minimum-weight decoding." }, { "label": "Complexity", "reason": "Contrasts NP-hardness of exact decoding with tractability of approximation." }, { "label": "Planar", "reason": "Targets the $(6.6.6)$ planar geometry relevant for 2D implementations." } ], "emoji": "🧮", "social_summary": "Show that planar colour codes admit a polynomial-time $(1+\\varepsilon)$-approximate decoder, correcting almost up to half-distance despite NP-hardness of exact decoding.", "highlights_oneliner": "Approximate decoding for colour codes" }, { "arxiv_id": "2606.17268", "title": "Breaking the bicycle frame: Coset-based quantum LDPC codes", "authors": "Arda Aydin, Itzhak Tamo, Alexander Barg", "arxiv_url": "https://arxiv.org/abs/2606.17268", "pdf_url": "https://arxiv.org/pdf/2606.17268.pdf", "summary": "The authors generalize two-block group algebra constructions to a coset-based framework, producing new families of two-block quantum LDPC codes not contained in the bivariate bicycle class. Through computational search they obtain explicit codes, including weight-$6$ and weight-$8$ examples with parameters such as $[[48,8,6]]$, $[[96,8,10]]$, and $[[168,16,15]]$, and design maximally packed syndrome-extraction schedules of depth $w+2$ for stabilizer weight $w$ that achieve competitive thresholds under circuit-level noise with BP-OSD decoding.", "motivation": "Practical fault-tolerant quantum computing calls for finite-length LDPC codes with good distances, high rates, and low-weight stabilizers that outperform surface codes in overhead. By expanding beyond standard bivariate bicycle constructions via group actions on cosets, this work broadens the design space of structured LDPC codes and provides concrete high-performance instances with efficient syndrome circuits.", "highlights": [ "Coset-based generalization of two-block quantum LDPC constructions", "New finite-length codes with parameters like $[[224,12,16]]$ and competitive thresholds", "Syndrome schedules of depth $w+2$ enabling efficient extraction" ], "keywords": [ { "label": "LDPC", "reason": "Constructs new low-density parity-check quantum codes with bounded stabilizer weight." }, { "label": "Cosets", "reason": "Uses group actions on cosets of subgroups to generalize two-block constructions." }, { "label": "Thresholds", "reason": "Evaluates performance via circuit-level noise thresholds with BP-OSD decoding." }, { "label": "Schedules", "reason": "Designs maximally packed syndrome-extraction schedules of depth $w+2$." } ], "emoji": "🧱", "social_summary": "Build new coset-based quantum LDPC codes beyond bivariate bicycles, with efficient syndrome schedules and competitive thresholds under circuit-level noise.", "highlights_oneliner": "Coset-based quantum LDPC constructions" }, { "arxiv_id": "2606.18240", "title": "Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening", "authors": "Shobhit Bhatnagar, Michele Pacenti, Nithin Raveendran, David Declercq, Bane Vasić", "arxiv_url": "https://arxiv.org/abs/2606.18240", "pdf_url": "https://arxiv.org/pdf/2606.18240.pdf", "summary": "This paper establishes a classical coding-theoretic interpretation of degeneracy in CSS quantum codes by relating it to shortening of linear block codes, effectively occurring at the decoder. Building on this insight, it introduces impulse decoding, a low-complexity parallel scheme for quantum LDPC codes that significantly outperforms BP-OSD and other decoders under both code-capacity and circuit-level noise, and further refines performance with a residual-error decoding stage for circuit-level noise.", "motivation": "Degeneracy is a defining but poorly understood feature of stabilizer codes, complicating the design of efficient decoders. Providing a concrete classical analog and exploiting it to build faster, more accurate decoders directly advances practical decoding strategies for large-scale quantum LDPC-based architectures.", "highlights": [ "Relates quantum degeneracy to classical code shortening at the decoder", "Introduces impulse decoding with superior performance to BP-OSD", "Combines impulse and residual-error decoding for improved circuit-level performance" ], "keywords": [ { "label": "Degeneracy", "reason": "Clarifies degeneracy via an equivalence to classical code shortening." }, { "label": "Impulse", "reason": "Proposes impulse decoding as a new parallel scheme for LDPC codes." }, { "label": "BPOSD", "reason": "Benchmarks performance improvements over BP-OSD and other decoders." }, { "label": "Residual", "reason": "Adds residual-error decoding to further boost circuit-level performance." } ], "emoji": "🚀", "social_summary": "Exploit a new link between degeneracy and code shortening to design impulse decoding, a fast LDPC decoder that beats BP-OSD under both code-capacity and circuit-level noise.", "highlights_oneliner": "Impulse decoding via degeneracy-shortening link" }, { "arxiv_id": "2606.17140", "title": "Projected logical ensembles in surface codes via the random-matrix theory of quantum dots", "authors": "Mircea Bejan, Jan Behrends, Max McGinley, Benjamin Béri", "arxiv_url": "https://arxiv.org/abs/2606.17140", "pdf_url": "https://arxiv.org/pdf/2606.17140.pdf", "summary": "The work studies the distribution of logical states generated by surface-code error correction after deterministic transversal single-qubit $X$ rotations, defining the Born-weighted projected logical ensemble (PLE). For a single-logical-qubit code, it maps the PLE to ensembles of scattering matrices of mesoscopic quantum dots in Altland-Zirnbauer classes D and DIII, identifying parameter regimes where the PLE becomes universally random and well-described by random matrix theory.", "motivation": "Measurement-induced phenomena in monitored quantum systems and topological codes hint at emergent universality, yet their logical-level statistics remain underexplored. By connecting surface-code post-correction logical ensembles to mesoscopic quantum-dot scattering matrices, this work links QEC dynamics to well-developed random-matrix theory, offering new tools to analyze logical-state randomness and thresholds.", "highlights": [ "Defines and analyzes the projected logical ensemble in surface codes", "Maps logical ensembles to quantum-dot scattering matrices in classes D/DIII", "Identifies chaotic regimes with universal random-matrix behavior" ], "keywords": [ { "label": "Surface", "reason": "Uses surface codes with a single logical qubit as the QEC platform." }, { "label": "Ensembles", "reason": "Introduces the projected logical ensemble as a distribution over logical states." }, { "label": "RandomMatrix", "reason": "Employs random-matrix theory to describe chaotic logical ensembles." }, { "label": "QuantumDots", "reason": "Relates PLE statistics to scattering matrices of mesoscopic quantum dots." } ], "emoji": "🎲", "social_summary": "Connect surface-code projected logical ensembles to quantum-dot random-matrix ensembles, revealing universal chaotic regimes in logical states after transversal rotations and decoding.", "highlights_oneliner": "Random-matrix view of surface-code ensembles" }, { "arxiv_id": "2606.17495", "title": "Impact of Network Constraints on Fault-Tolerant Distributed Quantum Computing", "authors": "Eneet Kaur, Shahrooz Pouryousef, Nitish Kumar Chandra, Hassan Shapourian, Jiapeng Zhao, Ramana Kompella, Reza Nejabati", "arxiv_url": "https://arxiv.org/abs/2606.17495", "pdf_url": "https://arxiv.org/pdf/2606.17495.pdf", "summary": "This paper presents an end-to-end, network-aware simulation framework for distributed surface-code computation that jointly models logical circuits, intra-QPU connectivity, and realistic network constraints such as finite entanglement generation rates, limited communication qubits, and bandwidth contention. The framework outputs execution latency and logical error-rate estimates, revealing operating regimes where optimal resource allocation and code distance depend sensitively on network characteristics while still remaining within the fault-tolerant regime for considered parameters.", "motivation": "As hardware scales beyond monolithic devices, modular architectures connected via quantum networks become essential, but existing analyses often decouple computation from communication. A unified simulation and compilation stack that includes networking effects is key to understanding resource tradeoffs and guiding the design of future distributed fault-tolerant systems.", "highlights": [ "End-to-end simulation of distributed surface-code computation with realistic networks", "Identification of regimes where network parameters shift optimal code distances", "Shows network-induced idling noise need not break fault tolerance for studied settings" ], "keywords": [ { "label": "Distributed", "reason": "Targets distributed quantum computing over networked QPUs." }, { "label": "Surface", "reason": "Uses surface-code based fault-tolerant computation as the workload model." }, { "label": "Networks", "reason": "Explicitly models entanglement rates, links, and bandwidth contention." }, { "label": "Latency", "reason": "Computes execution latency and logical error rates under network constraints." } ], "emoji": "🌐", "social_summary": "Model how realistic quantum networks shape latency and logical errors in distributed surface-code computing, revealing new resource tradeoffs without leaving the fault-tolerant regime.", "highlights_oneliner": "Network-aware distributed surface-code simulation" }, { "arxiv_id": "2606.17709", "title": "Optimizing bias-tailored quantum error correction beyond code-capacity noise", "authors": "César Benito, I. Jesán Velázquez-Reséndiz, Alejandro Bermudez", "arxiv_url": "https://arxiv.org/abs/2606.17709", "pdf_url": "https://arxiv.org/pdf/2606.17709.pdf", "summary": "The authors compare bias-tailored XZZX codes with anisotropic rectangular surface codes and find that advantages predicted under ideal code-capacity biased noise largely vanish once realistic syndrome-extraction and circuit-level noise are included. They identify bias degradation during extraction as the main limitation of bias-tailored schemes and introduce a bias-filtering CNOT gadget based on temporary repetition encoding of ancillas, which can recover a few-percent threshold improvement for XZZX codes in high-bias, low-idle-error regimes.", "motivation": "Bias-tailored codes promise significant savings when physical noise is highly asymmetric, but much of the evidence relies on simplified noise models. Assessing their performance under realistic fault-tolerant circuits and developing lightweight gadgets to preserve bias are crucial for translating these theoretical gains into practical architectures.", "highlights": [ "Shows anisotropic surface-code advantages vanish under circuit-level noise", "Identifies bias degradation in syndrome extraction as key limitation", "Proposes a bias-filtering CNOT gadget that boosts XZZX thresholds by a few percent" ], "keywords": [ { "label": "XZZX", "reason": "Focuses on bias-tailored XZZX codes compared to rectangular surface codes." }, { "label": "Bias", "reason": "Analyzes and mitigates degradation of noise bias during syndrome extraction." }, { "label": "CNOT", "reason": "Introduces a bias-filtering CNOT gadget using temporary repetition encoding." }, { "label": "Thresholds", "reason": "Evaluates impact of gadgets and layouts on logical error thresholds." } ], "emoji": "⚙️", "social_summary": "Test how bias-tailored XZZX and anisotropic surface codes perform under circuit-level noise, and recover lost advantage with a bias-filtering CNOT gadget that modestly improves thresholds.", "highlights_oneliner": "Bias-filtered XZZX under realistic noise" } ] }, "2026-06-16": { "word_cloud": [ { "word": "Surface", "weight": 4 }, { "word": "Magic", "weight": 5 }, { "word": "States", "weight": 4 }, { "word": "Syndrome", "weight": 3 }, { "word": "Bosonic", "weight": 4 }, { "word": "Decoders", "weight": 4 }, { "word": "Cat", "weight": 5 }, { "word": "Gates", "weight": 3 }, { "word": "Noise", "weight": 5 }, { "word": "Leakage", "weight": 3 }, { "word": "Mitigation", "weight": 3 }, { "word": "Spin", "weight": 2 }, { "word": "Phonon", "weight": 2 }, { "word": "Teleportation", "weight": 3 }, { "word": "Hypercgraph", "weight": 2 } ], "social_highlights": "Highlights: transversal magic-state factories, lattice-surgery teleportation, hypergraph noise reconstruction, nonlinear readout leakage analysis, robust ion gates, tight Hamming bound, steering-based error detection, spin-phonon suppression, finite-shot mitigation windows, hybrid quantum forecaster, generalized Kerr-cat codes.", "papers": [ { "arxiv_id": "2606.16199", "title": "Efficient Magic State Factory Via Transversal Non-Clifford Gate", "authors": "I-Chi Chen, Hrushikesh Pramod Patil, Huiyang Zhou, Andrew Sornborger", "arxiv_url": "https://arxiv.org/abs/2606.16199", "pdf_url": "https://arxiv.org/pdf/2606.16199.pdf", "summary": "The paper performs end-to-end simulations of magic-state preparation via code switching between doubled color codes and rotated surface codes, comparing resource costs and performance to magic-state cultivation. It develops a lattice-surgery protocol for transferring states between the doubled color code and rotated surface code and extends the code-switching protocol to $d=5$, enabling high-fidelity preparation of $S\\ket{+}_L$ and $T\\ket{+}_L$ using transversal non-Clifford gates. It further proposes two protocols that combine phase-kickback checks with a transversal non-Clifford gate, demonstrating up to $10\\%$ infidelity reduction over pure code switching.", "motivation": "Magic-state factories are the dominant strategy for implementing non-Clifford gates required for universal fault-tolerant computation, but their overhead can dominate large-scale architectures. Systematically benchmarking code switching against magic-state cultivation and exploiting transversal non-Clifford gates clarify near-term resource trade-offs for platforms such as trapped ions and neutral atoms.", "highlights": [ "End-to-end simulations of code-switching magic-state factories up to $d=5$", "Lattice-surgery protocol between doubled color and rotated surface codes", "Hybrid phase-kickback and transversal-gate protocols with $10\\%$ infidelity reduction" ], "keywords": [ { "label": "Magic States", "reason": "Central focus is preparing high-fidelity $S$ and $T$ magic states for non-Clifford gates." }, { "label": "Code Switching", "reason": "Uses switching between doubled color and surface codes to realize transversal non-Clifford gates." }, { "label": "Lattice Surgery", "reason": "Introduces a surgery protocol to transfer between color and rotated surface codes." }, { "label": "Color Codes", "reason": "Doubled color codes provide transversal $T$ gates and are key to the factory design." } ], "emoji": "✨", "social_summary": "Benchmark transversal code-switching magic-state factories against cultivation and show improved infidelities using hybrid phase-kickback protocols on doubled color and surface codes.", "highlights_oneliner": "Transversal code-switch magic-state factories" }, { "arxiv_id": "2606.15190", "title": "Lattice surgery for near-term experimental logical qubit entanglement creation in planar architectures", "authors": "Lukas Bödeker, Áron Márton, Luis Colmenarez, Ilya Besedin, Andreas Wallraff, Markus Müller", "arxiv_url": "https://arxiv.org/abs/2606.15190", "pdf_url": "https://arxiv.org/pdf/2606.15190.pdf", "summary": "This work specifies a logical teleportation protocol between two surface-code logical qubits implemented via lattice surgery, detailing both logical and physical qubit operations. It analyzes modularity constraints in stabilizer readout patterns, variants of the teleportation protocol for superconducting layouts, and the impact of in-sequence classical decision logic and interface-region size. Simulations identify protocol variants and interface geometries that improve near-term lattice-surgery performance for superconducting circuit architectures.", "motivation": "Demonstrating entangling operations between a few logical qubits is a critical milestone for early fault-tolerant quantum processors. Tailoring lattice-surgery teleportation to realistic planar superconducting chips and control constraints informs scalable architectures and near-term experimental roadmaps.", "highlights": [ "Logical teleportation protocol via lattice surgery for planar surface codes", "Study of stabilizer-readout modularity and protocol variants for superconducting layouts", "Optimization of interface size and decision logic for improved teleportation performance" ], "keywords": [ { "label": "Lattice Surgery", "reason": "Core mechanism for logical teleportation between surface-code patches." }, { "label": "Surface Codes", "reason": "Teleportation is implemented between planar surface-code logical qubits." }, { "label": "Teleportation", "reason": "Primary logical operation studied is logical state teleportation between codes." }, { "label": "Superconducting", "reason": "Design choices and simulations are targeted to superconducting qubit architectures." } ], "emoji": "🔗", "social_summary": "Design and simulate surface-code lattice-surgery teleportation protocols optimized for realistic superconducting chips to create logical entanglement in near-term planar architectures.", "highlights_oneliner": "Lattice-surgery logical teleportation design" }, { "arxiv_id": "2606.16288", "title": "Reconstruction of detector error model for quantum error correction", "authors": "Cheng Ye, Pan Zhang", "arxiv_url": "https://arxiv.org/abs/2606.16288", "pdf_url": "https://arxiv.org/pdf/2606.16288.pdf", "summary": "The authors introduce the Correlation-Analysis-based Hypergraph Reconstruction (CAHR) algorithm to invert experimental syndrome statistics directly into discrete detector-error-model hypergraphs. By combining algebraic correlation equations with a top-down concurrent-pruning strategy, CAHR recovers high-order fault topologies without false positives in benchmarks on $d=5$ rotated surface codes and dense $8$-body $2$D color codes. They identify a variance-cascade effect that limits continuous parameter extraction in dense codes and propose a two-stage pipeline where CAHR discovers the topology, followed by continuous probability optimization.", "motivation": "Accurate, structured noise models are essential for optimizing decoders and achieving fault tolerance, yet realistic circuit-level noise includes complex multi-qubit correlations that are hard to learn. Moving beyond greedy, order-by-order inference to globally consistent hypergraph reconstruction advances scalable noise characterization for topological codes.", "highlights": [ "CAHR algorithm for globally consistent hypergraph DEM reconstruction", "Benchmark recovery of dense multi-body fault topologies without false positives", "Identification of variance cascade and a two-stage topology-plus-parameter inference paradigm" ], "keywords": [ { "label": "DEM", "reason": "The work reconstructs detector error models as probabilistic hypergraphs from data." }, { "label": "Hypergraphs", "reason": "Noise processes are represented and inferred as high-order hyperedges." }, { "label": "Surface Codes", "reason": "Benchmarking includes $d=5$ rotated surface-code experiments." }, { "label": "Color Codes", "reason": "Dense $8$-body $2$D color codes test reconstruction in correlated-noise regimes." } ], "emoji": "📊", "social_summary": "Introduce CAHR, a hypergraph-based algorithm that reconstructs high-order detector error models from syndrome data, enabling realistic noise characterization for surface and color codes.", "highlights_oneliner": "Hypergraph reconstruction of detector error models" }, { "arxiv_id": "2606.16055", "title": "Readout-Induced Leakage in Superconducting Circuits with Nonlinear Couplings", "authors": "Sumeru Hazra, Wei Dai, Daniel K. Weiss, Pranav D. Parakh, Luigi Frunzio, Michel H. Devoret", "arxiv_url": "https://arxiv.org/abs/2606.16055", "pdf_url": "https://arxiv.org/pdf/2606.16055.pdf", "summary": "The paper investigates drive-induced leakage to higher qubit levels in superconducting circuits with native nonlinear qubit–resonator couplings, a critical source of correlated errors for quantum error correction. Through modeling and experiments, it shows that nonlinear coupling alone neither eliminates nor necessarily suppresses leakage, and can introduce additional parasitic transitions whose rates are highly sensitive to readout frequency, varying by orders of magnitude for $\\\\sim 7\\%$ shifts. The results emphasize that leveraging nonlinear couplings requires careful device engineering, including spectral placement and suppression of auxiliary modes, to control readout-induced leakage.", "motivation": "Readout-induced leakage generates correlated and non-Pauli errors that are especially harmful for stabilizer codes and fault-tolerant protocols. As architectures adopt engineered nonlinear couplings for Purcell protection and selection rules, understanding their real-world leakage behavior is crucial for designing QEC-compatible superconducting devices.", "highlights": [ "Demonstration that nonlinear qubit–resonator coupling does not automatically suppress leakage", "Identification of parasitic leakage channels highly sensitive to readout frequency", "Design guidelines for exploiting nonlinear couplings while mitigating readout-induced leakage" ], "keywords": [ { "label": "Leakage", "reason": "Readout-induced population of noncomputational states is the central error source studied." }, { "label": "Superconducting", "reason": "Experiments and modeling focus on superconducting qubit–resonator circuits." }, { "label": "Readout", "reason": "Drive-induced transitions during measurement are the mechanism of the errors." }, { "label": "Nonlinear", "reason": "Native nonlinear couplings are analyzed as both protection and leakage sources." } ], "emoji": "🚨", "social_summary": "Reveal how nonlinear superconducting qubit–resonator couplings can worsen readout-induced leakage unless carefully engineered, reshaping design rules for QEC-compatible readout.", "highlights_oneliner": "Nonlinear readout-induced leakage analysis" }, { "arxiv_id": "2606.15672", "title": "High-performance gates on trapped ion qubits using counterpropagating pulse-shaped laser beams", "authors": "Evangelos Piliouras, Hisham Amer, Susan M. Clark, Melissa C. Revelle, Edward C. Tortorici, Matthew N. H. Chow, Brandon Ruzic, Daniel S. Lobser, Brian K. McFarland, Christopher G. Yale, Edwin Barnes, Sophia E. Economou", "arxiv_url": "https://arxiv.org/abs/2606.15672", "pdf_url": "https://arxiv.org/pdf/2606.15672.pdf", "summary": "This work designs dynamically corrected single-qubit gates for trapped-ion hyperfine qubits using Space Curve Quantum Control (SCQC) with pulse-shaped counterpropagating laser beams. Gate-set tomography on a four-qubit register shows that robust SCQC pulses reduce errors by more than $50\\%$ relative to constant-amplitude implementations, with counterpropagating robust gates often outperforming copropagating ones and achieving diamond-distance errors as low as $(3.59 \\pm 1.25)\\cdot 10^{-3}$. Additional experiments indicate that these robust pulses effectively suppress non-Markovian error growth during runtime, challenging the assumption that copropagating beams are always preferable for single-qubit control.", "motivation": "Scaling trapped-ion quantum processors requires high-fidelity, localized gates that minimize hardware overhead and motional errors. Demonstrating that carefully shaped counterpropagating pulses can deliver low-error, noise-robust single-qubit gates simplifies architectures and improves overall error budgets relevant for QEC thresholds.", "highlights": [ "SCQC-designed dynamically corrected pulses for counterpropagating single-qubit gates", "More than $50\\%$ error reduction and diamond distance $\\\\sim 3.6\\times 10^{-3}$", "Suppression of non-Markovian error growth with robust pulse shapes" ], "keywords": [ { "label": "Trapped Ions", "reason": "All experiments are performed on a trapped-ion hyperfine-qubit platform." }, { "label": "Gates", "reason": "Focuses on high-performance single-qubit gate implementations with lasers." }, { "label": "SCQC", "reason": "Space Curve Quantum Control generates dynamically corrected pulse shapes." }, { "label": "Diamond", "reason": "Gate errors are quantified via diamond distance metrics from gate-set tomography." } ], "emoji": "🎯", "social_summary": "Engineer SCQC robust laser pulses on trapped ions that cut single-qubit gate errors by over half and rival copropagating schemes with strong non-Markovian noise suppression.", "highlights_oneliner": "Robust counterpropagating trapped-ion gates" }, { "arxiv_id": "2606.15558", "title": "Degeneracy Cannot Violate the Quantum Hamming Bound", "authors": "Yu-Xuan Zhang, Jing-Ling Chen", "arxiv_url": "https://arxiv.org/abs/2606.15558", "pdf_url": "https://arxiv.org/pdf/2606.15558.pdf", "summary": "The authors prove that every exact binary quantum subspace code with $K>1$ obeys the finite-length quantum Hamming bound, regardless of degeneracy or additivity assumptions. Their argument reinterprets the Li–Xing linear-programming polynomial as an exact intersection count for quaternary Hamming balls, and then uses monotonicity in block length and ball-center separation to reduce the problem to a local node–edge charging inequality at minimal length. The result shows that although degeneracy can merge correctable error sectors, it cannot increase the sphere-packing limit set by the binary quantum Hamming bound.", "motivation": "Whether degenerate quantum codes can beat the quantum Hamming bound has been a long-standing question in coding theory with implications for ultimate limits of QEC efficiency. Establishing that degeneracy does not allow violations solidifies the fundamental tradeoff between code length, dimension, and distance for exact qubit error correction.", "highlights": [ "General proof that all exact binary subspace codes with $K>1$ satisfy the quantum Hamming bound", "Recasting Li–Xing polynomials as intersection counts of quaternary Hamming balls", "Monotonicity and local charging arguments ruling out degeneracy-based violations" ], "keywords": [ { "label": "Hamming", "reason": "The core result concerns the quantum Hamming sphere-packing bound." }, { "label": "Degeneracy", "reason": "Shows that code degeneracy cannot evade the Hamming bound." }, { "label": "Subspace", "reason": "Applies to binary quantum subspace codes without additivity assumptions." }, { "label": "Bounds", "reason": "Develops rigorous finite-length performance limits for quantum codes." } ], "emoji": "📐", "social_summary": "Settle a decades-old question by proving that degenerate binary quantum codes with multiple codewords still cannot beat the quantum Hamming bound.", "highlights_oneliner": "Degeneracy respects quantum Hamming bound" }, { "arxiv_id": "2606.16451", "title": "Detecting basis-dependent hardware errors through spatio-temporal quantum steering", "authors": "Hsiang-Wei Huang, Kuo-Feng Chiu, Yi-Te Huang, Jhen-Dong Lin, Tse-Ming Chen, Yueh-Nan Chen", "arxiv_url": "https://arxiv.org/abs/2606.16451", "pdf_url": "https://arxiv.org/pdf/2606.16451.pdf", "summary": "This paper develops a statistical hypothesis test for detecting violations of the no-signaling-in-time (NSIT) condition within the spatio-temporal quantum steering framework, targeting basis-dependent hardware errors in quantum state transfer. Using the null hypothesis that NSIT violations arise solely from finite measurement statistics and combining the NSIT violation distribution with Chebyshev’s inequality, the authors derive a distribution-free upper bound on the $p$-value. Applied to single-qubit superconducting state-transfer experiments and a seven-qubit Hayden–Preskill teleportation protocol on IonQ devices, the method reveals statistically significant basis-dependent errors even when average fidelities exceed classical thresholds and nonclassicality measures vanish.", "motivation": "Standard fidelity-based benchmarks can miss subtle basis-dependent errors that degrade complex protocols despite apparently good average performance. Spatio-temporal steering with rigorous hypothesis testing offers a semi-device-independent way to reveal such hardware imperfections in near-term platforms used for QEC primitives and teleportation.", "highlights": [ "Distribution-free hypothesis test for NSIT violations in spatio-temporal steering", "$p$-value bounds that distinguish statistical fluctuations from systematic basis-dependent errors", "Experimental detection of hidden hardware errors in superconducting and trapped-ion devices" ], "keywords": [ { "label": "Steering", "reason": "Uses spatio-temporal quantum steering to characterize nonclassical dynamics." }, { "label": "NSIT", "reason": "No-signaling-in-time violations are the core diagnostic statistic." }, { "label": "Hypothesis", "reason": "Constructs a formal statistical hypothesis test with $p$-value bounds." }, { "label": "Hardware", "reason": "Targets basis-dependent imperfections in real superconducting and ion-trap devices." } ], "emoji": "🕵️", "social_summary": "Use spatio-temporal steering with rigorous hypothesis testing to uncover hidden basis-dependent errors in superconducting and ion-trap experiments beyond standard fidelity metrics.", "highlights_oneliner": "Steering-based detection of hidden hardware errors" }, { "arxiv_id": "2606.15518", "title": "Suppressing Intrinsic Spin-Phonon Errors in Trapped-Ion Quantum Simulation", "authors": "Dylan Sheils, James Wang, Or Katz", "arxiv_url": "https://arxiv.org/abs/2606.15518", "pdf_url": "https://arxiv.org/pdf/2606.15518.pdf", "summary": "The authors analyze intrinsic spin-phonon errors in trapped-ion quantum simulators implementing noncommuting spin Hamiltonians, where the same phonon bus mediates interactions and induces history-dependent errors that survive standard loop-closing controls. Using a sequence of frame transformations, they isolate the residual error dynamics and design protocols that strongly suppress these intrinsic errors while preserving programmable Ising couplings. Full spin-boson simulations of multi-ion chains show orders-of-magnitude error reduction compared to constant-drive and conventional loop-closing schemes, enabling accurate analog simulation of noncommuting many-body dynamics.", "motivation": "Phonon-mediated trapped-ion simulators are powerful platforms for many-body physics, but intrinsic spin-phonon entanglement can fundamentally limit simulation fidelity for complex Hamiltonians. Developing control strategies that tame this error without sacrificing programmability is key for exploiting trapped ions as high-precision analog quantum simulators.", "highlights": [ "Identification of intrinsic history-dependent spin-phonon errors in noncommuting simulations", "Frame-transformation analysis isolating residual error dynamics", "Protocols achieving orders-of-magnitude error reduction in multi-ion simulations" ], "keywords": [ { "label": "Trapped Ions", "reason": "Work focuses on trapped-ion chains as analog quantum simulators." }, { "label": "Spin", "reason": "Target models are spin Hamiltonians with noncommuting terms." }, { "label": "Phonon", "reason": "Phonon-mediated interactions are both resource and intrinsic error source." }, { "label": "Simulation", "reason": "Aim is high-fidelity analog simulation of many-body dynamics." } ], "emoji": "🎛️", "social_summary": "Design control protocols that suppress intrinsic spin-phonon errors in trapped-ion simulators, achieving orders-of-magnitude better accuracy for noncommuting many-body dynamics.", "highlights_oneliner": "Suppressing intrinsic spin-phonon simulation errors" }, { "arxiv_id": "2606.15464", "title": "Certified Finite-Shot Operating Windows for Virtual Distillation and Symmetry Verification", "authors": "Vicenzo Scavino Alfaro", "arxiv_url": "https://arxiv.org/abs/2606.15464", "pdf_url": "https://arxiv.org/pdf/2606.15464.pdf", "summary": "This work develops a finite-shot operating-window theory for comparing virtual distillation (VD) and symmetry verification (SV), deriving mean-squared-error laws with explicit non-asymptotic remainder constants for both methods. For VD, it rigorously analyzes the quotient estimator’s statistical bias, variance, and denominator instability, providing concentration certificates for trustworthy sample sizes; for SV, it quantifies the residual bias from symmetry-preserving errors and the sampling cost set by acceptance probability. The framework defines a trichotomy of tie, uniform dominance, or genuine tradeoff with certified crossing windows, and validates its predictions via white-box simulations, gate-level modeling, and experiments on IBM devices, concluding that calibrated SV is practically favorable for tested QAOA instances.", "motivation": "Error mitigation is central for NISQ algorithms, yet existing comparisons often rely on infinite-shot bias or heuristic performance. A certified, finite-shot theory that accounts for estimator instabilities and resource costs enables principled selection of mitigation strategies for realistic budgets and device noise.", "highlights": [ "Finite-shot MSE laws with explicit constants for VD and SV", "Denominator-stability certificates and operating windows for VD quotient estimators", "Validated operating-window trichotomy showing SV’s practical advantage in tested QAOA" ], "keywords": [ { "label": "Mitigation", "reason": "Compares and certifies quantum error mitigation strategies rather than full QEC." }, { "label": "Distillation", "reason": "Analyzes virtual distillation’s multi-copy purification estimator." }, { "label": "Symmetry", "reason": "Studies symmetry verification and its residual bias and sampling costs." }, { "label": "QAOA", "reason": "Tests operating windows on QAOA circuits in simulations and hardware." } ], "emoji": "📉", "social_summary": "Develop finite-shot operating-window theory to rigorously compare virtual distillation and symmetry verification, showing when each error-mitigation method truly wins on real devices.", "highlights_oneliner": "Finite-shot theory for VD vs SV" }, { "arxiv_id": "2606.15213", "title": "Quantum-classical hybrid models based on error correction for time series forecasting", "authors": "Jonathan H. A. de Carvalho, Filipe C. de L. Duarte, Fernando M. de Paula Neto, Paulo S. G. de Mattos Neto", "arxiv_url": "https://arxiv.org/abs/2606.15213", "pdf_url": "https://arxiv.org/pdf/2606.15213.pdf", "summary": "The paper proposes a time-series forecasting framework where quantum and classical models are combined in an error-correction configuration: quantum models first extract patterns from data using quantum phenomena, and classical models then learn the remaining structure from the quantum prediction errors. Across multiple forecasting tasks, this quantum-classical hybrid system outperforms standalone classical models and purely classical error-correction hybrids, indicating a complementary capacity between quantum and classical components. The architecture demonstrates how quantum models can be systematically integrated into established hybridization schemes beyond toy demonstrations.", "motivation": "Hybrid quantum-classical methods are a leading candidate for near-term quantum advantage in practical applications like forecasting, yet most architectures lack principled ways to combine models. Embedding quantum models into proven error-correction schemes leverages quantum pattern extraction while relying on classical strengths to correct residual errors, potentially yielding robust performance gains.", "highlights": [ "Error-correction hybrid architecture with quantum front-end and classical residual learner", "Empirical performance gains over classical and classical-classical baselines", "Demonstration of complementary representational capacity between quantum and classical models" ], "keywords": [ { "label": "Forecasting", "reason": "Main application domain is time-series forecasting problems." }, { "label": "Hybrid", "reason": "Combines quantum and classical models in a unified architecture." }, { "label": "Error", "reason": "Classical model is trained on quantum prediction errors for correction." }, { "label": "Quantum", "reason": "Uses quantum models as initial pattern extractors within the pipeline." } ], "emoji": "📈", "social_summary": "Introduce a quantum-classical error-correction forecasting system where classical models learn from quantum model residuals, outperforming classical and classical-hybrid baselines on time series tasks.", "highlights_oneliner": "Quantum-classical error-correction forecaster" }, { "arxiv_id": "2606.14901", "title": "Generalized Kerr-Cat Qubit Codes", "authors": "Alonso Viladomat, Shahram Dehdashti, Amin Kargarian, Janis Nötzel, Peter van Loock", "arxiv_url": "https://arxiv.org/abs/2606.14901", "pdf_url": "https://arxiv.org/pdf/2606.14901.pdf", "summary": "The authors construct and analyze families of Schrödinger cat codes based on Kerr-type coherent states, including displaced and Barut–Girardello Kerr coherent states with both signs of the Kerr nonlinearity, yielding four generalized Kerr cat encodings that interpolate between $\\\\mathfrak{su}(2)$ and $\\\\mathfrak{su}(1,1)$ coherent states. The nonlinear phase-space structure of these Kerr cats allows simultaneous detection and correction of photon-loss and dephasing errors within a unified recovery framework, optimized via convex optimization, and master-equation simulations show significantly improved robustness compared to standard two-component cat codes. They further show that under engineered two-photon driving, Kerr-deformed coherent-state manifolds emerge as effective steady states with strongly suppressed single-photon decoherence and only higher-order leakage outside the protected manifold, positioning Kerr cats as promising bosonic QEC candidates.", "motivation": "Bosonic codes can encode logical qubits in single modes, but standard cat codes suffer from uncorrectable bit flips from single-photon loss and limited robustness to dephasing. Generalizing to Kerr-deformed cat manifolds that support simultaneous correction of dominant noise channels and arise as engineered steady states advances practical bosonic fault tolerance in photonic platforms.", "highlights": [ "Four Kerr-type cat code families interpolating between $\\\\mathfrak{su}(2)$ and $\\\\mathfrak{su}(1,1)$", "Unified recovery that detects and corrects both photon loss and dephasing", "Engineered two-photon driving stabilizing Kerr-cat manifolds with suppressed single-photon decoherence" ], "keywords": [ { "label": "Cat Codes", "reason": "Core objects are generalized Schrödinger cat qubit encodings in a bosonic mode." }, { "label": "Kerr", "reason": "Kerr-type nonlinearities deform coherent states and define the code manifolds." }, { "label": "Bosonic", "reason": "Encodings live in single bosonic modes relevant for photonics and cavities." }, { "label": "Recovery", "reason": "Convex-optimized recovery maps jointly correct loss and dephasing errors." } ], "emoji": "🐱", "social_summary": "Develop generalized Kerr-deformed cat codes that jointly correct photon loss and dephasing and can be stabilized by driven-dissipative dynamics, outperforming standard cat codes for bosonic QEC.", "highlights_oneliner": "Generalized Kerr-deformed cat QEC codes" } ] }, "2026-06-15": { "word_cloud": [ { "word": "Decoder", "weight": 5 }, { "word": "Syndrome", "weight": 5 }, { "word": "Dem", "weight": 4 }, { "word": "Priors", "weight": 4 }, { "word": "Surface", "weight": 4 }, { "word": "Stabilizer", "weight": 4 }, { "word": "LRC", "weight": 4 }, { "word": "Matrix", "weight": 4 }, { "word": "Matching", "weight": 3 }, { "word": "Mitigation", "weight": 3 }, { "word": "Adaptive", "weight": 3 }, { "word": "Pruning", "weight": 3 }, { "word": "Covariant", "weight": 3 }, { "word": "Self", "weight": 2 } ], "social_highlights": "Highlights: quasilinear DEM equivalence checking for compiler verification, unified adaptive framework for distillation and mitigation, new quantum codes and optimal $ (r,\\delta)$-LRCs via MP codes, density-matrix propagation for optimal small-code decoding", "papers": [ { "arxiv_id": "2606.14677", "title": "Quasilinear Equivalence Checking for Detector Error Models", "authors": "Mathys Rennela", "arxiv_url": "https://arxiv.org/abs/2606.14677", "pdf_url": "https://arxiv.org/pdf/2606.14677", "summary": "This paper develops an equational theory for detector error models, formalized as a symmetric monoidal theory over the Giry monad, and proves sound, terminating, confluent rewriting with unique normal forms. It gives a quasilinear-time decision procedure for DEM equivalence with runtime $O(k|E|\\log|E|)$, where $|E|$ is the number of instructions and $k$ bounds target-set size, and uses Tanner-graph invariants to certify structural equivalence.", "motivation": "Detector error models are the standard fault descriptions used in Stim-based quantum error-correction workflows, so reliable equivalence checking directly supports compiler verification and regression testing. Static, semantics-preserving analysis matters because simulation-based heuristics can miss mismatches, especially in non-adaptive and partially adaptive pipelines.", "highlights": [ "sound confluent DEM rewriting", "quasilinear normal forms", "static decoder-equivalence procedure" ], "keywords": [ { "label": "DEM", "reason": "The central object being normalized and compared is the detector error model." }, { "label": "Giry", "reason": "The semantics are formulated categorically over the Giry monad." }, { "label": "Tanner", "reason": "Tanner graphs provide the structural invariants used for equivalence." }, { "label": "Stim", "reason": "The decision procedure is designed for Stim-like compilation pipelines." } ], "emoji": "🧩", "social_summary": "Derives a quasilinear decision procedure for detector error model equivalence, enabling rigorous verification and optimization of quantum error-correction compilers.", "highlights_oneliner": "Quasilinear DEM equivalence" }, { "arxiv_id": "2606.14034", "title": "All about quantum error correction: distillation, mitigation, self-correction and beyond", "authors": "D. -S. Wang", "arxiv_url": "https://arxiv.org/abs/2606.14034", "pdf_url": "https://arxiv.org/pdf/2606.14034", "summary": "This work argues that distillation, error mitigation, and dynamical decoupling can all be viewed as special cases of the most general quantum error-correction framework. It extends QEC to state-adaptive and channel-adaptive settings, including multi-stage coding, and proposes a self-correcting memory based on spinon polarization in $\\mathrm{AKLT}$-type systems.", "motivation": "Many near-term and asymptotic error-manipulation methods have developed in parallel, which obscures their common structure and makes comparison difficult. Unifying them under one framework matters because it clarifies design principles for reliable quantum information systems and suggests new routes to lower overhead.", "highlights": [ "unifies mitigation and distillation", "extends QEC to adaptive settings", "proposes self-correcting memory" ], "keywords": [ { "label": "Distillation", "reason": "State distillation is one of the techniques shown to fit the unified framework." }, { "label": "Mitigation", "reason": "Error mitigation is explicitly recast as a special case of QEC." }, { "label": "Adaptive", "reason": "State-adaptive and channel-adaptive coding are the main generalizations." }, { "label": "AKLT", "reason": "The proposed self-correcting memory uses AKLT-type systems." } ], "emoji": "🧠", "social_summary": "Unifies distillation, mitigation, and decoupling as adaptive quantum error correction and proposes a self-correcting memory inspired by AKLT systems.", "highlights_oneliner": "A unified view of QEC" }, { "arxiv_id": "2606.14253", "title": "Quantum codes and optimal pure quantum $(r,δ)$-LRCs via the MP construction", "authors": "Meng Cao, Kun Zhou", "arxiv_url": "https://arxiv.org/abs/2606.14253", "pdf_url": "https://arxiv.org/pdf/2606.14253", "summary": "Using MP codes with $\\tau$-optimal defining matrices, this paper constructs new quantum codes and quantum $(r,\\delta)$-locally recoverable codes. It proves a unified $\\tau$-monomial decomposition theorem for invertible self-adjoint matrices over finite fields of arbitrary characteristic, derives $\\tau$-OD matrices over $\\mathbb{F}_{q^2}$, and produces record-breaking infinite families including $222$ new quantum codes and four families of optimal pure quantum $(r,\\delta)$-LRCs.", "motivation": "Quantum codes are essential because no-cloning and decoherence prevent direct classical redundancy from working in the quantum setting. Locally recoverable quantum codes matter for storage and fault-tolerant architectures because they reduce repair overhead while preserving recoverability properties.", "highlights": [ "generalized $\\tau$-monomial decomposition", "222 record-breaking quantum codes", "four optimal LRC families" ], "keywords": [ { "label": "MP", "reason": "The matrix-product construction is the main coding framework." }, { "label": "tau-OD", "reason": "$\\tau$-optimal defining matrices drive the new code families." }, { "label": "LRC", "reason": "Optimal pure quantum $(r,\\delta)$-LRCs are a major application." }, { "label": "Grassl", "reason": "Record-breaking performance is measured against Grassl's database." } ], "emoji": "🧮", "social_summary": "Builds new quantum codes and optimal locally recoverable families via MP constructions, including 222 record-breaking codes over finite fields.", "highlights_oneliner": "Record-breaking MP quantum codes" }, { "arxiv_id": "2606.14455", "title": "Optimal Decoding of Small Codes by Density Matrix Propagation", "authors": "Anthony Benois, Pierre Cussenot, Grégoire Misguich, Nicolas Sangouard, Kiara Hansenne", "arxiv_url": "https://arxiv.org/abs/2606.14455", "pdf_url": "https://arxiv.org/pdf/2606.14455", "summary": "This paper introduces density matrix propagation as a benchmark for maximum-likelihood decoding under circuit-level noise, propagating the full memory experiment to compute the optimal decision for each syndrome history. It adds pruning methods with rigorous bounds to scale to more rounds, and benchmarks MWPM, BP+OSD, Tesseract, and Planar decoders on repetition and cellular-automaton codes, finding strong code-dependent deviations from optimality.", "motivation": "Practical decoders are usually heuristic because exact maximum-likelihood decoding becomes intractable once temporal correlations and degeneracy are present. A rigorous benchmark matters because it reveals when standard decoders are close to optimal and when they fail badly in experimentally relevant regimes.", "highlights": [ "exact decoding benchmark", "rigorous syndrome pruning", "decoder-by-decoder comparison" ], "keywords": [ { "label": "DMP", "reason": "Density matrix propagation is the core exact benchmark method." }, { "label": "MWPM", "reason": "Minimum-weight perfect matching is one of the compared baseline decoders." }, { "label": "Pruning", "reason": "Pruning strategies enable deeper syndrome-history exploration." }, { "label": "Cellular", "reason": "The cellular automaton code shows strong deviations from standard decoding." } ], "emoji": "📉", "social_summary": "Benchmarks practical decoders against exact density-matrix propagation and shows where heuristic decoding departs from optimality.", "highlights_oneliner": "Exact decoding for small codes" } ] }, "2026-06-12": { "word_cloud": [ { "word": "Transversal", "weight": 4 }, { "word": "Surface", "weight": 5 }, { "word": "Clifford", "weight": 3 }, { "word": "Routing", "weight": 3 }, { "word": "Magic", "weight": 3 }, { "word": "Circuits", "weight": 4 }, { "word": "Distance", "weight": 5 }, { "word": "Flux", "weight": 3 }, { "word": "Mana", "weight": 2 }, { "word": "GKP", "weight": 5 }, { "word": "Squeezed", "weight": 3 }, { "word": "Decoders", "weight": 4 }, { "word": "Tanner", "weight": 2 }, { "word": "Morphing", "weight": 3 }, { "word": "Mana", "weight": 2 } ], "social_highlights": "Highlights: depth-one transversal Clifford logic codes, invariant measures for monitored dynamics, theory of non-isometric approximate codes, block-algebra morphing circuits, optimal QRAC measurements, QLDPC distance via SAT/MaxSAT, leakage-suppressed iSWAP, surface-code-based routing, and optical GKP from photon-added squeezing.", "papers": [ { "arxiv_id": "2606.13521", "title": "Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes", "authors": "Adam Holmes", "arxiv_url": "https://arxiv.org/abs/2606.13521", "pdf_url": "https://arxiv.org/pdf/2606.13521", "summary": "This paper develops a general theory of transversal Clifford logic in stabilizer, particularly CSS, codes and derives universal lower bounds on circuit depth needed to generate a full logical Clifford algebra. It constructs new depth-one transversal logical gates in rotated surface and $2$D toric codes and introduces a tunable high-rate non-LDPC CSS family with parameters $[[n,\\sqrt{n},\\Theta(n^{\\beta})]]$ that admits a constant-depth, fully addressable, $2$-local transversal logical Clifford instruction set that scales under tiling and concatenation.", "motivation": "Conventional fault-tolerant architectures often rely on ancilla-heavy gadgets and magic-state distillation to realize logical Clifford and non-Clifford gates, which can dominate overhead. Understanding and engineering code families with complete transversal Clifford sets at constant depth is crucial for scalable architectures that minimize space-time overhead and potentially circumvent practical limitations implied by Eastin–Knill-type constraints.", "highlights": [ "Derives universal lower bounds on circuit depth for realizing full logical Clifford algebras in stabilizer codes", "Constructs depth-one transversal $\\overline{S}$ in rotated surface codes and intra-block $\\overline{CZ}$ in $2$D toric codes for all odd $d$ and $L\\ge 3$", "Introduces high-rate CSS Quantum Logic Codes with constant-depth $2$-local complete transversal Clifford ISA preserved under tiling and concatenation" ], "keywords": [ { "label": "CSS", "reason": "The work builds a detailed theory of transversal Clifford logic specialized to CSS stabilizer codes parameterized by $H_X$ and $H_Z$ matrices." }, { "label": "Clifford", "reason": "The central focus is constructing a complete logical Clifford group via transversal and multi-layer gates within stabilizer codes." }, { "label": "Transversal", "reason": "The paper emphasizes depth-one and constant-depth transversal gate layers, including addressable $2$-local implementations." }, { "label": "Surface", "reason": "Explicit constructions provide new depth-one transversal phase gates in rotated surface codes and generalized $\\overline{CZ}$ on toric/surface-like lattices." } ], "emoji": "🧱", "social_summary": "Designs \"Quantum Logic Codes\" that support full logical Clifford gates via constant-depth transversal operations, including new depth-one gates in surface and toric codes for scalable fault-tolerant architectures.", "highlights_oneliner": "Depth-one transversal Clifford logic in high-rate CSS codes" }, { "arxiv_id": "2606.13470", "title": "Invariant Measures and Weak-Magic-Injection Asymptotics in Random Monitored Quantum Circuits", "authors": "Guocheng Zhen, Xuanrong Yang, Chengkai Zhu, Ranyiliu Chen, Xin Wang", "arxiv_url": "https://arxiv.org/abs/2606.13470", "pdf_url": "https://arxiv.org/pdf/2606.13470", "summary": "The authors develop a rigorous analytical framework for random monitored quantum circuits driven by random Clifford dynamics with weak non-Clifford perturbations. They prove existence and uniqueness of a stationary law describing the ergodic long-time behavior and obtain leading weak-magic-injection asymptotics for steady-state nonstabilizer resources, revealing linear scaling for Gross–Wigner mana in odd-prime dimensions versus quadratic scaling for $2$-stabilizer Rényi entropy in qubit systems.", "motivation": "Monitored quantum circuits and measurement-induced phase transitions have mostly been understood via numerics, leaving a need for rigorous probabilistic descriptions. Clarifying how small non-Clifford perturbations inject magic into stabilizer-preserving dynamics is important for resource theories, fault tolerance, and understanding scrambling in noisy intermediate-scale devices.", "highlights": [ "Establishes existence and uniqueness of an invariant stationary measure for random monitored Clifford-driven circuits", "Derives leading weak-injection asymptotics of steady-state magic resources via a tangent description near the stabilizer manifold", "Shows contrasting linear (mana) vs quadratic (stabilizer Rényi) scalings across local dimensions due to differing resource-geometry near stabilizers" ], "keywords": [ { "label": "Magic", "reason": "The work quantifies nonstabilizer magic resources, including Gross–Wigner mana and stabilizer Rényi entropy, under weak injection." }, { "label": "Monitored", "reason": "It analyzes random monitored quantum circuits with measurements and conditional updates." }, { "label": "Clifford", "reason": "Random Clifford evolution forms the core stabilizer-preserving dynamics whose perturbations are studied." }, { "label": "Ergodic", "reason": "The main technical contribution is proving a unique stationary law and ergodic long-time behavior for the dynamics." } ], "emoji": "✨", "social_summary": "Builds a rigorous ergodic theory for random monitored Clifford circuits, revealing how weak non-Clifford magic injection shapes stationary resource measures in different local dimensions.", "highlights_oneliner": "Ergodic magic asymptotics in monitored Clifford circuits" }, { "arxiv_id": "2606.13559", "title": "Approximate quantum error correction theory of non-isometric codes", "authors": "Yixu Wang, Yijia Xu, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2606.13559", "pdf_url": "https://arxiv.org/pdf/2606.13559", "summary": "This work develops a general approximate quantum error correction framework for non-isometric encodings, where logical inner products are not preserved exactly by the encoding map. It quantifies fundamental limitations on achievable error-correction accuracy and logical gate implementation for such encodings and applies the theory to energy-constrained continuous-variable codes like GKP and tiger codes, with implications for holographic quantum gravity scenarios.", "motivation": "Most QEC theory assumes isometric encoders and perfectly orthogonal codewords, assumptions violated in realistic continuous-variable implementations and in holographic dualities where bulk states outnumber boundary degrees of freedom. A systematic treatment of non-isometric codes is needed to understand how experimental constraints and holographic embeddings affect correctability and logical operations.", "highlights": [ "Formulates a systematic approximate QEC theory tailored to non-isometric encoding channels", "Derives quantitative bounds on error-correction performance and logical operation accuracy imposed by non-orthogonal codewords", "Applies the framework to energy-constrained GKP and tiger codes and discusses implications for AdS/CFT-style holographic encoding" ], "keywords": [ { "label": "Nonisometric", "reason": "The encoding maps considered are non-isometric channels with non-orthogonal codewords, central to the theory developed." }, { "label": "GKP", "reason": "Continuous-variable GKP codes under energy constraints serve as a key application of the framework." }, { "label": "Holography", "reason": "The paper connects non-isometric QEC to AdS/CFT-like bulk-to-boundary encoding scenarios." }, { "label": "Approximate", "reason": "It uses approximate QEC notions to quantify limitations rather than exact error correction." } ], "emoji": "🌉", "social_summary": "Builds a general approximate QEC framework for non-isometric encodings, clarifying limits for energy-constrained CV codes like GKP and for holographic bulk-to-boundary mappings.", "highlights_oneliner": "Approximate QEC for non-isometric encoders" }, { "arxiv_id": "2606.12724", "title": "Block algebra for morphing circuits", "authors": "Rui Chao", "arxiv_url": "https://arxiv.org/abs/2606.12724", "pdf_url": "https://arxiv.org/pdf/2606.12724", "summary": "The paper introduces a block-algebra formalism for describing CNOT-based CSS morphing circuits, grouping qubits and checks into blocks whose stabilizer entries are permutation matrices or their sums over $\\mathbb{F}_2$. Using this framework, it rewrites known hex-grid surface-code and middle-out color-code morphing circuits and constructs a new three-round morphing circuit modeled on the $6.6.6$ color code, enabling systematic exploration via numerical instantiation of group-algebra permutations.", "motivation": "Morphing circuits reuse data qubits as measurement workspace to reduce ancilla overhead, but their design has been largely ad hoc and tied to specific layouts. A unifying algebraic description for translation-invariant morphing circuits can streamline construction, clarify distance properties mid-cycle, and potentially extend morphing ideas to higher-rate or subsystem codes.", "highlights": [ "Develops a block-algebra representation of CSS morphing circuits where CNOT layers act as coupled column operations on block stabilizer matrices", "Recovers existing surface- and color-code morphing circuits within a group-algebra template using permutation-matrix blocks", "Proposes a new three-round morphing construction inspired by the $6.6.6$ color code and identifies open problems on mid-cycle distance and high-rate extensions" ], "keywords": [ { "label": "Morphing", "reason": "Morphing syndrome-extraction circuits that repeatedly contract and expand the code are the central object of study." }, { "label": "Surface", "reason": "The framework recovers hex-grid surface-code morphing circuits within block algebra." }, { "label": "Color", "reason": "Middle-out and $6.6.6$ color-code-based morphing circuits are formulated in the same algebraic language." }, { "label": "Algebra", "reason": "Block algebra and group algebras over permutation matrices underpin the circuit description and Gaussian-elimination viewpoint." } ], "emoji": "🧩", "social_summary": "Defines a block-algebra framework that unifies and extends surface- and color-code morphing circuits, including a new $6.6.6$-based three-round construction for ancilla-free syndrome extraction.", "highlights_oneliner": "Block-algebra framework for CSS morphing circuits" }, { "arxiv_id": "2606.12700", "title": "Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality", "authors": "Seiseki Akibue, Rudy Raymond, Suguru Tamaki, Kosei Teramoto", "arxiv_url": "https://arxiv.org/abs/2606.12700", "pdf_url": "https://arxiv.org/pdf/2606.12700", "summary": "This work reformulates optimal quantum random access code decoding probabilities as a spectral problem over noncommuting measurements and provides an elementary proof of Nayak's bound via a simplified Chernoff-style argument. Refining this approach, it derives improved finite-size upper bounds, introduces mutually unbiased projector-valued measurements (MUPVMs), and constructs QRAC families, including $(M+2,M)$ schemes, that saturate conjectured small-qubit optimal decoding probabilities with MUPVM-based decoders.", "motivation": "Nayak's bound has long been the canonical limitation on QRAC performance, but evidence suggests it is not tight for realistic small-$M$ settings crucial in protocols like dimension witnesses and cryptographic primitives. Understanding the measurement geometry that governs optimal QRACs and characterizing when stronger bounds apply can sharpen performance guarantees and guide experimental designs.", "highlights": [ "Recasts QRAC optimization into a spectral problem for decoding measurements and proves Nayak's bound with an elementary argument", "Derives stronger finite-size upper bounds on QRAC decoding probabilities that improve upon Nayak across relevant regimes", "Defines MUPVMs and shows they underpin optimal two-qubit QRACs and an $(M+2,M)$ QRAC family attaining conjectured decoding performance" ], "keywords": [ { "label": "QRACs", "reason": "Quantum random access codes are the main primitive studied, with focus on their optimal decoding probabilities." }, { "label": "Measurements", "reason": "The approach centers on the geometry and spectra of decoding measurements, including projective POVMs and MUPVMs." }, { "label": "Bounds", "reason": "The paper sharpens Nayak's information-theoretic bound with improved finite-size constraints on success probability." }, { "label": "MUPVMs", "reason": "Mutually unbiased projector-valued measurements are introduced as a generalized unbiasedness notion characterizing optimal decoders." } ], "emoji": "🎯", "social_summary": "Explores the geometry of decoding measurements to sharpen QRAC bounds beyond Nayak and shows how MUPVMs enable near-optimal small-qubit random access codes.", "highlights_oneliner": "Measurement-geometry bounds and MUPVM-based optimal QRACs" }, { "arxiv_id": "2606.12445", "title": "SAT, MaxSAT, and SMT for QLDPC Distance Computation: A Large-Scale Empirical Study", "authors": "Yu-Fang Chen, Seyed Mohammad Reza Jafari, Ching-Yi Lai", "arxiv_url": "https://arxiv.org/abs/2606.12445", "pdf_url": "https://arxiv.org/pdf/2606.12445", "summary": "The authors perform a large-scale empirical comparison of SAT-, MaxSAT-, and SMT-based formulations for exact distance computation in representative quantum LDPC codes. They show that scalability is governed more by handling cardinality and optimization constraints than by XOR reasoning, that Brouwer–Zimmermann-style searches lose their classical advantage in the QLDPC setting, and that branch-and-bound MaxSAT architectures significantly outperform unsat-core-based MaxSAT on challenging instances.", "motivation": "Exact computation of the distance of modern QLDPC constructions is crucial for validating fault-tolerant performance but is computationally challenging and poorly understood. Systematically benchmarking different solver paradigms helps identify algorithmic bottlenecks and guides future tooling for large-scale QLDPC design and verification.", "highlights": [ "Benchmarks SAT, MaxSAT, and SMT formulations for exact QLDPC distance computation across diverse modern code families", "Finds that cardinality and optimization constraints dominate scalability, with XOR-aware reasoning offering no consistent advantage", "Demonstrates that branch-and-bound MaxSAT outperforms unsat-core-based MaxSAT and that classical Brouwer–Zimmermann search loses its traditional edge for QLDPCs" ], "keywords": [ { "label": "QLDPC", "reason": "Quantum LDPC codes, including Tanner and lifted product families, provide the distance instances under study." }, { "label": "Distance", "reason": "Exact minimum distance computation is the central computational task being formulated and benchmarked." }, { "label": "MaxSAT", "reason": "MaxSAT formulations and solver architectures, particularly branch-and-bound vs unsat-core, are a main focus." }, { "label": "SMT", "reason": "SMT and SAT approaches are compared as alternative formulations for encoding low-weight logical operators." } ], "emoji": "🧮", "social_summary": "Benchmarks SAT, MaxSAT, and SMT formulations for exact QLDPC distance, revealing cardinality handling and branch-and-bound MaxSAT as key drivers of practical scalability.", "highlights_oneliner": "Empirical study of SAT/MaxSAT/SMT for QLDPC distance" }, { "arxiv_id": "2606.13052", "title": "Simple analytical flux-tuned iSWAP pulses for leakage suppression", "authors": "Dimitrios Georgiadis, Boxi Li, Asier Galicia, Rami Barends, F. A. Cárdenas-López, Felix Motzoi", "arxiv_url": "https://arxiv.org/abs/2606.13052", "pdf_url": "https://arxiv.org/pdf/2606.13052", "summary": "This paper presents an analytical flux-control method, $\\Phi$-DRAG, which adapts derivative removal by adiabatic gate principles to flux-tunable couplers implementing iSWAP-type two-qubit gates. By designing modified flux modulation protocols, it suppresses leakage to non-computational levels below $10^{-4}$ while enabling fast entangling gates on the order of tens of nanoseconds across a range of qubit anharmonicities and circuit parameters.", "motivation": "Two-qubit gate errors, particularly leakage in fast flux-tunable coupler operations, remain a bottleneck for scalable superconducting quantum processors despite improving coherence times. Analytical pulse designs that mitigate leakage without extensive numerical optimization can simplify calibration and improve gate fidelities toward fault-tolerance thresholds.", "highlights": [ "Introduces $\\Phi$-DRAG, an analytical flux-tuning method distinct from microwave DRAG for leakage mitigation in tunable-coupler gates", "Derives modified flux modulation pulses achieving leakage suppression below $10^{-4}$ for fast iSWAP-type entangling gates", "Shows robustness of the approach across varying qubit anharmonicities and device parameters, supporting $\\sim 15$ ns high-fidelity two-qubit operations" ], "keywords": [ { "label": "Flux", "reason": "The method designs tailored flux modulation waveforms for tunable coupler frequency control." }, { "label": "iSWAP", "reason": "Target entangling operations are iSWAP-like two-qubit gates implemented via the coupler." }, { "label": "Leakage", "reason": "Suppression of population leakage to higher transmon levels is the primary performance metric." }, { "label": "Transmons", "reason": "The work focuses on superconducting transmon qubits coupled via a flux-tunable nonlinear element." } ], "emoji": "⚡", "social_summary": "Introduces analytical $\\Phi$-DRAG flux pulses that strongly suppress leakage in fast tunable-coupler iSWAP gates, enabling high-fidelity two-qubit operations in superconducting qubit devices.", "highlights_oneliner": "Analytical flux pulses for low-leakage iSWAP gates" }, { "arxiv_id": "2606.12781", "title": "Quantum Network Routing based on Surface Code Error Correction", "authors": "Tianjie Hu, Jindi Wu, Qun Li", "arxiv_url": "https://arxiv.org/abs/2606.12781", "pdf_url": "https://arxiv.org/pdf/2606.12781", "summary": "The paper proposes SurfNet, a quantum network architecture that uses surface codes as logical qubits and two parallel channels—an entanglement-based channel and a direct transmission channel—to route encoded messages fault-tolerantly. It introduces a custom decoder tailored to the modularity of surface-code blocks and shows via simulations that SurfNet and its decoder significantly improve end-to-end communication fidelity and throughput over baselines and Union-Find decoding in various network scenarios.", "motivation": "Quantum networks must combat channel noise and photon loss while maintaining reasonable throughput, and existing designs often either emphasize teleportation using entanglement or direct transmission without full fault tolerance. Leveraging surface-code error correction directly at the network layer can combine robustness with efficiency, enabling more scalable quantum internet architectures.", "highlights": [ "Designs SurfNet, a routing architecture that treats surface codes as modular logical qubits moving through a dual-channel network", "Develops a SurfNet-specific decoder that exploits the modular structure of surface-code tiles along network paths", "Demonstrates through simulations that SurfNet and its decoder yield higher communication fidelity and throughput than baseline quantum networking schemes and Union-Find decoding" ], "keywords": [ { "label": "Surface", "reason": "Each logical message is encoded as a surface code patch serving as the fundamental network qubit." }, { "label": "Routing", "reason": "The work focuses on path selection and message movement in quantum networks using encoded qubits." }, { "label": "Channels", "reason": "Two parallel network channels—entanglement-based and plain—are combined to balance reliability and throughput." }, { "label": "Decoder", "reason": "A specialized SurfNet decoder is designed to exploit modular code structure for improved error correction." } ], "emoji": "🌐", "social_summary": "Introduces SurfNet, a surface-code-based quantum routing architecture with dual channels and a tailored decoder that boosts network fidelity and throughput against noise and losses.", "highlights_oneliner": "Surface-code-based dual-channel quantum routing" }, { "arxiv_id": "2606.12467", "title": "Theoretical Study for Generating Optical GKP State via a Single-Photon-Added Squeezed Vacuum", "authors": "Deriyan Senjaya", "arxiv_url": "https://arxiv.org/abs/2606.12467", "pdf_url": "https://arxiv.org/pdf/2606.12467", "summary": "This work analyzes a scheme to generate optical Gottesman–Kitaev–Preskill states using a single-photon-added squeezed vacuum, which is injected into a $50{:}50$ beam splitter and postselected by conditional measurement. Using fidelity as a figure of merit, it finds that the protocol can produce the target finite-energy GKP state $\\psi_{\\text{GKP}}^{-}$ with up to $85\\%$ fidelity at a squeezing level of $3.76\\,\\text{dB}$, outperforming prior approaches based on squeezed odd Schrödinger cat states while requiring only a single squeezing parameter.", "motivation": "GKP bosonic codes are a leading candidate for fault-tolerant photonic quantum computing, but experimentally generating high-fidelity optical GKP states is extremely challenging, especially with limited squeezing. Identifying simpler resource states and realistic parameter regimes for GKP preparation can accelerate experimental demonstrations and integration with photonic error-correction architectures.", "highlights": [ "Proposes generating optical GKP states via single-photon-added squeezed vacuum passed through a balanced beam splitter with conditional detection", "Shows that the scheme reaches $\\sim 85\\%$ fidelity to $\\psi_{\\text{GKP}}^{-}$ at $3.76\\,\\text{dB}$ squeezing, exceeding cat-state-based protocols", "Highlights practical advantages of relying on a single squeezing parameter, making implementation more accessible to current photonic platforms" ], "keywords": [ { "label": "GKP", "reason": "The target states are optical Gottesman–Kitaev–Preskill code states suitable for bosonic error correction." }, { "label": "Squeezing", "reason": "Finite squeezing, quantified in dB, is the key experimental resource governing state quality." }, { "label": "Photonic", "reason": "The scheme is tailored to optical modes and photonic quantum computing platforms." }, { "label": "Postselection", "reason": "Conditional measurement at one output port is essential to project onto the approximate GKP state." } ], "emoji": "💡", "social_summary": "Analyzes generating optical GKP states from single-photon-added squeezed vacua, achieving about 85 percent fidelity at modest squeezing and simplifying resources compared to cat-state schemes.", "highlights_oneliner": "Optical GKP from photon-added squeezed vacuum" } ] }, "2026-06-11": { "word_cloud": [ { "word": "Decoders", "weight": 5 }, { "word": "Surface", "weight": 4 }, { "word": "Toric", "weight": 4 }, { "word": "Ising", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "Syndrome", "weight": 3 }, { "word": "Thresholds", "weight": 4 }, { "word": "Hamiltonian", "weight": 3 }, { "word": "Rydberg", "weight": 4 }, { "word": "Entanglement", "weight": 5 }, { "word": "Purification", "weight": 3 }, { "word": "Depolarizing", "weight": 3 }, { "word": "Stabilizer", "weight": 3 }, { "word": "Circuits", "weight": 4 }, { "word": "Lattices", "weight": 2 } ], "social_highlights": "Highlights: a comprehensive error-correction handbook, improved logical error estimation from syndromes, faster Ising decoders, optimal channel purification codes, measurement-free toric memories, and CNOT-optimized entanglement-assisted LDPC encoders.", "papers": [ { "arxiv_id": "2606.11484", "title": "Handbook of Error-Correcting Codes", "authors": "Victor V. Albert, Philippe Faist", "arxiv_url": "https://arxiv.org/abs/2606.11484", "pdf_url": "https://arxiv.org/pdf/2606.11484.pdf", "summary": "This work presents a handbook version of The Error Correction Zoo, systematically cataloging classical and quantum error-correcting codes and classifying them by the symbols they use. It documents relationships among codes and related structures such as sphere packings, lattices, designs, groups, and phases of matter, providing both a rigorous reference and a practical tool for exploring code interconnections.", "motivation": "As the landscape of classical and quantum codes has grown, knowledge has become fragmented across subfields, making it hard to navigate design tradeoffs and structural connections. A unified, curated handbook matters because it accelerates code discovery, cross-pollinates ideas between communities, and supports practical architecture choices for large-scale devices.", "highlights": [ "Curated taxonomy of classical and quantum codes", "Mapping between codes and mathematical structures", "Reference for discovering new code connections" ], "keywords": [ { "label": "Taxonomy", "reason": "The paper builds a structured classification of error-correcting codes across families and symbol types." }, { "label": "Lattices", "reason": "It explicitly connects codes to lattice and sphere packing constructions." }, { "label": "Phases", "reason": "The handbook links certain codes to classical and quantum phases of matter." }, { "label": "Designs", "reason": "It catalogues relations between codes and combinatorial designs." } ], "emoji": "📚", "social_summary": "Explore a new handbook that unifies classical and quantum error-correcting codes into a single, navigable atlas for researchers and engineers.", "highlights_oneliner": "Comprehensive atlas of classical and quantum codes" }, { "arxiv_id": "2606.11496", "title": "Logical error estimation from syndrome data of surface-code experiments", "authors": "Evangelia Takou, Cesar Benito, Arian Vezvaee, Daniel A. Lidar, Kenneth R. Brown", "arxiv_url": "https://arxiv.org/abs/2606.11496", "pdf_url": "https://arxiv.org/pdf/2606.11496.pdf", "summary": "This paper shows how to estimate detector error model (DEM) event probabilities directly from experimental syndrome data in surface-code memories, bypassing independent device benchmarking. Using data from Google's Willow chip and IBM's $\\texttt{ibm\\_miami}$, the learned DEMs improve decoded logical error probabilities by roughly $5\\%$–$10\\%$ or more compared with baseline device-informed priors, and enable SPAM-normalized lower bounds on logical entanglement fidelity from $\\lvert + \\rangle$ and $\\lvert 0 \\rangle$ memory experiments.", "motivation": "Traditional decoders rely on separate calibration and noise characterization, which can be inaccurate or too costly in rapidly evolving hardware. Learning decoder priors from syndrome streams matters because it ties logical performance directly to observed data, enabling more accurate, calibration-light operation of large-distance surface-code memories.", "highlights": [ "Learns DEM event rates from raw syndromes", "Improves logical error rates on Google and IBM data", "Derives SPAM-normalized entanglement fidelity lower bounds" ], "keywords": [ { "label": "Surface", "reason": "The method is demonstrated on surface-code memory experiments on Google and IBM devices." }, { "label": "Syndrome", "reason": "DEM parameters are inferred directly from observed syndrome and detector event data." }, { "label": "Priors", "reason": "The core contribution is optimizing decoder priors through DEM probability estimation." }, { "label": "Fidelity", "reason": "It uses logical error data to bound entanglement fidelity as a basis-independent performance metric." } ], "emoji": "📈", "social_summary": "Learn how fitting detector error models directly from surface-code syndromes sharpens decoder priors and boosts logical performance on real Google and IBM devices.", "highlights_oneliner": "Data-driven priors for surface-code decoding" }, { "arxiv_id": "2606.12301", "title": "An iterative Ising decoder for quantum error correction codes", "authors": "Yuanqi Liu, Weilei Zeng, Peixiang Li, Yantong Liu, Guangyao Huang, Yingwen Liu, Dongyang Wang, Junjie Wu, Lingling Lao", "arxiv_url": "https://arxiv.org/abs/2606.12301", "pdf_url": "https://arxiv.org/pdf/2606.12301.pdf", "summary": "The authors introduce the iterative low-order decoding (ILOD) algorithm, which alternates between $X$- and $Z$-type Ising sub-Hamiltonians and propagates cross-type correlations via Bayesian priors, halving the maximum interaction order under depolarizing noise. For toric and $6.6.6$ color codes, ILOD nearly matches the joint Ising-decoder threshold (e.g., $4.73\\%$ vs. $4.83\\%$ for the toric code) while improving runtime scaling and enabling convergence at larger code distances with fewer spins for $2$-body hardware embeddings.", "motivation": "Ising-based decoders can incorporate complex correlations and map naturally to specialized hardware, but high-order interactions from depolarizing noise severely hurt scalability. Reducing interaction order while preserving threshold performance matters for turning coherent Ising machines, quantum annealers, and digital annealers into practical low-latency decoders for topological and $\\text{CSS}$ codes.", "highlights": [ "Alternating Ising sub-Hamiltonians reduce interaction order", "Toric code threshold $4.73\\%$ with faster scaling", "Restores convergence and cuts spins for $2$-body embeddings" ], "keywords": [ { "label": "Ising", "reason": "The decoder maps QEC decoding to Ising Hamiltonian optimization with modified interaction order." }, { "label": "Toric", "reason": "Performance and thresholds are benchmarked on toric codes under depolarizing noise." }, { "label": "Color", "reason": "The algorithm is also tested on $6.6.6$ color codes, comparing to joint Ising decoding." }, { "label": "Annealers", "reason": "The reduced-body Hamiltonians target native $2$-body Ising hardware like quantum and digital annealers." } ], "emoji": "🧊", "social_summary": "Speed up Ising-based decoders with an iterative low-order scheme that preserves thresholds while enabling larger toric and color codes on realistic Ising hardware.", "highlights_oneliner": "Iterative low-order Ising decoding for topological codes" }, { "arxiv_id": "2606.12394", "title": "Scaling-optimal purification of noisy qubit unitary channels", "authors": "Ryotaro Niwa, Satoshi Yoshida, Koki Ono, Takeru Utsumi, Zhaoyi Li, Yuxiang Yang, Ryuji Takagi, Mio Murao", "arxiv_url": "https://arxiv.org/abs/2606.12394", "pdf_url": "https://arxiv.org/pdf/2606.12394.pdf", "summary": "This work studies purification of an unknown qubit unitary channel followed by depolarizing noise, formulating the task as an SDP and numerically comparing sequential and parallel strategies for small $n$. It then constructs a $\\mathrm{U}(2)$-covariant entanglement-assisted quantum error-correcting code that, in a parallel protocol, suppresses first-order noise as $O(1/n)$, and proves this scaling is asymptotically optimal in the low-noise regime even when arbitrary sequential strategies are allowed.", "motivation": "While state purification is well understood, channel purification with general causal structures is far less explored, especially for unknown gates. Establishing optimal noise-suppression scaling and clarifying when sequential use of channels helps is crucial for resource-efficient gate distillation and high-fidelity logical operations in fault-tolerant architectures.", "highlights": [ "Identifies sequential advantage at finite $n$ via SDP", "Designs $\\mathrm{U}(2)$-covariant entanglement-assisted code", "Proves $O(1/n)$ noise suppression is asymptotically optimal" ], "keywords": [ { "label": "Purification", "reason": "The central task is purifying noisy unitary channels toward the original gate." }, { "label": "Superchannels", "reason": "The work optimizes over superchannels, including sequential and parallel causal structures." }, { "label": "Depolarizing", "reason": "The noise model is depolarizing noise following an unknown qubit unitary." }, { "label": "Covariant", "reason": "A $\\mathrm{U}(2)$-covariant QECC underpins the optimal channel purification protocol." } ], "emoji": "🔄", "social_summary": "Discover scaling-optimal protocols that purify noisy qubit unitaries using entanglement-assisted codes and reveal when sequential use of channels really helps.", "highlights_oneliner": "Optimal scaling for noisy unitary purification" }, { "arxiv_id": "2606.12030", "title": "Measurement-Free Toric-Code Memory in Array Globally Controlled Rydberg Array", "authors": "Han Wang, Yusheng Zhao, Xiuhao Deng, Jinguo Liu", "arxiv_url": "https://arxiv.org/abs/2606.12030", "pdf_url": "https://arxiv.org/pdf/2606.12030.pdf", "summary": "The authors propose a toric-code quantum memory implemented in neutral-atom Rydberg arrays that eliminates mid-circuit measurements, atom transport, and local addressing by using three atomic species and global, species-selective laser pulses. Simulations of a $4\\times 4$ rotated toric code show extended logical lifetimes below a pseudo-threshold $p^{\\star} \\approx 0.034$, offering a hardware-efficient route to topological memory on neutral-atom platforms.", "motivation": "State-of-the-art Rydberg arrays have fast, high-fidelity entangling gates, but auxiliary operations like fluorescence readout and atom shuttling dominate latency and errors. Designing a fully coherent, globally driven stabilizer cycle matters because it aligns QEC primitives with the natural hardware strengths, potentially enabling scalable topological memories without costly measurement infrastructure.", "highlights": [ "Implements toric memory without mid-circuit measurement", "Uses three-species global control in Rydberg arrays", "Achieves pseudo-threshold $p^{\\star} \\approx 0.034$ in simulations" ], "keywords": [ { "label": "Rydberg", "reason": "The protocol is tailored to neutral-atom Rydberg arrays with global laser control." }, { "label": "Toric", "reason": "A rotated toric code provides the topological quantum memory." }, { "label": "Global", "reason": "Only global, species-selective pulses are used, avoiding local addressing." }, { "label": "Measurement", "reason": "The scheme removes mid-circuit measurement from the stabilizer cycle." } ], "emoji": "🧱", "social_summary": "Stabilize toric-code memory on Rydberg arrays using only global multi-species control, sidestepping mid-circuit measurements, shuttling, and local addressing.", "highlights_oneliner": "Measurement-free toric memory in Rydberg arrays" }, { "arxiv_id": "2606.11468", "title": "Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search", "authors": "Aditya Sodhani, Pavan Kumar, Shayan Srinivasa Garani, Keshab K. Parhi", "arxiv_url": "https://arxiv.org/abs/2606.11468", "pdf_url": "https://arxiv.org/pdf/2606.11468.pdf", "summary": "This paper formulates optimization of entanglement-assisted QC-LDPC encoder circuits as a $\\mathrm{GF}(2)$ row-operation search on the binary matrix corresponding to the CNOT sub-sequence of the Sharma–Kumar–Garani construction. Using a Hamming-distance-guided beam search, it reduces CNOT counts by $7.3$–$34.0\\%$ across several EA QC-LDPC families, outperforming Patel–Markov–Hayes synthesis and validating correctness via stabilizer-tableau simulation.", "motivation": "EA quantum LDPC codes promise strong performance with structured parity checks, but encoder complexity and two-qubit gate count are critical bottlenecks for near-term hardware. Systematically minimizing CNOT usage directly improves encoder fidelity and makes sophisticated EA LDPC constructions more practical for large-scale fault-tolerant architectures.", "highlights": [ "Beam search over $\\mathrm{GF}(2)$ row operations cuts CNOTs", "Achieves up to $34\\%$ reduction on $[[49,12;1]]$", "Outperforms generic PMH synthesis on all tested encoders" ], "keywords": [ { "label": "LDPC", "reason": "The focus is on entanglement-assisted QC-LDPC quantum codes and their encoders." }, { "label": "Encoders", "reason": "It directly targets encoder circuit synthesis and simplification." }, { "label": "CNOT", "reason": "The main metric is reducing CNOT gate count in the encoder circuit." }, { "label": "Beam", "reason": "A beam search heuristic drives the discrete optimization over row operations." } ], "emoji": "⚙️", "social_summary": "Slash CNOT counts in entanglement-assisted QC-LDPC encoders using a clever beam search over binary row operations, outperforming generic synthesis methods.", "highlights_oneliner": "Beam-searched CNOT-efficient EA LDPC encoders" } ] }, "2026-06-10": { "word_cloud": [ { "word": "Magic", "weight": 5 }, { "word": "States", "weight": 5 }, { "word": "Cultivation", "weight": 4 }, { "word": "Bosonic", "weight": 5 }, { "word": "Cyclic", "weight": 4 }, { "word": "Gaussian", "weight": 4 }, { "word": "Decoder", "weight": 5 }, { "word": "Coset", "weight": 4 }, { "word": "Surface", "weight": 3 }, { "word": "Lattice", "weight": 3 }, { "word": "Stabilizer", "weight": 4 }, { "word": "Rotation", "weight": 4 }, { "word": "Binary", "weight": 2 }, { "word": "Hardware", "weight": 3 }, { "word": "Syndrome", "weight": 4 } ], "social_highlights": "Highlights: magic state cultivation for $\\sqrt{T}$ gates with color-code escape strategies, bosonic cyclic codes trading stabilizers for Gaussian phase gates, and a coset ensemble decoder co-designed for low-latency hardware.", "papers": [ { "arxiv_id": "2606.10430", "title": "Efficient Magic State Cultivation for $\\sqrt{T}$ Gates", "authors": "I-Chi Chen, Matheus da Silva Fonseca, Andrew Sornborger", "arxiv_url": "https://arxiv.org/abs/2606.10430", "pdf_url": "https://arxiv.org/pdf/2606.10430.pdf", "summary": "The paper generalizes magic state cultivation to arbitrary Clifford-hierarchy levels and gives a worked example for cultivating $\\sqrt{T}\\ket{+}_{L}$ in the doubled color code. It also presents escape strategies to rotated surface codes via lattice surgery and evaluates end-to-end performance under realistic noise models. The authors connect these resource states to early fault-tolerant computing and to shorter gate synthesis in the fully fault-tolerant regime.", "motivation": "Magic-state distillation is a major overhead bottleneck for universal fault-tolerant quantum computation, especially on near-term devices with limited space-time resources. The work matters because it extends cultivation beyond the heavily studied $T\\ket{+}_{L}$ setting, broadening the available path to low-overhead non-Clifford resources.", "highlights": [ "Generalizes phase-kickback cultivation to higher Clifford hierarchy levels", "Demonstrates $\\sqrt{T}\\ket{+}_{L}$ cultivation in the doubled color code", "Reports infidelity down to $10^{-5}$ and $10^{-9}$-scale regimes" ], "keywords": [ { "label": "Magic States", "reason": "The core contribution is preparing non-Clifford resource states efficiently." }, { "label": "Cultivation", "reason": "The paper extends and analyzes magic state cultivation protocols." }, { "label": "Color Code", "reason": "The doubled color code is the main code family used for the example construction." }, { "label": "Lattice Surgery", "reason": "Escape strategies rely on deformation to rotated surface codes via lattice surgery." } ], "emoji": "✨", "social_summary": "Generalize magic state cultivation to $\\sqrt{T}$ resources and show efficient escape paths into surface-code architectures.", "highlights_oneliner": "Cultivating $\\sqrt{T}$ resources efficiently" }, { "arxiv_id": "2606.11010", "title": "Bosonic Cyclic Codes: Trading Stabilizers for Gaussian Non-Clifford Phase Gates", "authors": "Owen C. Wetherbee, Yijia Xu, Victor V. Albert, Baptiste Royer, Valla Fatemi", "arxiv_url": "https://arxiv.org/abs/2606.11010", "pdf_url": "https://arxiv.org/pdf/2606.11010.pdf", "summary": "The paper introduces bosonic cyclic codes as a generalization of rotation-symmetric codes that trades some error-detection power for a larger set of fault-tolerant logical phase gates. It shows that by selecting codewords from different stabilizer-syndrome sectors, one can realize Gaussian implementations of non-Clifford phase gates while preserving many favorable bosonic-code properties. The authors also extend the construction to cyclic cat and Vandermonde codes and discuss new $SU(2)$-related structure and detection protocols.", "motivation": "Bosonic encodings are attractive because they can provide hardware-efficient quantum memories with strong protection against loss and dephasing. The challenge has been that logical operations beyond a single Pauli gate often require noisy nonlinear ancillas, so a scheme that turns structure into controllable gates is important for scalable bosonic computing.", "highlights": [ "Introduces bosonic cyclic codes with tunable gate-versus-protection tradeoffs", "Enables Gaussian logical phase gates by moving between syndrome sectors", "Generalizes cat and binomial codes to cyclic cat and Vandermonde codes" ], "keywords": [ { "label": "Bosonic", "reason": "The code family lives in continuous-variable bosonic hardware." }, { "label": "Cyclic", "reason": "Cyclic symmetry is the organizing principle of the new construction." }, { "label": "Gaussian", "reason": "Logical gates are implemented through passive Gaussian rotations." }, { "label": "Phase Gates", "reason": "The main target is fault-tolerant logical phase operations." } ], "emoji": "🐱", "social_summary": "Redesign bosonic encodings so stabilizer structure becomes a source of Gaussian phase gates and broader logical control.", "highlights_oneliner": "Bosonic codes with gate tradeoffs" }, { "arxiv_id": "2606.11076", "title": "Coset Ensemble Decoder for Quantum Error Correction with Algorithm-Hardware Co-Design", "authors": "Shuang Liang, Jubo Xu, Giulio Bassanino, Qianzhou Wang, Yidong Zhou, Yuncheng Lu, Zhiwen Mo, Paul H. J. Kelly, Bo Yuan, Wayne Luk, Hongxiang Fan", "arxiv_url": "https://arxiv.org/abs/2606.11076", "pdf_url": "https://arxiv.org/pdf/2606.11076.pdf", "summary": "The paper proposes coset ensemble decoding, an algorithmic refinement of Union-Find that explicitly aggregates logically equivalent candidates to approximate coset-level maximum-likelihood decoding. It pairs the decoder with a hardware architecture that reuses resources temporally and reduces memory conflicts through hashing and hierarchical mapping. The result is a co-design that improves the accuracy-latency trade-off and lowers FPGA resource use relative to prior decoders.", "motivation": "Real-time decoding is a central bottleneck in fault-tolerant quantum computing because syndrome data must be processed at very low latency while maintaining high logical accuracy. This matters especially for surface-code systems, where decoding quality directly affects whether error correction can keep pace with physical hardware.", "highlights": [ "Improves Union-Find with coset ensemble decoding", "Uses reverse-order elimination and graph compression for efficiency", "Cuts FPGA LUT use by up to $8.2\\times$ versus reported Union-Find resources" ], "keywords": [ { "label": "Decoder", "reason": "The paper focuses on improving real-time decoding performance." }, { "label": "Coset", "reason": "Coset-level aggregation is the key algorithmic idea." }, { "label": "Union-Find", "reason": "The method builds directly on and improves UF decoding." }, { "label": "FPGA", "reason": "Hardware co-design is implemented for low-latency FPGA deployment." } ], "emoji": "📚", "social_summary": "Co-design a decoder that improves logical accuracy and latency while shrinking FPGA resource needs for real-time syndrome processing.", "highlights_oneliner": "Fast coset decoder co-design" } ] }, "2026-06-09": { "word_cloud": [ { "word": "Decoders", "weight": 5 }, { "word": "Magic", "weight": 4 }, { "word": "Surface", "weight": 4 }, { "word": "Bosonic", "weight": 3 }, { "word": "Floquet", "weight": 3 }, { "word": "Noise", "weight": 5 }, { "word": "Syndrome", "weight": 3 }, { "word": "Resource", "weight": 3 }, { "word": "Graph", "weight": 2 }, { "word": "Concatenation", "weight": 3 }, { "word": "Compilation", "weight": 4 }, { "word": "Learning", "weight": 4 }, { "word": "Stabilizer", "weight": 4 }, { "word": "Thresholds", "weight": 4 }, { "word": "Entanglement", "weight": 3 } ], "social_highlights": "Highlights: compact magic-state factories, dynamic Floquet circuits, algebraic bivariate-bicycle surfaces, learned decoder confidence, affine filtering decoders, resource-localization transitions, EA CV concatenation, global variational QEC, loss-resistant graph states, correlation-adapted fluxonium encoding, and hardware-aware low-latency QED co-design.", "papers": [ { "arxiv_id": "2606.07734", "title": "Exploring the landscape of compact magic-state distillation factories", "authors": "Hugo Jacinto, Xavier Valcarce, Victor Barizien, Élie Gouzien, Nicolas Sangouard", "arxiv_url": "https://arxiv.org/abs/2606.07734", "pdf_url": "https://arxiv.org/pdf/2606.07734.pdf", "summary": "This paper reformulates magic-state distillation protocols in terms of classical error-correcting codes, exploiting the specific noise structure to simplify protocol design and analysis. Using a SAT solver, it derives no-go theorems relating qubit count, protocol depth, factory distance, and output error prefactors, and discovers new minimal-qubit $T$-to-$T$ and $T$-to-$CCZ$ distillation protocols with distances up to $5$.", "motivation": "Magic-state distillation is a dominant overhead in fault-tolerant implementations of non-Clifford gates, so reducing qubit and depth costs is critical for scalable architectures. Systematically characterizing what is and is not possible for small-size factories guides hardware designers toward resource-optimal constructions and avoids fruitless search in impossible regimes.", "highlights": [ "Classical-code formulation of magic-state distillation", "SAT-solver no-go theorems for small factories", "New distance-4 and distance-5 compact protocols" ], "keywords": [ { "label": "Magic", "reason": "The work targets high-fidelity magic-state distillation for $T$ and $CCZ$ resources." }, { "label": "Factories", "reason": "It analyzes and optimizes small magic-state factory constructions and limits." }, { "label": "SAT", "reason": "A SAT solver is used to derive structural no-go results and find optimal protocols." }, { "label": "Classical", "reason": "Classical error-correcting codes underpin the new formulation of distillation schemes." } ], "emoji": "✨", "social_summary": "Map the limits of compact magic-state factories using classical codes and SAT solvers, and unveil new minimal-qubit $T$ and $CCZ$ distillation protocols for scalable quantum computing.", "highlights_oneliner": "Classical-code design of ultra-compact magic factories" }, { "arxiv_id": "2606.09678", "title": "The dynamic 4.8.8 Floquet code", "authors": "Aliki A. Capatos", "arxiv_url": "https://arxiv.org/abs/2606.09678", "pdf_url": "https://arxiv.org/pdf/2606.09678.pdf", "summary": "The paper presents ancilla-free dynamic measurement circuits for the CSS $4.8.8$ Floquet code that preserve full spatial distance while improving thresholds and overhead. By benchmarking four circuit-level implementations on a torus under circuit-level depolarizing noise, it shows that dynamic variants, especially without mid-circuit resets, achieve higher per-round thresholds and reduced spacetime volume compared to standard ancilla-based schedules.", "motivation": "Syndrome extraction circuits can dominate the performance of fault-tolerant memories, and Floquet codes provide a flexible platform for optimizing this layer. Demonstrating that dynamic, ancilla-free schedules can raise thresholds and lower overhead without sacrificing distance is important for practical, hardware-friendly implementations of topological codes.", "highlights": [ "Dynamic ancilla-free 4.8.8 Floquet circuits", "Improved circuit-level thresholds over ancilla-based schemes", "Reduced spacetime volume with preserved spatial distance" ], "keywords": [ { "label": "Floquet", "reason": "The work focuses on a CSS $4.8.8$ Floquet code and its measurement scheduling." }, { "label": "Dynamic", "reason": "It develops and benchmarks dynamic, ancilla-free syndrome extraction schedules." }, { "label": "Thresholds", "reason": "Per-round thresholds are computed and compared across four circuit implementations." }, { "label": "Overhead", "reason": "Spacetime volume and qubit overhead reductions are central performance metrics." } ], "emoji": "⚙️", "social_summary": "Demonstrate dynamic ancilla-free circuits for the $4.8.8$ Floquet code that boost thresholds and cut spacetime overhead without sacrificing code distance.", "highlights_oneliner": "Dynamic Floquet circuits with higher thresholds" }, { "arxiv_id": "2606.08771", "title": "Algebra of Bivariate-Bicycle Surface Codes", "authors": "Renyu Wang, Leonid P. Pryadko", "arxiv_url": "https://arxiv.org/abs/2606.08771", "pdf_url": "https://arxiv.org/pdf/2606.08771.pdf", "summary": "This work analyzes bivariate-bicycle-surface codes defined by pairs of bivariate polynomials, relating code dimension to the number and multiplicity of common roots in an extension field with finite nonzero coordinates. It shows how roots with zero or infinite coordinates dictate specialized boundary generators and how monomial transformations move such roots, enabling a general prescription for constructing codes on rectangular, diagonal, or arbitrarily tilted boundaries without corner corrections under suitable edge conditions.", "motivation": "Surface-code-like constructions with flexible boundaries are vital for adapting topological codes to irregular hardware layouts while maintaining good parameters. An algebraic framework that ties geometric boundaries to polynomial structure allows systematic design of tailored surface codes beyond simple rectangular patches.", "highlights": [ "Root-structure characterization of code dimension", "Boundary behavior from zero or infinite-coordinate roots", "General construction for tilted-boundary BBS codes" ], "keywords": [ { "label": "Bicycle", "reason": "The codes studied are bivariate-bicycle surface codes derived from polynomial pairs." }, { "label": "Boundaries", "reason": "The paper systematically treats rectangular, diagonal, and tilted boundary conditions." }, { "label": "Polynomials", "reason": "Bivariate polynomial roots control code dimension and boundary generators." }, { "label": "Surface", "reason": "These are surface-code-like topological codes realized via algebraic data." } ], "emoji": "📐", "social_summary": "Connect bivariate polynomial roots to surface-code structure, enabling bivariate-bicycle codes with arbitrary tilted boundaries and no corner corrections.", "highlights_oneliner": "Algebraic design of tilted bicycle surface codes" }, { "arxiv_id": "2606.08758", "title": "Neural network decoder confidence as a learned proxy for the logical gap", "authors": "David Dentelski", "arxiv_url": "https://arxiv.org/abs/2606.08758", "pdf_url": "https://arxiv.org/pdf/2606.08758.pdf", "summary": "The paper studies whether the logit output of a graph neural network decoder for the rotated surface code can serve as a learned proxy for the minimum-weight perfect matching complementary gap. Using uniform circuit-level noise data, it compares GNN confidence with MWPM logical gaps and finds that post-selection based on the GNN logit yields lower logical error rates at fixed acceptance, with the GNN confidence better approximating the posterior log-likelihood ratio scale.", "motivation": "Soft information from decoders enables post-selection and concatenated decoding schemes, but traditional logical-gap measures are tied to MWPM and become costly for many logical qubits. Showing that neural decoders naturally learn calibrated confidence scores broadens access to powerful soft outputs in regimes where explicit logical-gap computation is impractical.", "highlights": [ "GNN logit used as soft decoder confidence", "Post-selection via GNN confidence beats MWPM gap", "GNN confidence better matches posterior log-likelihood ratio" ], "keywords": [ { "label": "GNN", "reason": "A graph neural network decoder supplies the learned confidence scores." }, { "label": "Surface", "reason": "Experiments use the rotated surface code under circuit-level noise." }, { "label": "Confidence", "reason": "The main object is decoder confidence as a proxy for logical gap." }, { "label": "Postselection", "reason": "Confidence-thresholding for post-selection reduces logical error rates." } ], "emoji": "🧠", "social_summary": "Show that a graph neural network decoder’s logit provides calibrated confidence for post-selection, outperforming MWPM logical gaps on a rotated surface code.", "highlights_oneliner": "Neural decoder confidence beats MWPM gap" }, { "arxiv_id": "2606.07852", "title": "Affine Filtering Measurements and Their Applications to Quantum Decoding", "authors": "Avijit Mandal, Noah Shutty, Henry D. Pfister, Stephen P. Jordan", "arxiv_url": "https://arxiv.org/abs/2606.07852", "pdf_url": "https://arxiv.org/pdf/2606.07852.pdf", "summary": "This paper introduces affine filtering measurements, a structured form of unambiguous state discrimination where conclusive outcomes identify affine subspaces containing the transmitted codeword and inconclusive outcomes act as erasures. For group-covariant pure-state codewords, it shows that optimal affine filtering design reduces from a semidefinite program to a linear program via character-based diagonalization, and uses these measurements to construct quantum decoding frameworks for local codes, demonstrating performance gains over symbol-wise USD and pretty-good measurements on regular LDPC codes over i.i.d. pure-state channels.", "motivation": "Quantum receivers for classical-quantum channels can benefit from collective, code-aware measurements that beat symbol-wise detection, especially for structured codes like LDPC. Providing a tractable optimization framework for such measurements and showing decoding advantages helps bridge coding theory and physically realizable quantum measurement strategies.", "highlights": [ "Define affine filtering as structured USD", "Reduce optimal design from SDP to LP via characters", "Demonstrate decoding gains on LDPC codes over pure-state channels" ], "keywords": [ { "label": "USD", "reason": "Affine filtering generalizes unambiguous state discrimination to code-aware settings." }, { "label": "LDPC", "reason": "Regular LDPC codes serve as testbeds for affine-filtering-based decoding." }, { "label": "Decoding", "reason": "The work builds a quantum decoding framework using affine filtering measurements." }, { "label": "Semidefinite", "reason": "An SDP for optimal measurements is simplified to a linear program using symmetry." } ], "emoji": "🎯", "social_summary": "Introduce affine filtering measurements that turn a hard SDP into a linear program and improve LDPC quantum decoding over pure-state channels.", "highlights_oneliner": "Affine filtering measurements for better quantum decoding" }, { "arxiv_id": "2606.08756", "title": "Quantum resource localizability transitions in deep thermalization", "authors": "Xiaozhou Feng, Chang Liu, Zihan Cheng, Wen Wei Ho, Matteo Ippoliti", "arxiv_url": "https://arxiv.org/abs/2606.08756", "pdf_url": "https://arxiv.org/pdf/2606.08756.pdf", "summary": "The authors develop a unified framework for deep thermalization in general quantum resource theories, showing that quantum resources such as magic, coherence, asymmetry, imaginarity, and non-Gaussianity fall into two classes of localizability. \"Smoothly localizable\" theories exhibit continuously tunable local resource content with global resource density, while \"threshold localizable\" theories display sharp transitions where local resource content jumps from minimal to near-maximal above a critical global threshold, explained via an information-theoretic block-sharpening mechanism and validated with numerics, including a predicted magic transition in zero-rate quantum error-correcting codes.", "motivation": "Understanding how complex quantum resources distribute in many-body systems under measurements informs both fundamental equilibration theory and practical certification of resourceful states. Linking resource-theoretic behavior to deep thermalization phenomena and to transitions in error-correcting codes sheds light on when quantum advantages can be locally accessed or abruptly lost.", "highlights": [ "Classify resource theories into smoothly vs threshold localizable", "Explain transitions via block-sharpening subset intersections", "Predict a magic transition in zero-rate QECCs and implications for certification" ], "keywords": [ { "label": "Resources", "reason": "The work treats multiple quantum resource theories including magic and coherence." }, { "label": "Thermalization", "reason": "It extends deep thermalization to analyze local resource distributions." }, { "label": "Magic", "reason": "A novel magic transition is predicted in zero-rate quantum codes." }, { "label": "Ensembles", "reason": "Projected ensembles of post-measurement states underpin the analysis." } ], "emoji": "🌊", "social_summary": "Reveal two universality classes of quantum resource localizability in deep thermalization and predict sharp magic transitions relevant to quantum error-correcting codes.", "highlights_oneliner": "Deep-thermalization transitions of quantum resources" }, { "arxiv_id": "2606.09379", "title": "Entanglement-assisted continuous-variable concatenated codes for encoding qubits or oscillators", "authors": "Nihar Ranjan Dash, Sanjoy Dutta, R. Srikanth, Subhashish Banerjee", "arxiv_url": "https://arxiv.org/abs/2606.09379", "pdf_url": "https://arxiv.org/pdf/2606.09379.pdf", "summary": "This paper proposes entanglement-assisted versions of continuous-variable concatenated codes that combine Gottesman-Kitaev-Preskill bosonic codes with qubit entanglement-assisted stabilizer codes. It constructs both qubit-into-oscillator schemes, where an entanglement-assisted outer code is concatenated with a GKP inner code, and oscillator-into-oscillator schemes, where a GKP outer code is concatenated with an entanglement-assisted inner repetition code using pre-shared entangled modes to suppress position and momentum quadrature variances by a factor $1/n$.", "motivation": "Concatenating bosonic codes with qubit stabilizer codes is a powerful route to reduce logical error rates, while entanglement assistance can boost coding rates and performance beyond standard stabilizer constructions. Extending entanglement-assisted ideas to continuous-variable concatenated architectures is important for realizing more efficient hybrid qubit-oscillator protection schemes in realistic platforms.", "highlights": [ "Define entanglement-assisted GKP concatenated architectures", "Qubit-into-oscillator EA code with GKP inner layer", "Oscillator-into-oscillator EA repetition family with $1/n$ variance suppression" ], "keywords": [ { "label": "GKP", "reason": "Gottesman-Kitaev-Preskill bosonic codes form one layer of the concatenation." }, { "label": "Entanglement", "reason": "Pre-shared entangled modes enable entanglement-assisted stabilizer coding." }, { "label": "Concatenation", "reason": "The schemes concatenate qubit and oscillator codes in both directions." }, { "label": "Bosonic", "reason": "Continuous-variable oscillator modes are the physical carriers of information." } ], "emoji": "🔗", "social_summary": "Propose entanglement-assisted GKP-based concatenated codes that protect qubits and oscillators while suppressing quadrature noise by leveraging shared entangled modes.", "highlights_oneliner": "Entanglement-assisted GKP concatenated CV codes" }, { "arxiv_id": "2606.08592", "title": "Quantum Global Variational Learning for Quantum Error Correction", "authors": "Shun Ryuzaki, Hideo Mukai", "arxiv_url": "https://arxiv.org/abs/2606.08592", "pdf_url": "https://arxiv.org/pdf/2606.08592.pdf", "summary": "The authors introduce a quantum neural network with a global variational structure that reduces the number of unitary parameters required for autonomous quantum error correction. Their Quantum Global Variational Learning model cuts training time by about $97\\%$, improves training completion rates and final performance compared to prior work, and enhances robustness to internal network noise, yielding up to $15\\%$ higher fidelity under such noise while maintaining $100\\%$ training success.", "motivation": "Measurement-free, machine-learning-based quantum error correction offers a fully coherent alternative to standard syndrome-based schemes, but suffers from long training times and convergence issues such as barren plateaus. Architectures that train faster and more reliably while achieving strong error-correction performance under realistic network noise are crucial to make autonomous QEC practical.", "highlights": [ "Global-structure quantum neural network for QEC", "$97\\%$ reduction in training time with full success", "Improved error-correction fidelity and noise robustness" ], "keywords": [ { "label": "Variational", "reason": "The method uses a variational quantum neural network with global unitaries." }, { "label": "Autoencoder", "reason": "It realizes autonomous, measurement-free quantum error correction via learning." }, { "label": "Training", "reason": "The focus is on reducing training time and improving convergence rates." }, { "label": "Fidelity", "reason": "Performance is quantified by correction fidelity, including under internal noise." } ], "emoji": "🤖", "social_summary": "Introduce a global-structure variational quantum network that trains $97\\%$ faster and robustly implements autonomous error correction with improved fidelity under internal noise.", "highlights_oneliner": "Global-variational quantum network for fast QEC" }, { "arxiv_id": "2606.08561", "title": "A five-qubit 1-resistant graph state and stabilizer marginal certificates", "authors": "Zicheng Han, Wanchen Zhang, Xiande Zhang", "arxiv_url": "https://arxiv.org/abs/2606.08561", "pdf_url": "https://arxiv.org/pdf/2606.08561.pdf", "summary": "This work resolves the open problem of whether a five-qubit $1$-resistant pure state exists by identifying the five-cycle graph state $\\ket{C_5}$ as such a state. It develops a stabilizer-subgroup framework using local stabilizers and exact negative partial transpose witnesses to certify $m$-resistance in graph states, classifying all five-, six-, and seven-qubit graph states up to local Clifford equivalence and showing, for example, that no seven-qubit stabilizer state is $m$-resistant for any nonzero admissible $m$ and that $\\ket{C_N}$ with $N\\ge 7$ are not $m$-resistant.", "motivation": "Characterizing how multipartite entanglement survives particle loss is central for robust quantum communication and computation, and $m$-resistant states capture a sharp form of such robustness. Establishing small-size examples and nonexistence results within stabilizer and graph-state families clarifies the landscape of loss-tolerant entanglement structures and guides the search for more exotic non-stabilizer resources.", "highlights": [ "Identify five-qubit $1$-resistant state as $\\ket{C_5}$", "Stabilizer-subgroup method for certifying $m$-resistance", "Classification and nonexistence results for small graph states" ], "keywords": [ { "label": "Graph", "reason": "The study focuses on graph states such as the cycle $C_N$ family." }, { "label": "Resistance", "reason": "It analyzes and certifies $m$-resistance against particle loss." }, { "label": "Stabilizer", "reason": "A stabilizer-subgroup framework is used to verify entanglement properties." }, { "label": "Entanglement", "reason": "The core theme is robust multipartite entanglement under particle loss." } ], "emoji": "🧬", "social_summary": "Prove that the five-cycle graph state is the first five-qubit $1$-resistant pure state and classify small graph states by their particle-loss entanglement robustness.", "highlights_oneliner": "Five-qubit $1$-resistant graph state certified" }, { "arxiv_id": "2606.07699", "title": "Correlation-Assisted Odd-Parity Encoded Gates in Coupled Fluxonium Qubits under Non-Markovian TLS Noise", "authors": "Chenghong Ji, Chaoying Zhao", "arxiv_url": "https://arxiv.org/abs/2606.07699", "pdf_url": "https://arxiv.org/pdf/2606.07699.pdf", "summary": "The paper analyzes an encoded logical qubit formed by the odd-parity subspace of two coupled fluxonium qubits under correlated non-Markovian two-level-system noise. Projecting the exchange-coupled Hamiltonian onto this subspace yields an effective logical model where exchange drives $X_L$ and detuning drives $Z_L$, and simulations across Gaussian Ornstein-Uhlenbeck, Markovian, and random-telegraph noise show that positive spatial correlation suppresses harmful differential noise, improving encoded gate fidelities further enhanced by logical dynamical decoupling.", "motivation": "Fluxonium qubits offer long coherence and strong anharmonicity, but realistic noise from two-level-system defects can be temporally correlated and spatially structured. Exploiting noise correlations via symmetry-adapted encodings and logical control provides a pathway to hardware-aware logical operations that turn otherwise detrimental correlations into a resource.", "highlights": [ "Odd-parity fluxonium encoding with effective logical Hamiltonian", "Positive noise correlation boosts encoded gate fidelity", "Cross-model study with logical dynamical decoupling" ], "keywords": [ { "label": "Fluxonium", "reason": "The physical platform is coupled fluxonium qubits with strong anharmonicity." }, { "label": "Encoding", "reason": "An odd-parity subspace encodes a logical qubit for robust gates." }, { "label": "NonMarkovian", "reason": "Two-level-system noise with finite memory is explicitly modeled." }, { "label": "Correlation", "reason": "Spatial noise correlations are harnessed to suppress logical dephasing." } ], "emoji": "🎛️", "social_summary": "Show that odd-parity encoding in coupled fluxonium qubits can harness correlated non-Markovian noise to improve logical gate fidelities with logical dynamical decoupling.", "highlights_oneliner": "Correlation-adapted odd-parity fluxonium encoding" }, { "arxiv_id": "2606.07666", "title": "Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems", "authors": "Sumit Chongder", "arxiv_url": "https://arxiv.org/abs/2606.07666", "pdf_url": "https://arxiv.org/pdf/2606.07666.pdf", "summary": "This work presents an integrated hardware-aware compilation and data-driven quantum error-detection framework for early fault-tolerant NISQ-era processors, jointly optimizing qubit mapping, SWAP insertion, and syndrome-schedule placement. Combining a simulated-annealing plus ILP co-design pass with an XGBoost-based multi-objective QED scheduler trained on GPU-accelerated density-matrix simulations, it balances latency and post-selection overhead, achieving up to $68\\%$ relative success-probability gains over SABRE on an $8$-qubit VQE instance with post-selection under realistic noise profiles.", "motivation": "Early fault-tolerant regimes rely on lightweight distance-two error detection and post-selection rather than full-blown QEC, but current toolchains treat compilation and QED scheduling separately. A unified, data-driven approach that is aware of hardware constraints and latency budgets is needed to realize the full benefit of error detection on near-term devices.", "highlights": [ "Co-design of mapping, SWAPs, and QED scheduling", "XGBoost-based scheduler trained on GPU simulations", "Up to $68\\%$ success gain over SABRE under post-selection" ], "keywords": [ { "label": "Compilation", "reason": "The framework performs hardware-aware quantum compilation with mapping and SWAPs." }, { "label": "Detection", "reason": "Lightweight quantum error detection and post-selection are integrated into scheduling." }, { "label": "XGBoost", "reason": "A learned scheduler uses XGBoost regression for multi-objective optimization." }, { "label": "Latency", "reason": "The method explicitly trades off latency budgets against success probability." } ], "emoji": "🛠️", "social_summary": "Unify hardware-aware compilation with learned error-detection scheduling to boost success probability by up to $68\\%$ over SABRE on early fault-tolerant quantum workloads.", "highlights_oneliner": "Hardware-aware compilation with learned QED co-design" } ] }, "2026-06-08": { "word_cloud": [ { "word": "surface", "weight": 5 }, { "word": "lattice", "weight": 4 }, { "word": "surgery", "weight": 4 }, { "word": "stabilizer", "weight": 3 }, { "word": "Darwinism", "weight": 3 }, { "word": "Clifford", "weight": 2 }, { "word": "repetition", "weight": 4 }, { "word": "coherent", "weight": 4 }, { "word": "stochastic", "weight": 4 }, { "word": "transmon", "weight": 3 }, { "word": "quasiparticles", "weight": 5 }, { "word": "shielding", "weight": 4 }, { "word": "phonons", "weight": 3 }, { "word": "decoherence", "weight": 3 }, { "word": "parity", "weight": 2 } ], "social_highlights": "Highlights: surface-code lattice-surgery processor with logical algorithms, operator algebra view of objectivity via quantum codes, experimental coherent vs stochastic error injection in repetition codes, and record-low quasiparticle poisoning with infrared shielding.", "papers": [ { "arxiv_id": "2606.06598", "title": "A superconducting surface-code processor with lattice-surgery logical operations", "authors": "Yanzhe Wang, Fanhao Shen, Haipeng Xie, Aosai Zhang, Yu Gao, Chuanyu Zhang, Xuhao Zhu, Feitong Jin, Yiren Zou, Ning Wang, Zhengyi Cui, Zehang Bao, Zitian Zhu, Jiarun Zhong, Gongyu Liu, Jia-Nan Yang, Yihang Han, Yiyang He, Jiayuan Shen, Han Wang, Jiahua Huang, Xinrong Zhang, Sailang Zhou, Hang Dong, Jinfeng Deng, Yaozu Wu, Zixuan Song, Hekang Li, Zhen Wang, Chao Song, Qiujiang Guo, Pengfei Zhang, H. Wang, Ying Li", "arxiv_url": "https://arxiv.org/abs/2606.06598", "pdf_url": "https://arxiv.org/pdf/2606.06598.pdf", "summary": "This work demonstrates lattice-surgery operations between two distance-$3$ rotated surface-code logical qubits on a planar superconducting processor, achieving per-cycle logical error rates of $0.0365(2)$ and $0.0282(1)$ after leakage rejection. The authors deterministically prepare a logical Bell state, run a logical two-qubit Deutsch-Jozsa algorithm, and realize continuous non-Clifford logical $R_X(\\pi/4)$ rotations via magic-state injection and gate teleportation with conditional logical gate fidelity $0.943^{+0.010}_{-0.009}$.", "motivation": "Surface codes have emerged as leading candidates for scalable fault-tolerant architectures thanks to high thresholds and local stabilizers, but experimental work has largely focused on logical memory rather than universal logical processing. Demonstrating high-fidelity lattice-surgery logical operations compatible with planar superconducting layouts is crucial to move from isolated logical qubits to programmable fault-tolerant processors.", "highlights": [ "Implements lattice-surgery between two distance-$3$ surface-code logical qubits with low per-cycle logical error rates.", "Prepares a logical Bell state and executes a logical two-qubit Deutsch-Jozsa algorithm in a fault-tolerant framework.", "Realizes continuous non-Clifford logical $X$-rotations via magic-state injection and gate teleportation with high conditional fidelity." ], "keywords": [ { "label": "Surface codes", "reason": "The logical qubits are implemented using distance-$3$ rotated surface codes, central to the architecture and results." }, { "label": "Lattice surgery", "reason": "Joint logical operations are realized via lattice-surgery merge and split primitives between adjacent code patches." }, { "label": "Magic states", "reason": "Non-Clifford logical $X$-axis rotations are achieved using magic-state injection and gate teleportation." }, { "label": "Superconducting", "reason": "All demonstrations use a planar superconducting-qubit processor constrained to local couplings." } ], "emoji": "🧩", "social_summary": "Show how a planar superconducting processor can perform lattice-surgery surface-code logic, including Bell-state preparation, a logical Deutsch-Jozsa algorithm, and magic-state-based non-Clifford gates.", "highlights_oneliner": "Lattice-surgery logic on a surface-code processor" }, { "arxiv_id": "2606.06588", "title": "Demystifying Objectivity with Operator Algebra Quantum Error Correction", "authors": "Marin Girard, Gong Cheng, ChunJun Cao", "arxiv_url": "https://arxiv.org/abs/2606.06588", "pdf_url": "https://arxiv.org/pdf/2606.06588.pdf", "summary": "The paper connects quantum Darwinism to operator algebra quantum error correction by identifying the emergence of objectivity with algebraic local recoverability of quantum codes. Applying this algebraic framework to stabilizer codes, it refines the characterization of classicality and redundancy, unifies traditional objectivity measures, and enables efficient Clifford simulations of decoherence dynamics.", "motivation": "Quantum Darwinism aimed to explain how classical, objective records emerge from quantum systems, but previous formulations often gave only partial or ambiguous criteria for objectivity. Framing objectivity within operator algebra quantum error correction leverages coding-theoretic tools to rigorously quantify redundancy and robustness, clarifying when and how classical records form in noisy quantum environments.", "highlights": [ "Identifies objectivity in quantum Darwinism with algebraic local recoverability in operator algebra quantum error correction.", "Applies the framework to stabilizer codes to sharpen notions of classicality and informational redundancy.", "Enables efficient large-scale Clifford simulations of decoherence dynamics using the coding-theoretic formulation." ], "keywords": [ { "label": "Darwinism", "reason": "Quantum Darwinism is the central interpretive framework whose notion of objectivity is recast via error correction." }, { "label": "Operator algebras", "reason": "Operator algebra quantum error correction provides the mathematical structure used to define local recoverability and objectivity." }, { "label": "Stabilizer", "reason": "Stabilizer codes serve as concrete code families where classicality and redundancy are analyzed and classified." }, { "label": "Decoherence", "reason": "The work models decoherence dynamics and their role in generating redundant classical records in the environment." } ], "emoji": "🧠", "social_summary": "Recast the emergence of classical objectivity in quantum Darwinism as local recoverability in operator algebra quantum error correction, sharpening classicality and enabling efficient stabilizer-based decoherence simulations.", "highlights_oneliner": "Objectivity via operator algebra QEC" }, { "arxiv_id": "2606.07377", "title": "Coherent versus stochastic error injection on a repetition-code logical qubit in superconducting hardware", "authors": "S. L. M. van der Meer, M. Serra-Peralta, Y. Xin, M. Finkel, H. M. Veen, M. W. Beekman, L. DiCarlo, B. M. Terhal", "arxiv_url": "https://arxiv.org/abs/2606.07377", "pdf_url": "https://arxiv.org/pdf/2606.07377.pdf", "summary": "This work experimentally studies the impact of injected coherent versus stochastic errors on logical performance of distance-$3$ and distance-$5$ bit-flip repetition codes implemented in a transmon processor. Using a scalable free-fermion simulator and an adapted subset-sampling technique, simulations predict distinct logical fidelities for coherent and stochastic noise, but experiments show no such separation, likely due to small frequency drifts that convert coherent errors into effectively stochastic noise.", "motivation": "Theory predicts that coherent errors can be more damaging than stochastic Pauli noise for repetition and surface codes, lowering thresholds when measured in worst-case metrics. Understanding how such coherent errors manifest in real superconducting hardware, and whether they remain coherent at the logical level, is essential for accurate noise modeling and decoder design in quantum error correction.", "highlights": [ "Implements distance-$3$ and distance-$5$ repetition-code experiments with controlled coherent and stochastic error injection on a transmon device.", "Develops scalable free-fermion simulations and efficient subset sampling to compare predicted logical fidelities under different noise types.", "Finds no experimental logical-fidelity gap between coherent and stochastic injections, hypothesizing frequency drifts that effectively randomize coherent errors." ], "keywords": [ { "label": "Repetition", "reason": "The bit-flip repetition code is the central QEC code used as a testbed for comparing noise types." }, { "label": "Coherent noise", "reason": "Injected coherent unitary errors are a primary focus, contrasted against stochastic Pauli errors." }, { "label": "Transmons", "reason": "Experiments are run on a multi-qubit transmon superconducting processor implementing the repetition code." }, { "label": "Simulation", "reason": "Free-fermion and subset-sampling simulations are key to predicting and interpreting logical performance under different noise models." } ], "emoji": "🎯", "social_summary": "Probe how coherent and stochastic errors impact repetition-code logical qubits in a transmon device, revealing hardware effects that can wash out theoretically predicted differences.", "highlights_oneliner": "Coherent vs stochastic errors in repetition codes" }, { "arxiv_id": "2606.07339", "title": "Suppression of Quasiparticle Poisoning to $10^{-11}$ Levels in Superconducting Qubits via Infrared Shielding", "authors": "Wei-En Lin, Chen-Hsun Ma, Erh-Hsiang Yeh, Wei-Lun Peng, Yu-Sen Wei, Hsi-Sheng Goan, Cen-Shawn Wu, Chung-Ting Ke, Yung-Fu Chen, Chii-Dong Chen", "arxiv_url": "https://arxiv.org/abs/2606.07339", "pdf_url": "https://arxiv.org/pdf/2606.07339.pdf", "summary": "The authors systematically study quasiparticle poisoning in superconducting qubits under three infrared shielding configurations and show over four orders of magnitude suppression in quasiparticle-induced parity-switching rates with improved shielding. In the best setup, the switching rate drops to $0.069$ Hz after $34$ days of cooldown, corresponding to a quasiparticle density per Cooper pair of $1.88\\times10^{-11}$, with qubit effective temperatures following the phonon bath down to $17$ mK and enabling initialization errors of about $0.01\\%$ for $3$ GHz qubits.", "motivation": "Nonequilibrium quasiparticles have long limited superconducting qubit $T_1$ and contributed to residual excited-state populations, as well as correlated errors that threaten large-scale quantum error correction. Demonstrating that careful infrared shielding and thermalization can push quasiparticle densities near $10^{-11}$ per Cooper pair is key for achieving higher coherence and reducing correlated fault mechanisms in scalable superconducting processors.", "highlights": [ "Demonstrates more than four orders of magnitude reduction in quasiparticle-induced parity-switching rate using optimized infrared shielding.", "Achieves a record-low estimated quasiparticle density per Cooper pair of $1.88\\times10^{-11}$ after extended cooldown.", "Shows effective qubit temperature tracks the phonon bath down to $17$ mK, enabling initialization errors around $0.01\\%$ for $3$ GHz qubits." ], "keywords": [ { "label": "Quasiparticles", "reason": "Quasiparticle poisoning is the central decoherence mechanism characterized and mitigated in the experiments." }, { "label": "Shielding", "reason": "Infrared shielding configurations are the key engineering lever used to suppress quasiparticle generation." }, { "label": "Superconducting", "reason": "All measurements are performed on superconducting qubits whose coherence is limited by quasiparticles." }, { "label": "Parity", "reason": "Quasiparticle-induced parity switching is the main observable used to quantify poisoning rates and density." } ], "emoji": "🛡️", "social_summary": "Drive quasiparticle poisoning in superconducting qubits to record-low $10^{-11}$ densities using optimized infrared shielding, dramatically improving parity stability and enabling ultra-cold, low-error initialization.", "highlights_oneliner": "Record-low quasiparticle poisoning with IR shielding" } ] }, "2026-06-05": { "word_cloud": [ { "word": "surface", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "spacetime", "weight": 5 }, { "word": "gauging", "weight": 3 }, { "word": "cluster", "weight": 3 }, { "word": "teleportation", "weight": 2 }, { "word": "syndrome", "weight": 3 }, { "word": "compilation", "weight": 4 }, { "word": "Tcount", "weight": 5 }, { "word": "hardware", "weight": 4 }, { "word": "trapped", "weight": 3 }, { "word": "ions", "weight": 3 }, { "word": "superconducting", "weight": 4 }, { "word": "nanostructures", "weight": 3 }, { "word": "simulation", "weight": 4 } ], "social_highlights": "Highlights: trapped-ion qLDPC breakeven memory, superconducting-native barbell codes, spacetime-lifted fault complexes, gauged spacetime code gauge theory, early FT nanostructure simulations, and dyadic phase fixing for lower T-count.", "papers": [ { "arxiv_id": "2606.06455", "title": "Breakeven demonstration of quantum low-density parity-check codes", "authors": "Edwin Tham, Michael L. Goldman, Shantanu Debnath, Ashay N. Patel, Jyothi Saraladevi, Jason Nguyen, Erik Nielsen, Neal Pisenti, Kenneth Wright, John Gamble, Nicolas Delfosse", "arxiv_url": "https://arxiv.org/abs/2606.06455", "pdf_url": "https://arxiv.org/pdf/2606.06455.pdf", "summary": "This work implements nine distinct quantum error-correcting codes, including high-rate quantum low-density parity-check codes, topological codes, and concatenated codes, on a single trapped-ion device using a novel optical-metastable-ground architecture. A $[[18,4]]$ bivariate bicycle code achieves logical error rates up to $9\\times$ lower than prior superconducting demonstrations and reaches breakeven, with logical lifetimes comparable to or exceeding those of the underlying trapped-ion qubits.", "motivation": "High-rate qLDPC codes promise drastically reduced qubit overhead compared to planar surface codes but were historically difficult to realize due to demanding non-local connectivity requirements. Demonstrating breakeven performance for such codes on flexible trapped-ion hardware is a critical step toward qubit-efficient, scalable fault-tolerant architectures beyond surface-code-based schemes.", "highlights": [ "Implements nine heterogeneous codes on one trapped-ion processor without hardware reconfiguration", "Demonstrates a $[[18,4]]$ bivariate bicycle code with up to $9\\times$ improved logical error rate over prior solid-state experiments", "Achieves breakeven logical lifetimes using a novel optical-metastable-ground architecture with mid-circuit measurement and reset" ], "keywords": [ { "label": "qLDPC", "reason": "Central focus is implementing high-rate quantum low-density parity-check codes, including a bivariate bicycle instance, on trapped-ion hardware." }, { "label": "Trapped-ions", "reason": "Uses a flexible trapped-ion quantum computer with global connectivity and Raman control to realize diverse code families." }, { "label": "Breakeven", "reason": "Achieves logical qubit lifetimes comparable to or exceeding physical qubits, entering the breakeven regime for QEC." }, { "label": "Architecture", "reason": "Introduces and exploits the optical-metastable-ground architecture enabling mid-circuit measurement and reset without ion shuttling." } ], "emoji": "🧊", "social_summary": "Show how a trapped-ion device runs high-rate qLDPC, topological, and concatenated codes on the same chip and reaches breakeven logical lifetimes with a compact $[[18,4]]$ code.", "highlights_oneliner": "Breakeven high-rate qLDPC on trapped ions" }, { "arxiv_id": "2606.06062", "title": "Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware", "authors": "Shin Ho Choe, Vincent Steffan, Florian Vigneau, Pedro Parrado-Rodríguez, Hsiang-Sheng Ku, Martin Leib, Francisco Revson Fernandes Pereira, Fedor Šimkovic", "arxiv_url": "https://arxiv.org/abs/2606.06062", "pdf_url": "https://arxiv.org/pdf/2606.06062.pdf", "summary": "This paper introduces barbell codes, a family of quantum low-density parity-check codes designed with a fixed-connectivity chip layout that natively supports all required two-qubit interactions. Circuit-level simulations show that with fewer than $30$ data qubits per logical qubit, barbell codes can maintain logical information for trillions of QEC cycles at physical error rates around $10^{-4}$ and support fault-tolerant logical multi-Pauli measurements.", "motivation": "Prior qLDPC proposals typically required long-range couplers or complex connectivity, limiting compatibility with planar superconducting architectures. By co-designing codes and layout so hardware complexity remains constant as code distance grows, barbell codes aim to make scalable qLDPC-based fault tolerance practical on superconducting platforms.", "highlights": [ "Defines barbell qLDPC codes matched to a realistic fixed-connectivity superconducting layout", "Shows hardware complexity stays constant as code distance increases", "Simulates trillions of QEC cycles at physical error rate $10^{-4}$ with $<30$ data qubits per logical qubit" ], "keywords": [ { "label": "Barbell", "reason": "Proposes the new barbell code family, a tailored qLDPC construction for planar hardware." }, { "label": "Superconducting", "reason": "Targets fixed-connectivity superconducting chips with a realistic layout co-designed with the code." }, { "label": "Scalability", "reason": "Ensures hardware complexity does not grow with code distance, enabling scalable implementation." }, { "label": "Simulation", "reason": "Performs circuit-level noise simulations to assess logical lifetimes and multi-Pauli measurement performance." } ], "emoji": "🔩", "social_summary": "Introduce barbell qLDPC codes co-designed with a fixed-connectivity superconducting layout, enabling constant-complexity scaling and trillions of QEC cycles with modest qubit overhead at $10^{-4}$ noise.", "highlights_oneliner": "Barbell qLDPC co-designed for superconductors" }, { "arxiv_id": "2606.06365", "title": "A framework for low-overhead quantum fault tolerance via spacetime lifting", "authors": "Yijia Xu, Yixu Wang, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2606.06365", "pdf_url": "https://arxiv.org/pdf/2606.06365.pdf", "summary": "The authors develop spacetime lifting, a method to construct fault complexes from symmetry-reduced product structures beyond standard foliation, providing a homological framework for fault-tolerant spacetime protocols. They prove that spacetime-lifted memory experiments can achieve almost-linear fault distance in total spacetime cost and interpret fault complexes as cluster-state-based protocols implementing fault-tolerant logical teleportation.", "motivation": "Conventional QEC theory largely treats codes as static objects and often relies on foliated constructions that can be spacetime-inefficient. By optimizing directly in spacetime via fault complexes and spacetime lifting, this work seeks fundamentally lower overhead fault-tolerant protocols with better distance-to-cost scaling and natural measurement-based realizations.", "highlights": [ "Introduces spacetime lifting to build low-overhead fault complexes beyond standard foliation", "Achieves almost-linear fault distance in total spacetime cost for memory experiments", "Maps fault complexes to cluster-state protocols that realize fault-tolerant logical teleportation" ], "keywords": [ { "label": "Spacetime", "reason": "Treats fault tolerance as a spacetime optimization problem using fault complexes and lifting constructions." }, { "label": "FaultComplexes", "reason": "Uses homological fault complexes as unified objects encoding codes and protocols." }, { "label": "Cluster", "reason": "Interprets constructions as cluster-state measurement-based schemes for logical teleportation." }, { "label": "Teleportation", "reason": "Analyzes conditions where spacetime-lifted complexes implement fault-tolerant logical teleportation." } ], "emoji": "🕳️", "social_summary": "Unveil spacetime lifting, a homological framework that builds low-overhead fault complexes with almost-linear distance and natural cluster-state teleportation implementations.", "highlights_oneliner": "Spacetime-lifted low-overhead fault complexes" }, { "arxiv_id": "2606.05664", "title": "Gauging the Spacetime Code", "authors": "Gideon Lee", "arxiv_url": "https://arxiv.org/abs/2606.05664", "pdf_url": "https://arxiv.org/pdf/2606.05664.pdf", "summary": "This work gauges the spacetime code to obtain a lattice gauge theory (on a hypergraph) that is dual to a given stabilizer spacetime circuit, with Gauss laws encoding equivalence relations between spacetime error configurations and Wilson loops representing detectors. The gauged spacetime code captures elements of fault tolerance, clarifies the distinction between logical and non-logical degrees of freedom via locality, and provides a unifying gauge-theoretic language applicable to measurement-based computation, topologically ordered mixed states, and learnability of circuit noise.", "motivation": "Spacetime codes offer a unifying picture of fault-tolerant circuits, while gauge theories are powerful tools across condensed matter and high-energy physics. By relating them through gauging, this paper aims to import gauge-theoretic intuition into QEC, link fault tolerance with dynamical phases, and connect learnable noise structures to gauge-invariant observables.", "highlights": [ "Constructs a gauged spacetime code as a lattice gauge theory dual to a stabilizer spacetime circuit", "Identifies Gauss laws as spacetime error equivalence relations and Wilson loops as detectors", "Applies the framework to foliated computation, classical memories of mixed topological states, and learnable Pauli noise" ], "keywords": [ { "label": "Spacetime", "reason": "Builds on the spacetime code framework to describe fault-tolerant circuits in space and time." }, { "label": "Gauge", "reason": "Introduces a lattice gauge theory dual to the spacetime code via gauging procedures and Gauss laws." }, { "label": "Detectors", "reason": "Interprets Wilson loops as detectors and links them to gauge-invariant observables and learnable noise." }, { "label": "Topological", "reason": "Connects the gauged theory to topologically ordered mixed states and their classical memory structure." } ], "emoji": "🌀", "social_summary": "Gauge the spacetime code into a lattice gauge theory where Gauss laws encode error equivalence, Wilson loops act as detectors, and fault tolerance links to phases and learnable noise.", "highlights_oneliner": "Gauge-theoretic dual of the spacetime code" }, { "arxiv_id": "2606.06442", "title": "Nanostructure modelling with early fault tolerant quantum computers", "authors": "Zhu Sun, Christian Binder, Balint Koczor, Simon Benjamin", "arxiv_url": "https://arxiv.org/abs/2606.06442", "pdf_url": "https://arxiv.org/pdf/2606.06442.pdf", "summary": "The paper presents a quantum simulation framework for multi-electron double quantum dots using an efficiently scaling first-quantized representation and algorithms based on Trotterization and qubitization. Using realistic resource estimates informed by classical simulations and a standard surface-code model with physical noise $10^{-3}$, they project that ground-state energies of four- and eight-electron systems can be obtained within about $24$ hours and $3.4$ days using roughly $2.3\\times10^{5}$ and $3.1\\times10^{5}$ physical qubits, respectively.", "motivation": "Semiconductor nanostructures such as double quantum dots underpin spin-qubit devices, sensors, and solar technologies, but accurate multi-electron modeling is classically hard. Quantifying what early fault-tolerant machines can do for such realistic materials systems helps align hardware development with impactful near-term applications in quantum technology design.", "highlights": [ "Develops first-quantized Trotterization and qubitization algorithms for multi-electron double quantum dot simulation", "Uses classical insights to produce realistic surface-code resource estimates at physical noise $10^{-3}$", "Shows four- and eight-electron ground states are accessible on early FT hardware with $\\sim10^{5}$ physical qubits and day-scale runtimes" ], "keywords": [ { "label": "Nanostructures", "reason": "Targets semiconductor nanostructures, particularly double quantum dots, as application systems." }, { "label": "Simulation", "reason": "Focuses on quantum simulation algorithms for multi-electron dynamics and ground states." }, { "label": "Surface", "reason": "Assumes a standard surface-code architecture for fault tolerance and resource estimation." }, { "label": "Qubitization", "reason": "Employs qubitization alongside Trotterization as core algorithmic primitives." } ], "emoji": "🔬", "social_summary": "Estimate how early fault-tolerant surface-code machines can realistically simulate multi-electron double quantum dots, using first-quantized Trotterization and qubitization with day-scale runtimes and $\\sim10^{5}$ qubits.", "highlights_oneliner": "Early FT simulation of double quantum dots" }, { "arxiv_id": "2606.05397", "title": "Multi-Qubit Dyadic Phase Fixing for Fault-Tolerant Quantum Compilation", "authors": "Justin Kalloor, Mathias Weiden, Ed Younis, John Kubiatowicz, Costin Iancu", "arxiv_url": "https://arxiv.org/abs/2606.05397", "pdf_url": "https://arxiv.org/pdf/2606.05397.pdf", "summary": "This paper introduces Dyadic Phase Fixing, a general multi-qubit synthesis technique that extends phase kickback beyond structured circuit families by greedily extracting dyadic-angle rotations using numerical unitary synthesis. Integrated with a decision matrix for sizing phase-gradient registers, the workflow guarantees non-increasing $T$-count relative to gridsynth and achieves up to $70\\%$ $T$-count and $60\\%$ space-time volume reductions on diverse benchmarks when mapped to a surface-code architecture.", "motivation": "State-of-the-art Clifford+$T$ compilation often optimizes single-qubit $R_z$ rotations and uses $T$-count as a proxy cost, neglecting ancilla-assisted methods and full space-time impact on fault-tolerant layouts. By generalizing phase kickback and evaluating realistic mappings, this work aims to lower true resource costs and reveal when $T$-count fails as a performance metric.", "highlights": [ "Proposes Dyadic Phase Fixing to apply phase kickback to arbitrary multi-qubit circuits via numerical synthesis", "Ensures $T$-count never exceeds gridsynth while cutting it by up to $70\\%$ on benchmarks", "Shows that space-time volume can diverge from $T$-count and analyzes parallel phase-gradient strategies to recover volume gains" ], "keywords": [ { "label": "Compilation", "reason": "Addresses fault-tolerant compilation from high-level circuits to Clifford+$T$ form with explicit cost models." }, { "label": "PhaseKickback", "reason": "Generalizes phase kickback using Dyadic Phase Fixing and phase-gradient registers." }, { "label": "Tcount", "reason": "Targets reduction of $T$-count and highlights its limitations as a sole cost metric." }, { "label": "Lattice", "reason": "Evaluates space-time volume under surface-code lattice surgery and HPBC-style mapping strategies." } ], "emoji": "🧮", "social_summary": "Generalize phase kickback with Dyadic Phase Fixing to cut $T$-count by up to $70\\%$ and space-time volume by $60\\%$ while revealing when $T$-count mispredicts fault-tolerant costs.", "highlights_oneliner": "Dyadic phase fixing cuts $T$-count" } ] }, "2026-06-04": { "word_cloud": [ { "word": "Toric", "weight": 5 }, { "word": "Syndrome", "weight": 5 }, { "word": "Decoding", "weight": 4 }, { "word": "Automorphism", "weight": 4 }, { "word": "Bicycle", "weight": 4 }, { "word": "Plaquette", "weight": 4 }, { "word": "Shuttling", "weight": 4 }, { "word": "Expressibility", "weight": 4 }, { "word": "Mitigation", "weight": 3 }, { "word": "Grover", "weight": 4 }, { "word": "Isotropic", "weight": 5 }, { "word": "Surface", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "LDPC", "weight": 3 } ], "social_highlights": "Highlights: toric code repeated syndrome extraction with qubit reloading, algebraic automorphisms for generalized bicycle codes, circuit-level noise estimation from plaquette experiments, noise-aware VQE ansatz ranking under mitigation, isotropic-error impact on Grover search.", "papers": [ { "arxiv_id": "2606.04079", "title": "Quantum error correction with the toric code", "authors": "Atom Computing, Collaborators", "arxiv_url": "https://arxiv.org/abs/2606.04079", "pdf_url": "https://arxiv.org/abs/2606.04079", "summary": "This paper demonstrates many cycles of syndrome extraction in a toric code using mid-circuit measurement and replacement of lost qubits, including reloading from a qubit reservoir for indefinite coherent operation. It characterizes logical error rates after up to $90$ cycles and compares code distances, finding that the larger-distance code achieves a lower absolute logical error rate up to $8$ rounds of syndrome extraction.", "motivation": "Neutral-atom arrays offer high qubit counts, high connectivity, and improving fidelities, making them a strong platform for scalable fault tolerance. Repeated mid-circuit error correction is essential for moving from protected physical qubits to long-lived logical qubits at arbitrary depth.", "highlights": [ "many-cycle toric-code syndrome extraction", "qubit reloading preserves logical information", "larger distance lowers logical error rate" ], "keywords": [ { "label": "Toric", "reason": "The core code family is the toric code used for repeated error correction experiments." }, { "label": "Syndrome", "reason": "The work centers on mid-circuit syndrome extraction across many cycles." }, { "label": "Reloading", "reason": "Loss replacement and reservoir reloading are key experimental mechanisms enabling indefinite operation." }, { "label": "Neutral atoms", "reason": "The implementation uses tweezer-confined neutral atoms as the hardware platform." } ], "emoji": "🕸️", "social_summary": "Demonstrates repeated toric-code error correction with qubit reloading on neutral atoms, preserving logical information across many syndrome-extraction cycles.", "highlights_oneliner": "Many-cycle toric-code reloading" }, { "arxiv_id": "2606.05044", "title": "Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure", "authors": "AJ Davenport, John Blue, Isaac Chuang", "arxiv_url": "https://arxiv.org/abs/2606.05044", "pdf_url": "https://arxiv.org/abs/2606.05044", "summary": "This paper develops an algebraic framework for analyzing and engineering automorphisms in generalized bicycle codes by expressing them as cyclic submodules of $R_\\ell^2$. It derives necessary and sufficient conditions for block-separable automorphisms built from cyclic shifts, ring automorphisms, and block-swaps, and connects these symmetries to fold-transversal $H$, $S$, and $CX$ gates.", "motivation": "Automorphisms can enable fault-tolerant gates through qubit relabeling, but the conditions for their existence in a given code are poorly understood. A systematic design framework matters because it can turn symmetry from an incidental property into an engineering target for logical gate synthesis.", "highlights": [ "cyclic-submodule framework for GB codes", "automorphism criteria for fold-transversal gates", "MCR family reaches rich logical gate sets" ], "keywords": [ { "label": "Automorphism", "reason": "The paper is fundamentally about code symmetries and their existence conditions." }, { "label": "Bicycle", "reason": "Generalized bicycle codes are the main code family analyzed and engineered." }, { "label": "Fold", "reason": "Fold-transversal gate structure is explicitly connected to the automorphism criteria." }, { "label": "MCR", "reason": "The Maximal Cube Root family is introduced as a new inverse-designed code family." } ], "emoji": "🧩", "social_summary": "Builds an algebraic theory of automorphisms in generalized bicycle codes and uses it to design codes with rich fold-transversal gate structure.", "highlights_oneliner": "Automorphisms for bicycle codes" }, { "arxiv_id": "2606.04629", "title": "Circuit-Level Noise Estimation via Shuttling in Plaquette Circuits", "authors": "Huyen Do, Alexandru Paler", "arxiv_url": "https://arxiv.org/abs/2606.04629", "pdf_url": "https://arxiv.org/abs/2606.04629", "summary": "This paper introduces a method to estimate circuit-level noise from repeated plaquette experiments when only single-shot measurements are available and hardware calibration is limited. It compares $FRESH$ and $RECYCLE$ syndrome-qubit configurations, compiles plaquettes to ion-trap native gates with hardware-aware rewrites, and validates the approach on IonQ Aria1 and IBM Torino.", "motivation": "As quantum hardware scales, device-level calibration is often unavailable or too coarse to predict the behavior of full QEC circuits. Estimating noise directly at the circuit level is important for deciding whether low-depth surface-code experiments are viable on near-term platforms.", "highlights": [ "single-shot plaquettes estimate circuit noise", "FRESH versus RECYCLE benchmarking", "native-gate rewrites improve reliability" ], "keywords": [ { "label": "Plaquette", "reason": "Plaquette circuits are the experimental unit used to estimate noise." }, { "label": "Shuttling", "reason": "The method targets shuttling-style scheduling and qubit reuse on ion traps." }, { "label": "FRESH", "reason": "Fresh ancilla reuse is one of the two syndrome-qubit configurations studied." }, { "label": "RECYCLE", "reason": "Qubit recycling is the contrasting configuration used for comparison." } ], "emoji": "🚆", "social_summary": "Estimates circuit-level noise from repeated plaquette experiments, comparing fresh and recycled syndrome qubits on ion-trap and superconducting hardware.", "highlights_oneliner": "Plaquette noise from shuttling" }, { "arxiv_id": "2606.04955", "title": "Expressibility, Noise, and Error Mitigation in VQE Ansatz Selection", "authors": "Peter Annis, Abe Kassem, Evan Coleman", "arxiv_url": "https://arxiv.org/abs/2606.04955", "pdf_url": "https://arxiv.org/abs/2606.04955", "summary": "This paper studies how expressibility predicts VQE ansatz performance under ideal, noisy, $ZNE$, and $PEC$ execution for $H_2$ and $H_3^+$. It shows that mitigation does not reliably restore expressibility as a performance predictor, while noisy expressibility and simpler topology metrics can better explain ranking and degradation behavior.", "motivation": "Ansatz selection is a major bottleneck in variational quantum chemistry because circuit quality and noise sensitivity can dominate final performance. Understanding whether expressibility remains meaningful under realistic mitigation is important for choosing circuits that are both trainable and hardware-efficient.", "highlights": [ "expressibility fails under realistic noise", "ZNE and PEC reshape rankings", "gate count predicts PEC degradation" ], "keywords": [ { "label": "Expressibility", "reason": "The central metric being tested as an ansatz-selection heuristic." }, { "label": "VQE", "reason": "The work evaluates variational quantum eigensolver ansätze for chemistry problems." }, { "label": "Mitigation", "reason": "Zero-noise extrapolation and probabilistic error cancellation are directly compared." }, { "label": "Topology", "reason": "Circuit topology metrics are shown to predict degradation well." } ], "emoji": "🧪", "social_summary": "Tests whether expressibility still predicts VQE performance under noise and mitigation, finding that circuit structure often matters more.", "highlights_oneliner": "Noise reshapes VQE rankings" }, { "arxiv_id": "2606.04817", "title": "Effect of isotropic errors on the complexity of Grover's algorithm", "authors": "Anurag Saha Roy, Jesús Lacalle", "arxiv_url": "https://arxiv.org/abs/2606.04817", "pdf_url": "https://arxiv.org/abs/2606.04817", "summary": "This paper numerically studies how isotropic errors affect the complexity and success probability of Grover's search algorithm. Using the open-source $\\texttt{isotropic}$ library, it analyzes performance under this noise model and highlights implications for noisy quantum hardware.", "motivation": "Standard error correction assumes noise models that can be mitigated by structured redundancy, but isotropic errors are described as resistant to conventional techniques. Studying their effect on a canonical algorithm like Grover's search helps clarify how nonstandard noise can change practical complexity expectations.", "highlights": [ "numerical Grover under isotropic noise", "open-source isotropic simulator", "noise threatens search performance" ], "keywords": [ { "label": "Isotropic", "reason": "The paper studies isotropic error models as the central noise class." }, { "label": "Grover", "reason": "Grover's search algorithm is the main application analyzed." }, { "label": "Complexity", "reason": "The work focuses on how noise changes algorithmic complexity and success." }, { "label": "Library", "reason": "The open-source $\\texttt{isotropic}$ software is a key enabling tool." } ], "emoji": "🎯", "social_summary": "Explores how isotropic errors change Grover search performance, using simulation to probe a noise model that challenges conventional correction.", "highlights_oneliner": "Grover under isotropic noise" } ] }, "2026-06-03": { "word_cloud": [ { "word": "circuits", "weight": 4 }, { "word": "noise", "weight": 4 }, { "word": "designs", "weight": 3 }, { "word": "mitigation", "weight": 5 }, { "word": "learning", "weight": 4 }, { "word": "variational", "weight": 3 }, { "word": "holography", "weight": 5 }, { "word": "fracton", "weight": 5 }, { "word": "stabilizer", "weight": 4 }, { "word": "extractors", "weight": 5 }, { "word": "hypergraph", "weight": 4 }, { "word": "product", "weight": 3 }, { "word": "holography", "weight": 4 }, { "word": "boundaries", "weight": 3 }, { "word": "twirling", "weight": 3 } ], "social_highlights": "Highlights: Compact extractors enable efficient logical processing in hypergraph product codes, new twirling-based mitigation tames noise in unitary designs, machine learning boosts variational error mitigation, and fracton holography organizes dualities in X-cube and Haah codes.", "papers": [ { "arxiv_id": "2606.03507", "title": "Full Extractors for Logical Processing in Hypergraph Product Codes", "authors": "John Blue, Zhiyang He, Hengyun Zhou, Isaac L. Chuang", "arxiv_url": "https://arxiv.org/abs/2606.03507", "pdf_url": "https://arxiv.org/pdf/2606.03507.pdf", "summary": "This work constructs full extractor architectures for several hypergraph product codes that can measure arbitrary logical Pauli operators on a code block, enabling Pauli-based computation without additional compilation overhead. The extractors are assembled from distance-preserving partial extractors, have sizes between $50\\%$ and $80\\%$ of the base code, respect fixed-connectivity constraints with maximum qubit degree ten, and achieve logical measurement error rates around $10^{-6}$ at physical error rate $0.1\\%$ for a distance-$10$ code. The authors prove distance preservation for their multi-row and multi-column extractor constructions using cyclic code structure and explicit graph-based ancilla systems.", "motivation": "Hypergraph product $\\text{QLDPC}$ codes promise lower overhead than surface codes, but practical logical processing has been a major bottleneck due to geometry and compilation costs. This paper addresses that gap by giving hardware-aware extractor designs that preserve space efficiency while supporting flexible logical Pauli measurements needed for scalable fault-tolerant computation.", "highlights": [ "Full extractors measure arbitrary logical Pauli operators in HGP codes", "Extractor-augmented codes maintain low degree (at most 10) fixed connectivity", "Circuit-level simulations show $\\sim 10^{-6}$ logical measurement error at $p=0.1\\%$ for $d=10$" ], "keywords": [ { "label": "HGP codes", "reason": "The main constructions are full extractors tailored to hypergraph product code families for fault-tolerant logical processing." }, { "label": "Extractors", "reason": "Central concept is full and partial extractor ancilla systems for measuring arbitrary logical Pauli operators." }, { "label": "QLDPC", "reason": "The work targets quantum LDPC codes to preserve space efficiency while enabling logical processing." }, { "label": "Cyclic codes", "reason": "Classical cyclic codes underpin the graph-based constructions and distance-preserving properties of the extractors." } ], "emoji": "🧰", "social_summary": "Enable efficient logical processing on hypergraph product codes using compact, distance-preserving extractor architectures that fit fixed-connectivity hardware and support Pauli-based computation without extra compilation overhead.", "highlights_oneliner": "Full extractors for HGP logical processing" }, { "arxiv_id": "2606.03891", "title": "Efficient Quantum Error Mitigation for Unitary k-Designs", "authors": "Ayush Pancholy, K. Birgitta Whaley", "arxiv_url": "https://arxiv.org/abs/2606.03891", "pdf_url": "https://arxiv.org/pdf/2606.03891.pdf", "summary": "The authors introduce a circuit balancing technique that, combined with gate benchmarking data, allows two-qubit depolarizing noise to be treated as an effective register-wide depolarization for circuits approximating unitary $k$-designs. They show how to estimate and invert this global depolarizing parameter even in the presence of coherent error using Pauli twirling, derive asymptotic scaling for the number of required twirls, and demonstrate substantial infidelity reductions in simulations and experiments on the IBM Fez device. The method targets chaotic and highly entangling circuits without adding any two-qubit gate overhead and remains tractable beyond low-entanglement regimes.", "motivation": "Random circuit ensembles approximating unitary $k$-designs are central for benchmarking, studying quantum chaos, and simulating complex dynamics, yet are strongly affected by depolarizing and coherent noise. This work proposes a specialized mitigation strategy that exploits $k$-design structure to suppress dominant gate errors with minimal quantum overhead, aiming at realistic improvements on near-term and early fault-tolerant hardware.", "highlights": [ "Defines circuit balancing to approximate two-qubit depolarization as global depolarization on $k$-design circuits", "Combines Pauli twirling with an estimated global parameter to mitigate both depolarizing and coherent errors", "Demonstrates significant infidelity reductions in simulations and on IBM Fez without extra two-qubit gates" ], "keywords": [ { "label": "k-designs", "reason": "The protocol is tailored to circuits approximating unitary $k$-designs and their Pauli support statistics." }, { "label": "Depolarization", "reason": "Core objective is to diagnose and invert effective register-wide depolarizing noise based on local gate parameters." }, { "label": "Pauli twirling", "reason": "Pauli twirling is used to handle coherent errors and enable inversion of the estimated survival function." }, { "label": "Benchmarking", "reason": "The method relies on and enhances gate benchmarking data, with applications to random circuit benchmarking and Loschmidt echo tests." } ], "emoji": "🎯", "social_summary": "Tame noise in random, chaotic quantum circuits by balancing unitary k-designs and using Pauli twirling to turn local gate benchmarks into effective global error mitigation without extra two-qubit gates.", "highlights_oneliner": "Circuit balancing for k-design mitigation" }, { "arxiv_id": "2606.02697", "title": "Machine Learning-based Quantum Error Mitigation for Variational Algorithms", "authors": "Nikita Korolev, Kirill Lakhmanskiy, Daniil Rabinovich", "arxiv_url": "https://arxiv.org/abs/2606.02697", "pdf_url": "https://arxiv.org/pdf/2606.02697.pdf", "summary": "This paper proposes a practical machine learning-based quantum error mitigation protocol for variational quantum algorithms that trains mitigation models using only simulated (near-)Clifford circuits. The learned model is designed to generalize across arbitrary ansatz parameters and to transfer between target Hamiltonians with similar structure, enabling application to noisy VQE for the Sherrington-Kirkpatrick model up to $n=12$ qubits under various noise models. Benchmarks show consistent multi-fold error suppression, improved trainability, and superior performance compared to zero-noise extrapolation in high-noise regimes.", "motivation": "Variational quantum algorithms are a leading near-term strategy but remain highly sensitive to gate noise, and many existing ML-based mitigation methods require inaccessible noiseless data. By generating training data from efficiently simulable (near-)Clifford circuits and targeting structural transfer, this work aims to deliver deployable ML-QEM that can enhance NISQ-era variational simulations without ideal hardware access.", "highlights": [ "Trains ML-QEM models using only simulated (near-)Clifford circuits without noiseless target data", "Demonstrates parameter- and Hamiltonian-transferable mitigation for VQE on Sherrington-Kirkpatrick instances up to $n=12$", "Outperforms zero-noise extrapolation in high-noise regimes with several-fold error suppression" ], "keywords": [ { "label": "VQE", "reason": "The protocol is benchmarked on variational quantum eigensolvers, focusing on energy estimation under noise." }, { "label": "ML-QEM", "reason": "Central theme is a machine learning-based quantum error mitigation model trained on simulable data." }, { "label": "Clifford", "reason": "Near-Clifford circuit simulations provide the practical training data source for the mitigation model." }, { "label": "Sherrington", "reason": "The Sherrington-Kirkpatrick Hamiltonian serves as the primary nontrivial testbed for the proposed method." } ], "emoji": "🤖", "social_summary": "Boost variational quantum algorithms by training machine learning error-mitigation models on simulable near-Clifford circuits, achieving transferable noise suppression that can beat zero-noise extrapolation in realistic high-noise regimes.", "highlights_oneliner": "ML-based mitigation for VQE circuits" }, { "arxiv_id": "2606.03582", "title": "Fracton Topological Holography", "authors": "Yu-Tao Hu, Jie-Yu Zhang, Peng Ye", "arxiv_url": "https://arxiv.org/abs/2606.03582", "pdf_url": "https://arxiv.org/pdf/2606.03582.pdf", "summary": "The authors formulate fracton topological holography as a four-stage framework that extends SymTFT-style topological holography from liquid topological orders to fracton stabilizer codes. For the type-I X-cube model with smooth and rough top boundaries, they show that a minimal effective boundary Hamiltonian in both cases is a transverse-field plaquette Ising model with exchanged subsystem symmetry and twist data, related by a linear-depth local unitary sequential circuit. For the type-II Haah cubic code, they use Laurent-polynomial stabilizer formalism to analyze $(Z)$ and $(X)$ top boundaries, obtaining two related two-dimensional qubit systems connected locally by exchanging generalized plaquette Ising and transverse-field terms and nonlocally by a symmetry–relation duality.", "motivation": "Topological holography has clarified symmetries and dualities for conventional topological orders, but its extension to fracton phases with restricted mobility and subsystem structure remained unclear. By building a concrete holographic framework for both type-I and type-II fracton models, this work aims to systematize dualities and boundary theories in fracton stabilizer codes, with implications for exotic quantum phases and potentially code design.", "highlights": [ "Introduces a four-stage fracton topological holography framework for stabilizer fracton orders", "Derives dual transverse-field plaquette Ising boundary theories for X-cube smooth and rough boundaries related by a local SQC", "Analyzes Haah cubic code $(Z)$ and $(X)$ boundaries via Laurent-polynomial formalism, revealing a symmetry–relation duality" ], "keywords": [ { "label": "Fractons", "reason": "Core objects are type-I and type-II fracton orders such as the X-cube model and Haah cubic code." }, { "label": "Holography", "reason": "Extends topological holography (SymTFT) concepts to fracton stabilizer codes and their boundaries." }, { "label": "Boundaries", "reason": "Smooth and rough top boundaries and their induced 2D theories are central to the construction." }, { "label": "Ising", "reason": "Boundary descriptions involve transverse-field plaquette Ising models and generalized plaquette Ising terms." } ], "emoji": "🧩", "social_summary": "Unify dualities in X-cube and Haah fracton codes with a new fracton topological holography framework that maps bulk stabilizer orders to intertwined boundary Ising-like theories.", "highlights_oneliner": "Fracton holography for X-cube and Haah" } ] }, "2026-06-02": { "word_cloud": [ { "word": "codes", "weight": 5 }, { "word": "stabilizer", "weight": 4 }, { "word": "surface", "weight": 4 }, { "word": "duality", "weight": 3 }, { "word": "Ising", "weight": 3 }, { "word": "ZX", "weight": 4 }, { "word": "Clifford", "weight": 5 }, { "word": "gauge", "weight": 3 }, { "word": "hybrid", "weight": 4 }, { "word": "threshold", "weight": 5 }, { "word": "nonlocality", "weight": 3 }, { "word": "Bell", "weight": 3 }, { "word": "entanglement", "weight": 2 }, { "word": "LDPC", "weight": 4 }, { "word": "automorphisms", "weight": 2 } ], "social_highlights": "Highlights: LLM-guided discovery of high-performing bicycle codes, tighter nonlocality and RAC bounds from extended information causality, ZX-calculus for dynamical automorphisms, hybrid Clifford codes via operator algebras, and duality-based thresholds for correlated surface-code noise.", "papers": [ { "arxiv_id": "2606.02418", "title": "Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search", "authors": "Juan Cruz-Benito, Andrew W. Cross, David Kremer, Ismael Faro", "arxiv_url": "https://arxiv.org/abs/2606.02418", "pdf_url": "https://arxiv.org/pdf/2606.02418.pdf", "summary": "This paper introduces an LLM-guided evolutionary framework that mutates Python ansätze to search the bivariate-bicycle and perturbed bivariate-bicycle design spaces, screening about $2\\times 10^5$ candidate quantum LDPC codes. A multi-stage validation pipeline combining $\\mathrm{GF}(2)$ rank, distance estimation with certification, mixed-integer linear programming, BLISS-based Tanner-graph deduplication, decomposability analysis, and local-Clifford checks yields $465$ distinct candidates for $n\\le 360$, including new CSS and non-CSS high-performing codes such as an indecomposable $[[288,16,12]]$ and perturbed codes matching the $[[144,12,12]]$ figure of merit.", "motivation": "Quantum LDPC code discovery has historically relied on human-designed algebraic families and ad hoc search, making it difficult to systematically explore vast structured ansatz spaces. Automating this process with LLM-guided program evolution and rigorous post-selection advances scalable discovery of high-rate, high-distance codes crucial for practical fault-tolerant architectures.", "highlights": [ "LLM-guided evolutionary search over code-generating programs for bivariate and perturbed bivariate bicycle codes.", "Multi-stage exact-validation pipeline integrating $\\mathrm{GF}(2)$ rank, MILP certification, BLISS deduplication, and Clifford-equivalence checks.", "Discovery of $465$ distinct codes for $n\\le 360$, including an indecomposable $[[288,16,12]]$ CSS code and strong non-CSS candidates at $[[144,12,12]]$." ], "keywords": [ { "label": "Bicycle", "reason": "The work targets bivariate-bicycle and perturbed bivariate-bicycle quantum LDPC code families as the primary design space." }, { "label": "Evolutionary", "reason": "An evolutionary algorithm, driven by LLM-suggested program mutations, is central to navigating the large code space." }, { "label": "MILP", "reason": "Mixed-integer linear programming is used in the validation pipeline to certify or bound the code distance." }, { "label": "BLISS", "reason": "BLISS-based Tanner-graph deduplication is employed to identify equivalence classes and remove redundant candidate codes." } ], "emoji": "🧠", "social_summary": "Use LLM-guided evolutionary search with rigorous validation to discover dozens of new high-performing bivariate bicycle quantum LDPC codes, including indecomposable $[[288,16,12]]$ and strong non-CSS variants.", "highlights_oneliner": "LLM-evolved bivariate bicycle LDPC codes" }, { "arxiv_id": "2606.02416", "title": "Bounds on Nonlocality and Random Access Codes from Extended Information Causality Principle", "authors": "Prabhav Jain, Nikolai Miklin, Mariami Gachechiladze", "arxiv_url": "https://arxiv.org/abs/2606.02416", "pdf_url": "https://arxiv.org/pdf/2606.02416.pdf", "summary": "The authors study an extended Information Causality principle that allows correlations among Alice's inputs and derive new analytical quantum Bell inequalities in $n\\,n22$ and $d2\\,d$ scenarios. They strengthen known Information-Causality-derived bounds on quantum correlations, obtain improved analytical limits for the Collins–Gisin $I_{nn22}$ family, and show that for entanglement-assisted random access codes the extended principle does not surpass original Information Causality bounds, indicating their optimality for this task.", "motivation": "Understanding which physical principles single out quantum correlations among all non-signaling theories is central to the foundations of quantum information and device-independent protocols. Refining Information Causality and its implications for nonlocality and random access codes clarifies the structure of the quantum set and informs limits of quantum-assisted communication tasks.", "highlights": [ "Derivation of a family of quantum Bell inequalities from extended Information Causality in the $n\\,n22$ scenario, tightening earlier bounds.", "Improved analytical upper bounds for the Collins–Gisin $I_{nn22}$ Bell inequalities using the extended principle.", "Proof that for certain entanglement-assisted random access codes, extended Information Causality gives no stronger winning-probability bounds than the original, suggesting optimality." ], "keywords": [ { "label": "Nonlocality", "reason": "The work analyzes constraints on nonlocal correlations through Bell inequalities and information principles." }, { "label": "Causality", "reason": "Extended Information Causality is the central physical principle used to bound correlations and communication tasks." }, { "label": "Bell", "reason": "New quantum Bell inequalities and improved bounds on Collins–Gisin inequalities are key technical results." }, { "label": "RACs", "reason": "Entanglement-assisted random access codes are used to test the strength and optimality of Information Causality bounds." } ], "emoji": "🔗", "social_summary": "Tighten bounds on quantum nonlocality and entanglement-assisted random access codes using an extended Information Causality principle that refines Bell inequalities without improving known RAC limits.", "highlights_oneliner": "Extended information causality bounds nonlocality" }, { "arxiv_id": "2606.02542", "title": "Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus", "authors": "Alexander Frei, Sascha Zakaib-Bernier, Zachary Mann, Michael Vasmer, Victor V. Albert", "arxiv_url": "https://arxiv.org/abs/2606.02542", "pdf_url": "https://arxiv.org/pdf/2606.02542.pdf", "summary": "This work extends the ZX-calculus to describe Floquet and other dynamical stabilizer codes by exploiting the relation between measurement-based code switching and gauge fixing. By composing gauge-fixing steps into closed loops in stabilizer-code space, the authors construct dynamical automorphisms that implement logical Clifford gates, including a distance-preserving logical phase gate for the seven-qubit bare code that cannot be realized via single-qubit Cliffords and permutations alone.", "motivation": "Dynamical codes and Floquet-type constructions offer promising routes to implement logical operations beyond static transversal gates in fault-tolerant architectures. Providing a ZX-calculus framework for measurement-based code switching and gauge-fixing paths enables automated search for nontrivial logical Clifford implementations in stabilizer codes.", "highlights": [ "Extension of ZX-calculus to explicitly model Floquet and dynamical stabilizer codes via measurement-based code switching and gauge fixing.", "Construction of closed measurement-based gauge-fixing loops that realize logical Clifford automorphisms as \"chutes and ladders\" in stabilizer-code space.", "Implementation of a distance-preserving logical phase gate for the seven-qubit bare code, previously known to lack nontrivial Clifford gates from single-qubit operations and permutations." ], "keywords": [ { "label": "ZX", "reason": "The ZX-calculus is generalized to capture dynamical stabilizer code transformations and logical gates." }, { "label": "Floquet", "reason": "Floquet and other time-dependent stabilizer codes are a main application of the extended graphical framework." }, { "label": "Automorphisms", "reason": "Dynamical automorphisms of the codespace emerge from closed gauge-fixing loops implementing logical Cliffords." }, { "label": "Gauge", "reason": "Gauge fixing and measurement-based code switching are the key mechanisms used to navigate stabilizer-code space." } ], "emoji": "🔀", "social_summary": "Extend ZX-calculus to dynamical stabilizer codes and use measurement-based gauge-fixing \"chutes and ladders\" to realize nontrivial logical Cliffords, including a distance-preserving phase gate for the seven-qubit bare code.", "highlights_oneliner": "ZX-calculus for dynamical code automorphisms" }, { "arxiv_id": "2606.02531", "title": "Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory", "authors": "Jonas Eidesen, David W. Kribs, Andrew Nemec", "arxiv_url": "https://arxiv.org/abs/2606.02531", "pdf_url": "https://arxiv.org/pdf/2606.02531.pdf", "summary": "The paper develops a two-fold generalization of Clifford codes to encompass hybrid classical-quantum information and projective representation theory, yielding new classes of hybrid subspace and subsystem Clifford codes. Within the operator algebra quantum error correction framework, it extends the fundamental representation-theoretic QEC theorem to these hybrid settings and provides examples of both stabilizer and genuinely non-stabilizer constructions, along with a notion of code distance.", "motivation": "Clifford codes generalize stabilizer codes via group representation theory, and recent interest in hybrid classical-quantum coding and subsystem codes motivates unifying these themes. Embedding hybrid Clifford codes into operator algebra QEC strengthens the theoretical underpinnings of advanced code families relevant to near-term and fault-tolerant architectures with mixed information types.", "highlights": [ "Introduction of hybrid subspace and subsystem Clifford codes that encode both classical and quantum information.", "Extension of the representation-theoretic quantum error correction theorem to the operator algebra setting including these hybrid Clifford codes.", "Construction and discussion of stabilizer and non-stabilizer examples, together with a distance notion tailored to the hybrid Clifford framework." ], "keywords": [ { "label": "Clifford", "reason": "The work generalizes the Clifford-code framework to hybrid and operator-algebraic settings." }, { "label": "Hybrid", "reason": "Codes that simultaneously protect classical and quantum information are central to the construction." }, { "label": "Subsystem", "reason": "Subsystem formulations of Clifford codes are developed alongside subspace versions within the operator algebra framework." }, { "label": "Algebras", "reason": "Operator algebras underpin the generalized error correction conditions and structure the new code families." } ], "emoji": "🏛️", "social_summary": "Generalize Clifford codes within operator algebra quantum error correction to create hybrid classical-quantum subspace and subsystem codes, extending representation-theoretic QEC and providing stabilizer and non-stabilizer examples.", "highlights_oneliner": "Hybrid Clifford codes via operator algebras" }, { "arxiv_id": "2606.02052", "title": "A Minimal Duality Estimate for the Surface-Code Threshold under Nearest-Neighbor Correlated Errors", "authors": "Masayuki Ohzeki", "arxiv_url": "https://arxiv.org/abs/2606.02052", "pdf_url": "https://arxiv.org/pdf/2606.02052.pdf", "summary": "The author applies a single-equation duality criterion to the square-octagonal random-bond Ising model derived from an exact error-edge mapping of a surface code with nearest-neighbor correlated errors. Evaluating the duality condition on the minimal reduced cell yields a threshold estimate $p_c=0.0288427147$ for the symmetric case $p_1=p_2=p_3=p$, closely matching numerical thresholds of about $3\\%$ for such correlated-noise surface codes.", "motivation": "Accurate analytical estimates of surface-code thresholds under realistic correlated noise are crucial for architecture design but are challenging beyond independent-error models. Mapping correlated surface-code decoding to a lattice Ising model and leveraging duality provides a minimal yet precise way to benchmark thresholds against numerics for nontrivial noise correlations.", "highlights": [ "Use of a single-equation duality criterion on a square-octagonal random-bond Ising model obtained from an exact error-edge map of correlated surface-code noise.", "Minimal-cell evaluation of the duality condition to analytically estimate the threshold for nearest-neighbor correlated errors.", "Threshold estimate $p_c\\approx 0.02884$ for $p_1=p_2=p_3=p$, in close agreement with numerical results near $3\\%$." ], "keywords": [ { "label": "Surface", "reason": "The method evaluates thresholds for a surface-code architecture subject to correlated noise." }, { "label": "Duality", "reason": "A single-equation duality approach on the mapped Ising model underpins the threshold estimate." }, { "label": "Ising", "reason": "The correlated decoding problem is represented as a square-octagonal random-bond Ising model after error-edge mapping." }, { "label": "Thresholds", "reason": "The main quantitative result is an analytical estimate of the error threshold under correlated nearest-neighbor noise." } ], "emoji": "⚡", "social_summary": "Apply a minimal duality criterion on a square-octagonal Ising model to analytically estimate a near-$3\\%$ surface-code threshold under nearest-neighbor correlated errors.", "highlights_oneliner": "Duality estimate of correlated surface-code threshold" } ] }, "2026-06-01": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "Decoders", "weight": 5 }, { "word": "Syndrome", "weight": 4 }, { "word": "Lattice", "weight": 4 }, { "word": "Overhead", "weight": 4 }, { "word": "Twist", "weight": 3 }, { "word": "Hexagonal", "weight": 3 }, { "word": "Latency", "weight": 5 }, { "word": "Streaming", "weight": 3 }, { "word": "qLDPC", "weight": 4 }, { "word": "Topology", "weight": 4 }, { "word": "Dimension", "weight": 5 }, { "word": "Fractal", "weight": 3 }, { "word": "Gates", "weight": 3 }, { "word": "Thermal", "weight": 2 } ], "social_highlights": "Highlights: denser twist-based planar surface code enabling utility-scale chemistry, engineering blueprint for real-time QEC system stacks and decoders, and intrinsic locality dimension unifying geometry, code trade-offs, and gate limitations.", "papers": [ { "arxiv_id": "2605.30455", "title": "A Denser Planar Surface Code", "authors": "Guang Hao Low, William J. Huggins, Dominic W. Berry, Tanuj Khattar, Alec F. White, Nicholas C. Rubin, Ryan Babbush", "arxiv_url": "https://arxiv.org/abs/2605.30455", "pdf_url": "https://arxiv.org/pdf/2605.30455.pdf", "summary": "This paper designs a surface-code-derived architecture on a regular $2$D hexagonal grid that packs twist defects densely to achieve an encoding rate up to $4.5\\times$ that of a rotated surface-code patch under a circuit-level depolarizing noise model. It introduces four-layer stabilizer measurement schedules with near-elimination of distance-reducing hook errors, efficient decoding, and padding-free lattice surgery in an optimal $2d^2$-qubit bounding box, enabling chemically accurate phase estimation of large electronic-structure instances with dramatically reduced space-time volume. The authors quantify a space-time Pareto frontier, reaching roughly $36\\times$ space and $6.6\\times$ spacetime improvements over prior minimum-Toffoli resource estimates for FeMoco-scale simulations.", "motivation": "Standard planar surface codes on square or hexagonal lattices achieve high thresholds but suffer from very low encoding rate, making utility-scale quantum chemistry simulations prohibitively qubit-intensive. By densifying logical qubit packing on realistic hex-grid hardware without extra assumptions, this work directly targets the dominant overhead bottleneck for early fault-tolerant chemical algorithms and clarifies achievable space-time trade-offs.", "highlights": [ "Dense twist-based packing on hex grid boosts encoding rate up to $4.5\\times$ over rotated patches.", "Four-layer stabilizer cycles suppress hook errors while supporting efficient decoding and lattice surgery in $2d^2$ qubits.", "Resource analysis shows FeMoco-scale phase estimation in under a month with about $8.9\\times 10^4$ noisy qubits and $\\sim 1.3$ mega-qubit-hours." ], "keywords": [ { "label": "Surface", "reason": "Core contribution is a higher-rate planar surface-code construction on a hexagonal lattice with twist defects." }, { "label": "Twists", "reason": "Dense packing of twist defects is the main structural idea enabling improved logical qubit density." }, { "label": "Lattice", "reason": "New padding-free lattice-surgery protocols in an optimal $2d^2$ bounding box are central to the architecture." }, { "label": "Chemistry", "reason": "Target application is utility-scale electronic-structure phase estimation such as FeMoco with reduced resources." } ], "emoji": "🧱", "social_summary": "Pack surface-code twists on a hex grid to boost logical density and cut space-time by over an order of magnitude for utility-scale quantum chemistry simulations.", "highlights_oneliner": "Denser twist-based planar surface code architecture" }, { "arxiv_id": "2605.30765", "title": "Real-Time Quantum Error Correction System Stack: Architecture, Algorithms, and Engineering Practice", "authors": "Yaojian Chen, Chun-Yang Luan, Peilin Zheng, Xianghong Zeng, Jia-Yi Hou, Zhuo Fu, Yirong Jin, Fei Wang, Guangwen Yang, Dingshun Lv", "arxiv_url": "https://arxiv.org/abs/2605.30765", "pdf_url": "https://arxiv.org/pdf/2605.30765.pdf", "summary": "This white paper analyzes real-time quantum error correction as a systems-engineering problem, identifying that the key bottlenecks now lie in QEC round time, tail latency, backlog, and end-to-end data-path coordination rather than decoder algorithms alone. It benchmarks mainstream surface-code and $\\text{qLDPC}$ decoders for real-time readiness and quantifies how synchronization barriers and heavy-syndrome events inflate $p_{99}$ latency, constraining feasible code distances on single-core decoders. The authors propose a six-layer reference system stack with interface definitions and latency-budget models that connect syndrome acquisition through decoding to logical operations, giving design guidance for scalable fault-tolerant quantum computers.", "motivation": "State-of-the-art experiments have demonstrated below-threshold surface codes and real-time feedback loops, shifting the challenge from proving feasibility to building production-grade, continuously running fault-tolerant systems. This work frames QEC as an integrated system-stack problem, clarifying how latency tails, throughput deficits, and architecture choices impact the viability of large-scale algorithms such as factoring RSA instances.", "highlights": [ "Identifies QEC round time, tail latency, and backlog management as primary real-time bottlenecks beyond average decoder speed.", "Benchmarks major surface-code and $\\text{qLDPC}$ decoders, showing that $p_{99}$ latency restricts code distance compared to mean-latency estimates on a single CPU core.", "Defines a six-layer real-time QEC system stack with explicit interfaces and latency budgets from syndrome readout to logical operations." ], "keywords": [ { "label": "Decoders", "reason": "The paper benchmarks mainstream decoding algorithms and their real-time performance limits for surface and $\\text{qLDPC}$ codes." }, { "label": "Latency", "reason": "Tail latency, synchronization deadlines, and backlog are central metrics in their system-level analysis." }, { "label": "Architecture", "reason": "They propose a six-layer real-time QEC system stack with defined interfaces and latency budgets." }, { "label": "qLDPC", "reason": "High-rate $\\text{qLDPC}$ codes are evaluated as alternatives to surface codes, highlighting trade-offs in connectivity and decoding pipelines." } ], "emoji": "🖥️", "social_summary": "Engineer a full real-time QEC system stack that tames decoder latency, backlog, and synchronization to move from lab demonstrations to scalable fault-tolerant quantum computers.", "highlights_oneliner": "System-stack blueprint for real-time QEC" }, { "arxiv_id": "2605.31441", "title": "Intrinsic locality dimension of quantum codes", "authors": "Yimin Lu, Esther Xiaozhen Fu, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2605.31441", "pdf_url": "https://arxiv.org/pdf/2605.31441.pdf", "summary": "This work introduces the intrinsic locality dimension of stabilizer codes, defined via tools from fractal geometry and geometric measure theory so as to be independent of any background embedding geometry and potentially noninteger. Using this dimension, the authors derive general bounds on code parameters and compatible fault-tolerant logical gates that extend the Bravyi–Poulin–Terhal and Bravyi–K\\\"onig theorems beyond regular topological codes, and they analyze both topological and algebraic families such as bivariate-bicycle codes. They further connect the intrinsic dimension to thermal properties, proving a conditional no-go theorem ruling out self-correcting quantum memories in effective dimension $3-\\varepsilon$ for any $\\varepsilon>0$, and develop the underlying theory of Assouad dimension for Tanner and connectivity graphs.", "motivation": "There is a long-standing tension between good code parameters and geometric locality: low-dimensional topological codes are hardware-friendly but suboptimal, while asymptotically good $\\text{qLDPC}$ codes typically require highly nonlocal connectivity. By abstracting locality into an intrinsic dimension of the code’s Tanner graph, this paper provides a unifying mathematical framework to classify codes, constrain transversal gates, and assess prospects for self-correcting memories independently of specific layouts.", "highlights": [ "Defines an intrinsic locality dimension for stabilizer codes using Assouad-type notions that are independent of any ambient lattice.", "Proves general trade-off bounds on code parameters and allowed fault-tolerant logical gates, recovering and extending Bravyi–Poulin–Terhal and Bravyi–K\\\"onig results.", "Establishes a conditional no-go result for self-correcting quantum memories in effective dimension $3-\\varepsilon$ and relates Assouad dimension of Tanner and connectivity graphs." ], "keywords": [ { "label": "Dimension", "reason": "Intrinsic locality dimension is the central organizing parameter proposed for stabilizer codes." }, { "label": "Topology", "reason": "Results generalize geometric locality bounds for topological codes using the new dimension notion." }, { "label": "Bicycle", "reason": "Bivariate-bicycle-type algebraic codes serve as key examples in the intrinsic-dimension framework." }, { "label": "Thermal", "reason": "The work derives thermal no-go results for self-correcting memories in effective dimension $3-\\varepsilon$." } ], "emoji": "🧭", "social_summary": "Unify geometric and algebraic quantum codes by defining an intrinsic locality dimension that bounds parameters, limits logical gates, and constrains self-correcting quantum memories.", "highlights_oneliner": "Intrinsic locality dimension unifies code geometry" } ] }, "2026-05-29": { "word_cloud": [ { "word": "Surface", "weight": 5 }, { "word": "Decoding", "weight": 5 }, { "word": "Stabilizer", "weight": 4 }, { "word": "Magic", "weight": 5 }, { "word": "Distillation", "weight": 5 }, { "word": "Threshold", "weight": 4 }, { "word": "Crosstalk", "weight": 4 }, { "word": "Fidelity", "weight": 4 }, { "word": "Dissipation", "weight": 4 }, { "word": "Mitigation", "weight": 4 }, { "word": "Syndrome", "weight": 4 }, { "word": "Silicon", "weight": 4 }, { "word": "Phase", "weight": 3 }, { "word": "Topological", "weight": 3 }, { "word": "Covariant", "weight": 3 } ], "social_highlights": "Highlights: tutorial on modern QEC and fault tolerance, asymptotic magic-state distillation with near-linear rate, coherent crosstalk simulation in surface codes, adaptive stabilizer fidelity certification, hardware-tailored silicon resource estimates, programmable dissipation via partial correction, statistical critique of QEM benchmarks, error-corrected phase estimation on trapped ions, and noise-as-resource geometry.", "papers": [ { "arxiv_id": "2605.29137", "title": "Quantum error correction and fault tolerance: A comprehensive tutorial", "authors": "Daniel J. Spencer, Shubham P. Jain, Andrew Tanggara, Zeen Sun, Tobias Haug, Derek Khu, Kishor Bharti", "arxiv_url": "https://arxiv.org/abs/2605.29137", "pdf_url": "https://arxiv.org/pdf/2605.29137.pdf", "summary": "This tutorial develops the core framework of modern quantum error correction, covering codes, syndromes, stabilizers, decoding, and fault tolerance. It also surveys major code families, including topological, subsystem, bosonic, qudit, dynamical, and $q$LDPC codes, with an emphasis on operational understanding for code design and fault-tolerant computation.", "motivation": "Quantum error correction is the foundational route to protecting fragile quantum information against noise and enabling scalable quantum computing. A coherent tutorial matters because the field now spans many code families and decoding paradigms that can be difficult for newcomers and researchers alike to organize.", "highlights": [ "Core QEC and fault-tolerance tutorial", "Covers topological, bosonic, qudit, and $q$LDPC codes", "Focuses on operational decoding and design" ], "keywords": [ { "label": "Stabilizers", "reason": "Central formalism for syndromes, codes, and fault-tolerant structure." }, { "label": "Decoding", "reason": "Explains how errors are diagnosed and corrected in practice." }, { "label": "Topological", "reason": "Major code family highlighted in the survey of modern constructions." }, { "label": "qLDPC", "reason": "Represents newer low-density parity-check directions in QEC." } ], "emoji": "📚", "social_summary": "Introduces modern quantum error correction from first principles through advanced code families and fault tolerance.", "highlights_oneliner": "Comprehensive QEC and FT tutorial" }, { "arxiv_id": "2605.30108", "title": "Asymptotic magic state distillation with almost linear rate", "authors": "Koki Ehara, Ryuji Takagi", "arxiv_url": "https://arxiv.org/abs/2605.30108", "pdf_url": "https://arxiv.org/pdf/2605.30108.pdf", "summary": "The paper studies the relationship between overhead exponent and asymptotic distillation rate in magic-state distillation. It constructs protocols whose overhead exponent is not near zero, even exceeding $1$, yet whose asymptotic output-to-input rate approaches the linear limit arbitrarily closely, using error checking via logical Clifford measurements.", "motivation": "Magic-state distillation is a central bottleneck for fault-tolerant quantum computation because non-Clifford resources are expensive to purify. Understanding rate-versus-overhead tradeoffs matters for benchmarking protocols beyond traditional asymptotic cost metrics.", "highlights": [ "Separates overhead exponent from asymptotic rate", "Constructs near-linear-rate protocols with exponent above $1$", "Uses logical Clifford measurement checks" ], "keywords": [ { "label": "Magic", "reason": "The work is about magic-state distillation as the resource bottleneck." }, { "label": "Overhead", "reason": "Introduces and analyzes the overhead exponent as a benchmark." }, { "label": "Rates", "reason": "Focuses on asymptotic distillation rate and its scaling." }, { "label": "Clifford", "reason": "Logical Clifford-operator checks underpin the construction." } ], "emoji": "✨", "social_summary": "Shows that magic-state distillation can approach linear asymptotic yield even when the usual overhead exponent is large.", "highlights_oneliner": "Near-linear magic distillation" }, { "arxiv_id": "2605.29514", "title": "Non-Clifford Crosstalk Noise in Surface Codes Using Hybrid Stabilizer-Tensor Network Methods", "authors": "Ben Harper, Azar C. Nakhl, Martin Sevior, Muhammad Usman", "arxiv_url": "https://arxiv.org/abs/2605.29514", "pdf_url": "https://arxiv.org/pdf/2605.29514.pdf", "summary": "The paper simulates coherent non-Clifford crosstalk during syndrome extraction in a surface code using hybrid stabilizer-tensor network methods. It shows that coherence increases logical error rates, lowers the code threshold, and that the spatial distribution of noise can quantitatively change logical performance.", "motivation": "Most QEC analyses rely on incoherent noise models or idealized syndrome measurements because they are easier to simulate. Coherent crosstalk is important for realistic hardware, so better simulation tools are needed to predict thresholds and logical error behavior accurately.", "highlights": [ "Models coherent crosstalk during syndrome extraction", "Finds higher logical error and lower threshold", "Shows noise distribution changes logical rates" ], "keywords": [ { "label": "Surface", "reason": "The study targets surface-code syndrome extraction." }, { "label": "Crosstalk", "reason": "Coherent crosstalk is the noise source under investigation." }, { "label": "Tensor", "reason": "Hybrid tensor-network simulation enables the analysis." }, { "label": "Threshold", "reason": "Logical threshold degradation is one of the main findings." } ], "emoji": "🧩", "social_summary": "Simulates coherent crosstalk in surface codes and shows that realistic noise coherence worsens logical performance.", "highlights_oneliner": "Crosstalk lowers surface-code threshold" }, { "arxiv_id": "2605.29820", "title": "Adaptive Stabilizer State Fidelity Certification", "authors": "Kun Wang", "arxiv_url": "https://arxiv.org/abs/2605.29820", "pdf_url": "https://arxiv.org/pdf/2605.29820.pdf", "summary": "This work extends fixed-gauge stabilizer fidelity certification to an adaptive interval-valued framework. It derives the complementary optimal upper bound, formulates gauge selection as an exact linear-programming design problem, and proves monotonic tightening, exact recovery with full stabilizer coverage, and regimes where adaptivity beats the worst-case exponential benchmark.", "motivation": "Stabilizer-state certification is important for validating resources used in quantum error correction and measurement-based quantum computing. Gauge dependence in existing certification methods can leave large fidelity ambiguity, so tighter and more adaptive bounds are practically significant.", "highlights": [ "Derives optimal upper fidelity bound", "Adapts gauge choice via linear programs", "Proves exact recovery under full coverage" ], "keywords": [ { "label": "Fidelity", "reason": "The paper certifies fidelity intervals for stabilizer states." }, { "label": "Stabilizer", "reason": "Targets stabilizer-state resources and generator gauges." }, { "label": "Gauge", "reason": "Adaptive gauge selection is the main methodological innovation." }, { "label": "Linear", "reason": "Exact endpoint linear programs drive the certification procedure." } ], "emoji": "🎯", "social_summary": "Builds an adaptive certification method that tightens stabilizer-state fidelity bounds by selecting informative gauges.", "highlights_oneliner": "Adaptive stabilizer fidelity bounds" }, { "arxiv_id": "2605.28936", "title": "Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits", "authors": "Songqinghao Yang, Christopher K. Long, Rubén M. Otxoa, Prakash Murali, Crispin H. W. Barnes, David R. M. Arvidsson-Shukur", "arxiv_url": "https://arxiv.org/abs/2605.28936", "pdf_url": "https://arxiv.org/pdf/2605.28936.pdf", "summary": "The paper presents a silicon-spin-qubit resource analysis for producing high-fidelity logical magic states across multiple architectures and code choices. Using a realistic Hamiltonian noise model with $1/f$ non-Markovian noise, it propagates physical constraints to algorithm-level overheads and finds that optimized control pulses reduce distillation overhead by $42\\%$ while silicon-tailored biased codes cut footprint by about a factor of three.", "motivation": "Fault-tolerant quantum algorithms require accurate estimates of hardware, code, and distillation costs before systems can be scaled. Silicon spin qubits are a leading platform, so hardware-tailored resource estimation is crucial for determining whether practical algorithms are feasible.", "highlights": [ "Compares silicon architectures and code families", "Uses realistic Hamiltonian and $1/f$ noise model", "Finds $42\\%$ overhead reduction with optimized pulses" ], "keywords": [ { "label": "Silicon", "reason": "The analysis is specifically tailored to silicon spin-qubit hardware." }, { "label": "Distillation", "reason": "Magic-state distillation protocols are a central cost driver." }, { "label": "Biased", "reason": "Biased error-correcting codes deliver footprint savings." }, { "label": "Hamiltonian", "reason": "Hardware noise modeling is built from a silicon Hamiltonian." } ], "emoji": "🪙", "social_summary": "Estimates silicon-spin-qubit resources for magic-state distillation and shows large savings from optimized control and biased codes.", "highlights_oneliner": "Silicon-tailored distillation costs" }, { "arxiv_id": "2605.30217", "title": "Programmable Dissipation via Partial Quantum Error Correction", "authors": "Sameer Dambal, Michael AD Taylor, Yu Zhang", "arxiv_url": "https://arxiv.org/abs/2605.30217", "pdf_url": "https://arxiv.org/pdf/2605.30217.pdf", "summary": "The paper reframes partial error correction as a programmable primitive for open-system quantum dynamics. One fault-tolerant round induces a logical CPTP map, and decoder randomization generates controllable logical channels whose convex mixtures can compile target dissipators without explicit bath ancillas, with an accuracy criterion based on keeping unwanted logical errors below the intended dissipation per step.", "motivation": "Open quantum systems require dissipation rather than complete error suppression, creating tension with standard fault-tolerant design. Reusing error-correction cycles as a control primitive matters because it can make simulation of dissipative physics more resource efficient.", "highlights": [ "Turns error correction into a programmable dissipation primitive", "Uses decoder randomization to mix logical channels", "Derives a stepwise accuracy criterion for simulation" ], "keywords": [ { "label": "Dissipation", "reason": "The central goal is to program logical dissipation." }, { "label": "Decoder", "reason": "Randomized decoder choice enables channel mixing." }, { "label": "CPTP", "reason": "Logical rounds are modeled as completely positive trace-preserving maps." }, { "label": "Ancillas", "reason": "The method avoids explicit ancilla qubits for the bath." } ], "emoji": "🌊", "social_summary": "Recasts partial error correction as a tool for compiling dissipation into logical quantum dynamics.", "highlights_oneliner": "Programmable logical dissipation" }, { "arxiv_id": "2605.29872", "title": "Claim against Measurement: Statistical Artefacts in Quantum Error Mitigation Benchmarks", "authors": "Dominik Köster, Wolfgang Mauerer", "arxiv_url": "https://arxiv.org/abs/2605.29872", "pdf_url": "https://arxiv.org/pdf/2605.29872.pdf", "summary": "The paper systematically reviews $81$ recent quantum error mitigation studies using an eight-criterion framework for statistical rigor, reproducibility, and reporting quality. It then uses zero-noise extrapolation as a case study to show that benchmark outcomes can flip under parameter choices and can be distorted by temporal drift, motivating stricter reporting and inferential testing standards.", "motivation": "Quantum error mitigation is often promoted as a bridge from $NISQ$ devices to fault-tolerant quantum computing, but benchmarking practice has not been uniformly rigorous. Careful statistical evaluation matters because flawed conclusions can overstate mitigation performance and misguide experimental claims.", "highlights": [ "Reviews $81$ QEM papers for reporting quality", "Shows parameter sensitivity can flip conclusions", "Identifies drift-induced effectiveness artefacts" ], "keywords": [ { "label": "Mitigation", "reason": "The paper evaluates quantum error mitigation practice." }, { "label": "Statistics", "reason": "Statistical rigor is the main critique and framework." }, { "label": "Drift", "reason": "Temporal drift is shown to distort benchmark results." }, { "label": "ZNE", "reason": "Zero-noise extrapolation is the representative case study." } ], "emoji": "📊", "social_summary": "Exposes statistical artefacts in quantum error mitigation benchmarks and calls for stronger reporting standards.", "highlights_oneliner": "Benchmark artefacts in QEM" }, { "arxiv_id": "2605.29674", "title": "Error-corrected phase estimation averaged over variable grids on a trapped-ion quantum computer: hyperacuity spectra of a CO molecule adsorbed onto $\\chi$-Fe$_5$C$_2$", "authors": "Taichi Kosugi, Hirofumi Nishi, Keito Kasebayashi, Hiroki Takahashi, Yu-ichiro Matsushita", "arxiv_url": "https://arxiv.org/abs/2605.29674", "pdf_url": "https://arxiv.org/pdf/2605.29674.pdf", "summary": "The paper introduces QPE averaged over variable grids ($QAVG$), a vernier-like method combining low-resolution quantum phase estimation with multiple origin shifts and continuous parametrization for spectral reconstruction. It demonstrates the method on a CO molecule adsorbed on $\\chi$-Fe$_5$C$_2$ using both physical and Steane-code logical circuits with offline bit-flip correction, obtaining spectra with deviations far below nominal grid resolution.", "motivation": "Quantum phase estimation is a core tool for extracting excitation spectra, but current devices suffer from coarse grid resolution and noise. Variable-grid averaging matters because it can improve spectral accuracy without requiring fully ideal hardware.", "highlights": [ "Introduces variable-grid averaged phase estimation", "Runs physical and Steane-code logical experiments", "Reconstructs spectra beyond nominal resolution" ], "keywords": [ { "label": "Phase", "reason": "Quantum phase estimation is the core algorithmic primitive." }, { "label": "Steane", "reason": "Logical circuits use the Steane code for error correction." }, { "label": "Spectra", "reason": "The target application is electronic spectrum reconstruction." }, { "label": "Averaging", "reason": "Grid averaging suppresses leakage and stabilizes fits." } ], "emoji": "🔬", "social_summary": "Improves phase-estimation spectroscopy with variable-grid averaging and logical trapped-ion demonstrations.", "highlights_oneliner": "Variable-grid phase estimation" }, { "arxiv_id": "2605.30026", "title": "On the question of noise as a resource in quantum computing", "authors": "J. Montes, F. Borondo, Gabriel G. Carlo", "arxiv_url": "https://arxiv.org/abs/2605.30026", "pdf_url": "https://arxiv.org/pdf/2605.30026.pdf", "summary": "This paper proposes a geometric mechanism by which certain non-unital noise channels can accelerate convergence toward Haar-like output distributions when combined with universal gates. Using a one-qubit amplitude-damping model and a renormalization map to pure states, it derives a nonlinear expanding map, identifies local area expansion and a global threshold, and demonstrates faster Haar-like behavior with the $G_3$ gate set in an appropriate parameter regime.", "motivation": "Noise is usually treated as detrimental, but some learning and reservoir-computing settings suggest that selected noise channels can be beneficial. Understanding when noise enhances randomness matters for algorithm design and for distinguishing harmful decoherence from potentially useful dynamics.", "highlights": [ "Gives a geometric model of noise as expansion", "Derives a global expansion threshold for amplitude damping", "Shows faster Haar-like convergence with $G_3$" ], "keywords": [ { "label": "Noise", "reason": "The work analyzes when noise can be useful rather than harmful." }, { "label": "Amplitude", "reason": "Amplitude damping is the central noise channel studied." }, { "label": "Haar", "reason": "Haar-like distribution convergence is the target behavior." }, { "label": "Geometry", "reason": "The argument is built on manifold expansion geometry." } ], "emoji": "🌐", "social_summary": "Argues that selected noise channels can speed convergence to Haar-like randomness in quantum circuits.", "highlights_oneliner": "Noise can speed randomness" } ] }, "2026-05-28": { "word_cloud": [ { "word": "transversal-gates", "weight": 4 }, { "word": "biased-noise", "weight": 4 }, { "word": "correlated-decoding", "weight": 4 }, { "word": "GKP-lattices", "weight": 5 }, { "word": "abelian-varieties", "weight": 5 }, { "word": "theta-functions", "weight": 3 }, { "word": "multiqubit-gates", "weight": 4 }, { "word": "motional-dephasing", "weight": 4 }, { "word": "phonon-heating", "weight": 3 }, { "word": "surface-code", "weight": 5 }, { "word": "non-additive-encodings", "weight": 3 }, { "word": "variational-learning", "weight": 4 }, { "word": "minimum-weight-perfect-matching", "weight": 3 }, { "word": "noise-bias", "weight": 3 }, { "word": "Gaussian-unitaries", "weight": 3 }, { "word": "microscopic-noise-modeling", "weight": 4 }, { "word": "all-to-all-connectivity", "weight": 3 }, { "word": "stabilizer-measurement", "weight": 2 }, { "word": "theta-group", "weight": 2 }, { "word": "isogenies", "weight": 2 } ], "social_highlights": "Highlights: Learned transversal logical gates for arbitrary encodings, boosted biased-noise thresholds via correlated decoding, built a rigorous abelian-variety framework for GKP codes, and showed trapped-ion multiqubit gates can scale with surface-code quantum error correction.", "papers": [ { "arxiv_id": "2605.28162", "title": "Learning Logical Operations for Arbitrary Quantum Error Correction Codes", "authors": "Nico Meyer, Christopher Mutschler, Dominik Seuß, Andreas Maier, Daniel D. Scherer", "arxiv_url": "https://arxiv.org/abs/2605.28162", "pdf_url": "https://arxiv.org/pdf/2605.28162.pdf", "summary": "This paper introduces a variational learning framework that synthesizes physical implementations of logical operations for arbitrary quantum error-correcting codes given only an encoding unitary, without assuming a stabilizer description or decoder. It uses structured ansätze constrained for properties like transversality or shallow depth and unifies intra- and inter-block logical gates, rediscovering known transversal gates on small stabilizer codes. The authors extend this to a co-design scheme, VarEFTQC, that simultaneously learns noise-tailored non-additive encodings and compatible logical gate sets, including transversal IQP-type families and low-depth universal sets.", "motivation": "Early fault-tolerant architectures increasingly rely on small, hardware-adapted, often non-additive codes discovered variationally, but these typically lack systematic constructions of logical gates compatible with fault-tolerance constraints. Providing a general, code-agnostic method to learn logical operations—especially transversal or shallow-depth ones—matters for rapidly turning such bespoke encodings into usable logical qubits under realistic noise and connectivity.", "highlights": [ "General variational pipeline learns logical gates from only the encoding circuit, enforcing transversal or shallow-depth structure.", "Framework reliably rediscovers all known transversal logical gates on standard small stabilizer codes using fidelity-based losses.", "VarEFTQC co-designs noise-tailored non-additive encodings and logical gate sets with native transversal IQP-type circuits and near-universal logical gadgets." ], "keywords": [ { "label": "variational-logical-gate-synthesis", "reason": "Central contribution is a variational framework that trains parametrized circuits to implement target logical operations from an encoding unitary." }, { "label": "transversal-logical-gadgets", "reason": "Method explicitly constrains ansätze to transversal forms to obtain hardware-friendly, fault-tolerant logical gates." }, { "label": "non-additive-learned-encodings", "reason": "VarEFTQC targets noise-tailored, non-additive codes discovered variationally and equips them with logical operations." }, { "label": "early-fault-tolerant-quantum-computing", "reason": "The co-design approach is positioned as a practical tool for early-stage fault-tolerant regimes with low-depth logical gadgets." } ], "emoji": "🧠", "social_summary": "Learn noise-tailored logical gates directly from encoding circuits with VarEFTQC, co-designing non-additive codes and transversal gadgets for early fault-tolerant quantum computing.", "highlights_oneliner": "Learning transversal logical operations from arbitrary encodings." }, { "arxiv_id": "2605.27598", "title": "Leveraging Correlated Decoding for Bias-Tailored Compass Codes", "authors": "Arianna Meinking, Julie Campos, Kenneth R. Brown", "arxiv_url": "https://arxiv.org/abs/2605.27598", "pdf_url": "https://arxiv.org/pdf/2605.27598.pdf", "summary": "This work performs circuit-level simulations of Clifford-deformed elongated compass codes under biased Pauli noise to study their performance with standard minimum-weight perfect matching (MWPM) and correlated MWPM decoders. By incorporating correlations induced by circuit-level noise, the correlated decoder yields higher thresholds across all studied noise biases compared to standard MWPM. The gains are particularly pronounced for codes with asymmetric stabilizers tailored to dephasing-biased noise, showing that decoding strategies co-designed with bias-tailored codes can significantly enhance performance.", "motivation": "Many leading hardware platforms exhibit strong dephasing bias, motivating code families such as deformed surface and compass codes that exploit asymmetric noise statistics. Understanding how correlated decoders interact with these bias-tailored constructions at the circuit level is critical for maximizing thresholds and guiding decoder design for realistic quantum devices.", "highlights": [ "Circuit-level simulations compare standard and correlated MWPM for Clifford-deformed elongated compass codes under biased noise.", "Correlated MWPM systematically improves thresholds for all tested noise biases relative to standard MWPM.", "Relative threshold gains are largest for compass codes with asymmetric stabilizers specifically tuned to Pauli-$Z$-biased noise." ], "keywords": [ { "label": "Clifford-deformed-elongated-compass-codes", "reason": "Primary code family studied, combining elongated compass structure with single-qubit Clifford deformations for biased noise." }, { "label": "correlated-minimum-weight-perfect-matching", "reason": "Key technical tool that incorporates syndrome correlations into MWPM to improve decoding thresholds." }, { "label": "biased-Pauli-noise-models", "reason": "The simulations focus on dephasing-dominated noise, assessing performance as a function of bias strength." } ], "emoji": "⚖️", "social_summary": "Boost thresholds for bias-tailored compass codes by using correlated MWPM decoding that exploits circuit-level noise correlations under dephasing-biased noise.", "highlights_oneliner": "Correlated decoding boosts biased compass code thresholds." }, { "arxiv_id": "2605.28784", "title": "Complex abelian varieties and quantum error correction: a mathematical framework for GKP codes", "authors": "Maxence Mayrand, Baptiste Royer", "arxiv_url": "https://arxiv.org/abs/2605.28784", "pdf_url": "https://arxiv.org/pdf/2605.28784.pdf", "summary": "The authors develop a rigorous mathematical framework linking Gottesman–Kitaev–Preskill (GKP) codes to polarized complex abelian varieties via symplectically integral lattices. Under this dictionary, the finite-dimensional GKP code space is identified with the space of theta functions $H^{0}(X,L)$, logical Pauli operators arise from the theta group, passive logical Clifford gates correspond to automorphisms of the polarized variety, and concatenation with stabilizer codes corresponds to isogenies. They prove key results including asymptotic isometry of the encoding, that every logical Clifford gate is realized by a Gaussian unitary, and that for small-variance noise the leading-order failure probability is controlled by the shortest nontrivial displacement in the kernel of the polarization isogeny, a systolic invariant.", "motivation": "GKP bosonic codes are central to bosonic quantum error correction, yet their description has largely relied on heuristic physics arguments and lacked a unified mathematical language. By formulating GKP codes in terms of lattices, Heisenberg representations, theta functions, and complex abelian varieties, this work provides foundational structure and opens systematic avenues for optimizing code performance over moduli spaces.", "highlights": [ "Establishes a dictionary between GKP code structures and objects from the theory of polarized complex abelian varieties and theta functions.", "Proves that all logical Clifford operations of a GKP code can be implemented by Gaussian unitaries in the underlying continuous-variable system.", "Shows that for small-variance noise, failure probability is governed at leading order by a systolic invariant: the shortest nontrivial element in the kernel of the polarization isogeny." ], "keywords": [ { "label": "GKP-bosonic-codes", "reason": "Core subject, viewed as codes defined by symplectically integral lattices in phase space." }, { "label": "polarized-complex-abelian-varieties", "reason": "Provide the geometric setting where code spaces become spaces of theta functions and logical structures map to classical objects." }, { "label": "theta-group-and-theta-functions", "reason": "Mathematical machinery used to represent logical Pauli operations and the finite-dimensional code space $H^{0}(X,L)$." }, { "label": "polarization-isogeny-systoles", "reason": "Systolic invariants of the polarization isogeny determine leading-order failure probabilities for small-variance noise." } ], "emoji": "📐", "social_summary": "Recast GKP codes using complex abelian varieties and theta functions, proving Gaussian realizations of all logical Cliffords and identifying geometric invariants that control small-noise failure rates.", "highlights_oneliner": "Geometric abelian-variety foundation for GKP codes." }, { "arxiv_id": "2605.28536", "title": "Trapped-Ion Multiqubit Gates are Compatible with Scalable Quantum Error Correction", "authors": "Ori Grossman, Yotam Kadish, Snir Gazit, Amit Ben-Kish, Roee Ozeri, Yotam Shapira", "arxiv_url": "https://arxiv.org/abs/2605.28536", "pdf_url": "https://arxiv.org/pdf/2605.28536.pdf", "summary": "This paper builds a microscopic noise model for trapped-ion multiqubit (MQ) entangling gates with all-to-all connectivity, integrating out phonon modes to obtain effective Pauli channels from phonon heating, motional dephasing, and photon scattering. It finds that phonon heating predominantly induces local single-qubit errors, while motional dephasing produces both single- and long-range two-qubit errors whose strengths are much larger between qubits that share entangling interactions than between uncoupled pairs; photon-scattering-induced errors are confined to qubits directly involved in the MQ gate. Using these calibrated noise channels, the authors simulate rotated surface-code quantum error correction and demonstrate clear QEC gain and an experimentally relevant threshold transition under realistic MQ-gate error mechanisms, supporting the compatibility of MQ gates with scalable QEC.", "motivation": "Trapped ions naturally support high-fidelity all-to-all multiqubit gates, promising reduced circuit depth and direct implementation of high-weight stabilizers, but concerns remain about correlated error propagation. Connecting detailed device-level physics of MQ gates to surface-code logical performance is crucial to assess their viability for large-scale fault-tolerant architectures and to prioritize mitigation of dominant noise sources like motional dephasing.", "highlights": [ "Derives effective Pauli error channels for MQ gates by microscopically modeling phonon heating, motional dephasing, and photon scattering in trapped-ion systems.", "Shows that motional dephasing generates both local and arbitrary-range two-qubit errors but with much stronger rates between gate-coupled ions than uncoupled ions, while photon-scattering errors remain localized to participating qubits.", "Demonstrates via rotated surface-code simulations that realistic MQ-gate noise can still yield QEC gain and a clear threshold, indicating scalability of trapped-ion MQ architectures." ], "keywords": [ { "label": "trapped-ion-multiqubit-gates", "reason": "Primary physical primitive studied, enabling all-to-all entangling operations in ion chains." }, { "label": "microscopic-motional-noise-models", "reason": "Phonon heating and motional dephasing are modeled at the microscopic level and mapped to effective Pauli channels." }, { "label": "rotated-surface-code-performance", "reason": "Logical performance of the rotated surface code under the derived MQ error channels is analyzed to extract thresholds and QEC gain." } ], "emoji": "🎛️", "social_summary": "Connect microscopic noise in trapped-ion multiqubit gates to rotated surface-code performance, showing realistic MQ-gate errors still support a clear quantum error-correction threshold.", "highlights_oneliner": "Microscopic MQ-gate noise meets surface-code scalability." } ] }, "2026-05-27": { "word_cloud": [ { "word": "magic-state-distillation", "weight": 5 }, { "word": "logical-T-state", "weight": 5 }, { "word": "space-time-overhead", "weight": 4 }, { "word": "surface-code-architectures", "weight": 4 }, { "word": "code-switching", "weight": 4 }, { "word": "magic-state-cultivation", "weight": 5 }, { "word": "postselection-cost", "weight": 3 }, { "word": "error-budget", "weight": 3 }, { "word": "Shor-factoring", "weight": 3 }, { "word": "footprint", "weight": 3 }, { "word": "latency", "weight": 3 }, { "word": "logical-error-rate", "weight": 5 }, { "word": "resource-estimation", "weight": 4 }, { "word": "stabilizer-operations", "weight": 3 }, { "word": "state-injection", "weight": 3 }, { "word": "expected-cost", "weight": 4 }, { "word": "discard-rate", "weight": 3 }, { "word": "fault-tolerant-architecture", "weight": 4 }, { "word": "magic-state-supply-rate", "weight": 4 }, { "word": "data-extraction-protocol", "weight": 2 } ], "social_highlights": "Highlights: Compare resource costs of logical T-state preparation routes, map trade-offs in error, cost, and footprint, and link single-state overheads to full algorithmic workloads.", "papers": [ { "arxiv_id": "2605.26522", "title": "A Resource Comparison of Logical T-State Preparation", "authors": "Jianshuo Gao, Xiao Yuan, Yuan Yao", "arxiv_url": "https://arxiv.org/abs/2605.26522", "pdf_url": "https://arxiv.org/pdf/2605.26522.pdf", "summary": "This paper systematically compares resource requirements for preparing high-fidelity logical $\\lvert T \\rangle$ states via magic state distillation, magic state cultivation, and code switching, using a unified data-extraction and reporting framework across heterogeneous literature. It retains native cost units from source papers and reports output error, single-attempt cost, expected cost per accepted output, footprint, latency, and reporting completeness for each configuration. As a case study, it maps these preparation routes onto an error budget motivated by Shor's factoring algorithm to connect per-state preparation overheads to full workload demands.", "motivation": "High-fidelity logical $\\lvert T \\rangle$ states are a dominant non-Clifford resource bottleneck in large-scale fault-tolerant architectures, especially those based on surface-like stabilizer codes that natively implement Clifford gates. Historically, magic state distillation has been the workhorse for reaching very low logical error rates, but diverse code families, noise models, and cost conventions have obscured fair comparisons; this work provides a structured, apples-to-apples comparison to guide architectural design and algorithm-level resource estimation.", "highlights": [ "Unified comparison of distillation, cultivation, and code-switching routes for logical $\\lvert T \\rangle$ preparation", "Identification of current best regimes: distillation for lowest error, code switching for minimal single-attempt cost and footprint, RP2 cultivation for intermediate-error low-cost points", "Algorithm-level case study relating logical $\\lvert T \\rangle$ preparation costs to a Shor factoring error budget" ], "keywords": [ { "label": "magic state distillation", "reason": "Central baseline protocol converting many noisy $\\lvert T \\rangle$-like states into fewer high-fidelity logical $\\lvert T \\rangle$ outputs and achieving the lowest reported logical error rates in the comparison." }, { "label": "magic state cultivation", "reason": "Alternative preparation strategy, including recent $\\mathbb{RP}^2$-based schemes, that provides low-cost logical $\\lvert T \\rangle$ states at intermediate output error between $10^{-6}$ and $10^{-9}$." }, { "label": "code switching", "reason": "Preparation route that changes the underlying code family or gauge to realize logical $\\lvert T \\rangle$ with the lowest single-attempt cost and smallest explicit footprint among compatible configurations." }, { "label": "resource benchmarking framework", "reason": "The paper's main methodological contribution is a data-extraction and reporting framework that preserves native cost units while standardizing metrics like output error, expected cost, footprint, latency, and reporting completeness." } ], "emoji": "✨", "social_summary": "Compare how distillation, cultivation, and code switching trade error, cost, and footprint for logical T states, and see what that means for running algorithms like Shor factoring.", "highlights_oneliner": "Benchmarking logical $T$-state preparation routes" } ] }, "2026-05-26": { "word_cloud": [ { "word": "bias-preserving", "weight": 4 }, { "word": "surface-code-decoding", "weight": 4 }, { "word": "bosonic-modes", "weight": 5 }, { "word": "triorthogonal-matrices", "weight": 5 }, { "word": "LDGM-syndrome-codes", "weight": 5 }, { "word": "message-passing", "weight": 5 }, { "word": "homomorphic-encryption", "weight": 4 }, { "word": "magic-state-distillation", "weight": 4 }, { "word": "variational-ansatz", "weight": 3 }, { "word": "hardware-transpilation", "weight": 4 }, { "word": "quaternary-min-sum", "weight": 4 }, { "word": "thermal-noise", "weight": 3 }, { "word": "continuous-variable", "weight": 4 }, { "word": "stabilizer-measurement", "weight": 3 }, { "word": "syndrome-extraction", "weight": 4 }, { "word": "QND-measurement", "weight": 5 }, { "word": "angular-momentum-sensing", "weight": 3 }, { "word": "Calderbank-Shor-Steane", "weight": 3 }, { "word": "threshold-analysis", "weight": 4 }, { "word": "single-mode-bosonic-code", "weight": 4 } ], "social_highlights": "Highlights: QND multi-$Z$ measurements for biased noise, unify sensing and error correction, combine homomorphic encryption with stabilizer codes, construct high-distance triorthogonal codes, design LDGM-based syndrome extractors, study hardware-aware VQA expressibility, scale quaternary message-passing decoders, and suppress bosonic noise with hybrid rotations.", "papers": [ { "arxiv_id": "2605.24262", "title": "Quantum non-demolition measurements as a practical primitive for fault-tolerant computation against biased noise", "authors": "Christophe Vuillot, Diego Ruiz, Jérémie Guillaud, Mazyar Mirrahimi", "arxiv_url": "https://arxiv.org/abs/2605.24262", "pdf_url": "https://arxiv.org/pdf/2605.24262.pdf", "summary": "This paper proposes high-fidelity quantum non-demolition multi-qubit $Z$ measurements as a hardware-efficient primitive that can replace bias-preserving CNOT gates in fault-tolerant architectures with strong phase-flip bias. The authors compile repetition, XZZX surface, and LDPC code operations using weight-four QND $Z$ measurements, achieving a phase-flip threshold of $\\sim 1.25\\%$ for an asymmetric XZZX surface code and $\\sim 2.3\\%$ for a repetition code at large bias, with up to $6\\times$ qubit overhead reduction at noise bias $\\eta = 10^4$. They detail concrete implementations for solid-state nuclear spins with electron ancillas and dissipatively stabilized superconducting cat qubits, showing that QND multi-$Z$ measurements provide a practical route to bias-tailored fault tolerance without bias-preserving two-qubit gates.", "motivation": "Bias-tailored quantum error correction has long promised large overhead reductions by exploiting dominant dephasing, but depended critically on bias-preserving CNOT gates that are difficult or impossible in strictly $2$D layouts. Providing an experimentally accessible alternative primitive that preserves noise bias and supports high-threshold codes directly impacts the feasibility of scalable quantum processors in realistic biased-noise platforms.", "highlights": [ "Introduce QND multi-qubit $Z$ measurements as a bias-preserving primitive replacing CNOTs", "Demonstrate asymmetric XZZX surface code with $\\sim 1.25\\%$ phase-flip threshold and $6\\times$ overhead reduction at $\\eta=10^4$", "Show repetition codes with QND $Z$ reach $\\sim 2.3\\%$ threshold and overhead comparable to bias-preserving CNOT schemes" ], "keywords": [ { "label": "QND multi-$Z$ measurement", "reason": "Central primitive enabling bias-preserving stabilizer readout without CNOT gates." }, { "label": "asymmetric XZZX surface code", "reason": "Primary code family used to exploit phase-flip bias with the proposed measurement primitive." }, { "label": "biased dephasing noise", "reason": "Noise regime where phase-flip errors dominate and where the scheme achieves large overhead reductions." }, { "label": "dissipative cat qubits", "reason": "One of the key hardware platforms proposed for implementing high-fidelity QND measurements." } ], "emoji": "⚖️", "social_summary": "Leverage QND multi-qubit Z measurements to replace bias-preserving CNOTs, slashing qubit overhead and boosting thresholds for biased-noise surface and repetition codes.", "highlights_oneliner": "QND multi-$Z$ primitives for biased-noise fault tolerance" }, { "arxiv_id": "2605.24120", "title": "Quantum Sensing and Quantum Error Correction: Two Sides of the Same Coin", "authors": "Zhuoran Bao, Daniel F. V. James", "arxiv_url": "https://arxiv.org/abs/2605.24120", "pdf_url": "https://arxiv.org/pdf/2605.24120.pdf", "summary": "This work formalizes a connection between a quantum code's error-correcting capability and its utility as a sensor, relating code structure to metrological sensitivity. Using the absorption-emission code as an example, the authors map it to optimal sensor states for arbitrary state rotations and analyze expectation values of angular-momentum tensor operators via the Wigner-Eckart theorem under constraints on magnetic quantum number support. The results suggest a pathway to a unified theory where quantum error-correcting codes can be systematically repurposed as high-performance sensing states.", "motivation": "Quantum metrology and quantum error correction have traditionally developed separately, despite both relying on structured entangled states and rigorous performance bounds. Revealing a direct quantitative relationship between correctability and sensitivity could let insights from coding theory drive the design of optimal quantum sensors and, conversely, inform robust metrological schemes.", "highlights": [ "Relate a code’s error-correcting capacity to its performance as a quantum sensor", "Show absorption-emission code realizes sensor states for arbitrary rotations", "Use Wigner-Eckart analysis of angular-momentum tensors under constrained $m$-space support" ], "keywords": [ { "label": "absorption-emission code", "reason": "Serves as the concrete code example mapped to optimal rotation-sensing states." }, { "label": "quantum metrology", "reason": "Target application domain where code states are used as high-sensitivity probes." }, { "label": "angular-momentum tensor operators", "reason": "Mathematical tools used to compute sensitivities and expectation values of the sensor states." }, { "label": "Wigner-Eckart theorem", "reason": "Key technique enabling simplified calculation of matrix elements in the sensing–code connection." } ], "emoji": "🎯", "social_summary": "Unify quantum sensing and error correction by showing how code states, like the absorption-emission code, double as optimal sensors for arbitrary rotations.", "highlights_oneliner": "Linking code correctability with sensing power" }, { "arxiv_id": "2605.25692", "title": "Homomorphic Quantum Error Correction", "authors": "Kornikar Sen, Miguel A. Martin-Delgado", "arxiv_url": "https://arxiv.org/abs/2605.25692", "pdf_url": "https://arxiv.org/pdf/2605.25692.pdf", "summary": "This paper studies the algebraic compatibility between quantum homomorphic encryption and stabilizer codes, deriving necessary and sufficient conditions for an $[[n,1,d]]$ code to remain invariant under restricted transversal block-Pauli masking $U_{\\rm enc}(a,b)=(X^aZ^b)^{\\otimes n}$. The authors verify these conditions for canonical codes such as bit-flip, phase-flip repetition, and Shor codes, give a practical criterion for CSS codes, and extend the analysis to $3$D color codes. To address the challenge of implementing non-Clifford gates homomorphically, they propose using suitable triorthogonal codes for transversal $T$-type gates and introduce logical-gate masking to ensure code-space preservation for arbitrary stabilizer codes, laying groundwork for secure, error-corrected cloud quantum computing.", "motivation": "As cloud quantum services proliferate, jointly guaranteeing data privacy and robustness to noise becomes central for practical remote quantum computing. Understanding how encryption layers interact with error-correcting codes clarifies which architectures can support homomorphic processing without leaving the protected code space, a prerequisite for scalable secure quantum computation.", "highlights": [ "Derive necessary and sufficient conditions for stabilizer codes compatible with block-Pauli masking", "Provide compatibility criteria for CSS and $3$D color codes under homomorphic encryption", "Resolve non-Clifford implementation issues via triorthogonal codes and logical-gate masking" ], "keywords": [ { "label": "quantum homomorphic encryption", "reason": "Core cryptographic primitive whose compatibility with error correction is analyzed." }, { "label": "block-Pauli masking", "reason": "Specific transversal masking operation used to encrypt encoded states while preserving the code space." }, { "label": "Shor code", "reason": "Key example used to illustrate both compatibility and challenges with logical $T$-gate implementation." }, { "label": "triorthogonal codes", "reason": "Proposed solution enabling transversal $T$-type gates in the homomorphic, error-corrected setting." } ], "emoji": "🔐", "social_summary": "Combine homomorphic encryption with stabilizer codes by characterizing when block-Pauli masking preserves code spaces and how to implement logical non-Clifford gates securely.", "highlights_oneliner": "Conditions for homomorphic-compatible stabilizer codes" }, { "arxiv_id": "2605.24519", "title": "On Constructing and Decoding Quantum Triorthogonal Codes", "authors": "Alessio Baldelli, Olai Å. Mostad, Hsuan-Yin Lin, Eirik Rosnes, Massimo Battaglioni", "arxiv_url": "https://arxiv.org/abs/2605.24519", "pdf_url": "https://arxiv.org/pdf/2605.24519.pdf", "summary": "The authors analyze triorthogonal CSS codes defined by triorthogonal matrices and derive an existence criterion for even-weight generator matrices achieving a target dual minimum distance. By combining triorthogonality constraints with MacWilliams identities and Krawtchouk-polynomial conditions on the dual weight distribution, they formulate an integer linear program that yields new nontrivial triorthogonal codes not restricted to classical triply-even constructions. They further evaluate decoding of high-distance triorthogonal codes built via the doubling construction over a dephasing channel, comparing bounded-distance, belief propagation with ordered-statistics post-processing, and a GRAND-inspired decoder adapted to the quantum regime.", "motivation": "Triorthogonal codes underpin many leading magic-state distillation protocols by enabling transversal $T$ gates, but constructing high-quality instances with desired distance properties is nontrivial. Providing systematic construction criteria and benchmarking advanced decoders helps optimize resource-efficient fault-tolerant architectures that rely heavily on distillation factories.", "highlights": [ "Derive ILP-based existence criterion for even-weight triorthogonal generators with prescribed dual distance", "Discover new triorthogonal codes beyond triply-even classical constructions", "Benchmark multiple decoders, including a GRAND-style scheme, for high-distance triorthogonal codes on dephasing noise" ], "keywords": [ { "label": "triorthogonal matrices", "reason": "Fundamental algebraic objects defining the studied class of CSS codes with transversal $T$ gates." }, { "label": "MacWilliams identities", "reason": "Used to relate primal and dual weight distributions in the existence criterion." }, { "label": "Krawtchouk polynomials", "reason": "Provide polynomial constraints in the ILP formulation for dual distance control." }, { "label": "GRAND-based decoder", "reason": "Novelly adapted classical decoding technique evaluated for quantum triorthogonal codes." } ], "emoji": "✨", "social_summary": "Build and decode stronger triorthogonal codes using ILP-based existence conditions and advanced decoders, enabling more efficient magic-state distillation.", "highlights_oneliner": "Systematic construction and decoding of triorthogonal codes" }, { "arxiv_id": "2605.25317", "title": "Fault-Tolerant QLDPC Syndrome Measurement via LDGM Encoding", "authors": "Eren Guttentag, Anthony Gómez-Fonseca", "arxiv_url": "https://arxiv.org/abs/2605.25317", "pdf_url": "https://arxiv.org/pdf/2605.25317.pdf", "summary": "This paper proposes using tailored low-density generator-matrix (LDGM) codes as syndrome measurement codes for QLDPC stabilizer codes, constructed via a progressive-edge-growth-like algorithm that enforces low column and row weights. The resulting overdetermined set of stabilizers yields constant-weight measured operators, preserving the low-weight structure of the underlying QLDPC code while enabling higher effective distance and fewer total syndrome measurements compared to simple repetition of checks. Implemented on a distance-$5$ rotated surface code, the scheme reduces logical error probability and measurement count, and supports confinement-like properties that can preserve single-shot behavior without introducing high-weight stabilizers.", "motivation": "Fault-tolerant syndrome extraction is a major bottleneck for QLDPC codes, where repeated measurement increases depth and error accumulation, yet high-weight checks risk catastrophic error spreading. LDGM-based measurement codes offer a classical-coding-inspired way to gain redundancy and robustness while keeping stabilizer weights low, improving practical realizations of sparse quantum codes.", "highlights": [ "Design LDGM-based syndrome measurement codes with bounded stabilizer weights via PEG-like construction", "Demonstrate reduced logical error and fewer measurements on a distance-$5$ rotated surface code", "Show that weight-confinement preserves low-weight checks and supports potential single-shot properties" ], "keywords": [ { "label": "LDGM syndrome measurement codes", "reason": "Central classical-code-based construction used for redundant, low-weight stabilizer measurements." }, { "label": "QLDPC stabilizer structure", "reason": "Target quantum code family whose low-weight checks are preserved by the method." }, { "label": "progressive edge-growth algorithm", "reason": "Graph construction heuristic adapted to design LDGM codes with desired weight profiles." }, { "label": "single-shot confinement", "reason": "Conceptual property motivating the approach’s control over error spread during syndrome extraction." } ], "emoji": "🧮", "social_summary": "Use LDGM-based syndrome measurement codes to cut measurement rounds and logical errors for QLDPC and surface codes while preserving low stabilizer weights.", "highlights_oneliner": "LDGM-based low-weight syndrome extraction for QLDPC" }, { "arxiv_id": "2605.25552", "title": "Beyond Logical Circuits: Hardware-Aware Analysis of Expressibility and Trainability in Variational Quantum Algorithms", "authors": "Muhammad Kashif, Muhammad Shafique", "arxiv_url": "https://arxiv.org/abs/2605.25552", "pdf_url": "https://arxiv.org/pdf/2605.25552.pdf", "summary": "The authors conduct a systematic comparison of parameterized quantum circuits at the logical design level and after hardware-aware transpilation, quantifying changes in expressibility using fidelity-based KL divergence and in trainability via gradient variance. They show that transpilation, through qubit mapping, routing, and basis decomposition, acts as a structural perturbation that can alter expressibility by up to $125\\%$ and trainability by up to $25\\%$, in an ansatz-dependent fashion. The study reveals that structured ansatzes are more robust while highly entangled architectures are sensitive, and that transpilation can disrupt the conventional expressibility–trainability trade-off, indicating that logical-level analyses may mispredict hardware performance.", "motivation": "VQAs are central to NISQ-era applications, yet most analyses of barren plateaus and circuit power ignore realistic compilation steps required by hardware constraints. Understanding how transpilation reshapes circuit landscapes helps practitioners design ansatzes and workflows whose theoretical guarantees survive deployment on actual devices.", "highlights": [ "Quantify expressibility and trainability shifts between logical and transpiled PQCs", "Show transpilation can cause up to $125\\%$ expressibility and $25\\%$ trainability variation", "Demonstrate that hardware-aware effects can break the usual expressibility–trainability trade-off" ], "keywords": [ { "label": "expressibility KL divergence", "reason": "Primary metric used to quantify how well PQCs approximate Haar-random states." }, { "label": "gradient-variance trainability", "reason": "Statistic used to assess optimization difficulty and barren plateau behavior." }, { "label": "hardware-aware transpilation", "reason": "Key process whose impact on PQC structure and performance is systematically studied." }, { "label": "structured vs entangling ansatz", "reason": "Circuit families whose differing robustness to transpilation is a main comparative result." } ], "emoji": "🧠", "social_summary": "Reveal how hardware transpilation reshapes VQA expressibility and trainability, showing logical-level analyses can mislead and that structured ansatzes are more robust than highly entangled ones.", "highlights_oneliner": "Hardware-aware expressibility and trainability of VQAs" }, { "arxiv_id": "2605.24177", "title": "Towards Scalable Quaternary Message-Passing Decoding for Quantum Error Correction", "authors": "Boqing Zhang, Henry D. Pfister, Hanwen Yao, Siyuan Niu", "arxiv_url": "https://arxiv.org/abs/2605.24177", "pdf_url": "https://arxiv.org/pdf/2605.24177.pdf", "summary": "This work develops a more principled quaternary message-passing framework for decoding quantum stabilizer codes, introducing a dilution method that modifies the factor graph to improve scalability and interpretability. Under dilution, a quaternary Min-Sum decoder achieves an apparent depolarizing threshold of $16\\%$ up to distance $20$ for surface codes and, for pure $X$-noise, attains worst-case complexity $\\mathcal{O}(N \\log^2 d)$ while outperforming BP-OSD at $d=65$. A graph-dilution argument is given to explain when message-passing algorithms can genuinely scale, connecting empirical performance to structural properties of the decoding graph.", "motivation": "Belief-propagation-style decoders are attractive for large QLDPC and surface codes, but their finite-length performance and theoretical underpinnings have lagged behind matching-based methods. Establishing scalable, interpretable MP decoders with competitive thresholds is key to leveraging sparse graph structures for next-generation quantum decoders.", "highlights": [ "Introduce dilution-based quaternary Min-Sum decoding with improved scalability", "Achieve $\\sim 16\\%$ depolarizing and $\\sim 9\\%$ $X$-noise thresholds competitive with MWPM", "Provide graph-dilution arguments clarifying when MP decoders can scale effectively" ], "keywords": [ { "label": "quaternary Min-Sum decoder", "reason": "Central message-passing algorithm enhanced through the proposed dilution method." }, { "label": "decoder graph dilution", "reason": "Structural modification of the Tanner graph that yields improved thresholds and complexity." }, { "label": "surface-code depolarizing threshold", "reason": "Benchmark metric where the diluted decoder reaches about $16\\%$ up to moderate distances." }, { "label": "BP-OSD comparison", "reason": "Reference classical-inspired decoder against which scalability and performance are evaluated." } ], "emoji": "📡", "social_summary": "Advance scalable quaternary message-passing decoders using graph dilution to reach high surface-code thresholds and competitive complexity versus matching-based and BP-OSD decoders.", "highlights_oneliner": "Diluted quaternary MP decoding for scalable QEC" }, { "arxiv_id": "2605.24540", "title": "Code-agnostic bosonic noise suppression with hybrid rotations", "authors": "Saurabh U. Shringarpure, Siheon Park, Sungjoo Cho, Yong Siah Teo, Hyukjoon Kwon, Srikrishna Omkar, Hyunseok Jeong", "arxiv_url": "https://arxiv.org/abs/2605.24540", "pdf_url": "https://arxiv.org/pdf/2605.24540.pdf", "summary": "The authors propose a hybrid CV-DV interferometric protocol that suppresses noise on any single-mode bosonic encoding by inserting a noise channel between two controlled-Fourier gates acting with a qubit ancilla, converting linear noise scaling in loss rate $\\mu$ and amplification $G$ into quadratic while maintaining success probability $\\geq 0.5$ for $\\mu G \\leq 0.5$. With multiple ancillas, the scheme transforms photon loss into coherent Fock damping and general thermal or displacement noise into mixtures of Fock-diagonal channels, all without active error correction or destructive measurements on the encoded mode. The protocol is code-agnostic, simplifies to conventional error detection for $2^K$-fold rotation-symmetric bosonic codes with $K$ ancillas, and extends to qutrit ancillas to simultaneously mitigate CV noise and discrete-variable damping, offering hardware-efficient suppression for traveling qumodes.", "motivation": "Traveling bosonic modes are essential carriers for distributed quantum networks but suffer from loss and thermal noise that dramatically increase the cost of downstream error correction. A physically lightweight, code-agnostic suppression layer that operates at the channel level can significantly lower resource overheads and broaden the practicality of bosonic encodings in hybrid CV-DV architectures.", "highlights": [ "Introduce hybrid CV-DV interferometer with controlled-Fourier gates to quadratically suppress bosonic noise", "Show high success probability ($\\geq 0.5$) for $\\mu G \\leq 0.5$ and code-agnostic applicability", "Extend to multi-ancilla and qutrit schemes that convert loss and thermal noise into Fock-diagonal forms" ], "keywords": [ { "label": "controlled-Fourier gates", "reason": "Key hybrid CV-DV interaction enabling noise cancellation around the bosonic channel." }, { "label": "traveling bosonic qumodes", "reason": "Primary physical systems targeted for noise suppression in distributed architectures." }, { "label": "rotation-symmetric bosonic codes", "reason": "Special code family where the protocol reduces to conventional error detection with multiple ancillas." }, { "label": "Fock-diagonal noise engineering", "reason": "Mechanism by which general noise is converted into more tractable diagonal channels using ancillas." } ], "emoji": "📡", "social_summary": "Suppress noise on traveling bosonic modes using hybrid CV-DV rotations that are code-agnostic, high-success, and extendable to multi-ancilla and qutrit schemes.", "highlights_oneliner": "Hybrid CV-DV rotations for bosonic noise suppression" } ] }, "2026-05-25": { "word_cloud": [ { "word": "finite-field", "weight": 5 }, { "word": "CSS orthogonality", "weight": 5 }, { "word": "cyclic lift", "weight": 5 }, { "word": "Pauli rotations", "weight": 4 }, { "word": "parallelization", "weight": 4 }, { "word": "swap test", "weight": 4 }, { "word": "metrology", "weight": 4 }, { "word": "entanglement-assisted", "weight": 5 }, { "word": "noisy ebits", "weight": 5 }, { "word": "symplectic geometry", "weight": 4 }, { "word": "repeater networks", "weight": 4 }, { "word": "correctable subspace", "weight": 5 }, { "word": "girth", "weight": 4 }, { "word": "belief propagation", "weight": 4 }, { "word": "dephasing", "weight": 3 }, { "word": "additive codes", "weight": 4 }, { "word": "low-density parity-check", "weight": 4 }, { "word": "hardware-limited depth", "weight": 3 } ], "social_highlights": "Highlights: finite-field CSS $LDPC$ bases with liftable distance guarantees, port-aware parallel scheduling for commuting $PPR$s, swap-test mitigation for indistinguishable metrology noise, generalized $EAQECC$s with noisy ebits, entanglement-distribution limits tied to correctable subspaces", "papers": [ { "arxiv_id": "2605.23894", "title": "A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases", "authors": "Koki Okada, Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2605.23894", "pdf_url": "https://arxiv.org/pdf/2605.23894.pdf", "summary": "The paper introduces a two-branch multiplicative-coset construction for regular CSS $LDPC$ base matrices, reducing regularity, CSS orthogonality, and same-type $4$-cycle exclusion to explicit quotient-coset conditions over a finite field. A normalized exhaustive search finds bases for multiple $(J,L)$ pairs, and a two-stage design then combines a base matrix with a cyclic lift to enforce finite-length structure; the worked $(3,10)$ example yields a $[[10240,4108,10\\le d\\le 32]]$ CSS code with same-type Tanner-graph girth at least $8$.", "motivation": "Regular CSS $LDPC$ codes are attractive because sparse structure supports efficient decoding, but finite-length design must control degree distribution, short cycles, and deterministic low-weight failures simultaneously. This work matters because it gives an algebraic, searchable recipe that separates base design from lift design, making structured code construction more systematic and extensible.", "highlights": [ "Two-branch coset conditions enforce regular CSS structure", "$(3,10)$ base lifted to a $[[10240,4108,10\\le d\\le 32]]$ code", "Joint $BP$ plus deterministic post-processing reaches FER $1.0\\times10^{-7}$ at $p=0.058$" ], "keywords": [ { "label": "finite-field coset construction", "reason": "Central design mechanism that turns regularity and orthogonality into explicit algebraic checks." }, { "label": "CSS $LDPC$ base matrices", "reason": "Primary code object built by the paper for regular quantum low-density parity-check designs." }, { "label": "cyclic lift", "reason": "Second-stage finite-length randomization used to suppress harmful short-cycle structure." }, { "label": "same-type $4$-cycle exclusion", "reason": "Key structural constraint needed for improved Tanner-graph properties." } ], "emoji": "🧮", "social_summary": "Builds structured CSS $LDPC$ bases from finite-field cosets and shows a lifted $[[10240,4108,10\\le d\\le 32]]$ example with strong decoding performance.", "highlights_oneliner": "Finite-field CSS $LDPC$ bases" }, { "arxiv_id": "2605.23738", "title": "Optimizing Parallel Execution of Commuting Pauli Product Rotations", "authors": "Sayam Sethi, Devika Nambisan, Jonathan Mark Baker", "arxiv_url": "https://arxiv.org/abs/2605.23738", "pdf_url": "https://arxiv.org/pdf/2605.23738.pdf", "summary": "The paper studies how to execute commuting Pauli Product Rotations ($PPR$s) in parallel under per-qubit access-point constraints that force large commuting groups to be split, increasing depth. It proposes two heuristics: clique reshuffling, which reorders commuting products into port-feasible groups, and generator restructuring, which rewrites a group into an equivalent generating set with lower per-qubit port pressure; together they reduce hardware-limited depth by about $10$–$20\\%$ on average and up to $50\\%$ on QASMBench circuits.", "motivation": "As error-corrected quantum processors become more realistic, logical compilation must adapt to hardware limits that are different from conventional gate-count or connectivity constraints. This work matters because port-limited parallelism is a concrete bottleneck in fault-tolerant execution, especially for architectures such as the surface code with restricted access points.", "highlights": [ "Clique reshuffling reduces port pressure in commuting groups", "Generator restructuring preserves action while lowering access demand", "Combined heuristic cuts hardware-limited depth by up to $50\\%$" ], "keywords": [ { "label": "Pauli Product Rotations", "reason": "The circuit primitive whose parallel execution the paper optimizes." }, { "label": "port-constrained scheduling", "reason": "Core hardware model limiting how many operations can touch each qubit." }, { "label": "clique reshuffling", "reason": "One of the two proposed heuristics for re-grouping commuting rotations." }, { "label": "generator restructuring", "reason": "Second heuristic that rewrites groups into lower-pressure generating sets." } ], "emoji": "⚙️", "social_summary": "Optimizes parallel commuting $PPR$ execution with port-aware heuristics that cut hardware-limited depth by up to $50\\%$.", "highlights_oneliner": "Port-aware parallel $PPR$ execution" }, { "arxiv_id": "2605.23792", "title": "Complementing Quantum Error Correction in Quantum Metrology via Swap Test", "authors": "Xiaodie Lin, Linxuan Li, Haidong Yuan", "arxiv_url": "https://arxiv.org/abs/2605.23792", "pdf_url": "https://arxiv.org/pdf/2605.23792.pdf", "summary": "The paper targets indistinguishable noise in quantum metrology, where standard $QEC$ cannot help because the noise is signal-like. It proposes a swap test-based method that complements $QEC$, derives error-scaling behavior under dephasing and IIDP noise, and shows through simulations that it outperforms virtual state purification in both single- and multi-parameter estimation tasks.", "motivation": "Quantum metrology seeks precision beyond classical limits, but noise and decoherence often destroy the advantage. The work matters because it addresses the Hamiltonian-not-in-Lindblad-span barrier, a known obstruction to using conventional error correction when the noise is indistinguishable from the signal.", "highlights": [ "Swap test targets indistinguishable metrology noise", "Error-scaling analysis covers dephasing and IIDP models", "Outperforms virtual state purification in simulations" ], "keywords": [ { "label": "swap test", "reason": "The central mitigation primitive introduced for indistinguishable noise." }, { "label": "virtual state purification", "reason": "Baseline method the paper improves upon in noisy metrology settings." }, { "label": "indistinguishable noise", "reason": "The key noise regime where conventional $QEC$ is ineffective." }, { "label": "single- and multi-parameter estimation", "reason": "Application settings used to demonstrate the method's advantage." } ], "emoji": "🔬", "social_summary": "Uses a swap test to suppress indistinguishable metrology noise and improves precision beyond virtual state purification.", "highlights_oneliner": "Swap-test metrology mitigation" }, { "arxiv_id": "2605.23119", "title": "Construction of EAQECCs with imperfect ebits", "authors": "Guanmin Guo, Ruihu Li", "arxiv_url": "https://arxiv.org/abs/2605.23119", "pdf_url": "https://arxiv.org/pdf/2605.23119.pdf", "summary": "The paper generalizes the stabilizer formalism for entanglement-assisted quantum error-correcting codes with noisy ebits ($EAQECC$s-Ne) from the binary case to general $q$-ary systems with $q$ a prime power. Using generalized Pauli groups, symplectic geometry over $\\mathbb{F}_q^{2n}$, and additive codes, it derives a unified construction framework and exhibits explicit families that can outperform optimal standard stabilizer codes when ebit noise is sufficiently small.", "motivation": "Entanglement assistance already relaxes the dual-containing constraint that limits many standard stabilizer-code constructions, but earlier work often assumed the shared entanglement was perfect. This work matters because realistic shared entanglement is noisy, and a general finite-field framework is needed for qudit communication and fault-tolerant architectures.", "highlights": [ "Generalizes noisy-ebit stabilizer theory to $q$-ary systems", "Connects symplectic geometry and additive-code formulations", "Some $EAQECC$s-Ne beat optimal stabilizer codes at low ebit noise" ], "keywords": [ { "label": "$EAQECC$s-Ne", "reason": "The code family studied throughout the paper." }, { "label": "symplectic geometry over $\\mathbb{F}_q$", "reason": "Main mathematical framework used to formulate the construction." }, { "label": "additive codes over $\\mathbb{F}_q^{2n}$", "reason": "Equivalent algebraic representation of the noisy-ebit codes." }, { "label": "noisy ebits", "reason": "The practical imperfection modeled on the shared entanglement resource." } ], "emoji": "🔗", "social_summary": "Extends entanglement-assisted coding to noisy ebits over $\\mathbb{F}_q$ and finds constructions that can beat standard stabilizer codes.", "highlights_oneliner": "Noisy-ebit entanglement-assisted codes" }, { "arxiv_id": "2605.23443", "title": "Asymptotic Limits of Entanglement Distribution", "authors": "Piotr Masajada, Aby Philip, Alexander Streltsov", "arxiv_url": "https://arxiv.org/abs/2605.23443", "pdf_url": "https://arxiv.org/pdf/2605.23443.pdf", "summary": "The paper characterizes asymptotic entanglement distribution over quantum networks with repeaters and LOCC, proving a strict dichotomy: indefinite long-distance preservation is possible if and only if the channel has a correctable subspace. For channels without such a subspace, transmitted states converge exponentially fast to separable states, and sustaining nonzero entanglement with parallel channel uses requires the number of links per segment to scale at least logarithmically with the number of intermediate stations.", "motivation": "Entanglement distribution is a foundational task for quantum networking, but noise accumulation imposes hard limits on how far entanglement can travel. This work matters because it identifies a sharp structural condition on the channel and turns network design into a resource-scaling problem that directly informs repeater architecture.", "highlights": [ "Correctable subspace is necessary and sufficient for asymptotic preservation", "Without it, entanglement decays exponentially toward separability", "Parallel uses per link must scale at least logarithmically in network size" ], "keywords": [ { "label": "correctable subspace", "reason": "The structural channel property that determines whether entanglement can survive asymptotically." }, { "label": "entanglement distribution", "reason": "The network-level task whose limits are analyzed." }, { "label": "quantum repeaters", "reason": "The intermediate-station architecture considered for long-distance transmission." }, { "label": "logarithmic resource scaling", "reason": "The lower bound on parallel channel uses needed to maintain entanglement." } ], "emoji": "🔗", "social_summary": "Derives sharp asymptotic limits for entanglement distribution and links long-distance survival to correctable subspaces and resource scaling.", "highlights_oneliner": "Asymptotic entanglement limits" } ] }, "2026-05-22": { "word_cloud": [ { "word": "Galois qudits", "weight": 5 }, { "word": "Reed-Solomon", "weight": 5 }, { "word": "magic state", "weight": 5 }, { "word": "lattice surgery", "weight": 4 }, { "word": "code surgery", "weight": 5 }, { "word": "permutation-invariant", "weight": 4 }, { "word": "symmetric subspace", "weight": 4 }, { "word": "mutual information", "weight": 4 }, { "word": "topological order", "weight": 4 }, { "word": "list decoding", "weight": 5 }, { "word": "adaptive teleportation", "weight": 4 }, { "word": "surface code", "weight": 3 }, { "word": "$CCZ$ distillation", "weight": 5 }, { "word": "ancilla qubits", "weight": 3 }, { "word": "modular transformations", "weight": 3 }, { "word": "high-rate codes", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "nonstabilizerness", "weight": 4 } ], "social_highlights": "Highlights: concatenates algebraic outer codes over high-rate quantum $LDPC$ blocks with Galois qudits, proposes zero-level $CCZ$ distillation on a $2$D lattice, compiles resource-efficient code surgery for arbitrary stabilizer codes, constructs minimal permutation-invariant qudit codes from complete-graph colorings, and diagnoses long-range nonstabilizerness via mutual information in topological states.", "papers": [ { "arxiv_id": "2605.21898", "title": "Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes", "authors": "Adam Wills, Michael E. Beverland, Lev S. Bishop, Jay M. Gambetta, Patrick Rall, Vikesh Siddhu, Andrew W. Cross", "arxiv_url": "https://arxiv.org/abs/2605.21898", "pdf_url": "https://arxiv.org/pdf/2605.21898.pdf", "summary": "This work studies concatenation schemes where a high-rate inner code supplies nonlocal connectivity to an outer algebraic code, rather than relying on hardware links. The authors recast each block as a logical Galois qudit, enabling quantum Reed-Solomon outer codes together with list decoding and fault-tolerant syndrome extraction via a Galois-qudit Shor scheme. They report that at uniform $10^{-3}$ physical noise the concatenated gross code reaches the teraquop regime with lower space overhead than the $288$-qubit two-gross code.", "motivation": "Concatenation is a standard route to trading hardware locality for stronger protection, but most prior work focused on low-rate inner codes such as the surface code. High-rate quantum $LDPC$ architectures introduce correlated block-level errors, so new decoding and fault-tolerance tools are needed to make them practical.", "highlights": [ "Introduces Galois-qudit blocks for high-rate inner codes", "Uses quantum Reed-Solomon outer codes with list decoding", "Reaches the teraquop regime at $10^{-3}$ noise with reduced overhead" ], "keywords": [ { "label": "Galois qudits", "reason": "Core abstraction that treats each high-rate codeblock as a single large-alphabet logical unit." }, { "label": "quantum Reed-Solomon codes", "reason": "Main outer-code family used to supply algebraic distance and list-decoding structure." }, { "label": "list decoding", "reason": "Enables correction despite correlated inner-block errors and improves decoding robustness." }, { "label": "teraquop regime", "reason": "Target performance milestone demonstrating practical-scale logical reliability." } ], "emoji": "🧮", "social_summary": "Invents a qudit-based concatenation framework that pushes high-rate quantum $LDPC$ architectures into the teraquop regime with lower overhead.", "highlights_oneliner": "Galois-qudit concatenation breakthrough" }, { "arxiv_id": "2605.21867", "title": "Zero-level $CCZ$ Distillation", "authors": "Tomohiro Itogawa, Yutaka Hirano, Yutaro Akahoshi, Keisuke Fujii", "arxiv_url": "https://arxiv.org/abs/2605.21867", "pdf_url": "https://arxiv.org/pdf/2605.21867.pdf", "summary": "The paper proposes a zero-level distillation protocol that generates a high-fidelity logical $CCZ$ magic state using only physical qubits on a nearest-neighbor square lattice. It exploits the transversal $T/T^\\dagger$ action of the $[[8,3,2]]$ code to encode $\\overline{CCZ}|+++\\rangle$, then teleports the state into three surface-code logical qubits using lattice surgery and adaptively initialized teleportation. Simulations show logical error scaling of $p_L \\simeq 300\\,p^2$ and a space-time overhead reduction by roughly a factor of $5$-$10$.", "motivation": "Non-Clifford resources are a central bottleneck in fault-tolerant quantum computation because conventional magic-state distillation consumes many logical qubits and deep circuits. A low-level physical distillation route matters because it can reduce the overhead needed before large-scale logical hardware is available.", "highlights": [ "Implements logical $CCZ$ distillation at the physical level", "Uses the $[[8,3,2]]$ code plus adaptive teleportation", "Cuts space-time overhead by about $5$-$10$ times" ], "keywords": [ { "label": "$CCZ$ magic state", "reason": "Target non-Clifford resource being distilled for fault-tolerant computation." }, { "label": "$[[8,3,2]]$ code", "reason": "Transversal-code ingredient that enables the zero-level encoding step." }, { "label": "adaptive initialized teleportation", "reason": "Custom transfer method between codes of different distances." }, { "label": "lattice surgery", "reason": "Nearest-neighbor mechanism used to move the distilled state into surface-code qubits." } ], "emoji": "✨", "social_summary": "Builds a low-overhead physical protocol to distill high-fidelity $CCZ$ resources directly on a square lattice.", "highlights_oneliner": "Zero-level $CCZ$ distillation" }, { "arxiv_id": "2605.21746", "title": "GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Stabilizer Codes", "authors": "Junyu Zhou, Ali Javadi-Abhari, Gushu Li", "arxiv_url": "https://arxiv.org/abs/2605.21746", "pdf_url": "https://arxiv.org/pdf/2605.21746.pdf", "summary": "GeneCS is a compiler that synthesizes code-surgery protocols for arbitrary stabilizer codes using structure-aware graph optimization. It reduces redundancy, balances expansion against congestion, and respects code-degree constraints, yielding more than $85\\%$ average reductions in ancilla qubits and checks while preserving logical error rates. The method scales to codes with more than $10^4$ qubits with amortized compilation time of about one second per instance.", "motivation": "Logical operations on general stabilizer codes remain hard to realize efficiently, and most existing code-surgery constructions are theoretically sound but expensive in ancillas. Better synthesis tools matter for deploying heterogeneous architectures and modern $QLDPC$ codes in practical fault-tolerant stacks.", "highlights": [ "Compiles code surgery for arbitrary stabilizer codes", "Cuts ancilla qubits and checks by over $85\\%$ on average", "Scales to more than $10^4$ qubits with one-second compilation" ], "keywords": [ { "label": "code surgery", "reason": "The logical-operation framework being synthesized and optimized by the compiler." }, { "label": "ancilla overhead", "reason": "Primary resource cost that GeneCS substantially reduces." }, { "label": "graph representation", "reason": "Structural model used to optimize surgery protocols algorithmically." }, { "label": "$QLDPC$ codes", "reason": "Important target class that benefits from practical surgery synthesis." } ], "emoji": "🧩", "social_summary": "Compiles efficient code-surgery protocols that slash ancilla overhead and scale to very large stabilizer codes.", "highlights_oneliner": "Compiler for lean code surgery" }, { "arxiv_id": "2605.22439", "title": "Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs", "authors": "Eric Kubischta, Ian Teixeira", "arxiv_url": "https://arxiv.org/abs/2605.22439", "pdf_url": "https://arxiv.org/pdf/2605.22439.pdf", "summary": "The authors construct permutation-invariant qudit codes in the symmetric subspace $\\mathrm{Sym}^n(\\mathbb{C}^q)$ and prove a minimal parameter family $((4,q,2))_q$ for every integer $q\\ge 2$. They also show that no permutation-invariant code of dimension $q$ and distance at least $2$ exists for $n\\le 3$, establishing four qudits as necessary and sufficient. The construction reduces the Knill-Laflamme constraints to a parity-dependent edge-coloring problem on the complete graph $K_q$.", "motivation": "Permutation-invariant codes are attractive because their symmetry naturally aligns with structured noise and deletion-like errors. Determining minimal-distance constructions sharpens the limits of symmetric coding and gives concrete low-qudit building blocks for future fault-tolerant systems.", "highlights": [ "Proves minimal $((4,q,2))_q$ symmetric-subspace codes", "Shows $n\\le 3$ cannot support such codes", "Reduces code construction to edge-colorings of $K_q$" ], "keywords": [ { "label": "permutation-invariant codes", "reason": "The code family studied in the symmetric subspace." }, { "label": "symmetric subspace", "reason": "Ambient Hilbert space where the constructions live." }, { "label": "complete graph $K_q$", "reason": "Combinatorial object used to build the optimal packets and colorings." }, { "label": "Knill-Laflamme conditions", "reason": "Error-correction constraints reduced to graph-theoretic balancing rules." } ], "emoji": "🧠", "social_summary": "Finds the smallest symmetric qudit codes possible and turns their construction into a complete-graph coloring problem.", "highlights_oneliner": "Minimal symmetric qudit codes" }, { "arxiv_id": "2605.22424", "title": "Long-range nonstabilizerness of topologically encoded states from mutual information", "authors": "David Aram Korbany, Tyler D. Ellison, David T. Stephen, Lorenzo Piroli", "arxiv_url": "https://arxiv.org/abs/2605.22424", "pdf_url": "https://arxiv.org/pdf/2605.22424.pdf", "summary": "This work studies long-range nonstabilizerness as an obstruction to removing nonstabilizer structure with shallow local circuits, focusing on encoded states of $2$D topological systems on a torus. The authors show that mutual information between non-overlapping regions containing non-contractible loops, together with its behavior under modular real-space transformations, can diagnose this obstruction. They obtain a full classification for toric-code encoded states and a nearly complete diagnosis for doubled Fibonacci string-net states, and they connect these results to fault-tolerant logical gates.", "motivation": "Nonstabilizerness is increasingly important for understanding what states can be efficiently simulated and what transformations are possible within topological codes. A mutual-information diagnostic is valuable because it gives a physically accessible way to detect hidden long-range structure in encoded states.", "highlights": [ "Uses mutual information to detect long-range nonstabilizerness", "Fully classifies toric-code encoded nonstabilizer states", "Constrains fault-tolerant logical gates on the torus" ], "keywords": [ { "label": "long-range nonstabilizerness", "reason": "Primary phenomenon being diagnosed and classified." }, { "label": "mutual information", "reason": "Main diagnostic tool applied to separated topological regions." }, { "label": "toric code", "reason": "Benchmark model where the classification is complete." }, { "label": "modular transformations", "reason": "Symmetry action used to refine the diagnostic on topological states." } ], "emoji": "🧭", "social_summary": "Uses mutual information to uncover hidden long-range nonstabilizer structure in topological code states and constrain logical gates.", "highlights_oneliner": "Mutual information for nonstabilizerness" } ] }, "2026-05-21": { "word_cloud": [ { "word": "surface-code-inspired", "weight": 3 }, { "word": "cat-qubits", "weight": 5 }, { "word": "LDPC", "weight": 5 }, { "word": "belief-propagation", "weight": 4 }, { "word": "post-selection", "weight": 4 }, { "word": "logical-qubit", "weight": 4 }, { "word": "kernel-methods", "weight": 3 }, { "word": "neutral-atoms", "weight": 4 }, { "word": "machine-learning", "weight": 3 }, { "word": "differential-equations", "weight": 3 }, { "word": "parametric-oscillator", "weight": 4 }, { "word": "Kerr-nonlinearity", "weight": 4 }, { "word": "qutrit-encoding", "weight": 4 }, { "word": "phase-flip-suppression", "weight": 4 }, { "word": "energy-consumption", "weight": 5 }, { "word": "cryogenic-overheads", "weight": 3 }, { "word": "stabilization", "weight": 3 }, { "word": "realistic-noise", "weight": 3 }, { "word": "decoder-design", "weight": 3 }, { "word": "adiabatic-preparation", "weight": 2 } ], "social_highlights": "Highlights: quantify energetic scaling of cat-qubit computation, improve logical performance via forced-gap post-selection on quantum LDPC codes, benchmark logical versus physical quantum kernels on a neutral-atom processor, and analyze three-photon Kerr oscillators for protected qutrit encoding.", "papers": [ { "arxiv_id": "2605.19854", "title": "Unveiling Energetic Advantage in Superconducting Cat-Qubits Quantum Computation", "authors": "Pedro Ramos, Marco Pezzutto, Yasser Omar", "arxiv_url": "https://arxiv.org/abs/2605.19854", "pdf_url": "https://arxiv.org/pdf/2605.19854.pdf", "summary": "The paper analyzes the energy consumption of the semiclassical Quantum Fourier Transform implemented on a superconducting platform based on cat qubits, explicitly incorporating quantum error correction overheads. It derives how total energy scales with the number of qubits and key parameters for qubit stabilization, gate operations, and error correction, and introduces an optimization procedure that minimizes energy while preserving fidelities above a set threshold. A comparison with state-of-the-art classical hardware suggests a potential quantum energetic advantage beyond $\\sim 26$ qubits, even when realistic cryogenics and control electronics are included.", "motivation": "As quantum devices scale, their potential algorithmic speedups must be weighed against physical resource costs such as energy, especially given the rapidly growing power footprint of classical data centers. Understanding when and how protected cat-qubit processors can achieve an energetic advantage informs architecture choices for large-scale, error-corrected quantum computing.", "highlights": [ "Derives energy scaling laws for cat-qubit implementations of the semiclassical Quantum Fourier Transform including error-correction overheads.", "Introduces an optimization method to tune stabilization, gate, and code parameters to minimize energy at fixed fidelity thresholds.", "Predicts a quantum energetic advantage over classical processors beyond $\\sim 26$ qubits under realistic cryogenic and control assumptions." ], "keywords": [ { "label": "superconducting cat qubits", "reason": "Core physical platform used to implement the Quantum Fourier Transform and analyze stabilization and control energy costs." }, { "label": "energetic advantage", "reason": "Central performance metric comparing quantum and classical implementations in terms of total energy consumption rather than runtime alone." }, { "label": "semiclassical Quantum Fourier Transform", "reason": "Representative algorithm studied to quantify how circuit structure influences energy scaling on cat-qubit hardware." }, { "label": "error-correction overhead modeling", "reason": "Explicit treatment of how quantum error correction parameters and operations contribute to overall energy usage and optimization." } ], "emoji": "⚡", "social_summary": "Quantifies how superconducting cat-qubit processors can beat classical machines in energy consumption, optimizing stabilization, gates, and error correction to reveal a potential pre-advantage energetic crossover.", "highlights_oneliner": "Energetic scaling and optimization for cat-qubit QFT" }, { "arxiv_id": "2605.20346", "title": "Forced Gap Post-Selection for Quantum LDPC Codes and their Operations", "authors": "Adam Wills, Theodore J. Yoder, Isaac Chuang", "arxiv_url": "https://arxiv.org/abs/2605.20346", "pdf_url": "https://arxiv.org/pdf/2605.20346.pdf", "summary": "This work introduces a decoder-agnostic forced-gap post-selection scheme for high-rate quantum LDPC codes, where decoding is rerun per logical observable with forced complementary outcomes and shots are rejected when both logical solutions are similarly likely. Implemented with the Relay-BP decoder, the method is benchmarked on $72$-qubit and $144$-qubit bivariate bicycle codes and associated surgery gadgets. At comparable post-selection rates, it improves logical error rates by more than a factor of $4$ relative to previous strategies, while using only FPGA-friendly belief-propagation rather than expensive BP-OSD decoding.", "motivation": "High-rate quantum LDPC codes promise scalable fault tolerance but their logical error rates are often limited by decoder performance and practical constraints on real-time hardware. Efficient post-selection strategies that are portable across decoders and compatible with low-latency FPGA implementations can substantially improve logical reliability without redesigning codes or hardware.", "highlights": [ "Proposes a general forced-gap post-selection method that reruns decoding per logical observable with complementary enforced outcomes.", "Demonstrates over $4\\times$ logical error reduction at fixed post-selection rate for $72$- and $144$-qubit bivariate bicycle codes using Relay-BP.", "Shows the scheme is lightweight and FPGA-friendly, avoiding repeated high-latency BP-OSD runs for practical LDPC code operations including surgery gadgets." ], "keywords": [ { "label": "forced-gap post-selection", "reason": "New decoding-level strategy that filters out shots with ambiguous logical outcomes by enforcing and comparing complementary solutions." }, { "label": "bivariate bicycle quantum LDPC codes", "reason": "Specific high-rate code family used as the main benchmark for the proposed post-selection scheme." }, { "label": "Relay-BP decoder", "reason": "Belief-propagation-based decoder employed to realize the method in an FPGA-compatible way and evaluate performance gains." }, { "label": "lattice-surgery gadgets", "reason": "Operational primitives whose logical performance is assessed under the new post-selection protocol to demonstrate applicability beyond idle memories." } ], "emoji": "📊", "social_summary": "Boosts logical reliability of quantum LDPC codes by a simple forced-gap post-selection trick that works with fast FPGA-ready belief-propagation decoders instead of costly high-latency decoders.", "highlights_oneliner": "Forced-gap post-selection for LDPC decoding" }, { "arxiv_id": "2605.21276", "title": "Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor", "authors": "Pauline Mathiot, Elio Garnaoui, Axel-Ugo Leriche, Evan Philip, Boris Albrecht, Clémence Briosne-Fréjaville, Lorenzo Cardarelli, Antoine Cornillot, Gwennolé Cournez, Luc Couturier, Julius De Hond, Rebecca El Koussaifi, Thomas Eritzpokoff, Florian Fasola, Antonio Andrea Gentile, Casper Gyurik, Clotilde Hamot, Loïc Henriet, Gaétan Hercé, Michael Kaicher, Lucas Lassablière, François-Marie Le Régent, Edgar Leroux, Yohann Machu, Hadriel Mamann, Luis Ortiz, Annie Paine, Thomas Pansiot, Arnaud Peloquin, Francisco Ponciano, Julien Ripoll, Raja Selvarajan, Adrien Signoles, Henrique Silvério, Siddhy Tan, Marie Taouzinet, Selim Touati, Louis Vignoli, Antoine Browaeys, Pascal Scholl", "arxiv_url": "https://arxiv.org/abs/2605.21276", "pdf_url": "https://arxiv.org/pdf/2605.21276.pdf", "summary": "The authors implement a quantum kernel-based differential equation solver on a neutral-atom quantum processor and compare performance at the physical and logical levels. They find that kernels estimated using logical qubits outperform those from unencoded physical qubits on relevant evaluation metrics, with the improvements traceable to specific noise-induced errors detected by the encoding. Applying these kernels to solving differential equations shows that the logical implementation maintains its advantage at the full application level despite requiring more quantum resources.", "motivation": "As fault-tolerant architectures emerge, it is crucial to quantify when logical encodings yield concrete advantages for end-to-end applications rather than only for synthetic benchmarking. Neutral-atom platforms with logical qubits provide a testbed to evaluate how error detection and correction translate into better machine-learning workloads such as quantum kernel methods for differential equations.", "highlights": [ "Implements a quantum kernel method for solving differential equations on both physical and logical qubits in a neutral-atom processor.", "Shows logical quantum kernels yield better performance than physical kernels on relevant quality metrics by mitigating identifiable noise patterns.", "Demonstrates that the logical kernel advantage persists in the full differential equation solving task, highlighting an application-level benefit of fault-tolerant encodings." ], "keywords": [ { "label": "neutral-atom logical processor", "reason": "Experimental platform that supports both physical and encoded logical computations for the benchmarking study." }, { "label": "quantum kernel methods", "reason": "Machine-learning technique used to construct feature maps and kernels for solving differential equations within the experiment." }, { "label": "logical-versus-physical benchmarking", "reason": "Central comparison showing how encoding impacts kernel quality and final solution accuracy." }, { "label": "differential equation solving", "reason": "End-to-end application used to assess whether logical kernels translate into practical performance gains." } ], "emoji": "🧪", "social_summary": "Benchmarks how logical qubits on a neutral-atom processor improve quantum kernel methods for solving differential equations compared to physical qubits, showing tangible end-to-end gains despite higher resource costs.", "highlights_oneliner": "Logical neutral-atom kernels for differential equations" }, { "arxiv_id": "2605.21036", "title": "Quantum theory of a three-photon Kerr parametric oscillator", "authors": "Alessandro Bruno, Patrick P. Potts, Alexander Grimm, Matteo Brunelli", "arxiv_url": "https://arxiv.org/abs/2605.21036", "pdf_url": "https://arxiv.org/pdf/2605.21036.pdf", "summary": "This work develops a quantum theory of a nonlinear Kerr oscillator driven by a three-photon pump, deriving exact and approximate analytical expressions for its threefold (quasi)degenerate ground-state manifold. The ground states are three-legged squeezed cat-like superpositions of macroscopically distinct states, whose squeezing and displacement properties can be tuned via the detuning to induce a squeezing-to-antisqueezing transition. The authors analyze state preparation via parameter ramps, quantify leakage to excited states, and study robustness against single-photon loss, showing how the system can encode a Kerr-cat qutrit protected against phase-flip errors.", "motivation": "Engineering multi-component cat-like manifolds in driven nonlinear oscillators provides a route to hardware-efficient encodings of multi-level logical systems with intrinsic error protection. Understanding the spectral structure, state preparation protocols, and noise response of three-photon Kerr parametric oscillators is key to exploiting them as qutrit encoders in bosonic quantum hardware.", "highlights": [ "Derives exact and approximate analytical ground states of a three-photon-driven Kerr oscillator, revealing a threefold degenerate manifold of squeezed cat-like states.", "Identifies tunable squeezing and a squeezing-to-antisqueezing transition controlled by detuning in the three-photon Kerr parametric oscillator.", "Shows how the device can realize a Kerr-cat qutrit encoding with phase-flip protection, including analysis of adiabatic preparation and single-photon loss dynamics." ], "keywords": [ { "label": "three-photon Kerr parametric oscillator", "reason": "Central physical system studied, combining Kerr nonlinearity with a three-photon drive to generate a threefold degenerate manifold." }, { "label": "three-legged squeezed cat states", "reason": "Characteristic ground-state superpositions that differ from conventional cat states due to their tunable squeezing properties." }, { "label": "Kerr-cat qutrit encoding", "reason": "Proposed logical encoding that uses the threefold manifold to store qutrit information with resilience to phase-flip errors." }, { "label": "adiabatic ramp state preparation", "reason": "Technique analyzed to initialize target ground states while controlling leakage to excited levels." } ], "emoji": "🐱", "social_summary": "Unveils how a three-photon Kerr parametric oscillator hosts tunable three-legged squeezed cat states that can encode a phase-flip-protected qutrit for bosonic quantum hardware.", "highlights_oneliner": "Three-photon Kerr-cat qutrit theory" } ] }, "2026-05-20": { "word_cloud": [ { "word": "fracton", "weight": 5 }, { "word": "qLDPC", "weight": 5 }, { "word": "hypergraph product", "weight": 4 }, { "word": "BCH ancilla", "weight": 4 }, { "word": "cyclic symmetry", "weight": 4 }, { "word": "color routing", "weight": 4 }, { "word": "energy barrier", "weight": 4 }, { "word": "surface threshold", "weight": 3 }, { "word": "cat qubits", "weight": 5 }, { "word": "Semiclassical QFT", "weight": 3 }, { "word": "state preparation", "weight": 4 }, { "word": "compilation overhead", "weight": 3 }, { "word": "Galois qudit", "weight": 5 }, { "word": "finite fields", "weight": 4 }, { "word": "Reed–Solomon", "weight": 3 }, { "word": "neutral atoms", "weight": 3 }, { "word": "distillation", "weight": 4 }, { "word": "stabilizer tableaux", "weight": 3 }, { "word": "ancilla factory", "weight": 3 }, { "word": "energetic efficiency", "weight": 5 } ], "social_highlights": "Highlights: unify fracton and translation-invariant qLDPC via compactified hypergraph products, cut ancilla distillation overhead in BCH codes, saturate $4$D/$5$D locality bounds, benchmark compiled state preparation, formalize Galois qudits, and map cat-qubit energy trade-offs.", "papers": [ { "arxiv_id": "2605.19298", "title": "Translation-invariant quantum low-density parity-check codes from compactified fracton models", "authors": "Cassandra M. Hopkin, Victor V. Albert, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2605.19298", "pdf_url": "https://arxiv.org/pdf/2605.19298.pdf", "summary": "The paper builds a unifying framework for translation-invariant quantum LDPC codes, including many fracton codes and all Abelian Two-Block Group Algebra (A2BGA) and Bivariate Bicycle (BB) codes, by viewing them as compactifications of higher-dimensional hypergraph product fracton models. It shows how balanced product structure yields a local parent code whose different compactifications generate diverse descendant codes, and extends Wang–Pryadko parameter bounds from Generalized Bicycle codes to the broader A2BGA family while conjecturing constraints on transversal gates and energy barriers inherited from the parent models.", "motivation": "Fracton codes and translation-invariant qLDPC families have been developed through disparate constructions, obscuring common structure and limiting systematic design of codes with desirable properties such as high distance and partial self-correction. A unified parent–descendant picture clarifies classification of fracton phases, connects long-range and local check codes, and guides the search for scalable architectures with constrained logical operators and energy barriers.", "highlights": [ "Introduces a compactification framework where translation-invariant descendant codes arise from a higher-dimensional hypergraph product fracton parent model.", "Shows that all Bivariate Bicycle codes with fixed check weight descend from a single parent fracton code and generalizes Wang–Pryadko bounds to all A2BGA codes.", "Conjectures that transversal gate sets and energy barriers of translation-invariant descendants are upper-bounded by those of their fracton parents, linking computation and thermodynamics across dimensions." ], "keywords": [ { "label": "Hypergraph product fracton parent codes", "reason": "Central construction that generates both local and long-range translation-invariant descendant codes via compactification." }, { "label": "Abelian Two-Block Group Algebra (A2BGA) codes", "reason": "Target family that is shown to be encompassed by the unified framework and whose bounds are extended." }, { "label": "Bivariate Bicycle codes", "reason": "Important subclass of A2BGA codes demonstrated to share a single parent fracton model at fixed check weight." }, { "label": "Energy barrier and transversal gate constraints", "reason": "Key conjectured limitation that connects physical protection and logical gate sets of descendants to properties of the parent model." } ], "emoji": "🧊", "social_summary": "Unify diverse fracton and translation-invariant LDPC codes by compactifying a higher-dimensional hypergraph product parent, extending parameter bounds and relating energy barriers to transversal gate capabilities.", "highlights_oneliner": "Unifying compactified fracton origins of translation-invariant qLDPC." }, { "arxiv_id": "2605.19471", "title": "Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry", "authors": "Kohei Yamamoto, Keisuke Fujii", "arxiv_url": "https://arxiv.org/abs/2605.19471", "pdf_url": "https://arxiv.org/pdf/2605.19471.pdf", "summary": "This work develops a two-stage ancilla factory for quantum BCH codes, combining non-fault-tolerant state preparation with entanglement distillation that exploits the cyclic symmetry of the codes to minimize overhead. Simulations for high-rate BCH codes up to $127$ qubits show reduced spatial overhead and logical error rates compared to conventional distillation, including under realistic circuit-level noise models, yielding practical benchmarks for highly connected platforms.", "motivation": "High-rate quantum BCH codes are attractive for early fault-tolerant devices because they encode many logical qubits into relatively few physical qubits, but specialized low-overhead ancilla preparation protocols have been missing. By tailoring distillation to BCH cyclic structure, the paper lowers resource costs and improves logical performance, making such codes more viable on emerging architectures with all-to-all connectivity such as neutral atoms and ion traps.", "highlights": [ "Introduces a symmetry-aware design framework that determines which non-fault-tolerant preparation circuits can yield fault-tolerant ancillas for BCH codes via cyclic shifts.", "Demonstrates via numerical simulations that the proposed ancilla distillation for codes like the $[[31,11,5]]$ BCH code reduces both spatial overhead and logical error rate compared with standard protocols.", "Provides analytic lower bounds on distillation success probability under circuit-level depolarizing noise by counting detectable error locations in multi-stage ancilla workflows." ], "keywords": [ { "label": "Quantum BCH codes", "reason": "Primary high-rate code family targeted for specialized ancilla preparation and evaluated up to $127$ qubits." }, { "label": "Cyclic symmetry-based distillation", "reason": "Core technique that leverages code cyclicity to identify low-overhead non-FT circuits suitable for fault-tolerant ancilla production." }, { "label": "Circuit-level depolarizing noise modeling", "reason": "Noise model used to benchmark logical error rates and derive lower bounds on distillation success probabilities." }, { "label": "Neutral-atom and ion-trap architectures", "reason": "Highly connected hardware platforms where the proposed high-rate BCH ancilla schemes are particularly promising." } ], "emoji": "🧪", "social_summary": "Exploit cyclic symmetry to design low-overhead ancilla factories for quantum BCH codes, cutting logical errors and qubit cost in realistic circuit-level noise on future high-connectivity hardware.", "highlights_oneliner": "Cyclic-symmetry ancilla factories for BCH codes." }, { "arxiv_id": "2605.18961", "title": "4D and 5D Layer Codes through Color Routing", "authors": "Andrew C. Yuan, Nouédyn Baspin", "arxiv_url": "https://arxiv.org/abs/2605.18961", "pdf_url": "https://arxiv.org/pdf/2605.18961.pdf", "summary": "The authors generalize Layer codes to $D=4,5$ by embedding input CSS qLDPC codes into higher-dimensional structures using a technique called color routing. From an $[[n,k,d]]$ input code with energy barrier $\\Delta$, they construct $4$D and $5$D Layer codes with parameters $[[\\Theta(n^{D/(D-2)}),k,\\Theta(d n^{1/(D-2)})]]$ and energy barrier $\\Omega(\\Delta)$, thereby exactly saturating the BPT locality bounds in these dimensions using good qLDPC inputs.", "motivation": "Understanding how locality and dimensionality constrain code parameters through bounds like BPT is central to designing physically realistic quantum memories and fault-tolerant architectures. By achieving BPT-tight constructions in $4$D and $5$D with modular, embed-and-route gadgets, this work clarifies what is achievable with local stabilizers and informs how higher-dimensional designs might be projected into modular $3$D hardware networks.", "highlights": [ "Introduces color routing to resolve check-layer and line-defect structure, enabling consistent higher-dimensional Layer code constructions.", "Shows that starting from good qLDPC codes, the resulting $4$D and $5$D Layer codes saturate the generalized BPT bounds in terms of $n$, $k$, $d$, and $\\Delta$.", "Argues that the modular nature of higher-dimensional Layer codes makes them compatible with physically $3$D architectures composed of networked modules." ], "keywords": [ { "label": "Layer codes", "reason": "Base construction that is extended from lower dimensions to $4$D and $5$D using embedding techniques." }, { "label": "Color routing", "reason": "New routing method that organizes checks and defects to enable consistent high-dimensional code layouts." }, { "label": "BPT locality bounds", "reason": "Fundamental performance limits that the constructed Layer codes are proven to saturate in $4$D and $5$D." }, { "label": "Modular network architectures", "reason": "Intended physical application where high-dimensional Layer codes can be realized across interconnected $3$D modules." } ], "emoji": "🧩", "social_summary": "Build higher-dimensional Layer codes with color routing to saturate $4$D and $5$D locality bounds while remaining compatible with modular $3$D quantum architectures.", "highlights_oneliner": "Color-routed $4$D/$5$D Layer codes saturating locality bounds." }, { "arxiv_id": "2605.18877", "title": "Logical Resource Estimation for Quantum State Preparation with Compilation", "authors": "Diyi Liu, Hanyu Wang, Shuchen Zhu, Jason Cong, Wibe A. de Jong, Di Fang, Zhen Huang, Costin Iancu, Chao Yang", "arxiv_url": "https://arxiv.org/abs/2605.18877", "pdf_url": "https://arxiv.org/pdf/2605.18877.pdf", "summary": "This paper compares rotation-based and sampling-based methods for preparing general $n$-qubit real-amplitude states, evaluating both $T$-count and total gate count while accounting for compilation overhead. Using a software toolchain for compiling state-preparation circuits, the authors benchmark resource states and chemistry-relevant states (including FeMoCo and water) across target accuracies $\\epsilon$, finding that sampling-based approaches retain asymptotic and practical advantages even after full compilation.", "motivation": "State preparation is a critical bottleneck for many quantum algorithms, especially in quantum simulation, yet theoretical gate-count asymptotics often neglect compilation costs and realistic circuit structure. By providing compiled resource estimates for physically motivated targets, this work informs fault-tolerant resource planning and algorithm design choices between rotation- and sampling-based paradigms.", "highlights": [ "Implements and compares representative rotation-based and sampling-based state-preparation schemes under both $T$-count and total gate-count metrics.", "Develops a compilation tool tailored for state-preparation circuits, enabling realistic logical resource estimates for use as subroutines in larger algorithms.", "Demonstrates via numerical experiments on chemistry and simulation-related states that sampling-based methods maintain an overall resource advantage across target accuracies $\\epsilon$ after compilation." ], "keywords": [ { "label": "Rotation-based state preparation", "reason": "One of the main paradigms evaluated, relying on controlled rotations and often $T$-gate heavy circuits." }, { "label": "Sampling-based state preparation", "reason": "Alternative paradigm using structured representations, shown to yield lower $T$-count and gate count post-compilation." }, { "label": "Quantum chemistry targets (FeMoCo, water)", "reason": "Representative physical systems used to benchmark realistic state-preparation resource requirements." }, { "label": "Compilation-aware resource estimation", "reason": "Methodological focus that incorporates compilation overhead into gate-count comparisons between paradigms." } ], "emoji": "📊", "social_summary": "Benchmark how rotation- and sampling-based methods really compare for compiled quantum state preparation, showing sampling strategies keep an edge in $T$ and gate counts for realistic chemistry targets.", "highlights_oneliner": "Compiled resource benchmarks for state preparation methods." }, { "arxiv_id": "2605.18981", "title": "A Review of Galois Qudits", "authors": "Adam Wills", "arxiv_url": "https://arxiv.org/abs/2605.18981", "pdf_url": "https://arxiv.org/pdf/2605.18981.pdf", "summary": "This review systematically develops the theory of Galois qudits, $q$-dimensional systems whose Pauli group encodes the arithmetic of a finite field $\\mathbb{F}_q$, contrasting them with modular qudits. Focusing on binary extension fields with $q=2^s$, it formalizes their Clifford hierarchies, Pauli measurements, stabilizer tableaux, and explicit qudit-to-qubit mappings, and illustrates their use in constructing quantum Reed–Solomon codes over qubits.", "motivation": "As qudit-based formalisms increasingly inform qubit code design, a clear and unified treatment of Galois qudits is necessary to leverage finite-field structure without changing underlying hardware. By bridging the algebra of $\\mathbb{F}_q$ with practical stabilizer descriptions and mappings to $s$-qubit systems, this work equips code designers with a robust toolkit for building structured qubit codes using qudit mathematics.", "highlights": [ "Clarifies how Galois qudits differ from modular qudits by encoding finite-field rather than modular integer arithmetic in their Pauli operators.", "Shows that a Galois qudit of dimension $q=2^s$ is exactly equivalent to $s$ qubits at the level of Hilbert space, Pauli group, and Clifford hierarchy, providing explicit qudit-to-qubit mappings.", "Presents stabilizer tableaux and examples such as quantum Reed–Solomon codes to demonstrate how Galois-qudit structure aids qubit code construction." ], "keywords": [ { "label": "Galois qudits over $\\mathbb{F}_q$", "reason": "Core object of study, defining qudits whose Pauli operators realize finite-field arithmetic." }, { "label": "Qudit-to-qubit mappings for $q=2^s$", "reason": "Key result showing exact equivalence between Galois qudits and collections of qubits, enabling practical use on qubit hardware." }, { "label": "Clifford hierarchy for qudits", "reason": "Structural description that extends familiar qubit Clifford theory into the Galois-qudit setting." }, { "label": "Quantum Reed–Solomon codes", "reason": "Application example where Galois-qudit formalism supports the construction of structured quantum error-correcting codes." } ], "emoji": "🔤", "social_summary": "Discover how Galois qudits encode finite-field arithmetic, map exactly to qubit systems, and support structured constructions like quantum Reed–Solomon codes in a comprehensive review.", "highlights_oneliner": "Comprehensive toolkit for Galois-qudit-based qubit codes." }, { "arxiv_id": "2605.19854", "title": "Unveiling Energetic Advantage in Superconducting Cat-Qubits Quantum Computation", "authors": "Pedro Ramos, Marco Pezzutto, Yasser Omar", "arxiv_url": "https://arxiv.org/abs/2605.19854", "pdf_url": "https://arxiv.org/pdf/2605.19854.pdf", "summary": "The authors analyze the energy consumption of the Semiclassical Quantum Fourier Transform implemented on a superconducting cat-qubit platform, explicitly incorporating resource costs for qubit stabilization, gate operations, and quantum error correction. They develop an optimization procedure to tune platform parameters to minimize energy while preserving target fidelities and show that, under optimistic and realistic cryogenic assumptions, a quantum energetic advantage over state-of-the-art classical systems can emerge for systems with more than $26$ qubits, potentially preceding computational advantage.", "motivation": "As classical data centers grapple with rapidly growing energy demands, it is crucial to understand whether quantum computers can offer not only speedups but also genuine reductions in physical energy use. By quantifying and optimizing the energy budget of a concrete error-corrected cat-qubit computation and comparing it to classical hardware, this work reframes performance trade-offs in terms of energetic efficiency and informs the design of sustainable quantum architectures.", "highlights": [ "Models detailed energy contributions from cat-qubit stabilization, quantum gates, and error-correction overhead for the Semiclassical Quantum Fourier Transform.", "Introduces an optimization method to select platform parameters that minimize energy consumption subject to fidelity constraints.", "Finds parameter regimes where a quantum energetic advantage over advanced classical hardware appears beyond about $26$ qubits, even when realistic cryogenic inefficiencies and control electronics are included." ], "keywords": [ { "label": "Superconducting cat qubits", "reason": "Chosen hardware platform whose stabilization and gate mechanisms dominate the modeled energy consumption." }, { "label": "Energetic cost of quantum algorithms", "reason": "Primary performance metric analyzed, going beyond runtime to consider physical energy use of gate operations and error correction." }, { "label": "Semiclassical Quantum Fourier Transform", "reason": "Benchmark algorithm used to evaluate energy scaling with problem size on the cat-qubit platform." }, { "label": "Cryogenic and control overhead modeling", "reason": "Crucial component in comparing quantum energy use against classical systems under realistic assumptions." } ], "emoji": "🐱", "social_summary": "Quantify and optimize the energy cost of Semiclassical QFT on superconducting cat qubits, revealing regimes where quantum machines beat classical systems in energy use before computational advantage.", "highlights_oneliner": "Energy-optimized cat-qubit Semiclassical QFT with early energetic advantage." } ] }, "2026-05-19": { "word_cloud": [ { "word": "maximum-likelihood decoding", "weight": 5 }, { "word": "tensor networks", "weight": 4 }, { "word": "neural decoders", "weight": 5 }, { "word": "stabilizer formalization", "weight": 4 }, { "word": "SAT reduction", "weight": 4 }, { "word": "qLDPC", "weight": 5 }, { "word": "axion sensing", "weight": 4 }, { "word": "spin qubits", "weight": 4 }, { "word": "repetition code", "weight": 3 }, { "word": "GHZ entanglement", "weight": 3 }, { "word": "surface code syndromes", "weight": 5 }, { "word": "state-space models", "weight": 4 }, { "word": "sparse processing", "weight": 4 }, { "word": "Cayley complexes", "weight": 3 }, { "word": "quantum Tanner codes", "weight": 5 }, { "word": "belief propagation", "weight": 4 }, { "word": "ensemble decoding", "weight": 3 }, { "word": "logical error rate", "weight": 5 }, { "word": "decoder latency", "weight": 3 }, { "word": "formal verification", "weight": 4 } ], "social_highlights": "Highlights: survey optimal quantum decoding via physics and AI, formally certify distances of large stabilizer codes, use QEC to boost axion searches, accelerate sparse surface-code decoding, and parallelize decoding for quantum Tanner codes.", "papers": [ { "arxiv_id": "2605.17230", "title": "Maximum Likelihood Decoding of Quantum Error Correction Codes", "authors": "Hanyan Cao, Ge Yan, Yuxuan Du, Feng Pan", "arxiv_url": "https://arxiv.org/abs/2605.17230", "pdf_url": "https://arxiv.org/pdf/2605.17230.pdf", "summary": "This topical review organizes maximum-likelihood decoding (MLD) of quantum codes through three lenses: statistical mechanics mappings, tensor-network formulations, and artificial-intelligence-based approximate decoders. It surveys exact and near-MLD algorithms, their performance on simulated and experimental platforms, and emerging hybrid methods that combine these paradigms.", "motivation": "MLD has long been recognized as the optimal decoder but is generally $\\#P$-hard, so practical fault-tolerant architectures rely on approximations whose limitations are not fully understood. Clarifying the algorithmic landscape and unifying perspectives from physics and machine learning is essential to design scalable decoders that keep pace with improving hardware.", "highlights": [ "Maps MLD to disordered spin models to analyze thresholds via phase transitions and obtain exact solutions in special planar cases.", "Formulates MLD as tensor-network contraction on factor graphs, enabling controllable near-optimal decoding with polynomial-cost approximations.", "Explores neural generative and transformer-based decoders that learn approximate MLD distributions and integrate with tensor and statistical-mechanics approaches." ], "keywords": [ { "label": "maximum-likelihood decoding", "reason": "Central decoding objective whose properties and algorithms are surveyed across noise models and code families." }, { "label": "statistical-mechanics mapping", "reason": "Relates decoding to partition functions of disordered spin systems and phase transitions on the Nishimori line." }, { "label": "tensor-network decoders", "reason": "Approximate MLD via controlled tensor contractions on the code factor graph with tunable bond dimension $\\chi$." }, { "label": "neural-network-based decoding", "reason": "Uses generative models and recurrent transformers to approximate MLD and enable real-time, hardware-accelerated decoding." } ], "emoji": "🧠", "social_summary": "Survey how physics-inspired algorithms, tensor networks, and AI jointly push maximum-likelihood quantum decoding toward practical, real-time performance on realistic hardware.", "highlights_oneliner": "Unified review of maximum-likelihood quantum decoding" }, { "arxiv_id": "2605.16523", "title": "End-to-End Formalization of Quantum Error Correction", "authors": "Mattias Ehatamm, Yi Lee, Xiaodi Wu, Runzhou Tao", "arxiv_url": "https://arxiv.org/abs/2605.16523", "pdf_url": "https://arxiv.org/pdf/2605.16523.pdf", "summary": "This work introduces Lean-QEC, a Lean 4 library that formalizes stabilizer-code theory and provides machine-checked lower bounds on code distance for large quantum LDPC codes. It verifies a reduction from distance certification to Boolean satisfiability with scalable encodings, enabling certified distances for realistic $[[90,8,10]]$, $[[70,6,9]]$, and larger Bivariate/Generalized Bicycle codes.", "motivation": "Historically, reported distances for practical quantum codes relied on unverified algorithms or ad hoc proofs, leaving a trust gap exactly where guarantees are needed. Bringing interactive theorem proving and verified reductions to QEC closes this gap and lays foundations for fully verified fault-tolerant stacks.", "highlights": [ "Develops Lean-QEC, formalizing qubit linear algebra, Pauli groups, stabilizer codes, and binary symplectic representations in Lean 4.", "Proves a verified reduction from distance lower-bounding to SAT with BitVec-based and error-location encodings that scale to industrial-size qLDPC codes.", "Produces end-to-end machine-checked distance certificates for Bivariate and Generalized Bicycle codes up to $144$ qubits outside the Lean kernel." ], "keywords": [ { "label": "Lean-QEC library", "reason": "Core formalization framework that encodes stabilizer-code theory and supports machine-checked proofs." }, { "label": "SAT-based distance certification", "reason": "Verified reduction of the distance problem to Boolean satisfiability enables automated, trusted lower bounds." }, { "label": "Bivariate Bicycle and Generalized Bicycle codes", "reason": "Industrial-scale qLDPC code families whose distances are formally certified using the framework." }, { "label": "binary symplectic representation", "reason": "Mathematical formalism for stabilizer codes that is rigorously developed within Lean-QEC." } ], "emoji": "📜", "social_summary": "Formalize stabilizer-code theory in Lean and automatically certify distances of large qLDPC codes with machine-checked SAT-based proofs.", "highlights_oneliner": "Machine-checked distance proofs for large stabilizer codes" }, { "arxiv_id": "2605.17457", "title": "Quantum Error Correction Assisted Axion Search in CMOS Spin Qubit Arrays", "authors": "Xiangjun Tan, Zhanning Wang", "arxiv_url": "https://arxiv.org/abs/2605.17457", "pdf_url": "https://arxiv.org/pdf/2605.17457.pdf", "summary": "The paper shows how integrating repetition-code quantum error correction with logical GHZ entanglement can mitigate longitudinal dephasing in semiconductor spin-qubit axion searches. It derives closed-form quantum Fisher information including axion-field coherence and demonstrates that modest QEC cycle rates can revive substantial entanglement-enhanced sensitivity to the axion-electron coupling $g_{ae}$ in CMOS-compatible devices.", "motivation": "Dark-matter axion searches with spin qubits promise exquisite sensitivity but are limited by dephasing that destroys entanglement-based quantum advantage. Tailoring lightweight QEC to this sensing context could unlock otherwise inaccessible parameter space for physics beyond the Standard Model.", "highlights": [ "Combines repetition-code protection with logical GHZ blocks to suppress dominant dephasing while preserving coherent axion response at the logical level.", "Obtains analytical expressions for quantum Fisher information including finite axion-field coherence and QEC cycle frequency.", "Projects to realistic CMOS spin-qubit parameters, finding order-of-magnitude potential improvements in sensitivity to $g_{ae}$ with modest code distances." ], "keywords": [ { "label": "axion dark-matter detection", "reason": "Primary physics application where QEC-enhanced sensing targets the axion-electron coupling." }, { "label": "CMOS spin qubit arrays", "reason": "Realistic hardware platform used to evaluate QEC-assisted axion search performance." }, { "label": "repetition-code-protected GHZ states", "reason": "Sensing scheme that combines simple QEC with entangled probes to combat dephasing." }, { "label": "quantum Fisher information analysis", "reason": "Metric used to quantify metrological gain from QEC and finite axion coherence." } ], "emoji": "🧲", "social_summary": "Use lightweight repetition-code protection of GHZ states to revive entanglement-enhanced axion sensing in realistic CMOS spin-qubit arrays.", "highlights_oneliner": "Repetition-code QEC boosts axion sensing" }, { "arxiv_id": "2605.17156", "title": "Sparse Mamba Decoder for Quantum Error Correction: Efficient Defect-Centric Processing of Surface Code Syndromes", "authors": "Samira Sayedsalehi, Nader Bagherzadeh, Maxim Shcherbakov, Jean-Luc Gaudiot", "arxiv_url": "https://arxiv.org/abs/2605.17156", "pdf_url": "https://arxiv.org/pdf/2605.17156.pdf", "summary": "This work proposes the Sparse Mamba Decoder (SMD), a defect-centric neural decoder that processes only active detection events with 13-dimensional feature vectors using a Mamba state-space backbone, achieving $\\mathcal{O}(k)$ complexity in the number of defects. It attains near-MLD accuracy while dramatically reducing latency compared to Tesseract and Belief Matching across depolarizing, circuit-level, SI1000, and Google Sycamore benchmarks.", "motivation": "Conventional neural decoders for surface codes scale with the full $\\mathcal{O}(d^2 R)$ syndrome volume, wasting computation at low physical error rates where few defects occur. Exploiting sparsity is crucial to achieve accurate, real-time decoding on commodity hardware for large-distance codes.", "highlights": [ "Introduces a sparse defect-centric representation with 13 engineered features per detection event and a Mamba backbone for $\\mathcal{O}(k)$ decoding complexity.", "Outperforms or matches MWPM, Tesseract, and Belief Matching in logical error rate across multiple synthetic and experimental benchmarks.", "Achieves up to $95$–$467\\times$ speedup over Tesseract and $232$–$463\\times$ over Belief Matching while maintaining nearly constant latency from $d=3$ to $d=9$ under uniform circuit-level noise." ], "keywords": [ { "label": "Sparse Mamba Decoder", "reason": "New defect-centric neural decoding architecture tailored to sparse surface-code syndromes." }, { "label": "defect-based sparse representation", "reason": "Key technique that uses only active detection events with engineered features to reduce complexity to $\\mathcal{O}(k)$." }, { "label": "Mamba state-space model", "reason": "Sequence-processing backbone enabling fast, scalable inference over variable-length defect lists." }, { "label": "surface-code benchmarking", "reason": "Evaluation on depolarizing, circuit-level, SI1000, and Sycamore datasets demonstrates accuracy and latency advantages." } ], "emoji": "⚡", "social_summary": "Exploit sparse surface-code syndromes with a Mamba-based neural decoder that matches near-MLD accuracy while running hundreds of times faster on commodity GPUs.", "highlights_oneliner": "Sparse Mamba neural decoder for fast surface codes" }, { "arxiv_id": "2605.17796", "title": "LEAD: A Local Ensemble-Assisted Parallel Decoding Framework for Quantum Tanner Codes", "authors": "Zhuo-Yan Xiao, Sha Shi, Chen-Peng Huang, Dong-Sheng Wang, Yun-Jiang Wang", "arxiv_url": "https://arxiv.org/abs/2605.17796", "pdf_url": "https://arxiv.org/pdf/2605.17796.pdf", "summary": "The paper introduces LEAD, a structure-aware decoding framework for quantum Tanner codes that projects the global code onto overlapping vertex-neighborhood subcodes on a Cayley complex and decodes them in parallel. It aggregates local soft information using topological symmetries and regularization to avoid overconfidence, yielding lower logical error rates and reduced decoding latency compared to BP-based baselines on several $[[36,8,3]]$, $[[80,2,10]]$, and $[[144,8,12]]$ instances.", "motivation": "Quantum Tanner codes offer excellent asymptotic parameters, but practical decoders that exploit their high-dimensional expander structure are still immature. Leveraging locality and symmetry for scalable, parallel decoding is key to making these codes viable in early fault-tolerant architectures with constrained resources.", "highlights": [ "Partitions Tanner codes on Cayley complexes into overlapping vertex-neighborhood subcodes for highly parallel local error-probability estimation.", "Introduces soft-information regularization and symmetry-aware aggregation to reconcile local views and mitigate overconfident local decisions.", "Demonstrates significantly reduced logical error rates and decoding iterations versus BP–OSD and BP–LSD, with an optimal configuration using lightweight LSD locally and OSD as global post-processor." ], "keywords": [ { "label": "LEAD decoding framework", "reason": "Proposed ensemble-assisted architecture tailored to quantum Tanner codes." }, { "label": "Cayley-complex locality", "reason": "Structural property exploited to define overlapping neighborhood subcodes for parallel decoding." }, { "label": "soft-information regularization", "reason": "Mechanism that controls local overconfidence when aggregating sub-decoder outputs into a global prior." }, { "label": "BP–LSD–OSD hybrid decoding", "reason": "Combination of lightweight local LSD and powerful global OSD that yields strong accuracy-efficiency tradeoffs." } ], "emoji": "🧩", "social_summary": "Decode quantum Tanner codes efficiently with LEAD, a locality-aware, parallel framework that exploits Cayley-complex structure to cut logical errors and latency.", "highlights_oneliner": "Parallel local decoding for quantum Tanner codes" } ] }, "2026-05-18": { "word_cloud": [ { "word": "concatenated-codes", "weight": 4 }, { "word": "biased-noise", "weight": 5 }, { "word": "surface-code-architecture", "weight": 4 }, { "word": "neutral-atom-hardware", "weight": 3 }, { "word": "Clifford-deformation", "weight": 5 }, { "word": "permutation-invariant-codes", "weight": 3 }, { "word": "MacWilliams-transform", "weight": 4 }, { "word": "Racah-polynomials", "weight": 3 }, { "word": "phase-gradient-resources", "weight": 3 }, { "word": "magic-state-factories", "weight": 4 }, { "word": "qLDPC", "weight": 4 }, { "word": "encoding-circuit-synthesis", "weight": 5 }, { "word": "stabilizer-tableau-search", "weight": 3 }, { "word": "linear-programming-bounds", "weight": 3 }, { "word": "zero-rate-LDPC", "weight": 4 }, { "word": "syndrome-extraction-circuits", "weight": 3 }, { "word": "resource-estimation", "weight": 4 }, { "word": "anisotropic-noise", "weight": 3 }, { "word": "logical-state-preparation", "weight": 4 }, { "word": "decoder-thresholds", "weight": 3 } ], "social_highlights": "Highlights: Partially fault-tolerant concatenated Iceberg-Laflamme computing, explicit MacWilliams transform for permutation-invariant qudits, hot-zone OQFT architecture, 50% biased-noise LDPC thresholds, and optimized stabilizer encoders for logical state preparation.", "papers": [ { "arxiv_id": "2605.15344", "title": "Fire and ice: Partially fault-tolerant quantum computing with selective state filtering", "authors": "Ben W. Reichardt, David Aasen, Rui Chao", "arxiv_url": "https://arxiv.org/abs/2605.15344", "pdf_url": "https://arxiv.org/pdf/2605.15344.pdf", "summary": "This paper proposes an error-corrected scheme that concatenates the five-qubit Laflamme code onto the four-qubit Iceberg code and uses selective state filtering to prepare encoded states. Although the resulting protocols are not strictly fault tolerant, simulations under realistic noise models show that these small-distance concatenated codes can achieve low logical error rates with favorable resource overheads compared to surface codes in the targeted regime.", "motivation": "With near-term hardware offering physical two-qubit error rates around $10^{-4}$–$10^{-3}$ and limited qubit counts, fully asymptotic code families like large-distance surface codes can be overkill. Bridging from these physical error rates to logical error rates around $10^{-4}$–$10^{-6}$ using resource-efficient small codes is crucial for making practically useful quantum computations feasible sooner.", "highlights": [ "Introduces concatenated Iceberg-Laflamme constructions such as $[[20,2,6]]$ with efficient Steane-style state preparation.", "Demonstrates that selectively filtered, non-fault-tolerant preparation circuits perform well at moderate $p$ in circuit-noise simulations.", "Shows that small concatenated codes can outperform low-distance surface codes in logical error rate versus overhead within a realistic noise window." ], "keywords": [ { "label": "Iceberg error-detecting code", "reason": "Serves as the inner $[[4,2,2]]$ building block for constructing small concatenated codes tailored to moderate error rates." }, { "label": "Laflamme five-qubit code", "reason": "Acts as the outer $[[5,1,3]]$ code enabling $[[20,2,6]]$ CSS constructions with desirable distance and structure." }, { "label": "selective state filtering", "reason": "Key non-fault-tolerant technique for preparing encoded states that trades rejection rate against improved logical performance." }, { "label": "Steane-style error correction", "reason": "Chosen error-correction paradigm used to evaluate performance of the proposed concatenated schemes in circuit-level simulations." } ], "emoji": "❄", "social_summary": "Show how concatenated Iceberg-Laflamme codes with selective filtering can deliver practical, small-distance quantum computing below surface-code scales at realistic noise rates.", "highlights_oneliner": "Concatenated Iceberg-Laflamme with selective filtering" }, { "arxiv_id": "2605.15372", "title": "Orthogonal Polynomials and the MacWilliams Transform for Permutation-Invariant Qudit Codes", "authors": "Ian Teixeira", "arxiv_url": "https://arxiv.org/abs/2605.15372", "pdf_url": "https://arxiv.org/pdf/2605.15372.pdf", "summary": "The work derives an explicit intrinsic MacWilliams transform for permutation-invariant qudit codes by exploiting the multiplicity-free decomposition of the conjugation action on $\\mathscr{L}(\\mathrm{Sym}^n(\\mathbb{C}^q))$. It identifies the transform matrix with a finite Racah transform whose entries form Racah orthogonal polynomials, enabling closed-form identities and practical computation of linear programming bounds for permutation-invariant codes.", "motivation": "MacWilliams identities have long underpinned classical and quantum linear programming bounds, but explicit intrinsic transforms for permutation-invariant quantum codes were previously unavailable. Providing a closed-form transform tailored to symmetric-power representations opens systematic optimization of these nonadditive qudit codes via weight enumerators and semidefinite or linear programs.", "highlights": [ "Constructs the intrinsic MacWilliams matrix for permutation-invariant qudit codes as a finite Racah transform with hypergeometric entries.", "Shows that the degree-one twirl spectrum lies on an affine quadratic lattice, clarifying the structure of intrinsic weight sectors.", "Derives tridiagonal multiplication rules and orthogonality, detailed-balance, and involutivity relations for the transform, enabling practical linear programming bounds." ], "keywords": [ { "label": "permutation-invariant qudit codes", "reason": "Target code family whose symmetric subspace structure motivates the intrinsic MacWilliams transform derivation." }, { "label": "intrinsic MacWilliams transform", "reason": "Central mathematical object obtained explicitly to relate code and dual weight enumerators in the symmetric representation framework." }, { "label": "Racah orthogonal polynomials", "reason": "Provide the functional form of MacWilliams matrix rows, connecting representation theory to orthogonal polynomial theory." }, { "label": "affine quadratic lattice spectrum", "reason": "Describes the eigenvalue structure of the degree-one twirl, informing the organization of intrinsic error sectors." } ], "emoji": "📊", "social_summary": "Reveal an explicit Racah-polynomial MacWilliams transform that unlocks linear programming bounds for permutation-invariant qudit codes in symmetric power spaces.", "highlights_oneliner": "MacWilliams transform for symmetric qudit codes" }, { "arxiv_id": "2605.15297", "title": "Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study", "authors": "Pedro L. S. Lopes", "arxiv_url": "https://arxiv.org/abs/2605.15297", "pdf_url": "https://arxiv.org/pdf/2605.15297.pdf", "summary": "This study co-designs the Optimistic Quantum Fourier Transform (OQFT) with a surface-code execution model on reconfigurable neutral-atom hardware, introducing a hot-zone architecture that separates storage from processing and routes mobile resource packages to stationary data. By analyzing phase-gradient resources, catalytic rotation insertion, and micro-scheduled ripple-carry adders, it quantifies parallelism and ancilla requirements to achieve near-constant-time OQFT while exposing reaction-limited operation and routing as key resource bottlenecks.", "motivation": "As fault-tolerant implementations of QFT-like primitives move toward realistic hardware, naive gate-count estimates fail to capture limits from magic-state supply, routing, and classical reaction times. Detailed architecture-algorithm co-design is needed to understand how surface-code layouts and neutral-atom transport constraints shape the practical performance envelope of structured transforms such as OQFT.", "highlights": [ "Introduces a hot-zone architecture that routes magic-state factories, bridge qubits, and phase-gradient registers to static data patches under surface codes.", "Shows that leading adders (Gidney and Cuccaro) have comparable space-time volume but differ in parallelism demands when mapped to patch-level motion.", "Finds that halving OQFT runtime for $256$–$2048$-bit instances requires about $500$ additional logical ancillae and peak parallelism of $\\sim 128$ logical qubits, highlighting reaction-limited operation." ], "keywords": [ { "label": "Optimistic Quantum Fourier Transform", "reason": "Target algorithm whose structure and phase-gradient usage drive the architecture-Algorithm co-design analysis." }, { "label": "hot-zone surface-code architecture", "reason": "Proposed layout that decouples data storage from processing regions and orchestrates the motion of logical resource packages." }, { "label": "phase-gradient resources", "reason": "Key non-Clifford resource enabling efficient rotations, whose mobility and alignment dominate routing and scheduling decisions." }, { "label": "reaction-limited execution", "reason": "Identified regime where classical feedback and adaptive measurement times, rather than raw gate counts, bound achievable latency." } ], "emoji": "⚙", "social_summary": "Co-design a hot-zone surface-code architecture and Optimistic QFT, revealing how phase-gradient routing and parallelism shape realistic performance on neutral-atom quantum hardware.", "highlights_oneliner": "Hot-zone architecture for Optimistic QFT" }, { "arxiv_id": "2605.15348", "title": "Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds", "authors": "Jagannath Das, Sayandip Dhara, Pedro Medina, Arthur Pesah, Arpit Dua", "arxiv_url": "https://arxiv.org/abs/2605.15348", "pdf_url": "https://arxiv.org/pdf/2605.15348.pdf", "summary": "The authors analyze zero-rate quantum LDPC codes under single-qubit Clifford deformations and identify a sufficient condition, based on the scaling of pure-$ZZ$ logical operators, for the code-capacity dephasing threshold to approach $50\\%$. Applying this to tile codes, they map out a phase diagram of deformations with $50\\%$ thresholds, construct translationally invariant variants with strong finite-bias and circuit-level performance, and relate microscopic syndrome-extraction circuits to effective phenomenological biased-noise parameters.", "motivation": "Clifford-deformed surface and color codes have empirically exhibited remarkably high thresholds under biased dephasing, but a general explanation and extension to broader LDPC families were lacking. Understanding when and why deformations push biased thresholds toward the optimal $50\\%$ limit informs code and hardware co-design for platforms with strong noise anisotropy.", "highlights": [ "Proves that if biased logical operators grow sufficiently slowly relative to their weight, Clifford-deformed zero-rate LDPC codes achieve a $50\\%$ dephasing threshold in the infinite-bias limit.", "Demonstrates a tile-code deformation phase diagram with extended $50\\%$ regions and identifies translationally invariant deformations with superior finite-bias performance.", "Connects circuit-level noise on different platforms to effective phenomenological bias parameters $p_{\\mathrm{eff}}$ and $\\eta_{\\mathrm{eff}}$ via syndrome-extraction analysis." ], "keywords": [ { "label": "Clifford-deformed LDPC codes", "reason": "Core construction used to tailor stabilizers to anisotropic dephasing noise while preserving code parameters." }, { "label": "biased dephasing threshold", "reason": "Primary performance metric, with a theoretical $50\\%$ limit whose attainability is characterized for zero-rate LDPCs." }, { "label": "tile codes", "reason": "Concrete LDPC family used to realize and numerically study Clifford deformations and their phase diagram." }, { "label": "phenomenological bias modeling", "reason": "Technique for mapping hardware-specific circuit-level noise to effective $p_{\\mathrm{eff}}$ and $\\eta_{\\mathrm{eff}}$ parameters governing threshold behavior." } ], "emoji": "⚡", "social_summary": "Explain and extend $50$ percent biased-noise thresholds using Clifford-deformed zero-rate LDPC and tile codes, linking pure-ZZ logical structure to dephasing-optimized performance.", "highlights_oneliner": "Clifford-deformed LDPCs with 50% bias thresholds" }, { "arxiv_id": "2605.15266", "title": "Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation", "authors": "Tom Peham, Matthew Steinberg, Robert Wille, Sascha Heußen", "arxiv_url": "https://arxiv.org/abs/2605.15266", "pdf_url": "https://arxiv.org/pdf/2605.15266.pdf", "summary": "This work develops synthesis methods for efficient encoding circuits for arbitrary stabilizer codes by formulating encoder design as a search over stabilizer tableaus and introducing greedy and rollout-based algorithms that exploit tableau equivalence. For modular code families such as generalized concatenated and holographic codes, it composes large encoders from optimally synthesized local modules, achieving up to $43\\%$ two-qubit gate and $70\\%$ depth reductions compared to existing approaches, and provides an open-source implementation.", "motivation": "Logical state preparation is a major contributor to space-time overhead in fault-tolerant schemes, yet general-purpose encoder synthesis has lagged behind gate synthesis and specialized state-preparation techniques. Systematically optimizing encoders for diverse stabilizer and qLDPC codes directly reduces resource demands for many quantum computing architectures and protocols.", "highlights": [ "Formulates encoder synthesis as a stabilizer-tableau search problem and proposes greedy and rollout-based optimization strategies over equivalent realizations.", "Uses SMT-based exact synthesis to obtain optimal small constituent encoders for modular code families, then composes them into efficient large encoders.", "Benchmarks on holographic and qLDPC codes show up to $43\\%$ fewer two-qubit gates and $70\\%$ lower depth, with methods released in the Munich Quantum Toolkit." ], "keywords": [ { "label": "stabilizer encoder synthesis", "reason": "Central problem addressed, focusing on constructing efficient encoding circuits for general stabilizer codes." }, { "label": "stabilizer tableau search", "reason": "Core technique that exploits equivalence among tableaus to explore the encoder design space algorithmically." }, { "label": "modular code structures", "reason": "Property of generalized concatenated and holographic codes that enables assembling large encoders from optimized local modules." }, { "label": "SMT-based exact synthesis", "reason": "Method used to generate provably optimal small encoders that seed the overall optimization pipeline." } ], "emoji": "🛠", "social_summary": "Optimize stabilizer encoders via tableau search and modular synthesis, cutting two-qubit gates and depth for holographic and qLDPC codes with open-source tools.", "highlights_oneliner": "Optimized stabilizer encoder synthesis framework" } ] }, "2026-05-15": { "word_cloud": [ { "word": "surface-code", "weight": 5 }, { "word": "decoding", "weight": 5 }, { "word": "lattice-surgery", "weight": 4 }, { "word": "compiler", "weight": 4 }, { "word": "magic-state-distillation", "weight": 5 }, { "word": "T-gate-optimization", "weight": 5 }, { "word": "Maxwell-demon", "weight": 4 }, { "word": "ergotropy", "weight": 4 }, { "word": "thermodynamic-phase-transition", "weight": 3 }, { "word": "spatiotemporal-correlations", "weight": 3 }, { "word": "window-decoding", "weight": 4 }, { "word": "event-driven-scheduling", "weight": 3 }, { "word": "static-analysis", "weight": 4 }, { "word": "phase-folding", "weight": 4 }, { "word": "logical-error-rate", "weight": 3 }, { "word": "execution-time-reduction", "weight": 3 }, { "word": "nonlocal-thermodynamics", "weight": 3 }, { "word": "resource-estimation", "weight": 2 }, { "word": "surface-code-threshold", "weight": 3 }, { "word": "parallelism-extraction", "weight": 3 } ], "social_highlights": "Highlights: accelerate real-time window decoding with adaptive buffers, compress lattice-surgery schedules via C-Phase-aware compilation, teleport ergotropy using surface-code demons, and linearly optimize costly T gates via randomized abstraction.", "papers": [ { "arxiv_id": "2605.14637", "title": "Adaptive Window Decoding based on Spatiotemporal Complementary Gap", "authors": "Moeto Mishima, Riki Toshio, Kaito Kishi, Jun Fujisaki, Hirotaka Oshima, Shintaro Sato, Keisuke Fujii", "arxiv_url": "https://arxiv.org/abs/2605.14637", "pdf_url": "https://arxiv.org/pdf/2605.14637.pdf", "summary": "The paper proposes an adaptive window decoding scheme where decoding starts with a small buffer region and selectively enlarges it only when the inferred decoding confidence is low. To enable this adaptivity, the authors introduce the spatiotemporal complementary gap, a new form of soft information tailored to windowed decoders with small buffers. Numerical simulations show that their approach can reduce the average buffer size by about $40\\%$ without degrading the logical error rate.", "motivation": "As fault-tolerant quantum processors scale, real-time decoders must keep pace with syndrome generation under strict classical-latency budgets. Window decoding mitigates complexity, but conventional buffer-size requirements tied to code distance $d$ constrain latency gains, motivating techniques that shrink average window size while preserving performance.", "highlights": [ "Adaptive window decoding that dynamically resizes buffer regions based on decoding confidence.", "Introduction of the spatiotemporal complementary gap as soft information for small-buffer window decoders.", "Simulation evidence of approximately $40\\%$ average buffer reduction at fixed logical error rate." ], "keywords": [ { "label": "adaptive-window-decoding", "reason": "Core contribution is a decoder that adjusts window buffer size online based on confidence estimates." }, { "label": "spatiotemporal-complementary-gap", "reason": "New soft-information metric designed specifically for windowed, temporally local decoding." }, { "label": "real-time-decoding-latency", "reason": "Work targets reducing classical decoding time to meet real-time constraints in fault-tolerant operation." }, { "label": "logical-error-rate-preservation", "reason": "Method is validated by showing reduced average resources without worsening logical error probabilities." } ], "emoji": "⏱️", "social_summary": "Speed up real-time QEC decoding by adaptively resizing window buffers using a new spatiotemporal confidence metric that cuts average resources by about forty percent without harming logical accuracy.", "highlights_oneliner": "Adaptive, confidence-driven window decoder" }, { "arxiv_id": "2605.14042", "title": "C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution", "authors": "Dhanvi Bharadwaj, Siddharth Dangwal, Yuewen Hou, Gokul Subramanian Ravi", "arxiv_url": "https://arxiv.org/abs/2605.14042", "pdf_url": "https://arxiv.org/pdf/2605.14042.pdf", "summary": "This work develops a microarchitecture-aware compilation framework that tightly integrates algorithm structure with lattice-surgery execution for surface-code architectures. By exploiting the commutativity of C-Phase operations, it transforms sequential gate sequences into concurrent multi-target interactions, while an event-driven scheduler models layout and routing constraints to overlap operations. The resulting C-Phase-aware compilation achieves up to a $59.7\\times$ reduction in execution time relative to standard slice-based baselines.", "motivation": "In fault-tolerant regimes, performance is dominated not by abstract circuit depth but by how logical operations are mapped into constrained space-time resources. Conventional, decoupled compilation stacks and coarse Pauli-product abstractions waste parallelism and exacerbate routing contention, motivating compilation techniques that are natively aware of lattice-surgery microarchitectures.", "highlights": [ "Microarchitecture-aware compiler that co-designs algorithm structure with lattice-surgery execution.", "C-Phase-aware transformations that expose multi-target parallelism by removing artificial sequential dependencies.", "Dynamic event-driven scheduling that cuts execution time by up to $59.7\\times$ compared with standard baselines." ], "keywords": [ { "label": "lattice-surgery-compilation", "reason": "The compiler directly targets lattice-surgery implementations of logical operations on the surface code." }, { "label": "C-Phase-parallelization", "reason": "Key technique is exploiting commutativity of controlled-phase gates to build concurrent multi-target operations." }, { "label": "event-driven-scheduling", "reason": "Scheduling layer models spatial layout and routing contention in a dynamic, event-driven fashion." }, { "label": "fault-tolerant-execution-time", "reason": "Primary metric is reduction of logical execution time under realistic hardware constraints." } ], "emoji": "📐", "social_summary": "Slash fault-tolerant execution time by up to sixty times with a C-Phase-aware lattice-surgery compiler that unlocks massive parallelism while respecting layout and routing constraints.", "highlights_oneliner": "C-Phase-aware lattice-surgery compiler" }, { "arxiv_id": "2605.14924", "title": "Nonlocal Topological Maxwell Demon Teleporting Ergotropy via Surface-Code Quantum Error Correction", "authors": "M. Y. Abd-Rabbou, Cong-Feng Qiao", "arxiv_url": "https://arxiv.org/abs/2605.14924", "pdf_url": "https://arxiv.org/pdf/2605.14924.pdf", "summary": "The authors propose a nonlocal Maxwell demon protocol that teleports ergotropy between distant locations using classical communication and a shared surface code. The teleported ergotropy is exponentially protected below a topological threshold, and the protocol exhibits a thermodynamic phase transition between a profitable demon phase and a thermal phase. A quadratic scaling of infrastructure cost with separation distance imposes a thermodynamic horizon, ensuring compliance with the second law while identifying quantum error correction as a resource for nonlocal thermodynamic tasks.", "motivation": "Maxwell demon thought experiments probe the interface between information and thermodynamics, but traditional formulations focus on local systems and idealized feedback. Embedding demons into topologically protected QEC architectures extends these ideas to realistic, nonlocal settings and clarifies how error correction constrains energy extraction and transport.", "highlights": [ "Construction of a nonlocal Maxwell demon that teleports ergotropy using a shared surface code.", "Identification of a topologically protected profitable phase separated from a thermal phase by a thermodynamic phase transition.", "Derivation of a quadratic infrastructure-cost scaling that enforces a finite thermodynamic horizon consistent with the second law." ], "keywords": [ { "label": "surface-code-mediated-ergotropy", "reason": "Surface-code logical states are used explicitly to teleport and protect useful work (ergotropy)." }, { "label": "nonlocal-Maxwell-demon", "reason": "Central object is a Maxwell demon operating between spatially separated systems via classical communication." }, { "label": "topological-phase-transition", "reason": "The protocol exhibits a transition between profitable and thermal phases governed by topological protection." }, { "label": "thermodynamic-horizon", "reason": "A quadratic cost-distance relation defines a fundamental limit on demon separation, constraining nonlocal thermodynamic advantage." } ], "emoji": "🔥", "social_summary": "Explore a topologically protected Maxwell demon that teleports useful work via a surface code, revealing a thermodynamic phase transition and a distance-limited horizon for nonlocal energy extraction.", "highlights_oneliner": "Surface-code-powered nonlocal Maxwell demon" }, { "arxiv_id": "2605.13929", "title": "Linear-Time T-Gate Optimization via Random Abstraction", "authors": "Aws Albarghouthi", "arxiv_url": "https://arxiv.org/abs/2605.13929", "pdf_url": "https://arxiv.org/pdf/2605.13929.pdf", "summary": "The paper introduces a linear-time randomized algorithm for phase folding that reduces $T$-gate count using a novel static analysis which propagates constant-width random bitstrings instead of symbolic expressions. This randomized abstraction soundly over-approximates reachable quantum states with arbitrarily high probability, enabling scalable optimization of large Clifford+$T$ circuits dominated by expensive magic-state-based $T$ implementations. The implementation, TZAP, matches the $T$-count reductions of state-of-the-art tools while running orders of magnitude faster and scaling to circuits with up to hundreds of millions of gates.", "motivation": "In many fault-tolerant schemes, each logical $T$ gate requires costly magic-state distillation, so $T$-count dominates resource estimates for large-scale quantum algorithms. Existing $T$-optimization techniques struggle with very large circuits, motivating new abstractions that achieve aggressive phase folding in time linear in the number of gates.", "highlights": [ "Randomized static analysis that tracks per-qubit parities via constant-width bitstrings rather than symbolic expressions.", "Linear-time phase-folding algorithm that reduces $T$-count with high-probability correctness guarantees.", "TZAP optimizer achieving near state-of-the-art $T$-reductions while scaling to circuits with hundreds of millions of gates." ], "keywords": [ { "label": "randomized-static-analysis", "reason": "Core technique is a probabilistic abstract interpretation propagating random bitstrings through the circuit." }, { "label": "linear-time-phase-folding", "reason": "Contribution includes a phase-folding algorithm whose complexity is $\\\\mathcal{O}(n)$ in the number of gates." }, { "label": "magic-state-resource-reduction", "reason": "By cutting $T$-count, the method directly lowers the demand for expensive magic-state distillation." }, { "label": "Clifford-plus-T-circuits", "reason": "The algorithm specifically targets large Clifford+$T$ circuits central to fault-tolerant quantum algorithms." } ], "emoji": "✨", "social_summary": "Shrink costly T-gate counts at scale with a linear-time randomized abstraction that powers TZAP, an optimizer handling hundreds of millions of gates in seconds while matching top tools' reductions.", "highlights_oneliner": "Randomized linear-time T-count optimizer" } ] }, "2026-05-14": { "word_cloud": [ { "word": "polar", "weight": 5 }, { "word": "precoded", "weight": 5 }, { "word": "CSS", "weight": 4 }, { "word": "surface", "weight": 4 }, { "word": "stabilizer", "weight": 3 }, { "word": "genetic", "weight": 3 }, { "word": "list", "weight": 3 }, { "word": "decoding", "weight": 4 }, { "word": "short", "weight": 3 }, { "word": "blocklength", "weight": 3 }, { "word": "Clifford", "weight": 2 }, { "word": "ancilla", "weight": 2 }, { "word": "rate", "weight": 3 }, { "word": "depolarizing", "weight": 2 }, { "word": "encoding", "weight": 2 }, { "word": "syndrome", "weight": 3 } ], "social_highlights": "Highlights: precoded polar codes rival surface code performance with fewer qubits, higher rate.", "papers": [ { "arxiv_id": "2605.12796", "title": "Quantum Precoded Polar Codes", "authors": "Tyler Kann, Shrinivas Kudekar, Matthieu R. Bloch", "arxiv_url": "https://arxiv.org/abs/2605.12796", "pdf_url": "https://arxiv.org/pdf/2605.12796", "summary": "Introduces CSS codes from rate-1 precoded polar codes optimized via genetic algorithm. Presents $[[256,2]]$ and $[[512,2]]$ codes with logical error rates matching $[[1201,1,25]]$ surface code over depolarizing channel. Leverages classical short blocklength polar code techniques for quantum error correction.", "motivation": "Quantum polar codes, while asymptotically optimal, underperform surface codes at short blocklengths due to insufficient polarization. Precoding and list decoding advancements in classical polar codes provide a pathway to construct competitive quantum codes requiring fewer qubits and Clifford gates.", "highlights": [ "$[[256,2]]$ code rivals $[[1201,1,25]]$ surface code", "Genetic algorithm optimizes precoder and rate profile", "Fewer qubits, higher rate than surface code" ], "keywords": [ { "label": "precoded polar", "reason": "novel code family combining classical precoding with quantum CSS construction" }, { "label": "genetic optimization", "reason": "algorithm used to search optimal rate profiles and precoders" }, { "label": "short blocklength", "reason": "focus on regime where classical polar codes traditionally struggle" }, { "label": "Clifford complexity", "reason": "key practical metric comparing to surface code implementation" } ], "emoji": "🧬", "social_summary": "Quantum precoded polar codes beat surface codes with 256 qubits vs 1201 needed!", "highlights_oneliner": "Precoded Polar Codes" } ] }, "2026-05-13": { "word_cloud": [ { "word": "neural", "weight": 4 }, { "word": "decoder", "weight": 5 }, { "word": "surface", "weight": 4 }, { "word": "overhead", "weight": 5 }, { "word": "fault-tolerant", "weight": 4 }, { "word": "PEC", "weight": 3 }, { "word": "post-selection", "weight": 3 }, { "word": "hypergraph", "weight": 4 }, { "word": "punctured", "weight": 3 }, { "word": "distributed", "weight": 4 }, { "word": "Floquet", "weight": 3 }, { "word": "node", "weight": 3 }, { "word": "FPGA", "weight": 3 }, { "word": "Steane", "weight": 2 }, { "word": "Golay", "weight": 2 }, { "word": "Iceberg", "weight": 2 }, { "word": "metrology", "weight": 3 }, { "word": "Zeno", "weight": 2 } ], "social_highlights": "Highlights: neural decoders for real-time QEC, lower overhead fault-tolerant blocks, Zeno-enhanced PEC, reduced hypergraph codes, punctured surface metrology, failure-tolerant distributed QC", "papers": [ { "arxiv_id": "2605.12046", "title": "Rethink the Role of Neural Decoders in Quantum Error Correction", "authors": "Ge Yan, Shanchuan Li, Yuxuan Du", "arxiv_url": "https://arxiv.org/abs/2605.12046", "pdf_url": "https://arxiv.org/pdf/2605.12046", "summary": "Redesigns neural decoders for surface-code QEC up to $d=9$ (161 qubits) under accuracy-latency constraints. Unifies five architectural paradigms with end-to-end FPGA compression pipeline. Reveals data scale trumps complexity, inductive bias is crucial, and INT4 quantization enables microsecond latency.", "motivation": "Neural decoders promise data-driven QEC but face fundamental accuracy-latency tradeoffs hindering NISQ deployment. This work provides deployability insights for scalable real-time decoding on hardware.", "highlights": [ "Neural decoders up to $d=9$ on FPGA", "Data scale > architectural complexity", "INT4 quantization for $\\mu$s latency" ], "keywords": [ { "label": "neural decoder", "reason": "Core contribution: redesign and unification of neural architectures for QEC" }, { "label": "FPGA deployment", "reason": "Focus on hardware-realizable microsecond latency decoding" }, { "label": "surface code", "reason": "Targets $d\\leq9$ surface codes (161 qubits)" }, { "label": "INT4 quantization", "reason": "Key technique enabling real-time performance" } ], "emoji": "📚", "social_summary": "Redesigns neural QEC decoders for microsecond FPGA deployment up to 161 qubits.", "highlights_oneliner": "Real-time neural QEC decoding" }, { "arxiv_id": "2605.12385", "title": "Lower overhead fault-tolerant building blocks for noisy quantum computers", "authors": "Prithviraj Prabhu", "arxiv_url": "https://arxiv.org/abs/2605.12385", "pdf_url": "https://arxiv.org/pdf/2605.12385", "summary": "Develops flag fault tolerance reducing stabilizer measurement qubits exponentially. Designs 100% yield state preparation for Steane/Golay codes. Shows $d=4$ code matches $d=5$ surface code protection with 1/10th qubits; classical codes cut logical gate time by 2-6x.", "motivation": "QEC overhead demands hundreds-thousands of physical qubits per logical qubit, stalling fault-tolerant QC. Hardware-agnostic optimizations of core building blocks accelerate error-free quantum computing timelines.", "highlights": [ "Flag FT exponentially reduces qubits", "$d=4$ code = $d=5$ surface with 1/10th qubits", "Classical codes cut gate time 2-6x" ], "keywords": [ { "label": "flag fault tolerance", "reason": "Novel combinatorial proof reducing stabilizer measurement overhead" }, { "label": "Steane code", "reason": "100% yield state preparation circuits" }, { "label": "Golay code", "reason": "100% yield state preparation circuits" }, { "label": "planar layout", "reason": "Distance-4 code optimization for hardware" } ], "emoji": "🧭", "social_summary": "Cuts QEC overhead with flag FT, Steane/Golay prep, and 1/10th qubit codes.", "highlights_oneliner": "Overhead-reduced FT blocks" }, { "arxiv_id": "2605.12149", "title": "Zeno-Enhanced Probabilistic Error Cancellation with Quantum Error Detection Codes", "authors": "Yi Yuan, Yuanchen Zhao, Dong E. Liu", "arxiv_url": "https://arxiv.org/abs/2605.12149", "pdf_url": "https://arxiv.org/pdf/2605.12149", "summary": "Combines QEDC post-selection with PEC to reduce sampling overhead 3-4 orders vs. bare PEC. Uses perturbative inverse channel construction handling stabilizer-commutation correlations. Achieves $F\\simeq0.956$ for $n=200$ Iceberg code GHZ prep.", "motivation": "PEC suffers exponential sampling overhead while QEDC leaves logical residue; EFTQC needs hybrid techniques. Feedback-free QED+PEC dominates both pure approaches in cheap-detection regime.", "highlights": [ "3-4 orders lower sampling overhead", "$n=200$ Iceberg code $F\\simeq0.956$", "Perturbative inverse channel construction" ], "keywords": [ { "label": "QED+PEC", "reason": "Novel hybrid error mitigation combining detection+cancellation" }, { "label": "Iceberg code", "reason": "Demonstrates $[[n,n-2,2]]$ code scaling to $n=200$" }, { "label": "post-selection", "reason": "Maps physical noise to weaker logical channel" }, { "label": "discrete Zeno", "reason": "Trade-off between detection cost and PEC channel reshaping" } ], "emoji": "⚡", "social_summary": "Hybrid QED+PEC slashes sampling overhead 1000x for early fault-tolerant QC.", "highlights_oneliner": "Zeno-enhanced PEC" }, { "arxiv_id": "2605.11318", "title": "Spatial overhead reduction for 2D hypergraph product codes", "authors": "Aarav Pabla, Yu-Xin Wang, Yifan Hong", "arxiv_url": "https://arxiv.org/abs/2605.11318", "pdf_url": "https://arxiv.org/pdf/2605.11318", "summary": "Preserves HGP code dimension, logical basis, distance via physical qubit reduction. Achieves $[\\![610,64,6]\\!] \\rightarrow [\\![441,64,6]\\!]$ and $[\\![1225,49,11]\\!] \\rightarrow [\\![931,49,11]\\!]$. Shows compatibility with homomorphic gadgets, fold-transversal gates.", "motivation": "Hypergraph product codes inherit useful properties but suffer high qubit overhead. Reduction preserves fault-tolerant properties while cutting physical resources dramatically.", "highlights": [ "$[\\![610,64,6]\\!] \\rightarrow [\\![441,64,6]\\!]$", "$[\\![1225,49,11]\\!] \\rightarrow [\\![931,49,11]\\!]$", "Preserves distance and FT gadgets" ], "keywords": [ { "label": "hypergraph product", "reason": "Core code family with spatial overhead reduction" }, { "label": "distance preservation", "reason": "Maintains $d$ while cutting physical qubits" }, { "label": "homomorphic gadgets", "reason": "Compatibility extends savings to computation" }, { "label": "fold-transversal", "reason": "Preserved logical gate implementations" } ], "emoji": "🧭", "social_summary": "Reduces hypergraph product codes 25-30% while preserving distance and FT gadgets.", "highlights_oneliner": "Reduced HGP overhead" }, { "arxiv_id": "2605.11092", "title": "Distributed estimation of many-body Hamiltonians via punctured surface code", "authors": "Linmu Qiao, Zhichun Ouyang, Sisi Zhou", "arxiv_url": "https://arxiv.org/abs/2605.11092", "pdf_url": "https://arxiv.org/pdf/2605.11092", "summary": "Turns many local $Z$-couplings into single protected logical signal via punctured surface code. Witness criterion ensures all signal chains implement same nontrivial $\\bar{Z}$. Provides noise-robust protocol for many-body interaction metrology.", "motivation": "Distributed quantum sensing needs noise protection for entanglement-enhanced metrology. Punctured surface codes enable topological protection of weighted coupling averages.", "highlights": [ "Many-body couplings $\\to$ single logical", "Witness criterion for clean punctures", "Topological distributed metrology" ], "keywords": [ { "label": "punctured surface", "reason": "Code construction mapping couplings to logical operator" }, { "label": "distributed metrology", "reason": "Application to weighted coupling estimation" }, { "label": "witness criterion", "reason": "Topological condition for signal chain homology" }, { "label": "many-body Hamiltonians", "reason": "Targets $ZZ$-type interaction estimation" } ], "emoji": "🔗", "social_summary": "Punctured surface codes enable noise-robust distributed many-body sensing.", "highlights_oneliner": "Punctured metrology" }, { "arxiv_id": "2605.11088", "title": "Tolerating Device Failure in Distributed Quantum Computing", "authors": "Evan Sutcliffe, Coral M. Westoby", "arxiv_url": "https://arxiv.org/abs/2605.11088", "pdf_url": "https://arxiv.org/pdf/2605.11088", "summary": "Enables device swapping during modular QEC with minimal logical error impact. Shows toric/hyperbolic Floquet codes maintain suppression under node failure. Distributed toric code outperforms monolithic below $p=0.05\\%$ physical error.", "motivation": "Utility-scale QC needs $10^5-10^6$ qubits; monolithic scaling is challenging. Distributed architectures must tolerate component failures for system reliability.", "highlights": [ "Device swapping during QEC operation", "Toric code beats monolithic at $p<0.05\\%$", "Floquet codes tolerate node failure" ], "keywords": [ { "label": "distributed QC", "reason": "Modular network tolerating device failure" }, { "label": "toric code", "reason": "Outperforms monolithic below $0.05\\%$ error" }, { "label": "Floquet code", "reason": "Hyperbolic variant tolerates node failure" }, { "label": "node failure", "reason": "Catastrophic $p/100$ failure tolerance" } ], "emoji": "🔗", "social_summary": "Enables quantum computers to swap failed devices mid-QEC with low logical errors.", "highlights_oneliner": "Failure-tolerant distributed QC" } ] }, "2026-05-12": { "word_cloud": [ { "word": "real-time", "weight": 5 }, { "word": "decoding", "weight": 5 }, { "word": "QLDPC", "weight": 5 }, { "word": "deadline", "weight": 4 }, { "word": "queueing", "weight": 4 }, { "word": "metrology", "weight": 4 }, { "word": "partial", "weight": 4 }, { "word": "super-SQL", "weight": 4 }, { "word": "FBQC", "weight": 4 }, { "word": "resource", "weight": 4 }, { "word": "emitters", "weight": 3 }, { "word": "fusion", "weight": 3 }, { "word": "memory", "weight": 3 }, { "word": "latency", "weight": 3 }, { "word": "photonic", "weight": 3 }, { "word": "admission", "weight": 3 }, { "word": "capacity", "weight": 3 }, { "word": "local", "weight": 2 } ], "social_highlights": "Highlights: real-time QLDPC decoder framework, partial QEC for super-SQL metrology, efficient FBQC resource states from 3 emitters", "papers": [ { "arxiv_id": "2605.09142", "title": "DART-Q : A Deadline-Driven Framework for Real-Time QLDPC Decoding", "authors": "Ameya S. Bhave, Navnil Choudhury, Kanad Basu", "arxiv_url": "https://arxiv.org/abs/2605.09142", "pdf_url": "https://arxiv.org/pdf/2605.09142", "summary": "DART-Q introduces a deadline-driven framework modeling real-time QLDPC decoding as discrete service jobs with queueing and EDF scheduling under memory and timing constraints. It analyzes SRAM-fit transitions, tail latency, overload, and capacity scaling to isolate effects on timely decoding. Results show cached-summary organization lowers SRAM-fit boundary by $4\\times$, bounded rescue limits effectiveness, and capacity doubling slashes MissRate from 97.64% to 0.98%.", "motivation": "Real-time quantum error correction requires classical decoders to operate within strict control-loop deadlines, but prior work focused primarily on correction performance rather than service-level viability under memory limits and variable loads. QLDPC codes promise lower qubit overhead, making their real-time decoding behavior critical for practical fault-tolerant quantum computing.", "highlights": [ "Cached-summary lowers SRAM-fit by $4\\times$", "Capacity doubling reduces MissRate to 0.98%", "Overload worsens p99 latency by $17.6\\times$" ], "keywords": [ { "label": "DART-Q", "reason": "Novel deadline-driven real-time decoding framework" }, { "label": "QLDPC", "reason": "Focus code family for low-overhead QEC" }, { "label": "Earliest Deadline First", "reason": "Key scheduling policy for real-time service" }, { "label": "tail latency", "reason": "Critical metric for decoder viability" } ], "emoji": "📚", "social_summary": "DART-Q framework ensures real-time QLDPC decoding meets deadlines under memory crunch.", "highlights_oneliner": "Real-time QLDPC decoding framework" }, { "arxiv_id": "2605.08341", "title": "Quantum metrology via partial quantum error correction", "authors": "Yinan Chen, Zongyuan Wang, Sisi Zhou", "arxiv_url": "https://arxiv.org/abs/2605.08341", "pdf_url": "https://arxiv.org/pdf/2605.08341", "summary": "Proposes partial QEC for quantum metrology where probe states encoded in energetic superpositions require only subset of checks to suppress local noise and maintain super-SQL sensing. Achieves noise suppression $p^\\delta$ with $\\delta = \\lfloor (l+1)/2 \\rfloor$ for weight-$l$ noise parallel to phase imprinter. Uses adaptive imprinter-weight-increasing strategy with local operators to scale super-SQL performance.", "motivation": "Full QEC-assisted metrology requires measuring all code checks, limiting practicality; partial correction could enable noise-robust sensing with reduced overhead. Super-SQL metrology is crucial for precision measurements beyond standard quantum limit in noisy intermediate-scale quantum devices.", "highlights": [ "Partial QEC achieves $p^\\delta$ noise suppression", "$\\delta = \\lfloor (l+1)/2 \\rfloor$ for weight-$l$ noise", "Local operators enable scalable super-SQL sensing" ], "keywords": [ { "label": "partial QEC", "reason": "Core technique reducing check measurements" }, { "label": "super-SQL", "reason": "Target sensing performance beyond SQL" }, { "label": "energetic superposition", "reason": "Novel probe state encoding strategy" }, { "label": "adaptive imprinter", "reason": "Scaling strategy for system growth" } ], "emoji": "🔍", "social_summary": "Partial error correction achieves super-sensitive quantum metrology with fewer measurements.", "highlights_oneliner": "Partial QEC for super-SQL metrology" }, { "arxiv_id": "2605.09325", "title": "Protocol for Efficient Generation of Fusion-Based Quantum Computing Resource States from Quantum Emitters", "authors": "Nishad Manohar, Arshag Danageozian, Evangelia Takou, Edwin Barnes, Sophia E. Economou", "arxiv_url": "https://arxiv.org/abs/2605.09325", "pdf_url": "https://arxiv.org/pdf/2605.09325", "summary": "Develops symmetry-exploiting protocol generating logically encoded 24-photon FBQC resource states using only 3 quantum emitters and 11 CNOTs, solving NP-hard optimization. Addresses exponential success probability decay in photonic fusion gates for fault-tolerant MBQC. Enables efficient resource state generation critical for scaling FBQC computations.", "motivation": "FBQC promises scalable photonic quantum computing but suffers exponential success probability decay for larger logically encoded resource states due to probabilistic fusion gates. Efficient deterministic generation from minimal emitters is essential to overcome the primary bottleneck in fault-tolerant photonic MBQC.", "highlights": [ "24-photon states from 3 emitters", "Only 11 CNOTs via symmetry exploitation", "Solves NP-hard resource optimization" ], "keywords": [ { "label": "FBQC", "reason": "Target computation paradigm" }, { "label": "quantum emitters", "reason": "Minimal hardware resource" }, { "label": "symmetry exploitation", "reason": "Key optimization technique" }, { "label": "24-photon states", "reason": "Significant scale achievement" } ], "emoji": "🌐", "social_summary": "3 emitters generate 24-photon FBQC states with just 11 CNOTs using symmetry.", "highlights_oneliner": "3-emitters for 24-photon FBQC" } ] }, "2026-05-11": { "word_cloud": [ { "word": "GKP", "weight": 5 }, { "word": "beamsplitter", "weight": 4 }, { "word": "Bell", "weight": 4 }, { "word": "entanglement", "weight": 5 }, { "word": "repeater", "weight": 5 }, { "word": "SeQUeNCe", "weight": 3 }, { "word": "CSS", "weight": 4 }, { "word": "Steane", "weight": 3 }, { "word": "mid-circuit", "weight": 4 }, { "word": "Clifford", "weight": 4 }, { "word": "Trotter", "weight": 4 }, { "word": "GSE", "weight": 3 }, { "word": "CliNR", "weight": 3 }, { "word": "stabilizer", "weight": 4 }, { "word": "simulation", "weight": 4 }, { "word": "bosonic", "weight": 3 }, { "word": "trapped-ion", "weight": 3 }, { "word": "Hamiltonian", "weight": 3 }, { "word": "fidelity", "weight": 4 } ], "social_highlights": "Highlights: GKP Bell states via beamsplitter with error correction, QRE-CEC simulates 0.91 fidelity logical pairs over 2000km, Mid-circuit CliNR cuts simulation errors by 54%", "papers": [ { "arxiv_id": "2605.08009", "title": "Error Correction of Beamsplitter-Generated Entangled GKP States", "authors": "Moritz Fontboté-Schmidt, Jeremy Metzner, Florence Berterottière, Ivan Rojkov, Alexander Ferk, Alexander Ferk, Martin Stadler, Bahadir Dönmez, Ralf Berner, Stephan Welte, Daniel Kienzler, Jonathan P. Home", "arxiv_url": "https://arxiv.org/abs/2605.08009", "pdf_url": "https://arxiv.org/pdf/2605.08009", "summary": "Demonstrates generation of all four Bell states of GKP qubits using beamsplitter coupling between two motional modes of trapped ions with 69% average fidelity. Shows extension of entangled state lifetime through quantum error correction. Completes Gaussian operations needed for fault-tolerant GKP quantum computing.", "motivation": "Bosonic GKP codes enable hardware-efficient quantum error correction but require fault-tolerant multi-mode gates. Beamsplitter coupling provides a key primitive for scaling to larger entangled systems while maintaining error correction.", "highlights": [ "69% fidelity GKP Bell states", "Error-corrected entanglement lifetime extension", "Complete Gaussian toolbox for GKP" ], "keywords": [ { "label": "GKP code", "reason": "Core bosonic encoding demonstrated with entanglement" }, { "label": "beamsplitter coupling", "reason": "Fault-tolerant primitive for multi-mode GKP" }, { "label": "trapped-ion modes", "reason": "Experimental platform for motional GKP qubits" }, { "label": "Bell states", "reason": "All four generated with error correction" } ], "emoji": "🔗", "social_summary": "Generated error-corrected GKP Bell states using trapped-ion beamsplitters at 69% fidelity.", "highlights_oneliner": "GKP Beamsplitter Entanglement" }, { "arxiv_id": "2605.06928", "title": "Realistic Simulation of Quantum Repeater with Encoding and Classical Error Correction", "authors": "Sagar Patange, Caitao Zhan, Bikun Li, Joaquin Chung, Allen Zang, Liang Jiang, Rajkumar Kettimuthu", "arxiv_url": "https://arxiv.org/abs/2605.06928", "pdf_url": "https://arxiv.org/pdf/2605.06928", "summary": "Implements QRE-CEC protocol in SeQUeNCe simulator using CSS codes and classical error correction for logical Bell pair distribution. Achieves 0.91 fidelity over 2000 km with second-order error suppression. Reveals practical simulator challenges for encoded repeater design.", "motivation": "Quantum networks require logical entanglement distribution beyond NISQ limitations. Combining quantum encoding with classical correction enables fault-tolerant repeaters for long-distance applications.", "highlights": [ "0.91 fidelity at 2000 km", "Second-order error suppression", "SeQUeNCe CSS code simulation" ], "keywords": [ { "label": "QRE-CEC", "reason": "Novel protocol combining encoding and classical correction" }, { "label": "SeQUeNCe", "reason": "Extended simulator with stabilizer backend" }, { "label": "CSS codes", "reason": "Enables encoded entanglement swapping" }, { "label": "logical Bell pairs", "reason": "Target for fault-tolerant networks" } ], "emoji": "🔄", "social_summary": "Simulated quantum repeaters distribute 0.91 fidelity logical Bell pairs over 2000 km.", "highlights_oneliner": "Encoded Repeater Simulation" }, { "arxiv_id": "2605.06792", "title": "Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations", "authors": "James Brown, Jason Iaconis, Yuri Alexeev, Linta Joseph, Spencer Churchill, Kenny Heitritter, William Aguilar-Calvo, Martin Roetteler, Martin Suchara", "arxiv_url": "https://arxiv.org/abs/2605.06792", "pdf_url": "https://arxiv.org/pdf/2605.06792", "summary": "Combines GSE encoding with Clifford Noise Reduction using mid-circuit measurements for fermionic Hamiltonian simulation. Achieves 54% lower logical error rates on Barium hardware vs. deferred readout. Shows ML-guided stabilizer selection outperforms random verification.", "motivation": "Trotter error accumulation limits Hamiltonian simulation on current hardware. Mid-circuit verification enables encoding-native noise reduction without full QEC overhead.", "highlights": [ "54% logical error reduction", "Mid-circuit CliNR essential", "ML-guided stabilizers" ], "keywords": [ { "label": "CliNR", "reason": "Clifford noise reduction technique" }, { "label": "mid-circuit measurement", "reason": "Enables timely fault detection" }, { "label": "GSE encoding", "reason": "Symplectic-transvection Trotter synthesis" }, { "label": "Hamiltonian simulation", "reason": "Target application demonstrated" } ], "emoji": "⏱️", "social_summary": "Mid-circuit measurements cut Hamiltonian simulation errors 54% using encoded verification.", "highlights_oneliner": "Mid-Circuit Noise Reduction" } ] }, "2026-05-08": { "word_cloud": [ { "word": "threshold", "weight": 5 }, { "word": "surface", "weight": 4 }, { "word": "syndrome", "weight": 4 }, { "word": "decoder", "weight": 4 }, { "word": "shuttling", "weight": 3 }, { "word": "spin-qubit", "weight": 3 }, { "word": "degeneracy", "weight": 3 }, { "word": "Reed-Muller", "weight": 3 }, { "word": "distillation", "weight": 3 }, { "word": "dynamic", "weight": 3 }, { "word": "mitigation", "weight": 3 }, { "word": "resampling", "weight": 3 }, { "word": "XZZX", "weight": 2 }, { "word": "LDPC", "weight": 2 }, { "word": "railway", "weight": 2 }, { "word": "dynamical", "weight": 2 }, { "word": "decoupling", "weight": 2 }, { "word": "ZNE", "weight": 2 } ], "social_highlights": "Highlights: syndrome resampling boosts thresholds, XZZX codes excel in spin-qubit railways, affine decoding tames QLDPC degeneracy, local RM distillation, dynamic circuit mitigation.", "papers": [ { "arxiv_id": "2605.06101", "title": "Syndrome resampling enhances quantum error correction thresholds", "authors": "Luis Colmenarez, Áron Márton, Markus Müller", "arxiv_url": "https://arxiv.org/abs/2605.06101", "pdf_url": "https://arxiv.org/pdf/2605.06101", "summary": "Introduces syndrome resampling, a decoder-agnostic method that boosts QEC thresholds by biasing towards high-probability syndromes using powers of syndrome distributions linked to Rényi coherent information. Demonstrates substantial threshold increases and logical error rate reductions up to four orders of magnitude in surface codes for optimal and suboptimal decoders. Shows practical implementation from finite data and application to experimental data yielding two orders of magnitude error reduction.", "motivation": "Current quantum hardware struggles to reach physical error rates below surface code thresholds needed for fault-tolerant computing. Syndrome resampling provides a hardware-free, general technique to enhance logical fidelities in near-term QEC experiments.", "highlights": [ "Thresholds substantially increased for all decoders", "Logical errors reduced by $10^4$ in experiments", "Works with finite experimental data" ], "keywords": [ { "label": "syndrome resampling", "reason": "Core technique biasing syndrome probabilities" }, { "label": "Rényi coherent information", "reason": "Theoretical foundation linking to optimal thresholds" }, { "label": "maximum likelihood decoding", "reason": "Combined method for threshold enhancement" }, { "label": "surface code", "reason": "Primary simulation platform" } ], "emoji": "⚡", "social_summary": "Syndrome resampling supercharges quantum error correction thresholds without extra hardware!", "highlights_oneliner": "Threshold-boosting syndrome resampling" }, { "arxiv_id": "2605.06284", "title": "Local distillation from Reed Muller codes unfolding", "authors": "Vivien Londe", "arxiv_url": "https://arxiv.org/abs/2605.06284", "pdf_url": "https://arxiv.org/pdf/2605.06284", "summary": "Generalizes Reed-Muller distillation unfolding by revealing underlying algebraic structure. Presents 2D local layout for distance-$4$ Z-stabilizers and 3D layouts for distance-$4$ and distance-$7$ factories. Achieves $p=8.256\\times10^{-9}$ CCZ infidelity in 2D and $p=1.1811\\times10^{-17}$ T-state infidelity in 3D from $p=10^{-3}$ inputs.", "motivation": "Magic state distillation is crucial for non-Clifford gates in fault-tolerant quantum computing but requires efficient local layouts. Local 2D/3D Reed-Muller factories enable scalable distillation with practical error suppression.", "highlights": [ "$10^{-3}$ to $10^{-17}$ T-state distillation", "2D CCZ and 3D T-state local layouts", "Algebraic unfolding generalization" ], "keywords": [ { "label": "Reed-Muller codes", "reason": "Code family for distillation factories" }, { "label": "local distillation", "reason": "2D/3D layout achievement" }, { "label": "unfolding", "reason": "Algebraic structure generalization" }, { "label": "CCZ states", "reason": "2D factory output" } ], "emoji": "✨", "social_summary": "Local 3D Reed-Muller factories distill T-states from $10^{-3}$ to $10^{-17}$ error!", "highlights_oneliner": "Local RM distillation factories" }, { "arxiv_id": "2605.05881", "title": "Surface-Code Thresholds and Qubit Footprints in Shuttling-Based Spin-Qubit Railways", "authors": "Arun John Moncy, Reza Dastbasteh, Josu Etxezarreta Martinez, Ryo Nagai, Pedro M. Crespo, Normann Mertig, Charles Smith, Ruben M. Otxoa", "arxiv_url": "https://arxiv.org/abs/2605.05881", "pdf_url": "https://arxiv.org/pdf/2605.05881", "summary": "Maps rotated surface codes to $2\\times N$ spin-qubit railway using electron shuttling to solve wiring bottlenecks. Shows check-qubit shuttling outperforms data-qubit shuttling, with XZZX surface code superior to CSS under dephasing-biased noise. Achieves megaquop footprint with $d=7$ code at $p=10^{-3}$ physical error rate.", "motivation": "Silicon spin qubits face wiring fan-out bottlenecks in 2D arrays preventing dense surface code implementation. Railway architectures with shuttling provide scalable path to fault tolerance.", "highlights": [ "XZZX beats CSS under dephasing bias", "Check shuttling > data shuttling", "$d=7$ achieves megaquop at $p=10^{-3}$" ], "keywords": [ { "label": "spin-qubit railway", "reason": "Target $2\\times N$ architecture" }, { "label": "XZZX surface code", "reason": "Optimal for dephasing bias" }, { "label": "check-qubit shuttling", "reason": "Superior shuttling strategy" }, { "label": "megaquop footprint", "reason": "Hardware efficiency metric" } ], "emoji": "🧭", "social_summary": "XZZX codes + check shuttling conquer spin-qubit wiring crisis for fault tolerance!", "highlights_oneliner": "Spin-qubit railway thresholds" }, { "arxiv_id": "2605.06547", "title": "Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction", "authors": "Leo Wursthorn, Jonathan Mandelbaum, Sisi Miao, Hedongliang Liu, Holger Jäkel, Stergios Koutsioumpas, Laurent Schmalen", "arxiv_url": "https://arxiv.org/abs/2605.06547", "pdf_url": "https://arxiv.org/pdf/2605.06547", "summary": "Introduces affine subcode ensemble decoding (aSCED) using overcomplete matrices to exploit degeneracy in QLDPC codes. Appends linearly independent rows (splitters) partitioning degeneracy sets for better BP convergence. Outperforms MWPM on $\\llbracket128,2,8\\rrbracket$ toric and $\\llbracket46,2,9\\rrbracket$ GB codes.", "motivation": "Degeneracy causes BP decoder oscillation in QLDPC codes despite sparse advantages for low-overhead QEC. Ensemble methods exploiting structured degeneracy enable real-time decoding.", "highlights": [ "aSCED beats MWPM on toric codes", "Mitigates BP non-convergence", "Overcomplete matrix ensembles" ], "keywords": [ { "label": "affine subcode ensemble", "reason": "Novel decoding framework" }, { "label": "degeneracy sets", "reason": "Mathematical characterization" }, { "label": "QLDPC codes", "reason": "Target sparse code family" }, { "label": "splitters", "reason": "Check matrix augmentation" } ], "emoji": "📚", "social_summary": "Affine ensemble decoding conquers QLDPC degeneracy for real-time quantum error correction!", "highlights_oneliner": "Degeneracy-aware QLDPC decoding" }, { "arxiv_id": "2605.05256", "title": "Error Mitigation in Dynamic Circuits for Hamiltonian Simulation", "authors": "Sumeet Shirgure, Siyuan Niu", "arxiv_url": "https://arxiv.org/abs/2605.05256", "pdf_url": "https://arxiv.org/pdf/2605.05256", "summary": "Applies dynamical decoupling and zero-noise extrapolation to mitigate errors in dynamic circuits with mid-circuit measurements for Hamiltonian simulation. Demonstrates $60\\%$ fidelity improvement in ground state estimation and up to $99\\%$ error reduction in time evolution. Benchmarks DD+ZNE combination on IBM hardware for Heisenberg model.", "motivation": "Dynamic circuits reduce gate depth but suffer severe decoherence during measurement/feed-forward latencies. Tailored mitigation enables practical NISQ applications.", "highlights": [ "$60\\%$ ground state fidelity gain", "$99\\%$ Ising time-evolution improvement", "DD+ZNE for dynamic circuits" ], "keywords": [ { "label": "dynamic circuits", "reason": "Circuit paradigm with MCMs" }, { "label": "dynamical decoupling", "reason": "Idle error suppression" }, { "label": "zero-noise extrapolation", "reason": "Systematic error mitigation" }, { "label": "Hamiltonian simulation", "reason": "Target application" } ], "emoji": "⏱", "social_summary": "DD+ZNE unlocks dynamic circuits for accurate Hamiltonian simulation on real hardware!", "highlights_oneliner": "Dynamic circuit mitigation" } ] }, "2026-05-07": { "word_cloud": [ { "word": "routing", "weight": 5 }, { "word": "Ramanujan", "weight": 4 }, { "word": "surface", "weight": 4 }, { "word": "decoder", "weight": 5 }, { "word": "FPGA", "weight": 4 }, { "word": "real-time", "weight": 5 }, { "word": "magic", "weight": 4 }, { "word": "Clifford", "weight": 3 }, { "word": "hierarchy", "weight": 3 }, { "word": "energy", "weight": 4 }, { "word": "tradeoff", "weight": 3 }, { "word": "CSS", "weight": 4 }, { "word": "factor-graph", "weight": 3 }, { "word": "bicycle", "weight": 4 }, { "word": "distributed", "weight": 4 }, { "word": "scheduling", "weight": 5 }, { "word": "triage", "weight": 3 }, { "word": "lattice", "weight": 3 }, { "word": "post-quantum", "weight": 4 } ], "social_highlights": "Highlights: block routing on hypergraphs, real-time FPGA decoding, magic no-go theorems, energy-error tradeoffs, distributed bicycle codes, adaptive decoding scheduling", "papers": [ { "arxiv_id": "2605.05036", "title": "Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing", "authors": "Joshua M. Courtney", "arxiv_url": "https://arxiv.org/abs/2605.05036", "pdf_url": "https://arxiv.org/pdf/2605.05036", "summary": "Analyzes permutation routing of rigid surface code patches on reconfigurable Ramanujan hypergraphs, proving block routing number $\\mathrm{rt}_B(H, s, g) = \\Theta(d_C \\log N_L)$. Uses spectral analysis of quotient graphs and negative association for congestion bounds. Integrates with syndrome extraction and lattice surgery for $O(d_C \\log N_L)$ depth.", "motivation": "Recent neutral-atom experiments with mid-circuit transport and below-threshold surface codes make block routing the key bottleneck for fault-tolerant processors. Reducing routing depth from $\\Theta(d_C \\sqrt{N_L})$ to $\\Theta(d_C \\log N_L)$ directly expands achievable circuit depths before logical failure.", "highlights": [ "$\\mathrm{rt}_B = \\Theta(d_C \\log N_L)$ proven", "Spectral quotient graph analysis", "Integrates with lattice surgery" ], "keywords": [ { "label": "Ramanujan hypergraphs", "reason": "Core routing architecture enabling logarithmic scaling" }, { "label": "block routing", "reason": "Rigid surface code patch permutation analysis" }, { "label": "quotient graphs", "reason": "Spectral method for supervertex routing bounds" }, { "label": "neutral atoms", "reason": "Targeted experimental platform" } ], "emoji": "🕸️", "social_summary": "Proves logarithmic block routing for surface code patches on Ramanujan hypergraphs.", "highlights_oneliner": "Hypergraph block routing" }, { "arxiv_id": "2605.04892", "title": "Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder", "authors": "Xiaohan Yang, Xuandong Sun, Zhiyi Wu, Jiawei Zhang, Ji Jiang, Xiayu Linpeng, Yuxuan Zhou, Ji Chu, Jingjing Niu, Youpeng Zhong, Song Liu, Dapeng Yu", "arxiv_url": "https://arxiv.org/abs/2605.04892", "pdf_url": "https://arxiv.org/pdf/2605.04892", "summary": "Demonstrates FPGA-based neural-network decoder achieving 550 ns closed-loop latency for distance-3 surface code QEC on superconducting processor. Enables real-time feedback within 1.25 μs cycles with performance matching offline decoding. Shows mid-circuit correction for non-Clifford gates beyond Pauli-frame updating.", "motivation": "Superconducting QEC cycles (~1 μs) demand decoding throughput and latency beyond GPU/CPU capabilities. Real-time feedback is essential for non-Clifford operations where Pauli-frame updates fail.", "highlights": [ "550 ns closed-loop latency", "124 ns NN decoding time", "Mid-circuit non-Clifford correction" ], "keywords": [ { "label": "FPGA decoder", "reason": "Hardware achieving deterministic low latency" }, { "label": "neural-network decoding", "reason": "High-throughput surface code algorithm" }, { "label": "closed-loop latency", "reason": "Key real-time QEC performance metric" }, { "label": "superconducting processor", "reason": "Experimental demonstration platform" } ], "emoji": "⚡", "social_summary": "FPGA neural decoder achieves 550 ns real-time surface code correction.", "highlights_oneliner": "Real-time FPGA decoding" }, { "arxiv_id": "2605.04758", "title": "Quantum Magic in early FTQC: From Diagonal Clifford Hierarchy No-Go Theorems to Architecture Design Blueprints", "authors": "Hsueh-Hao Lu, Yasunari Suzuki, Yasunobu Nakamura, En-Jui Kuo", "arxiv_url": "https://arxiv.org/abs/2605.04758", "pdf_url": "https://arxiv.org/pdf/2605.04758", "summary": "Proves two no-go theorems: hierarchy level doesn't order magic, no state-independent sequence guarantees monotonic magic gain. Derives exact Pauli-spectrum for diagonal Clifford hierarchy with graph-state preconditioning requirement. Shows multi-qubit $Z$-rotations shatter single-qubit kinematic expressibility bottleneck.", "motivation": "Early FTQC restricts to alternating Clifford/diagonal gates, but magic generation mechanisms remain poorly understood. Architecture design requires understanding structural limits on resource generation.", "highlights": [ "Two magic no-go theorems", "Pauli-spectrum closed form", "Multi-qubit Z-rotation breakthrough" ], "keywords": [ { "label": "Clifford hierarchy", "reason": "Core gate model for early FTQC" }, { "label": "magic no-go theorems", "reason": "Fundamental limitations proven" }, { "label": "Pauli spectrum", "reason": "Exact analytical magic measure" }, { "label": "STAR architecture", "reason": "Motivating hardware constraint" } ], "emoji": "✨", "social_summary": "Proves no-go theorems limiting magic generation in early fault-tolerant QC.", "highlights_oneliner": "Magic generation limits" }, { "arxiv_id": "2605.04329", "title": "Energy-error tradeoff in encoding quantum error correction", "authors": "Josey Stevens, Sebastian Deffner", "arxiv_url": "https://arxiv.org/abs/2605.04329", "pdf_url": "https://arxiv.org/pdf/2605.04329", "summary": "Analyzes energetic resources for repetition, perfect, and Steane code logical qubit encoding. Finds universal precision-energy tradeoff with exponential scaling for targeted precision. Shows fault-tolerant measurements increase total energy without error reduction.", "motivation": "QEC overhead dominates quantum computing energy budget, but thermodynamic costs remain unquantified. Energy-precision tradeoffs determine physical feasibility of fault-tolerant architectures.", "highlights": [ "Exponential energy-precision scaling", "Universal tradeoff proven", "Fault-tolerant energy penalty" ], "keywords": [ { "label": "energy-precision tradeoff", "reason": "Core physical limitation discovered" }, { "label": "thermodynamic QEC", "reason": "Quantifies energetic overhead" }, { "label": "Steane codes", "reason": "Analyzed alongside repetition/perfect" }, { "label": "fault-tolerant measurement", "reason": "Increases energy without error gain" } ], "emoji": "🔋", "social_summary": "Reveals exponential energy cost for precise quantum error correction.", "highlights_oneliner": "Energy-error tradeoffs" }, { "arxiv_id": "2605.05132", "title": "A Factor-Graph Formulation of CSS Syndrome Decoding: Joint BP and Four-State BP", "authors": "Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2605.05132", "pdf_url": "https://arxiv.org/pdf/2605.05132", "summary": "Shows joint BP on coupled binary factor graph equals four-state BP after relabeling for CSS decoding. Retains local X/Z correlations via joint priors $Q_j(x_j,z_j)$. Proves identical posteriors, messages, beliefs after $\\mathbb{F}_4$ relabeling $\\alpha=x+\\omega z$.", "motivation": "Separate BP discards X/Z correlations crucial for Pauli channels; four-state BP keeps them but obscures CSS binary structure. Unified understanding resolves decoder equivalence debate.", "highlights": [ "Joint BP = four-state BP proven", "Retains X/Z correlations", "$\\mathbb{F}_4$ relabeling equivalence" ], "keywords": [ { "label": "joint BP", "reason": "Binary factor graph with correlations" }, { "label": "four-state BP", "reason": "Pauli-label equivalence proven" }, { "label": "CSS decoding", "reason": "Specialized factor graph structure" }, { "label": "X/Z correlation", "reason": "Preserved local channel information" } ], "emoji": "📊", "social_summary": "Proves joint BP and four-state BP identical for CSS syndrome decoding.", "highlights_oneliner": "CSS decoder unification" }, { "arxiv_id": "2605.04663", "title": "Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture", "authors": "Nitish Kumar Chandra, Eneet Kaur, Reza Nejabati, Kaushik P. Seshadreesan", "arxiv_url": "https://arxiv.org/abs/2605.04663", "pdf_url": "https://arxiv.org/pdf/2605.04663", "summary": "Analyzes $[![144,12,12]]$ BB code across 4-12 QPUs in star network with $\\alpha$-scaled nonlocal noise. Extends BB ansatz to distributed setting via Monte Carlo BP+OSD. Shows coarser partitions outperform as nonlocal noise $\\alpha\\geq3$.", "motivation": "Bicycle codes' long-range stabilizers don't fit nearest-neighbor architectures. Modular architectures with Bell-pair interconnects enable distributed qLDPC realization.", "highlights": [ "$[[144,12,12]]$ distributed analysis", "$\\alpha$-dependent BB ansatz", "4 QPU optimal for $\\alpha\\geq3$" ], "keywords": [ { "label": "bivariate bicycle", "reason": "qLDPC code family studied" }, { "label": "distributed QEC", "reason": "Modular multiprocessor architecture" }, { "label": "nonlocal noise scaling", "reason": "Key $\\alpha$ parameter" }, { "label": "BP+OSD decoding", "reason": "Monte Carlo performance evaluation" } ], "emoji": "🌐", "social_summary": "Analyzes distributed bicycle codes across modular quantum processors.", "highlights_oneliner": "Distributed BB codes" }, { "arxiv_id": "2605.04459", "title": "Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation", "authors": "Jiahan Chen, Chenghong Zhu, Ge Bai, Xin Wang", "arxiv_url": "https://arxiv.org/abs/2605.04459", "pdf_url": "https://arxiv.org/pdf/2605.04459", "summary": "Formulates FTQC decoding as spatio-temporal scheduling over decoder-constrained slices. Triage dual-mode architecture combines heuristic scheduling with emergency causal-cone prioritization. Achieves 52.6% logical error reduction vs. standard temporal parallelism.", "motivation": "Exponential syndrome backlogs from decoder bottlenecks stall logical operations as systems scale. Dynamic resource allocation across parallel windows remains unsolved.", "highlights": [ "52.6% logical error reduction", "Dual-mode triage scheduling", "Spatio-temporal slice framework" ], "keywords": [ { "label": "triage scheduling", "reason": "Adaptive dual-mode architecture" }, { "label": "parallel window decoding", "reason": "Addresses real-time bottleneck" }, { "label": "causal cone prioritization", "reason": "Emergency mode mechanism" }, { "label": "spatio-temporal slices", "reason": "Scheduling formulation framework" } ], "emoji": "🚨", "social_summary": "Triage scheduler cuts logical errors 52% in real-time quantum decoding.", "highlights_oneliner": "Adaptive decoding scheduler" }, { "arxiv_id": "2605.04582", "title": "Fundamental Limitations of Post-Quantum Cryptographic Architectures", "authors": "Jiho Jung, Donghwa Ji, Mingyu Lee, Kabgyun Jeong", "arxiv_url": "https://arxiv.org/abs/2605.04582", "pdf_url": "https://arxiv.org/pdf/2605.04582", "summary": "Shows LWE noise injection doesn't erase information per Shannon/Fano bounds, enabling QEC extraction of cryptographic kernel. Argues lattice crypto security rests on transient quantum algorithmic bottlenecks, not theoretical impenetrability. Discrete Gaussian statistically matches thermal noise.", "motivation": "Lattice-based crypto classification as post-quantum relies on unproven complexity assumptions vulnerable to quantum algorithm advances. Thermodynamic information theory reveals noise injection limitations.", "highlights": [ "Noise doesn't erase information", "QEC extracts crypto kernel", "Transient security assumption" ], "keywords": [ { "label": "LWE limitations", "reason": "Core cryptographic mechanism critiqued" }, { "label": "thermodynamic security", "reason": "Information-theoretic analysis" }, { "label": "Fano inequality", "reason": "Quantifies information preservation" }, { "label": "quantum learning", "reason": "Extracts cryptographic structure" } ], "emoji": "🔓", "social_summary": "Reveals fundamental thermodynamic limits of lattice post-quantum crypto.", "highlights_oneliner": "Post-quantum limitations" } ] }, "2026-05-06": { "word_cloud": [ { "word": "surface code", "weight": 5 }, { "word": "LDPC codes", "weight": 5 }, { "word": "decoding", "weight": 5 }, { "word": "logical error rate", "weight": 4 }, { "word": "fault tolerance", "weight": 4 }, { "word": "stabilizer codes", "weight": 4 }, { "word": "magic states", "weight": 3 }, { "word": "noise models", "weight": 3 }, { "word": "topological codes", "weight": 3 }, { "word": "syndrome extraction", "weight": 3 }, { "word": "belief propagation", "weight": 3 }, { "word": "code distance", "weight": 3 }, { "word": "degeneracy", "weight": 2 }, { "word": "lattice surgery", "weight": 2 }, { "word": "quantum-classical interface", "weight": 2 }, { "word": "toric code", "weight": 2 }, { "word": "anyon pumping", "weight": 2 }, { "word": "hardware-motivated noise", "weight": 2 } ], "social_highlights": "Highlights: Benchmarking logical primitives under structured noise, factoring 2048-bit RSA with modular atoms, reducing magic-state postselection overhead, designing high-rate dual-containing LDPC codes, securing MDI-QKD with GKP codes, breaking degeneracy via edge-coloring, automating qLDPC predecoding, approximating surface code logical errors, orchestrating quantum compilation workflows, exploring toric code phase families.", "papers": [ { "arxiv_id": "2605.04049", "title": "FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models", "authors": "Shuwen Kan, Adrian Harkness, Zefan Du, Rod Rofougaran, Sean Garner, Chenxu Liu, Ying Mao, Samuel Stein", "arxiv_url": "https://arxiv.org/abs/2605.04049", "pdf_url": "https://arxiv.org/pdf/2605.04049", "summary": "FTPrimitiveBench provides a systematic benchmarking framework for evaluating surface-code logical primitives (memory, lattice surgery, transversal Hadamard, phase gate) under hardware-motivated structured noise including Pauli bias, measurement bias, and spatio-temporal non-uniformity. The framework standardizes noise-model specification and primitive construction in Stim format, enabling reproducible comparative studies of QEC protocols and decoders across diverse noise structures. Results demonstrate that structured noise affects logical primitives qualitatively differently depending on the interplay between noise model, primitive implementation, and decoder choice.", "motivation": "Realistic quantum hardware exhibits heterogeneous, asymmetric noise that differs fundamentally from uniform depolarizing models. Understanding how logical primitives perform under hardware-dependent noise is essential for co-designing fault-tolerant architectures that match physical device characteristics.", "highlights": [ "Structured noise affects logical primitives qualitatively differently than uniform depolarizing noise", "Stim-based framework enables decoder-agnostic, reproducible comparative studies across code families", "Spatio-temporal noise correlations create opportunities for joint code-hardware co-design" ], "keywords": [ { "label": "surface code primitives", "reason": "Core focus on logical memory, lattice surgery, and transversal gates" }, { "label": "hardware-motivated noise models", "reason": "Pauli bias, measurement bias, and spatio-temporal non-uniformity characterization" }, { "label": "decoder comparison framework", "reason": "Standardized benchmarking enabling cross-decoder evaluation under identical noise" } ], "emoji": "📊", "social_summary": "Benchmark logical quantum circuits under realistic hardware noise to guide fault-tolerant architecture design.", "highlights_oneliner": "Hardware-aware benchmarking of logical primitives" }, { "arxiv_id": "2605.03951", "title": "Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor", "authors": "Tian Xue, Jacob P. Covey", "arxiv_url": "https://arxiv.org/abs/2605.03951", "pdf_url": "https://arxiv.org/pdf/2605.03951", "summary": "This work presents an end-to-end compilation and optimization strategy for distributing Shor's algorithm across a modular atomic processor with $\\sim 500,000$ qubits, achieving $2048$-bit RSA factorization in only $16\\%$ more time than a single-module architecture. The analysis balances inter-module communication rates ($10^5$ Bell pairs per second) with intra-module clock rates and measurement latencies ($1$ ms), providing the first large-scale integer factorization simulation on modular atomic hardware. The CPU-inspired architecture demonstrates practical feasibility of distributed quantum algorithms on near-term modular platforms.", "motivation": "Shor's algorithm requires $\\sim 10^6$ physical qubits, necessitating distribution across multiple quantum modules. Modular atomic processors offer a promising platform, but end-to-end compilation strategies accounting for inter-module communication bottlenecks have been lacking.", "highlights": [ "First end-to-end compilation of Shor's algorithm on modular atomic hardware", "Achieves 2048-bit RSA factorization with only 16% overhead versus single-module baseline", "Balances inter-module communication and intra-module clock rates in CPU-inspired architecture" ], "keywords": [ { "label": "Shor's algorithm", "reason": "Primary application demonstrating distributed quantum computation" }, { "label": "modular atomic processor", "reason": "Target hardware platform with 500k qubits and Bell-pair communication" }, { "label": "distributed compilation", "reason": "End-to-end optimization across quantum modules" } ], "emoji": "🔐", "social_summary": "Factor 2048-bit RSA on half-million-qubit modular atomic quantum processor with minimal communication overhead.", "highlights_oneliner": "Distributed Shor's algorithm on modular atoms" }, { "arxiv_id": "2605.03616", "title": "Reducing Postselection Overhead in Magic-State Cultivation by In-Patch Multiplexing", "authors": "Dongmin Kim, Jeonggeun Seo, Aniket Patra, Youngsun Han", "arxiv_url": "https://arxiv.org/abs/2605.03616", "pdf_url": "https://arxiv.org/pdf/2605.03616", "summary": "This work proposes in-patch multiplexing to reduce postselection overhead in magic-state cultivation by creating multiple local cultivation opportunities within idle early-stage resources of a single logical patch. At physical error rate $p=2 \\times 10^{-3}$, the protocol reduces injection-and-cultivation expected attempts by up to $72.91\\%$ for code distance $d_1=5$ and full-cycle expected attempts by up to $78.69\\%$, while preserving the standard escape-stage framework and decoder-based acceptance procedure. The approach maintains logical-error behavior governed by the gap-based acceptance threshold.", "motivation": "Magic-state cultivation is essential for fault-tolerant non-Clifford operations, but postselection loss during early injection-and-cultivation stages limits efficiency. Reducing this overhead is critical for practical fault-tolerant quantum computing resource budgets.", "highlights": [ "In-patch multiplexing reduces injection-and-cultivation attempts by up to 72.91% at $d_1=5$", "Full-cycle expected attempts reduced by up to 78.69% while preserving escape-stage framework", "Maintains standard magic-state cultivation architecture without modifying decoder acceptance procedure" ], "keywords": [ { "label": "magic-state cultivation", "reason": "Core technique for fault-tolerant non-Clifford gate implementation" }, { "label": "postselection overhead", "reason": "Primary efficiency bottleneck being addressed via multiplexing" }, { "label": "logical patch resources", "reason": "In-patch idle resources exploited for parallel cultivation opportunities" } ], "emoji": "✨", "social_summary": "Reduce magic-state preparation overhead by 78% using in-patch multiplexing for fault-tolerant quantum gates.", "highlights_oneliner": "Multiplexing reduces magic-state postselection overhead" }, { "arxiv_id": "2605.03631", "title": "Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices", "authors": "Alessio Baldelli, Marco Baldi, Massimo Battaglioni, Franco Chiaraluce, Paolo Santini", "arxiv_url": "https://arxiv.org/abs/2605.03631", "pdf_url": "https://arxiv.org/pdf/2605.03631", "summary": "This paper introduces two constructions of high-rate quantum dual-containing Calderbank-Shor-Steane (CSS) low-density parity-check (LDPC) codes based on quasi-dyadic matrices, enabling transversal Hadamard gate implementation and low-complexity belief-propagation decoding. Theoretical analysis characterizes cycle properties and automorphism groups, while numerical simulations demonstrate superior finite-length error-rate performance compared to existing dual-containing codes across various block lengths and code rates. The dual-containing structure combined with sparsity enables practical implementation of scalable quantum error correction.", "motivation": "Quantum LDPC codes offer non-vanishing rates and distance scaling superior to surface codes, but designing codes with transversal gate capabilities and efficient decoding remains challenging. Dual-containing CSS codes enable transversal Hadamard gates, a key requirement for fault-tolerant computation.", "highlights": [ "High-rate dual-containing CSS LDPC codes enabling transversal Hadamard gates", "Superior finite-length error-rate performance versus existing dual-containing codes", "Low-complexity belief-propagation decoding via quasi-dyadic matrix sparsity" ], "keywords": [ { "label": "dual-containing CSS codes", "reason": "Enables transversal Hadamard gate implementation" }, { "label": "quasi-dyadic matrices", "reason": "Mathematical construction basis for code design" }, { "label": "LDPC codes", "reason": "Sparse parity-check structure enabling efficient decoding" } ], "emoji": "🔗", "social_summary": "Design high-rate quantum LDPC codes with transversal Hadamard gates using quasi-dyadic matrix constructions.", "highlights_oneliner": "Dual-containing LDPC codes via quasi-dyadic matrices" }, { "arxiv_id": "2605.03292", "title": "Fault-tolerant measurement-device-independent quantum key distribution with noisy non-Gaussian error correction", "authors": "Zhiyue Zuo, Stefano Pirandola", "arxiv_url": "https://arxiv.org/abs/2605.03292", "pdf_url": "https://arxiv.org/pdf/2605.03292", "summary": "This work proposes an enhanced asymmetric continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) protocol using Gottesman-Kitaev-Preskill (GKP) oscillator-to-oscillator codes to suppress both loss and operation errors below the break-even point without classical heralding delays. The scheme correlates data and ancilla noise via symplectic transforms, extracting error syndromes from stabilizer measurements to inform corrective displacements. Composable finite-size security analysis under collective Gaussian attacks demonstrates improved secure transmission range for both fiber-based and free-space configurations.", "motivation": "Continuous-variable MDI-QKD offers deterministic, high-rate operation compatible with classical devices, but secure transmission range remains limited for practical local area networks. GKP codes provide a path to suppress errors below break-even while maintaining protocol security.", "highlights": [ "GKP codes suppress loss and operation errors below break-even point without heralding delays", "Composable finite-size security under collective Gaussian attacks for fiber and free-space", "Symplectic transform correlation of data-ancilla noise enables efficient error syndrome extraction" ], "keywords": [ { "label": "GKP codes", "reason": "Gottesman-Kitaev-Preskill oscillator codes for continuous-variable error correction" }, { "label": "measurement-device-independent QKD", "reason": "Security model removing trust from measurement devices" }, { "label": "continuous-variable quantum communication", "reason": "Deterministic protocol compatible with classical infrastructure" } ], "emoji": "🔑", "social_summary": "Enhance quantum key distribution security using GKP codes to suppress errors in continuous-variable systems.", "highlights_oneliner": "GKP codes for secure quantum key distribution" }, { "arxiv_id": "2605.03218", "title": "Edge-Based Anisotropic Decoding for Generalized Bicycle Codes", "authors": "Dimitris Chytas, Paul N. Fessatidis, Boulat A. Bash, Bane Vasić", "arxiv_url": "https://arxiv.org/abs/2605.03218", "pdf_url": "https://arxiv.org/pdf/2605.03218", "summary": "This work provides a graph-theoretic characterization of degeneracy in generalized bicycle (GB) codes and proposes edge-coloring to eliminate automorphisms in low-weight stabilizer-induced subgraphs. Edge-anisotropic min-sum decoding is implemented as a practical realization, demonstrating improved performance over isotropic and block-anisotropic variants by correcting harmful degenerate error patterns within small iteration counts. The approach addresses a fundamental limitation of iterative decoding for quantum LDPC codes: inability to distinguish between equivalent error patterns related by code symmetries.", "motivation": "Quantum LDPC codes enable fast iterative decoding but suffer from degeneracy—multiple error patterns matching the same syndrome. Iterative decoders with symmetric rules cannot distinguish equivalent patterns, limiting performance scaling with code distance. Breaking symmetries via graph coloring offers a practical solution.", "highlights": [ "Edge-coloring eliminates automorphisms in low-weight stabilizer-induced subgraphs", "Edge-anisotropic min-sum decoding improves performance over isotropic approaches", "Graph-theoretic degeneracy characterization enables symmetry-breaking decoder design" ], "keywords": [ { "label": "generalized bicycle codes", "reason": "Target code family with structured symmetries" }, { "label": "degeneracy mitigation", "reason": "Addresses inability to distinguish equivalent error patterns" }, { "label": "graph coloring", "reason": "Symmetry-breaking technique via edge-coloring" } ], "emoji": "🚴", "social_summary": "Break code symmetries in quantum LDPC decoders using edge-coloring to improve error correction performance.", "highlights_oneliner": "Edge-coloring breaks degeneracy in bicycle codes" }, { "arxiv_id": "2605.03180", "title": "Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding", "authors": "Alexander Knapen, Junyi Luo, Guanchen Tao, Yuxuan Wang, Tomas Bruno, Qirui Zhang, Dennis Sylvester, Mehdi Saligane, Gokul Subramanian Ravi", "arxiv_url": "https://arxiv.org/abs/2605.03180", "pdf_url": "https://arxiv.org/pdf/2605.03180", "summary": "This work introduces an automated framework for generating predecoders for arbitrary quantum LDPC codes, reducing overall decoder utilization by up to $3,963\\times$ and ordered-statistics decoding (OSD) by up to $72.71\\%$. Automatically constructed predecoders autonomously process over $90\\%$ of decoding workload, addressing resource contention in quantum-classical interfaces (QCIs) for fault-tolerant quantum computing. A pipelined FPGA design supports concurrent decoding of $\\sim 1,200$ bivariate bicycle code logical qubits, scaling to $36,000$–$360,000$ logical qubits in cryogenic ASIC at $1.5$ W power budget.", "motivation": "Fault-tolerant quantum computing requires real-time decoding across thousands to millions of logical qubits, creating severe resource contention in quantum-classical interfaces. General quantum LDPC codes have slower decoding than surface codes, intensifying bottlenecks. Automated predecoding offers a practical solution to reduce classical resource demands.", "highlights": [ "Automated predecoder generation reduces decoder utilization by up to 3,963x", "Processes over 90% of decoding workload autonomously, reducing OSD by 72.71%", "Pipelined FPGA design supports 1,200 concurrent logical qubits; ASIC scales to 360k qubits at 1.5 W" ], "keywords": [ { "label": "quantum-classical interface", "reason": "Addresses resource contention in real-time decoding" }, { "label": "qLDPC predecoding", "reason": "Automated lightweight predecoding for general quantum LDPC codes" }, { "label": "hardware implementation", "reason": "FPGA and cryogenic ASIC designs for practical deployment" } ], "emoji": "⚡", "social_summary": "Automate quantum error correction predecoding to reduce classical resource costs by 3,963x in fault-tolerant systems.", "highlights_oneliner": "Automated predecoding reduces classical decoding overhead" }, { "arxiv_id": "2605.03054", "title": "Closed form logical error rate approximations for surface codes", "authors": "Shaked Regev, Daniel Dilley, Andrea Delgado, Ryan Bennink", "arxiv_url": "https://arxiv.org/abs/2605.03054", "pdf_url": "https://arxiv.org/pdf/2605.03054", "summary": "This work proposes a novel recursive algorithm to calculate logical error rates in surface codes by counting minimum-logical-likelihood-path (MLLP) configurations, running in seconds even for large code distances $d$. The method provides closed-form approximations valid when $pd^2 \\ll 1$, enabling rapid evaluation of hypothetical quantum computer configurations without expensive decoder simulations. Analysis includes measurement error accounting and explicit derivation of regimes where rotated codes outperform unrotated codes, supporting practical surface code design.", "motivation": "Evaluating surface code performance typically requires expensive classical simulations of quantum decoders or inaccurate extrapolation from minimal data. A fast, accurate analytical method would enable rapid design space exploration for fault-tolerant quantum computers across diverse configurations.", "highlights": [ "Recursive algorithm counts MLLP configurations in seconds for large code distances", "Closed-form approximations valid for $pd^2 \\ll 1$ regime without decoder simulation", "Explicit analysis of measurement errors and rotated vs. unrotated code performance" ], "keywords": [ { "label": "surface code logical error rates", "reason": "Direct calculation of error probability without simulation" }, { "label": "minimum-logical-likelihood-path", "reason": "Configuration counting method for error analysis" }, { "label": "code distance scaling", "reason": "Analyzes error behavior as function of distance $d$" } ], "emoji": "📈", "social_summary": "Calculate surface code logical error rates in seconds using closed-form approximations instead of expensive simulations.", "highlights_oneliner": "Fast closed-form surface code error analysis" }, { "arxiv_id": "2605.02966", "title": "QBalance: A Reproducible Multi-Objective Workflow for Quantum Compilation, Noise Suppression, and Error-Mitigation Strategy Selection", "authors": "Soumyadip Sarkar", "arxiv_url": "https://arxiv.org/abs/2605.02966", "pdf_url": "https://arxiv.org/pdf/2605.02966", "summary": "QBalance is a Python workflow library for dataset-level selection among quantum compilation, noise-suppression, and error-mitigation strategies built on Qiskit. The system formulates strategy selection as a finite multi-objective optimization problem, implementing weighted objectives, non-dominated selection rules, Bayesian linear surrogate models, and distributional diagnostics. The framework orchestrates coupled compilation choices (qubit layout, routing, basis translation, gate suppression, measurement mitigation, shot budget) while maintaining reproducible artifact models for quantum workflow studies.", "motivation": "Near-term quantum workloads involve coupled compilation and execution choices that cannot be optimized independently. A systematic, reproducible workflow for comparing strategies across circuits and backends is essential for practical quantum computing, but existing tools lack integrated multi-objective orchestration.", "highlights": [ "Multi-objective strategy selection across compilation, suppression, and mitigation choices", "Reproducible artifact model and Bayesian surrogate ordering for candidate evaluation", "Integrated Qiskit ecosystem with optional hooks for ZNE, circuit cutting, and measurement mitigation" ], "keywords": [ { "label": "quantum compilation workflow", "reason": "Orchestrates qubit layout, routing, basis translation, and gate suppression" }, { "label": "multi-objective optimization", "reason": "Balances competing objectives across compilation and mitigation strategies" }, { "label": "reproducible artifact model", "reason": "Enables inspectable, deterministic strategy selection and reporting" } ], "emoji": "⚙️", "social_summary": "Orchestrate quantum compilation and error mitigation strategies reproducibly using multi-objective workflow optimization.", "highlights_oneliner": "Multi-objective quantum compilation workflow orchestration" }, { "arxiv_id": "2605.03891", "title": "Parameterized Families of Toric Code Phase: $em$-duality family and higher-order anyon pumping", "authors": "Shuhei Ohyama, Takamasa Ando, Ryan Thorngren", "arxiv_url": "https://arxiv.org/abs/2605.03891", "pdf_url": "https://arxiv.org/pdf/2605.03891", "summary": "This work constructs parameterized families of topologically ordered states within the toric-code phase, including $1$- and $2$-parameter families of local Hamiltonians confirmed via topological pumping. For the $1$-parameter family, $em$-exchange defects are pumped into bond Hilbert space of tensor-network representations. A $2$-parameter \"pump of a pump\" transports $S^1$-families of lower-dimensional systems, while a $1$-parameter family exhibits higher-order anyon pumping producing corner-localized anyon modes. Boundary algebra methods provide diagnostics of family-level topology.", "motivation": "Topological order and anyon excitations are central to understanding quantum error correction and fault-tolerant quantum computing. Exploring parameterized families of topologically ordered states reveals richer structure and provides explicit lattice realizations of family-level topological phenomena.", "highlights": [ "$1$- and $2$-parameter families of toric-code Hamiltonians with topological pumping confirmation", "Higher-order anyon pumping producing corner-localized anyon modes", "Boundary algebra methods for family-level topology diagnostics" ], "keywords": [ { "label": "toric code phase", "reason": "Fundamental topologically ordered phase with anyon excitations" }, { "label": "anyon pumping", "reason": "Transport of anyonic defects via parameterized Hamiltonian families" }, { "label": "topological order", "reason": "Family-level topology characterized via boundary algebra methods" } ], "emoji": "🧲", "social_summary": "Explore parameterized families of toric code phases with higher-order anyon pumping and corner-localized modes.", "highlights_oneliner": "Parameterized toric code families with anyon pumping" } ] }, "2026-05-05": { "word_cloud": [ { "word": "stacked", "weight": 4 }, { "word": "rank-metric", "weight": 5 }, { "word": "Gabidulin", "weight": 4 }, { "word": "Hermitian", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "FPGA", "weight": 4 }, { "word": "GARI", "weight": 3 }, { "word": "decoding", "weight": 5 }, { "word": "window", "weight": 4 }, { "word": "adaptive", "weight": 3 }, { "word": "bicycle", "weight": 3 }, { "word": "error", "weight": 4 }, { "word": "detection", "weight": 4 }, { "word": "dyadic", "weight": 5 }, { "word": "girth", "weight": 4 }, { "word": "absorbing", "weight": 3 }, { "word": "protograph", "weight": 3 }, { "word": "CSS", "weight": 3 }, { "word": "symplectic", "weight": 3 }, { "word": "lattice", "weight": 2 } ], "social_highlights": "Highlights: quantum rank-metric codes for stacked memory, scalable FPGA LDPC decoding, adaptive window decoding, hardware error detection scaling, dyadic QLDPC cycle control.", "papers": [ { "arxiv_id": "2605.02571", "title": "Construction of Quantum Rank-Metric Codes Using Hermitian Orthogonality", "authors": "Ryota Nizuka, Ryutaroh Matsumoto", "arxiv_url": "https://arxiv.org/abs/2605.02571", "pdf_url": "https://arxiv.org/pdf/2605.02571", "summary": "Proposes a framework for quantum rank-metric codes from classical linear codes with symplectic self-orthogonality. Introduces new quantum Gabidulin codes using Hermitian self-orthogonality of Gabidulin codes with self-dual basis for even extension degrees. Doubles minimum rank distance ratio to physical qubits while enabling even-sized stacked memories.", "motivation": "Stacked quantum memories face limitations in prior CSS-based quantum Gabidulin codes restricted to odd-length square layouts due to self-dual basis requirements. This work addresses these constraints to enhance error correction capability and design flexibility in fault-tolerant quantum computing.", "highlights": [ "Doubles $d/n$ ratio for quantum Gabidulin codes", "Enables even $n$ cells/layers in stacked memory", "Preserves code rate with Hermitian construction" ], "keywords": [ { "label": "rank-metric", "reason": "Core code family for stacked error correction" }, { "label": "Hermitian orthogonality", "reason": "Key construction technique overcoming CSS limits" }, { "label": "stacked quantum memory", "reason": "Target application architecture" }, { "label": "Gabidulin codes", "reason": "Specific classical codes adapted to quantum" } ], "emoji": "📚", "social_summary": "Doubles error correction power for stacked quantum memories using Hermitian codes.", "highlights_oneliner": "Hermitian rank-metric codes" }, { "arxiv_id": "2605.01035", "title": "A Scalable FPGA Architecture for Real-Time Decoding of Quantum LDPC Codes Using GARI", "authors": "Daniel Báscones, Arshpreet Singh Maan, Valentin Savin, Francisco Garcia-Herrero", "arxiv_url": "https://arxiv.org/abs/2605.01035", "pdf_url": "https://arxiv.org/pdf/2605.01035", "summary": "Introduces FPGA architecture for message-passing decoding of correlated errors in quantum LDPC codes via GARI-transformed detector models. Enables flexible scaling with resource reuse and modest parallelism for low latency. Implements three cores for $[[144,12,12]]$ bicycle code on VCU19P FPGA with 596 ns latency using 6x fewer resources.", "motivation": "Real-time decoding of quantum LDPC codes with correlated errors lags behind surface codes due to hardware scalability challenges. Efficient FPGA implementations are needed to meet latency and power constraints for fault-tolerant quantum computing.", "highlights": [ "596 ns latency per round on FPGA", "6x resource reduction vs prior GARI", "Multi-core ensemble on single FPGA" ], "keywords": [ { "label": "GARI", "reason": "Error model transformation for decoding" }, { "label": "bivariate bicycle", "reason": "Target $[[144,12,12]]$ code family" }, { "label": "FPGA decoding", "reason": "Hardware implementation platform" }, { "label": "correlated errors", "reason": "Error model addressed" } ], "emoji": "📚", "social_summary": "Scalable FPGA decoder slashes resources for quantum LDPC error correction.", "highlights_oneliner": "FPGA GARI LDPC decoder" }, { "arxiv_id": "2605.01149", "title": "ADaPT: Adaptive-window Decoding for Practical fault-Tolerance", "authors": "Tina Oberoi, Joshua Viszlai, Frederic T. Chong", "arxiv_url": "https://arxiv.org/abs/2605.01149", "pdf_url": "https://arxiv.org/pdf/2605.01149", "summary": "Proposes adaptive window decoding based on decoder confidence to reduce overhead from fixed $d$-sized windows exploiting error sparsity. Lowers decoding time and reaction time without increasing logical error rates. Benchmarks across codes and noise models show low overhead to target error rates.", "motivation": "Fixed window decoding incurs unnecessary overhead for sparse errors and scales superlinearly with $d$, limiting real-time QEC scalability. Adaptive techniques are needed to optimize throughput and latency in fault-tolerant quantum computation.", "highlights": [ "Reduces decoding overhead via confidence", "Maintains low logical error rates", "Scales across codes/noise models" ], "keywords": [ { "label": "window decoding", "reason": "Core technique improved" }, { "label": "adaptive confidence", "reason": "Novel decision mechanism" }, { "label": "reaction time", "reason": "Key performance metric" } ], "emoji": "⏱", "social_summary": "Adaptive decoding cuts QEC overhead using error sparsity.", "highlights_oneliner": "Adaptive window decoding" }, { "arxiv_id": "2605.02861", "title": "Opportunities and challenges in scaling quantum error detection on hardware", "authors": "Yanis Le Fur, Ethan Egger, Hong-Ye Hu, Vincent Russo, William J. Zeng, Ryan LaRose", "arxiv_url": "https://arxiv.org/abs/2605.02861", "pdf_url": "https://arxiv.org/pdf/2605.02861", "summary": "Benchmarks quantum error detection with repetition and triangular color codes up to 74 qubits on real/simulated hardware. Demonstrates exponential accuracy improvement below pseudothreshold despite sampling/processing overheads. Maps scaling frontiers and hardware embedding challenges.", "motivation": "Quantum error detection offers unbiased mitigation like correction but is understudied on hardware due to exponential overheads and embedding noise. Clear benchmarking is needed to assess viability for near-term quantum advantage.", "highlights": [ "Exponential convergence up to 74 qubits", "Identifies pseudothresholds", "Reveals embedding overheads" ], "keywords": [ { "label": "error detection", "reason": "Distinguishing technique vs correction" }, { "label": "repetition code", "reason": "Benchmarked memory code" }, { "label": "triangular color", "reason": "Benchmarked computation code" }, { "label": "pseudothreshold", "reason": "Scaling metric defined" } ], "emoji": "🚫", "social_summary": "Benchmarks error detection scaling on real quantum hardware.", "highlights_oneliner": "Hardware error detection scaling" }, { "arxiv_id": "2605.01942", "title": "Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes", "authors": "Anthony Gómez-Fonseca, Gretchen L. Matthews, Kirsten D. Morris, Tefjol Pllaha", "arxiv_url": "https://arxiv.org/abs/2605.01942", "pdf_url": "https://arxiv.org/pdf/2605.01942", "summary": "Develops algebraic framework for dyadic/quasi-dyadic (Q)LDPC codes enabling cycle enumeration and girth control via forbidden shifts. Introduces dyadic-aware PEG constructions and characterizes absorbing sets. Shows decoding gains from short-cycle reduction in CSS constructions.", "motivation": "Short cycles and subgraphs degrade QLDPC decoding performance and raise error floors, especially under commutation constraints. Structured dyadic matrices offer compact specification and analysis tools for scalable code design.", "highlights": [ "Efficient 4/6/8-cycle enumeration", "Dyadic PEG maximizes girth", "Reduces absorbing sets" ], "keywords": [ { "label": "dyadic matrices", "reason": "Algebraic code construction basis" }, { "label": "girth control", "reason": "Cycle minimization technique" }, { "label": "absorbing sets", "reason": "Error floor structures analyzed" }, { "label": "QLDPC", "reason": "Target sparse code family" } ], "emoji": "🔲", "social_summary": "Controls cycles in dyadic QLDPC codes for better decoding.", "highlights_oneliner": "Dyadic QLDPC analysis" } ] }, "2026-05-04": { "word_cloud": [ { "word": "decoding", "weight": 5 }, { "word": "scalability", "weight": 5 }, { "word": "surface code", "weight": 4 }, { "word": "belief propagation", "weight": 4 }, { "word": "geometric gates", "weight": 4 }, { "word": "magic state distillation", "weight": 4 }, { "word": "syndrome measurement", "weight": 3 }, { "word": "topological codes", "weight": 3 }, { "word": "composite pulses", "weight": 3 }, { "word": "decoherence-free subspace", "weight": 3 }, { "word": "logical T gate", "weight": 4 }, { "word": "noise suppression", "weight": 3 }, { "word": "fault tolerance", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "crosstalk errors", "weight": 3 }, { "word": "latency", "weight": 3 }, { "word": "physical qubits", "weight": 3 }, { "word": "gate fidelity", "weight": 3 } ], "social_highlights": "Highlights: Lottery BP decoder achieves 2-8 orders of magnitude accuracy improvement for scalable quantum error correction, Geometric logical T gate suppresses universal errors to fourth order without magic state distillation overhead", "papers": [ { "arxiv_id": "2605.00038", "title": "Lottery BP: Unlocking Quantum Error Decoding at Scale", "authors": "Yanzhang Zhu, Chen-Yu Peng, Yun Hao Chen, Yeong-Luh Ueng, Di Wu", "arxiv_url": "https://arxiv.org/abs/2605.00038", "pdf_url": "https://arxiv.org/pdf/2605.00038", "summary": "This paper proposes Lottery BP, a randomized belief propagation decoder that improves decoding accuracy by $2$-$8$ orders of magnitude for topological codes while reducing latency through syndrome voting preprocessing. The PolyQec architecture combines Lottery BP as a local decoder with ordered statistics decoding as a global decoder, reducing global decoder invocations by $3$-$5$ orders of magnitude. The authors develop Syndrilla, a PyTorch-based decoding simulator that achieves $1$-$2$ orders of magnitude speedup on GPUs and provides modular evaluation metrics for fair decoder comparison.", "motivation": "Fault-tolerant quantum computing requires real-time decoding of syndrome measurements across millions of qubits, but existing decoders suffer from accuracy-speed-generality tradeoffs that limit scalability. This work addresses the critical gap between current decoding algorithms and the ideal decoder needed for the megaquop era by combining algorithmic innovation with efficient hardware implementation.", "highlights": [ "Lottery BP improves accuracy $2$-$8$ orders of magnitude over standard belief propagation", "PolyQec architecture reduces global decoder calls by $3$-$5$ orders of magnitude for topological codes", "Syndrilla simulator achieves $1$-$2$ orders of magnitude GPU speedup with modular metrics" ], "keywords": [ { "label": "Belief Propagation Decoder", "reason": "Core algorithmic contribution introducing randomness to improve decoding accuracy for topological codes" }, { "label": "Syndrome Voting", "reason": "Preprocessing technique that compresses multi-round measurement errors to mitigate backlog and increase latency margin" }, { "label": "Topological Codes", "reason": "Primary application domain including surface code, toric code, and bivariate bicycle code" }, { "label": "Decoding Latency", "reason": "Critical performance metric for real-time fault-tolerant quantum computing requiring sub-400ns decoding" } ], "emoji": "📚", "social_summary": "Unlock scalable quantum error decoding with Lottery BP, achieving orders of magnitude accuracy gains and latency reduction for fault-tolerant quantum computing.", "highlights_oneliner": "Scalable decoder with orders of magnitude accuracy gains" }, { "arxiv_id": "2605.00552", "title": "Suppression of Universal Errors in DFS-Encoded Superconducting Geometric Logical $T$ Gate", "authors": "Cheng-Yun Ding, Li-Hua Zhang, Jian Zhou", "arxiv_url": "https://arxiv.org/abs/2605.00552", "pdf_url": "https://arxiv.org/pdf/2605.00552", "summary": "This paper presents a controlled superconducting geometric logical $T$ gate scheme that achieves high-order suppression of universal errors by integrating decoherence-free subspace encoding with multi-loop optimized composite geometric pulse engineering. The scheme suppresses Rabi frequency, detuning, and residual inter-qubit crosstalk errors to fourth order while providing inherent suppression of collective dephasing errors. This approach avoids the massive physical qubit overhead of magic state distillation while maintaining high gate fidelity through tailored trajectory design and parametric optimization.", "motivation": "Fault-tolerant universal quantum computing requires high-fidelity non-Clifford $T$ gates, but conventional magic state distillation imposes prohibitive physical qubit overhead and complex feedback control. This work addresses the resource bottleneck by using geometric gate engineering to suppress raw error rates at the physical layer, reducing hardware requirements for large-scale quantum error correction.", "highlights": [ "Fourth-order suppression of Rabi frequency, detuning, and crosstalk errors", "Inherent collective dephasing error suppression without magic state distillation", "Reduced physical qubit overhead through geometric pulse engineering optimization" ], "keywords": [ { "label": "Geometric Logical $T$ Gate", "reason": "Core contribution enabling high-fidelity non-Clifford gate implementation for fault-tolerant quantum computing" }, { "label": "Decoherence-Free Subspace Encoding", "reason": "Passive error suppression technique integrated with geometric pulses to protect quantum information" }, { "label": "Composite Geometric Pulses", "reason": "Advanced pulse engineering method achieving high-order error suppression through optimized trajectory design" }, { "label": "Universal Error Suppression", "reason": "Systematic suppression of multiple noise sources including Rabi frequency, detuning, crosstalk, and dephasing" } ], "emoji": "✨", "social_summary": "Achieve high-fidelity logical T gates without magic state distillation using geometric pulses and decoherence-free subspaces for scalable quantum computing.", "highlights_oneliner": "Fourth-order error suppression for robust logical T gates" } ] }, "2026-05-01": { "word_cloud": [ { "word": "TEE", "weight": 5 }, { "word": "stabilizer", "weight": 4 }, { "word": "GKP", "weight": 5 }, { "word": "magnonic", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "girth", "weight": 4 }, { "word": "QSS", "weight": 4 }, { "word": "anonymity", "weight": 3 }, { "word": "permutation-invariant", "weight": 3 }, { "word": "bicycle", "weight": 3 }, { "word": "CSS", "weight": 4 }, { "word": "hypergraph-product", "weight": 4 }, { "word": "qudits", "weight": 3 }, { "word": "topological", "weight": 4 }, { "word": "decoding", "weight": 3 }, { "word": "bosonic", "weight": 3 }, { "word": "CPM-lift", "weight": 3 } ], "social_highlights": "Highlights: spurious TEE fix in stabilizer codes, anonymous quantum secret sharing, magnonic GKP states, high-girth quantum LDPC codes", "papers": [ { "arxiv_id": "2604.27053", "title": "Resolving spurious topological entanglement entropy in stabilizer codes", "authors": "Peilun Han, Zijian Liang, Yifei Wang, Bowen Yang, Yingfei Gu, Yu-An Chen", "arxiv_url": "https://arxiv.org/abs/2604.27053", "pdf_url": "https://arxiv.org/pdf/2604.27053", "summary": "Identifies microscopic origin of spurious topological entanglement entropy ($TEE$) in stabilizer codes and introduces concave partition for Levin-Wen $TEE$ computation free of spurious contributions. Proves this prescription works for translation-invariant prime-dimensional qudit stabilizer codes. Studies bivariate bicycle codes revealing topological frustration via cylinder circumference dependence.", "motivation": "Topological entanglement entropy is crucial for diagnosing long-range entanglement in 2D gapped phases, but spurious contributions have limited its reliability. This work provides rigorous methods to extract genuine $TEE$, essential for understanding topological quantum matter and error correction.", "highlights": [ "Concave partition eliminates spurious $TEE$", "Proof for prime-dimensional qudit codes", "Bicycle codes show topological frustration" ], "keywords": [ { "label": "Topological Entanglement Entropy", "reason": "Core diagnostic quantity addressed with spurious contribution removal" }, { "label": "Concave Partition", "reason": "Novel geometric method for accurate $TEE$ computation" }, { "label": "Bicycle Codes", "reason": "New family revealing topological frustration" }, { "label": "Qudit Stabilizers", "reason": "Generalization beyond qubits to prime dimensions" } ], "emoji": "🧭", "social_summary": "Fixes spurious topological entanglement entropy in stabilizer codes with rigorous new partition method.", "highlights_oneliner": "Spurious TEE Resolution" }, { "arxiv_id": "2604.27284", "title": "Quantum Anonymous Secret Sharing with Permutation Invariant Codes", "authors": "Varin Sikand, Andrew Nemec", "arxiv_url": "https://arxiv.org/abs/2604.27284", "pdf_url": "https://arxiv.org/pdf/2604.27284", "summary": "Constructs quantum anonymous secret sharing using permutation-invariant QEC codes and anonymous quantum transmission. Quantifies information leakage in ramp QSS via quantum conditional min-entropy linked to Knill-Laflamme conditions. Evaluates leakage properties of permutation-invariant codes.", "motivation": "Quantum secret sharing eliminates single points of failure but existing schemes reveal sender identities, compromising anonymity in applications like voting. This work enables sender-anonymous QSS crucial for coercion-resistant quantum cryptography.", "highlights": [ "Sender-anonymous QSS protocol", "Min-entropy leakage quantification", "Permutation-invariant code evaluation" ], "keywords": [ { "label": "Anonymous Secret Sharing", "reason": "Core cryptographic primitive with sender anonymity" }, { "label": "Permutation-Invariant Codes", "reason": "Special QEC codes enabling anonymity" }, { "label": "Quantum Min-Entropy", "reason": "New leakage measure for ramp QSS" }, { "label": "Knill-Laflamme Conditions", "reason": "Theoretical foundation linking leakage to QEC" } ], "emoji": "🔒", "social_summary": "Introduces anonymous quantum secret sharing using permutation-invariant codes with provable security.", "highlights_oneliner": "Anonymous QSS Protocol" }, { "arxiv_id": "2604.27565", "title": "Magnonic Gottesman-Kitaev-Preskill states", "authors": "Zi-Xu Lu, Gang Liu, Matteo Fadel, Jie Li", "arxiv_url": "https://arxiv.org/abs/2604.27565", "pdf_url": "https://arxiv.org/pdf/2604.27565", "summary": "Provides first protocol for magnonic GKP states using ellipsoidal magnetic crystal coupled to superconducting qubit via microwave cavity. Geometric anisotropy squeezes magnon mode while cavity enables conditional-displacement interaction. Demonstrates preparation of 3-4 component GKP states and full logical Pauli basis gates.", "motivation": "GKP codes offer powerful bosonic error correction avoiding qubit array overhead, but magnonic implementations were missing. Hybrid magnon-qubit systems enable new platforms for fault-tolerant quantum computing and sensing.", "highlights": [ "First magnonic GKP preparation", "Cavity-mediated qubit control", "Complete logical Pauli basis" ], "keywords": [ { "label": "Magnonic GKP", "reason": "Novel bosonic encoding platform" }, { "label": "Conditional Displacement", "reason": "Key interaction for GKP preparation" }, { "label": "Ellipsoidal Crystal", "reason": "Hardware enabling intrinsic squeezing" }, { "label": "Hybrid Magnon-Qubit", "reason": "New system architecture" } ], "emoji": "🧲", "social_summary": "Creates first magnonic GKP states for bosonic quantum error correction using hybrid magnon-qubit system.", "highlights_oneliner": "Magnonic GKP States" }, { "arxiv_id": "2604.27817", "title": "High-Girth Regular Quantum LDPC Codes from Square-Base Hypergraph Products via CPM Lifts", "authors": "Koki Okada, Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2604.27817", "pdf_url": "https://arxiv.org/pdf/2604.27817", "summary": "Constructs regular high-girth CSS hypergraph-product codes with girth 6-8 using explicit geometric base matrices. Analyzes CPM lifts identifying orthogonality-forced 8-cycles limiting girth. Presents $[[28800,62]]$ girth-8 $(3,6)$-regular code with $p=0.1402$ error rate and $<1.28\\times10^{-8}$ failure rate.", "motivation": "Quantum LDPC codes need high girth for effective belief propagation decoding, but CSS constraints limit design freedom. This work provides concrete high-performance finite-length codes bridging theory and practice.", "highlights": [ "$[[28800,62]]$ girth-8 $(3,6)$-regular code", "CPM lift analysis of 8-cycles", "$p=0.1402$ with $10^{-8}$ failure rate" ], "keywords": [ { "label": "High-Girth LDPC", "reason": "Core construction target for BP decoding" }, { "label": "Square-Base HGP", "reason": "Specific CSS construction family" }, { "label": "CPM Lifts", "reason": "Lifting technique with cycle analysis" }, { "label": "Degeneracy-Aware BP", "reason": "Advanced decoding achieving low failure rates" } ], "emoji": "🔄", "social_summary": "Builds $[[28800,62]]$ high-girth quantum LDPC code with record-low $10^{-8}$ decoding failures at 14% error.", "highlights_oneliner": "Girth-8 Quantum LDPC" } ] }, "2026-04-30": { "word_cloud": [ { "word": "multiprogramming", "weight": 5 }, { "word": "surface-code", "weight": 5 }, { "word": "floorplan", "weight": 4 }, { "word": "scheduler", "weight": 4 }, { "word": "qudits", "weight": 5 }, { "word": "qubits", "weight": 5 }, { "word": "LCU", "weight": 4 }, { "word": "product-formula", "weight": 4 }, { "word": "magic-states", "weight": 3 }, { "word": "FTQC", "weight": 4 }, { "word": "truncation", "weight": 3 }, { "word": "synthesis", "weight": 3 }, { "word": "allocation", "weight": 3 }, { "word": "admission", "weight": 3 }, { "word": "block-encoding", "weight": 3 }, { "word": "Clifford+T", "weight": 3 }, { "word": "code-switching", "weight": 2 }, { "word": "scalability", "weight": 2 }, { "word": "throughput", "weight": 2 } ], "social_highlights": "Highlights: FTQC multiprogramming scheduler boosts speedup 3.1x, qudit-qubit resource comparison reveals LCU savings opportunities.", "papers": [ { "arxiv_id": "2604.25976", "title": "No Tile Left Behind: Multiprogramming for Surface-Code Architectures", "authors": "Archisman Ghosh, Avimita Chatterjee, Swaroop Ghosh", "arxiv_url": "https://arxiv.org/abs/2604.25976", "pdf_url": "https://arxiv.org/pdf/2604.25976", "summary": "Develops a formal framework for FTQC multiprogramming on surface-code architectures accounting for data tiles, ancilla tiles, and magic-state resources. Formulates static allocation, extends to online scheduling and cultivation-enabled setups. Achieves 3.1x normalized system speedup on Clifford+$T$ workloads, improving 29% over baselines.", "motivation": "As FTQC scales to hundreds of logical qubits by decade's end, cloud providers must address multiprogramming on structured surface-code floorplans differing from NISQ topologies. This matters for maximizing physical qubit utilization amid admission fragmentation, resource contention, and QoS challenges.", "highlights": [ "3.1x normalized system speedup", "29% improvement over baselines", "Hierarchy-aware scheduling policies" ], "keywords": [ { "label": "surface-code floorplan", "reason": "Core hardware abstraction with data, ancilla, and magic-state tiles driving placement challenges" }, { "label": "multiprogramming", "reason": "Key problem of concurrent FTQC job execution beyond NISQ scheduling" }, { "label": "magic-state cultivation", "reason": "Dynamic resource generation in extended architectures" }, { "label": "admission control", "reason": "Online workload decisions preventing floorplan fragmentation" } ], "emoji": "🗂", "social_summary": "New scheduler achieves 3.1x speedup for multiprogramming on surface-code quantum architectures.", "highlights_oneliner": "FTQC Multiprogramming Scheduler" }, { "arxiv_id": "2604.26792", "title": "Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators", "authors": "Samuel Godwood, Doğa Murat Kürkçüoğlu, Gabriel N. Perdue, Marina Maneyro, Alessandro Roggero", "arxiv_url": "https://arxiv.org/abs/2604.26792", "pdf_url": "https://arxiv.org/pdf/2604.26792", "summary": "Compares non-Clifford gate costs for quadratic diagonal evolutions like $U=e^{-it \\phi_x^2}$ using logical $d$-qudits vs. $n_b=\\lceil \\log_2 d \\rceil$ qubits in product-formula and LCU settings. Derives finite-$d$ break-even conditions for qudit $SU(2)$ synthesis costs. Identifies LCU regions with qudit constant-factor savings up to $d\\lesssim 21$.", "motivation": "Lattice field theory simulations require finite Hilbert-space truncations motivating qudits, but fault-tolerant advantages over qubits for diagonal operators remain unclear. Matters for optimizing quantum algorithms in scalar fields and gauge theories where modest $d$ like 3-8 suffice.", "highlights": [ "LCU qudit savings up to $d=19$", "Finite-$d$ synthesis break-even", "No asymptotic qudit advantage" ], "keywords": [ { "label": "qudit encodings", "reason": "Native $d$-level systems for truncated bosonic modes" }, { "label": "LCU simulation", "reason": "Promising regime for potential qudit resource wins" }, { "label": "non-Clifford cost", "reason": "Metric comparing $T$-gate synthesis overheads" }, { "label": "code-switching", "reason": "Idealized model enabling hybrid qubit-qudit savings" } ], "emoji": "⚙️", "social_summary": "Qudit encodings yield LCU resource savings over qubits for quantum field simulations up to modest dimensions.", "highlights_oneliner": "Qudit vs Qubit Resource Comparison" } ] }, "2026-04-29": { "word_cloud": [ { "word": "stabilizer codes", "weight": 5 }, { "word": "surface code", "weight": 4 }, { "word": "decoding", "weight": 4 }, { "word": "fault-tolerance", "weight": 5 }, { "word": "LDPC codes", "weight": 4 }, { "word": "logical operations", "weight": 3 }, { "word": "topological codes", "weight": 3 }, { "word": "syndrome measurement", "weight": 3 }, { "word": "noise threshold", "weight": 3 }, { "word": "magic states", "weight": 3 }, { "word": "lattice surgery", "weight": 3 }, { "word": "dynamical decoupling", "weight": 2 }, { "word": "resource overhead", "weight": 3 }, { "word": "circuit compilation", "weight": 2 }, { "word": "entanglement", "weight": 2 }, { "word": "qubit connectivity", "weight": 2 }, { "word": "erasure noise", "weight": 2 }, { "word": "Clifford gates", "weight": 2 } ], "social_highlights": "Highlights: Quantum spatial distribution enables resilient error correction with stacking flexibility, mid-circuit measurement error mitigation reduces logical error rates by 80%, defect-adaptive lattice surgery executes operations on irregular surface codes, Pauli stabilizer codes classified via algebraic L-theory, networked QLDPC implementations balance overhead and performance, graph-aware bounded distance decoder unifies CSS and non-CSS codes, mixed-dimensional quantum codes extend MacWilliams theory, stabilizer-based compilation circumvents hardware constraints, magic-state injection protocols reduce error by 22×, universally robust dynamical decoupling proven to order $n$.", "papers": [ { "arxiv_id": "2604.25747", "title": "Quantum Error Correction Exploiting Quantum Spatial Distribution and Gauge Symmetry", "authors": "Ryo Asaka", "arxiv_url": "https://arxiv.org/abs/2604.25747", "pdf_url": "https://arxiv.org/pdf/2604.25747", "summary": "This work demonstrates that gauge symmetry within stabilizer formalism provides resilience against three types of noise (spin decoherence, position decoherence, and dephasing) in quantum spatial distribution (QSD) architectures using $3+2$ particles encoding Shor's nine-qubit code. Quantum spatial distribution offers architectural flexibility enabling vertical and horizontal stacking of error-correcting systems with only nearest-neighbor and next-nearest-neighbor interactions. The framework unifies noise models and proves correctability while maintaining reduced circuit depth overhead.", "motivation": "Quantum error correction requires scalable architectures with minimal connectivity constraints. Traditional approaches struggle with long-range interactions; this work leverages particle superposition in both spin and position states to achieve fault-tolerance with local interactions, advancing toward practical large-scale quantum processors.", "highlights": [ "Gauge symmetry suppresses three noise types in QSD-based codes", "Stacking flexibility enables vertical and horizontal scaling with local interactions", "Shor's nine-qubit code implemented with $3+2$ particles on nested squares" ], "keywords": [ { "label": "Quantum Spatial Distribution", "reason": "Core innovation: superposition of spin and position states for encoding logical information" }, { "label": "Gauge Symmetry", "reason": "Provides noise resilience against decoherence and dephasing in QSD architectures" }, { "label": "Stabilizer Formalism", "reason": "Mathematical framework extended to characterize error-correcting properties in mixed-state systems" }, { "label": "Shor's Nine-Qubit Code", "reason": "Specific code implementation demonstrating the QSD and gauge symmetry approach" } ], "emoji": "🌀", "social_summary": "Exploit quantum spatial distribution and gauge symmetry to achieve fault-tolerant error correction with local-only interactions and flexible scaling.", "highlights_oneliner": "QSD and gauge symmetry enable scalable local-interaction codes" }, { "arxiv_id": "2604.25863", "title": "MCMit: Mid-Circuit Measurement Error Mitigation", "authors": "Emmanouil Giortamis, Felix Gust, Aleksandra Świerkowska, Sandra Stankovic, Innocenzo Fulginiti, Yanbin Chen, Xiaorang Guo, Benjamin Lienhard, Martin Schulz, Pramod Bhatotia", "arxiv_url": "https://arxiv.org/abs/2604.25863", "pdf_url": "https://arxiv.org/pdf/2604.25863", "summary": "MCMit introduces a hardware-software co-design addressing mid-circuit measurement (MCM) errors in distributed quantum computing and QEC by reducing feedback latency by up to $70\\%$ and achieving $37$-$73\\%$ higher discriminator accuracy for short measurement durations. The framework combines a constant-latency multi-control branch instruction, transformer and CNN-based qubit-state discriminators, static MCM elimination, and stochastic branching to mitigate branching and latency-induced errors. Circuit depths improve by up to $7\\times$ with logical error rates reduced by up to $80\\%$ in QEC.", "motivation": "Mid-circuit measurements are critical for dynamic circuits in distributed quantum computing and error correction but suffer from high error rates and latency-induced decoherence. Current hardware controllers and software techniques fail to address these challenges holistically, creating a major bottleneck for practical fault-tolerant quantum systems.", "highlights": [ "Feedback latency reduced by $70\\%$ via constant-latency branch instruction", "CNN discriminator achieves $37$-$73\\%$ higher accuracy for short measurement durations", "Logical error rates in QEC reduced by up to $80\\%$" ], "keywords": [ { "label": "Mid-Circuit Measurement", "reason": "Core bottleneck addressed: high error rates and latency in dynamic quantum circuits" }, { "label": "Hardware-Software Co-Design", "reason": "Integrated approach combining branch instruction, discriminators, and software mitigation" }, { "label": "Qubit-State Discriminator", "reason": "ML-based (transformer and CNN) components for accurate measurement outcome classification" }, { "label": "Dynamic Circuits", "reason": "Application domain: distributed quantum computing and QEC requiring real-time feedback" } ], "emoji": "⚡", "social_summary": "Mitigate mid-circuit measurement errors with hardware-software co-design, reducing logical error rates by 80% in quantum error correction.", "highlights_oneliner": "Hardware-software co-design cuts measurement errors by 80%" }, { "arxiv_id": "2604.25524", "title": "Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches", "authors": "GunSik Min, Yujin Kang, Jun Heo", "arxiv_url": "https://arxiv.org/abs/2604.25524", "pdf_url": "https://arxiv.org/pdf/2604.25524", "summary": "This work formulates the seam-boundary defect problem and introduces defect-adaptive lattice-surgery methods that reconstruct target joint logical parity from seam-related measurements on irregular merged patches using GF$(2)$ binary-support synthesis. The framework accommodates boundary data-qubit defects, seam-check ancilla defects, and gauge-inferred seam super-checks, achieving improved compile yield and preserved effective distance with modest success-conditioned logical-error overhead relative to defect-free references.", "motivation": "Surface codes are leading candidates for fault-tolerant quantum computing due to local connectivity and high thresholds, but real hardware contains fabrication defects and component failures. Prior work solved patch adaptation; this work addresses the complementary problem of executing logical operations reliably on irregular geometries.", "highlights": [ "Seam-parity synthesis via GF$(2)$ feasibility problem for irregular merged patches", "Accommodates boundary defects, ancilla defects, and gauge-inferred super-checks", "Improved compile yield with preserved effective distance on defective hardware" ], "keywords": [ { "label": "Lattice Surgery", "reason": "Standard low-overhead method for logical operations on surface codes" }, { "label": "Defect-Adaptive Methods", "reason": "Techniques for handling fabrication defects and component failures in real hardware" }, { "label": "Surface Code", "reason": "Leading topological code with 2D nearest-neighbor connectivity and high threshold" }, { "label": "Parity Synthesis", "reason": "GF$(2)$ formulation for reconstructing logical parity on irregular geometries" } ], "emoji": "🧩", "social_summary": "Execute logical operations on defective surface-code patches via certified parity synthesis, enabling fault-tolerant computation on real hardware.", "highlights_oneliner": "Defect-adaptive lattice surgery on irregular surface codes" }, { "arxiv_id": "2604.24847", "title": "The Classification of Pauli Stabilizer Codes: A Lattice and Continuum Treatise", "authors": "Bowen Yang, Matthew Yu", "arxiv_url": "https://arxiv.org/abs/2604.24847", "pdf_url": "https://arxiv.org/pdf/2604.24847", "summary": "This work classifies mobile Pauli stabilizer codes up to gapped interfaces and coarse-graining using algebraic L-theory over Laurent polynomial rings, establishing a bulk-boundary correspondence where equivalence classes are described by Clifford quantum cellular automata (QCA) in one dimension higher. The framework reveals a close structural relationship between lattice stabilizer codes and continuum topological quantum field theories (TQFTs), with subtle differences highlighting distinctions between lattice and continuum theories.", "motivation": "Pauli stabilizer codes are fundamental to quantum error correction and condensed matter physics, but their classification and relationship to continuum theories remained incomplete. Understanding this connection is essential for developing new code families and leveraging topological insights for fault-tolerant quantum computation.", "highlights": [ "Classification via algebraic L-theory over Laurent polynomial rings $\\mathbb{Z}/p[x_1^{\\pm 1}, \\ldots, x_n^{\\pm 1}]$", "Bulk-boundary correspondence: stabilizer codes equivalent to Clifford QCA in higher dimension", "Reveals structural relationship between lattice codes and continuum TQFTs" ], "keywords": [ { "label": "Pauli Stabilizer Codes", "reason": "Central object: commuting Pauli operator subgroups defining error-correcting codes" }, { "label": "Algebraic L-Theory", "reason": "Mathematical framework for classification using perfect chain complexes and quadratic functors" }, { "label": "Topological Quantum Field Theory", "reason": "Continuum counterpart revealing connections to condensed matter physics and topological excitations" }, { "label": "Clifford QCA", "reason": "Bulk-boundary correspondence tool: quantum cellular automata describing code equivalence classes" } ], "emoji": "🗂️", "social_summary": "Classify Pauli stabilizer codes using algebraic L-theory, revealing deep connections to topological quantum field theories.", "highlights_oneliner": "Algebraic L-theory classification of stabilizer codes" }, { "arxiv_id": "2604.25026", "title": "Networked Realization of Quantum LDPC Codes", "authors": "Swayangprabha Shaw, Narayanan Rengaswamy", "arxiv_url": "https://arxiv.org/abs/2604.25026", "pdf_url": "https://arxiv.org/pdf/2604.25026", "summary": "This work proposes and evaluates networked implementations of quantum LDPC codes, specifically bivariate bicycle codes, where each node holds one or few qubits and long-range stabilizers are implemented via teleported CNOTs with variable Bell pair fidelity. Using balanced min-cut partitioning on combined X-Z Tanner graphs and circuit-level noise simulations with BP-OSD decoding, the study provides first insights into networked QLDPC realizations and compares performance with monolithic implementations.", "motivation": "Quantum LDPC codes promise low-overhead fault-tolerant quantum computing but require non-local stabilizers and frequent qubit movement. Networked implementations distribute qubits across nodes with entanglement-based connectivity, offering a practical alternative for distributed quantum computing architectures.", "highlights": [ "Networked bivariate bicycle codes with balanced min-cut partitioning on Tanner graphs", "Teleported CNOT implementation with variable Bell pair fidelity for long-range stabilizers", "Circuit-level noise analysis comparing networked vs. monolithic QLDPC performance" ], "keywords": [ { "label": "Quantum LDPC Codes", "reason": "Low-density parity-check codes with good parameters for low-overhead fault-tolerant computing" }, { "label": "Bivariate Bicycle Codes", "reason": "Specific QLDPC family with controlled long-range connections and surface-code similarity" }, { "label": "Networked Implementation", "reason": "Distributed architecture where each node holds few qubits connected via entanglement" }, { "label": "Teleported CNOT", "reason": "Technique for implementing long-range stabilizer checks using Bell pairs" } ], "emoji": "🌐", "social_summary": "Implement quantum LDPC codes across distributed networks using teleported CNOTs, enabling practical low-overhead fault-tolerant quantum computing.", "highlights_oneliner": "Networked quantum LDPC codes via teleported CNOTs" }, { "arxiv_id": "2604.25424", "title": "A graph-aware bounded distance decoder for all stabilizer codes", "authors": "Harikrishnan K J, Amit Kumar Pal", "arxiv_url": "https://arxiv.org/abs/2604.25424", "pdf_url": "https://arxiv.org/pdf/2604.25424", "summary": "This work formulates a unified bounded distance decoding strategy applicable to all stabilizer codes (CSS and non-CSS families) using local Clifford equivalence between stabilizer states and graph states. The framework treats decoding as an adaptable generalization of maximum likelihood decoding with strategic pruning via feed-forward network structure, achieving satisfactory performance on optimal non-CSS codes up to distance $d=11$ and near-optimal decoding for color and surface codes under depolarizing and bit-flip errors.", "motivation": "Optimal decoding for stabilizer codes is $\\#P$-complete, creating a computational bottleneck for fault-tolerant quantum computing. Existing decoders are specialized to specific code families; a unified approach applicable to all stabilizer codes would accelerate progress toward practical fault-tolerant systems.", "highlights": [ "Unified bounded distance decoder for CSS and non-CSS stabilizer codes", "Graph-aware pruning reduces search space and runtime via feed-forward network structure", "Near-optimal performance on color and surface codes; satisfactory on non-CSS codes up to $d=11$" ], "keywords": [ { "label": "Bounded Distance Decoding", "reason": "Decoding strategy correcting all errors with weights upper bounded by target weight" }, { "label": "Graph States", "reason": "Graphical representation of stabilizers enabling unified treatment of CSS and non-CSS codes" }, { "label": "Stabilizer Codes", "reason": "Universal code family including surface codes, color codes, and non-CSS codes" }, { "label": "QGDecoder Library", "reason": "Open-source implementation enabling graph-aware bounded distance decoding for arbitrary stabilizer codes" } ], "emoji": "📊", "social_summary": "Unified graph-aware decoder for all stabilizer codes, achieving near-optimal performance on surface and color codes.", "highlights_oneliner": "Graph-aware decoder unifies CSS and non-CSS codes" }, { "arxiv_id": "2604.25790", "title": "The mixed-dimensional quantum MacWilliams identity: bounds for codes and absolutely maximally entangled states in heterogeneous systems", "authors": "David González-Lociga, Simeon Ball", "arxiv_url": "https://arxiv.org/abs/2604.25790", "pdf_url": "https://arxiv.org/pdf/2604.25790", "summary": "This work extends quantum error correction theory to mixed-dimensional Hilbert spaces by introducing dimension multisets to replace scalar weights, establishing the mixed-dimensional quantum MacWilliams identity relating Shor-Laflamme and unitary weight enumerators. The framework derives generalized quantum Hamming, Singleton, and Scott bounds via linear programming, revealing that pure mixed-dimensional codes are forced to be impure when maximizing encodable dimension—a departure from homogeneous systems.", "motivation": "Emerging quantum architectures integrate qubits for logic with higher-dimensional qudits for robust communication and memory. Traditional QEC theory assumes constant local dimension; extending it to heterogeneous systems is essential for designing practical quantum networks and distributed quantum computers.", "highlights": [ "Mixed-dimensional quantum MacWilliams identity via dimension multisets", "Tighter Singleton bound for pure mixed-dimensional codes with no homogeneous analogue", "Linear program for systematic evaluation of heterogeneous code parameters" ], "keywords": [ { "label": "Mixed-Dimensional Codes", "reason": "QEC codes in heterogeneous Hilbert spaces combining qubits and higher-dimensional qudits" }, { "label": "MacWilliams Identity", "reason": "Algebraic relationship between weight enumerators extended to mixed-dimensional systems" }, { "label": "Absolutely Maximally Entangled States", "reason": "AME states in mixed-dimensional spaces characterized via shadow inequalities and combinatorial methods" }, { "label": "Dimension Multisets", "reason": "Novel metric replacing scalar weights to capture physical composition of error supports" } ], "emoji": "🎯", "social_summary": "Extend quantum error correction to mixed-dimensional systems with new MacWilliams identity, enabling heterogeneous quantum networks.", "highlights_oneliner": "Mixed-dimensional quantum codes via MacWilliams identity" }, { "arxiv_id": "2604.25042", "title": "Stabilizers for Compiling Logical Circuits under Hardware Constraints", "authors": "Jack Weinberg, Narayanan Rengaswamy", "arxiv_url": "https://arxiv.org/abs/2604.25042", "pdf_url": "https://arxiv.org/pdf/2604.25042", "summary": "This work leverages error-correcting code redundancy to enable flexible quantum circuit compilation by treating compilation as a least squares problem over logically equivalent operators in the special unitary group. The framework allows circumventing costly swap gates by realizing logical targets through distinct physical Hamiltonians natively accessible on hardware, with explicit solutions for the $[[4,2,2]]$ code and connections to compressed sensing for efficient compilation.", "motivation": "Quantum circuit compilation must satisfy both fault-tolerance requirements (error correction) and hardware constraints (limited connectivity and native gates). Current approaches treat these problems separately; integrating them via code redundancy enables more efficient compilation with reduced overhead.", "highlights": [ "Least squares formulation for compilation-ideal logically equivalent operator selection", "Circumvent costly swaps by accessing natively available physical Hamiltonians", "Closed-form solution for $[[4,2,2]]$ code with connections to compressed sensing" ], "keywords": [ { "label": "Logical Equivalence", "reason": "Redundancy in error-correcting codes renders physically distinct operators logically indistinguishable" }, { "label": "Hardware Constraints", "reason": "Limited connectivity and native gate sets requiring compilation optimization" }, { "label": "Least Squares Compilation", "reason": "Mathematical framework for selecting compilation-ideal logically equivalent operators" }, { "label": "Special Unitary Group", "reason": "Mathematical setting for general treatment of quantum gate compilation" } ], "emoji": "🔧", "social_summary": "Leverage code redundancy to compile logical circuits efficiently, circumventing hardware constraints via logically equivalent operators.", "highlights_oneliner": "Stabilizer-based compilation bypasses hardware constraints" }, { "arxiv_id": "2604.25094", "title": "INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures", "authors": "Sayam Sethi, Sahil Khan, Aditi Awasthi, Abhinav Anand, Jonathan Mark Baker", "arxiv_url": "https://arxiv.org/abs/2604.25094", "pdf_url": "https://arxiv.org/pdf/2604.25094", "summary": "INJEQT proposes a $2$-factory design for resource-state injection in extractor-based architectures using an auxiliary code to synthesize $R_z(\\theta)$ states with lower error rates, reducing overall error by up to $22\\times$ and wall-clock time by up to $13\\times$ through parallel pre-fetching. The framework evaluates multiple state preparation techniques (distillation, cultivation, STAR) and injection models (lattice surgery, transversal CNOT), achieving space-time cost reduction up to $7.2\\times$ for optimal factory choices.", "motivation": "Extractor-based architectures enable universal quantum computation on spatially-efficient QLDPC codes but suffer from high error rates in magic-state injection, which dominates the error budget. Reducing this bottleneck is critical for practical fault-tolerant quantum computing with efficient resource utilization.", "highlights": [ "Two-factory design reduces error rates by up to $22\\times$ for cultivation factories", "Parallel pre-fetching improves wall-clock time by up to $13\\times$", "Space-time cost reduction up to $7.2\\times$ across distillation, cultivation, and STAR protocols" ], "keywords": [ { "label": "Magic-State Injection", "reason": "Bottleneck operation in extractor architectures requiring expensive inter-module measurements" }, { "label": "Extractor Architecture", "reason": "FTQC design enabling universal computation on spatially-efficient BB code family" }, { "label": "$R_z$ State Synthesis", "reason": "Resource state preparation for non-Clifford gate implementation via auxiliary code" }, { "label": "Parallel Pre-Fetching", "reason": "Optimization strategy preparing correction states in parallel with ongoing operations" } ], "emoji": "✨", "social_summary": "Reduce magic-state injection error by 22× in extractor architectures via two-factory design and parallel pre-fetching.", "highlights_oneliner": "Magic-state injection error reduced 22×" }, { "arxiv_id": "2604.25807", "title": "Proof of the Error Scaling for Universally Robust Dynamical Decoupling Sequences", "authors": "Domenico D'Alessandro, Phattharaporn Singkanipa, Daniel Lidar", "arxiv_url": "https://arxiv.org/abs/2604.25807", "pdf_url": "https://arxiv.org/pdf/2604.25807", "summary": "This work provides a rigorous mathematical proof that universally robust dynamical decoupling (UR$n$) sequences achieve $O(\\varepsilon^n)$ error scaling for even $n$ by deriving necessary and sufficient conditions for coefficient cancellation in a fidelity series expansion. The proof reveals the combinatorial and root-of-unity structure underlying high-order robustness, reducing the cancellation mechanism to Fourier-type identities and establishing UR$n$ construction on firm analytical grounds.", "motivation": "Dynamical decoupling protects quantum systems from environmental noise and control imperfections, but realistic implementations suffer from pulse errors. Universally robust DD sequences compensate these errors with high-order suppression, but their claimed error scaling lacked rigorous proof despite experimental validation.", "highlights": [ "Rigorous proof of $O(\\varepsilon^n)$ error scaling for UR$n$ sequences with even $n$", "Necessary and sufficient conditions for coefficient cancellation via Taylor expansion", "Combinatorial and root-of-unity structure underlying high-order robustness" ], "keywords": [ { "label": "Dynamical Decoupling", "reason": "Control technique using refocusing pulses to average out unwanted system-environment couplings" }, { "label": "Universally Robust Sequences", "reason": "UR$n$ construction compensating arbitrary pulse imperfections with linear pulse overhead" }, { "label": "Error Scaling", "reason": "Proven $O(\\varepsilon^n)$ suppression of fidelity error with respect to pulse imperfection parameter" }, { "label": "Pulse Imperfections", "reason": "Flip-angle and detuning errors in realistic DD implementations addressed by UR construction" } ], "emoji": "⏱️", "social_summary": "Rigorously prove universally robust dynamical decoupling achieves $O(\\varepsilon^n)$ error scaling via combinatorial structure.", "highlights_oneliner": "Rigorous proof of UR$n$ error scaling" } ] }, "2026-04-28": { "word_cloud": [ { "word": "decoding", "weight": 5 }, { "word": "tensor", "weight": 4 }, { "word": "shuttling", "weight": 4 }, { "word": "diffusion", "weight": 4 }, { "word": "mitigation", "weight": 5 }, { "word": "ZNE", "weight": 4 }, { "word": "transfer", "weight": 4 }, { "word": "QLDPC", "weight": 5 }, { "word": "belief", "weight": 3 }, { "word": "GBP", "weight": 3 }, { "word": "spin", "weight": 3 }, { "word": "posterior", "weight": 3 }, { "word": "telemetry", "weight": 3 }, { "word": "bounded", "weight": 3 }, { "word": "few-shot", "weight": 3 }, { "word": "bandit", "weight": 3 }, { "word": "bicycle", "weight": 2 } ], "social_highlights": "Highlights: GBP tensor contraction, quantum decoders for optimization, QLDPC on spin chips, diffusion QEC decoding, adaptive mitigation, bounded ZNE, cross-device transfer.", "papers": [ { "arxiv_id": "2604.24760", "title": "Contracting Tensor Networks with Generalized Belief Propagation", "authors": "Joseph Tindall, Grace M. Sommers, Hilbert Kappen", "arxiv_url": "https://arxiv.org/abs/2604.24760", "pdf_url": "https://arxiv.org/pdf/2604.24760", "summary": "Applies generalized belief propagation (GBP) with hierarchical overlapping regions to approximately contract tensor networks efficiently. Implements GBP for various region choices on 2D/3D infinite/finite networks, solving fixed-point equations numerically and analytically. Demonstrates applications including Ising model partition functions, ice model degeneracies, and AKLT state observables.", "motivation": "Tensor network contraction is computationally intensive for large quantum systems, limiting simulations of complex models. GBP extends classical belief propagation to provide scalable approximations with hierarchical message passing for higher accuracy.", "highlights": [ "GBP as hierarchical BP extension", "5x faster than exact contraction", "AKLT state norm evaluation" ], "keywords": [ { "label": "GBP", "reason": "core hierarchical message-passing algorithm" }, { "label": "tensor networks", "reason": "contraction target for quantum simulations" }, { "label": "Ising model", "reason": "benchmark for frustrated systems" }, { "label": "ice models", "reason": "3D degeneracy computation application" } ], "emoji": "🔗", "social_summary": "Unlocks efficient tensor network contraction using hierarchical belief propagation!", "highlights_oneliner": "Hierarchical tensor contraction" }, { "arxiv_id": "2604.24633", "title": "Optimization Using Locally-Quantum Decoders", "authors": "Noah Shutty, Avijit Mandal, Seyoon Ragavan, Quentin Buzet, André Chailloux, Nicholas C. Rubin, Abid Khan, Sami Boulebnane, Ruslan Shaydulin, John Azariah, Stephen P. Jordan", "arxiv_url": "https://arxiv.org/abs/2604.24633", "pdf_url": "https://arxiv.org/pdf/2604.24633", "summary": "Develops locally-quantum decoders for classical LDPC codes under coherent bit-flip superpositions, outperforming classical BP on $D$-regular max-$k$-XORSAT. Achieves better approximate optima than Prange's algorithm and simulated annealing for certain $(k,D)$. Identifies enhancements tying quantum decoder performance to improved classical baselines.", "motivation": "Quantum advantage for unstructured optimization like max-XORSAT remains elusive despite structured successes. LDPC decoding reductions enable testing quantum decoders against strong classical baselines like BP.", "highlights": [ "Outperforms classical BP on XORSAT", "Beats Prange/simulated annealing", "Precise quantum-classical tie" ], "keywords": [ { "label": "locally-quantum decoding", "reason": "intrinsic quantum LDPC decoder" }, { "label": "max-k-XORSAT", "reason": "optimization benchmark problem" }, { "label": "DQI", "reason": "quantum algorithm framework" }, { "label": "Gallager ensemble", "reason": "average-case instance source" } ], "emoji": "⚡", "social_summary": "Quantum decoders beat classical on XORSAT optimization problems!", "highlights_oneliner": "Quantum XORSAT decoders" }, { "arxiv_id": "2604.24739", "title": "CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling", "authors": "Jason D. Chadwick, Frederic T. Chong", "arxiv_url": "https://arxiv.org/abs/2604.24739", "pdf_url": "https://arxiv.org/pdf/2604.24739", "summary": "Tailors syndrome circuits for shuttling noise, extending feasible range 5-10x for QLDPC implementation on spin qubits. Develops Q-SIPP robotics-inspired scheduling achieving 86% faster schedules than hand-optimized. Identifies QLDPC families surpassing surface codes by orders of magnitude in efficiency and error rates.", "motivation": "Surface codes limit scalability due to high qubit overhead despite hardware compatibility. QLDPC codes promise superior rates but require non-local connectivity challenging for 2D spin arrays.", "highlights": [ "86% faster QLDPC scheduling", "5-10x shuttling range extension", "$[[144,12,12]]$ beats surface code" ], "keywords": [ { "label": "QLDPC", "reason": "high-rate code family implemented" }, { "label": "spin qubits", "reason": "shuttling hardware platform" }, { "label": "Q-SIPP", "reason": "path-planning scheduler" }, { "label": "bivariate bicycle", "reason": "superior code family" } ], "emoji": "🚌", "social_summary": "Runs QLDPC codes 100x better than surface code on spin chips!", "highlights_oneliner": "QLDPC spin qubit scheduling" }, { "arxiv_id": "2604.24640", "title": "DiffQEC: A versatile diffusion model for quantum error correction", "authors": "Tianyi Xu, Qinglong Liu, Maolin Wang, Fei Zhang, Zhe Zhao, Yang Wang, Ye Wei", "arxiv_url": "https://arxiv.org/abs/2604.24640", "pdf_url": "https://arxiv.org/pdf/2604.24640", "summary": "Introduces DiffQEC diffusion model recasting decoding as posterior inference via discrete denoising of syndrome histories. Reduces logical errors 10.2% vs MWPM, 5% vs tensor-network on Google hardware up to $d=17$. Provides confidence estimates and error structure visualization beyond single corrections.", "motivation": "Standard decoders discard rich posterior uncertainty crucial for confidence and analysis in large-scale QEC. Diffusion models naturally model stochastic error accumulation matching syndrome spatiotemporal correlations.", "highlights": [ "10.2% logical error reduction", "Posterior confidence estimates", "Works to distance $d=17$" ], "keywords": [ { "label": "diffusion model", "reason": "generative posterior decoder" }, { "label": "syndrome history", "reason": "spatiotemporal input processing" }, { "label": "post-selection", "reason": "confidence-based filtering" }, { "label": "saliency maps", "reason": "error visualization tool" } ], "emoji": "🎲", "social_summary": "Diffusion models cut QEC errors 10% on real quantum hardware!", "highlights_oneliner": "Diffusion QEC decoder" }, { "arxiv_id": "2604.24551", "title": "GSC-QEMit: A Telemetry-Driven Hierarchical Forecast-and-Bandit Framework for Adaptive Quantum Error Mitigation", "authors": "Steven Szachara, Sheeraja Rajakrishnan, Dylan Jay Van Allen, Jason Pollack, Travis Desell, Daniel Krutz", "arxiv_url": "https://arxiv.org/abs/2604.24551", "pdf_url": "https://arxiv.org/pdf/2604.24551", "summary": "Presents GSC-QEMit framework combining GHSOM clustering, Gaussian-process forecasting, and contextual bandits for adaptive QEM under drift. Improves logical fidelity +9.0% across workloads while cutting heavy interventions 35%. Transfers policies across GHZ/QFT/Grover without circuit tuning.", "motivation": "Static QEM wastes compute on benign noise and underperforms during spikes in nonstationary NISQ environments. Adaptive frameworks need context-aware selection across mitigation strengths balancing fidelity-cost.", "highlights": [ "+9.0% average fidelity gain", "35% fewer heavy interventions", "Zero-shot workload transfer" ], "keywords": [ { "label": "GSC-QEMit", "reason": "complete adaptive framework" }, { "label": "contextual bandit", "reason": "mitigation action selector" }, { "label": "GHSOM", "reason": "telemetry clustering method" }, { "label": "nonstationary noise", "reason": "target drift regime" } ], "emoji": "📊", "social_summary": "Adaptive QEM boosts fidelity 9% by smartly choosing mitigations!", "highlights_oneliner": "Adaptive error mitigation" }, { "arxiv_id": "2604.24475", "title": "Improving Zero-Noise Extrapolation via Physically Bounded Models", "authors": "Andriy Miranskyy, Adam Sorrenti, Jasmine Thind, Claude Gravel", "arxiv_url": "https://arxiv.org/abs/2604.24475", "pdf_url": "https://arxiv.org/pdf/2604.24475", "summary": "Introduces physically bounded polynomial/exponential ZNE models constraining zero-noise estimates to $[-1,1]$ observable range. Reduces unphysical predictions across 3.6M experiments, stabilizing exponential-family fits. Hardware validation confirms reliability on GHZ/W-state circuits.", "motivation": "Unconstrained ZNE models produce physically impossible predictions outside observable bounds, especially with limited noise levels. Bounded parameterization ensures realistic extrapolations without workflow changes.", "highlights": [ "Eliminates unphysical predictions", "Stabilizes exponential models", "Hardware-validated reliability" ], "keywords": [ { "label": "ZNE", "reason": "primary mitigation technique" }, { "label": "bounded models", "reason": "physically constrained fitting" }, { "label": "exponential-family", "reason": "stabilized extrapolation" }, { "label": "3.6M experiments", "reason": "large-scale benchmark" } ], "emoji": "📈", "social_summary": "Physically bounded ZNE prevents impossible predictions!", "highlights_oneliner": "Bounded ZNE models" }, { "arxiv_id": "2604.24397", "title": "Few-Shot Cross-Device Transfer for Quantum Noise Modeling on Real Hardware", "authors": "Sahil Al Farib, Sheikh Redwanul Islam, Azizur Rahman Anik", "arxiv_url": "https://arxiv.org/abs/2604.24397", "pdf_url": "https://arxiv.org/pdf/2604.24397", "summary": "Demonstrates few-shot transfer of noise models between IBM devices, with $K=20$ samples recovering 34.9% of in-domain performance vs zero-shot. Ablations identify CX gate error as primary cross-device mismatch source. Provides real-hardware dataset for benchmarking transfer learning.", "motivation": "Device-specific noise prevents universal mitigation; per-device training is calibration-intensive. Few-shot transfer adapts source-trained models to targets with minimal data, enabling scalable deployment.", "highlights": [ "28.6% KL improvement at $K=20$", "CX gates cause main mismatch", "Real IBM hardware dataset" ], "keywords": [ { "label": "few-shot transfer", "reason": "cross-device adaptation paradigm" }, { "label": "KL divergence", "reason": "transfer performance metric" }, { "label": "CX gate error", "reason": "primary mismatch source" }, { "label": "residual network", "reason": "noise modeling architecture" } ], "emoji": "🔄", "social_summary": "Few-shot learning adapts quantum noise models across devices!", "highlights_oneliner": "Cross-device noise transfer" } ] }, "2026-04-27": { "word_cloud": [ { "word": "stabilizer", "weight": 5 }, { "word": "scheduling", "weight": 4 }, { "word": "distributed", "weight": 4 }, { "word": "color", "weight": 5 }, { "word": "DIQKD", "weight": 3 }, { "word": "CHSH", "weight": 3 }, { "word": "Cascade", "weight": 3 }, { "word": "simulation", "weight": 5 }, { "word": "noisy", "weight": 4 }, { "word": "Pauli", "weight": 4 }, { "word": "decoherence", "weight": 4 }, { "word": "topological", "weight": 5 }, { "word": "negativity", "weight": 4 }, { "word": "seam", "weight": 3 }, { "word": "Bell", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "toric", "weight": 4 }, { "word": "mixed", "weight": 4 } ], "social_highlights": "Highlights: boundary-aware scheduling boosts distributed QEC, Cascade error correction analyzed in DIQKD, analytical simulation of noisy stabilizers, decohered color code reveals mixed topological order.", "papers": [ { "arxiv_id": "2604.22471", "title": "Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction", "authors": "Sanidhya Gupta, Sanidhay Bhambay, Narges Alavisamani, Neil Walton, Thirupathaiah Vasantam", "arxiv_url": "https://arxiv.org/abs/2604.22471", "pdf_url": "https://arxiv.org/pdf/2604.22471", "summary": "Develops scheduling policies SS-$\\tau$ and AST for seam stabilizers in distributed triangular color codes, reducing remote-operation overhead from heralded Bell pairs. Evaluates under circuit-level noise in Stim, showing lower logical error rates than Measure-All baseline. Achieves fault-tolerant scaling for $p=10^{-3}$ in relevant entanglement generation rate regimes.", "motivation": "Monolithic QPU architectures limit scalability, necessitating modular distributed quantum error correction with photonic interconnects. Seam boundaries introduce costly non-local checks, making standard measurement schedules suboptimal due to idling noise and probabilistic entanglement.", "highlights": [ "SS-$\\tau$ and AST reduce LER vs. MA baseline", "Fault-tolerant scaling at $p=10^{-3}$ for slow EGR", "Seam-skipping balances staleness and overhead" ], "keywords": [ { "label": "triangular color codes", "reason": "specific code family used in distributed setting" }, { "label": "seam scheduling", "reason": "core technique for boundary stabilizers" }, { "label": "heralded Bell pairs", "reason": "key interconnect for non-local CNOTs" }, { "label": "logical error rate", "reason": "primary performance metric" } ], "emoji": "🔗", "social_summary": "Smart scheduling skips costly seam checks in distributed quantum error correction, slashing error rates.", "highlights_oneliner": "Distributed seam scheduling" }, { "arxiv_id": "2604.22232", "title": "On the Interplay Between Noise, Bell Violation, and Cascade Error Correction in Device-Independent Quantum Key Distribution", "authors": "Nguyen Duong Hoang Duy, Nguyen Trinh Dong, Vu Tuan Hai, Le Vu Trung Duong, Nguyen Van Tinh", "arxiv_url": "https://arxiv.org/abs/2604.22232", "pdf_url": "https://arxiv.org/pdf/2604.22232", "summary": "Analyzes noise impact on CHSH values in DIQKD and effectiveness of Cascade error correction via iterative parity checking. Simulations reveal sharp CHSH degradation under moderate noise but efficient error reduction in initial Cascade rounds. Highlights narrow noise tolerance requiring balanced physical and classical processing.", "motivation": "DIQKD achieves device-independent security via Bell violations but faces practical noise sensitivity limiting key rates. Efficient classical error correction like Cascade is crucial for realistic implementations over noisy channels.", "highlights": [ "Noise sharply degrades CHSH value", "Cascade converges in first few rounds", "Narrow noise tolerance window" ], "keywords": [ { "label": "DIQKD", "reason": "security paradigm analyzed" }, { "label": "CHSH violation", "reason": "key security metric" }, { "label": "Cascade protocol", "reason": "error correction method studied" }, { "label": "noise tolerance", "reason": "critical performance limit" } ], "emoji": "🔗", "social_summary": "Noise sharply cuts DIQKD security, but Cascade error correction rescues keys efficiently.", "highlights_oneliner": "DIQKD Cascade analysis" }, { "arxiv_id": "2604.22588", "title": "Analytical and Compressed Simulation of Noisy Stabilizer Circuits", "authors": "Paul Aigner, Jasmin Matti, Maria Flors Mor-Ruiz, Julius Wallnöfer, Wolfgang Dür", "arxiv_url": "https://arxiv.org/abs/2604.22588", "pdf_url": "https://arxiv.org/pdf/2604.22588", "summary": "Derives closed-form Pauli expectation values for noisy stabilizer circuits with non-deterministic measurements, enabling exact strong simulation. Introduces circuit compression reducing weak simulation costs via preprocessing. Extends to deterministic measurements, rotations, and non-diagonal noise.", "motivation": "Noisy quantum devices require efficient simulation beyond Gottesman-Knill for verification and benchmarking. Existing samplers suffer statistical noise while density matrix methods scale exponentially.", "highlights": [ "Exact Pauli expectations without sampling", "Circuit compression accelerates weak simulation", "Extends to rotations and non-diagonal noise" ], "keywords": [ { "label": "noisy stabilizer formalism", "reason": "core theoretical framework" }, { "label": "strong simulation", "reason": "analytical expectation values" }, { "label": "circuit compression", "reason": "weak simulation optimization" }, { "label": "Pauli-frame", "reason": "extends existing simulation paradigm" } ], "emoji": "📚", "social_summary": "Exact analytical simulation of noisy quantum circuits—no sampling noise needed!", "highlights_oneliner": "Noisy stabilizer simulation" }, { "arxiv_id": "2604.22521", "title": "Decohered color code and emerging mixed toric code by anyon proliferation: Topological entanglement negativity perspective", "authors": "Keisuke Kataoka, Yoshihito Kuno, Takahiro Orito, Ikuo Ichinose", "pdf_url": "https://arxiv.org/pdf/2604.22521", "arxiv_url": "https://arxiv.org/abs/2604.22521", "summary": "Shows XX-decoherence on honeycomb color code red links creates intrinsic mixed-state topological order resembling single toric code. Characterizes via topological entanglement negativity ($\\text{TEN}$), dropping from $2\\ln 2$ to $\\ln 2$ at maximal decoherence. Reveals nonmodular theory with transparent anyons via stabilizer gauging.", "motivation": "Decoherence fundamentally alters topological codes, creating mixed-state phases absent in pure gapped Hamiltonians. Entanglement negativity provides uniquely powerful probes of these intrinsic mixed topological orders.", "highlights": [ "$\\text{TEN}: 2\\ln 2 \\to \\ln 2$ under decoherence", "Emerges single toric code via anyon proliferation", "Nonmodular theory with transparent anyons" ], "keywords": [ { "label": "color code", "reason": "base topological code studied" }, { "label": "topological entanglement negativity", "reason": "key diagnostic metric" }, { "label": "intrinsic mixed TO", "reason": "emergent phase identified" }, { "label": "anyon proliferation", "reason": "decoherence mechanism" } ], "emoji": "🧭", "social_summary": "Decoherence transforms color codes into exotic mixed topological phases probed by entanglement negativity.", "highlights_oneliner": "Decohered color code" } ] }, "2026-04-24": { "word_cloud": [ { "word": "DEM", "weight": 5 }, { "word": "Clifford+T", "weight": 4 }, { "word": "loss", "weight": 4 }, { "word": "distributed", "weight": 3 }, { "word": "AI", "weight": 4 }, { "word": "Berry", "weight": 3 }, { "word": "RAC", "weight": 3 }, { "word": "variance", "weight": 4 }, { "word": "fusion", "weight": 4 }, { "word": "cellular", "weight": 5 }, { "word": "lattice", "weight": 3 }, { "word": "decoder", "weight": 5 }, { "word": "stabilizer", "weight": 4 }, { "word": "threshold", "weight": 4 }, { "word": "photonic", "weight": 4 }, { "word": "toric", "weight": 3 }, { "word": "surgery", "weight": 3 } ], "social_highlights": "Highlights: LightStim automates DEMs, pygridsynth speeds Clifford+T, loss biasing enables fast cycles, distributed qubits cut nonlocal gates, AI benchmarks QEC circuits, CA decoders hit $7.5\\%$ threshold.", "papers": [ { "arxiv_id": "2604.21472", "title": "LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction", "authors": "Xiang Fang, Ming Wang, Yue Wu, Sharanya Prabhu, Dean Tullsen, Narasinga Rao Miniskar, Frank Mueller, Travis Humble, Yufei Ding", "arxiv_url": "https://arxiv.org/abs/2604.21472", "pdf_url": "https://arxiv.org/pdf/2604.21472", "summary": "LightStim automates Detector Error Model (DEM) construction for diverse QEC protocols using Pauli tableau tracking, enabling end-to-end logical error rate simulation without manual annotation. It benchmarks across memory experiments to distillation circuits and accelerates novel protocol exploration like heterogeneous cross-code lattice surgery.", "motivation": "Manual DEM construction limits QEC evaluation to simple memory experiments amid exploding protocol diversity in fault-tolerant QC. LightStim unlocks systematic comparison across code families and computing paradigms as hardware demonstrates multi-round correction.", "highlights": [ "Automates DEM construction for any QEC protocol", "$11.6\\times$ higher gate LER than memory baseline", "Novel cross-code lattice surgery demonstrated" ], "keywords": [ { "label": "DEM", "reason": "automated construction core innovation" }, { "label": "Pauli tableau", "reason": "enables protocol-agnostic simulation" }, { "label": "lattice surgery", "reason": "demonstrates heterogeneous code integration" }, { "label": "Reed-Muller", "reason": "novel code family in cross-protocol design" } ], "emoji": "🔧", "social_summary": "LightStim automates QEC evaluation, unlocking protocol exploration beyond memory experiments.", "highlights_oneliner": "Automated QEC simulation framework" }, { "arxiv_id": "2604.21333", "title": "pygridsynth: A fast numerical tool for ancilla-free Clifford+T synthesis", "authors": "Shuntaro Yamamoto, Nobuyuki Yoshioka", "arxiv_url": "https://arxiv.org/abs/2604.21333", "pdf_url": "https://arxiv.org/pdf/2604.21333", "summary": "pygridsynth provides $O(\\log(1/\\epsilon))$ ancilla-free Clifford+$T$ synthesis using partial-decomposition reducing $T$-count constants. Mixed-synthesis workflow empirically squares synthesis error to $\\epsilon^2/(2n)$ via probabilistic Clifford+$T$ mixtures.", "motivation": "Clifford+$T$ synthesis enables universal fault-tolerant QC but scales poorly for multi-qubit unitaries. pygridsynth provides Python-native high-precision benchmarking platform as NISQ transitions to FT era.", "highlights": [ "$O(\\log(1/\\epsilon))$ ancilla-free synthesis", "Partial-decomposition cuts $T$-count constants", "Mixed synthesis squares error to $\\epsilon^2/(2n)$" ], "keywords": [ { "label": "Clifford+$T$", "reason": "universal gate set target" }, { "label": "ancilla-free", "reason": "resource-efficient synthesis" }, { "label": "partial-decomposition", "reason": "novel $T$-count reduction technique" }, { "label": "mixed-synthesis", "reason": "probabilistic error squaring method" } ], "emoji": "⚡", "social_summary": "pygridsynth delivers fast ancilla-free Clifford+$T$ synthesis with squared error via mixed circuits.", "highlights_oneliner": "Fast Clifford+$T$ synthesizer" }, { "arxiv_id": "2604.21876", "title": "Loss-biased fault-tolerant quantum error correction", "authors": "Laura Pecorari, Gavin K. Brennen, Stanimir S. Kondov, Guido Pupillo", "arxiv_url": "https://arxiv.org/abs/2604.21876", "pdf_url": "https://arxiv.org/pdf/2604.21876", "summary": "Loss biasing converts Rydberg excitations to erasures via mid-circuit ionization, restoring Pauli error scaling in short-cycle neutral-atom QEC. Enables sub-millisecond cycles with optimal erasure scaling using loss-aware decoding.", "motivation": "Short QEC cycles amplify Rydberg hopping and population decay in neutral-atom processors. Loss biasing transforms correlated errors to manageable erasures, enabling hardware-speed fault tolerance.", "highlights": [ "Loss biasing restores FT scaling", "Sub-ms QEC cycles enabled", "Optimal erasure scaling achieved" ], "keywords": [ { "label": "loss biasing", "reason": "core error transformation technique" }, { "label": "Rydberg", "reason": "neutral-atom platform specificity" }, { "label": "erasure", "reason": "transformed error channel" }, { "label": "autoionization", "reason": "implementation mechanism" } ], "emoji": "🧨", "social_summary": "Loss biasing enables sub-ms fault-tolerant cycles in neutral-atom quantum computing.", "highlights_oneliner": "Fast-cycle neutral-atom QEC" }, { "arxiv_id": "2604.21722", "title": "Near-Term Reduction in Nonlocal Gate Count from Distributed Logical Qubits", "authors": "Bruno Avritzer, Nathan Sankary", "arxiv_url": "https://arxiv.org/abs/2604.21722", "pdf_url": "https://arxiv.org/pdf/2604.21722", "summary": "Distributed logical qubits across processors reduce nonlocal gates by 10% in color codes with per-gate syndrome extraction. Explores universal gates via magic distillation, code switching, and logical swaps for modular architectures.", "motivation": "Noisy inter-processor links bottleneck distributed quantum computing scaling. Splitting logical qubits reduces required entanglement generation rates despite poor interconnect fidelity.", "highlights": [ "10% nonlocal gate reduction", "Color code qubit allocation", "Logical swap universality method" ], "keywords": [ { "label": "distributed", "reason": "modular architecture focus" }, { "label": "color code", "reason": "exemplar code family" }, { "label": "nonlocal gates", "reason": "key optimization target" }, { "label": "logical swaps", "reason": "novel universality approach" } ], "emoji": "🔗", "social_summary": "Distributed logical qubits slash nonlocal gates by 10% in modular quantum computers.", "highlights_oneliner": "Distributed QEC gate reduction" }, { "arxiv_id": "2604.21287", "title": "StabilizerBench: A Benchmark for AI-Assisted Quantum Error Correction Circuit Synthesis", "authors": "Andres Paz, Christian Tarta, Cordelia Yuqiao Li, Mayee Sun, Sarju Patel, Sylvie Lausier", "arxiv_url": "https://arxiv.org/abs/2604.21287", "pdf_url": "https://arxiv.org/pdf/2604.21287", "summary": "StabilizerBench tests AI on 192 stabilizer codes across state prep, optimization, and fault-tolerant synthesis with Gottesman-Knill verification. Unified scoring reveals AI struggles with optimization quality despite state-prep success.", "motivation": "QEC circuit demand outpaces manual design as hardware scales to fault tolerance. AI automation requires specialized benchmarks beyond general quantum programming.", "highlights": [ "192 stabilizer code benchmark", "Gottesman-Knill verification", "AI optimization headroom shown" ], "keywords": [ { "label": "StabilizerBench", "reason": "new AI benchmark suite" }, { "label": "Gottesman-Knill", "reason": "efficient verification oracle" }, { "label": "fault-tolerant synthesis", "reason": "hardest benchmark task" }, { "label": "capability score", "reason": "unified evaluation metric" } ], "emoji": "🤖", "social_summary": "StabilizerBench reveals AI limits in QEC circuit synthesis across 192 codes.", "highlights_oneliner": "AI QEC benchmark suite" }, { "arxiv_id": "2604.20952", "title": "Adiabatic Error Cancellation in Berry Phase Estimation", "authors": "Chusei Kiumi", "arxiv_url": "https://arxiv.org/abs/2604.20952", "pdf_url": "https://arxiv.org/pdf/2604.20952", "summary": "Berry phase estimation cancels $O(T^{-1})$ errors via $\\pm H$ evolutions with Richardson extrapolation to $O(T^{-2})$. Runtime randomization suppresses residuals to $O(T^{-M})$ via Hadamard-test over $[0,2\\pi)$.", "motivation": "Berry phase gates promise pre-FT utility but suffer finite-time errors. Adiabatic cancellation enables practical NISQ-era geometric phase applications.", "highlights": [ "$O(T^{-1})$ error exactly cancelled", "Runtime randomization to $O(T^{-M})$", "Full $[0,2\\pi)$ phase range" ], "keywords": [ { "label": "Berry phase", "reason": "estimation target" }, { "label": "adiabatic cancellation", "reason": "error suppression mechanism" }, { "label": "Richardson extrapolation", "reason": "$O(T^{-2})$ improvement" }, { "label": "runtime randomization", "reason": "arbitrary-order suppression" } ], "emoji": "🌀", "social_summary": "Adiabatic cancellation enables practical Berry phase estimation pre-fault tolerance.", "highlights_oneliner": "Berry phase error cancellation" }, { "arxiv_id": "2604.21274", "title": "Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps", "authors": "Ruho Kondo, Yuki Sato, Hiroshi Yano, Yota Maeda, Kosuke Ito, Naoki Yamamoto", "arxiv_url": "https://arxiv.org/abs/2604.21274", "pdf_url": "https://arxiv.org/pdf/2604.21274", "summary": "Optimal $(L,L-1)$-RACs constructed via $2^{L-1}$ point selection minimizing distance objectives for both criteria. QRACs show minimal average-case gap but substantial worst-case classical-quantum advantage.", "motivation": "QRAC advantages established for small $(L,k)$ but general bounds unclear. Explicit optimal constructions clarify non-asymptotic classical-quantum gaps.", "highlights": [ "Optimal $(L,L-1)$-RAC constructions", "Distance-objective characterization", "Worst-case quantum advantage shown" ], "keywords": [ { "label": "RAC", "reason": "classical random access codes" }, { "label": "QRAC", "reason": "quantum counterpart comparison" }, { "label": "$(L,L-1)$", "reason": "closed-form optimal case" }, { "label": "worst-case", "reason": "reveals quantum advantage regime" } ], "emoji": "📡", "social_summary": "Optimal RAC constructions reveal substantial worst-case quantum advantage.", "highlights_oneliner": "Optimal RAC/QRAC constructions" }, { "arxiv_id": "2604.21800", "title": "Variance Geometry of Exact Pauli-Detecting Codes: Continuous Landscapes Beyond Stabilizers", "authors": "Arunaday Gupta, Baisong Sun, Xi He, Bei Zeng", "arxiv_url": "https://arxiv.org/abs/2604.21800", "pdf_url": "https://arxiv.org/pdf/2604.21800", "summary": "$\\lambda^*$ scalar characterizes continuous families of exact Pauli-detecting codes beyond discrete stabilizers via higher-rank numerical ranges. $\\Sigma_K(\\mathbf{E})$ forms closed intervals in all analyzed unrestricted/symmetry cases.", "motivation": "Stabilizer codes occupy measure-zero subsets of exact detection landscape. Geometric $\\lambda^*$-spectrum reveals continuous nonadditive code families.", "highlights": [ "$\\lambda^*$ continuous code parameter", "Interval $\\Sigma_K(\\mathbf{E})$ spectra", "Beyond-stabilizer code continuum" ], "keywords": [ { "label": "$\\lambda^*$", "reason": "signature norm invariant" }, { "label": "higher-rank numerical ranges", "reason": "geometric framework" }, { "label": "nonadditive codes", "reason": "continuous code families" }, { "label": "Knill-Laflamme", "reason": "detection condition basis" } ], "emoji": "📈", "social_summary": "Continuous geometries reveal vast non-stabilizer exact Pauli-detecting code landscape.", "highlights_oneliner": "Continuous code landscapes" }, { "arxiv_id": "2604.21475", "title": "Suppressing the Erasure Error of Fusion Operation in Photonic Quantum Computing", "authors": "Xiangyu Ren, Yuexun Huang, Zhemin Zhang, Yuchen Zhu, Tsung-Yi Ho, Antonio Barbalace, Zhiding Liang", "arxiv_url": "https://arxiv.org/abs/2604.21475", "pdf_url": "https://arxiv.org/pdf/2604.21475", "summary": "Tree-encoded fusion with spin-qubit memory suppresses photonic erasure errors during MBQC graph-state generation. MemTree compiler exponentially outperforms OneAdapt across benchmarks with hardware validation.", "motivation": "Fusion erasures dominate photonic MBQC fidelity beyond failure rates. Spin-memory encoding enables erasure-robust graph states for scalable PQC.", "highlights": [ "Tree-encoded fusion suppresses erasures", "Exponential compiler improvement", "Hardware-validated approach" ], "keywords": [ { "label": "tree-encoded fusion", "reason": "erasure suppression strategy" }, { "label": "MBQC", "reason": "photonic computation model" }, { "label": "spin memory", "reason": "enabling architecture" }, { "label": "MemTree", "reason": "compiler framework" } ], "emoji": "🌳", "social_summary": "Tree-encoded fusion plus spin memory exponentially boosts photonic quantum computing fidelity.", "highlights_oneliner": "Photonic erasure suppression" }, { "arxiv_id": "2604.21866", "title": "High-performance cellular automaton decoders for quantum repetition and toric code", "authors": "Don Winter, Thiago L. M. Guedes, Markus Müller", "arxiv_url": "https://arxiv.org/abs/2604.21866", "pdf_url": "https://arxiv.org/pdf/2604.21866", "summary": "SCALA non-hierarchical CA decoder achieves $p_c\\approx7.5\\%$ threshold with $p_L\\propto p^{d/4}$ toric code scaling. Outperforms hierarchical designs with scale-independent local computation and noise robustness.", "motivation": "Global decoders bottleneck real-time QEC scaling. Local CA decoders enable hardware-implementable low-latency correction.", "highlights": [ "$p_c\\approx7.5\\%$ CA threshold", "$p_L\\propto p^{d/4}$ toric scaling", "Noise-robust local architecture" ], "keywords": [ { "label": "SCALA", "reason": "non-hierarchical CA decoder" }, { "label": "cellular automaton", "reason": "local decoding paradigm" }, { "label": "$p_c\\approx7.5\\%$", "reason": "high performance threshold" }, { "label": "toric code", "reason": "2D topological code target" } ], "emoji": "🔲", "social_summary": "SCALA CA decoder hits $7.5\\%$ threshold with linear-distance scaling for real-time QEC.", "highlights_oneliner": "High-threshold CA decoder" } ] }, "2026-04-23": { "word_cloud": [ { "word": "Iceberg", "weight": 4 }, { "word": "PEC", "weight": 4 }, { "word": "QED", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "girth", "weight": 4 }, { "word": "Bicycle", "weight": 4 }, { "word": "modular", "weight": 4 }, { "word": "Surface", "weight": 5 }, { "word": "factory", "weight": 3 }, { "word": "mitigation", "weight": 3 }, { "word": "detection", "weight": 3 }, { "word": "decoder", "weight": 3 }, { "word": "QAOA", "weight": 2 }, { "word": "BP", "weight": 3 }, { "word": "T-gate", "weight": 3 }, { "word": "ancilla", "weight": 3 }, { "word": "compilers", "weight": 2 }, { "word": "lifting", "weight": 2 }, { "word": "steady-state", "weight": 2 } ], "social_highlights": "Highlights: co-designs PEC+QED for better accuracy, builds high-girth qLDPC from affine cosets, optimizes compilers for Bicycle FTQC, designs workload-aware Surface architectures.", "papers": [ { "arxiv_id": "2604.19871", "title": "Co-Designing Error Mitigation and Error Detection for Logical Qubits", "authors": "Rohan S. Kumar, Takahiro Tsunoda, Sophia H. Xue, Dantong Li, Robert J. Schoelkopf, Yongshan Ding", "arxiv_url": "https://arxiv.org/abs/2604.19871", "pdf_url": "https://arxiv.org/pdf/2604.19871", "summary": "Proposes co-designing QED and PEC by optimizing QED intervals on high-rate Iceberg codes and introducing steady-state extraction to mitigate transient errors. Demonstrates $2$--$11\\times$ lower absolute error and up to $31\\times$ lower MSE on $[[6,4,2]]$ QAOA ($p=4$--$8$).", "motivation": "Near-term quantum algorithms require error management as full QEC is infeasible on current hardware. QED and PEC complement each other but their joint design was unexplored, enabling better noise reduction without excessive overhead.", "highlights": [ "PEC+QED beats PEC by $2$--$11\\times$ error reduction", "Steady-state extraction cuts bias by $10.2\\times$", "Optimized intervals on Iceberg codes achieve efficiency" ], "keywords": [ { "label": "Iceberg codes", "reason": "High-rate codes enabling efficient QED intervals" } ], "emoji": "🔄", "social_summary": "Co-designs error detection and mitigation for $10\\times$ better quantum accuracy.", "highlights_oneliner": "PEC+QED Co-Design" }, { "arxiv_id": "2604.20838", "title": "High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures", "authors": "Koki Okada, Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2604.20838", "pdf_url": "https://arxiv.org/pdf/2604.20838", "summary": "Constructs $(3,8)$-regular CSS base matrix pair $[[512,174,8]]$ with girth $8$ using affine cosets in $\\mathbb{F}_2^9$, lifted to $[[16384,4142,\\leq40]]$ via CPM. BP decoder with post-processing achieves FER $10^{-8}$ at $p=0.085$.", "motivation": "Quantum LDPC codes need classical LDPC advantages like regularity, sparsity, high girth while satisfying CSS orthogonality. Provides explicit finite-length construction with strong decoding performance.", "highlights": [ "$[[512,174,8]]$ base with girth $8$", "P=32 lift: FER $10^{-8}$ at $p=0.085$", "$d\\leq40$ from decoder residual" ], "keywords": [ { "label": "Affine cosets", "reason": "Novel construction method for check supports" }, { "label": "CPM lifting", "reason": "Preserves CSS orthogonality and sparsity" }, { "label": "Girth 8", "reason": "Ensures good BP decoding performance" } ], "emoji": "🌀", "social_summary": "Constructs high-girth regular qLDPC codes with excellent decoding thresholds.", "highlights_oneliner": "High-Girth qLDPC" }, { "arxiv_id": "2604.20013", "title": "Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture", "authors": "Kun Liu, Ben Foxman, Gian-Luca R. Anselmetti, Yongshan Ding", "arxiv_url": "https://arxiv.org/abs/2604.20013", "pdf_url": "https://arxiv.org/pdf/2604.20013", "summary": "Identifies inter-module communication as bottleneck in BB modular FTQC; proposes syn@fac, transvection deferral, Clifford insertion. Syn@fac reduces failure probability $9.0\\times$ across 40+ benchmarks.", "motivation": "Early FTQC limited by communication and magic factories; compiler optimizations needed to match algorithm needs to hardware. Studies concrete BB architecture with realistic workloads.", "highlights": [ "Syn@fac: $9.0\\times$ failure reduction", "Transvection: $77\\%$ compile time cut", "Clifford insertion: $11.5\\%$ duration reduction" ], "keywords": [ { "label": "Bicycle codes", "reason": "qLDPC family for modular FTQC" }, { "label": "Syn@fac", "reason": "Factory-based rotation synthesis" }, { "label": "Inter-module communication", "reason": "Identified primary bottleneck" } ], "emoji": "🚲", "social_summary": "Optimizes compilers to slash errors $9\\times$ in early fault-tolerant QC.", "highlights_oneliner": "Bicycle Compiler Optimizations" }, { "arxiv_id": "2604.19855", "title": "Toward designing workload-aware Surface Code Architectures", "authors": "Archisman Ghosh, Avimita Chatterjee, Swaroop Ghosh", "arxiv_url": "https://arxiv.org/abs/2604.19855", "pdf_url": "https://arxiv.org/pdf/2604.19855", "summary": "Proposes ancilla-centric annular surface code with $T$-gate profile placement, fast-YY optimization, multi-program scheduling. Reduces data tiles $\\sim21\\%$ while keeping CPI optimal; $90\\%$ efficiency for 10 programs.", "motivation": "Surface code designs trade off qubit density vs latency; workload-aware layouts needed for practical FTQC. Enables concurrent multi-program execution with fairness.", "highlights": [ "$21\\%$ fewer data tiles", "Fast-YY cuts $Y$-gate latency", "90% efficiency for 10 concurrent programs" ], "keywords": [ { "label": "Ancilla-centric", "reason": "Uniform access layout innovation" }, { "label": "Workload-driven placement", "reason": "$T$-gate profile optimization" }, { "label": "Fast-YY", "reason": "Reconfigurable $Y$-measurement speedup" }, { "label": "Multi-program", "reason": "Concurrent execution fairness" } ], "emoji": "🎯", "social_summary": "Workload-aware surface codes cut qubits $21\\%$ with multi-program support.", "highlights_oneliner": "Workload-Aware Surface" } ] }, "2026-04-22": { "word_cloud": [ { "word": "surface code", "weight": 5 }, { "word": "LDPC codes", "weight": 4 }, { "word": "logical gates", "weight": 4 }, { "word": "decoder", "weight": 4 }, { "word": "neutral atoms", "weight": 3 }, { "word": "trapped ions", "weight": 3 }, { "word": "topological protection", "weight": 3 }, { "word": "dynamical decoupling", "weight": 3 }, { "word": "circuit synthesis", "weight": 3 }, { "word": "noise threshold", "weight": 3 }, { "word": "cat states", "weight": 2 }, { "word": "mid-circuit measurement", "weight": 2 }, { "word": "Hamiltonian simulation", "weight": 2 }, { "word": "hybrid CV-DV", "weight": 2 }, { "word": "conformal field theory", "weight": 2 }, { "word": "transversal operations", "weight": 2 }, { "word": "resource overhead", "weight": 2 }, { "word": "physical error rates", "weight": 2 } ], "social_highlights": "Highlights: Neutral atom parallelization achieves 3× speedup for early fault tolerance, trapped-ion walking cat architecture enables 110 logical qubits with 2,514 physical qubits, LDPC routing reduces long-range couplers from $O(n)$ to $O(\\sqrt{n})$, hybrid CV-DV noise reduction scales as $\\tilde{O}(\\sigma^2)$, Monte Carlo circuit synthesis improves CNOT counts by 53%, surface code decoherence analysis reveals finite-temperature limits, dynamic circuit error suppression achieves 3-fold reduction via learned DD sequences.", "papers": [ { "arxiv_id": "2604.19735", "title": "Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage", "authors": "Sahil Khan, Sayam Sethi, Kaavya Sahay, Yingjia Lin, Jude Alnas, Suhas Kurapati, Abhinav Anand, Jonathan M. Baker, Kenneth R. Brown", "arxiv_url": "https://arxiv.org/abs/2604.19735", "pdf_url": "https://arxiv.org/pdf/2604.19735", "summary": "This work identifies bottlenecks in spatially efficient fault-tolerant architectures and introduces a teleportation-based scheme leveraging neutral atom reconfigurable connectivity to parallelize logical operations. The approach achieves up to $3\\times$ speedup over extractor architectures while maintaining spatial efficiency, with explicit simulations including gate scheduling and resource-state nondeterminism. The authors demonstrate that quantum advantage benchmarks can be achieved with as few as $11,495$ atoms and $\\sim 15$ hours runtime.", "motivation": "Recent neutral atom platforms have demonstrated large coherent qubit counts and low physical error rates, enabling exploration of early fault-tolerant quantum computing. Balancing space and time efficiency is critical for near-term demonstrations of quantum advantage in applications like quantum dynamics simulations.", "highlights": [ "$3\\times$ speedup over extractor architectures via teleportation-based parallelization", "Quantum advantage achievable with $11,495$ atoms and $\\sim 15$ hour runtime", "Explicit compilation to fault-tolerant instruction set with low-level gate scheduling" ], "keywords": [ { "label": "neutral atoms", "reason": "Primary hardware platform leveraging reconfigurable connectivity for parallelized logical operations" }, { "label": "teleportation-based compilation", "reason": "Novel architectural approach that parallelizes logical gates by exploiting spatial resources" }, { "label": "space-time optimization", "reason": "Core contribution balancing qubit overhead against execution time for early fault tolerance" }, { "label": "quantum dynamics simulation", "reason": "Target application demonstrating practical quantum advantage with realistic resource estimates" } ], "emoji": "⚛️", "social_summary": "Parallelize fault-tolerant quantum circuits on neutral atoms to achieve quantum advantage with just 11,495 atoms in 15 hours.", "highlights_oneliner": "Neutral atom parallelization for early quantum advantage" }, { "arxiv_id": "2604.19481", "title": "Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture", "authors": "Felix Tripier, Woo Chang Chung, Jacob Young, Safwan Alam, Bryce Bjork, Aharon Brodutch, Finn Lasse Buessen, Nolan J. Coble, Thomas Dellaert, Dmitri Maslov, Martin Roetteler, Edwin Tham, Mark Webster, Min Ye, John Gamble, Andrii Maksymov, J. P. Marceaux, Nicolas Delfosse", "arxiv_url": "https://arxiv.org/abs/2604.19481", "pdf_url": "https://arxiv.org/pdf/2604.19481", "summary": "This work proposes the walking cat architecture, a complete fault-tolerant blueprint for trapped-ion systems based on low-density parity-check (LDPC) codes. The architecture includes a compiler, detailed error-correction protocols, micro-architecture, fast decoder, and thorough simulations. Key instances include a dense architecture encoding $22$ logical qubits per memory block using a $[[102, 22, 9]]$ code with only $2,514$ physical qubits.", "motivation": "Trapped-ion platforms have demonstrated high-fidelity gates and long coherence times, making them promising for fault-tolerant quantum computing. LDPC codes offer superior encoding rates compared to surface codes, enabling more efficient use of physical resources.", "highlights": [ "$110$ logical qubits executing $\\sim 1$ million $T$-gates per day with $2,514$ physical qubits", "Heisenberg model simulation on $100$ sites achievable within one month at chemical accuracy", "Complete architecture with compiler, decoder, and experimentally demonstrated hardware components" ], "keywords": [ { "label": "LDPC codes", "reason": "Core error-correction approach enabling superior encoding rates and code distance" }, { "label": "cat factory", "reason": "Novel resource-state production mechanism distributing cat states throughout the machine" }, { "label": "trapped ions", "reason": "Hardware platform with demonstrated high-fidelity gates and long coherence times" }, { "label": "Clifford-frame tracking", "reason": "Technique for implementing fast logical gates on $6$-qubit Clifford operations" } ], "emoji": "🐱", "social_summary": "Walking cat architecture enables 110 logical qubits on trapped ions with just 2,514 physical qubits for practical quantum simulations.", "highlights_oneliner": "LDPC-based trapped-ion architecture for scalable quantum computing" }, { "arxiv_id": "2604.18714", "title": "Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures", "authors": "Kun Liu, Takahiro Tsunoda, Sophia H. Xue, Evan McKinney, Zeyuan Zhou, Shifan Xu, Robert J. Schoelkopf, Yongshan Ding", "arxiv_url": "https://arxiv.org/abs/2604.18714", "pdf_url": "https://arxiv.org/pdf/2604.18714", "summary": "This work presents a hardware-software co-design for implementing quantum LDPC codes on superconducting platforms using a programmable $2$D toric communication network. The approach reduces long-range coupler requirements from $O(n)$ to $O(\\sqrt{n})$ while maintaining low syndrome extraction cycle duration. Circuit-level simulations with realistic noise achieve logical error rates of $3.06\\%$ for $[[18, 4, 4]]$ bivariate bicycle codes, $2.6\\times$ better than existing experimental results.", "motivation": "Surface codes suffer from low encoding rates, severely limiting scalability under current fabrication constraints. Quantum LDPC codes offer dramatically improved encoding efficiency while maintaining constant-weight stabilizers, but their long-range interactions pose implementation challenges on realistic hardware.", "highlights": [ "Long-range coupler reduction from $O(n)$ to $O(\\sqrt{n})$ via toric network architecture", "Logical error rate of $3.06\\%$ for $[[18, 4, 4]]$ BB codes, $2.6\\times$ improvement over experiments", "Hardware-software co-design exploiting code symmetries for maximum parallelism" ], "keywords": [ { "label": "bivariate bicycle codes", "reason": "High-rate LDPC code family with superior encoding rates and large code distance" }, { "label": "2D toric network", "reason": "Programmable communication fabric reducing connectivity requirements for long-range gates" }, { "label": "dual-rail qubits", "reason": "Qubit encoding enabling native Swap-Wait-Swap gates and erasure detection" }, { "label": "routing algorithm", "reason": "Symmetry-aware scheduling maximizing parallelism while maintaining low syndrome extraction latency" } ], "emoji": "🔗", "social_summary": "Reduce long-range couplers from $O(n)$ to $O(\\sqrt{n})$ for LDPC codes on superconducting platforms with 2.6× error improvement.", "highlights_oneliner": "LDPC routing with reduced connectivity overhead" }, { "arxiv_id": "2604.19163", "title": "Noise Reduction for Universal Hybrid Oscillator-Qubit Quantum Computation", "authors": "Mohammad Nobakht, Ivan Kassal", "arxiv_url": "https://arxiv.org/abs/2604.19163", "pdf_url": "https://arxiv.org/pdf/2604.19163", "summary": "This work develops noise reduction for universal continuous-variable–discrete-variable (CV–DV) gate sets by introducing an ancilla qubit into a GKP-stabilizer code. The scheme reduces Gaussian displacement noise standard deviation from $\\sigma$ to $\\tilde{O}(\\sigma^2)$, enabling correction of arbitrary CV–DV gates including non-Gaussian operations. The approach is demonstrated on non-Gaussian cat and Fock state preparation with significantly improved fidelity.", "motivation": "Hybrid CV–DV architectures process quantum information in both bosonic modes and qubits, but existing noise-reduction schemes like GKP-stabilizer codes only work for Gaussian gates. A universal noise-reduction scheme applicable to arbitrary gates is essential for practical hybrid quantum computation.", "highlights": [ "Noise reduction scaling as $\\tilde{O}(\\sigma^2)$ for universal CV–DV gate sets", "Ancilla-qubit augmentation enabling non-Gaussian gate error correction", "Improved fidelity demonstrated for cat and Fock state preparation" ], "keywords": [ { "label": "GKP-stabilizer codes", "reason": "Foundation for continuous-variable error correction extended to hybrid CV–DV systems" }, { "label": "hybrid CV-DV architecture", "reason": "Quantum information processing combining bosonic modes and qubits" }, { "label": "non-Gaussian gates", "reason": "Universal gate set requiring novel noise-reduction approach beyond existing schemes" }, { "label": "ancilla qubit", "reason": "Resource enabling extension of GKP codes to correct arbitrary CV–DV operations" } ], "emoji": "🌊", "social_summary": "Extend GKP codes to hybrid CV-DV systems with universal noise reduction scaling as $\\tilde{O}(\\sigma^2)$ for non-Gaussian gates.", "highlights_oneliner": "Universal noise reduction for hybrid quantum systems" }, { "arxiv_id": "2604.19029", "title": "MonteQ: A Monte Carlo Tree Search Based Quantum Circuit Synthesis Framework", "authors": "Mulundano Machiya, Matt Menickelly, Paul Hovland, Ji Liu", "arxiv_url": "https://arxiv.org/abs/2604.19029", "pdf_url": "https://arxiv.org/pdf/2604.19029", "summary": "This work presents MonteQ, a quantum circuit synthesis framework for Hamiltonian simulation combining low-level synthesis heuristics with Monte Carlo Tree Search for exploring Pauli rotation sequences. The two-level design supports both logical-level and hardware-aware synthesis while accommodating different ordering constraints. Experimental results demonstrate up to $53\\%$ improvement in $CNOT$ gate counts ($30\\%$ average) against state-of-the-art compilers like Rustiq.", "motivation": "Hamiltonian simulation is a promising path to quantum advantage, but circuit synthesis typically relies on greedy local rewrite rules with limited flexibility. Different simulation algorithms require different Pauli term orderings, yet most prior methods assume fixed commutation structures.", "highlights": [ "Up to $53\\%$ improvement in $CNOT$ gate counts over Rustiq compiler", "$30\\%$ average optimization gain across representative synthesis tasks", "Flexible two-level design supporting logical and hardware-aware synthesis modes" ], "keywords": [ { "label": "Monte Carlo Tree Search", "reason": "Core algorithm for judiciously exploring factorially large space of Pauli rotation sequences" }, { "label": "Hamiltonian simulation", "reason": "Target application for quantum advantage with varying Pauli term ordering requirements" }, { "label": "circuit synthesis", "reason": "Optimization framework reducing two-qubit gate counts for NISQ-era quantum computers" }, { "label": "commutation-aware scheduling", "reason": "Technique preserving target unitary or relaxing constraints via directed acyclic graphs" } ], "emoji": "🌳", "social_summary": "MonteQ uses Monte Carlo tree search to optimize Hamiltonian simulation circuits, achieving 53% CNOT reduction over existing compilers.", "highlights_oneliner": "MCTS-based circuit synthesis for Hamiltonian simulation" }, { "arxiv_id": "2604.18968", "title": "Quantum Decoherence of the Surface Code: A Generalized Caldeira-Leggett Approach", "authors": "E. Novais, A. H. Castro-Neto", "arxiv_url": "https://arxiv.org/abs/2604.18968", "pdf_url": "https://arxiv.org/pdf/2604.18968", "summary": "This work investigates fundamental limits of actively corrected surface codes coupled to continuous quantum environments using the generalized Caldeira-Leggett framework. The analysis maps long-time logical qubit evolution to boundary conformal field theory, establishing equivalence to the anisotropic Kondo model. Results reveal that true thermodynamic thresholds exist only for short-range environments ($z > 1/(s+1)$), while critical or long-range regimes prevent topological protection.", "motivation": "Standard QEC models assume discrete Markovian noise, obscuring the continuous quantum nature of physical environments. Understanding decoherence in realistic continuous baths is essential for assessing practical limits of topological protection in surface codes.", "highlights": [ "Thermodynamic threshold exists only for short-range environments with $z > 1/(s+1)$", "Finite-temperature analysis reveals exponential decoherence at long times for any finite code distance $L$", "Mapping to boundary conformal field theory and anisotropic Kondo model enables exact analysis" ], "keywords": [ { "label": "surface code", "reason": "Topologically protected error correction code analyzed under realistic continuous bath coupling" }, { "label": "Caldeira-Leggett framework", "reason": "Theoretical approach modeling continuous quantum environment interactions" }, { "label": "conformal field theory", "reason": "Effective field theory mapping enabling exact analytical treatment of macroscopic lattice-bath coupling" }, { "label": "noise threshold", "reason": "Critical condition for topological protection dependent on environmental spectral properties" } ], "emoji": "🌡️", "social_summary": "Caldeira-Leggett analysis reveals surface codes lose topological protection in long-range environments, with finite-temperature exponential decoherence.", "highlights_oneliner": "Continuous bath decoherence limits for surface codes" }, { "arxiv_id": "2604.18734", "title": "Learning error suppression strategies for dynamic quantum circuits", "authors": "Christopher Tong, Liran Shirizly, Edward H. Chen, Derek S. Wang, Bibek Pokharel", "arxiv_url": "https://arxiv.org/abs/2604.18734", "pdf_url": "https://arxiv.org/pdf/2604.18734", "summary": "This work introduces an empirical learning framework optimizing dynamical decoupling (DD) sequences for dynamic quantum circuits at circuit subinterval and qubit subregister levels. Learned DD sequences achieve $3\\times$ reduction in average dynamic circuit error rates via randomized benchmarking. The approach is applied to quantum Fourier transform with measurement on up to $20$ qubits, demonstrating nontrivial process fidelity and high signal-to-noise performance.", "motivation": "Dynamic quantum circuits integrating mid-circuit measurement and feedforward are essential for fault-tolerant quantum computation, but introduce measurement-induced errors and control constraints not addressed by conventional error-suppression techniques. Empirically optimized strategies are needed for these new error sources.", "highlights": [ "$3\\times$ reduction in average dynamic circuit error rates via learned DD sequences", "Nontrivial process fidelity on connected chains of up to $20$ qubits", "High signal-to-noise quantum Fourier transform following $10$-qubit entangled state preparation" ], "keywords": [ { "label": "dynamical decoupling", "reason": "Low-overhead error suppression technique adapted empirically for dynamic circuit constraints" }, { "label": "mid-circuit measurement", "reason": "Key dynamic circuit feature introducing measurement-induced errors and decoherence during idle periods" }, { "label": "empirical learning", "reason": "Machine learning framework optimizing DD sequences outperforming theoretical derivations" }, { "label": "dynamic quantum circuits", "reason": "Hybrid execution model combining unitary gates with measurement and classical feedforward" } ], "emoji": "⚡", "social_summary": "Learn optimal dynamical decoupling sequences for dynamic circuits, achieving 3× error reduction on 20-qubit quantum Fourier transforms.", "highlights_oneliner": "Learned error suppression for dynamic circuits" } ] }, "2026-04-21": { "word_cloud": [ { "word": "GKP", "weight": 5 }, { "word": "syndrome", "weight": 4 }, { "word": "decoder", "weight": 5 }, { "word": "mitigation", "weight": 5 }, { "word": "graph", "weight": 4 }, { "word": "neural", "weight": 4 }, { "word": "noise", "weight": 3 }, { "word": "NISQ", "weight": 3 }, { "word": "cat", "weight": 4 }, { "word": "hypergraph", "weight": 5 }, { "word": "surface", "weight": 4 }, { "word": "bicycle", "weight": 3 }, { "word": "QNN", "weight": 4 }, { "word": "ZNE", "weight": 3 }, { "word": "adaptive", "weight": 4 }, { "word": "non-Gaussianity", "weight": 3 }, { "word": "infidelity", "weight": 3 }, { "word": "GPU", "weight": 4 } ], "social_highlights": "Highlights: GKP state witnesses, cut-cat syndrome extraction, graph neural QEM, HQNN noise mitigation, adaptive hypergraph decoding.", "papers": [ { "arxiv_id": "2604.17303", "title": "Efficient characterization of general Gottesman-Kitaev-Preskill qubits", "authors": "Vojtěch Kuchař, Petr Marek", "arxiv_url": "https://arxiv.org/abs/2604.17303", "pdf_url": "https://arxiv.org/pdf/2604.17303", "summary": "Introduces positive semidefinite Hermitian operators for each point on the logical Bloch sphere with ideal GKP qubit states as zero-eigenvalue ground states. Expectation values witness non-Gaussianity and measure twice the logical infidelity in the ideal subspace. Truncated operators approximate arbitrary logical GKP states, requiring only three quadrature measurements for evaluation.", "motivation": "GKP qubits promise bosonic error correction but lack efficient characterization beyond basis states, relying on resource-intensive tomography. This work enables practical preparation and evaluation of arbitrary superpositions, advancing experimental GKP implementations.", "highlights": [ "3 quadrature measurements suffice", "Twice logical infidelity witness", "Non-Gaussianity detector" ], "keywords": [ { "label": "GKP", "reason": "Core qubit type targeted for characterization" }, { "label": "Bloch sphere", "reason": "Operators defined for all superposition points" }, { "label": "quadrature measurements", "reason": "Minimal measurement requirement" }, { "label": "non-Gaussianity", "reason": "Key witness property" } ], "emoji": "🐱", "social_summary": "New operators characterize any GKP qubit state with just 3 measurements!", "highlights_oneliner": "GKP Bloch witnesses" }, { "arxiv_id": "2604.17339", "title": "Fault-Tolerant Cut-Cat State Syndrome Extraction for Quantum Codes", "authors": "Diego Forlivesi, Lorenzo Valentini, Marco Chiani", "arxiv_url": "https://arxiv.org/abs/2604.17339", "pdf_url": "https://arxiv.org/pdf/2604.17339", "summary": "Presents cut-cat state scheme for fault-tolerant syndrome extraction in CSS codes using cat stabilizers to correct hook errors from non-FT ancilla interactions. Maintains parallelized data interactions while halving required simultaneous qubits. Offers lower two-qubit gate count than flag-based protocols as code distance increases.", "motivation": "Standard syndrome extraction lacks fault-tolerance; cat states enable parallelism but require many qubits. Cut-cat reduces overhead while preserving benefits, improving scalability for large-distance codes.", "highlights": [ "Halves qubit requirement", "Lower gate count vs flags", "Hook error correction" ], "keywords": [ { "label": "cut-cat", "reason": "Novel syndrome extraction scheme" }, { "label": "CSS codes", "reason": "Targeted code family" }, { "label": "hook errors", "reason": "Specific error type corrected" }, { "label": "cat stabilizers", "reason": "Enables fault-tolerance" } ], "emoji": "🐱", "social_summary": "Cut-cat syndrome extraction halves qubits needed for fault-tolerant QEC.", "highlights_oneliner": "Cut-cat FT extraction" }, { "arxiv_id": "2604.16815", "title": "Scalable Quantum Error Mitigation with Physically Informed Graph Neural Networks", "authors": "Huaxin Wang, Xinge Wu, Jiajun Liu, Ruiqing He, Jiandong Shang, Hengliang Guo, Qiang Chen", "arxiv_url": "https://arxiv.org/abs/2604.16815", "pdf_url": "https://arxiv.org/pdf/2604.16815", "summary": "Develops GEM framework encoding circuits as attributed graphs with hardware noise in node/edge features for GNN modeling of error propagation. Dual-branch affine correction ensures physical consistency; scales better than ZNE/CDR on 10-16 qubit superconducting processors. Captures local interactions and non-local correlations via coupling structure.", "motivation": "Traditional QEM like ZNE/CDR suffer exponential scaling with system size due to global assumptions. Physically-informed graphs leverage hardware locality for scalable mitigation in NISQ regime.", "highlights": [ "10x better scaling than CDR", "Zero-shot 16-qubit transfer", "Graph error propagation" ], "keywords": [ { "label": "Graph Neural Networks", "reason": "Core modeling architecture" }, { "label": "GEM framework", "reason": "Proposed mitigation method" }, { "label": "zero-shot transfer", "reason": "Key scalability demonstration" }, { "label": "$T_1$, $T_2$ encoding", "reason": "Physical node features" } ], "emoji": "🪃", "social_summary": "Graph neural networks make quantum error mitigation scalable to 16 qubits.", "highlights_oneliner": "Physically-informed GEM" }, { "arxiv_id": "2604.17515", "title": "Robustness Evaluation of Hybrid Quantum Neural Networks under Noise Models via System-Level Error Mitigation", "authors": "Jesse Roberta Mingue Njiki, Nouhaila Innan, Alberto Marchisio, Muhammad Kashif, Jean-Michel Dricot, Muhammad Shafique", "arxiv_url": "https://arxiv.org/abs/2604.17515", "pdf_url": "https://arxiv.org/pdf/2604.17515", "summary": "Systematically evaluates ZNE, DDD, LRE, PEC on HQNNs under five noise models using PennyLane/Qiskit/Mitiq on Iris dataset. Noise impact and mitigation effectiveness strongly channel-dependent; depolarizing/amplitude-damping most degrading. No universal mitigation superiority; benefits limited and noise-specific.", "motivation": "QNNs promising for QML but NISQ noise severely limits trainability; existing QEM focused on VQE/QAOA ignores QNN learning dynamics. Reveals need for QNN-specific mitigation strategies.", "highlights": [ "Channel-dependent degradation", "Limited mitigation gains", "Iris dataset evaluation" ], "keywords": [ { "label": "HQNN", "reason": "Hybrid architecture evaluated" }, { "label": "ZNE, PEC, DDD", "reason": "Tested mitigation techniques" }, { "label": "noise channels", "reason": "Five models systematically compared" }, { "label": "PennyLane integration", "reason": "Practical training pipeline" } ], "emoji": "🤖", "social_summary": "Noise brutally tests quantum neural nets; mitigation gains are channel-specific.", "highlights_oneliner": "HQNN noise evaluation" }, { "arxiv_id": "2604.16613", "title": "GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs", "authors": "Abbas B. Ziad, Jubo Xu, Hongxiang Fan", "arxiv_url": "https://arxiv.org/abs/2604.16613", "pdf_url": "https://arxiv.org/pdf/2604.16613", "summary": "GreenPeas C++/CUDA toolchain enables just-in-time hypergraph compilation for adaptive circuits via GPU-parallel Stim backtracking on space-time graphs. Achieves >10x speedup over Stim for surface/bicycle codes. Enables circuit-level decoding of adaptive syndromes previously limited to phenomenological decoders.", "motivation": "AOT hypergraph compilation creates exponential memory bottleneck for adaptive circuits; microsecond hardware cycles demand sub-ms decoding. Unlocks accurate circuit-level decoding for adaptive QEC protocols.", "highlights": [ ">10x Stim speedup", "GPU hypergraph JIT", "Adaptive circuit decoding" ], "keywords": [ { "label": "GreenPeas", "reason": "Novel JIT compiler toolchain" }, { "label": "hypergraphs", "reason": "Core decoding structure" }, { "label": "surface code", "reason": "Benchmarked architecture" }, { "label": "bivariate bicycle", "reason": "Second benchmarked family" } ], "emoji": "📚", "social_summary": "GreenPeas enables real-time decoding for adaptive quantum error correction.", "highlights_oneliner": "JIT adaptive decoding" } ] }, "2026-04-20": { "word_cloud": [ { "word": "high-rate", "weight": 5 }, { "word": "atom arrays", "weight": 4 }, { "word": "MacWilliams", "weight": 4 }, { "word": "intrinsic codes", "weight": 4 }, { "word": "game theoretic", "weight": 4 }, { "word": "error budget", "weight": 3 }, { "word": "silicon QPU", "weight": 5 }, { "word": "exchange-only", "weight": 4 }, { "word": "erasure detection", "weight": 5 }, { "word": "dual-rail", "weight": 4 }, { "word": "parity unfolding", "weight": 4 }, { "word": "Clifford hierarchy", "weight": 3 }, { "word": "hybrid CV-DV", "weight": 4 }, { "word": "decoder benchmarking", "weight": 4 }, { "word": "biased noise", "weight": 3 }, { "word": "teraquop", "weight": 3 }, { "word": "Nash Equilibrium", "weight": 3 } ], "social_highlights": "Highlights: ultra-high-rate atom array codes, intrinsic MacWilliams bounds, game-theoretic error budgets, silicon QPU with error detection, fast dual-rail erasure checks, parity-unfolded distillation, hybrid CV-DV decoder stack.", "papers": [ { "arxiv_id": "2604.16209", "title": "Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays", "authors": "Chen Zhao, Casey Duckering, Andi Gu, Nishad Maskara, Hengyun Zhou", "arxiv_url": "https://arxiv.org/abs/2604.16209", "pdf_url": "https://arxiv.org/pdf/2604.16209", "summary": "Identifies structural conditions on affine permutation matrices enabling encoding rates exceeding $1/2$ for efficient implementation on reconfigurable neutral atom arrays. Achieves per-logical-per-round error rates of $1.3_{-0.9}^{+3.0} \\times 10^{-13}$ with $[[2304,1156,\\leq 14]]$ code and $2.9_{-1.5}^{+3.1} \\times 10^{-11}$ with $[[1152,580,\\leq 12]]$ code under $p=0.1\\%$ circuit noise.", "motivation": "Quantum low-density parity-check codes promise reduced qubit overhead through high-rate encodings, but finite-size instances typically achieve rates $\\leq 1/10$. This work builds on Kasai's construction to enable ultra-high rates compatible with practical neutral atom hardware.", "highlights": [ "$[[2304,1156,\\leq 14]]$ code: $1.3\\times10^{-13}$ logical error", "Encoding rate $>1/2$ on atom arrays", "Teraquop regime approached" ], "keywords": [ { "label": "affine permutation matrices", "reason": "Key structural condition enabling high-rate codes" }, { "label": "neutral atom arrays", "reason": "Hardware platform for efficient syndrome extraction" }, { "label": "hierarchical decoder", "reason": "Achieves high accuracy under circuit-level noise" }, { "label": "teraquop regime", "reason": "Performance milestone for practical QEC" } ], "emoji": "🧬", "social_summary": "Ultra-high-rate QEC codes exceed 50% encoding on atom arrays with teraquop performance.", "highlights_oneliner": "High-rate atom array QEC" }, { "arxiv_id": "2604.16023", "title": "MacWilliams Identities for Intrinsic Quantum Codes", "authors": "Eric Kubischta, Ian Teixeira", "arxiv_url": "https://arxiv.org/abs/2604.16023", "pdf_url": "https://arxiv.org/pdf/2604.16023", "summary": "Develops intrinsic enumerator framework with projector and twirl enumerators satisfying MacWilliams identities for unitary group representations. Computes explicit SU(2) transform using Wigner $6j$-symbols, yielding linear programming bounds for permutation-invariant codes. Extends to multiplicity case with matrix-valued semidefinite programming.", "motivation": "MacWilliams identities provide strongest coding bounds through enumerator duality, but quantum analogues were limited to stabilizer codes. Intrinsic quantum codes offer symmetry-based perspective applicable to whole families of physical realizations simultaneously.", "highlights": [ "Intrinsic MacWilliams identities derived", "SU(2) transform via $6j$-symbols", "Extremality for 4-qubit, 7-qubit codes" ], "keywords": [ { "label": "intrinsic enumerators", "reason": "New framework for symmetry-based QEC" }, { "label": "Wigner $6j$-symbols", "reason": "Explicit MacWilliams transform computation" }, { "label": "semidefinite programming", "reason": "Multiplicity case optimization" }, { "label": "permutation-invariant", "reason": "Target code family for bounds" } ], "emoji": "📊", "social_summary": "MacWilliams identities for intrinsic quantum codes yield tightest bounds via group representation theory.", "highlights_oneliner": "Intrinsic MacWilliams identities" }, { "arxiv_id": "2604.15603", "title": "A Game Theoretic Approach for Optimizing Quantum Error Budget Distribution", "authors": "Asif Akhtab Ronggon, Tasnuva Farheen", "arxiv_url": "https://arxiv.org/abs/2604.15603", "pdf_url": "https://arxiv.org/pdf/2604.15603", "summary": "Formulates error budget allocation as potential game where Nash Equilibrium yields Pareto-optimal distribution across logical operations, T-state distillation, and rotation synthesis. Iterated best response algorithm converges monotonically, achieving 30.22% average physical resource reduction across 433 MQT benchmarks.", "motivation": "Uniform error budget allocation causes suboptimal resource overhead in fault-tolerant compilation. Machine learning approaches require extensive training data without convergence guarantees, motivating analytical game-theoretic solution.", "highlights": [ "30.22% average resource reduction", "Nash Equilibrium = Pareto optimum", "No training data required" ], "keywords": [ { "label": "potential game", "reason": "Mathematical formulation of budget allocation" }, { "label": "iterated best response", "reason": "Monotonic convergence algorithm" }, { "label": "Pareto-optimal distribution", "reason": "Strategic equilibrium property" }, { "label": "MQT benchmarks", "reason": "Comprehensive evaluation dataset" } ], "emoji": "🎮", "social_summary": "Game theory cuts quantum resource needs 30% by smart error budget allocation.", "highlights_oneliner": "Game-theoretic error budgets" }, { "arxiv_id": "2604.16216", "title": "A digitally controlled silicon quantum processing unit", "authors": "Members of the HRL Quantum Team, Collaborators, ...", "arxiv_url": "https://arxiv.org/abs/2604.16216", "pdf_url": "https://arxiv.org/pdf/2604.16216", "summary": "Introduces QPU with cryogenic CMOS controller, high-density superconducting ribbon cable, and 54 quantum dot array hosting 18 exchange-only qubits. Demonstrates order-of-magnitude qubit performance improvement and validates with distance-5 repetition code plus error detecting code.", "motivation": "Silicon exchange-only qubits offer control simplicity and semiconductor compatibility, but required scalable wiring and sufficiently low noise. This work integrates all components for utility-scale quantum computing with manageable requirements.", "highlights": [ "18 EO qubits in 54-dot array", "Order-of-magnitude performance gain", "Distance-5 repetition code validated" ], "keywords": [ { "label": "exchange-only qubits", "reason": "Qubit modality with control simplicity" }, { "label": "cryogenic CMOS", "reason": "Custom controller technology" }, { "label": "superconducting ribbon", "reason": "High-density wiring solution" }, { "label": "distance-5 code", "reason": "Error correction demonstration" } ], "emoji": "💎", "social_summary": "Silicon QPU integrates 18 qubits with digital control, advances EO state-of-art by order of magnitude.", "highlights_oneliner": "Silicon 18-qubit QPU" }, { "arxiv_id": "2604.16292", "title": "Fast, High-Fidelity Erasure Detection of Dual-Rail Qubits with Symmetrically Coupled Readout", "authors": "Jimmy Shih-Chun Hung, Arbel Haim, ...", "arxiv_url": "https://arxiv.org/abs/2604.16292", "pdf_url": "https://arxiv.org/pdf/2604.16292", "summary": "Realizes single-shot erasure detection in 384 ns using single readout resonator symmetrically coupled to dual-rail transmons, achieving $6.0(2)\\times10^{-4}$ residual error and $2.54(1)\\times10^{-2}$ erasure error per check. Enables time-continuous erasure detection during gates with median $7.2\\times10^{-5}$ error per gate.", "motivation": "Erasure qubits require frequent fast mid-circuit checks preserving error hierarchy, but prior superconducting schemes had hardware overhead or long times. Symmetrically coupled readout provides simple high-fidelity solution reducing overhead.", "highlights": [ "384 ns single-shot erasure detection", "$6\\times10^{-4}$ residual error/check", "Continuous detection during gates" ], "keywords": [ { "label": "$\\chi$-matching", "reason": "Symmetric dispersive coupling technique" }, { "label": "dual-rail qubits", "reason": "Erasure qubit encoding platform" }, { "label": "time-continuous detection", "reason": "Parallel gate-erasure modality" }, { "label": "Purcell filter", "reason": "Loss mitigation component" } ], "emoji": "🛡️", "social_summary": "384ns erasure detection for dual-rail qubits enables continuous error monitoring during gates.", "highlights_oneliner": "Fast dual-rail erasure" }, { "arxiv_id": "2604.15436", "title": "Parity-unfolded distillation architecture for noise-biased platforms", "authors": "Konstantin Tiurev, Christoph Fleckenstein, ...", "arxiv_url": "https://arxiv.org/abs/2604.15436", "pdf_url": "https://arxiv.org/pdf/2604.15436", "summary": "Introduces parity-unfolded architecture distilling Clifford hierarchy gates $Z^{1/2^k}|+\\rangle$ using $2^{k+3}+O(2^{k/2})$ biased-noise qubits. Reduces resource overhead for QFT/phase estimation up to $k=7$ and improves ($T+\\sqrt{T}$) synthesis by 43% error reduction, 26% fewer resources.", "motivation": "Conventional Clifford+$T$ distillation inefficient for noise-biased platforms and algorithms needing native small-angle rotations. Parity unfolding enables direct fault-tolerant preparation from Clifford hierarchy levels.", "highlights": [ "$T^{1/32}$ native gate distillation", "43% logical error reduction", "26% resource overhead cut" ], "keywords": [ { "label": "parity unfolding", "reason": "Novel distillation architecture" }, { "label": "Clifford hierarchy", "reason": "Multi-level gate distillation" }, { "label": "biased-noise qubits", "reason": "Target hardware optimization" }, { "label": "Quantum Fourier Transform", "reason": "Key application enabled" } ], "emoji": "🔄", "social_summary": "Parity-unfolded distillation cuts magic state overhead 26% for biased-noise quantum computers.", "highlights_oneliner": "Clifford hierarchy distillation" }, { "arxiv_id": "2604.15389", "title": "A Unified Hardware-to-Decoder Architecture for Hybrid Continuous-Variable and Discrete-Variable Quantum Error Correction in LiDMaS+", "authors": "Dennis Delali Kwesi Wayo, Chinonso Onah, Leonardo Goliatt, Sven Groppe", "arxiv_url": "https://arxiv.org/abs/2604.15389", "pdf_url": "https://arxiv.org/pdf/2604.15389", "summary": "Establishes unified hardware-to-decoder stack normalizing provider-native records into single IO contract for MWPM/UF/BP/neural-MWPM replay. BP reduces correction volume 48.6-57.1% vs other decoders; preserves sparsity semantics across 4000+ real photonic GKP slices.", "motivation": "Hybrid CV-DV hardware exposes heterogeneous outputs requiring stable logical interface for decoder comparison. Architecture phase demands coupled evaluation of hardware structure, encoding, and decoder policy.", "highlights": [ "BP: 50.4% correction volume reduction", "4000 real-slice replay integrity", "Decoder regime-dependence quantified" ], "keywords": [ { "label": "LiDMaS+", "reason": "Unified execution architecture" }, { "label": "GKP encoding", "reason": "Photonic CV target platform" }, { "label": "decoder benchmarking", "reason": "Regime-dependent policy selection" }, { "label": "syndrome sparsity", "reason": "Preserved hardware semantics" } ], "emoji": "🔗", "social_summary": "Unified decoder stack benchmarks hybrid CV-DV QEC across 4000+ photonic slices.", "highlights_oneliner": "Hybrid CV-DV decoder stack" } ] }, "2026-04-17": { "word_cloud": [ { "word": "threshold", "weight": 5 }, { "word": "decoder", "weight": 5 }, { "word": "lattice", "weight": 4 }, { "word": "heavy-hex", "weight": 4 }, { "word": "dynamic", "weight": 4 }, { "word": "compass", "weight": 4 }, { "word": "symbolic", "weight": 3 }, { "word": "simulator", "weight": 3 }, { "word": "LDPC", "weight": 3 }, { "word": "phantom", "weight": 3 }, { "word": "concatenation", "weight": 3 }, { "word": "lattice surgery", "weight": 3 }, { "word": "qubit loss", "weight": 3 }, { "word": "magic states", "weight": 3 }, { "word": "automorphism", "weight": 2 }, { "word": "STGNN", "weight": 2 }, { "word": "VarQEC", "weight": 2 } ], "social_highlights": "Highlights: dynamic compass code on heavy-hex, symbolic QEC simulator, low-valency codes, LDPC distance bounds, phantom code limits, learning concatenation, topological magic gates, lattice surgery optimization, AI qubit loss decoding.", "papers": [ { "arxiv_id": "2604.14296", "title": "Scalable quantum error correction tailored for a heavy-hex qubit array", "authors": "Seok-Hyung Lee, Xanda C. Kolesnikow, Jun Zen, Evan T. Hockings, Campbell K. McLauchlan, Georgia M. Nixon, Thomas R. Scruby, Stephen D. Bartlett, Robin Harper, Benjamin J. Brown", "arxiv_url": "https://arxiv.org/abs/2604.14296", "pdf_url": "https://arxiv.org/pdf/2604.14296", "summary": "Introduces the dynamic compass code, a subsystem code with novel syndrome extraction for heavy-hex lattice, demonstrating competitive threshold. Implements distance-$5$ code on superconducting qubits, using noise characterization and soft information to improve decoder performance by up to $38.3\\%$ in logical error rate.", "motivation": "Heavy-hex lattices suit superconducting hardware but prior codes like heavy-hex lacked thresholds; tailored decoding addresses device-specific noise for practical scaling. Enables high-fidelity logical qubits, reducing hardware needs for fault-tolerant algorithms.", "highlights": [ "Dynamic compass code threshold", "Distance-$5$ superconducting demo", "38.3% logical error reduction" ], "keywords": [ { "label": "dynamic compass code", "reason": "Novel subsystem code family for heavy-hex with threshold" } ], "emoji": "🧲", "social_summary": "Introduces dynamic compass code for heavy-hex qubits, slashing logical errors by 38% via noise-tailored decoding.", "highlights_oneliner": "Heavy-hex dynamic code demo" }, { "arxiv_id": "2604.15043", "title": "SyQMA: A memory-efficient, symbolic and exact universal simulator for quantum error correction", "authors": "George Umbrarescu, David Amaro", "arxiv_url": "https://arxiv.org/abs/2604.15043", "pdf_url": "https://arxiv.org/pdf/2604.15043", "summary": "Presents SyQMA, a stabilizer simulator extension for universal circuits with Pauli noise, computing exact symbolic expectation values and probabilities. Enables circuit-level decoding, logical error rates, fault distance verification, and detector error models with polynomial memory.", "motivation": "Classical simulation verifies QEC but struggles with non-Clifford gates and dynamic circuits; symbolic exactness aids precise analysis of fault-tolerant protocols. Supports QEC development without approximations, crucial for validating scalable designs.", "highlights": [ "Symbolic exact simulation", "Fault-tolerant verification", "Polynomial memory usage" ], "keywords": [ { "label": "SyQMA", "reason": "Memory-efficient symbolic simulator" }, { "label": "maximum-likelihood decoding", "reason": "Circuit-level QEC decoding" }, { "label": "detector error models", "reason": "Exact Pauli channel conversion" } ], "emoji": "🧮", "social_summary": "SyQMA simulates QEC exactly and symbolically, verifying fault-tolerant protocols with low memory.", "highlights_oneliner": "Symbolic QEC simulator" }, { "arxiv_id": "2604.14299", "title": "Low-valency scalable quantum error correction with a dynamic compass code", "authors": "Jun Zen, Xanda C. Kolesnikow, Campbell K. McLauchlan, Georgia M. Nixon, Thomas R. Scruby, Seok-Hyung Lee, Stephen D. Bartlett, Benjamin J. Brown, Robin Harper", "arxiv_url": "https://arxiv.org/abs/2604.14299", "pdf_url": "https://arxiv.org/pdf/2604.14299", "summary": "Introduces dynamic compass code via novel measurement schedule on heavy-hex lattice, achieving threshold with low-valency connectivity. Evaluates $X$/$Z$ error trade-offs and demonstrates fault-tolerant lattice surgery.", "motivation": "Hardware favors planar low-degree lattices; combining compass and dynamic codes yields thresholded family respecting connectivity constraints. Provides path to scalable fault-tolerant logic on near-term devices.", "highlights": [ "Heavy-hex threshold code", "X/Z error trade-off", "Lattice surgery demo" ], "keywords": [ { "label": "low-valency connectivity", "reason": "Heavy-hex max degree 3" }, { "label": "measurement schedule", "reason": "Dynamic syndrome extraction" }, { "label": "compass codes", "reason": "Gauge group framework" } ], "emoji": "🔄", "social_summary": "Dynamic compass code enables low-valency scalable QEC with threshold on heavy-hex.", "highlights_oneliner": "Low-valency compass code" }, { "arxiv_id": "2604.15307", "title": "Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes", "authors": "Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2604.15307", "pdf_url": "https://arxiv.org/pdf/2604.15307", "summary": "Develops framework for certified minimum distance upper bounds in affine permutation matrix quantum LDPC codes via low-weight logical witnesses. Uses latent relations, restricted lifts, trapping sets, and decoder residuals with kernel/row-space verification.", "motivation": "Quantum LDPC codes promise efficiency but distance evaluation lags; certified upper bounds refine practicality assessments. Sharpens bounds for finite-length codes, guiding construction and decoder design.", "highlights": [ "Certified distance upper bounds", "APM-LDPC witnesses", "Linear growth observation" ], "keywords": [ { "label": "APM-LDPC", "reason": "Affine permutation matrix codes" }, { "label": "upper-bound witnesses", "reason": "Low-weight logicals" }, { "label": "trapping sets", "reason": "Cycle-8 structures" } ], "emoji": "📏", "social_summary": "Heuristic search certifies tight distance upper bounds for quantum LDPC codes.", "highlights_oneliner": "LDPC distance witnesses" }, { "arxiv_id": "2604.15111", "title": "Constraints on phantom codes from automorphism group bounds", "authors": "Arthur S. Morris, Daniel Malz", "arxiv_url": "https://arxiv.org/abs/2604.15111", "pdf_url": "https://arxiv.org/pdf/2604.15111", "summary": "Proves $k \\leq \\log_2(n+1)$ bound for binary phantom codes ($k \\neq 4$) with $d \\geq 2$, from automorphism group structure. Constructs exceptional $k=4$ non-stabilizer code; shows unique CSS family saturates bound.", "motivation": "Phantom codes promise low-depth CNOT via permutations but overhead unknown; bounds quantify rate limits. Informs trade-offs in fault-tolerant circuit compilation strategies.", "highlights": [ "$k \\leq \\log_2(n+1)$ bound", "$[[8,2^4,2]]$ construction", "Automorphism theorem" ], "keywords": [ { "label": "phantom codes", "reason": "Permutation CNOT property" }, { "label": "automorphism group", "reason": "Code structure bound" }, { "label": "encoding rate", "reason": "Logarithmic ceiling" } ], "emoji": "👻", "social_summary": "Proves phantom codes limited to logarithmic rate, except rare $k=4$ case.", "highlights_oneliner": "Phantom code bounds" }, { "arxiv_id": "2604.14931", "title": "Learning to Concatenate Quantum Codes", "authors": "Nico Meyer, Christopher Mutschler, Dominik Seuß, Andreas Maier, Daniel D. Scherer", "arxiv_url": "https://arxiv.org/abs/2604.14931", "pdf_url": "https://arxiv.org/pdf/2604.14931", "summary": "Automates concatenation by estimating per-level noise and tailoring VarQEC or stabilizer codes, using fidelity-only estimator. Achieves up to 100x qubit savings for structured noise via hybrid levels.", "motivation": "Concatenation suppresses errors double-exponentially but noise evolution demands adaptation; ML-tailored codes exploit structure. Reduces overhead for early fault-tolerant computing.", "highlights": [ "Level-wise adaptation", "100x qubit reduction", "VarQEC hybrid" ], "keywords": [ { "label": "code concatenation", "reason": "Double-exponential suppression" }, { "label": "VarQEC", "reason": "Noise-tailored encoders" }, { "label": "two-design estimator", "reason": "Pauli-Liouville recovery" } ], "emoji": "🔗", "social_summary": "Learns optimal code sequence per noise level, slashing qubits by 100x.", "highlights_oneliner": "Adaptive code concatenation" }, { "arxiv_id": "2604.14271", "title": "Magic and Non-Clifford Gates in Topological Quantum Field Theory", "authors": "William Munizzi, Howard J. Schnitzer", "arxiv_url": "https://arxiv.org/abs/2604.14271", "pdf_url": "https://arxiv.org/pdf/2604.14271", "summary": "Constructs non-Clifford gates like Ising, Toffoli, T via TQFT path integrals: Chern-Simons for Ising/Toffoli, Dijkgraaf-Witten for T. Magic from algebraic data and mapping class groups.", "motivation": "Non-Cliffords enable universality but hard in topological codes; TQFT path integrals naturally generate hierarchy levels. Suggests topological platforms for fault-tolerant universal gates.", "highlights": [ "TQFT path integral gates", "SU(2)_3 Toffoli", "Dehn twist T-gate" ], "keywords": [ { "label": "TQFT path integrals", "reason": "Non-Clifford construction" }, { "label": "Chern-Simons", "reason": "Ising/Toffoli gates" }, { "label": "Clifford hierarchy", "reason": "Magic generation" } ], "emoji": "🌀", "social_summary": "Derives magic gates like T and Toffoli from topological field theory path integrals.", "highlights_oneliner": "TQFT magic gates" }, { "arxiv_id": "2604.15099", "title": "O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling", "authors": "Chenghong Zhu, Xian Wu, Jiahan Chen, Keming He, Junjie Wu, Xin Wang, Lingling Lao", "arxiv_url": "https://arxiv.org/abs/2604.15099", "pdf_url": "https://arxiv.org/pdf/2604.15099", "summary": "O3LS optimizes surface code lattice surgery with squeezed layouts, loose scheduling, Y-synthesis, reducing space 28-47% and time 25-36%. Suppresses logical errors up to 16% vs. priors.", "motivation": "Lattice surgery enables FTQC but layout/scheduling trade-offs inflate overhead; balanced optimization cuts resources. Lowers failure rates for practical surface code algorithms.", "highlights": [ "28% space reduction", "36% time savings", "16% error suppression" ], "keywords": [ { "label": "lattice surgery", "reason": "Surface code FTQC" }, { "label": "loose scheduling", "reason": "Time optimization" }, { "label": "squeezed layouts", "reason": "Space efficiency" } ], "emoji": "🧩", "social_summary": "O3LS cuts lattice surgery space 28% and time 36%, boosting error suppression.", "highlights_oneliner": "Lattice surgery optimizer" }, { "arxiv_id": "2604.14269", "title": "AI-Enabled Decoding of Qubit Loss for Quantum Error-Correcting Codes", "authors": "Yuqing Wang, Xiaotian Nie, Jiale Dai, Zhongyi Ni, Tao Zhang, Hui Zhai, Linghui Chen", "arxiv_url": "https://arxiv.org/abs/2604.14269", "pdf_url": "https://arxiv.org/pdf/2604.14269", "summary": "STGNN decoder corrects Pauli errors and locates qubit loss from syndrome histories, outperforming MWPM variants. Identifies >90% losses after 10 rounds for reinitialization.", "motivation": "Qubit loss breaks stabilizer formalism, complicating decoding; AI extracts spatiotemporal correlations. Enables loss-tolerant QEC for platforms like atom arrays.", "highlights": [ "Dual-head STGNN", "90% loss detection", "MWPM superiority" ], "keywords": [ { "label": "qubit loss", "reason": "Major error source" }, { "label": "STGNN", "reason": "Spatiotemporal decoder" }, { "label": "syndrome history", "reason": "Flicker patterns" } ], "emoji": "🤖", "social_summary": "AI decoder fixes Pauli errors and pinpoints qubit losses with 90% accuracy.", "highlights_oneliner": "AI loss decoding" } ] }, "2026-04-16": { "word_cloud": [ { "word": "surface code", "weight": 5 }, { "word": "twist defects", "weight": 4 }, { "word": "spacetime volume", "weight": 4 }, { "word": "logical S gate", "weight": 5 }, { "word": "Iceberg code", "weight": 4 }, { "word": "error detection", "weight": 5 }, { "word": "Toffoli circuit", "weight": 3 }, { "word": "break-even", "weight": 4 }, { "word": "trapped-ion", "weight": 3 }, { "word": "fault distance", "weight": 3 }, { "word": "logical error rate", "weight": 4 }, { "word": "braiding protocol", "weight": 3 }, { "word": "nearest-neighbor gates", "weight": 3 }, { "word": "syndrome extraction", "weight": 3 }, { "word": "Bell state", "weight": 2 }, { "word": "code deformation", "weight": 3 }, { "word": "T-gate teleportation", "weight": 3 } ], "social_highlights": "Highlights: shrinks logical S gate spacetime volume to $2d \\times d \\times d$ in surface code, achieves fault-tolerant error detection beyond break-even for multi-qubit gates on trapped-ion hardware.", "papers": [ { "arxiv_id": "2604.13632", "title": "A $\\boldsymbol{2d \\times d \\times d}$ Spacetime Volume Implementation of a Logical S Gate in the Surface Code", "authors": "Yuga Hirai, Shota Ikari, Yosuke Ueno, Yasunari Suzuki", "arxiv_url": "https://arxiv.org/abs/2604.13632", "pdf_url": "https://arxiv.org/pdf/2604.13632", "summary": "Proposes a novel twist defect braiding protocol reducing logical S gate spacetime volume to $2d \\times d \\times d$ using nearest-neighbor gates on square grid. Provides circuit-level implementations for existing $2d \\times 2d \\times d$ and $2d \\times 1.5d \\times d$ methods. Simulations show comparable logical error rates to existing methods at large $d \\ge 5$ and $p \\approx 10^{-3}$ despite reduced fault distance.", "motivation": "Logical S gates via twist defect braiding in surface code cause high overhead in fault-tolerant quantum computing, especially with frequent S-gate corrections in T-gate teleportation. Reducing spacetime volume is crucial as surface code is promising for its local interactions, high threshold, and efficient decoding.", "highlights": [ "$2d \\times d \\times d$ spacetime volume for logical S gate", "Nearest-neighbor gate implementation", "Comparable logical error rates at $d \\ge 5$" ], "keywords": [ { "label": "twist defect braiding", "reason": "Core technique for implementing logical S gate in surface code" }, { "label": "surface code", "reason": "Primary QEC code targeted for spacetime optimization" }, { "label": "spacetime volume", "reason": "Key metric reduced from prior $2d \\times 2d \\times d$ and $2d \\times 1.5d \\times d$" }, { "label": "fault distance", "reason": "Evaluated metric showing trade-off in proposed protocol" } ], "emoji": "🧭", "social_summary": "Devised $2d \\times d \\times d$ spacetime logical S gate via twist braiding, matching error rates of larger prior methods.", "highlights_oneliner": "Compact logical S gate" }, { "arxiv_id": "2604.13219", "title": "Fault-Tolerant Error Detection Above Break-Even for Multi-Qubit Gates", "authors": "Colburn Riffel, Reece Robertson, Peter Hendrickson", "arxiv_url": "https://arxiv.org/abs/2604.13219", "pdf_url": "https://arxiv.org/pdf/2604.13219", "summary": "Demonstrates fault-tolerant Iceberg $[[2m,2m-2,2]]$ code on trapped-ion hardware achieving beyond-break-even error detection for Toffoli circuits, with encoded fidelity exceeding unencoded. Applies lean non-fault-tolerant Iceberg to Bell state preparation for fidelity gain. Emphasizes judicious circuit compilation for hardware and QED codes.", "motivation": "Quantum error detection filters error-prone runs effectively for small-scale circuits with many error-free executions, complementing full correction. Iceberg code enables practical QED for multi-qubit gates on near-term trapped-ion systems.", "highlights": [ "Beyond-break-even for Toffoli via Iceberg", "Fidelity gain in Bell states", "Circuit compilation necessity" ], "keywords": [ { "label": "Iceberg code", "reason": "Specific $[[2m,2m-2,2]]$ QED code demonstrated experimentally" }, { "label": "break-even detection", "reason": "Achieved fidelity threshold where encoded outperforms unencoded" }, { "label": "trapped-ion hardware", "reason": "Platform for fault-tolerant multi-qubit gate experiments" }, { "label": "Toffoli circuit", "reason": "Key application showing error detection efficacy" } ], "emoji": "⚡", "social_summary": "Fault-tolerant Iceberg code beats break-even on trapped-ion Toffoli gates, boosting encoded fidelity.", "highlights_oneliner": "Break-even error detection" } ] }, "2026-04-15": { "word_cloud": [ { "word": "surface code", "weight": 5 }, { "word": "decoding", "weight": 5 }, { "word": "stabilizer", "weight": 4 }, { "word": "logical error rate", "weight": 4 }, { "word": "neural network", "weight": 3 }, { "word": "lattice surgery", "weight": 3 }, { "word": "noise model", "weight": 3 }, { "word": "fidelity", "weight": 3 }, { "word": "catalytic", "weight": 3 }, { "word": "SAT solver", "weight": 2 }, { "word": "quasi-orthogonal", "weight": 2 }, { "word": "syndrome extraction", "weight": 2 }, { "word": "target estimation", "weight": 2 }, { "word": "code distance", "weight": 2 }, { "word": "depolarizing noise", "weight": 2 }, { "word": "GPU acceleration", "weight": 2 }, { "word": "logical operations", "weight": 2 }, { "word": "threshold", "weight": 2 } ], "social_highlights": "Highlights: AI-accelerated surface-code decoding at microsecond speeds, automated design of fault-tolerant logical gates via SAT, quasi-orthogonal stabilizer codes with improved rates, blind catalytic recovery without target-state knowledge", "papers": [ { "arxiv_id": "2604.12841", "title": "Fast and accurate AI-based pre-decoders for surface codes", "authors": "Christopher Chamberland, Jan Olle, Muyuan Li, Scott Thornton, Igor Baratta", "arxiv_url": "https://arxiv.org/abs/2604.12841", "pdf_url": "https://arxiv.org/pdf/2604.12841", "summary": "Introduces a scalable AI-based pre-decoder for surface codes achieving $\\mathcal{O}(1 \\mu\\text{s})$ decoding runtimes on GPUs while reducing logical error rates relative to global decoding alone. The modular architecture composes with arbitrary global decoders and includes a noise-learning module that infers decoding weights directly from syndrome statistics without explicit circuit-level noise models. Demonstrates end-to-end improvements over PyMatching and validates practical applicability for large-distance implementations.", "motivation": "Real-time fault-tolerant quantum computing requires fast, scalable decoding that can handle syndrome information at rates matching physical qubit operation timescales. Existing classical decoders face latency bottlenecks; machine learning offers a pathway to parallel, hardware-accelerated decoding that adapts to unknown or time-varying noise.", "highlights": [ "Achieves $\\mathcal{O}(1 \\mu\\text{s})$ per-round decoding on GB300 GPUs at large code distances", "Noise-learning architecture infers weights from experimental syndrome statistics without circuit models", "Outperforms correlated PyMatching up to distance-13 with larger trained models" ], "keywords": [ { "label": "surface code", "reason": "Primary code family; block-wise parallel decoding architecture designed specifically for surface-code syndrome patterns" }, { "label": "neural network decoder", "reason": "Core technical contribution; AI-based pre-decoder performs local parallel error correction before global decoding" }, { "label": "GPU acceleration", "reason": "Key practical enabler; demonstrates microsecond-scale runtimes via NVIDIA GB300 hardware implementation" }, { "label": "noise-learning", "reason": "Novel capability; infers decoding weights from data without requiring explicit noise model knowledge" } ], "emoji": "⚡", "social_summary": "Accelerate surface-code decoding to microsecond speeds using AI pre-decoders that learn noise patterns from experimental data.", "highlights_oneliner": "AI-powered microsecond surface-code decoding" }, { "arxiv_id": "2604.12560", "title": "Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings", "authors": "Wang Liao, Rei Tokami, Yasunari Suzuki", "arxiv_url": "https://arxiv.org/abs/2604.12560", "pdf_url": "https://arxiv.org/pdf/2604.12560", "summary": "Proposes KOVAL-Q, an EDA kernel that optimizes and verifies surface-code logical operations by formulating them as satisfiability problems, supporting flexible multi-qubit patch encodings beyond single-qubit patches. Demonstrates $\\sim 10\\%$ execution-time reduction for fundamental operations like $d$-cycle logical CNOTs and $2d$-cycle patch rotations on general surface-code layouts. Provides a reusable framework for subroutine optimization and whole-circuit verification compatible with scalable heuristic frameworks.", "motivation": "Fault-tolerant quantum computers require systematic design of logical operations with minimal space-time overhead, analogous to classical EDA tools. Existing SAT-based frameworks like LaSsynth are limited to single-qubit patches; extending to general encodings enables optimization of advanced layouts and broader exploration of design space.", "highlights": [ "Handles flexible surface-code encodings including multi-qubit patches as target and intermediate states", "Reduces logical CNOT and patch-rotation execution times by $\\sim 10\\%$ under simplified scheduling", "Formulates all constraints via stabilizer faces as decision variables, enabling modular integration into larger frameworks" ], "keywords": [ { "label": "SAT solver", "reason": "Core methodology; formulates logical-operation design as satisfiability problem for optimal verification and synthesis" }, { "label": "surface code", "reason": "Primary code family; KOVAL-Q optimizes logical operations on general surface-code encodings including lattice surgery" }, { "label": "logical gates", "reason": "Key optimization target; reduces space-time cost of CNOTs, rotations, and other Clifford operations" }, { "label": "EDA kernel", "reason": "Architectural contribution; provides reusable design-automation framework for fault-tolerant quantum circuits" } ], "emoji": "🔧", "social_summary": "Automate fault-tolerant quantum circuit design with SAT-based optimization reducing logical-gate execution time by 10%.", "highlights_oneliner": "SAT-based design automation for surface codes" }, { "arxiv_id": "2604.12684", "title": "Quasi-Orthogonal Stabilizer Design for Efficient Quantum Error Suppression", "authors": "Valentine Nyirahafashimana, Sharifah Kartini Said Husain, Umair Abdul Halim, Ahmed Jellal, Nurisya Mohd Shah", "arxiv_url": "https://arxiv.org/abs/2604.12684", "pdf_url": "https://arxiv.org/pdf/2604.12684", "summary": "Introduces a quasi-orthogonal geometric framework for stabilizer codes that relaxes strict orthogonality constraints while preserving symplectic commutation structure, enabling controlled overlap between $X$- and $Z$-check supports. Demonstrates finite-length codes ($[[8,3,\\approx 3]]$, $[[10,4,\\approx 3]]$, $[[13,1,5]]$, $[[29,1,11]]$) achieving up to two orders of magnitude improvement in logical error rates under depolarizing noise ($p \\leq 0.30$). Approaches Gilbert-Varshamov regime with improved logical rates at moderate distances while remaining compatible with standard decoding schemes.", "motivation": "Strict orthogonality in traditional stabilizer codes limits design flexibility and resource efficiency, constraining code parameters and requiring hundreds of physical qubits. Relaxing these geometric constraints while maintaining error-correction properties enables denser parity checks and higher logical rates, reducing overhead for near-term implementations.", "highlights": [ "Quasi-orthogonal codes reduce logical error rates by up to two orders of magnitude at $p=0.30$ depolarizing noise", "Achieves improved logical rates approaching Gilbert-Varshamov bound at moderate distances", "Reduces physical-qubit overhead to tens of qubits versus hundreds for traditional stabilizer codes" ], "keywords": [ { "label": "quasi-orthogonal geometry", "reason": "Core innovation; relaxes orthogonality constraints on stabilizer supports while preserving symplectic structure" }, { "label": "stabilizer codes", "reason": "Code family; quasi-orthogonal framework extends classical stabilizer design with controlled $X$-$Z$ overlap" }, { "label": "logical error rate", "reason": "Key performance metric; demonstrates two-order-magnitude improvements under depolarizing noise" }, { "label": "code distance", "reason": "Design parameter; generalized effective distance defined via anti-commutation with logical operators" } ], "emoji": "🔷", "social_summary": "Relax orthogonality constraints in stabilizer codes to achieve two-order-magnitude error-rate improvements with fewer qubits.", "highlights_oneliner": "Quasi-orthogonal stabilizer codes with improved rates" }, { "arxiv_id": "2604.11857", "title": "Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without A Priori Knowledge", "authors": "Hikaru Wakaura", "arxiv_url": "https://arxiv.org/abs/2604.11857", "pdf_url": "https://arxiv.org/pdf/2604.11857", "summary": "Introduces blind catalytic quantum error correction (CQEC), which estimates the target state from noisy output alone before catalytic recovery, removing the requirement of prior target-state knowledge. Benchmarks five estimation strategies across three noise models, four quantum algorithms ($d=4$–$64$), and Haar-random states up to $d=256$, finding that coherence maximization achieves $F_{\\text{rec}} > 0.95$ for $d \\leq 16$ without noise-model knowledge. Demonstrates $3.4\\times$ energy-error reduction in end-to-end VQE for $\\text{H}_2$ and identifies an analytical crossover dimension $d^* \\approx 25$–$40$ separating noise-model-free and noise-informed regimes.", "motivation": "Catalytic QEC is threshold-free and reusable but requires complete knowledge of the target state, limiting applicability to variational and iterative quantum algorithms where the ideal output is unknown. Blind CQEC removes this principal conceptual gap, enabling practical error correction in realistic scenarios without oracle knowledge.", "highlights": [ "Coherence maximization achieves $F_{\\text{rec}} > 0.95$ for $d \\leq 16$ without noise-model knowledge, matching oracle within 4%", "Estimation and recovery fidelities linearly correlated ($r > 0.99$), identifying target estimation as sole bottleneck", "Analytical crossover at $d^* \\approx 25$–$40$ separates noise-model-free and noise-informed regimes with hybrid interpolation strategy" ], "keywords": [ { "label": "catalytic quantum error correction", "reason": "Core technique; threshold-free recovery via catalytic covariant transformations without encoding overhead" }, { "label": "target estimation", "reason": "Key innovation; estimates target state from noisy output alone, removing prior-knowledge requirement" }, { "label": "fidelity recovery", "reason": "Performance metric; demonstrates $3.4\\times$ energy-error reduction in VQE and $F_{\\text{rec}} > 0.95$ for small dimensions" }, { "label": "noise-model-free regime", "reason": "Practical capability; coherence maximization works without explicit noise characterization up to $d \\approx 25$" } ], "emoji": "✨", "social_summary": "Recover quantum states without knowing the target using blind catalytic error correction—no encoding overhead required.", "highlights_oneliner": "Blind catalytic recovery without target knowledge" } ] }, "2026-04-14": { "word_cloud": [ { "word": "morphing", "weight": 5 }, { "word": "circuits", "weight": 4 }, { "word": "bicycle", "weight": 5 }, { "word": "peeling", "weight": 5 }, { "word": "decoding", "weight": 4 }, { "word": "iceberg", "weight": 4 }, { "word": "compilation", "weight": 4 }, { "word": "autonomous", "weight": 4 }, { "word": "spin-oscillator", "weight": 4 }, { "word": "hybrid", "weight": 3 }, { "word": "mitigation", "weight": 4 }, { "word": "variational", "weight": 4 }, { "word": "PDE", "weight": 4 }, { "word": "greedy", "weight": 3 }, { "word": "latency", "weight": 3 }, { "word": "connectivity", "weight": 3 }, { "word": "high-rate", "weight": 3 }, { "word": "measurement-free", "weight": 3 }, { "word": "ZNE", "weight": 3 } ], "social_highlights": "Highlights: morphing circuits optimize QEC connectivity, logical compilation boosts high-rate code performance, autonomous correction for hybrid qubits, greedy peeling slashes BB code latency, error mitigation powers variational PDE solvers.", "papers": [ { "arxiv_id": "2604.09797", "title": "Optimising Quantum Error Correction Using Morphing Circuits", "authors": "Mackenzie H. Shaw, Barbara M. Terhal", "arxiv_url": "https://arxiv.org/abs/2604.09797", "pdf_url": "https://arxiv.org/pdf/2604.09797", "summary": "Introduces morphing circuits to optimize syndrome extraction for QEC codes in terms of connectivity, gate choice (ISWAP vs CNOT), and qubit count. Demonstrates alternating syndrome circuits as two-round morphing with easier fault-tolerance analysis. Finds new Abelian 2BGA codes with improved parameters and connectivity.", "motivation": "Traditional QEC code searches ignore specific syndrome circuit implementations, limiting hardware optimization. Morphing circuits from recent works enable direct tailoring to connectivity and gate constraints, crucial for practical fault-tolerant quantum computing.", "highlights": [ "Alternating circuits as 2-round morphing", "New 2BGA codes beat existing parameters", "Handles boundaries and single-shot properties" ], "keywords": [ { "label": "morphing circuits", "reason": "core optimization technique for syndrome extraction" }, { "label": "2BGA codes", "reason": "specific Abelian code family improved" }, { "label": "ISWAP vs CNOT", "reason": "key gate choice parameter" }, { "label": "alternating extraction", "reason": "fault-tolerant circuit design" } ], "emoji": "🔄", "social_summary": "Morphing circuits optimize QEC codes for better connectivity and gates!", "highlights_oneliner": "Morphing QEC circuits" }, { "arxiv_id": "2604.09956", "title": "Logical Compilation for Multi-Qubit Iceberg Patches", "authors": "Cordell Mazzetti, Sayam Sethi, Rich Rines, Pranav Gokhale, Jonathan Mark Baker", "arxiv_url": "https://arxiv.org/abs/2604.09956", "pdf_url": "https://arxiv.org/pdf/2604.09956", "summary": "Proposes logical-to-physical compilation framework for high-rate codes using Hadamard commutation, gate merging, and noise-biased mapping heuristics. Addresses qubit mapping for $k>1$ codes to maximize fidelity despite reduced error tolerance. Achieves 34% depth reduction and 1.75× TVD improvement across benchmarks.", "motivation": "High-rate QEC codes enable more logical qubits per patch but suffer correlated errors across logicals, unaddressed by prior low-rate compilation. With qubit-limited architectures, optimal logical mapping becomes critical for FTQC roadmaps.", "highlights": [ "$34\\%$ circuit depth reduction", "86% logical selection improvement", "First high-rate code compiler" ], "keywords": [ { "label": "Iceberg code", "reason": "target high-rate QED code family" }, { "label": "logical mapping", "reason": "solves $O(n!)$ qubit assignment" }, { "label": "gate merging", "reason": "key compilation optimization" }, { "label": "$[[4,2,2]]$ patch", "reason": "benchmark code parameters" } ], "emoji": "🧊", "social_summary": "New compiler slashes depth 34% for multi-logical Iceberg codes!", "highlights_oneliner": "Iceberg logical compiler" }, { "arxiv_id": "2604.11145", "title": "Autonomous Quantum Error Correction of Spin-Oscillator Hybrid Qubits", "authors": "Sungjoo Cho, Ju-yeon Gyhm, Hyukjoon Kwon, Hyunseok Jeong", "arxiv_url": "https://arxiv.org/abs/2604.11145", "pdf_url": "https://arxiv.org/pdf/2604.11145", "summary": "Proposes measurement-free autonomous QEC stabilizing spin-oscillator hybrid qubits via engineered Lindbladian with code space as attractive steady state. Uses controlled beam-splitter and spin-dependent displacement for continuous-variable discrete-variable hybrid dissipation. Enables hardware-efficient logical qubits without syndrome measurements.", "motivation": "Conventional autonomous QEC requires complex system-bath couplings; hybrid systems need measurement-free stabilization. Demonstrated primitives in trapped ions make this practical for noise-biased hardware.", "highlights": [ "Measurement-free stabilization", "Engineered attractive code space", "Trapped-ion compatible" ], "keywords": [ { "label": "autonomous QEC", "reason": "measurement-free error correction" }, { "label": "spin-oscillator", "reason": "hybrid qubit platform" }, { "label": "Lindbladian engineering", "reason": "steady-state stabilization" }, { "label": "beam-splitter interaction", "reason": "key dissipative primitive" } ], "emoji": "🔄", "social_summary": "Autonomous QEC stabilizes hybrid qubits without measurements!", "highlights_oneliner": "Autonomous hybrid QEC" }, { "arxiv_id": "2604.11352", "title": "Analytical Theory of Greedy Peeling for Bivariate Bicycle Codes and Two-Shot Streaming Decoding", "authors": "Anton Pakhunov", "arxiv_url": "https://arxiv.org/abs/2604.11352", "pdf_url": "https://arxiv.org/pdf/2604.11352", "summary": "Develops analytical theory for greedy peeling decoder on BB codes, deriving collision factor $A_0=0.8685$ for Gross $[[144,12,12]]$ code. Achieves 330× latency reduction vs BP at $p=10^{-3}$ with matching LER. Enables two-shot $[[32,8,6]]$ decoding at 89% success, ~50 ns latency.", "motivation": "BP decoding latencies hinder BB code use despite high rates; greedy peeling exploits sparse fault graphs but lacks theory. Analytical $A_0$ explains 13.2% birthday bound overestimate.", "highlights": [ "$A_0=0.8685$ collision factor", "330× latency reduction", "Two-shot $[[32,8,6]]$ decoding" ], "keywords": [ { "label": "greedy peeling", "reason": "low-latency BB decoder" }, { "label": "bivariate bicycle", "reason": "target LDPC code family" }, { "label": "collision factor $A_0$", "reason": "analytical theory contribution" }, { "label": "Gross code", "reason": "$[[144,12,12]]$ benchmark" } ], "emoji": "📉", "social_summary": "Greedy peeling cuts BB decoding latency 330x with theory!", "highlights_oneliner": "BB peeling theory" }, { "arxiv_id": "2604.10099", "title": "Quantum Error Mitigation Strategies for Variational PDE-Constrained Circuits on Noisy Hardware", "authors": "Prasad Nimantha Madusanka Ukwatta Hewage, Midhun Chakkravarthy, Ruvan Kumara Abeysekara", "arxiv_url": "https://arxiv.org/abs/2604.10099", "pdf_url": "https://arxiv.org/pdf/2604.10099", "summary": "Benchmarks ZNE, PEC, measurement mitigation on PDE-constrained VQCs for heat, Burgers', Saint-Venant equations under depolarizing, amplitude damping, bit-flip noise. ZNE cuts error 82-96% at low noise; physics constraints yield 25-47% fidelity gain. Proves inherent noise resilience scaling with PDE complexity.", "motivation": "NISQ PDE solvers suffer noise-disrupted convergence; physics constraints alter error propagation vs standard VQAs. QEM effectiveness for spatially-distributed PDE residuals unstudied.", "highlights": [ "ZNE: 82-96% error reduction", "Physics resilience: +25-47% fidelity", "Systematic errors dominate budget" ], "keywords": [ { "label": "variational PDE", "reason": "physics-constrained VQCs" }, { "label": "zero-noise extrapolation", "reason": "best mitigation strategy" }, { "label": "physics-informed", "reason": "inherent noise resilience" }, { "label": "error budget", "reason": "systematic vs residual analysis" } ], "emoji": "📊", "social_summary": "ZNE slashes PDE solver errors 96% on noisy quantum hardware!", "highlights_oneliner": "PDE QEM strategies" } ] }, "2026-04-13": { "word_cloud": [ { "word": "toric", "weight": 4 }, { "word": "Majorana", "weight": 4 }, { "word": "GKP", "weight": 4 }, { "word": "erasure", "weight": 4 }, { "word": "qutrit", "weight": 4 }, { "word": "coherent", "weight": 3 }, { "word": "loss", "weight": 3 }, { "word": "transmon", "weight": 3 }, { "word": "CQEC", "weight": 3 }, { "word": "honeycomb", "weight": 3 }, { "word": "repeaters", "weight": 3 }, { "word": "MAO-A", "weight": 3 }, { "word": "symmetry", "weight": 2 }, { "word": "decodability", "weight": 2 }, { "word": "superconducting", "weight": 2 }, { "word": "tunneling", "weight": 2 }, { "word": "parity", "weight": 2 }, { "word": "dynamical", "weight": 2 }, { "word": "decoherence", "weight": 2 }, { "word": "threshold", "weight": 2 } ], "social_highlights": "Highlights: duality maps toric code decoding to Majorana dynamics, GKP enables loss-tolerant repeaters, transmon qutrits boost erasure qubits, CQEC tests quantum brain coherence.", "papers": [ { "arxiv_id": "2604.08650", "title": "Decoding coherent errors in toric codes on honeycomb and square lattices: duality to Majorana monitored dynamics and symmetry classes", "authors": "Zhou Yang, Andreas W. W. W. Ludwig, Chao-Ming Jian", "arxiv_url": "https://arxiv.org/abs/2604.08650", "pdf_url": "https://arxiv.org/pdf/2604.08650", "summary": "Establishes duality between toric code decoding under $X$- and $Z$-type coherent errors and $1+1$D Majorana fermion monitored dynamics, with symmetry classes governing decodability phase diagrams. Honeycomb toric code ($hTC$) with $X$-errors dual to class-DIII, others to class-D. Maps phase transitions to entanglement scaling changes or topological shifts using two-parameter error models.", "motivation": "Topological stabilizer codes like toric codes are key for fault-tolerant quantum computing, but coherent errors from gate imperfections introduce interference effects beyond stochastic noise models. Understanding decodability under coherent errors is crucial for realistic noise in superconducting qubit architectures.", "highlights": [ "Duality to Majorana monitored dynamics", "Class-DIII vs class-D transitions", "$hTC$ more robust than $sTC$" ], "keywords": [ { "label": "toric code", "reason": "Central code family studied on honeycomb and square lattices" }, { "label": "Majorana dynamics", "reason": "Duality mapping for decoding coherent errors" }, { "label": "Altland-Zirnbauer classes", "reason": "Govern universal decodability phase structure" }, { "label": "spatially varying errors", "reason": "Minimal model revealing vulnerability differences" } ], "emoji": "🧭", "social_summary": "Maps toric code coherent error decoding to Majorana fermion dynamics, revealing symmetry-driven phase diagrams.", "highlights_oneliner": "Toric coherent decoding duality" }, { "arxiv_id": "2604.09002", "title": "Loss-Tolerant Quantum Communication via Bosonic-GKP-Parity-Encoding", "authors": "S. Nibedita Swain, Timothy C. Ralph", "arxiv_url": "https://arxiv.org/abs/2604.09002", "pdf_url": "https://arxiv.org/pdf/2604.09002", "summary": "Demonstrates loss suppression in GKP-based quantum repeaters via teleamplifier protocols, computing secure key rates with analog syndromes. Proposes concatenated Bell state measurement with modified parity encoding and clipping to correct loss without logical errors. Achieves photonic-qubit comparable performance with fewer qubits.", "motivation": "Photon loss limits medium-distance quantum communication, necessitating quantum repeaters for polynomial scaling in secure quantum networks. Bosonic GKP codes offer room-temperature loss correction, enhancing repeater efficiency over photonic qubits.", "highlights": [ "Teleamplifier optimal for loss suppression", "CBSM with clipping error-free", "Fewer qubits than photonic schemes" ], "keywords": [ { "label": "GKP code", "reason": "Core bosonic encoding for loss-tolerant repeaters" }, { "label": "teleamplifier", "reason": "Optimal relay protocol suppressing transmission loss" }, { "label": "CBSM", "reason": "Concatenated parity scheme with clipping" }, { "label": "secure key rates", "reason": "Computed using analog syndrome info" } ], "emoji": "🔗", "social_summary": "GKP repeaters conquer photon loss with error-free parity encoding, rivaling photonic qubits.", "highlights_oneliner": "GKP loss-tolerant repeaters" }, { "arxiv_id": "2604.08672", "title": "Hardware-Efficient Erasure Qubits With Superconducting Transmon Qutrits", "authors": "Bao-Jie Liu, Ying-Ying Wang, Yu-Xin Wang, Manthan Badbaria, Shruti Puri, Chen Wang", "arxiv_url": "https://arxiv.org/abs/2604.08672", "pdf_url": "https://arxiv.org/pdf/2604.08672", "summary": "Implements transmon qutrits as erasure qubits using ground and second-excited states, detecting relaxation via ancilla SWAP gate. Achieves $T_1 > 500\\,\\mu$s post-selected, $10\\times$ physical $T_1$, with coherence $>300\\,\\mu$s and $10^{-4}$ Clifford infidelity. Demonstrates dual-purpose ancilla for erasure and parity, heralding Bell states.", "motivation": "Erasure qubits boost QEC thresholds by converting decoherence to detectable erasures, but dual-rail schemes add hardware overhead. Hardware-efficient qutrit erasure leverages standard transmon arrays for scalable fault-tolerance.", "highlights": [ "$T_1 > 500\\,\\mu$s erasure qubit", "$10\\times$ physical $T_1$ gain", "Heralded Bell states" ], "keywords": [ { "label": "erasure qubit", "reason": "Qutrit-based with detectable relaxation" }, { "label": "transmon qutrit", "reason": "Hardware-efficient physical platform" }, { "label": "SWAP gate", "reason": "Mid-circuit erasure detection" }, { "label": "dynamical decoupling", "reason": "Extends coherence to $>300\\,\\mu$s" } ], "emoji": "⚡", "social_summary": "Transmon qutrits deliver hardware-efficient erasure qubits with 10x longer lifetimes.", "highlights_oneliner": "Qutrit erasure qubits" }, { "arxiv_id": "2604.08587", "title": "Covariant quantum error correction in a three-layer quantum brain model: computational analysis of layer-specific coherence dynamics", "authors": "Hikaru Wakaura", "arxiv_url": "https://arxiv.org/abs/2604.08587", "pdf_url": "https://arxiv.org/pdf/2604.08587", "summary": "Integrates three-layer model ($^{31}$P spins, electron interface, electrochemistry) with approximate CQEC via swap tests, benchmarking error correction. Layer 1 coherence-preserving ($\\gamma_\\mathrm{eff} \\approx 10^{-6}$), Layer 2 decoherence-dominated ($F \\approx 0.51$). CQEC enables 168-fold L$\\leftrightarrow$R tunneling in decision task, distinguishing quantum oscillations.", "motivation": "Quantum brain hypotheses like Posner clusters lack quantitative tests at biological parameters, debating coherence relevance. Provides framework identifying coherence regimes and quantum signatures versus classical models.", "highlights": [ "Layer-specific $\\gamma_\\mathrm{eff}$ dichotomy", "168-fold tunneling coherence", "Quantum vs classical distinction" ], "keywords": [ { "label": "CQEC", "reason": "Approximate covariant error correction" }, { "label": "quantum brain", "reason": "Three-layer MAO-A model" }, { "label": "$^{31}$P spins", "reason": "Coherence-preserving Layer 1 memory" }, { "label": "tunneling coherence", "reason": "Quantum signature in decision task" } ], "emoji": "🧐", "social_summary": "CQEC reveals layer-specific quantum coherence in brain-inspired spin model.", "highlights_oneliner": "Quantum brain CQEC" } ] }, "2026-04-10": { "word_cloud": [ { "word": "decoder", "weight": 5 }, { "word": "neural", "weight": 4 }, { "word": "GKP", "weight": 4 }, { "word": "VQAs", "weight": 4 }, { "word": "BB", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "squeezing", "weight": 3 }, { "word": "belief", "weight": 3 }, { "word": "propagation", "weight": 3 }, { "word": "Gross", "weight": 3 }, { "word": "stabilizer", "weight": 3 }, { "word": "syndrome", "weight": 3 }, { "word": "NISQ", "weight": 3 }, { "word": "FT", "weight": 3 }, { "word": "convolutional", "weight": 2 }, { "word": "preprocessing", "weight": 2 }, { "word": "convergence", "weight": 2 }, { "word": "waterfall", "weight": 2 } ], "social_highlights": "Highlights: neural decoders hit $10^{-10}$ errors, VQAs roadmap to FT, optimized GKP preprocessing, BP convergence prediction for BB codes.", "papers": [ { "arxiv_id": "2604.08358", "title": "Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation", "authors": "Andi Gu, J. Pablo Bonilla Ataides, Mikhail D. Lukin, Susanne F. Yelin", "arxiv_url": "https://arxiv.org/abs/2604.08358", "pdf_url": "https://arxiv.org/pdf/2604.08358", "summary": "Introduces a convolutional neural network decoder exploiting geometric structure of quantum low-density parity-check codes, achieving up to 17x lower logical error rates than existing decoders for the $[[144,12,12]]$ Gross code at $p=0.1\\%$. Demonstrates a 'waterfall' regime of error suppression with real-time latencies suitable for leading hardware platforms and well-calibrated confidence estimates.", "motivation": "Quantum error correction requires fast, accurate classical decoders to match quantum hardware speeds, but existing algorithms fail to fully exploit promising qLDPC codes. This work addresses the gap by enabling practical fault-tolerance with modest code sizes at current physical error rates.", "highlights": [ "$P_L \\sim 10^{-10}$ at $p=0.1\\%$ for $[[144,12,12]]$", "17x better than existing decoders", "3-5 orders higher throughput" ], "keywords": [ { "label": "neural decoder", "reason": "Introduces convolutional neural network exploiting code geometry" }, { "label": "qLDPC codes", "reason": "Targets Gross code $[[144,12,12]]$ family" }, { "label": "waterfall regime", "reason": "Novel error suppression demonstrating attainable thresholds" }, { "label": "confidence estimates", "reason": "Well-calibrated for repeat-until-success protocols" } ], "emoji": "👁‍👁", "social_summary": "Neural decoders slash logical errors 17x for Gross codes, hitting $10^{-10}$ at current noise levels.", "highlights_oneliner": "Neural qLDPC decoder breakthrough" }, { "arxiv_id": "2604.07909", "title": "A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing", "authors": "Zhirao Wang, Junxiang Huang, Runyu Ye, Qingyu Li, Qi-Ming Ding, Yiming Huang, Ting Zhang, Yumeng Zeng, Jianshu Gao, Xiao Yuan, Yuan Yao", "arxiv_url": "https://arxiv.org/abs/2604.07909", "pdf_url": "https://arxiv.org/pdf/2604.07909", "summary": "Systematically reviews variational quantum algorithms from NISQ to fault-tolerant regimes, analyzing ansatz design, optimization, barren plateaus, and error mitigation strategies. Explores integration with partial and full error correction, synthesizing applications across physics, chemistry, ML, and optimization.", "motivation": "VQAs dominate NISQ computing but face fundamental challenges transitioning to fault-tolerant quantum computing. This review provides a roadmap for adapting variational principles to error-corrected environments.", "highlights": [ "NISQ-to-FT VQA roadmap", "Barren plateau mitigation", "Multi-domain applications" ], "keywords": [ { "label": "VQAs", "reason": "Core focus of comprehensive review" }, { "label": "barren plateaus", "reason": "Analyzes critical training bottleneck" }, { "label": "EFT regime", "reason": "Early fault-tolerant transition strategies" }, { "label": "ansatz design", "reason": "Deconstructs parameterized circuit architecture" } ], "emoji": "🔃", "social_summary": "Comprehensive VQA roadmap from NISQ to fault-tolerant quantum computing.", "highlights_oneliner": "VQAs fault-tolerance roadmap" }, { "arxiv_id": "2604.08247", "title": "Optimized Gottesman-Kitaev-Preskill Error Correction via Tunable Preprocessing", "authors": "Xiang-Jiang Chen, Hao-Miao Jiang, Liu-Jun Wang, Qing Chen", "arxiv_url": "https://arxiv.org/abs/2604.08247", "pdf_url": "https://arxiv.org/pdf/2604.08247", "summary": "Proposes preprocessing-based Steane-type (P-Steane) scheme for GKP codes with tunable squeezing parameters $a,b$, spanning ME-Steane and teleportation-based protocols. Achieves optimal noise variance product when $2a=b$ in small-noise regime when data qubit noisier than ancilla.", "motivation": "GKP codes promise fault-tolerant bosonic quantum computing but Steane-type protocols suffer intrinsic noise propagation limitations. Tunable preprocessing enables performance optimization beyond existing methods.", "highlights": [ "P-Steane with $2a=b$ optimal", "Reproduces ME-Steane, teleportation", "Outperforms when data $>$ ancilla noise" ], "keywords": [ { "label": "GKP code", "reason": "Bosonic code error correction focus" }, { "label": "P-Steane", "reason": "Preprocessing-based Steane variant" }, { "label": "squeezing parameters", "reason": "Tunable $a,b$ noise optimization" }, { "label": "quadrature variance", "reason": "Minimizes position-momentum product" } ], "emoji": "🌊", "social_summary": "Tunable preprocessing optimizes GKP error correction beyond standard protocols.", "highlights_oneliner": "GKP preprocessing optimization" }, { "arxiv_id": "2604.07995", "title": "Belief Propagation Convergence Prediction for Bivariate Bicycle Quantum Error Correction Codes", "authors": "Anton Pakhunov", "arxiv_url": "https://arxiv.org/abs/2604.07995", "pdf_url": "https://arxiv.org/pdf/2604.07995", "summary": "Predicts BP decoder convergence via single modulo operation on syndrome defect count divisible by column weight $w$, achieving 100% accuracy at $p\\leq0.001$. Enables skipping BP for 65% nontrivial syndromes on IBM Gross $[[144,12,12]]$ and Two-Gross $[[288,12,18]]$ codes.", "motivation": "BB codes enable high-rate quantum computing but BP+OSD decoding wastes time running failed BP iterations. O(1) convergence prediction dramatically improves decoder efficiency for IBM's 2026-2028 roadmap.", "highlights": [ "mod-$w$ predicts BP convergence", "100% accuracy at $p\\leq0.001$", "Skips 65% BP for Gross codes" ], "keywords": [ { "label": "Bivariate Bicycle", "reason": "BB codes family for IBM roadmap" }, { "label": "BP convergence", "reason": "O(1) prediction via mod-$w$" }, { "label": "syndrome defect", "reason": "Structural property exploited" }, { "label": "Relay-BP", "reason": "Invariant across decoder variants" } ], "emoji": "🔄", "social_summary": "Single modulo predicts BP convergence, skipping 65% iterations on IBM Gross codes.", "highlights_oneliner": "BB code BP prediction" } ] }, "2026-04-09": { "word_cloud": [ { "word": "heterogeneous", "weight": 5 }, { "word": "architecture", "weight": 5 }, { "word": "qubits", "weight": 4 }, { "word": "Nishimori", "weight": 5 }, { "word": "criticality", "weight": 4 }, { "word": "toric", "weight": 4 }, { "word": "continuous-variable", "weight": 5 }, { "word": "discrete-variable", "weight": 4 }, { "word": "ancilla", "weight": 3 }, { "word": "decoherence", "weight": 4 }, { "word": "suppression", "weight": 4 }, { "word": "loss", "weight": 4 }, { "word": "qLDPC", "weight": 3 }, { "word": "RSA", "weight": 3 }, { "word": "factorization", "weight": 3 }, { "word": "compiler", "weight": 3 }, { "word": "feedforward", "weight": 3 }, { "word": "Wigner", "weight": 2 } ], "social_highlights": "Highlights: heterogeneous architectures slash qubit needs 138x, higher Nishimori criticality yields exact results, DV-assisted CV QEC without GKP, environment-assisted loss suppression for non-Gaussian states.", "papers": [ { "arxiv_id": "2604.06319", "title": "Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting", "authors": "Pranav S. Mundada, Aleksei Khindanov, Yulun Wang, Claire L. Edmunds, Paul Coote, Michael J. Biercuk, Yuval Baum, Michael Hush", "arxiv_url": "https://arxiv.org/abs/2604.06319", "pdf_url": "https://arxiv.org/pdf/2604.06319", "summary": "Presents a heterogeneous quantum computing architecture with task-specific hardware and QEC encoding, including special-purpose modules and a compiler for $1000$ logical qubits, achieving up to 138x reduction in physical-qubit overhead. For RSA-2048 factorization, requires 381k qubits and 9.2 days with grid coupling, reducible with accelerators or qLDPC memory to 190k qubits under 10 days.", "motivation": "Quantum architectures have been disconnected from QEC code requirements despite scaling predictions to hundreds of thousands of qubits. This work bridges bottom-up hardware challenges with top-down QEC considerations for practical fault-tolerant computing.", "highlights": [ "138x physical qubit reduction", "RSA-2048 in 9.2 days with 381k qubits", "qLDPC memory cuts to 190k qubits" ], "keywords": [ { "label": "heterogeneous architecture", "reason": "core innovation unifying hardware and QEC" }, { "label": "qLDPC codes", "reason": "enables quantum memory resource reduction" }, { "label": "RSA factorization", "reason": "concrete application benchmark" }, { "label": "compiler", "reason": "schedules across $1000$ logical qubits" } ], "emoji": "🏗️", "social_summary": "Heterogeneous architectures cut qubit needs 138x for fault-tolerant quantum computing!", "highlights_oneliner": "138x qubit reduction" }, { "arxiv_id": "2604.06324", "title": "Higher Nishimori Criticality and Exact Results at the Learning Transition of Deformed Toric Codes", "authors": "Rushikesh A. Patil, Malte Pütz, Simon Trebst, Guo-Yi Zhu, Andreas W. W. Ludwig", "arxiv_url": "https://arxiv.org/abs/2604.06324", "pdf_url": "https://arxiv.org/pdf/2604.06324", "summary": "Identifies a learning-induced tricritical point in deformed toric codes as a higher Nishimori critical point with emergent gauge invariance in $R\\to2$ replica limit. Derives exact results like equal power-law exponents for Edwards-Anderson and spin correlations, and $c_\\text{eff}>1/2$ decreasing under RG flow to Ising criticality, verified numerically at $c_\\text{eff}=0.522(1)$.", "motivation": "Nishimori lines provide exact results in disordered systems; extending to higher replica symmetry unlocks insights into learning transitions in measured quantum codes. Matters for understanding phase diagrams dual to Bayesian inference in $2$D Ising models.", "highlights": [ "$c_\\text{eff}=0.522(1)$ at higher Nishimori point", "Exact exponent equality verified", "$c_\\text{eff}$ decreases under RG" ], "keywords": [ { "label": "higher Nishimori", "reason": "novel critical line with $R\\to2$ symmetry" }, { "label": "tricritical point", "reason": "learning transition in deformed toric codes" }, { "label": "Casimir $c_\\text{eff}$", "reason": "RG flow behavior analytically proven" }, { "label": "Edwards-Anderson", "reason": "correlation function exact result" } ], "emoji": "🔍", "social_summary": "Higher Nishimori criticality reveals exact results at toric code learning transitions!", "highlights_oneliner": "Higher Nishimori criticality" }, { "arxiv_id": "2604.06565", "title": "Discrete-variable assisted error correction of continuous-variable quantum information", "authors": "Negin Razian, En-Jui Chang, Hoi-Kwan Lau", "arxiv_url": "https://arxiv.org/abs/2604.06565", "pdf_url": "https://arxiv.org/pdf/2604.06565", "summary": "Proposes CV QEC using DV ancilla qubits to extract and correct displacement errors, suppressing infidelity by over 20% with single-qubit ancilla. Concatenation with DV codes creates robust hybrid oscillator-in-oscillator codes without demanding GKP states.", "motivation": "CV QEC typically requires hard-to-prepare GKP states; DV ancillas are broadly accessible across platforms. Enables practical error correction in hybrid CV-DV systems for scalable quantum information processing.", "highlights": [ ">20% infidelity suppression", "No GKP states needed", "Oscillator-in-oscillator codes" ], "keywords": [ { "label": "DV ancilla", "reason": "replaces demanding GKP resources" }, { "label": "displacement errors", "reason": "primary CV error targeted" }, { "label": "hybrid CV-DV", "reason": "concatenated code family" }, { "label": "oscillator-in-oscillator", "reason": "novel code construction" } ], "emoji": "🔄", "social_summary": "DV qubits correct CV errors without tricky GKP states—20% infidelity drop!", "highlights_oneliner": "DV-assisted CV QEC" }, { "arxiv_id": "2604.06679", "title": "Environment-Assisted Decoherence Suppression of Optical Non-Gaussian States", "authors": "Akihiro Machinaga, Naoki Aritomi, Ryoga Sakurada, Daichi Okuno, Keitaro Anai, Takahiro Kashiwazaki, Takeshi Umeki, Shigehito Miki, Masahiro Yabuno, Hirotaka Terai, Petr Marek, Radim Filip, Shuntaro Takeda", "arxiv_url": "https://arxiv.org/abs/2604.06679", "pdf_url": "https://arxiv.org/pdf/2604.06679", "summary": "Demonstrates Gaussian-only scheme injecting squeezed vacuum into loss channel environment with feedforward to suppress decoherence in non-Gaussian states. Programmable circuit preserves fidelity and Wigner negativity over 5 steps versus unsuppressed loss.", "motivation": "Optical loss limits photonic quantum advantage; existing countermeasures need non-Gaussian ops. Gaussian-only environment assistance reduces fault-tolerance overhead across platforms.", "highlights": [ "Gaussian-only loss suppression", "Preserves Wigner negativity", "5-step programmable demo" ], "keywords": [ { "label": "environment-assisted", "reason": "injects squeezed vacuum into loss channel" }, { "label": "feedforward", "reason": "basis of suppression mechanism" }, { "label": "Wigner negativity", "reason": "key non-Gaussianity metric preserved" }, { "label": "loop circuit", "reason": "enables multi-step implementation" } ], "emoji": "🛡️", "social_summary": "Gaussian scheme suppresses optical loss decoherence, saving non-Gaussian states!", "highlights_oneliner": "Loss suppression via environment" } ] }, "2026-04-08": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "magic", "weight": 4 }, { "word": "injection", "weight": 4 }, { "word": "gauge", "weight": 5 }, { "word": "QRF", "weight": 4 }, { "word": "color", "weight": 4 }, { "word": "code", "weight": 3 }, { "word": "defects", "weight": 4 }, { "word": "dynamical", "weight": 3 }, { "word": "decoupling", "weight": 3 }, { "word": "qudit", "weight": 4 }, { "word": "entanglement", "weight": 4 }, { "word": "lattice", "weight": 3 }, { "word": "QED", "weight": 3 }, { "word": "superstabilizer", "weight": 3 }, { "word": "SU(d)", "weight": 3 }, { "word": "vacuum", "weight": 3 }, { "word": "coupler", "weight": 3 }, { "word": "excited", "weight": 3 }, { "word": "states", "weight": 3 } ], "social_highlights": "Highlights: in-situ qLDPC magic injection, gauge QECCs via QRFs, adaptive color code defects, qudit dynamical decoupling, constant-size entanglement, vacuum codes from LGTs, fast adiabatic CZ, quantum excited states.", "papers": [ { "arxiv_id": "2604.05126", "title": "In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes", "authors": "Kun Liu, Shifan Xu, Tomas Jochym-O'Connor, Zhiyang He, Shraddha Singh, Yongshan Ding", "arxiv_url": "https://arxiv.org/abs/2604.05126", "pdf_url": "https://arxiv.org/pdf/2604.05126", "summary": "Proposes first in-situ magic state injection scheme for arbitrary CSS qLDPC codes using only syndrome extraction resources. Demonstrates low injection error rates of $1.62\\times10^{-3}$ per logical qubit under depolarizing noise and $6.7\\times10^{-4}$ under asymmetric noise on $[[144,12,12]]$ BB and $[[225,9,4]]$ HGP codes. Reduces space overhead compared to prepare-and-transfer and surface code methods.", "motivation": "qLDPC codes enable high-rate logical encoding but lack efficient magic state injection primitives beyond external paradigms. This work addresses the need for space-efficient MSI to achieve universality in qLDPC-based architectures amid advancing code constructions.", "highlights": [ "In-situ $|Y\\rangle$ injection on CSS qLDPC", "Injection error $6.7\\times10^{-4}$ asymmetric noise", "Uses native syndrome ancillas" ], "keywords": [ { "label": "in-situ injection", "reason": "Novel preparation directly in memory block" }, { "label": "CSS qLDPC", "reason": "Generalizable to arbitrary such codes" }, { "label": "Bivariate Bicycle", "reason": "$[[144,12,12]]$ simulation example" }, { "label": "magic states", "reason": "Focus on $|Y\\rangle$ with low correlated errors" } ], "emoji": "✨", "social_summary": "Introduces in-situ magic state injection for qLDPC codes using only syndrome qubits.", "highlights_oneliner": "In-situ qLDPC Magic Injection" }, { "arxiv_id": "2604.06149", "title": "Error Correction in Lattice Quantum Electrodynamics with Quantum Reference Frames", "authors": "Elias Rothlin, Carla Ferradini, Lin-Qing Chen", "arxiv_url": "https://arxiv.org/abs/2604.06149", "pdf_url": "https://arxiv.org/pdf/2604.06149", "summary": "Constructs QECCs for lattice QED using QRFs to resolve gauge syndrome degeneracy and identify correctable errors. Builds gauge-field QRF from spanning trees and fermionic QRF from matter fields. Establishes lattice QED as QECC beyond stabilizers with explicit recovery for Abelian groups.", "motivation": "Gauge symmetries in QED suggest deeper error-correcting structure akin to QECC redundancy. Bridges gauge theories, stabilizers, and QRFs to reveal information protection in physical systems.", "highlights": [ "QRF resolves gauge degeneracy", "Gauge-field spanning tree QRF", "Pure-gauge and fermionic QECCs" ], "keywords": [ { "label": "lattice QED", "reason": "Target gauge theory application" }, { "label": "quantum reference frames", "reason": "Key formalism for recovery" }, { "label": "spanning trees", "reason": "Gauge-field QRF construction" }, { "label": "Abelian recovery", "reason": "Group-theoretical error correction" } ], "emoji": "🔗", "social_summary": "Reveals lattice QED as quantum error-correcting code via reference frames.", "highlights_oneliner": "Gauge QECC via QRFs" }, { "arxiv_id": "2604.05874", "title": "Adaptive Deformation of Color Code in Square Lattices with Defects", "authors": "Tian-Hao Wei, Jia-Xuan Zhang, Jia-Ning Li, Wei-Cheng Kong, Yu-Chun Wu, Guo-Ping Guo", "arxiv_url": "https://arxiv.org/abs/2604.05874", "pdf_url": "https://arxiv.org/pdf/2604.05874", "summary": "Introduces universal superstabilizer scheme for data/ancilla defects in stabilizer codes, applied to square-lattice color codes. Optimizes ancilla defects via neighboring reuse or iSWAP, avoiding data qubit waste. Supports transversal Cliffords, lattice surgery with lower logical errors.", "motivation": "Hardware defects disrupt topological codes on superconducting platforms, but color codes lack systematic defect handling unlike surface codes. Provides robust deployment framework for defective hardware.", "highlights": [ "Superstabilizer defect repair", "iSWAP ancilla optimization", "Distance reduction $\\leq1$" ], "keywords": [ { "label": "superstabilizer", "reason": "Universal defect scheme" }, { "label": "color code", "reason": "Square lattice with defects" }, { "label": "boundary defects", "reason": "Uniform handling vs deformation" } ], "emoji": "🧩", "social_summary": "Universal superstabilizer fixes color code defects without wasting qubits.", "highlights_oneliner": "Adaptive Color Code Defects" }, { "arxiv_id": "2604.05871", "title": "Dynamical decoupling and quantum error correction with SU(d) symmetries", "authors": "Colin Read, Eduardo Serrano-Ensástiga, John Martin", "arxiv_url": "https://arxiv.org/abs/2604.05871", "pdf_url": "https://arxiv.org/pdf/2604.05871", "summary": "Develops Lie group framework for qudit dynamical decoupling using finite SU($d$) subgroups accessing irreducible operator components. Constructs qutrit pulse sequences via subgroup factorizations. Yields QECCs where symmetry sectors satisfy Knill-Laflamme conditions.", "motivation": "Qubit dynamical decoupling lacks qudit analogs due to missing geometric intuition in higher dimensions. Unifies DD and QEC under symmetry for multi-level systems.", "highlights": [ "SU(d) decoupling groups", "Qutrit pulse sequences", "Symmetry-based QECCs" ], "keywords": [ { "label": "dynamical decoupling", "reason": "Extended to qudits" }, { "label": "SU(d) subgroups", "reason": "Lie representation framework" }, { "label": "Knill-Laflamme", "reason": "Code construction criterion" }, { "label": "qutrit", "reason": "Spin-1 application" } ], "emoji": "🔄", "social_summary": "Unifies qudit dynamical decoupling and error correction via SU(d) symmetries.", "highlights_oneliner": "Qudit SU(d) Decoupling" }, { "arxiv_id": "2604.05870", "title": "Fault-Tolerant One-Shot Entanglement Generation with Constant-Sized Quantum Devices in the Plane", "authors": "Dylan Harley, Robert Koenig", "arxiv_url": "https://arxiv.org/abs/2604.05870", "pdf_url": "https://arxiv.org/pdf/2604.05870", "summary": "Protocol generates constant-fidelity Bell pairs over distance $R$ in $Θ(R)\\timesΘ(\\mathrm{poly}(\\log R))$ grid with local Pauli noise below threshold. Achieves one-shot entanglement in constant time with known correction. Enables 2D stabilizer Hamiltonians with long-range entanglement.", "motivation": "Existing protocols require distance-growing devices or multi-shot execution for planar entanglement. Provides efficient, robust generation for repeater networks and devices.", "highlights": [ "One-shot $R$-distance entanglement", "$Θ(R)\\times\\mathrm{poly}(\\log R)$ grid", "Constant-time Bell pairs" ], "keywords": [ { "label": "one-shot", "reason": "Constant-time generation" }, { "label": "planar grid", "reason": "2D constant-size devices" }, { "label": "many-body entanglement", "reason": "Network leveraging" } ], "emoji": "🔗", "social_summary": "Generates long-distance entanglement one-shot with constant devices.", "highlights_oneliner": "One-Shot Planar Entanglement" }, { "arxiv_id": "2604.06087", "title": "Gauss law codes and vacuum codes from lattice gauge theories", "authors": "Javier P. Lacambra, Aidan Chatwin-Davies, Masazumi Honda, Philipp A. Hoehn", "arxiv_url": "https://arxiv.org/abs/2604.06087", "pdf_url": "https://arxiv.org/pdf/2604.06087", "summary": "Framework constructs QECCs from Abelian LGTs via QRFs: Gauss law codes use full gauge-invariant sector, vacuum codes restrict to matter vacuum. Shows unitary equivalence for finite groups, charge coarse-graining for continuous. Characterizes errors as gauge-invariant excitations.", "motivation": "Gauge theories parallel QEC but lack unified code construction across dimensions and matter. Enables LGT simulation on noisy devices via explicit encoding.", "highlights": [ "Gauss law codes", "Vacuum codes equivalence", "QRF error characterization" ], "keywords": [ { "label": "Gauss law", "reason": "Full gauge-invariant codes" }, { "label": "vacuum codes", "reason": "Matter vacuum subspace" }, { "label": "lattice gauge", "reason": "Arbitrary Abelian LGTs" }, { "label": "charge excitations", "reason": "Error correspondence" } ], "emoji": "⚛️", "social_summary": "Builds QECCs from lattice gauge theories using reference frames.", "highlights_oneliner": "LGT Vacuum Codes" }, { "arxiv_id": "2604.05048", "title": "Unlocking a fast adiabatic CZ gate and exact residual $ZZ$ cancellation between fixed-frequency transmons using a floating tunable coupler", "authors": "Angela Q. Chen, Xian Wu, Sarah Strong, Stefano Poletto", "arxiv_url": "https://arxiv.org/abs/2604.05048", "pdf_url": "https://arxiv.org/pdf/2604.05048", "summary": "Symmetric floating coupler enables 24 ns adiabatic CZ with $>99.9\\%$ fidelity and exact idling $ZZ=0$. Favorable levels avoid adiabaticity-speed tradeoff. Pulse-shaping via instantaneous adiabatic factor suppresses non-adiabatic errors.", "motivation": "Tunable couplers struggle with fast, low-error CZ due to leakage and non-adiabaticity. Provides robust architecture for fixed-frequency transmons.", "highlights": [ "24 ns 99.9% CZ gate", "Exact $ZZ$ cancellation", "Adiabatic factor shaping" ], "keywords": [ { "label": "floating coupler", "reason": "Symmetric tunable design" }, { "label": "adiabatic CZ", "reason": "Fast high-fidelity gate" }, { "label": "fixed-frequency", "reason": "Transmon compatibility" } ], "emoji": "⚡", "social_summary": "Achieves 24 ns high-fidelity CZ with floating coupler.", "highlights_oneliner": "Fast Adiabatic CZ Gate" }, { "arxiv_id": "2604.05380", "title": "Molecular Excited States using Quantum Subspace Methods: Accuracy, Resource Reduction, and Error-Mitigated Hardware Implementation of q-sc-EOM", "authors": "Srivathsan Poyyapakkam Sundar, Prince Frederick Kwao, Alexey Galda, Ayush Asthana", "arxiv_url": "https://arxiv.org/abs/2604.05380", "pdf_url": "https://arxiv.org/pdf/2604.05380", "summary": "Combines ADAPT-VQE/LUCJ with q-sc-EOM for accurate excited PES in bond-breaking, outperforming EOM-CCSD. Reduces measurement from $O(N^{12})$ to $O(N^5)$ via Davidson and basis grouping. Hardware with M3/readout mitigation shows gate noise dominant.", "motivation": "Classical excited-state methods fail in multireference regimes like bond-breaking. Quantum subspace methods target utility in chemistry applications.", "highlights": [ "q-sc-EOM bond-breaking PES", "$O(N^5)$ measurement scaling", "Hardware error mitigation" ], "keywords": [ { "label": "q-sc-EOM", "reason": "Excited-state subspace method" }, { "label": "ADAPT-VQE", "reason": "Ground-state preparation" }, { "label": "bond-breaking", "reason": "Multireference validation" }, { "label": "Davidson algorithm", "reason": "Resource reduction" } ], "emoji": "🧪", "social_summary": "Quantum subspace methods yield accurate molecular excited states on hardware.", "highlights_oneliner": "Quantum Excited States" } ] }, "2026-04-07": { "word_cloud": [ { "word": "local recovery", "weight": 5 }, { "word": "impure codes", "weight": 4 }, { "word": "CSS codes", "weight": 4 }, { "word": "quantum annealing", "weight": 5 }, { "word": "minor-embedding", "weight": 4 }, { "word": "dynamic range", "weight": 4 }, { "word": "coefficient reduction", "weight": 3 }, { "word": "erasure correction", "weight": 3 }, { "word": "stabilizer codes", "weight": 3 }, { "word": "Ising Hamiltonian", "weight": 3 }, { "word": "J-affine variety", "weight": 2 }, { "word": "interaction-extension", "weight": 2 }, { "word": "sample quality", "weight": 2 }, { "word": "weight-constrained", "weight": 2 }, { "word": "D-Wave Advantage", "weight": 2 }, { "word": "locality bounds", "weight": 2 }, { "word": "QUBO", "weight": 1 }, { "word": "MKP", "weight": 1 }, { "word": "QAP", "weight": 1 } ], "social_highlights": "Highlights: impure codes exceed pure quantum local recovery bounds, coefficient reduction boosts quantum annealing sample quality via minor-embedding.", "papers": [ { "arxiv_id": "2604.03569", "title": "Impure codes exceeding the pure bounds for quantum local recovery", "authors": "Carlos Galindo, Fernando Hernando, Helena Martín-Cruz, Ryutaroh Matsumoto", "arxiv_url": "https://arxiv.org/abs/2604.03569", "pdf_url": "https://arxiv.org/pdf/2604.03569", "summary": "A family of $J$-affine variety codes constructs impure CSS codes that exceed bounds on $k$, $d$, $n$, and locality for pure quantum locally recoverable codes. These codes enable efficient erasure correction with reduced measurements. Connections to weight-constrained stabilizer codes are discussed.", "motivation": "Quantum local recovery extends classical locally recoverable codes to handle erasures efficiently, crucial for measurement-free fault-tolerant computation on devices where measurements disturb qubits. Exceeding pure bounds with impure codes advances practical quantum error correction by enabling better parameters amid hardware limitations.", "highlights": [ "Impure CSS codes from $J$-affine varieties", "Exceed pure $k$, $d$, $n$, locality bounds", "Link to weight-constrained stabilizers" ], "keywords": [ { "label": "J-affine variety codes", "reason": "Core construction yielding impure CSS codes exceeding bounds" }, { "label": "quantum local recovery", "reason": "Key property violated by new impure codes" }, { "label": "impure CSS codes", "reason": "Novel code family surpassing pure bounds" }, { "label": "locality $(r,\\delta)$", "reason": "Extended metric for multi-erasure correction" } ], "emoji": "🔗", "social_summary": "Impure codes from J-affine varieties beat pure bounds for quantum local recovery.", "highlights_oneliner": "Impure codes exceed pure recovery bounds" }, { "arxiv_id": "2604.03546", "title": "Mitigating Precision Errors in Quantum Annealing via Coefficient Reduction of Embedded Hamiltonians", "authors": "Kentaro Ohno, Nozomu Togawa", "arxiv_url": "https://arxiv.org/abs/2604.03546", "pdf_url": "https://arxiv.org/pdf/2604.03546", "summary": "Reevaluates three coefficient-reduction methods under minor-embedding constraints for D-Wave Advantage. Interaction-extension method reduces dynamic range of embedded Hamiltonians and improves sample quality on QUBO. Bounded-coefficient encoding and augmented Lagrangian show limited effects post-embedding.", "motivation": "Limited precision in quantum annealers degrades solutions for problems with large dynamic range in Ising Hamiltonians, hindering practical optimization. Accounting for minor-embedding in coefficient reduction is essential for real hardware performance.", "highlights": [ "IEM reduces embedded dynamic range", "Improves D-Wave QUBO sample quality", "Minor-embedding auto-reduces fields" ], "keywords": [ { "label": "minor-embedding", "reason": "Critical constraint transforming logical to working Hamiltonians" }, { "label": "interaction-extension method", "reason": "Most effective for dynamic range reduction post-embedding" }, { "label": "dynamic range", "reason": "Key metric affecting annealing precision" } ], "emoji": "⛅", "social_summary": "Interaction-extension cuts coefficients in embedded Hamiltonians, boosting quantum annealing.", "highlights_oneliner": "Coefficient reduction for annealing embedding" } ] }, "2026-04-06": { "status": "no_qec" }, "2026-04-03": { "word_cloud": [ { "word": "topological codes", "weight": 5 }, { "word": "transversal gates", "weight": 5 }, { "word": "threshold", "weight": 4 }, { "word": "LDPC codes", "weight": 4 }, { "word": "decoding", "weight": 4 }, { "word": "non-Clifford", "weight": 4 }, { "word": "surface codes", "weight": 3 }, { "word": "stabilizer codes", "weight": 3 }, { "word": "logical operations", "weight": 3 }, { "word": "CSS codes", "weight": 3 }, { "word": "homological construction", "weight": 3 }, { "word": "magic states", "weight": 3 }, { "word": "resource estimation", "weight": 3 }, { "word": "neutral atoms", "weight": 2 }, { "word": "syndrome extraction", "weight": 2 }, { "word": "code parameters", "weight": 2 }, { "word": "automorphism groups", "weight": 2 } ], "social_highlights": "Highlights: Non-Pauli codes achieve 2.2% threshold for 2D universality, transversal multi-controlled-Z gates on almost-good qLDPC codes, exhaustive optimization of stabilizer code logical operations, twisted fiber bundles enhance LDPC code parameters, shot-to-shot noise cancellation for quantum oscillators, compilation-driven resource estimation for neutral atom fault tolerance.", "papers": [ { "arxiv_id": "2604.02033", "title": "High-threshold decoding of non-Pauli codes for 2D universality", "authors": "Julio C. Magdalena de la Fuente, Noa Feldman, Jens Eisert, Andreas Bauer", "arxiv_url": "https://arxiv.org/abs/2604.02033", "pdf_url": "https://arxiv.org/pdf/2604.02033", "summary": "This work introduces a non-Pauli stabilizer code enabling universal gate sets on 2D topological codes with a just-in-time matching decoder achieving $\\approx 2.5\\%$ threshold. The authors demonstrate that improved $Z$ decoding using $X$ correction knowledge pushes the threshold to $\\approx 2.2\\%$, approaching the performance of full syndrome-history decoders. Finite-size scaling analysis confirms exponential suppression of logical error rates below threshold in both physical error rate and system size.", "motivation": "Topological codes promise fault-tolerant quantum computation with low overhead, but achieving universal gate sets in strictly 2D with limited connectivity remains a fundamental challenge. This work addresses the critical gap between theoretical code properties and practical implementation constraints by combining non-Pauli stabilizers with efficient decoding strategies.", "highlights": [ "Non-Pauli code achieves $\\approx 2.2\\%$ threshold for 2D universal gates", "Just-in-time matching decoder for mid-circuit $X$ corrections", "Exponential logical error suppression below threshold" ], "keywords": [ { "label": "non-Pauli stabilizer codes", "reason": "Core code family enabling universal gates in 2D with novel syndrome extraction requirements" }, { "label": "just-in-time matching decoder", "reason": "Novel decoding technique for real-time $X$ correction decisions with high threshold performance" }, { "label": "2D universality", "reason": "Key application goal: achieving fault-tolerant universal computation on strictly 2D lattices" }, { "label": "threshold optimization", "reason": "Metric demonstrating improved error correction capability through decoder enhancement" } ], "emoji": "⚡", "social_summary": "Achieve 2.2% threshold for universal quantum gates in 2D using non-Pauli codes and smart decoding.", "highlights_oneliner": "Non-Pauli codes unlock 2D universal gates" }, { "arxiv_id": "2604.01874", "title": "Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes", "authors": "Yiming Li, Zimu Li, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2604.01874", "pdf_url": "https://arxiv.org/pdf/2604.01874", "summary": "This paper demonstrates transversal multi-controlled-$Z$ gates on $[\\![N,\\Theta(N),\\tilde{\\Theta}(N)]\\!]$ quantum LDPC and quantum locally testable codes with soundness $\\tilde{\\Theta}(1)$, combining nearly optimal code parameters with fault-tolerant non-Clifford gates. The authors develop a general algebraic-topological framework of 'cupcap gates' and homological invariant forms to construct and certify nontrivial logical gates. This work resolves a long-standing challenge by showing that non-Clifford logical operations naturally emerge as topological phenomena.", "motivation": "Quantum LDPC codes promise efficient fault-tolerant quantum computation, but implementing non-Clifford gates—which dominate the cost of universal computation—has remained persistently difficult. Recent breakthroughs in good and almost-good code constructions created an opportunity to finally bridge this gap between optimal code parameters and practical gate implementations.", "highlights": [ "Transversal multi-controlled-$Z$ gates on almost-good qLDPC codes", "Algebraic-topological framework for cupcap gate construction", "First combination of nearly optimal code parameters with fault-tolerant non-Clifford gates" ], "keywords": [ { "label": "quantum LDPC codes", "reason": "Primary code family achieving nearly optimal parameters $[\\![N,\\Theta(N),\\tilde{\\Theta}(N)]\\!]$" }, { "label": "transversal non-Clifford gates", "reason": "Key contribution enabling fault-tolerant implementation of expensive multi-controlled-$Z$ operations" }, { "label": "quantum locally testable codes", "reason": "Secondary code family with soundness parameter $\\tilde{\\Theta}(1)$ supporting gate implementations" }, { "label": "homological invariant forms", "reason": "Mathematical framework certifying nontriviality of logical gate operations" } ], "emoji": "🧬", "social_summary": "Unlock fault-tolerant non-Clifford gates on LDPC codes using topological methods.", "highlights_oneliner": "Non-Clifford gates on optimal LDPC codes" }, { "arxiv_id": "2604.01282", "title": "Exhaustive Optimisation of Automorphism Groups for Stabiliser Codes", "authors": "Aisling Mac Aree, Mark Howard", "arxiv_url": "https://arxiv.org/abs/2604.01282", "pdf_url": "https://arxiv.org/pdf/2604.01282", "summary": "This work introduces a framework leveraging automorphism groups of classical codes and code equivalence to construct all distinct implementable realizations of logical operations for $[[n,k,d]]$ stabilizer codes. The authors establish conjugacy classes and group transversals as key explanatory concepts and compute two figures-of-merit optimizable within this framework. The results provide an exhaustive table of optimal logical operations and physical circuits for all small stabilizer codes with $n \\leq 7$ and $k \\leq 2$.", "motivation": "Identifying which logical operations can be implemented fault-tolerantly is crucial for quantum code utility, yet systematic methods for finding optimal implementations have been lacking. This work provides the first exhaustive optimization framework applicable to small codes, offering practical guidance for both theoretical analysis and experimental implementations.", "highlights": [ "Exhaustive optimization of logical operations for $n \\leq 7$, $k \\leq 2$ codes", "Conjugacy classes and group transversals as explanatory concepts", "Optimal physical circuits for magic state cultivation and experiments" ], "keywords": [ { "label": "stabilizer codes", "reason": "Primary code family analyzed with $[[n,k,d]]$ parameters up to $n=7$" }, { "label": "automorphism groups", "reason": "Mathematical structure enabling systematic enumeration of distinct logical operation implementations" }, { "label": "logical operations", "reason": "Core focus: identifying fault-tolerant implementations of quantum gates on code spaces" }, { "label": "magic state cultivation", "reason": "Key application domain where optimized logical operations reduce resource overhead" } ], "emoji": "🔄", "social_summary": "Exhaustively optimize logical gate implementations on small stabilizer codes.", "highlights_oneliner": "Optimal logical operations for small codes" }, { "arxiv_id": "2604.01478", "title": "Twisted Fiber Bundle Codes over Group Algebras", "authors": "Chaobin Liu", "arxiv_url": "https://arxiv.org/abs/2604.01478", "pdf_url": "https://arxiv.org/pdf/2604.01478", "summary": "This paper introduces a twisted fiber-bundle construction of quantum CSS codes over group algebras $R=\\mathbb{F}_2[G]$ where each base generator carries a generator-dependent $R$-linear fiber twist satisfying a flatness condition. The authors show that invertible twists preserve code blocklength $n$ and dimension $k$, while singular chain-compatible twists can lower boundary ranks and increase logical qubits. Examples over $R=\\mathbb{F}_2[D_3]$ demonstrate that twisted codes outperform untwisted lifted-product codes in $k$ while maintaining $n$ and minimum distance $d$.", "motivation": "Homological and product-type constructions have become essential for generating low-density parity-check codes, but existing frameworks like lifted-product codes have inherent parameter limitations. Introducing generator-dependent twists provides a new degree of freedom to improve code parameters while maintaining the algebraic structure necessary for analysis.", "highlights": [ "Twisted fiber-bundle construction increases logical qubits via singular twists", "Invertible twists preserve complex chain isomorphism and code parameters", "Examples show improvement in $k$ over untwisted lifted-product codes" ], "keywords": [ { "label": "twisted fiber-bundle codes", "reason": "Novel construction extending lifted-product codes with generator-dependent $R$-linear twists" }, { "label": "CSS codes", "reason": "Code family constructed via homological methods over group algebras $\\mathbb{F}_2[G]$" }, { "label": "LDPC codes", "reason": "Application domain: low-density parity-check codes with improved parameters" }, { "label": "group algebra construction", "reason": "Mathematical framework enabling systematic parameter optimization through algebraic twists" } ], "emoji": "🎀", "social_summary": "Improve LDPC code parameters using twisted fiber-bundle constructions over group algebras.", "highlights_oneliner": "Twisted fiber bundles enhance code parameters" }, { "arxiv_id": "2604.02175", "title": "Shot-to-shot noise cancellation for parametric oscillators", "authors": "Martynas Skrabulis, Martin Colombano Sosa, Nicola Carlon Zambon, Andrei Militaru, Massimiliano Rossi, Lukas Novotny, Martin Frimmer", "arxiv_url": "https://arxiv.org/abs/2604.02175", "pdf_url": "https://arxiv.org/pdf/2604.02175", "summary": "This work proposes an oscillator-echo decoupling technique inspired by spin-echo protocols that cancels shot-to-shot force noise in parametric squeezing experiments on optically levitated nanoparticles. The authors demonstrate suppression of slowly-varying stray-field noise to the measurement-backaction limit, enabling access to quantum regimes previously masked by experimental shot-to-shot fluctuations. The protocol embeds state-expansion steps between decoupling sequences to achieve perfect noise cancellation under ideal conditions.", "motivation": "Mechanical oscillators in the quantum regime are promising platforms for exploring quantum physics, but decoherence and noise sources limit their utility. Shot-to-shot force fluctuations from stray fields represent a significant but previously unaddressed noise source that masks intrinsic quantum uncertainty and prevents access to squeezed states.", "highlights": [ "Oscillator-echo protocol cancels shot-to-shot force noise to backaction limit", "Demonstrates squeezing in optically levitated nanoparticles with noise suppression", "Bridges spin-echo techniques with modern nano-mechanical oscillators" ], "keywords": [ { "label": "shot-to-shot noise cancellation", "reason": "Core technique addressing slowly-varying force fluctuations between experimental runs" }, { "label": "parametric oscillators", "reason": "Physical system where resonance frequency modulation enables quantum state squeezing" }, { "label": "optically levitated nanoparticles", "reason": "Experimental platform demonstrating quantum control in backaction-dominated regime" }, { "label": "dynamical decoupling", "reason": "Theoretical framework connecting spin-echo protocols to mechanical oscillator noise suppression" } ], "emoji": "🌀", "social_summary": "Cancel shot-to-shot noise in quantum oscillators using echo-inspired decoupling protocols.", "highlights_oneliner": "Echo protocols suppress oscillator noise" }, { "arxiv_id": "2604.01376", "title": "Resource Estimation via Efficient Compilation of Key Quantum Primitives", "authors": "Colin Campbell, Rich Rines, Victory Omole, Tina Oberoi, Palash Goiporia, Rayat Roy, R. Peyton Cline, Eric B. Jones, Teague Tomesh", "arxiv_url": "https://arxiv.org/abs/2604.01376", "pdf_url": "https://arxiv.org/pdf/2604.01376", "summary": "This paper presents a compilation-driven framework for quantum resource estimation that translates arbitrary circuits into logical primitives with known physical costs, enabling rapid comparison of architectural design choices. The authors apply the framework to neutral atom quantum computers with surface codes, revealing that magic state production dominates overhead while atom movement saves cultivation time and enables transversal gates. Analysis shows routing and qubit movement become dominant bottlenecks as problem size grows, motivating movement-aware compiler optimizations.", "motivation": "Resource estimation for fault-tolerant quantum computers is critical for evaluating practical viability, yet existing approaches rely on fixed architectural assumptions or coarse models that fail to capture hardware-compilation interactions. Neutral atom platforms introduce unique design choices—atom movement, measurement zones, multi-species arrays—requiring tighter feedback loops between hardware design and application development.", "highlights": [ "Compilation-driven framework captures hardware-circuit interaction for resource estimation", "Magic state production identified as dominant overhead for benchmarks", "Atom movement enables transversal gates and reduces cultivation time" ], "keywords": [ { "label": "resource estimation", "reason": "Primary framework translating quantum circuits to logical primitives with physical costs" }, { "label": "neutral atom quantum computers", "reason": "Target platform with unique architectural features: atom movement, measurement zones, multi-species arrays" }, { "label": "surface codes", "reason": "Error correction code family used for fault-tolerant computation analysis" }, { "label": "magic state cultivation", "reason": "Identified bottleneck: dominant source of overhead in fault-tolerant quantum computation" } ], "emoji": "📊", "social_summary": "Estimate fault-tolerant quantum computer resources via compilation-aware framework for neutral atoms.", "highlights_oneliner": "Compilation-driven resource estimation framework" } ] }, "2026-04-02": { "word_cloud": [ { "word": "simulator", "weight": 5 }, { "word": "ZX", "weight": 4 }, { "word": "GPU", "weight": 4 }, { "word": "geometry", "weight": 5 }, { "word": "qLDPC", "weight": 5 }, { "word": "correlated", "weight": 4 }, { "word": "noise", "weight": 4 }, { "word": "bivariate-bicycle", "weight": 3 }, { "word": "stabilizer", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "magic", "weight": 3 }, { "word": "layout", "weight": 3 }, { "word": "exposure", "weight": 3 }, { "word": "decoder", "weight": 2 }, { "word": "threshold", "weight": 2 }, { "word": "sampling", "weight": 2 }, { "word": "Tanner", "weight": 2 }, { "word": "fault", "weight": 2 } ], "social_highlights": "Highlights: Tsim accelerates QEC simulation with ZX diagrams and GPU, geometry optimizes qLDPC noise in BB codes.", "papers": [ { "arxiv_id": "2604.01059", "title": "Tsim: Fast Universal Simulator for Quantum Error Correction", "authors": "Rafael Haenel, Xiuzhe Luo, Chen Zhao", "arxiv_url": "https://arxiv.org/abs/2604.01059", "pdf_url": "https://arxiv.org/pdf/2604.01059", "summary": "Tsim is an open-source GPU-accelerated simulator for universal noisy quantum circuits in QEC, using ZX diagrams with parameterized Pauli vertices and rules for simplification. It compiles for vectorized sampling, achieving linear time in Clifford gates and exponential only in non-Cliffords, matching Stim for low-magic circuits while supporting $T$ and rotations.", "motivation": "QEC development relies on classical simulation due to hardware limits, with gadgets involving thousands of mostly Clifford qubits needing scalable low-magic tools. Tsim addresses realistic Pauli noise and high-throughput needs for benchmarking protocols like stabilizer extraction and magic states.", "highlights": [ "GPU-accelerated ZX-based simulation", "Linear in Cliffords, exp in non-Cliffords", "Matches Stim for low-magic circuits" ], "keywords": [ { "label": "ZX diagrams", "reason": "Core representation and simplification for circuits with Pauli channels" }, { "label": "stabilizer rank", "reason": "Enables polynomial qubit scaling for low-magic QEC gadgets" }, { "label": "Stim API", "reason": "Compatibility and extension for standard QEC workflows" }, { "label": "magic states", "reason": "Efficient simulation of non-Clifford operations in protocols" } ], "emoji": "⛵", "social_summary": "Tsim delivers blazing-fast QEC simulation via ZX calculus and GPU power.", "highlights_oneliner": "Fast ZX QEC Simulator" }, { "arxiv_id": "2604.01040", "title": "Geometry-induced correlated noise in qLDPC syndrome extraction", "authors": "Angelo Di Bella", "arxiv_url": "https://arxiv.org/abs/2604.01040", "pdf_url": "https://arxiv.org/pdf/2604.01040", "summary": "Derives geometry-conditioned fault model for bivariate-bicycle layouts from interaction Hamiltonian, identifying metrics like support-level fault weight and weighted exposure. Circuit-level Monte Carlo on $[[72,12,6]]$ and $[[144,12,12]]$ shows biplanar layouts suppress embedding penalties, with exposure correlating to logical error rate.", "motivation": "qLDPC codes like BB enable finite-rate QEC with sparse checks, but long-range coupling makes routing geometry impact correlated faults and performance. Optimizing geometry jointly with code and schedule is essential for realistic fault tolerance.", "highlights": [ "Geometry metrics reduce fault weight", "Biplanar layout cuts exposure 26%", "Exposure correlates with logical error" ], "keywords": [ { "label": "bivariate-bicycle", "reason": "Specific qLDPC code family with explicit decompositions" }, { "label": "weighted exposure", "reason": "Key metric tracking logical error rate across regimes" }, { "label": "routed geometry", "reason": "Device-level variable altering correlated noise" }, { "label": "support kernel", "reason": "Diagnostic reducing effective fault weight" } ], "emoji": "Ὅa", "social_summary": "Routed geometry slashes qLDPC error rates by taming correlated noise.", "highlights_oneliner": "Geometry Tames qLDPC Noise" } ] }, "2026-04-01": { "word_cloud": [ { "word": "ColorCode", "weight": 5 }, { "word": "HookErrors", "weight": 4 }, { "word": "SyndromeExtraction", "weight": 5 }, { "word": "FloquetCodes", "weight": 4 }, { "word": "HyperbolicTessellations", "weight": 3 }, { "word": "DistributedQuantum", "weight": 5 }, { "word": "CircuitDepth", "weight": 4 }, { "word": "LogicalCompilation", "weight": 3 }, { "word": "PAEMS", "weight": 5 }, { "word": "ErrorModel", "weight": 4 }, { "word": "LeakagePropagation", "weight": 3 }, { "word": "SuperconductingQPU", "weight": 4 }, { "word": "CircuitDistance", "weight": 3 }, { "word": "MonteCarlo", "weight": 2 }, { "word": "XYZColorCode", "weight": 2 }, { "word": "FractionalHooks", "weight": 2 }, { "word": "NonOrientable", "weight": 3 }, { "word": "EntanglementSharing", "weight": 3 }, { "word": "RepetitionCode", "weight": 2 }, { "word": "TVD", "weight": 2 } ], "social_highlights": "Highlights: color code hook avoidance, Floquet codes on surfaces, distributed circuit depth reduction, adaptive error modeling for QPUs.", "papers": [ { "arxiv_id": "2603.28852", "title": "Color code off-the-hook: avoiding hook errors with a single auxiliary per plaquette", "authors": "Gilad Kishony, Austin Fowler", "arxiv_url": "https://arxiv.org/abs/2603.28852", "pdf_url": "https://arxiv.org/pdf/2603.28852", "summary": "Proposes a single-auxiliary syndrome extraction circuit for planar color code using color-dependent gate schedules to avoid all malign hook errors in the bulk, preserving full circuit-level distance. Achieves minimal depth with parallel measurement of same Pauli type stabilizers in six time steps. Outperforms prior circuits via Monte Carlo simulations across noise models.", "motivation": "Color codes offer advantages like transversal Cliffords and fewer qubits than surface codes but suffer from high-weight stabilizers and hook errors reducing circuit-level distance. This work addresses the need for efficient syndrome extraction to realize color code potential in fault-tolerant quantum computing on planar hardware.", "highlights": [ "Avoids bulk malign hook errors", "Preserves full $d_{\\circ}$ with 1 aux/plaquette", "Outperforms SOTA in simulations" ], "keywords": [ { "label": "Hook Errors", "reason": "Central problem addressed: auxiliary errors propagating to data qubits" } ], "emoji": "🪝", "social_summary": "Devises color code circuit dodging hook errors with one aux per plaquette.", "highlights_oneliner": "Hook-free color code extraction" }, { "arxiv_id": "2603.29811", "title": "Floquet Codes from Derived Semi-Regular Hyperbolic Tessellations on Orientable and Non-Orientable Surfaces", "authors": "Douglas F. Copatti, Giuliano G. La Guardia, Waldir S. Soares, Edson D. Carvalho, Eduardo B. Silva", "arxiv_url": "https://arxiv.org/abs/2603.29811", "pdf_url": "https://arxiv.org/pdf/2603.29811", "summary": "Constructs new quantum Floquet codes on compact orientable and non-orientable surfaces using hyperbolic polygons and semi-regular tessellations. Generalizes prior hyperbolic Floquet code constructions for genus $g \\geq 2$ surfaces. Analyzes performance and asymptotic behavior.", "motivation": "Floquet codes enable continuous-time quantum error correction; extending to diverse hyperbolic surfaces broadens topological code families for robust quantum memory. Matters for exploring code performance on non-standard geometries.", "highlights": [ "New Floquet codes on surfaces", "Hyperbolic semi-regular tessellations", "Asymptotic performance analysis" ], "keywords": [ { "label": "Floquet Codes", "reason": "Core construction: dynamical codes from periodic drives" }, { "label": "Hyperbolic Tessellations", "reason": "Geometric method for code definition" }, { "label": "Non-Orientable Surfaces", "reason": "Novel topology extension" } ], "emoji": "🔄", "social_summary": "Builds Floquet codes from hyperbolic tessellations on any surface.", "highlights_oneliner": "Hyperbolic Floquet surface codes" }, { "arxiv_id": "2603.29536", "title": "Logical-to-Physical Compilation for Reducing Depth in Distributed Quantum Systems", "authors": "Folkert de Ronde, Stephan Wong, Sebastian Feld", "arxiv_url": "https://arxiv.org/abs/2603.29536", "pdf_url": "https://arxiv.org/pdf/2603.29536", "summary": "Presents compiler integrating logical-to-physical decomposition with depth-aware rescheduling for distributed quantum circuits. Identifies parallelizable CNOT sequences sharing control/target, using shared entanglement for simultaneous execution. Guarantees no depth increase; benchmarks show reductions in sequential CNOT structures.", "motivation": "Distributed quantum systems scale via interconnected nodes but incur depth overhead from sequential entanglement generation, critical in NISQ era. Compiler optimizes for noise-limited fidelity in modular architectures.", "highlights": [ "Reduces distributed CNOT depth", "Parallel via shared entanglement", "Never increases circuit depth" ], "keywords": [ { "label": "Distributed Compilation", "reason": "Targets modular quantum systems" }, { "label": "Depth Optimization", "reason": "Key metric reduced via rescheduling" }, { "label": "CNOT Parallelism", "reason": "Exploits shared control/target for concurrency" }, { "label": "NISQ Fidelity", "reason": "Improves reliability in noisy era" } ], "emoji": "🔗", "social_summary": "Compiles distributed circuits to slash depth using entanglement sharing.", "highlights_oneliner": "Depth-aware distributed compilation" }, { "arxiv_id": "2603.29439", "title": "PAEMS: Precise and Adaptive Error Model for Superconducting Quantum Processors", "authors": "Songhuan He, Yifei Cui, Cheng Wang", "arxiv_url": "https://arxiv.org/abs/2603.29439", "pdf_url": "https://arxiv.org/pdf/2603.29439", "summary": "Introduces PAEMS, a qubit-wise error model with leakage propagation capturing spatial/temporal correlations at $O(n^2)$ complexity. Fits via end-to-end optimization on repetition-code data. Achieves 19.5×, 9.3×, 5.2× correlation reductions and 58-73% better accuracy than SI1000 on multiple QPUs.", "motivation": "SC QPUs limit real QEC datasets, forcing reliance on inaccurate synthetic models; precise models are vital for training scalable decoders like MWPM variants. Enables faithful simulation for hardware-specific QEC advances.", "highlights": [ "19.5× timelike correlation drop", "Outperforms SI1000 by 58-73%", "$O(n^2)$ scalable modeling" ], "keywords": [ { "label": "PAEMS", "reason": "Novel adaptive error model" }, { "label": "Leakage Propagation", "reason": "Captures key non-Pauli error mechanism" }, { "label": "Qubit-wise Separation", "reason": "Handles spatial/temporal heterogeneity" } ], "emoji": "📊", "social_summary": "PAEMS models SC qubit errors precisely, boosting QEC decoders.", "highlights_oneliner": "Adaptive SC error modeling" } ] }, "2026-03-31": { "word_cloud": [ { "word": "topological codes", "weight": 5 }, { "word": "logical error rate", "weight": 5 }, { "word": "fault tolerance threshold", "weight": 5 }, { "word": "surface codes", "weight": 4 }, { "word": "neutral atoms", "weight": 4 }, { "word": "stabilizer codes", "weight": 4 }, { "word": "decoder", "weight": 4 }, { "word": "measurement-based quantum computing", "weight": 3 }, { "word": "hyperbolic geometry", "weight": 3 }, { "word": "Shor's algorithm", "weight": 3 }, { "word": "qudit systems", "weight": 3 }, { "word": "gauge theory simulation", "weight": 3 }, { "word": "quantum annealing", "weight": 3 }, { "word": "encoding rate", "weight": 3 }, { "word": "circuit-level noise", "weight": 3 }, { "word": "magic states", "weight": 2 }, { "word": "code surgery", "weight": 2 }, { "word": "minor embedding", "weight": 2 } ], "social_highlights": "Highlights: Shor's algorithm executable on 10,000 neutral-atom qubits with high-rate codes, hyperbolic cluster states achieve constant encoding rate with comparable thresholds, electromagnetic duality in toric codes requires non-Clifford operations, mixed-register stabilizer codes optimize multi-qudit systems, Floquet circuits simulate matrix models with error correction, gauge cooling suppresses violations in lattice gauge theory simulations, efficient parity-encoded embedding reduces qubit overhead in quantum annealers.", "papers": [ { "arxiv_id": "2603.28627", "title": "Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits", "authors": "Madelyn Cain, Qian Xu, Robbie King, Lewis R. B. Picard, Harry Levine, Manuel Endres, John Preskill, Hsin-Yuan Huang, Dolev Bluvstein", "arxiv_url": "https://arxiv.org/abs/2603.28627", "pdf_url": "https://arxiv.org/pdf/2603.28627", "summary": "Demonstrates that Shor's algorithm for cryptographically relevant integer factorization can be executed with as few as $10,000$ reconfigurable neutral-atom qubits by leveraging high-rate quantum error-correcting codes, efficient logical instruction sets, and optimized circuit design. Shows that discrete logarithms on P-256 elliptic curves could run in days with $26,000$ physical qubits, while RSA-2048 factorization requires one to two orders of magnitude longer runtime. Establishes that neutral-atom architectures with dynamic qubit rearrangement and long-lived clock states can achieve fault-tolerant quantum computation at cryptographically relevant scales.", "motivation": "Quantum error correction overhead has historically required millions of physical qubits for practical cryptographic applications, making large-scale quantum computers seem infeasible. Recent advances in neutral-atom platforms demonstrating universal fault-tolerant operations below error-correction thresholds and coherent qubit arrays exceeding $6,000$ qubits now enable realistic resource estimates for breaking current encryption standards.", "highlights": [ "Shor's algorithm feasible with $10,000$–$26,000$ neutral-atom qubits", "Discrete logarithm runtime reduced to days via code surgery and lifted-product codes", "Neutral atoms demonstrate fault tolerance below threshold with dynamic qubit rearrangement" ], "keywords": [ { "label": "lifted-product codes", "reason": "High-rate quantum error-correcting codes central to reducing qubit overhead for cryptographic algorithms" }, { "label": "neutral-atom arrays", "reason": "Reconfigurable optical tweezer platform enabling dynamic qubit rearrangement and long coherence times" }, { "label": "code surgery", "reason": "Technique for implementing logical Pauli product measurements and Clifford gates on general qLDPC codes" }, { "label": "cryptographic relevance", "reason": "Demonstrates practical feasibility of breaking RSA-2048 and P-256 elliptic curve cryptography" } ], "emoji": "🔐", "social_summary": "Demonstrate Shor's algorithm runs on just 10,000 neutral-atom qubits using high-rate error-correcting codes and optimized circuits.", "highlights_oneliner": "Cryptographic Shor's algorithm on 10K neutral-atom qubits" }, { "arxiv_id": "2603.27004", "title": "Hyperbolic Cluster States for Fault-Tolerant Measurement-Based Quantum Computing", "authors": "Ahmed Adel Mahmoud, Gabrielle Tournaire, Sven Bachmann, Steven Rayan", "arxiv_url": "https://arxiv.org/abs/2603.27004", "pdf_url": "https://arxiv.org/pdf/2603.27004", "summary": "Introduces hyperbolic cluster states as a generalization of three-dimensional Euclidean cluster states to negatively curved geometries via foliation of periodic hyperbolic lattices, enabling measurement-based quantum computing with improved qubit overhead. Demonstrates through large-scale numerical simulations under circuit-level depolarizing noise that hyperbolic cluster states achieve fault-tolerance thresholds comparable to Raussendorf-Harrington-Goyal (RHG) constructions while maintaining a constant encoding rate in the thermodynamic limit. Establishes that negative curvature provides intrinsic advantages for scalable fault-tolerant quantum information processing by reducing qubit overhead relative to conventional Euclidean cluster-state constructions.", "motivation": "Euclidean topological codes like the surface code suffer from vanishing encoding rates in the thermodynamic limit, requiring exponentially more qubits to encode logical information. Recent theoretical advances in hyperbolic quantum error correction and experimental demonstrations of hyperbolic lattices in superconducting and topo-electrical platforms motivate exploration of negative curvature for practical fault-tolerant quantum computing.", "highlights": [ "Hyperbolic cluster states maintain constant encoding rate versus vanishing Euclidean rate", "Fault-tolerance thresholds comparable to RHG construction (~$0.75\\%$) with reduced overhead", "Experimentally realizable via engineered negative curvature in existing laboratory platforms" ], "keywords": [ { "label": "hyperbolic geometry", "reason": "Negatively curved lattice structure enabling constant encoding rate and improved qubit efficiency" }, { "label": "measurement-based quantum computing", "reason": "Fault-tolerant quantum computation via single-qubit measurements on three-dimensional cluster resource states" }, { "label": "encoding rate", "reason": "Thermodynamic limit behavior of logical qubits per physical qubit, constant in hyperbolic versus vanishing in Euclidean" }, { "label": "circuit-level depolarizing noise", "reason": "Realistic noise model used to characterize logical error rates and decoding performance" } ], "emoji": "🌀", "social_summary": "Hyperbolic cluster states achieve constant encoding rates with comparable fault-tolerance thresholds, reducing qubit overhead.", "highlights_oneliner": "Hyperbolic geometry reduces cluster-state qubit overhead" }, { "arxiv_id": "2603.28230", "title": "Exact $\\mathbb{Z}_2$ electromagnetic duality of $\\mathbb{Z}_2$ toric code is non-Clifford", "authors": "Ryohei Kobayashi", "arxiv_url": "https://arxiv.org/abs/2603.28230", "pdf_url": "https://arxiv.org/pdf/2603.28230", "summary": "Proves rigorously that an exact internal $\\mathbb{Z}_2$ electromagnetic duality symmetry in the two-dimensional $\\mathbb{Z}_2$ toric code cannot be realized by Clifford circuits, establishing that such symmetries must be non-Clifford. Demonstrates that while exact $\\mathbb{Z}_4$ symmetries can be generated by Clifford operations, any Clifford realization of internal electromagnetic duality necessarily exhibits $\\mathbb{Z}_{2^m}$ algebra with $m \\geq 2$. Reveals an unexpected connection between exact electromagnetic duality and the Clifford hierarchy, constraining the circuit complexity required to implement symmetries in topological codes.", "motivation": "Electromagnetic duality exchanging electric and magnetic quasiparticles is a fundamental symmetry of lattice gauge theories and topological codes. Understanding which symmetries admit Clifford implementations versus requiring non-Clifford resources is crucial for designing efficient fault-tolerant quantum circuits and understanding the computational power hierarchy of quantum operations.", "highlights": [ "Exact $\\mathbb{Z}_2$ electromagnetic duality requires non-Clifford circuits", "Clifford realizations necessarily exhibit $\\mathbb{Z}_{2^m}$ algebra with $m \\geq 2$", "Establishes connection between exact symmetries and Clifford hierarchy constraints" ], "keywords": [ { "label": "electromagnetic duality", "reason": "Fundamental symmetry of toric code exchanging electric and magnetic topological operators" }, { "label": "Clifford hierarchy", "reason": "Classification of quantum circuits by computational power, constraining feasible symmetry implementations" }, { "label": "toric code", "reason": "Canonical $\\mathbb{Z}_2$ topological code exhibiting electromagnetic duality symmetry" } ], "emoji": "⚡", "social_summary": "Prove exact electromagnetic duality in toric codes requires non-Clifford circuits, revealing Clifford hierarchy constraints.", "highlights_oneliner": "Electromagnetic duality demands non-Clifford operations" }, { "arxiv_id": "2603.28459", "title": "Mixed-register Stabilizer Codes: A Coding-theoretic Perspective", "authors": "Himanshu Dongre, Lane G. Gunderman", "arxiv_url": "https://arxiv.org/abs/2603.28459", "pdf_url": "https://arxiv.org/pdf/2603.28459", "summary": "Develops coding-theoretic framework for mixed-register stabilizer codes where quantum locations have varying local dimensions (qudits), extending beyond conventional uniform-dimension systems. Identifies forbidden stabilizer-encoded information forms and constructs coding-theoretically optimal mixed-register codes from coprime local-dimension constituent codes, yielding logical subspaces that do not correspond directly to any single constituent dimension. Demonstrates that mixed-register architectures can reduce the number of individual quantum locations requiring protection while more accurately reflecting realistic quantum hardware constraints.", "motivation": "Conventional quantum error correction assumes uniform qubit systems, but realistic quantum hardware often contains qudits with varying local dimensions. Exploiting this heterogeneity can reduce resource overhead and better match physical device architectures, motivating a systematic coding-theoretic treatment of mixed-register systems.", "highlights": [ "Identifies forbidden logical subspace structures in mixed-register stabilizer codes", "Constructs optimal codes from coprime local-dimension constituents", "Reduces quantum location overhead by exploiting hardware heterogeneity" ], "keywords": [ { "label": "mixed-register qudits", "reason": "Quantum systems with varying local dimensions enabling resource-efficient error correction" }, { "label": "stabilizer codes", "reason": "Framework for quantum error correction using stabilizer group measurements and syndrome extraction" }, { "label": "coding-theoretic constraints", "reason": "Mathematical restrictions on logical subspace structures in heterogeneous quantum devices" } ], "emoji": "🧩", "social_summary": "Develop coding theory for mixed-register qudits, reducing quantum location overhead in heterogeneous hardware.", "highlights_oneliner": "Mixed-register codes optimize heterogeneous qudit systems" }, { "arxiv_id": "2603.26874", "title": "Floquet circuits inspired by holographic matrix models", "authors": "Yun Ma, Andrew Lucas", "arxiv_url": "https://arxiv.org/abs/2603.26874", "pdf_url": "https://arxiv.org/pdf/2603.26874", "summary": "Proposes that neutral-atom systems with movable optical tweezers can simulate Floquet Clifford circuits mimicking Trotterized time-evolution of matrix models in quantum mechanics, exhibiting signatures of fast scrambling. Demonstrates a simplified Hayden-Preskill recovery protocol where stabilizer quantum error correction replaces postselection, enabling information recovery from scrambled quantum states. Shows that cyclic connectivity patterns and row-column permutations in neutral-atom arrays can efficiently implement matrix-model interactions while maintaining locality constraints.", "motivation": "Holographic duality and matrix models provide theoretical frameworks for understanding quantum gravity and scrambling dynamics. Near-term neutral-atom platforms with dynamic qubit rearrangement offer a practical testbed for simulating these phenomena, bridging condensed matter physics, quantum information, and high-energy theory.", "highlights": [ "Neutral atoms simulate Trotterized matrix-model time-evolution via Floquet circuits", "Stabilizer error correction enables Hayden-Preskill information recovery without postselection", "Cyclic connectivity and permutations implement nonlocal interactions locally" ], "keywords": [ { "label": "Floquet circuits", "reason": "Periodically driven quantum circuits exhibiting fast scrambling and information recovery dynamics" }, { "label": "matrix models", "reason": "Quantum mechanical systems with holographic duality properties simulated via neutral-atom platforms" }, { "label": "stabilizer error correction", "reason": "Quantum error correction framework enabling information recovery in scrambled quantum states" }, { "label": "neutral-atom tweezers", "reason": "Movable optical trap platform enabling dynamic qubit rearrangement and efficient circuit implementation" } ], "emoji": "🌊", "social_summary": "Simulate holographic matrix models on neutral atoms using Floquet circuits with stabilizer error correction.", "highlights_oneliner": "Matrix models via Floquet circuits on neutral atoms" }, { "arxiv_id": "2603.26819", "title": "Approximate Error Correction for Quantum Simulations of SU(2) Lattice Gauge Theories", "authors": "Zachary P. Bradshaw", "arxiv_url": "https://arxiv.org/abs/2603.26819", "pdf_url": "https://arxiv.org/pdf/2603.26819", "summary": "Presents gauge cooling protocol using mid-circuit measurements and group quantum Fourier transforms to suppress Gauss law violations in $\\text{SU}(2)$ lattice gauge theory simulations. Demonstrates that while Knill-Laflamme conditions are not generically satisfied at vertices with nontrivial singlet multiplicity, every single-qubit error is detected by the gauge syndrome, enabling syndrome-conditional recovery operations. Shows improved fidelity under depolarizing and amplitude damping noise representative of current superconducting hardware through iterative vertex sweeps restoring gauge invariance.", "motivation": "Quantum simulations of lattice gauge theories are key applications for near-term quantum processors, but maintaining gauge invariance under noise is challenging. Approximate error correction tailored to gauge-theory structure can suppress constraint violations more efficiently than generic quantum error correction, enabling practical simulations on current hardware.", "highlights": [ "Gauge cooling detects all single-qubit errors via gauge syndrome measurements", "Group quantum Fourier transform resolves angular momentum and magnetic quantum numbers", "Restores gauge invariance and improves fidelity under realistic superconducting noise" ], "keywords": [ { "label": "gauge cooling", "reason": "Iterative protocol suppressing Gauss law violations via syndrome-conditional recovery operations" }, { "label": "lattice gauge theory", "reason": "Quantum simulation of $\\text{SU}(2)$ gauge theories with constraint-preserving error correction" }, { "label": "group quantum Fourier transform", "reason": "Mid-circuit measurement technique characterizing gauge-violation sector at lattice vertices" } ], "emoji": "⚙️", "social_summary": "Suppress gauge violations in lattice gauge theory simulations using gauge cooling and group quantum Fourier transforms.", "highlights_oneliner": "Gauge cooling for lattice gauge theory simulations" }, { "arxiv_id": "2603.28667", "title": "Qubit-efficient embedding of parity-encoded Hamiltonians in quantum annealers", "authors": "Ryoji Miyazaki", "arxiv_url": "https://arxiv.org/abs/2603.28667", "pdf_url": "https://arxiv.org/pdf/2603.28667", "summary": "Proposes qubit-efficient embedding scheme for parity-encoded Hamiltonians in the Sourlas-Lechner-Hauke-Zoller (SLHZ) framework on quantum annealers with Zephyr connectivity, reducing embedding overhead from conventional minor embedding. Constructs explicit systematic embedding mapping multi-body interactions to intermediate Hamiltonians with only one- and two-body terms, using two-qubit chains assigned via translation operators. Achieves three qubits per parity spin, fewer than known Pegasus-graph embeddings, while maintaining practical flexibility to avoid inactive qubits and reduce ancillary-spin overhead.", "motivation": "Quantum annealing on current devices like D-Wave systems is limited by restricted qubit connectivity and embedding overhead. The SLHZ parity-encoding approach offers advantages over conventional Ising embedding, but efficient implementation on available hardware topologies has been lacking, limiting scalability of large optimization problems.", "highlights": [ "Three qubits per parity spin versus higher overhead in conventional embeddings", "Systematic chain-assignment rules ensure valid chain-to-chain connectivity", "Practical flexibility to avoid inactive qubits and reduce ancillary-spin overhead" ], "keywords": [ { "label": "parity encoding", "reason": "SLHZ scheme mapping logical Hamiltonians to parity-based representations for quantum annealing" }, { "label": "minor embedding", "reason": "Technique mapping logical qubits to physical qubit chains on restricted-connectivity hardware graphs" }, { "label": "Zephyr connectivity", "reason": "Hardware topology of current D-Wave quantum annealers with $4400$ qubits" } ], "emoji": "🔗", "social_summary": "Embed parity-encoded Hamiltonians efficiently on quantum annealers using three qubits per spin.", "highlights_oneliner": "Efficient parity-encoding embedding for quantum annealers" } ] }, "2026-03-30": { "word_cloud": [ { "word": "cohomological", "weight": 5 }, { "word": "sheaf", "weight": 4 }, { "word": "cup", "weight": 4 }, { "word": "PEC", "weight": 5 }, { "word": "blockwise", "weight": 4 }, { "word": "TFIM", "weight": 3 }, { "word": "catalytic", "weight": 5 }, { "word": "coherence", "weight": 4 }, { "word": "mode", "weight": 3 }, { "word": "Majorana", "weight": 5 }, { "word": "subsystem", "weight": 4 }, { "word": "honeycomb", "weight": 3 }, { "word": "noise", "weight": 5 }, { "word": "SHG", "weight": 4 }, { "word": "laser", "weight": 3 }, { "word": "decoder", "weight": 5 }, { "word": "threshold", "weight": 4 }, { "word": "GKP", "weight": 4 }, { "word": "surface", "weight": 4 } ], "social_highlights": "Highlights: cohomological invariants for qLDPC/sheaf codes, scalable PEC via blockwise aggregation, catalytic coherence recovery, Majorana-XYZ subsystem code, ultrabroadband laser noise suppression, decoder dependence in surface-code thresholds.", "papers": [ { "arxiv_id": "2603.25831", "title": "Theory of (Co)homological Invariants on Quantum LDPC Codes", "authors": "Zimu Li, Yuguo Shao, Fuchuan Wei, Yiming Li, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2603.25831", "pdf_url": "https://arxiv.org/pdf/2603.25831", "summary": "Establishes framework for analyzing (co)homological invariants across qLDPC and sheaf codes, generalizes canonical logical representatives, and computes cup products supporting $\\tilde{\\Theta}(N)$ independent operations on almost good codes of length $N$. Proposes inductive generation preserving invariants from constant-size HGP codes.", "motivation": "Breakthroughs in good qLDPC codes and qLTCs necessitate understanding logical operations via (co)homological invariants. This work bridges advanced mathematics to enable constant-depth multi-controlled-$Z$ gates and scalable code families.", "highlights": [ "$\\tilde{\\Theta}(N)$ independent cup products", "Inductive HGP/sheaf code generation", "Preserves all (co)homological invariants" ], "keywords": [ { "label": "(co)homological invariants", "reason": "Core mathematical framework unifying code analysis" }, { "label": "sheaf codes", "reason": "Generalization beyond HGP with explicit codeword characterization" }, { "label": "cup products", "reason": "First comprehensive computation enabling parallel gates" }, { "label": "graph lifts", "reason": "Inductive construction preserving code properties" } ], "emoji": "🧮", "social_summary": "Unlocks cohomological secrets of qLDPC/sheaf codes for scalable quantum gates!", "highlights_oneliner": "Cohomological qLDPC invariants" }, { "arxiv_id": "2603.26063", "title": "MoSAIC: Scalable Probabilistic Error Cancellation via Variational Blockwise Noise Aggregation", "authors": "Maya Ma, Rimika Jaiswal, Murphy Yuezhen Niu", "arxiv_url": "https://arxiv.org/abs/2603.26063", "pdf_url": "https://arxiv.org/pdf/2603.26063", "summary": "Introduces MoSAIC framework partitioning circuits into noise-aligned blocks with variational block noise learning, reducing PEC sampling overhead while preserving unbiasedness. Demonstrates 1-2 orders better accuracy than standard PEC on IBM 156-qubit Heron for TFIM up to 50 qubits.", "motivation": "PEC's exponential sampling overhead limits NISQ utility despite theoretical rigor. Blockwise aggregation addresses this scalability bottleneck for large-scale quantum experiments.", "highlights": [ "1-2 orders better accuracy than PEC", "Largest hardware PEC demonstration (156 qubits)", "TFIM ground states to 50 qubits" ], "keywords": [ { "label": "probabilistic error cancellation", "reason": "Unbiased mitigation baseline improved by blockwise approach" }, { "label": "variational block learning", "reason": "Core innovation reducing sampling overhead" }, { "label": "noise-aligned blocks", "reason": "Circuit partitioning strategy enabling scalability" }, { "label": "TFIM benchmark", "reason": "Physically meaningful 50-qubit validation" } ], "emoji": "🔲", "social_summary": "MoSAIC slashes PEC sampling costs 100x on 156-qubit IBM hardware!", "highlights_oneliner": "Scalable blockwise PEC" }, { "arxiv_id": "2603.25774", "title": "Catalytic Coherence Amplification for Quantum State Recovery: Theory, Numerical Validation, and Comparison with Conventional Error Correction", "authors": "Hikaru Wakaura", "arxiv_url": "https://arxiv.org/abs/2603.25774", "pdf_url": "https://arxiv.org/pdf/2603.25774", "summary": "Presents CQEC protocol amplifying coherence via catalytic covariant transformations without error threshold when mode inclusion holds. Numerically validates across 5 protocols achieving $F>0.999$ asymptotically from $F=0.07$, with $1-F\\leq O(1/\\sqrt{n})$ scaling.", "motivation": "Conventional QEC requires error thresholds and high qubit overhead; coherence resource theory enables threshold-free recovery. Validates Shiraishi-Takagi coherence amplification for practical quantum state recovery.", "highlights": [ "No error threshold required", "$F>0.999$ from $F=0.07$ (200 configs)", "Compares favorably to Steane/surface codes" ], "keywords": [ { "label": "catalytic coherence", "reason": "Threshold-free recovery mechanism" }, { "label": "mode inclusion", "reason": "Fundamental recoverability condition" }, { "label": "correlated catalysis", "reason": "Preserves catalyst for reuse" }, { "label": "coherence resource theory", "reason": "Theoretical foundation vs stabilizer formalism" } ], "emoji": "🔄", "social_summary": "CQEC recovers quantum states without error thresholds using coherence amplification!", "highlights_oneliner": "Threshold-free coherence recovery" }, { "arxiv_id": "2603.26311", "title": "Majorana-XYZ subsystem code", "authors": "Tobias Busse, Lauri Toikka", "arxiv_url": "https://arxiv.org/abs/2603.26311", "pdf_url": "https://arxiv.org/pdf/2603.26311", "summary": "Introduces Majorana-XYZ $[n,k,g,d]$ subsystem code with $n=L^2$, $k=\\lfloor L/2\\rfloor$, $g\\sim L^2$, $d=L$ using 3-local nearest-neighbor checks. Detects all 1-2 qubit errors; weight-3+ errors confined to gauge group protecting macroscopic topological logical qubits.", "motivation": "Majorana honeycomb platforms enable experimental topological protection. Combines subsystem/gauge/topological features with macroscopic scaling and local checks.", "highlights": [ "$k=\\lfloor L/2\\rfloor$ logical qubits in $L^2$ physical", "3-local nearest-neighbor checks", "Majorana honeycomb implementation" ], "keywords": [ { "label": "Majorana-XYZ", "reason": "Novel subsystem code family" }, { "label": "honeycomb lattice", "reason": "Experimental Majorana platform" }, { "label": "topological gauge", "reason": "Hybrid protection mechanism" }, { "label": "$d=L$ distance", "reason": "Macroscopic error protection" } ], "emoji": "🪼", "social_summary": "Majorana-XYZ: macroscopic topological logical qubits with local checks!", "highlights_oneliner": "Majorana subsystem code" }, { "arxiv_id": "2603.25801", "title": "Ultrabroadband Passive Laser Noise Suppression to Quantum Noise Limit through on-chip Second Harmonic Generation", "authors": "Geun Ho Ahn, Ziyu Wang, Devin J. Dean, Hubert S. Stokowski, Taewon Park, Martin M. Fejer, Jonathan Simon, Amir H. Safavi-Naeini", "arxiv_url": "https://arxiv.org/abs/2603.25801", "pdf_url": "https://arxiv.org/pdf/2603.25801", "summary": "Demonstrates all-optical noise eater using nanophotonic SHG at pump-depletion stationary point, suppressing intensity noise 25-60 dB from DC to >10 GHz. Stabilizes noisy fiber amplifiers to shot-noise limit without feedback or resonators.", "motivation": "Laser intensity noise limits quantum technologies; existing stabilization trades bandwidth for complexity. Passive nanophotonic SHG enables scalable wideband suppression.", "highlights": [ "25-60 dB suppression to >10 GHz", "Passive, nonresonant operation", "Shot-noise limited stabilization" ], "keywords": [ { "label": "second harmonic generation", "reason": "Core passive noise suppression mechanism" }, { "label": "pump-depletion stationary", "reason": "Fluctuation decoupling principle" }, { "label": "nanophotonic LiNbO3", "reason": "Scalable implementation platform" }, { "label": "shot-noise limit", "reason": "Ultimate performance benchmark" } ], "emoji": "🔆", "social_summary": "Passive chip suppresses laser noise 60dB across 10GHz to quantum limit!", "highlights_oneliner": "Ultrabroadband laser stabilization" }, { "arxiv_id": "2603.25757", "title": "Decoder Dependence in Surface-Code Threshold Estimation with Native Gottesman-Kitaev-Preskill Digitization and Parallelized Sampling", "authors": "Dennis Delali Kwesi Wayo, Chinonso Onah, Vladimir Milchakov, Leonardo Goliatt, Sven Groppe", "arxiv_url": "https://arxiv.org/abs/2603.25757", "pdf_url": "https://arxiv.org/pdf/2603.25757", "summary": "Quantifies decoder performance across MWPM, UF, BP, neural MWPM under Pauli/GKP noise using LiDMaS+ v1.1.0. MWPM/UF define Pareto frontier; only MWPM yields stable crossing-bootstrap thresholds $\\sigma^*_{3,5}=0.10$, $\\sigma^*_{5,7}=0.1375$.", "motivation": "Surface-code thresholds depend critically on decoder choice, noise model, and estimator. Establishes reproducible benchmarking protocols for hardware-relevant GKP digitization.", "highlights": [ "MWPM/UF Pareto frontier ($d=5$, $\\sigma=0.20$)", "Stable thresholds only for MWPM", "1.94$\\times$ GKP speedup with fidelity" ], "keywords": [ { "label": "decoder dependence", "reason": "Core phenomenon quantified across 4 decoders" }, { "label": "GKP digitization", "reason": "Hardware-relevant continuous-variable noise" }, { "label": "crossing-bootstrap", "reason": "Stable threshold estimator" }, { "label": "LiDMaS+", "reason": "Benchmarking framework v1.1.0" } ], "emoji": "📊", "social_summary": "Benchmarks reveal MWPM reigns supreme for surface-code thresholds!", "highlights_oneliner": "Decoder benchmark surface codes" } ] }, "2026-03-27": { "word_cloud": [ { "word": "graph states", "weight": 4 }, { "word": "LU-LC", "weight": 5 }, { "word": "magic states", "weight": 4 }, { "word": "surface code", "weight": 5 }, { "word": "sigma model", "weight": 4 }, { "word": "coherent errors", "weight": 5 }, { "word": "distillation", "weight": 4 }, { "word": "Clifford", "weight": 5 }, { "word": "threshold", "weight": 4 }, { "word": "Grover", "weight": 3 }, { "word": "Bitcoin", "weight": 4 }, { "word": "long-range", "weight": 5 }, { "word": "nonstabilizerness", "weight": 4 }, { "word": "synthesis", "weight": 3 }, { "word": "measurements", "weight": 4 }, { "word": "topological", "weight": 3 }, { "word": "decoding", "weight": 5 }, { "word": "replica limit", "weight": 4 }, { "word": "Kardashev", "weight": 3 } ], "social_highlights": "Highlights: minimal LU-LC counterexample, weak distillation framework, sigma model for coherent surface code errors, two-sided long-range magic states, Clifford synthesis with commuting measurements, quantum Bitcoin mining costs.", "papers": [ { "arxiv_id": "2603.25219", "title": "The 27-qubit Counterexample to the LU-LC Conjecture is Minimal", "authors": "Nathan Claudet", "arxiv_url": "https://arxiv.org/abs/2603.25219", "pdf_url": "https://arxiv.org/pdf/2603.25219", "summary": "Proves the 27-qubit graph states counterexample to the LU-LC conjecture is minimal, showing LU and LC equivalence coincide for up to 26 qubits. Achieved by analyzing 2-local complementation, a generalization of local complementation, with connections to triorthogonal and Reed-Muller codes.", "motivation": "The LU-LC conjecture, disproved in 2007 by 27-qubit graph states, questioned equivalence of local unitary and local Clifford transformations on graph states. Establishing minimality clarifies the boundary where these notions diverge, impacting graph state classifications in quantum information.", "highlights": [ "27-qubit counterexample minimal", "LU=LC up to 26 qubits", "2-local complementation analysis" ], "keywords": [ { "label": "LU-LC conjecture", "reason": "Central conjecture disproved and proven minimal here" }, { "label": "graph states", "reason": "States where equivalence is studied" }, { "label": "2-local complementation", "reason": "Key technique generalizing local complementation" }, { "label": "triorthogonal codes", "reason": "Connection used in proof" } ], "emoji": "🔗", "social_summary": "Proves 27-qubit counterexample to LU-LC conjecture is minimal for graph states.", "highlights_oneliner": "Minimal LU-LC counterexample" }, { "arxiv_id": "2603.25358", "title": "Weak distillation of quantum resources", "authors": "Shinnosuke Onishi, Oliver Hahn, Ryuji Takagi", "arxiv_url": "https://arxiv.org/abs/2603.25358", "pdf_url": "https://arxiv.org/pdf/2603.25358", "summary": "Introduces a framework lifting quasi-probability protocols to weak simulators for sampling desired distributions using restricted quantum resources. Sampling cost scales with quasi-probability negativity, outperforming naive methods in error mitigation, entanglement and magic state distillation.", "motivation": "Quasi-probability methods enable simulating inaccessible operations but are limited to expectation values, hindering full simulation. This work enables weak simulation without actual distillation, broadening virtual distillation applications.", "highlights": [ "Weak simulation framework", "Negativity-proportional cost", "Applies to distillation tasks" ], "keywords": [ { "label": "quasi-probability", "reason": "Basis for lifted protocols" }, { "label": "weak simulator", "reason": "Achieves sampling from distributions" }, { "label": "virtual distillation", "reason": "New notion without state distillation" }, { "label": "negativity", "reason": "Scales sampling overhead" } ], "emoji": "✨", "social_summary": "Transforms quasi-probability protocols into weak simulators for quantum resources.", "highlights_oneliner": "Weak quantum distillation" }, { "arxiv_id": "2603.25665", "title": "Non-linear Sigma Model for the Surface Code with Coherent Errors", "authors": "Stephen W. Yan, Yimu Bao, Sagar Vijay", "arxiv_url": "https://arxiv.org/abs/2603.25665", "pdf_url": "https://arxiv.org/pdf/2603.25665", "summary": "Derives a nonlinear sigma model with target space $\\mathrm{SO}(2n)/\\mathrm{U}(n)$ for maximum-likelihood decoding of square-lattice surface code under coherent single-qubit rotations. Reveals thermal-metal phase in suboptimal decoding absent in optimal; predicts fidelity via twist defects.", "motivation": "Surface code thresholds under coherent errors are poorly understood despite promise as quantum memory. Analytic effective theory distinguishes optimal/suboptimal decoders and predicts new phases like thermal-metal.", "highlights": [ "NL$\\sigma$M for coherent decoding", "Thermal-metal phase", "Optimal decoding stability" ], "keywords": [ { "label": "non-linear sigma model", "reason": "Effective long-distance theory" }, { "label": "coherent errors", "reason": "Error model studied" }, { "label": "thermal-metal phase", "reason": "New non-decodable regime" }, { "label": "replica limit", "reason": "$n\\to1$ optimal, $n\\to0$ suboptimal" } ], "emoji": "📚", "social_summary": "Derives sigma model revealing new phases in surface code coherent decoding.", "highlights_oneliner": "Sigma model for coherent errors" }, { "arxiv_id": "2603.25023", "title": "Explicit States with Two-sided Long-Range Magic", "authors": "Zhi Li", "arxiv_url": "https://arxiv.org/abs/2603.25023", "pdf_url": "https://arxiv.org/pdf/2603.25023", "summary": "Constructs states with two-sided long-range magic, uncreatable by $\\mathsf{Clifford}\\circ\\mathsf{FDU}$ or $\\mathsf{FDU}\\circ\\mathsf{Clifford}$, placing them outside first magic hierarchy level. Examples include magical cat state $|0^n\\rangle + |+^n\\rangle$ and nonabelian topological ground states.", "motivation": "Long-range magic extends entanglement analogy for nonstabilizerness needed beyond Clifford simulability. Two-sided version strengthens against both circuit orders, linking to magic hierarchy and quantum error correction principles.", "highlights": [ "Two-sided long-range magic", "Magical cat state", "Magic hierarchy level 2" ], "keywords": [ { "label": "long-range magic", "reason": "Core nonstabilizerness property" }, { "label": "magic hierarchy", "reason": "Classifies circuits; states beyond level 1" }, { "label": "magical cat", "reason": "Explicit constructed example" }, { "label": "nonabelian topological", "reason": "Ground states with property" } ], "emoji": "🐱", "social_summary": "Builds states with unbreakable two-sided long-range magic.", "highlights_oneliner": "Two-sided magic states" }, { "arxiv_id": "2603.24731", "title": "Clifford synthesis via generalized S and CZ gates", "authors": "Vadym Kliuchnikov, Marcus P. da Silva", "arxiv_url": "https://arxiv.org/abs/2603.24731", "pdf_url": "https://arxiv.org/pdf/2603.24731", "summary": "Synthesizes any $n$-qubit Clifford using at most $2n$ multi-qubit joint measurements in two commuting sets of size $\\le n$. Alternative uses multi-target CNOTs for Quantum LDPC hardware.", "motivation": "Efficient Clifford synthesis enables layout switches in fault-tolerant hardware like lattice-surgery surface codes. Commuting measurement sets offer space-time trade-offs for practical implementation.", "highlights": [ "$2n$ joint measurements", "Two commuting sets", "LDPC hardware version" ], "keywords": [ { "label": "Clifford synthesis", "reason": "Main algorithmic contribution" }, { "label": "joint measurements", "reason": "Implementation primitive" }, { "label": "commuting sets", "reason": "Enables parallelization" }, { "label": "lattice surgery", "reason": "Targeted application" } ], "emoji": "⚡", "social_summary": "Synthesizes Cliffords with 2n commuting joint measurements.", "highlights_oneliner": "Clifford via commuting measures" }, { "arxiv_id": "2603.25519", "title": "Kardashev scale Quantum Computing for Bitcoin Mining", "authors": "Pierre-Luc Dallaire-Demers", "arxiv_url": "https://arxiv.org/abs/2603.25519", "pdf_url": "https://arxiv.org/pdf/2603.25519", "summary": "Estimates fault-tolerant Grover mining costs: $10^8$ qubits/$10^4$ MW at $b=32$, exploding to $10^{23}$ qubits/$10^{25}$ W at mainnet $b\\approx79$. Reveals impracticality due to oracle, distillation, fleet overheads.", "motivation": "Grover's quadratic speedup on Bitcoin mining is conflated with Shor signature threat; physical costs unassessed. Quantifies why quantum mining remains impractical despite asymptotics.", "highlights": [ "$10^8$ qubits for $b=32$", "Kardashev Type II for mainnet", "Overhead-dominated" ], "keywords": [ { "label": "Grover mining", "reason": "Quantum attack modeled" }, { "label": "surface code", "reason": "Fault-tolerant platform" }, { "label": "Kardashev scale", "reason": "Energy cost metric" }, { "label": "double-SHA256", "reason": "Reversible oracle cost" } ], "emoji": "⚡", "social_summary": "Quantum Bitcoin mining demands Kardashev-scale resources.", "highlights_oneliner": "Quantum mining impractical" } ] }, "2026-03-26": { "word_cloud": [ { "word": "Clifford", "weight": 5 }, { "word": "flag", "weight": 4 }, { "word": "qudits", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "Gilbert-Varshamov", "weight": 4 }, { "word": "atom loss", "weight": 5 }, { "word": "surface code", "weight": 4 }, { "word": "Talbot", "weight": 4 }, { "word": "GKP", "weight": 5 }, { "word": "shadow", "weight": 3 }, { "word": "metrology", "weight": 3 }, { "word": "Frenkel", "weight": 3 }, { "word": "excitons", "weight": 3 }, { "word": "iceberg", "weight": 3 }, { "word": "stabilizer", "weight": 4 }, { "word": "decoder", "weight": 4 }, { "word": "threshold", "weight": 4 }, { "word": "noise", "weight": 3 } ], "social_highlights": "Highlights: flag circuits for non-Clifford rotations, qudit Clifford simulator, GV-bound quantum LDPC, correlated atom loss decoding, TF Talbot on GKP, Clifford lensing metrology, DL error mitigation for excitons.", "papers": [ { "arxiv_id": "2603.24573", "title": "Flagging the Clifford hierarchy:~Fault-tolerant logical $\\fracπ{2^l}$ rotations via measuring circuit gauge operators of non-Cliffords", "authors": "Shival Dasu, Ben Criger", "arxiv_url": "https://arxiv.org/abs/2603.24573", "pdf_url": "https://arxiv.org/pdf/2603.24573", "summary": "Provides flag circuits detecting logical errors from non-fault-tolerant $R_{\\overline{Z}}(\\fracπ{2^l})$ gates on CSS codes with fault distance 2. Implements fault-tolerant $R_Z(\\fracπ{2^l})$ and $R_{ZZ}(\\fracπ{2^l})$ on $[[k + 2, k, 2]]$ iceberg codes with $O(l)$ overhead and prepares resource states in $[[7,1,3]]$ code. Generalizes to binary rotations $\\pi(x_0.x_1\\dots x_l)$ and shows fault distance improvements to 3 and 4.", "motivation": "Non-Clifford gates like $T$-gates are essential for universal quantum computing but challenging to implement fault-tolerantly, causing high overheads in gate synthesis. This work enables efficient implementations for small $l$, crucial for quantum simulations requiring precise rotations.", "highlights": [ "Flag circuits for $R_{\\overline{Z}}(\\fracπ{2^l})$ error detection", "$O(l)$ overhead on iceberg codes", "Fault distance 4 via concatenation" ], "keywords": [ { "label": "flag circuits", "reason": "core technique for error detection in non-Clifford gates" }, { "label": "iceberg codes", "reason": "specific code family enabling low-overhead gates" }, { "label": "Clifford hierarchy", "reason": "framework for $\\fracπ{2^l}$ rotations" }, { "label": "$[[7,1,3]]$ states", "reason": "resource preparation for gate teleportation" } ], "emoji": "🧭", "social_summary": "Flag circuits enable fault-tolerant non-Clifford rotations with minimal overhead!", "highlights_oneliner": "Fault-tolerant Clifford hierarchy" }, { "arxiv_id": "2603.23641", "title": "QuickQudits: A Framework for Efficient Simulation of Noisy Qudit Clifford Circuits via an Extended Stabilizer Tableau Formalism", "authors": "Nina Brandl, Mykyta Cherniak, Johannes Kofler, Richard Kueng", "arxiv_url": "https://arxiv.org/abs/2603.23641", "pdf_url": "https://arxiv.org/pdf/2603.23641", "summary": "Presents stabilizer tableau formalism for efficient simulation of noisy $d$-dimensional qudit Clifford circuits. Handles prime/composite dimensions via Smith normal form and models Weyl noise with phase updates and frames. Enables fast fidelity estimation via accumulated phase $\\Delta\\tau$.", "motivation": "Clifford circuit simulation is vital for validating quantum advantage claims, but qudits and noise complicate state-vector methods. This scalable open-source framework bridges simulation and experiment for higher-dimensional systems.", "highlights": [ "Qudit stabilizer tableau with noise", "Smith normal form for composite $d$", "Weyl frames for fast noisy simulation" ], "keywords": [ { "label": "qudits", "reason": "higher-dimensional generalization of qubits" }, { "label": "stabilizer tableau", "reason": "core simulation formalism extended to $\\mathbb{Z}_d$" }, { "label": "Smith normal form", "reason": "enables measurement sampling in composite dimensions" }, { "label": "Weyl frames", "reason": "noise-handling technique analogous to Pauli twirling" } ], "emoji": "🧮", "social_summary": "QuickQudits simulates noisy qudit Clifford circuits efficiently!", "highlights_oneliner": "Noisy qudit Clifford simulator" }, { "arxiv_id": "2603.24588", "title": "Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound", "authors": "Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2603.24588", "pdf_url": "https://arxiv.org/pdf/2603.24588", "summary": "Constructs nested CSS codes from Hsu-Anastasopoulos and MacKay-Neal LDPC codes with non-vanishing rate. Proves relative linear distance in fixed-degree regime and Gilbert-Varshamov distance for 7 finite-degree settings via computer-assisted proof.", "motivation": "Quantum LDPC breakthroughs achieved rate-distance-sparsity but explicit finite-degree GV bounds were missing. This provides concrete constructions meeting theoretical limits at practical degrees.", "highlights": [ "Nested MN/HA CSS family", "Finite-degree GV certification", "Relative linear distance w.h.p." ], "keywords": [ { "label": "quantum LDPC", "reason": "code family with sparse parity checks" }, { "label": "Gilbert-Varshamov bound", "reason": "achieved distance metric" }, { "label": "nested CSS", "reason": "construction from classical LDPC pairs" }, { "label": "fixed-degree", "reason": "practical regime analysis" } ], "emoji": "📏", "social_summary": "Finite-degree quantum LDPC codes hit GV bound!", "highlights_oneliner": "GV-bound quantum LDPC" }, { "arxiv_id": "2603.24237", "title": "Correlated Atom Loss as a Resource for Quantum Error Correction", "authors": "Hugo Perrin, Gatien Roger, Guido Pupillo", "arxiv_url": "https://arxiv.org/abs/2603.24237", "pdf_url": "https://arxiv.org/pdf/2603.24237", "summary": "Exploits correlated atom loss structure in neutral-atom surface codes with teleportation-based loss-detection units. Decoder constructs loss graph updating probabilities, converting delayed erasures to standard erasures. Achieves 10x logical error reduction and raises loss threshold from 3.2% to 4%.", "motivation": "Atom loss dominates neutral-atom processors but correlations were ignored by standard decoders. Harnessing this structure enables architecture-specific QEC improvements.", "highlights": [ "Loss graph decoder for correlations", "Threshold from 3.2% to 4%", "10x logical error reduction" ], "keywords": [ { "label": "atom loss", "reason": "dominant neutral-atom error channel" }, { "label": "loss graph", "reason": "novel decoder exploiting correlations" }, { "label": "teleportation LDUs", "reason": "loss detection enabling erasure conversion" }, { "label": "neutral atoms", "reason": "target hardware platform" } ], "emoji": "🔬", "social_summary": "Correlated atom loss boosts surface code threshold to 4%!", "highlights_oneliner": "Correlated loss decoding" }, { "arxiv_id": "2603.24279", "title": "Time-frequency Talbot effect as Clifford operations on entangled time-frequency GKP states", "authors": "Thomas Pousset, Romain Dalidet, Laurent Labonté, Nicolas Fabre", "arxiv_url": "https://arxiv.org/abs/2603.24279", "pdf_url": "https://arxiv.org/pdf/2603.24279", "summary": "Defines time-frequency Talbot effect implementing Clifford gates on TF-GKP qubits encoded in entangled photon pair frequency combs. Analyzes comb envelope tradeoffs for gate fidelity vs error correction. Demonstrates state distinguishability via generalized HOM interferometer.", "motivation": "Spatial Talbot effect enables qudit gates; temporal analog needed for photonic systems. TF-GKP codes need native Clifford operations for fault tolerance.", "highlights": [ "TF Talbot = Clifford gates", "TF-GKP qubit encoding", "HOM interferometer readout" ], "keywords": [ { "label": "TF-GKP", "reason": "time-frequency GKP encoding" }, { "label": "Talbot effect", "reason": "physical mechanism for Clifford gates" }, { "label": "frequency combs", "reason": "entangled photon pair basis" }, { "label": "HOM interferometer", "reason": "state distinguishability measurement" } ], "emoji": "⏱️", "social_summary": "Time-frequency Talbot implements Clifford gates on GKP states!", "highlights_oneliner": "TF Talbot for GKP" }, { "arxiv_id": "2603.24035", "title": "Efficient Many-Body Shadow Metrology via Clifford Lensing", "authors": "Sooryansh Asthana, Conan Alexander, Anubhav Kumar Srivastava, T. S. Mahesh, Sai Vinjanampathy", "arxiv_url": "https://arxiv.org/abs/2603.24035", "pdf_url": "https://arxiv.org/pdf/2603.24035", "summary": "Clifford lensing uses joint Clifford operations on states and observables to localize distributed many-body phase information. Establishes QEC code correspondence to interferometric phase kickback. Demonstrates optimal 15-qubit NMR sensing via partial shadow tomography.", "motivation": "Optimal many-body metrology requires inaccessible nonlocal SLD measurements. Systematic transformation to local observables preserves quantum Fisher information.", "highlights": [ "Clifford lensing concept", "QEC-interferometry correspondence", "15-qubit NMR demonstration" ], "keywords": [ { "label": "Clifford lensing", "reason": "core technique localizing phase info" }, { "label": "shadow metrology", "reason": "efficient phase estimation protocol" }, { "label": "SLD measurements", "reason": "optimal but inaccessible observables" }, { "label": "NMR experiment", "reason": "15-qubit validation platform" } ], "emoji": "🔍", "social_summary": "Clifford lensing enables optimal many-body quantum sensing!", "highlights_oneliner": "Clifford lensing metrology" }, { "arxiv_id": "2603.23936", "title": "Quantum Computing and Error Mitigation with Deep Learning for Frenkel Excitons", "authors": "Yi-Ting Lee, Vijaya Begum-Hudde, Barbara A. Jones, André Schleife", "arxiv_url": "https://arxiv.org/abs/2603.23936", "pdf_url": "https://arxiv.org/pdf/2603.23936", "summary": "Uses variational quantum deflation for Frenkel exciton eigenstates and oscillator strengths on NISQ devices. Develops deep learning error mitigation with post-selection outperforming conventional methods on real hardware.", "motivation": "Frenkel excitons important for photochemistry but underexplored on quantum computers. NISQ noise requires tailored mitigation beyond standard post-selection.", "highlights": [ "Variational deflation for excitons", "DL-based NISQ mitigation", "Real hardware validation" ], "keywords": [ { "label": "Frenkel excitons", "reason": "target molecular excitation model" }, { "label": "variational deflation", "reason": "eigenstate computation technique" }, { "label": "deep learning mitigation", "reason": "NISQ error correction method" }, { "label": "oscillator strength", "reason": "key optical observable" } ], "emoji": "🧬", "social_summary": "Deep learning mitigates errors in quantum Frenkel exciton simulation!", "highlights_oneliner": "DL for exciton QEC" } ] }, "2026-03-25": { "word_cloud": [ { "word": "distance", "weight": 5 }, { "word": "algorithms", "weight": 4 }, { "word": "rotation", "weight": 4 }, { "word": "gates", "weight": 4 }, { "word": "metrology", "weight": 4 }, { "word": "QPE", "weight": 5 }, { "word": "LDPC", "weight": 3 }, { "word": "magic", "weight": 3 }, { "word": "mutation", "weight": 3 }, { "word": "syndrome", "weight": 3 }, { "word": "Heisenberg", "weight": 4 }, { "word": "Trotter", "weight": 3 }, { "word": "surface", "weight": 3 }, { "word": "code", "weight": 3 }, { "word": "molecules", "weight": 4 }, { "word": "simulation", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "decoder", "weight": 3 }, { "word": "genetic", "weight": 2 }, { "word": "STAR", "weight": 3 } ], "social_highlights": "Highlights: benchmarks distance algorithms for quantum codes, introduces efficient analog rotation gates via STAR-magic mutation, develops encoded QSP for Heisenberg metrology, enables chemically accurate QPE for molecules with 10^5 qubits.", "papers": [ { "arxiv_id": "2603.22532", "title": "Distance-Finding Algorithms for Quantum Codes and Circuits", "authors": "Mark Webster, Abraham Jacob, Oscar Higgott", "arxiv_url": "https://arxiv.org/abs/2603.22532", "pdf_url": "https://arxiv.org/pdf/2603.22532", "summary": "Benchmarks exact and heuristic distance-finding methods for classical/quantum codes and syndrome-extraction circuits, highlighting challenges for quantum LDPC codes and circuit distances. Develops and optimizes the QDistEvol genetic algorithm, showing strong performance on quantum LDPC benchmarks. Releases codeDistance Python package for community use.", "motivation": "Quantum LDPC codes promise reduced overhead for fault-tolerant computation but distance calculation remains challenging with prior methods. Circuit-level error models necessitate circuit distance assessment, which is computationally harder than code distance.", "highlights": [ "QDistEvol excels on quantum LDPC", "Benchmarks 10+ distance methods", "codeDistance package released" ], "keywords": [ { "label": "QDistEvol", "reason": "Novel evolutionary algorithm for distance finding" } ], "emoji": "📚", "social_summary": "Benchmarked distance algorithms and released QDistEvol for quantum LDPC codes.", "highlights_oneliner": "Quantum code distance benchmarks" }, { "arxiv_id": "2603.22891", "title": "STAR-Magic Mutation: Even More Efficient Analog Rotation Gates for Early Fault-Tolerant Quantum Computer", "authors": "Riki Toshio, Shota Kanasugi, Jun Fujisaki, Hirotaka Oshima, Shintaro Sato, Keisuke Fujii", "arxiv_url": "https://arxiv.org/abs/2603.22891", "pdf_url": "https://arxiv.org/pdf/2603.22891", "summary": "Introduces STAR-magic mutation protocol combining transversal multi-rotation and magic state cultivation for logical rotation gates with error scaling $\\mathcal{O}(\\theta_L^{2(1-\\Theta(1/d))}p_{\\text{ph}})$ using one surface code patch. Proposes STAR ver. 3 architecture with Clifford+$T$+$\\phi$ gates, enabling simulation of biologically-relevant molecules with $\\sim10^5$ qubits at $p_{\\text{ph}}=10^{-3}$. Achieves 100x reduction in time/error for small-angle rotations vs. standard $T$-gate synthesis.", "motivation": "Non-Clifford gates like $T$-gates incur high overhead in FTQC via magic state distillation, limiting early fault-tolerant devices. Efficient small-angle rotations are crucial for Trotterized simulations of quantum many-body systems.", "highlights": [ "$\\mathcal{O}(\\theta_L^{2(1-\\Theta(1/d))}p_{\\text{ph}})$ scaling", "STAR ver. 3 simulates molecules", "100x better for $\\theta_L\\lesssim10^{-5}$" ], "keywords": [ { "label": "STAR-magic", "reason": "Efficient protocol for analog rotations" }, { "label": "magic mutation", "reason": "Combines state prep methods" }, { "label": "Clifford+$T$+$\\phi$", "reason": "Novel gate set architecture" }, { "label": "Trotter circuits", "reason": "Targets many-body simulation" } ], "emoji": "✨", "social_summary": "STAR-magic mutation slashes rotation gate costs for early FTQC.", "highlights_oneliner": "Efficient analog rotations" }, { "arxiv_id": "2603.22798", "title": "Encoded Quantum Signal Processing for Heisenberg-Limited Metrology", "authors": "Carlos Ortiz Marrero, Rui Jie Tang, Nathan Wiebe", "arxiv_url": "https://arxiv.org/abs/2603.22798", "pdf_url": "https://arxiv.org/pdf/2603.22798", "summary": "Introduces encoded quantum signal processing unifying QEC and QSP, using syndrome measurements as nonlinear signal primitives in repetition codes to restore Heisenberg scaling without recovery. Proves product-state sensing limited to SQL, develops 4 entangled/sequential protocols achieving Heisenberg precision with exponential error suppression in $d$. Validates via simulations under noise/inhomogeneities.", "motivation": "Entangled probes achieve Heisenberg metrology but noise destroys scaling; QEC protects but QSP manipulates signals better. Unifying them enables robust logical sensors trading noise resilience for signal sensitivity.", "highlights": [ "Syndrome post-processing restores Heisenberg", "4 protocols beat SQL via entanglement", "Exponential suppression in $d$" ], "keywords": [ { "label": "Encoded QSP", "reason": "Unifies QEC and signal processing" }, { "label": "syndrome processing", "reason": "Nonlinear signal transformation" }, { "label": "Heisenberg metrology", "reason": "Noise-robust precision scaling" }, { "label": "repetition code", "reason": "Simple encoding for sensors" } ], "emoji": "🔗", "social_summary": "Encoded QSP achieves Heisenberg metrology with error correction.", "highlights_oneliner": "QSP meets QEC for metrology" }, { "arxiv_id": "2603.22778", "title": "Enabling Chemically Accurate Quantum Phase Estimation in the Early Fault-Tolerant Regime", "authors": "Shota Kanasugi, Riki Toshio, Kazunori Maruyama, Hirotaka Oshima", "arxiv_url": "https://arxiv.org/abs/2603.22778", "pdf_url": "https://arxiv.org/pdf/2603.22778", "summary": "Develops single-ancilla Trotter-QPE with unitary weight concentration to reduce LCU costs for early-FTQC, targeting active-space models of Fe-S clusters, P450, CO2 catalysts. Estimates ground states for 20-50 orbital spaces beyond classical FCI using $\\sim10^5$ qubits on STAR architecture in days-weeks.", "motivation": "Classical methods like FCI limited to $\\sim$20-in-20 orbitals for strongly correlated molecules; QPE on FTQC promises chemical accuracy but requires millions of qubits in standard estimates. Early-FTQC with partial fault tolerance makes chemically relevant simulations feasible.", "highlights": [ "20-50 orbital active spaces", "$\\sim10^5$ qubits, days-weeks runtime", "Unitary weight concentration cuts cost" ], "keywords": [ { "label": "unitary concentration", "reason": "Hamiltonian optimization technique" }, { "label": "Trotter-QPE", "reason": "Single-ancilla phase estimation" }, { "label": "active-space", "reason": "Targets molecular simulations" }, { "label": "STAR architecture", "reason": "Early-FTQC platform" } ], "emoji": "⚛️", "social_summary": "Chemically accurate QPE for molecules with 100k qubits.", "highlights_oneliner": "Early-FTQC molecular QPE" } ] }, "2026-03-24": { "word_cloud": [ { "word": "decoding", "weight": 5 }, { "word": "surface", "weight": 4 }, { "word": "color", "weight": 3 }, { "word": "GKP", "weight": 4 }, { "word": "GNN", "weight": 3 }, { "word": "neural", "weight": 5 }, { "word": "FCC", "weight": 4 }, { "word": "CSS", "weight": 3 }, { "word": "autonomous", "weight": 3 }, { "word": "fluxonium", "weight": 3 }, { "word": "qLDPC", "weight": 4 }, { "word": "magic", "weight": 3 }, { "word": "Wigner", "weight": 3 }, { "word": "erasure", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "latency", "weight": 3 }, { "word": "bosonic", "weight": 3 }, { "word": "toric", "weight": 4 }, { "word": "stabilizer", "weight": 3 } ], "social_highlights": "Highlights: NP-hard decoding proofs, all-optical GKP memory, low-latency GNN decoders, high-rate FCC codes, neural BP for toric codes.", "papers": [ { "arxiv_id": "2603.22064", "title": "The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding", "authors": "Shouzhen Gu, Lily Wang, Aleksander Kubica", "arxiv_url": "https://arxiv.org/abs/2603.22064", "pdf_url": "https://arxiv.org/pdf/2603.22064", "summary": "Proves minimum-weight decoding is NP-hard for color code with $Z$ errors, surface code with $X,Y,Z$ errors, and surface code with transversal CNOT and $Z$, bit-flip errors. Demonstrates computational intractability in basic decoding problems for quantum memories and logical circuits. Highlights separation between exact and approximate decoding.", "motivation": "Efficient decoding is crucial for scalable fault-tolerant quantum computing to avoid classical processing bottlenecks. Establishes fundamental complexity limits for key stabilizer codes on common lattices.", "highlights": [ "NP-hard for color code $Z$ decoding", "NP-hard for surface code $XYZ$ decoding", "NP-hard for transversal CNOT decoding" ], "keywords": [ { "label": "NP-hardness", "reason": "Proves computational complexity of minimum-weight decoding" }, { "label": "color code", "reason": "First hardness result for hexagonal lattice $Z$ errors" }, { "label": "transversal CNOT", "reason": "Hardness in logical circuit decoding scenario" }, { "label": "surface code", "reason": "Extends hardness to phenomenological noise" } ], "emoji": "📚", "social_summary": "Proves minimum-weight decoding NP-hard for color and surface codes.", "highlights_oneliner": "NP-hard decoding proofs" }, { "arxiv_id": "2603.20369", "title": "Error-Correction Transitions in Finite-Depth Quantum Channels", "authors": "Arman Sauliere, Guglielmo Lami, Pedro Ribeiro, Andrea De Luca, Jacopo De Nardis", "arxiv_url": "https://arxiv.org/abs/2603.20369", "pdf_url": "https://arxiv.org/pdf/2603.20369", "summary": "Analyzes error correction in 1D random noisy quantum circuits using coherent information, revealing random matrix theory-governed phase transition at critical noise rate. Characterizes finite-depth deviations from universality, distinguishing post-encoding vs. encoding noise. Shows circuit fidelity replaces Hashing bound for noisy encoders.", "motivation": "Understanding phase transitions in noisy quantum channels is key to designing scalable error-correcting encoders. Reveals universal vs. finite-size behaviors for practical circuit depths.", "highlights": [ "Critical noise phase transition", "Finite-depth RMT deviations", "Polynomial perfect encoding" ], "keywords": [ { "label": "phase transition", "reason": "Universal error correction transition via RMT" }, { "label": "random circuits", "reason": "1D noisy circuits model encoding noise" }, { "label": "coherent information", "reason": "Metric revealing error-correcting phase" } ], "emoji": "⚡", "social_summary": "Discovers phase transitions in noisy quantum error-correcting circuits.", "highlights_oneliner": "Error-correction phase transitions" }, { "arxiv_id": "2603.21721", "title": "All-optical quantum memory using bosonic quantum error correction codes", "authors": "Kaustav Chatterjee, Niklas Budinger, Kian Latifi Yaghin, Lucas Borg Clausen, Ulrik Lund Andersen", "arxiv_url": "https://arxiv.org/abs/2603.21721", "pdf_url": "https://arxiv.org/pdf/2603.21721", "summary": "Presents GKP-encoded all-optical memory in fibre loop with teleportation-based correction, modeling multi-round channel via logical Bloch vector maps. Optimizes syndrome decoder for finite squeezing, finding optimal correction spacing independent of storage time. Identifies $6.7$ dB squeezing threshold for viable correction.", "motivation": "Photon loss limits optical quantum memories essential for networks; bosonic codes enable all-optical fault-tolerant storage. Provides design rules for practical photonic implementations.", "highlights": [ "$6.7$ dB squeezing threshold", "Optimal segment independent of time", "17 dB yields 400 ms storage" ], "keywords": [ { "label": "GKP code", "reason": "Core bosonic encoding for photonic memory" }, { "label": "finite squeezing", "reason": "Optimized decoder for realistic resources" }, { "label": "fibre loop", "reason": "All-optical architecture design" } ], "emoji": "🌐", "social_summary": "Designs all-optical GKP quantum memory lasting 400 ms.", "highlights_oneliner": "All-optical GKP memory" }, { "arxiv_id": "2603.22149", "title": "Low Latency GNN Accelerator for Quantum Error Correction", "authors": "Alessio Cicero, Luigi Altamura, Moritz Lange, Mats Granath, Pedro Trancoso", "arxiv_url": "https://arxiv.org/abs/2603.22149", "pdf_url": "https://arxiv.org/pdf/2603.22149", "summary": "Proposes FPGA accelerator for GNN-based surface code decoder achieving $<1\\mu$s latency for $d=7$ with lower error than MWPM. Applies hardware-aware optimizations like pruning and quantization. Demonstrates 13% error suppression advantage.", "motivation": "Superconducting qubits demand $\\mu$s-scale decoding; neural decoders promise accuracy but need hardware acceleration. Enables real-time QEC for fault-tolerant computing.", "highlights": [ "$<1\\mu$s$ for $d=7$", "13% better than MWPM", "$1.47\\times10^{-5}$ logical error" ], "keywords": [ { "label": "GNN decoder", "reason": "Neural network for surface code decoding" }, { "label": "FPGA accelerator", "reason": "Low-latency hardware implementation" }, { "label": "surface code", "reason": "Targets $d\\leq7$ superconducting QEC" } ], "emoji": "🚀", "social_summary": "Builds sub-microsecond GNN decoder for surface codes.", "highlights_oneliner": "Low-latency GNN accelerator" }, { "arxiv_id": "2603.21730", "title": "Neural Belief-Matching Decoding for Topological Quantum Error Correction Codes", "authors": "Luca Menti, Francisco Lázaro", "arxiv_url": "https://arxiv.org/abs/2603.21730", "pdf_url": "https://arxiv.org/pdf/2603.21730", "summary": "Introduces neural BP decoder replacing traditional BP in belief-matching, reducing MWPM calls by $10^4$ for large $d$. Uses convolutional architecture for weight-sharing, enabling transfer from small to large toric codes. Maintains logical error rates.", "motivation": "Toric codes' girth-4 cycles degrade BP; hybrid BP+MWPM is complex. Neural methods scale decoding for real-time fault-tolerant computing.", "highlights": [ "$10^4\\times$ fewer MWPM calls", "Convolutional transfer learning", "No performance loss scaling" ], "keywords": [ { "label": "neural BP", "reason": "Improves belief propagation for topological codes" }, { "label": "toric code", "reason": "Targets girth-4 cycle challenges" }, { "label": "belief-matching", "reason": "Hybrid decoder framework enhanced" } ], "emoji": "🧭", "social_summary": "Neural decoder slashes toric code complexity $10^4$-fold.", "highlights_oneliner": "Neural toric decoding" }, { "arxiv_id": "2603.21598", "title": "Systematic construction of digital autonomous quantum error correction for state preparation and error suppression via conditional Gaussian operations", "authors": "Keitaro Anai, Suguru Endo, Shuntaro Takeda, Tomohiro Shitara", "arxiv_url": "https://arxiv.org/abs/2603.21598", "pdf_url": "https://arxiv.org/pdf/2603.21598", "summary": "Proposes nullifier-based digital autonomous QEC via Trotterized conditional Gaussian operations for non-Gaussian state preparation and dephasing suppression. Provides gate decompositions and evaluates under photon loss, qubit decoherence. Clarifies resource trade-offs.", "motivation": "Autonomous QEC eliminates measurement-feedback overhead in CV computing. Enables scalable preparation of universal resource states.", "highlights": [ "Cubic phase preparation", "Dephasing suppression cats", "Conditional Gaussian ops" ], "keywords": [ { "label": "autonomous QEC", "reason": "Dissipative without syndrome measurement" }, { "label": "conditional Gaussian", "reason": "Implements digital nullifier jumps" }, { "label": "cubic phase state", "reason": "Non-Gaussian universal resource" } ], "emoji": "⚙", "social_summary": "Enables autonomous CV state preparation via Gaussians.", "highlights_oneliner": "Digital autonomous CV-QEC" }, { "arxiv_id": "2603.20792", "title": "A Phase-Space Geometric Measure of Magic in Qubit Systems", "authors": "Soumyojyoti Dutta, Tushar", "arxiv_url": "https://arxiv.org/abs/2603.20792", "pdf_url": "https://arxiv.org/pdf/2603.20792", "summary": "Introduces $C(\\rho)$, $l_1$ distance of discrete Wigner to stabilizer hull, relates to stabilizer extent via tightness $\\kappa$. Proves fault-tolerant via repetition code Paulis; shows hemispheric superadditivity failure. Establishes $\\Gamma \\geq 1 + C/M_n$.", "motivation": "Magic quantification subtle in qubits due to Wigner negativity in stabilizers. Links phase-space geometry to fault-tolerant resource theory.", "highlights": [ "Fault-tolerant $C(\\rho)$", "Integer $\\kappa$ code families", "Hemispheric dichotomy" ], "keywords": [ { "label": "Wigner negativity", "reason": "Geometric magic measure $C(\\rho)$" }, { "label": "stabilizer extent", "reason": "Tightness ratio $\\kappa$ relation" }, { "label": "repetition code", "reason": "Logical Pauli fault-tolerance" } ], "emoji": "✨", "social_summary": "New geometric magic measure links to error correction.", "highlights_oneliner": "Phase-space magic measure" }, { "arxiv_id": "2603.20294", "title": "A 67%-Rate CSS Code on the FCC Lattice: [[192,130,3]] from Weight-12 Stabilizers", "authors": "Raghu Kulkarni", "arxiv_url": "https://arxiv.org/abs/2603.20294", "pdf_url": "https://arxiv.org/pdf/2603.20294", "summary": "Constructs 3D CSS code on FCC lattice with $k=2L^3+2$ logicals, 67% rate at $L=4$ ($[[192,130,3]]$). Proves $d=3$ exactly; provides MWPM decoder with 10x gain at $p=0.001$. High rate from edge surplus over constraints.", "motivation": "Surface/toric codes have low rates; dense lattices enable high-rate 3D codes for neutral atoms/photonics. Advances hardware-efficient FTQC.", "highlights": [ "$[[192,130,3]]$ 67% rate", "$d=3$ exact proof", "10x coding gain" ], "keywords": [ { "label": "FCC lattice", "reason": "Dense 3D geometry for qubits" }, { "label": "CSS code", "reason": "Weight-12 uniform stabilizers" }, { "label": "high rate", "reason": "$2/3$ asymptotic encoding" } ], "emoji": "🧭", "social_summary": "67% rate CSS code on FCC lattice beats toric 24x.", "highlights_oneliner": "High-rate FCC code" }, { "arxiv_id": "2603.21631", "title": "Neural network approach to mitigating intra-gate crosstalk in superconducting CZ gates", "authors": "Yiming Yu, Yexiong Zeng, Ye-Hong Chen, Franco Nori, Yan Xia", "arxiv_url": "https://arxiv.org/abs/2603.21631", "pdf_url": "https://arxiv.org/pdf/2603.21631", "summary": "Proposes physics-guided neural control generating robust pulses for transmon CZ gates mitigating crosstalk. Combines hardware parameterization, Hamiltonian objectives for smooth pulses. Outperforms Krotov in fidelity, worst-case under perturbations.", "motivation": "Crosstalk limits multi-qubit gates in superconducting QC; scalable pulse optimization needed. Enables robust near-term devices.", "highlights": [ "Superior CZ fidelity", "Smooth robust pulses", "Worst-case gains" ], "keywords": [ { "label": "crosstalk mitigation", "reason": "Targets intra-gate superconducting noise" }, { "label": "PGNC framework", "reason": "Physics-guided neural control" }, { "label": "transmon CZ", "reason": "Two-qubit gate optimization" } ], "emoji": "🔋", "social_summary": "Neural pulses crush crosstalk in superconducting CZ gates.", "highlights_oneliner": "Crosstalk-mitigating neural control" }, { "arxiv_id": "2603.21499", "title": "Optimal Compilation of Syndrome Extraction Circuits for General Quantum LDPC Codes", "authors": "Kai Zhang, Dingchao Gao, Zhaohui Yang, Runshi Zhou, Fangming Liu, Zhengfeng Ji, Jianxin Chen", "arxiv_url": "https://arxiv.org/abs/2603.21499", "pdf_url": "https://arxiv.org/pdf/2603.21499", "summary": "Introduces Auto-Stabilizer-Check compiler generating depth-optimal syndrome circuits for arbitrary qLDPC via SMT solver. Certifies no depth-6 BB codes; reduces depth 50%, logical errors 7-8x vs. ASAP. Bridges code design to hardware.", "motivation": "qLDPC promise high rates but lack optimal extraction circuits; manual design unscalable. Automates deployment for FTQC.", "highlights": [ "Depth-optimal qLDPC circuits", "No depth-6 BB codes", "50% depth, 8x error reduction" ], "keywords": [ { "label": "qLDPC", "reason": "Targets general low-density codes" }, { "label": "ASC compiler", "reason": "SMT-based optimal scheduling" }, { "label": "syndrome extraction", "reason": "Circuit-level optimization" } ], "emoji": "🔧", "social_summary": "Compiles optimal qLDPC syndrome circuits, slashing errors 8x.", "highlights_oneliner": "qLDPC circuit compiler" }, { "arxiv_id": "2603.21003", "title": "Proposal for erasure conversion in integer fluxonium qubits", "authors": "Jiakai Wang, Raymond A. Mencia, Vladimir E. Manucharyan, Maxim G. Vavilov", "arxiv_url": "https://arxiv.org/abs/2603.21003", "pdf_url": "https://arxiv.org/pdf/2603.21003", "summary": "Proposes erasure conversion protocols for $e$-$f$, $g$-$f$ integer fluxonium qubits using dispersive readout. Achieves erasure-dominant errors ($10^{-4}$) with high classification fidelity ($<10^{-6}$). Promises order-of-magnitude coherence gains.", "motivation": "Erasure errors boost QEC thresholds; fluxonium's structure enables them. Lowers overhead for superconducting FTQC.", "highlights": [ "Erasure rate $3\\times10^{-4}$", "Classification $<10^{-6}$ error", "$g$-$f$ coherence boost" ], "keywords": [ { "label": "integer fluxonium", "reason": "$1/f$ noise-insensitive qubits" }, { "label": "erasure conversion", "reason": "Dispersive readout protocol" }, { "label": "$e$-$f$ qubit", "reason": "Energy relaxation as erasure" } ], "emoji": "🐱", "social_summary": "Erasure conversion supercharges fluxonium qubit coherence.", "highlights_oneliner": "Fluxonium erasure qubits" } ] }, "2026-03-23": { "word_cloud": [ { "word": "SDP", "weight": 5 }, { "word": "decoders", "weight": 4 }, { "word": "coherence", "weight": 5 }, { "word": "MWPM", "weight": 4 }, { "word": "EAQECC", "weight": 4 }, { "word": "noise", "weight": 3 }, { "word": "certificates", "weight": 4 }, { "word": "DFS", "weight": 4 }, { "word": "stabilizer", "weight": 3 }, { "word": "spectroscopy", "weight": 4 }, { "word": "bounds", "weight": 3 }, { "word": "robustness", "weight": 3 }, { "word": "trapped-ion", "weight": 4 }, { "word": "ZX", "weight": 3 }, { "word": "ebits", "weight": 4 }, { "word": "superconducting", "weight": 3 }, { "word": "matchable", "weight": 3 }, { "word": "crosstalk", "weight": 3 } ], "social_highlights": "Highlights: rational SDP certificates for code bounds, systematic decoder analysis, 10+ hour ion coherence, MWPM-preserving rewrites, noisy ebit stabilizers, correlated noise spectroscopy.", "papers": [ { "arxiv_id": "2603.19901", "title": "SDP bounds on quantum codes: rational certificates", "authors": "Gerard Anglès Munné, Felix Huber", "arxiv_url": "https://arxiv.org/abs/2603.19901", "pdf_url": "https://arxiv.org/pdf/2603.19901", "summary": "Provides rational infeasibility certificates for SDP bounds on quantum codes using clustered low-rank solvers with heuristic rounding. Improves 18 upper bounds on maximum size of $n$-qubit codes for $6 \\leq n \\leq 19$. Demonstrates scalability of SDP for rigorous quantum coding bounds.", "motivation": "Floating-point SDP bounds lacked rigorous proofs due to numerical errors, limiting their use as formal non-existence results. Rational certificates enable proven upper bounds, advancing understanding of achievable quantum code parameters.", "highlights": [ "Rational SDP infeasibility certificates", "18 improved bounds for $n=6$--$19$", "Clustered low-rank solver" ], "keywords": [ { "label": "SDP bounds", "reason": "Core method for quantum code upper bounds" }, { "label": "rational certificates", "reason": "Provides rigorous proofs from numerical SDP" }, { "label": "low-rank solver", "reason": "Enables scalable computation with rounding" }, { "label": "quantum code parameters", "reason": "Targets $((n,K,\\delta))_2$ bounds" } ], "emoji": "📊", "social_summary": "Unlocks proven SDP bounds for quantum codes with rational certificates!", "highlights_oneliner": "Rigorous SDP code bounds" }, { "arxiv_id": "2603.20127", "title": "Analyzing Decoders for Quantum Error Correction", "authors": "Abtin Molavi, Feras Saad, Aws Albarghouthi", "arxiv_url": "https://arxiv.org/abs/2603.20127", "pdf_url": "https://arxiv.org/pdf/2603.20127", "summary": "Introduces formal semantics and verifier for QEC programs to quantify decoder accuracy and robustness to error rate drift. Uses structured error search and constrained polynomial optimization, outperforming Monte Carlo simulation at low error rates.", "motivation": "Monte Carlo simulation for decoder evaluation suffers high variance and sample needs. Systematic analysis enables reliable decoder comparison crucial for scalable QEC system design.", "highlights": [ "Formal QEC program semantics", "Decoder robustness quantification", "Outperforms simulation at low errors" ], "keywords": [ { "label": "decoder verification", "reason": "Systematic accuracy and robustness analysis" }, { "label": "polynomial optimization", "reason": "Core kernel for error space search" }, { "label": "Stim circuit semantics", "reason": "Formal foundation for QEC programs" }, { "label": "error rate drift", "reason": "Quantifies decoder stability" } ], "emoji": "🔍", "social_summary": "New verifier beats simulation for quantum decoder analysis!", "highlights_oneliner": "Decoder verification tool" }, { "arxiv_id": "2603.19631", "title": "Beyond-Ten-Hour Coherence in a Decoherence-Free Trapped-Ion Clock Qubit", "authors": "Jiahao Pi, Xiangjia Liu, Junle Cao, Pengfei Wang, Lingfeng Ou, Erfu Gao, Hengchao Tu, Menglin Zou, Xiang Zhang, Junhua Zhang, Kihwan Kim", "arxiv_url": "https://arxiv.org/abs/2603.19631", "pdf_url": "https://arxiv.org/pdf/2603.19631", "summary": "Achieves over ten hours coherence using clock-state qubits with DFS encoding in $^171$Yb$^+$ ion pairs sympathetically cooled by $^138$Ba$^+$. Demonstrates minimal decay over 1600s with $T_2=(3.77\\pm1.09)\\times10^4$s without magnetic shielding.", "motivation": "Trapped ions theoretically support million-year coherence but experiments limited to ~1 hour by technical noise. DFS encoding eliminates common-mode noise, unlocking fundamental coherence limits for quantum memories.", "highlights": [ ">10 hour ion coherence", "$T_2=37.7$ks demonstrated", "DFS passive error correction" ], "keywords": [ { "label": "DFS encoding", "reason": "Rejects common-mode noise in ion pairs" }, { "label": "clock qubits", "reason": "Environmental insensitivity enables long $T_2$" }, { "label": "sympathetic cooling", "reason": "Uses $^138$Ba$^+$ for $^171$Yb$^+$ pairs" }, { "label": "passive correction", "reason": "Eliminates technical noise constraints" } ], "emoji": "⏳", "social_summary": "10+ hours coherence in trapped-ion qubits using DFS encoding!", "highlights_oneliner": "Record ion coherence" }, { "arxiv_id": "2603.19522", "title": "Preserving MWPM-Decodability in Fault-Equivalent Rewrites", "authors": "Maximilian Schweikart, Linnea Grans-Samuelsson, Aleks Kissinger, Benjamin Rodatz", "pdf_url": "https://arxiv.org/pdf/2603.19522", "arxiv_url": "https://arxiv.org/abs/2603.19522", "summary": "Formalizes how ZX rewrites affect MWPM decodability in ZX diagrams with detector basis. Provides matchability-preserving rewrites for fault-tolerant syndrome extraction from phase-free ZX diagrams of matchable codes.", "motivation": "ZX circuit optimization often destroys MWPM decodability needed for efficient surface code decoding. Preserving matchability enables fault-tolerant gadget construction while maintaining decoder efficiency.", "highlights": [ "MWPM-preserving ZX rewrites", "Fault-tolerant syndrome circuits", "Matchable code extraction" ], "keywords": [ { "label": "MWPM decodability", "reason": "Efficiency property preserved by rewrites" }, { "label": "ZX rewrites", "reason": "Circuit transformations maintaining matchability" }, { "label": "detector basis", "reason": "Formalizes decoding problem changes" }, { "label": "phase-free diagrams", "reason": "Source for fault-tolerant circuits" } ], "emoji": "🔗", "social_summary": "ZX rewrites preserve MWPM decodability for fault-tolerant circuits!", "highlights_oneliner": "MWPM-preserving rewrites" }, { "arxiv_id": "2603.19597", "title": "Stabilizer Formalism for EAQECCs with Noise ebits", "authors": "Ruihu Li, Guanmin Guo, Yang Liu, Hao Song", "arxiv_url": "https://arxiv.org/abs/2603.19597", "pdf_url": "https://arxiv.org/pdf/2603.19597", "summary": "Introduces stabilizer formalism using Pauli group subgroups for EAQECCs with noisy receiver ebits, generalizing Lai-Brun schemes. Constructs EAQECCs-$\\text{Ne}$ with superior performance to optimal stabilizer codes.", "motivation": "Previous EAQECCs assumed perfect receiver ebits despite real noise reducing capabilities. New formalism handles receiver-side errors, enabling practical entanglement-assisted codes.", "highlights": [ "Noisy ebit stabilizer formalism", "Generalizes Lai-Brun schemes", "Better than optimal stabilizers" ], "keywords": [ { "label": "EAQECC-Ne", "reason": "Codes with receiver-side noise" }, { "label": "stabilizer subgroups", "reason": "Pauli group formalism for noise ebits" }, { "label": "symplectic geometry", "reason": "Equivalent formalism derivation" }, { "label": "additive codes", "reason": "Construction via code connections" } ], "emoji": "🔄", "social_summary": "Stabilizer codes handle noisy entanglement ebits effectively!", "highlights_oneliner": "Noisy ebit stabilizers" }, { "arxiv_id": "2603.19373", "title": "Assessing Spatiotemporally Correlated Noise in Superconducting Qubits via Pulse-Based Quantum Noise Spectroscopy", "authors": "Mayra Amezcua, Leigh Norris, Tom Gilliss, Ryan Sitler, James Shackford, Gregory Quiroz, Kevin Schultz", "arxiv_url": "https://arxiv.org/abs/2603.19373", "pdf_url": "https://arxiv.org/pdf/2603.19373", "summary": "Develops pulse-based QNS protocol reconstructing two-qubit cross-spectra for spatiotemporally correlated dephasing and crosstalk. Outperforms comb-based methods; validates on SWAMA-engineered noise processes.", "motivation": "QEC assumes i.i.d. noise but devices exhibit correlated errors adversarial to correction. Accurate noise spectroscopy enables noise-tailored protection crucial for realistic QECC performance.", "highlights": [ "Two-qubit cross-spectrum QNS", "Outperforms comb protocols", "SWAMA noise validation" ], "keywords": [ { "label": "quantum noise spectroscopy", "reason": "Protocol for correlated noise characterization" }, { "label": "cross-spectrum", "reason": "Reconstructs spatial correlations" }, { "label": "SWAMA", "reason": "Engineered noise benchmark" }, { "label": "quantum crosstalk", "reason": "Targets fluctuating parasitic errors" } ], "emoji": "📡", "social_summary": "Maps correlated noise in superconducting qubits with new QNS protocol!", "highlights_oneliner": "Correlated noise spectroscopy" } ] }, "2026-03-20": { "word_cloud": [ { "word": "stabilizer codes", "weight": 5 }, { "word": "belief propagation decoding", "weight": 4 }, { "word": "magic state distillation", "weight": 4 }, { "word": "surface codes", "weight": 4 }, { "word": "LDPC codes", "weight": 5 }, { "word": "logical error rates", "weight": 4 }, { "word": "fault tolerance", "weight": 5 }, { "word": "syndrome decoding", "weight": 4 }, { "word": "coherent errors", "weight": 3 }, { "word": "threshold estimation", "weight": 4 }, { "word": "GKP states", "weight": 3 }, { "word": "Tanner codes", "weight": 3 }, { "word": "bivariate bicycle codes", "weight": 4 }, { "word": "photonic quantum computing", "weight": 3 }, { "word": "correlated noise", "weight": 3 }, { "word": "post-quantum cryptography", "weight": 3 }, { "word": "cluster states", "weight": 3 }, { "word": "non-Gaussian states", "weight": 3 }, { "word": "radiation-induced errors", "weight": 3 }, { "word": "decoder optimization", "weight": 4 } ], "social_highlights": "Highlights: Coherent errors shift fault-tolerance thresholds in QEC, quantum stabilizer decoding enables post-quantum cryptography, quadratic residue codes unify magic state distillation protocols, belief propagation decoders improved via syndrome analysis, soft-output decoding outperforms standard baselines, bivariate bicycle codes achieve 12× qubit efficiency gains, GKP-embedded cluster states enable flexible optical fault tolerance, multi-outcome photonic circuits boost non-Gaussian state generation, iterative decoding mitigates radiation-induced correlated noise.", "papers": [ { "arxiv_id": "2603.18457", "title": "Simulating Quantum Error Correction beyond Pauli Stochastic Errors", "authors": "Jordan Hines, Corey Ostrove, Kenneth Rudinger, Stefan Seritan, Kevin Young, Robin Blume-Kohout, Timothy Proctor", "arxiv_url": "https://arxiv.org/abs/2603.18457", "pdf_url": "https://arxiv.org/pdf/2603.18457", "summary": "This work develops efficient classical simulation techniques for modeling coherent and non-Pauli errors in fault-tolerant quantum computing by mapping circuit-level error models to detector error models (DEM). The analysis reveals that coherent errors can shift fault-tolerance thresholds and increase logical error rates by an order of magnitude compared to equivalent stochastic Pauli errors. Applications to surface and bivariate bicycle codes demonstrate the practical impact of realistic error models on QEC performance.", "motivation": "Quantum error correction protocols are traditionally designed and validated against idealized Pauli stochastic error models, but real quantum hardware exhibits coherent and non-Pauli errors whose effects remain poorly understood. Understanding how realistic errors impact fault-tolerant quantum computing is critical for bridging the gap between theoretical QEC designs and practical implementations.", "highlights": [ "Coherent errors shift fault-tolerance thresholds and increase logical error rates by order of magnitude", "Detector error model mapping enables efficient Monte Carlo estimation of logical error rates", "Analysis of syndrome extraction for surface and bivariate bicycle codes under realistic noise" ], "keywords": [ { "label": "coherent errors", "reason": "Central focus on non-Pauli coherent error modeling and their impact on QEC thresholds" }, { "label": "detector error models", "reason": "Key technical contribution mapping Markovian circuit-level errors to DEM for FTQC analysis" }, { "label": "surface codes", "reason": "Primary application domain for evaluating realistic error effects on logical performance" }, { "label": "magic state cultivation", "reason": "Analyzed process showing increased space-time cost under coherent error conditions" } ], "emoji": "⚡", "social_summary": "Model coherent and non-Pauli errors in quantum computers to reveal how realistic noise shifts fault-tolerance thresholds.", "highlights_oneliner": "Coherent errors shift QEC thresholds dramatically" }, { "arxiv_id": "2603.19110", "title": "Post-Quantum Cryptography from Quantum Stabilizer Decoding", "authors": "Jonathan Z. Lu, Alexander Poremba, Yihui Quek, Akshar Ramkumar", "arxiv_url": "https://arxiv.org/abs/2603.19110", "pdf_url": "https://arxiv.org/pdf/2603.19110", "summary": "This work establishes quantum stabilizer decoding as a new post-quantum cryptographic hardness assumption, proving that average-case hardness implies core primitives including public-key encryption and oblivious transfer. The authors develop practical constructions achieving efficiency comparable to LPN-based schemes and provide evidence that stabilizer decoding constitutes a genuinely new assumption distinct from LPN.", "motivation": "Current post-quantum cryptography relies on a limited set of hardness assumptions, creating vulnerability if any single assumption is compromised. Identifying new quantum-native hardness assumptions with cryptographic versatility is essential for diversifying the post-quantum cryptographic landscape.", "highlights": [ "Quantum stabilizer decoding implies public-key encryption and oblivious transfer primitives", "Practical PKE scheme achieves LPN-equivalent efficiency with round-optimal OT", "Evidence that stabilizer decoding does not reduce to LPN, establishing new assumption" ], "keywords": [ { "label": "quantum stabilizer codes", "reason": "Core object enabling new post-quantum cryptographic hardness assumption" }, { "label": "post-quantum cryptography", "reason": "Primary application domain for establishing cryptographic primitives from stabilizer decoding" }, { "label": "symplectic algebraic structure", "reason": "Key mathematical structure distinguishing stabilizer decoding from classical LPN" }, { "label": "oblivious transfer", "reason": "Cryptographic primitive constructed from stabilizer decoding hardness" } ], "emoji": "🔐", "social_summary": "Quantum stabilizer decoding enables new post-quantum cryptography with practical efficiency and genuine hardness.", "highlights_oneliner": "Quantum stabilizer decoding for post-quantum cryptography" }, { "arxiv_id": "2603.18560", "title": "High-threshold magic state distillation with quantum quadratic residue codes", "authors": "Michael Zurel, Santanil Jana, Nadish de Silva", "arxiv_url": "https://arxiv.org/abs/2603.18560", "pdf_url": "https://arxiv.org/pdf/2603.18560", "summary": "This work unifies existing and new magic state distillation protocols under the framework of quantum quadratic residue codes, showing that codes like the $[[5,1,3]]$ perfect code, $[[7,1,3]]$ Steane code, and Golay codes are equivalent to specific QR codes. The authors prove infinitely many quantum QR codes distill $T$ states with non-trivial thresholds and identify new codes achieving high thresholds for qubit $T$ states and qutrit Strange states.", "motivation": "Magic state distillation is essential for universal fault-tolerant quantum computation, but identifying codes with high distillation thresholds requires understanding the relationship between code parameters and distillation performance. Unifying diverse distillation protocols under a single algebraic framework enables systematic exploration of new codes.", "highlights": [ "Quantum quadratic residue codes unify magic state distillation for qubits and qutrits", "Infinitely many QR codes distill $T$ states with non-trivial thresholds", "Highest known thresholds for $T$ and Strange state distillation achieved via QR code family" ], "keywords": [ { "label": "quantum quadratic residue codes", "reason": "Unified algebraic framework for magic state distillation protocols" }, { "label": "magic state distillation", "reason": "Primary application enabling universal fault-tolerant quantum computation" }, { "label": "T-state distillation", "reason": "Key resource for implementing non-Clifford gates in fault-tolerant architectures" }, { "label": "Golay codes", "reason": "Specific code family achieving highest known distillation thresholds" } ], "emoji": "✨", "social_summary": "Quantum quadratic residue codes unify magic state distillation with highest known thresholds for universal quantum computation.", "highlights_oneliner": "QR codes unify magic state distillation" }, { "arxiv_id": "2603.19126", "title": "Low-weight quantum syndrome errors in belief propagation decoding", "authors": "Haggai Landa", "arxiv_url": "https://arxiv.org/abs/2603.19126", "pdf_url": "https://arxiv.org/pdf/2603.19126", "summary": "This work identifies low-weight error syndrome combinations that cause slow belief-propagation convergence in quantum LDPC codes, characterizing problematic Tanner subgraphs through empirical analysis. The author proposes decoder amendments by adding relevant fault columns to the decoding matrix, demonstrating reduction in both logical errors and decoding time.", "motivation": "Belief propagation decoding is a practical approach for quantum LDPC codes, but convergence failures on certain error patterns limit performance. Understanding and mitigating these failure modes is essential for achieving reliable decoding in scalable quantum error correction.", "highlights": [ "Identified low-weight syndrome error patterns causing slow BP convergence", "Characterized Tanner subgraph criteria for problematic error syndromes", "Decoder amendment strategy reduces logical errors and decoding time simultaneously" ], "keywords": [ { "label": "belief propagation decoding", "reason": "Primary decoding algorithm analyzed for convergence failures" }, { "label": "LDPC codes", "reason": "Code family exhibiting convergence issues under specific error patterns" }, { "label": "Tanner graphs", "reason": "Graph structure characterizing problematic syndrome patterns" }, { "label": "syndrome decoding", "reason": "Decoding framework where low-weight syndromes cause convergence slowdown" } ], "emoji": "📊", "social_summary": "Identify and fix belief propagation decoder failures on low-weight quantum error syndromes.", "highlights_oneliner": "BP decoder convergence failures on low-weight syndromes" }, { "arxiv_id": "2603.18318", "title": "Efficient Soft-Output Guessing for Enhanced Quantum Tanner Code Decoding", "authors": "Lukas Rapp, Muriel Médart, Eugene Tang, Ken R. Duffy", "arxiv_url": "https://arxiv.org/abs/2603.18318", "pdf_url": "https://arxiv.org/pdf/2603.18318", "summary": "This work introduces soft-output guessing random additive noise decoding (SOGRAND) for quantum Tanner codes, achieving up to three orders of magnitude improvement in logical error rate over standard belief propagation plus ordered statistic decoding. The approach mitigates trapping sets and cycles through soft-output decoding of component codes.", "motivation": "Quantum Tanner codes represent an emerging class of LDPC codes with favorable scaling properties, but their decoding remains challenging due to trapping sets and cycles. Developing efficient decoding algorithms is critical for realizing the practical advantages of Tanner codes.", "highlights": [ "SOGRAND achieves three orders of magnitude improvement over BP+OSD baseline", "Soft-output decoding mitigates trapping sets and cycles in Tanner codes", "Scalable decoding framework enabling practical deployment of Tanner-code-based quantum codes" ], "keywords": [ { "label": "Tanner codes", "reason": "Emerging quantum LDPC code family requiring efficient decoding" }, { "label": "soft-output decoding", "reason": "Key technique enabling three-order-of-magnitude improvement in logical error rates" }, { "label": "trapping sets", "reason": "Decoder failure mode mitigated by SOGRAND approach" }, { "label": "ordered statistic decoding", "reason": "Post-processing technique combined with SOGRAND for enhanced performance" } ], "emoji": "🎯", "social_summary": "Soft-output decoding boosts quantum Tanner code performance by three orders of magnitude.", "highlights_oneliner": "SOGRAND decoding for Tanner codes" }, { "arxiv_id": "2603.19062", "title": "Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel", "authors": "Tushar Pandey", "arxiv_url": "https://arxiv.org/abs/2603.19062", "pdf_url": "https://arxiv.org/pdf/2603.19062", "summary": "This work establishes fair decoder baselines and rigorous finite-size scaling analysis for bivariate bicycle codes on the quantum erasure channel, demonstrating that uninformed minimum-weight perfect matching performs at random-guessing level. Using erasure-aware MWPM baselines and finite-size scaling, the author extrapolates asymptotic threshold $p_\\infty^* \\approx 0.488$ and shows bivariate bicycle codes achieve $12\\times$ lower normalized overhead than surface codes.", "motivation": "Quantum LDPC codes like bivariate bicycle codes promise improved scaling, but fair threshold comparisons require careful decoder selection and rigorous finite-size analysis. Previous work conflated pseudo-thresholds with asymptotic thresholds and used unfair baselines, obscuring true code advantages.", "highlights": [ "Uninformed MWPM on erasure channel matches random guessing, invalidating prior comparisons", "Asymptotic threshold $p_\\infty^* \\approx 0.488$ via finite-size scaling within 2.4% of zero-rate limit", "Bivariate bicycle codes achieve 12× lower normalized overhead than surface codes at comparable threshold" ], "keywords": [ { "label": "bivariate bicycle codes", "reason": "LDPC code family achieving high thresholds with constant overhead" }, { "label": "quantum erasure channel", "reason": "Benchmark noise model where erasure locations are known" }, { "label": "finite-size scaling", "reason": "Rigorous methodology for extrapolating asymptotic thresholds from finite simulations" }, { "label": "decoder fairness", "reason": "Critical methodological issue ensuring unbiased code comparisons" } ], "emoji": "⚖️", "social_summary": "Fair threshold analysis reveals bivariate bicycle codes achieve 12× qubit efficiency over surface codes.", "highlights_oneliner": "Fair thresholds for bivariate bicycle codes" }, { "arxiv_id": "2603.18778", "title": "A Flexible GKP-State-Embedded Fault-Tolerant Quantum Computation Configuration Based on a Three-Dimensional Cluster State", "authors": "Peilin Du, Jing Zhang, Tiancai Zhang, Rongguo Yang, Kui Liu, Jiangrui Gao", "arxiv_url": "https://arxiv.org/abs/2603.18778", "pdf_url": "https://arxiv.org/pdf/2603.18778", "summary": "This work proposes a flexible fault-tolerant quantum computation architecture embedding Gottesman-Kitaev-Preskill states in three-dimensional cluster states constructed across polarization, frequency, and orbital angular momentum domains. The authors design optical entanglement generators and present a partially squeezed surface-GKP code achieving fault-tolerant squeezing threshold of $11.5$ dB.", "motivation": "Optical quantum computing offers room-temperature operation and low decoherence, but requires integration of diverse quantum resources for universal fault-tolerant computation. Exploiting multiple degrees of freedom in photonic systems provides operational flexibility and scalability.", "highlights": [ "Three-dimensional cluster state across polarization, frequency, and OAM domains", "Partially squeezed surface-GKP code with fault-tolerant squeezing threshold of 11.5 dB", "Flexible, scalable, and experimentally feasible optical fault-tolerance architecture" ], "keywords": [ { "label": "GKP states", "reason": "Continuous-variable quantum resource enabling fault-tolerant optical computation" }, { "label": "cluster states", "reason": "Three-dimensional entangled resource across multiple photonic degrees of freedom" }, { "label": "optical quantum computing", "reason": "Platform exploiting polarization, frequency, and orbital angular momentum" }, { "label": "squeezed states", "reason": "Resource enabling fault-tolerant gates with 11.5 dB threshold" } ], "emoji": "🔬", "social_summary": "Three-dimensional optical cluster states enable flexible fault-tolerant quantum computation with GKP codes.", "highlights_oneliner": "GKP-embedded optical cluster states" }, { "arxiv_id": "2603.18303", "title": "Multi-Outcome Circuit Optimization for Enhanced Non-Gaussian State Generation", "authors": "S. Ismailzadeh, B. Abedi Ravan", "arxiv_url": "https://arxiv.org/abs/2603.18303", "pdf_url": "https://arxiv.org/pdf/2603.18303", "summary": "This work develops a multi-outcome optimization framework for photonic quantum state generation, enabling single circuits to produce useful quantum states across multiple measurement patterns. Applications to Gottesman-Kitaev-Preskill states, Schrödinger cat states, binomial codes, and cubic phase states demonstrate success probability enhancement through resource multiplexing and probability harvesting.", "motivation": "Non-Gaussian quantum states are essential for fault-tolerant continuous-variable quantum computation, but their probabilistic generation via photon-number-resolving detection suffers from low success rates. Conventional optimization targets single measurement outcomes, discarding potentially useful alternative patterns.", "highlights": [ "Multi-outcome optimization increases overall acceptance probability for non-Gaussian state generation", "Resource multiplexing enables single circuit to produce diverse useful quantum states", "Probability harvesting aggregates degenerate outcomes to boost single target state production" ], "keywords": [ { "label": "non-Gaussian states", "reason": "Essential resources for universal continuous-variable quantum computation" }, { "label": "GKP states", "reason": "Primary non-Gaussian resource optimized for enhanced generation probability" }, { "label": "photonic quantum computing", "reason": "Platform where non-Gaussian state generation is critical bottleneck" }, { "label": "photon-number-resolving detection", "reason": "Measurement technique enabling conditional non-Gaussian state preparation" } ], "emoji": "💡", "social_summary": "Multi-outcome circuit optimization boosts photonic non-Gaussian state generation success rates.", "highlights_oneliner": "Multi-outcome photonic state generation" }, { "arxiv_id": "2603.18231", "title": "Iterative Decoding of Stabilizer Codes under Radiation-Induced Correlated Noise", "authors": "Anuj K. Nayak, Paul G. Baity, Peter J. Love, Nicholas Jeon, Byung-Jun Yoon, Adolfy Hoisie, Lav R. Varshney", "arxiv_url": "https://arxiv.org/abs/2603.18231", "pdf_url": "https://arxiv.org/pdf/2603.18231", "summary": "This work formalizes joint noise sensing and decoding for stabilizer codes under radiation-induced correlated noise by modeling quasiparticle density as a latent variable. The authors derive an iterative expectation-maximization algorithm alternating between quasiparticle density estimation and syndrome-based decoding, demonstrating measurable logical error reduction on surface codes and bivariate bicycle codes.", "motivation": "Superconducting quantum processors face radiation-induced correlated errors from cosmic-ray muons, causing qubit-wide failures that standard decoders cannot handle. Integrating physical noise estimation into decoding is essential for mitigating correlated noise effects in practical fault-tolerant systems.", "highlights": [ "Joint noise sensing and decoding via latent variable modeling of quasiparticle density", "Iterative EM algorithm reduces logical error probability under radiation-induced correlated noise", "Inferred QP density provides diagnostic information for device characterization and shielding design" ], "keywords": [ { "label": "radiation-induced noise", "reason": "Correlated error source from cosmic-ray muons in superconducting qubits" }, { "label": "quasiparticle density", "reason": "Latent variable governing correlation in physical errors and syndrome measurements" }, { "label": "iterative decoding", "reason": "EM-based algorithm alternating between noise estimation and syndrome decoding" }, { "label": "bivariate bicycle codes", "reason": "LDPC code family evaluated under radiation-induced correlated noise" } ], "emoji": "☢️", "social_summary": "Iterative decoding mitigates radiation-induced correlated noise in superconducting quantum processors.", "highlights_oneliner": "Decoding under radiation-induced noise" } ] }, "2026-03-19": { "word_cloud": [ { "word": "Gross", "weight": 5 }, { "word": "Bicycle", "weight": 5 }, { "word": "LDPC", "weight": 4 }, { "word": "Syndrome", "weight": 4 }, { "word": "Stabilizer", "weight": 4 }, { "word": "Mapping", "weight": 3 }, { "word": "Loss", "weight": 3 }, { "word": "Graph", "weight": 3 }, { "word": "STAR", "weight": 3 }, { "word": "Trivariate", "weight": 3 }, { "word": "Binomial", "weight": 3 }, { "word": "Threshold", "weight": 4 }, { "word": "Circuit", "weight": 3 }, { "word": "Decoding", "weight": 3 }, { "word": "Compilation", "weight": 3 }, { "word": "Geometric", "weight": 2 }, { "word": "QUBO", "weight": 2 }, { "word": "Pseudothreshold", "weight": 2 }, { "word": "Erasure", "weight": 2 } ], "social_highlights": "Highlights: optimizes Gross code mapping, adaptive loss-tolerant syndromes, AI graph decimation for stabilizers, STAR compilation protocol, trivariate bicycle codes, geometric gates for binomial codes.", "papers": [ { "arxiv_id": "2603.17167", "title": "Optimizing Logical Mappings for Quantum Low-Density Parity Check Codes", "authors": "Sayam Sethi, Sahil Khan, Maxwell Poster, Abhinav Anand, Jonathan Mark Baker", "arxiv_url": "https://arxiv.org/abs/2603.17167", "pdf_url": "https://arxiv.org/pdf/2603.17167", "summary": "Introduces a two-stage pipeline using hypergraph partitioning and priority-based assignment to map logical qubits on Gross code architectures. Reduces inter-module measurement errors by up to $\\sim36\\%$ in best case and $\\sim13\\%$ on average. Enables lower program failure rates, easing hardware scalability constraints.", "motivation": "Early fault-tolerant quantum systems require low program error rates, but NISQ and existing FTQC mappers fail for Gross codes due to two-level mapping and long Pauli products. Optimizing compilation for spatially efficient codes like Gross is crucial for viable fault-tolerant applications.", "highlights": [ "36% error reduction in inter-module measurements", "13% average failure rate drop", "Supports localized factory and grid architectures" ], "keywords": [ { "label": "Gross code", "reason": "Core architecture optimized for low spatial overhead" } ], "emoji": "🗺️", "social_summary": "New mapping pipeline slashes Gross code errors by 36%, boosting fault-tolerant quantum scalability.", "highlights_oneliner": "Gross code mapping optimizer" }, { "arxiv_id": "2603.17988", "title": "Adaptive Loss-tolerant Syndrome Measurements", "authors": "Yuanjia Wang, Todd A. Brun", "arxiv_url": "https://arxiv.org/abs/2603.17988", "pdf_url": "https://arxiv.org/pdf/2603.17988", "summary": "Extends adaptive Shor-style sequences to mixed Pauli-erasure models using loss detection units. Quantifies minimal overhead via subgroup dimension for erasures in FTEC circuits on qubits and qudits. Presents protocols generalizing weak/strong FTEC conditions.", "motivation": "Qubit losses alter syndrome patterns, making standard Pauli schemes inapplicable; slow measurements demand fewer syndrome extractions. Adaptive methods reduce measurement overhead critical for fault-tolerant computation.", "highlights": [ "Erasure-to-located error conversion", "Subgroup dimension overhead bound", "Qudit stabilizer canonical sets" ], "keywords": [ { "label": "Loss-tolerant", "reason": "Addresses mixed Pauli-erasure errors" }, { "label": "Adaptive syndrome", "reason": "Optimizes measurement sequences" }, { "label": "FTEC conditions", "reason": "Generalizes weak/strong fault-tolerance" } ], "emoji": "🔄", "social_summary": "Adaptive protocols conquer qubit losses in syndrome measurements for robust error correction.", "highlights_oneliner": "Loss-adaptive syndrome protocols" }, { "arxiv_id": "2603.17743", "title": "Fast stabilizer state preparation via AI-optimized graph decimation", "authors": "Michael Doherty, Matteo Puviani, Jasmine Brewer, Gabriel Matos, David Amaro, Ben Criger, David T. Stephen", "arxiv_url": "https://arxiv.org/abs/2603.17743", "pdf_url": "https://arxiv.org/pdf/2603.17743", "summary": "Proposes graph decimation with AI (QuSynth: RL + MCTS) to synthesize stabilizer states from graph representations. Synthesizes 144-qubit Gross code with 357 two-qubit gates, 5x reduction. Cuts gates by up to 2.5x while keeping low depth.", "motivation": "Stabilizer preparation efficiency limits near-term and fault-tolerant apps; prior AI methods capped at ~20 qubits. Graph-based sequential decisions enable scalable synthesis for large QEC code states.", "highlights": [ "357 gates for 144-qubit Gross", "2.5x gate reduction", "Scales beyond 20-qubit limit" ], "keywords": [ { "label": "Graph decimation", "reason": "Core synthesis technique" }, { "label": "QuSynth", "reason": "AI method (RL+MCTS)" }, { "label": "Stabilizer preparation", "reason": "Targets QEC code states" } ], "emoji": "🤖", "social_summary": "AI slashes stabilizer prep gates 2.5x, masters 144-qubit Gross code.", "highlights_oneliner": "AI graph decimation synthesis" }, { "arxiv_id": "2603.17428", "title": "General circuit compilation protocol into partially fault-tolerant quantum computing architecture", "authors": "Tomochika Kurita", "arxiv_url": "https://arxiv.org/abs/2603.17428", "pdf_url": "https://arxiv.org/pdf/2603.17428", "summary": "Proposes protocol for STAR architecture using lattice surgery with continuous $Rz(θ)$ via resource states $|m_θ\\rangle$. Employs parallel RUS, QUBO allocation, frequent joint measurements to cut time overhead. Includes performance estimators for optimal qubit topology.", "motivation": "T-gates demand costly magic factories; discrete gates inflate circuit depth in surface code lattice surgery. STAR's analog rotations promise efficiency but need overhead reduction for early-FTQC.", "highlights": [ "QUBO for resource allocation", "Parallel RUS trials", "Topology performance estimators" ], "keywords": [ { "label": "STAR architecture", "reason": "Enables continuous $Rz(θ)$" }, { "label": "QUBO optimization", "reason": "Allocates resource states" }, { "label": "Lattice surgery", "reason": "Basis for gate execution" } ], "emoji": "⚙️", "social_summary": "Efficient STAR protocol cuts rotation overhead via QUBO and parallel trials.", "highlights_oneliner": "STAR compilation protocol" }, { "arxiv_id": "2603.17703", "title": "Independent Trivariate Bicycle Codes", "authors": "Aygul Azatovna Galimova", "arxiv_url": "https://arxiv.org/abs/2603.17703", "pdf_url": "https://arxiv.org/pdf/2603.17703", "summary": "Constructs six ITB codes from 3D tori, including $[[140,6,14]]$ with $kd^2/n=8.40$, 8.0% pseudothreshold. Self-dual weight-8 codes: $[[54,14,5]]$, $[[128,20,8]]$ ($kd^2/n=10.0$). Outperforms prior multivariate bicycles.", "motivation": "Surface codes have low rate; good qLDPC need high $k/n$, $d$, low weight, high thresholds. Trivariate extension explores third cyclic dimension for superior algebraic qLDPC.", "highlights": [ "$[[140,6,14]]$: $kd^2/n=8.40$", "8.0% code-capacity threshold", "$kd^2/n=10.0$ self-dual code" ], "keywords": [ { "label": "Trivariate bicycle", "reason": "3D code family" }, { "label": "ITB codes", "reason": "Independent constructions" }, { "label": "Pseudothreshold", "reason": "Key performance metric" } ], "emoji": "🚲", "social_summary": "Trivariate bicycle codes hit record $kd^2/n=10.0$ for qLDPC excellence.", "highlights_oneliner": "Trivariate bicycle codes" }, { "arxiv_id": "2603.17250", "title": "Noise-resilient nonadiabatic geometric quantum computation for bosonic binomial codes", "authors": "Dong-Sheng Li, Yang Xiao, Yu Wang, Yang Liu, Zhi-Cheng Shi, Ye-Hong Chen, Yi-Hao Kang, Yan Xia", "arxiv_url": "https://arxiv.org/abs/2603.17250", "pdf_url": "https://arxiv.org/pdf/2603.17250", "summary": "Proposes nonadiabatic geometric gates for binomial codes in superconducting cavity-qutrit systems. Uses reverse engineering and optimal control for noise-resilient protocol. High fidelities despite fluctuations and decoherence.", "motivation": "Binomial codes offer loss immunity; geometric phases resist noise. Combining yields practical fault-tolerant gates for current superconducting tech.", "highlights": [ "High gate fidelities", "Loss-immune binomial", "Superconducting implementation" ], "keywords": [ { "label": "Binomial codes", "reason": "Loss-resilient bosonic" }, { "label": "Nonadiabatic geometric", "reason": "Noise-robust gates" }, { "label": "Reverse engineering", "reason": "Control design method" } ], "emoji": "🔄", "social_summary": "Geometric protocol brings fault-tolerant gates to binomial codes.", "highlights_oneliner": "Geometric binomial computation" } ] }, "2026-03-18": { "word_cloud": [ { "word": "surface code", "weight": 5 }, { "word": "logical error rate", "weight": 5 }, { "word": "fault tolerance", "weight": 4 }, { "word": "decoder", "weight": 4 }, { "word": "stabilizer", "weight": 4 }, { "word": "syndrome measurement", "weight": 4 }, { "word": "crosstalk", "weight": 3 }, { "word": "superconducting qubits", "weight": 3 }, { "word": "code distance", "weight": 3 }, { "word": "physical qubits", "weight": 3 }, { "word": "gate fidelity", "weight": 3 }, { "word": "noise mitigation", "weight": 3 }, { "word": "chain complex", "weight": 2 }, { "word": "chiplet architecture", "weight": 2 }, { "word": "spin ensemble", "weight": 2 }, { "word": "radiation-induced errors", "weight": 2 }, { "word": "real-time control", "weight": 2 }, { "word": "optimal control", "weight": 2 } ], "social_highlights": "Highlights: CSS codes from Coxeter group geometry, fault-tolerant compiler for modular quantum architectures, hardware-efficient spin-N-Cat codes, distinguishing correlated error sources in superconducting qubits, sub-microsecond QEC decoding system, crosstalk-robust gate sets for scalable quantum circuits.", "papers": [ { "arxiv_id": "2603.16036", "title": "CSS codes from the Bruhat order of Coxeter groups", "authors": "Kamil Bradler", "arxiv_url": "https://arxiv.org/abs/2603.16036", "pdf_url": "https://arxiv.org/pdf/2603.16036", "summary": "This work introduces a method to generate families of CSS codes using the Bruhat order of Coxeter groups, leveraging the face poset structure of regular CW complexes to construct chain complexes that yield CSS codes with controlled stabilizer weights. The approach produces codes with diverse parameters, such as $[6006, 924, \\{\\leq14, \\leq7\\}]$ and $[571, 199, \\{5, 5\\}]$, and includes a weight-reduction procedure to handle rare heavy stabilizers. The method is applicable to both finite and infinite Coxeter groups, offering a geometrically motivated framework for QEC code design.", "motivation": "CSS codes are fundamental to quantum error correction, but systematic construction methods that balance code parameters remain limited. Leveraging algebraic topology and group theory provides a principled approach to discovering new code families with tailored properties for practical quantum computing.", "highlights": [ "CSS codes from Coxeter group Bruhat order with controlled stabilizer weights", "High-rate codes like $[6006, 924]$ and $[571, 199]$ with irregular weight distributions", "Weight-reduction procedure for managing heavy stabilizers in derived codes" ], "keywords": [ { "label": "CSS codes", "reason": "Core code family constructed from chain complexes derived from Coxeter group geometry" }, { "label": "Bruhat order", "reason": "Partial order on Coxeter group elements that provides face poset structure for code construction" }, { "label": "stabilizer weight", "reason": "Key code parameter controlled through the construction method to optimize code performance" }, { "label": "chain complex", "reason": "Algebraic topological structure underlying the conversion to CSS codes" } ], "emoji": "🔗", "social_summary": "Construct CSS quantum error correction codes using Coxeter group geometry and Bruhat order to achieve controlled stabilizer weights and high code rates.", "highlights_oneliner": "CSS codes from Coxeter group topology" }, { "arxiv_id": "2603.16389", "title": "Chipmunq: Fault-Tolerant Compiler for Chiplet Quantum Architectures", "authors": "Peter Wegmann, Aleksandra Świerkowska, Emmanouil Giortamis, Pramod Bhatotia", "arxiv_url": "https://arxiv.org/abs/2603.16389", "pdf_url": "https://arxiv.org/pdf/2603.16389", "summary": "Chipmunq is the first hardware-aware compiler for mapping and routing fault-tolerant quantum circuits onto modular chiplet architectures, employing QEC-aware partitioning that preserves logical qubit patches. The compiler achieves $13.5\\times$ speedup in compilation time, reduces circuit depth by $86.4\\%$, and decreases SWAP gate counts by $91.4\\%$ across varying code distances while improving logical error rates by up to two orders of magnitude. The approach explicitly handles heterogeneous inter-chiplet links and defective qubits, overcoming the sparse and noisy interconnects characteristic of modular quantum processors.", "motivation": "As quantum computing scales toward fault-tolerance, chiplet-based architectures offer a practical path to massive qubit counts while respecting fabrication limits. However, existing compilers cannot handle the scale and heterogeneity of fault-tolerant circuits on modular backends, creating a critical compilation gap.", "highlights": [ "$13.5\\times$ compilation speedup and $86.4\\%$ circuit depth reduction", "QEC-aware patch partitioning preserving logical qubit integrity", "Two orders of magnitude improvement in logical error rates via inter-chiplet link optimization" ], "keywords": [ { "label": "chiplet architecture", "reason": "Modular quantum processor design that Chipmunq targets for fault-tolerant circuit mapping" }, { "label": "patch-aware partitioning", "reason": "Core compilation strategy that treats logical qubit patches as first-class citizens" }, { "label": "inter-chiplet routing", "reason": "Critical optimization for managing sparse and noisy links between quantum processing units" }, { "label": "logical error rate", "reason": "Key performance metric improved through hardware-aware compilation and routing" } ], "emoji": "🏗️", "social_summary": "Compile fault-tolerant quantum circuits for modular chiplet architectures with patch-aware partitioning, achieving massive speedups and error suppression.", "highlights_oneliner": "Compiler for modular fault-tolerant quantum circuits" }, { "arxiv_id": "2603.15760", "title": "A fault-tolerant encoding for qubit-controlled collective spins", "authors": "Charlotte Franke, Dorian A. Gangloff", "arxiv_url": "https://arxiv.org/abs/2603.15760", "pdf_url": "https://arxiv.org/pdf/2603.15760", "summary": "This work introduces spin-$N$-Cat codes, which encode logical qubits in superpositions of spin-coherent states and generalize bosonic Cat codes to permutationally symmetric spin ensembles. The codes correct collective and individual dephasing, excitation, and decay errors using only first-order interactions in central-spin systems such as quantum dots. Numerical simulations demonstrate high logical fidelity under realistic noise and show that full QEC cycles are feasible, substantially extending coherence time in large collective spins.", "motivation": "Reducing hardware overhead in quantum error correction is essential for practical quantum computing. Spin systems with collective degrees of freedom offer a promising route to minimize control complexity while retaining large Hilbert spaces for fault-tolerant encoding.", "highlights": [ "Spin-$N$-Cat codes correcting collective and individual dephasing, excitation, and decay", "Universal fault-tolerant gate set using only first-order interactions", "Substantial coherence time extension in quantum dots with realistic microscopic parameters" ], "keywords": [ { "label": "spin-N-Cat codes", "reason": "Novel code family encoding logical qubits in spin-coherent state superpositions" }, { "label": "collective spins", "reason": "Physical platform offering large Hilbert space and reduced control complexity for QEC" }, { "label": "first-order interactions", "reason": "Efficient implementation mechanism enabling practical realization in quantum dots" }, { "label": "bias-preserving gates", "reason": "Fault-tolerant gate set tailored to noise structure of spin systems" } ], "emoji": "🐱", "social_summary": "Encode quantum information in spin-coherent states using spin-N-Cat codes for hardware-efficient error correction with first-order interactions.", "highlights_oneliner": "Hardware-efficient codes for collective spins" }, { "arxiv_id": "2603.16494", "title": "Distinguishing types of correlated errors in superconducting qubits", "authors": "Hannah P. Binney, H. Douglas Pinckney, Kate Azar, Patrick M. Harrington, Shantanu Jha, Mingyu Li, Jiatong Yang, Felipe Contipelli, Renée DePencier Piñero, Michael Gingras, Bethany M. Niedzielski, Hannah Stickler, Mollie E. Schwartz, Jeffrey A. Grover, Max Hays, Kyle Serniak, Joseph A. Formaggio, William D. Oliver", "arxiv_url": "https://arxiv.org/abs/2603.16494", "pdf_url": "https://arxiv.org/pdf/2603.16494", "summary": "This work presents a method to distinguish radiation-induced and vibration-induced correlated errors in superconducting qubits by analyzing their temporal, spatial, and frequency domain features. Radiation-induced errors exhibit sharp rise times and short exponential decay lifetimes, while pulse-tube vibrations produce longer rise and decay times with characteristic frequency signatures. The study demonstrates that devices with superconducting gap greater than qubit energy are protected against both radiation and vibration-induced errors, enabling physically motivated error-mitigation strategies.", "motivation": "Correlated errors in superconducting qubits pose fundamental challenges to quantum error correction codes, which assume uncorrelated error models. Understanding and distinguishing error sources is critical for developing targeted mitigation strategies and improving qubit coherence.", "highlights": [ "Temporal and frequency domain signatures distinguish radiation from vibration-induced errors", "Devices with gap $>$ qubit energy protected against both error types", "Accelerometer data correlate dilution refrigerator vibrations with qubit errors" ], "keywords": [ { "label": "radiation-induced errors", "reason": "Correlated error mechanism from cosmic and terrestrial radiation creating quasiparticles" }, { "label": "vibration-induced errors", "reason": "Correlated errors from pulse tube cryocooler vibrations affecting multiple qubits" }, { "label": "error characterization", "reason": "Method for distinguishing error sources via temporal, spatial, and frequency analysis" }, { "label": "superconducting gap engineering", "reason": "Hardware design parameter protecting qubits against multiple correlated error sources" } ], "emoji": "⚡", "social_summary": "Distinguish radiation and vibration-induced correlated errors in superconducting qubits using temporal and frequency signatures for targeted mitigation.", "highlights_oneliner": "Characterizing correlated errors in superconducting qubits" }, { "arxiv_id": "2603.16203", "title": "A Scalable Open-Source QEC System with Sub-Microsecond Decoding-Feedback Latency", "authors": "Junyi Liu, Yi Lee, Yilun Xu, Gang Huang, Xiaodi Wu", "arxiv_url": "https://arxiv.org/abs/2603.16203", "pdf_url": "https://arxiv.org/pdf/2603.16203", "summary": "This work presents an open-source, fully integrated QEC system built on RISC-Q that achieves end-to-end decoding-feedback latency of $446$ ns for distance-$3$ surface codes on RFSoC FPGAs. The system integrates real-time qubit control, scalable distributed multi-board architecture, and state-of-the-art hardware decoders within a low-latency pipeline. Extrapolation from measured subsystem performance indicates sub-microsecond latency is achievable up to distance-$21$ surface codes ($\\sim 881$ physical qubits).", "motivation": "Practical QEC implementation requires not only efficient decoder design but also integrated real-time control, communication, and decoding with minimal latency. Current systems lack open-source, scalable platforms that address all subsystems simultaneously.", "highlights": [ "$446$ ns end-to-end decoding-feedback latency for distance-$3$ surface code", "Scalable to distance-$21$ with sub-microsecond latency ($\\sim 881$ physical qubits)", "Fully integrated system on RFSoC FPGAs with syndrome aggregation and error distribution" ], "keywords": [ { "label": "decoding-feedback latency", "reason": "Critical performance metric measuring time from syndrome measurement to error correction feedback" }, { "label": "RFSoC FPGA", "reason": "Hardware platform enabling real-time control and low-latency decoding integration" }, { "label": "distributed architecture", "reason": "Multi-board system design for scalable QEC implementation with fiber network communication" }, { "label": "Helios decoder", "reason": "State-of-the-art hardware decoder integrated into the QEC system pipeline" } ], "emoji": "📡", "social_summary": "Build a scalable QEC system achieving sub-microsecond decoding latency on FPGAs, integrating real-time control and distributed syndrome processing.", "highlights_oneliner": "Sub-microsecond QEC decoding system on FPGAs" }, { "arxiv_id": "2603.15758", "title": "Quantum Noise Suppression at Scale with Crosstalk-Robust Gate Sets", "authors": "Andy J. Goldschmidt, Emilio Peláez Cisneros, Ryan Sitler, Kevin Olsson, Kaitlin N. Smith, Gregory Quiroz", "arxiv_url": "https://arxiv.org/abs/2603.15758", "pdf_url": "https://arxiv.org/pdf/2603.15758", "summary": "This work introduces crosstalk-robust gate sets obtained via a scalable optimal control problem exploiting locality, suppressing pairwise quantum crosstalk to enable robustness in multi-qubit circuits. Testing on IBM Quantum Platform devices demonstrates $4\\times$ median algorithmic performance improvement for Hamiltonian simulation over baseline Gaussian gates. The approach provides numerical evidence that optimized gate sets enable larger qubit-qubit coupling strengths, reducing two-qubit gate times by half.", "motivation": "As quantum processors scale, correlated noise and quantum crosstalk become dominant obstacles to scalability across all qubit modalities. Hardware-software co-design using quantum optimal control offers a practical path to suppress crosstalk without excessive hardware overhead.", "highlights": [ "$4\\times$ median algorithmic performance improvement via noise-informed gates", "Crosstalk suppression extends from pairwise to multi-qubit circuit robustness", "Two-qubit gate times reduced by half through optimized coupling strengths" ], "keywords": [ { "label": "crosstalk-robust gates", "reason": "Gate sets designed via optimal control to suppress pairwise and multi-qubit crosstalk" }, { "label": "quantum optimal control", "reason": "Scalable methodology exploiting locality to design noise-informed gate sets" }, { "label": "gate fidelity", "reason": "Performance metric improved through hardware-software co-design and noise suppression" }, { "label": "Hamiltonian simulation", "reason": "Quantum algorithm demonstrating practical benefits of crosstalk-robust gates" } ], "emoji": "✨", "social_summary": "Design crosstalk-robust gate sets using quantum optimal control to suppress multi-qubit noise and improve algorithmic performance by four-fold.", "highlights_oneliner": "Crosstalk-robust gates via optimal control" } ] }, "2026-03-17": { "word_cloud": [ { "word": "thresholds", "weight": 5 }, { "word": "codes", "weight": 4 }, { "word": "bosonic", "weight": 4 }, { "word": "LDPC", "weight": 3 }, { "word": "magic", "weight": 3 }, { "word": "backreaction", "weight": 3 }, { "word": "Pauli", "weight": 3 }, { "word": "Rydberg", "weight": 3 }, { "word": "toric", "weight": 3 }, { "word": "Fock", "weight": 3 }, { "word": "radiation", "weight": 3 }, { "word": "ZNE", "weight": 3 }, { "word": "drift", "weight": 4 }, { "word": "decoder", "weight": 2 }, { "word": "gauging", "weight": 2 }, { "word": "Clifford", "weight": 2 }, { "word": "tensor", "weight": 2 }, { "word": "quasiparticles", "weight": 2 } ], "social_highlights": "Highlights: magic-enriched codes for backreaction, sparse Pauli thresholds, LDPC dualities, [[8,3,2]] switching, Rydberg QND, critical toric thresholds.", "papers": [ { "arxiv_id": "2603.13475", "title": "State-dependent geometries from magic-enriched quantum codes", "authors": "ChunJun Cao, Gong Cheng, Krishnanand Karthikeyan, Cathy Li, John Preskill", "arxiv_url": "https://arxiv.org/abs/2603.13475", "pdf_url": "https://arxiv.org/pdf/2603.13475", "summary": "Introduces approximate quantum error correction with Ryu-Takayanagi-like entropy decomposition for skewed codes from nonlocal perturbations. Defines bulk matter entropy via optimal recovery and proto-area entropy. Identifies tripartite non-local magic in Choi state as origin of matter-geometry coupling.", "motivation": "Existing holographic QECC models fail to capture gravitational backreaction due to state-independent entropic area in exact codes. Approximate correction enables dynamic spacetime emergence from information principles.", "highlights": [ "Proto-area monotonic with bulk entropy", "Magic controls matter-geometry coupling", "Skewed codes align with quantum extremal surfaces" ], "keywords": [ { "label": "magic-enriched codes", "reason": "Core construction via perturbations enabling backreaction" } ], "emoji": "✨", "social_summary": "Unlocks state-dependent geometries in QECC with magic-enriched approximate codes.", "highlights_oneliner": "Magic for holographic backreaction" }, { "arxiv_id": "2603.14670", "title": "Computing logical error thresholds with the Pauli Frame Sparse Representation", "authors": "Thomas Tuloup, Thomas Ayral", "arxiv_url": "https://arxiv.org/abs/2603.14670", "pdf_url": "https://arxiv.org/pdf/2603.14670", "summary": "Introduces sparse representation, truncation, and shot-efficient sampling for thresholds beyond Clifford/Pauli. Shows coherent noise thresholds overestimated by Pauli-twirling by factor of 4 up to $d=9$. Applies to magic-state cultivation, finding $T$-$S$ error factor up to 7 at $d=5$.", "motivation": "Standard threshold methods rely on Clifford and Pauli assumptions, failing for realistic noise. Accurate circuit-level thresholds guide hardware and code design.", "highlights": [ "Coherent thresholds 4x Pauli-twirl", "Magic cultivation $T/S$ factor=7", "Shot-efficient for $d=9$" ], "keywords": [ { "label": "Pauli Frame Sparse", "reason": "Enables non-Clifford threshold computation" }, { "label": "coherent noise", "reason": "Reveals twirling overestimation" }, { "label": "magic cultivation", "reason": "Corrects low-$d$ conjectures" } ], "emoji": "⚡", "social_summary": "Reveals coherent noise thresholds 4x higher than Pauli approximations up to $d=9$.", "highlights_oneliner": "Non-Clifford thresholds" }, { "arxiv_id": "2603.13538", "title": "Quantum Process Realization of LDPC Code Dualities and Product Constructions", "authors": "Shuhan Zhang, Deepak Aryal, Yi-Zhuang You", "arxiv_url": "https://arxiv.org/abs/2603.13538", "pdf_url": "https://arxiv.org/pdf/2603.13538", "summary": "Realizes KW duality, tensor/check products as quantum processes with ancilla, unitaries, measurements. Uses ZX-calculus for circuits from Tanner graph algebras. Links to gauging, coupled-layers, phase mappings.", "motivation": "LDPC transformations lack operational quantum realizations connecting codes to phases. Unified framework enables scalable phase preparation protocols.", "highlights": [ "ZX circuits from Tanner graphs", "Gauging as KW duality", "Quotient algebras for products" ], "keywords": [ { "label": "Kramers-Wannier duality", "reason": "Quantum process via gauging" }, { "label": "ZX-calculus", "reason": "Diagrammatic circuit extraction" }, { "label": "operator algebras", "reason": "Unifies code transformations" } ], "emoji": "🔗", "social_summary": "Turns LDPC dualities into quantum circuits via ZX-calculus.", "highlights_oneliner": "LDPC as quantum processes" }, { "arxiv_id": "2603.15610", "title": "Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code", "authors": "Shixin Wu, Dawei Zhong, Todd A. Brun, Daniel A. Lidar", "arxiv_url": "https://arxiv.org/abs/2603.15610", "pdf_url": "https://arxiv.org/pdf/2603.15610", "summary": "Presents fault-tolerant switching between two $[[8,3,2]]$ versions: one for Clifford, one for $\\overline{\\mathrm{CCZ}}$ via transversal $T/T^\\dagger$. Postselected error-detecting with quadratic logical error suppression. Validates via Grover's search simulation.", "motivation": "Eastin-Knill blocks universal transversal gates in single code. Code-switching enables universal FT computation in distance-2 regime.", "highlights": [ "$[[8,3,2]]$ switching universal", "Quadratic error suppression", "Grover's search validated" ], "keywords": [ { "label": "code-switching", "reason": "Bypasses Eastin-Knill" }, { "label": "$[[8,3,2]]$ code", "reason": "Distance-2 universal base" }, { "label": "postselected FT", "reason": "Quadratic suppression" } ], "emoji": "🔄", "social_summary": "Code-switching enables universal FT in $[[8,3,2]]$ with quadratic error suppression.", "highlights_oneliner": "$[[8,3,2]]$ universal switching" }, { "arxiv_id": "2603.13492", "title": "Qubit syndrome measurements with a high fidelity Rb-Cs Rydberg gate", "authors": "J. Miles, M. T. Lichtman, A. M. Scott, J. Scott, S. A. Norrell, M. J. Bedalov, D. A. Belknap, D. C. Cole, S. Y. Eubanks, M. Gillette, P. Gokhale, J. Goldwin, G. T. Hickman, M. Iliev, R. A. Jones, K. W. Kuper, D. Mason, P. T. Mitchell, J. D. Murphree, N. A. Neff-Mallon, T. W. Noel, A. G. Radnaev, I. V. Vinogradov, M. Saffman", "arxiv_url": "https://arxiv.org/abs/2603.13492", "pdf_url": "https://arxiv.org/pdf/2603.13492", "summary": "Demonstrates Rb-Cs Rydberg gate fidelity $0.975\\pm0.002$. Enables in-place QND qubit measurements for QEC. Achieves $F_{\\rm QND}=0.933(12)$ for 2-qubit, $0.865(17)$ for 3-qubit plaquettes.", "motivation": "In-place QND measurements key for scalable QEC in neutral atom arrays. Interspecies gates expand syndrome capabilities.", "highlights": [ "$F=0.975$ Rb-Cs gate", "$F_{\\rm QND}=0.933$ 2-qubit", "Multi-atom syndrome" ], "keywords": [ { "label": "Rydberg gate", "reason": "High-fidelity Rb-Cs entangling" }, { "label": "QND measurement", "reason": "In-place syndrome for QEC" }, { "label": "neutral atoms", "reason": "Multi-atom plaquettes" } ], "emoji": "🧬", "social_summary": "High-fidelity Rb-Cs Rydberg gate enables QND syndrome measurements.", "highlights_oneliner": "Rydberg QND syndromes" }, { "arxiv_id": "2603.14098", "title": "Intrinsic Error Thresholds in Nearly Critical Toric Codes", "authors": "Zack Weinstein, Samuel J. Garratt", "arxiv_url": "https://arxiv.org/abs/2603.14098", "pdf_url": "https://arxiv.org/pdf/2603.14098", "summary": "Shows finite Pauli decoherence threshold destroys info in near-critical transverse-field toric code. Replica mapping: decoherence as 2D inter-replica defect irrelevant to 3D critical point. Generalizes to broad topological codes.", "motivation": "Near-critical codes have strong anyon fluctuations but unproven protection. Field theory reveals intrinsic thresholds.", "highlights": [ "Finite decoherence threshold", "Irrelevant defect at criticality", "Broad topological applicability" ], "keywords": [ { "label": "near-critical toric", "reason": "Strong fluctuations yet protected" }, { "label": "replica defect", "reason": "Decoherence as irrelevant perturbation" }, { "label": "Ising* universality", "reason": "Duality to TFIM" } ], "emoji": "🌪️", "social_summary": "Near-critical toric codes retain finite error thresholds despite fluctuations.", "highlights_oneliner": "Critical toric thresholds" }, { "arxiv_id": "2603.13304", "title": "A Block Belief-Propagation Algorithm for the Contraction of Tensor-Networks", "authors": "Nir Gutman", "arxiv_url": "https://arxiv.org/abs/2603.13304", "pdf_url": "https://arxiv.org/pdf/2603.13304", "summary": "Introduces BlockBP: coarse-grains TN into blocks for BP between them, improving on standard BP. Efficient for infinite 2D lattices. Applies to frustrated Kagome Heisenberg model.", "motivation": "2D TN contraction bottleneck limits many-body simulations. PGM-BP adaptation handles correlations better via blocking.", "highlights": [ "BlockBP for 2D TN", "Infinite Kagome Heisenberg", "Frustrated systems" ], "keywords": [ { "label": "BlockBP", "reason": "Coarse-grained BP contraction" }, { "label": "tensor networks", "reason": "2D infinite lattices" }, { "label": "Kagome Heisenberg", "reason": "Frustrated model benchmark" } ], "emoji": "🔗", "social_summary": "BlockBP conquers 2D tensor network contractions for frustrated systems.", "highlights_oneliner": "BlockBP TN decoder" }, { "arxiv_id": "2603.15356", "title": "Error semitransparent universal control of a bosonic logical qubit", "authors": "Saswata Roy, Owen C. Wetherbee, Valla Fatemi", "arxiv_url": "https://arxiv.org/abs/2603.15356", "pdf_url": "https://arxiv.org/pdf/2603.15356", "summary": "Dynamic encoding subspaces enable linear-drive EsT gates {$X,H,T$} with 5x infidelity reduction on photon loss. Extends lifetimes with QEC. Composites non-Clifford from 8 gates.", "motivation": "Bosonic codes lack universal FT gates beyond idling. EsT resolves ET limitations for amplitude mixing.", "highlights": [ "EsT {$X,H,T$} set", "5x infidelity reduction", "Composite non-Clifford" ], "keywords": [ { "label": "EsT gates", "reason": "Semi-transparent to photon loss" }, { "label": "bosonic binomial", "reason": "Dynamic subspaces universal" }, { "label": "linear drives", "reason": "Simple hardware control" } ], "emoji": "🎡", "social_summary": "EsT universal gates cut bosonic qubit errors 5-fold.", "highlights_oneliner": "Bosonic EsT universal" }, { "arxiv_id": "2603.15190", "title": "Asymptotically good bosonic Fock state codes: Exact and approximate", "authors": "Dor Elimelech, Arda Aydin, Alexander Barg", "arxiv_url": "https://arxiv.org/abs/2603.15190", "pdf_url": "https://arxiv.org/pdf/2603.15190", "summary": "Equivalence of exact/approximate correction for truncated AD channel. $\\ell_1$-distance classical codes yield asymptotic Fock codes with bounded occupancy. Yields qudit PI codes.", "motivation": "Fock codes need asymptotic analysis for AD noise. Bounded occupancy boosts coherence/stability.", "highlights": [ "Truncated AD equivalence", "Asymptotic $\\ell_1$ codes", "Bounded occupancy" ], "keywords": [ { "label": "Fock state codes", "reason": "Multi-mode constant excitation" }, { "label": "amplitude damping", "reason": "Truncated channel analysis" }, { "label": "$\\ell_1$ metric", "reason": "Asymptotic construction" } ], "emoji": "🎯", "social_summary": "Asymptotically good Fock codes beat photon loss with bounded occupancy.", "highlights_oneliner": "Asymptotic Fock codes" }, { "arxiv_id": "2603.13460", "title": "Characterization of Radiation-Induced Errors in Superconducting Qubits Protected with Various Gap-Engineering Strategies", "authors": "H. Douglas Pinckney, Thomas McJunkin, Alan W. Hunt, Patrick M. Harrington, Hannah P. Binney, Max Hays, Yenuel Jones-Alberty, Kate Azar, Felipe Contipelli, Renée DePencier Piñero, Jeffrey M. Gertler, Michael Gingras, Aranya Goswami, Cyrus F. Hirjibehedin, Mingyu Li, Mathis Moes, Bethany M. Niedzielski, Mallika T. Randeria, Ryan Sitler, Matthew K. Spear, Hannah Stickler, Jiatong Yang, Wouter Van De Pontseele, Mollie E. Schwartz, Jeffrey A. Grover, Kevin Schultz, Kyle Serniak, Joseph A. Formaggio, William D. Oliver", "arxiv_url": "https://arxiv.org/abs/2603.13460", "pdf_url": "https://arxiv.org/pdf/2603.13460", "summary": "$\\alpha$-particles cause spatially/temporally correlated $T_1$ errors; electrons temporal $T_1/T_2$. Gap-engineering at JJ/capacitor reduces severity, hastens recovery. Model agrees qualitatively.", "motivation": "Radiation quasiparticles cause uncorrectable correlated errors. Gap strategies improve resilience.", "highlights": [ "Correlated $T_1$ from $\\alpha$", "Gap hastens recovery", "Quasiparticle model" ], "keywords": [ { "label": "gap-engineering", "reason": "Reduces radiation errors" }, { "label": "quasiparticles", "reason": "Correlated $T_1/T_2$ cause" }, { "label": "radiation resilience", "reason": "$\\alpha$/electron tests" } ], "emoji": "☢️", "social_summary": "Gap-engineering shields superconducting qubits from radiation errors.", "highlights_oneliner": "Radiation gap protection" }, { "arxiv_id": "2603.13949", "title": "Folding-Free Zero-Noise Extrapolation by Layout-induced Noise Diversity", "authors": "Debarthi Pal, Yogesh Simmhan", "arxiv_url": "https://arxiv.org/abs/2603.13949", "pdf_url": "https://arxiv.org/pdf/2603.13949", "summary": "FF-ZNE uses isomorphic layouts for noise amplification sans folding; linear extrapolator under depolarizing. Algorithms find layouts; 133-qubit IBM: 6%/$4.5\\%$ deviation for 50-qubit circuits.", "motivation": "ZNE needs expert noise/extrapolator tuning. Layout diversity enables user-independent mitigation.", "highlights": [ "No folding needed", "Linear depolarizing form", "Scales to 50 qubits" ], "keywords": [ { "label": "FF-ZNE", "reason": "Layout noise diversity" }, { "label": "isomorphic layouts", "reason": "Controllable amplification" }, { "label": "depolarizing model", "reason": "Fixed linear extrapolator" } ], "emoji": "🗺️", "social_summary": "Folding-free ZNE uses layouts for scalable error mitigation.", "highlights_oneliner": "Layout ZNE" }, { "arxiv_id": "2603.14687", "title": "Adaptive Control of Stochastic Error Accumulation in Fault-Tolerant Quantum Computation", "authors": "Tirtha Haque", "arxiv_url": "https://arxiv.org/abs/2603.14687", "pdf_url": "https://arxiv.org/pdf/2603.14687", "summary": "Ch-DQN tracks noise drift/hazard via belief state for FT-QC. Backward refinement, meta-update handle non-stationary. Suppresses accumulation vs static/recurrent.", "motivation": "Non-stationary drift causes temporal error accumulation beyond static decoding. Control policies track correlations.", "highlights": [ "Ch-DQN hazard regulation", "Extends survival time", "Drift-adapted belief" ], "keywords": [ { "label": "Ch-DQN", "reason": "Belief-state drift control" }, { "label": "hazard accumulation", "reason": "Logical failure metric" }, { "label": "non-stationary noise", "reason": "Stochastic FT challenge" } ], "emoji": "🎛️", "social_summary": "Ch-DQN adapts QEC to drifting noise, extending survival.", "highlights_oneliner": "Drift-adaptive QEC control" } ] }, "2026-03-16": { "word_cloud": [ { "word": "fault-tolerance", "weight": 5 }, { "word": "surface codes", "weight": 5 }, { "word": "logical qubits", "weight": 4 }, { "word": "error mitigation", "weight": 4 }, { "word": "superconducting qubits", "weight": 4 }, { "word": "threshold", "weight": 4 }, { "word": "resource estimation", "weight": 3 }, { "word": "noise", "weight": 3 }, { "word": "decoder", "weight": 3 }, { "word": "Hamiltonian simulation", "weight": 3 }, { "word": "NISQ devices", "weight": 3 }, { "word": "magic states", "weight": 2 }, { "word": "qubit scaling", "weight": 2 }, { "word": "circuit depth", "weight": 2 }, { "word": "radiation-induced errors", "weight": 2 }, { "word": "symmetry", "weight": 2 }, { "word": "molecular simulation", "weight": 2 } ], "social_highlights": "Highlights: Partially fault-tolerant quantum computing for megaquop-scale circuits with favorable space-time trade-offs, on-demand ionizing radiation facility for studying correlated errors in superconducting qubits, noise mitigation via Hamiltonian symmetry learning achieving 10% relative error on 100-qubit systems, resource-efficient quantum algorithms for molecular Hamiltonian diagonalization with optimal qubit scaling.", "papers": [ { "arxiv_id": "2603.13093", "title": "Partially Fault-Tolerant Quantum Computation for Megaquop Applications", "authors": "Ming-Zhi Chung, Ali H. Z. Kavaki, Artur Scherer, Abdullah Khalid, Xiangzhou Kong, Toru Kawakubo, Namit Anand, Gebremedhin A Dagnew, Zachary Webb, Allyson Silva, Gaurav Gyawali, Tennin Yan, Keisuke Fujii, Alan Ho, Masoud Mohseni, Pooya Ronagh, John Martinis", "arxiv_url": "https://arxiv.org/abs/2603.13093", "pdf_url": "https://arxiv.org/pdf/2603.13093", "summary": "This work demonstrates quantum resource estimation (QRE) for the space-time-efficient analog rotation (STAR) architecture using realistic superconducting processor specifications, comparing it against full fault-tolerant quantum computing (FTQC). The authors develop code-growth procedures to reduce factory size for analog rotation state production and identify a Goldilocks zone for circuits in the $10^5$–$10^6$ rotation gate regime. Quantum simulation of the 2D Fermi–Hubbard model is shown to be particularly well-suited for the STAR architecture, requiring only hundreds of thousands of physical qubits and minute-scale runtimes.", "motivation": "Fully fault-tolerant quantum computing requires prohibitive qubit overheads for near-term applications, motivating exploration of partially fault-tolerant approaches that balance error suppression with resource efficiency. Understanding the space-time trade-offs and optimal code distances for practical megaquop-scale circuits is essential for bridging the gap between current NISQ devices and future fault-tolerant systems.", "highlights": [ "Identified Goldilocks zone for $10^5$–$10^6$ rotation gates with optimal space-time trade-offs", "2D Fermi–Hubbard simulation requires only hundreds of thousands of physical qubits and minute-scale runtimes", "Code-growth procedure reduces factory size while maintaining infidelity targets" ], "keywords": [ { "label": "STAR architecture", "reason": "Core contribution: space-time-efficient analog rotation architecture for partial FTQC" }, { "label": "Quantum resource estimation", "reason": "Methodology: realistic QRE for superconducting processors with hardware specifications" }, { "label": "Fermi–Hubbard simulation", "reason": "Application: identified as optimal use case for partial FTQC with favorable scaling" }, { "label": "Code-growth procedures", "reason": "Technique: novel method to reduce factory size for magic state production" } ], "emoji": "⚡", "social_summary": "Demonstrate partially fault-tolerant quantum computing for megaquop circuits with favorable space-time trade-offs and practical Fermi–Hubbard simulation.", "highlights_oneliner": "Partial FTQC for megaquop-scale circuits" }, { "arxiv_id": "2603.13124", "title": "On-Demand Correlated Errors in Superconducting Qubits from a Particle Accelerator", "authors": "Thomas McJunkin, A. W. Hunt, Yenuel Jones-Alberty, T. M. Haard, M. K. Spear, James Shackford, Tom Gilliss, Mayra Amezcua, C. A. Watson, T. M. Sweeney, J. A. Hoffmann, Kevin Schultz", "arxiv_url": "https://arxiv.org/abs/2603.13124", "pdf_url": "https://arxiv.org/pdf/2603.13124", "summary": "This work presents a facility coupling an electron linear accelerator (linac) to a dilution refrigerator to study ionizing radiation effects on superconducting quantum processors. The facility enables on-demand generation of correlated errors that mimic cosmic-ray muons, allowing rapid characterization of radiation-induced relaxation, excitation, and detuning errors. The authors demonstrate error signatures dependent on junction placement and surrounding superconducting gaps, providing insights into how ionizing radiation inhibits surface code functionality.", "motivation": "Ionizing radiation from cosmic rays and environmental sources causes correlated errors in superconducting quantum processors that degrade surface code performance, yet previous studies relied on stochastic ambient radiation or indirect quasiparticle generation methods. A controlled, on-demand radiation source enables systematic characterization of these error mechanisms critical for designing robust quantum error correction protocols.", "highlights": [ "On-demand linac electron source mimics cosmic-ray muon energy deposition characteristics", "Rapid collection of radiation-induced relaxation errors with timing information from linac", "Error signatures show dependence on junction placement and superconducting gap geometry" ], "keywords": [ { "label": "Ionizing radiation", "reason": "Primary error source: cosmic rays and high-energy particles causing correlated errors in QEC" }, { "label": "Correlated errors", "reason": "Error type: multi-qubit errors from pair-breaking energy near Josephson junctions" }, { "label": "Linac facility", "reason": "Experimental apparatus: electron linear accelerator coupled to dilution refrigerator for controlled error generation" }, { "label": "Quasiparticle dynamics", "reason": "Physical mechanism: excess quasiparticles near junctions increase decoherence and detuning" } ], "emoji": "☢️", "social_summary": "Build linac facility for on-demand ionizing radiation studies of correlated errors in superconducting quantum processors.", "highlights_oneliner": "Linac-based radiation error characterization" }, { "arxiv_id": "2603.13060", "title": "Noise mitigation of quantum observables via learning from Hamiltonian symmetry decays", "authors": "Javier Oliva del Moral, Olatz Sanz Larrarte, Joana Fraxanet, Dmytro Mishagli, Josu Etxezarreta Martinez", "arxiv_url": "https://arxiv.org/abs/2603.13060", "pdf_url": "https://arxiv.org/pdf/2603.13060", "summary": "This work introduces GUESS (GUiding Extrapolations from Symmetry decayS), a quantum error mitigation technique that exploits Hamiltonian symmetries to improve accuracy of noisy quantum computations. The method learns extrapolation coefficients from symmetry observables to estimate target observable values, with a Hamiltonian impurity technique enabling mitigation of local observables. On IBM Heron r2 with up to 8000 CZ gates and 100 qubits, GUESS achieves $\\sim 10\\%$ relative error with lower variance than zero-noise extrapolation (ZNE) and enables statistical post-selection based on symmetry observable quality.", "motivation": "Quantum noise fundamentally limits circuit depth and qubit count in NISQ devices, and while full fault-tolerant quantum error correction requires prohibitive overheads, intermediate error mitigation techniques can extend utility-scale computations. Exploiting physical symmetries of the problem Hamiltonian offers a principled approach to reduce noise impact with minimal quantum overhead.", "highlights": [ "Achieves $\\sim 10\\%$ relative error on 100-qubit circuits with up to 8000 CZ gates", "Lower variance than ZNE baseline while requiring only $2\\times$ shots per observable", "Statistical post-selection via symmetry observable provides quality metrics for target qubits" ], "keywords": [ { "label": "Symmetry-based mitigation", "reason": "Core technique: learning extrapolation from Hamiltonian symmetry decays to mitigate noise" }, { "label": "Zero-noise extrapolation", "reason": "Baseline method: GUESS compared against ZNE with improved variance and accuracy" }, { "label": "Utility-scale circuits", "reason": "Application domain: demonstrated on 100-qubit systems with thousands of gates" }, { "label": "Observable estimation", "reason": "Problem class: quantum algorithms computing expectation values of observables" } ], "emoji": "✨", "social_summary": "Exploit Hamiltonian symmetries to mitigate noise in utility-scale quantum circuits with 10% relative error and lower variance.", "highlights_oneliner": "Symmetry-based noise mitigation for observables" }, { "arxiv_id": "2603.13160", "title": "Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization", "authors": "Vincent Graves, Manqoba Q. Hlatshwayo, Theodoros Kapourniotis, Konstantinos Georgopoulos", "arxiv_url": "https://arxiv.org/abs/2603.13160", "pdf_url": "https://arxiv.org/pdf/2603.13160", "summary": "This work introduces CIM-QSCI, the first quantum selected configuration interaction (QSCI) algorithm formulated in the configuration interaction matrix (CIM) framework with optimal qubit scaling of $\\lceil \\log_2(N_{CSF}) \\rceil$. The authors develop a single-bit flip error mitigation scheme and combine it with stochastic approximate Trotterization (qDRIFT), and introduce CIM-QSHCI that incorporates heat-bath CI sampling for improved accuracy. Benchmarks on $N_2$ and naphthalene molecules demonstrate comparable accuracy to sample-based quantum diagonalization (SQD) with significantly reduced quantum resources.", "motivation": "Quantum chemistry simulation is a high-impact NISQ application, but existing QSCI and SQD algorithms formulated in second quantization suffer from inefficient qubit scaling and high circuit depths. First-quantization approaches with optimal qubit requirements and resource-efficient error mitigation are essential for practical molecular simulation on near-term quantum hardware.", "highlights": [ "Optimal qubit scaling of $\\lceil \\log_2(N_{CSF}) \\rceil$ via CIM framework in first quantization", "Single-qubit bit-flip error mitigation with modest overhead maintains accuracy", "CIM-QSHCI achieves heat-bath CI performance with quantum sampling instead of classical preprocessing" ], "keywords": [ { "label": "Configuration interaction matrix", "reason": "Core framework: CIM enables first-quantization formulation with optimal qubit scaling" }, { "label": "QSCI algorithm", "reason": "Algorithm class: quantum selected configuration interaction for Hamiltonian subspace diagonalization" }, { "label": "Molecular simulation", "reason": "Application: quantum chemistry benchmarks on $N_2$ and naphthalene molecules" }, { "label": "Error mitigation", "reason": "Technique: single-bit flip mitigation and stochastic Trotterization for NISQ devices" } ], "emoji": "🧪", "social_summary": "Develop resource-efficient quantum algorithms for molecular simulation with optimal qubit scaling and integrated error mitigation.", "highlights_oneliner": "Optimal-scaling quantum chemistry algorithms" } ] }, "2026-03-13": { "word_cloud": [ { "word": "ZNE", "weight": 4 }, { "word": "surface", "weight": 4 }, { "word": "purification", "weight": 4 }, { "word": "Clifford", "weight": 3 }, { "word": "hierarchy", "weight": 3 }, { "word": "SWAP", "weight": 3 }, { "word": "Hamiltonian", "weight": 4 }, { "word": "simulation", "weight": 4 }, { "word": "flag", "weight": 3 }, { "word": "GRAPE", "weight": 3 }, { "word": "teleportation", "weight": 3 }, { "word": "analog", "weight": 3 }, { "word": "distance", "weight": 4 }, { "word": "mitigation", "weight": 4 }, { "word": "threshold", "weight": 4 }, { "word": "fidelity", "weight": 3 }, { "word": "LER", "weight": 3 }, { "word": "noise", "weight": 4 }, { "word": "decoherence", "weight": 3 } ], "social_highlights": "Highlights: adapts ZNE to infinite code distance, characterizes Clifford hierarchy climbs, introduces SWAP purification QEC, optimizes noisy Hamiltonian simulation, proposes flag-GRAPE control, hybrid teleportation for bosonic channels.", "papers": [ { "arxiv_id": "2603.11285", "title": "Infinite Distance Extrapolation: How error mitigation can enhance quantum error correction", "authors": "George Umbrarescu, Oscar Higgott, Dan E. Browne", "arxiv_url": "https://arxiv.org/abs/2603.11285", "pdf_url": "https://arxiv.org/pdf/2603.11285", "summary": "Adapts Zero-Noise Extrapolation (ZNE) to quantum error correction (QEC) by using code distance as the noise parameter, enabling extrapolation to infinite distance. Demonstrates performance on rotated surface code with circuit-level noise, showing resource savings and robustness to non-stabiliser states.", "motivation": "QEM and QEC have been treated separately, but combining them non-trivially enhances fault-tolerant computing below physical thresholds. This matters for early fault-tolerant regimes where QEM augments QEC resource efficiency.", "highlights": [ "3× qubit overhead reduction at $p=0.22\\%$", "9× reduction at $p=0.4\\%$", "Robust to spatial noise variations" ], "keywords": [ { "label": "Infinite Distance Extrapolation", "reason": "Core technique adapting ZNE to code distance" }, { "label": "Rotated Surface Code", "reason": "Testbed code with realistic noise modeling" }, { "label": "Logical Error Rate", "reason": "Key metric for performance evaluation" }, { "label": "Resource Savings", "reason": "Quantified qubit overhead reductions" } ], "emoji": "🔗", "social_summary": "Adapts error mitigation to extrapolate quantum codes to infinite distance, slashing qubit needs.", "highlights_oneliner": "Infinite distance ZNE for QEC" }, { "arxiv_id": "2603.12088", "title": "Climbing the Clifford Hierarchy", "authors": "Luca Bastioni, Samuel Glandon, Tefjol Pllaha, Madison Stewart, Phillip Waitkevich", "arxiv_url": "https://arxiv.org/abs/2603.12088", "pdf_url": "https://arxiv.org/pdf/2603.12088", "summary": "Studies gates whose square roots climb the Clifford Hierarchy, fully characterizing Clifford gates (level 2) whose square roots reach level 3. Builds on patterns like square roots of Paulis being Cliffords and diagonal gate climbing via roots and controls.", "motivation": "Clifford Hierarchy connects to fault-tolerant computation and magic state distillation, but only parts like diagonal and third-level gates are well-understood. Characterizing level climbs advances universal quantum computing.", "highlights": [ "Full characterization of level-2 to level-3 climbs", "Square root climbing pattern generalization", "Diagonal gates via roots and controls" ], "keywords": [ { "label": "Clifford Hierarchy", "reason": "Central mathematical structure studied" }, { "label": "Square Roots", "reason": "Mechanism for hierarchy level climbing" }, { "label": "Level 3 Gates", "reason": "Target level fully characterized" } ], "emoji": "✨", "social_summary": "Fully characterizes Clifford gates climbing to third hierarchy level via square roots.", "highlights_oneliner": "Clifford hierarchy climbers" }, { "arxiv_id": "2603.11568", "title": "Quantum Error Correction by Purification", "authors": "Jonathan Raghoonanan, Tim Byrnes", "arxiv_url": "https://arxiv.org/abs/2603.11568", "pdf_url": "https://arxiv.org/pdf/2603.11568", "summary": "Introduces purification QEC (PQEC) using SWAP test on $N$ noisy copies with $O(M \\log_2 N)$ qubits, interleavable in algorithms without postselection. Achieves $75\\%$ threshold for depolarizing, $50\\%$ for dephasing (boostable by twirling).", "motivation": "Standard QEC like surface codes has high overhead; lighter strategies like purification offer high thresholds for near-term devices. Matters for scalable QEC with copy redundancy over codewords.", "highlights": [ "$75\\%$ depolarizing threshold", "$50\\%$ dephasing threshold", "No postselection needed" ], "keywords": [ { "label": "SWAP Test", "reason": "Core purification primitive" }, { "label": "PQEC", "reason": "Novel QEC via state purification" }, { "label": "Depolarizing Channel", "reason": "Primary error model with high threshold" }, { "label": "Twirling", "reason": "Boosts dephasing performance" } ], "emoji": "⚡", "social_summary": "Purification QEC via SWAP tests hits 75% error thresholds without postselection.", "highlights_oneliner": "Purification-based QEC" }, { "arxiv_id": "2603.11527", "title": "Error-Mitigated Hamiltonian Simulation: Complexity Analysis and Optimization for Near-Term and Early-Fault-Tolerant Quantum Computers", "authors": "Keisuke Murota, Synge Todo, Suguru Endo", "arxiv_url": "https://arxiv.org/abs/2603.11527", "pdf_url": "https://arxiv.org/pdf/2603.11527", "summary": "Analyzes noisy Trotter and LCU Hamiltonian simulation with QEM (PEC), deriving depth-selection for MSE minimization. Shows polynomial/exponential sampling regimes for Trotter, square-root improvement for LCU. Quantifies noise characterization costs.", "motivation": "Hamiltonian simulation is central to quantum algorithms, but noise overlooked; QEM trade-offs need analysis for near-term devices. Enables optimal scaling with physical noise.", "highlights": [ "Optimal $r^* = \\tilde{t}/\\sqrt{2\\gamma'}$ for LCU", "Polynomial/exponential sampling regimes", "SNI reduces characterization overhead" ], "keywords": [ { "label": "Probabilistic Error Cancellation", "reason": "Key QEM method analyzed" }, { "label": "Mean-Squared Error", "reason": "Performance metric optimized" }, { "label": "Trotter Simulation", "reason": "Noisy algorithm with trade-offs" }, { "label": "LCU", "reason": "Randomized method with improvements" } ], "emoji": "🧭", "social_summary": "Optimizes error-mitigated Hamiltonian simulation, balancing depth and sampling costs.", "highlights_oneliner": "Noisy Hamiltonian simulation optimization" }, { "arxiv_id": "2603.12162", "title": "Optimal control with flag qubits", "authors": "Liang-Xu Xie, Lui Zuccherelli de Paula, Weizhou Cai, Qing-Xuan Jie, Luyan Sun, Chang-Ling Zou, Guang-Can Guo, Zi-Jie Chen, Xu-Bo Zou", "arxiv_url": "https://arxiv.org/abs/2603.12162", "pdf_url": "https://arxiv.org/pdf/2603.12162", "summary": "Proposes Flag-GRAPE optimal control with ancilla flags, embedding post-selection to tailor noise into heralded errors. Achieves $51\\%$ infidelity reduction in superconducting sims, compatible with QEC like cat codes.", "motivation": "Traditional GRAPE passively resists decoherence, bounded by entropy; active noise tailoring with flags breaks limits. Crucial for high-fidelity state prep in fault-tolerant architectures.", "highlights": [ "$51\\%$ infidelity reduction", "Robust across noise regimes", "Cat code fidelity gain" ], "keywords": [ { "label": "Flag-GRAPE", "reason": "Novel algorithm with ancillas" }, { "label": "Heralded Erasure", "reason": "Noise conversion mechanism" }, { "label": "Cat Code", "reason": "QEC integration demo" } ], "emoji": "🐱", "social_summary": "Flag-GRAPE control slashes infidelity 51% by tailoring noise with ancillas.", "highlights_oneliner": "Flag qubits for optimal control" }, { "arxiv_id": "2603.11941", "title": "Hybrid Analog Teleportation-Direct Transmission in Noisy Bosonic Channels", "authors": "Uesli Alushi, Simone Felicetti, Roberto Di Candia", "arxiv_url": "https://arxiv.org/abs/2603.11941", "pdf_url": "https://arxiv.org/pdf/2603.11941", "summary": "Introduces hybrid protocol replacing classical channel in teleportation with analog feedforward via noisy quantum channel using squeezer encoding. Outperforms teleportation when channel preserves entanglement; optimal for coherent states.", "motivation": "Quantum teleportation assumes noise-free classical channels, but noisy quantum channels enable analog alternatives. Relevant for optical/microwave communication in modular quantum computing.", "highlights": [ "Theorem for protocol optimality", "Outperforms at km distances", "Analog for microwave channels" ], "keywords": [ { "label": "Hybrid Teleportation", "reason": "Core protocol interpolating schemes" }, { "label": "Two-Mode Squeezer", "reason": "Encoding operation" }, { "label": "Bosonic Channels", "reason": "Application to continuous variables" } ], "emoji": "🔗", "social_summary": "Hybrid analog teleportation beats standard over noisy bosonic channels.", "highlights_oneliner": "Hybrid analog state transfer" } ] }, "2026-03-12": { "word_cloud": [ { "word": "permutation-invariant", "weight": 5 }, { "word": "qudits", "weight": 4 }, { "word": "crosstalk", "weight": 4 }, { "word": "mitigation", "weight": 4 }, { "word": "benchmark", "weight": 4 }, { "word": "hypergraph", "weight": 5 }, { "word": "states", "weight": 4 }, { "word": "deletion", "weight": 3 }, { "word": "Singleton", "weight": 3 }, { "word": "pulse", "weight": 3 }, { "word": "shaping", "weight": 3 }, { "word": "ZNE", "weight": 3 }, { "word": "entanglement", "weight": 4 }, { "word": "stabilizer", "weight": 4 }, { "word": "MBQC", "weight": 3 }, { "word": "superconducting", "weight": 3 }, { "word": "fidelity", "weight": 3 } ], "social_highlights": "Highlights: PI qudit codes approach Singleton bound, crosstalk mitigation hits 99.96% fidelity, bias-free QEM boosts 100-qubit fidelity, hypergraph states review entanglement & MBQC.", "papers": [ { "arxiv_id": "2603.10981", "title": "Permutation-invariant codes: a numerical study and qudit constructions", "authors": "Liam J. Bond, Jiří Minář, Māris Ozols, Arghavan Safavi-Naini, Vladyslav Visnevskyi", "arxiv_url": "https://arxiv.org/abs/2603.10981", "pdf_url": "https://arxiv.org/pdf/2603.10981", "summary": "Investigates permutation-invariant (PI) codes for qudits correcting $d-1$ deletion errors, conjectures qubit PI code block length $n(d) \\geq (3d^2 + 1)/4$, and observes qudit codes approaching quantum Singleton bound $n(d) \\geq 2d-1$. Proposes semi-analytic qudit extension of AAB construction via linear programming.", "motivation": "PI codes, introduced by Ruskai-Pollatsek, correct non-Pauli errors like deletions crucial for noisy quantum hardware. Higher local dimensions reduce block lengths, advancing scalable QEC beyond stabilizer codes.", "highlights": [ "Qubit PI bound: $d \\leq \\sqrt{12n-3}/3$", "Qudit $n$ approaches $2d-1$", "AAB qudit linear program construction" ], "keywords": [ { "label": "Permutation-Invariant codes", "reason": "Core object of study with numerical bounds" }, { "label": "Deletion errors", "reason": "Specific error model via extended KL conditions" }, { "label": "Singleton bound", "reason": "Asymptotic performance metric for qudits" }, { "label": "AAB construction", "reason": "Extended to qudits via linear programming" } ], "emoji": "🔄", "social_summary": "PI qudit codes slash block lengths toward Singleton bound for deletion errors!", "highlights_oneliner": "PI qudit deletion codes" }, { "arxiv_id": "2603.11018", "title": "Mitigating crosstalk errors for simultaneous single-qubit gates on a superconducting quantum processor", "authors": "Jaap J. Wesdorp, Eric Hyyppä, Joona Andersson, Janos Adam, Rohit Beriwal, Ville Bergholm, Saga Dahl, Simone Diego Fasciati, Alejandro Gomez Friero, Zheming Gao, Daria Gusenkova, Andrew Guthrie, Johannes Heinsoo, Tuukka Hiltunen, Keiran Holland, Amin Hosseinkhani, Sinan Inel, Joni Ikonen, Shan W. Jolin, Kristinn Juliusson, Seung-Goo Kim, Anton Komlev, Roope Kokkoniemi, Otto Koskinen, Joonas Kylmälä, Alessandro Landra, Julia Lamprich, Magdalena Lehmuskoski, Nizar Lethif, Per Liebermann, Tianyi Li, Aleksi Lintunen, Fabian Marxer, Kunal Mitra, Jakub Mrożek, Lucas Ortega, Miha Papič, Matti Partanen, Alexander Plyushch, Stefan Pogorzalek, Michael Renger, Jussi Ritvas, Sampo Saarinen, Indrajeet Sagar, Matthew Sarsby, Mykhailo Savytskyi, Ville Selinmaa, Ivan Takmakov, Brian Tarasinski, Francesca Tosto, David Vasey, Panu Vesanen, Jeroen Verjauw, Alpo Välimaa, Nicola Wurz, Hsiang-Sheng Ku, Frank Deppe, Juha Hassel, Caspar Ockeloen-Korppi, Wei Liu, Jani Tuorila, Chun Fai Chan, Attila Geresdi, Antti Vepsäläinen", "arxiv_url": "https://arxiv.org/abs/2603.11018", "pdf_url": "https://arxiv.org/pdf/2603.11018", "summary": "Combines qubit frequency optimization and CTS pulse shaping to achieve 99.96% simultaneous single-qubit fidelity on 49-qubit superconducting processor. Analytical crosstalk model enables bandwidth reduction for scaling to 1000+ qubits.", "motivation": "Crosstalk limits parallel gates essential for QEC syndrome extraction and algorithm depth reduction. Frequency crowding in dense transmon arrays demands new mitigation beyond DRAG.", "highlights": [ "99.96% 16ns simultaneous fidelity", "CTS suppresses crosstalk transitions", "Model scales to 1000-qubit systems" ], "keywords": [ { "label": "Crosstalk mitigation", "reason": "Core technique combining frequency + pulses" }, { "label": "CTS pulse shaping", "reason": "Novel method suppressing leakage transitions" }, { "label": "Frequency optimization", "reason": "Model-based strategy reducing bandwidth" }, { "label": "Superconducting QPU", "reason": "49-qubit experimental platform" } ], "emoji": "⚡", "social_summary": "99.96% parallel gates! Crosstalk mitigation scales superconducting QPUs.", "highlights_oneliner": "Crosstalk-free parallel gates" }, { "arxiv_id": "2603.10224", "title": "Reducing Quantum Error Mitigation Bias Using Verifiable Benchmark Circuits", "authors": "Joseph Harris, Kevin Lively, Peter Schuhmacher", "arxiv_url": "https://arxiv.org/abs/2603.10224", "pdf_url": "https://arxiv.org/pdf/2603.10224", "summary": "Verifiable benchmark circuits mirror application noise for 15% fidelity gain in biased QEM on 100-qubit circuits. Introduces bnZNE adapting ZNE with hardware-native gates, tested on IBM superconducting hardware.", "motivation": "Generic QEM like ZNE suffers systematic bias on NISQ hardware. Benchmark circuits provide bias calibration without circuit overhead on utility-scale devices.", "highlights": [ "15% fidelity gain on 100 qubits", "bnZNE: benchmarked zero-noise extrapolation", "Hardware-native zero overhead" ], "keywords": [ { "label": "Benchmark circuits", "reason": "Verifiable noise mirrors for bias correction" }, { "label": "bnZNE", "reason": "Bias-mitigated zero-noise extrapolation" }, { "label": "QEM bias", "reason": "Systematic error in generic mitigation" }, { "label": "100-qubit utility-scale", "reason": "Demonstrated on IBM hardware" } ], "emoji": "📊", "social_summary": "15% fidelity boost! Benchmark circuits fix QEM bias on 100-qubit chips.", "highlights_oneliner": "Bias-free quantum error mitigation" }, { "arxiv_id": "2603.10917", "title": "Quantum Hypergraph States: A Review", "authors": "Davide Poderini, Dagmar Bruß, Chiara Macchiavello", "arxiv_url": "https://arxiv.org/abs/2603.10917", "pdf_url": "https://arxiv.org/pdf/2603.10917", "summary": "Reviews hypergraph states' stabilizer formalism, LU/SLOCC entanglement classification, and nonclassical features like contextuality. Covers MBQC universality, error correction role, and qudit/continuous variable generalizations.", "motivation": "Graph states limited to pairwise interactions; hypergraph states capture genuine multipartite entanglement from multi-qubit gates. Essential resource for MBQC and beyond-Pauli stabilizer QEC.", "highlights": [ "3-uniform MBQC universality", "Non-Pauli stabilizer formalism", "SLOCC-inequivalent entanglement classes" ], "keywords": [ { "label": "Hypergraph states", "reason": "Generalized graph states with hyperedges" }, { "label": "Multipartite entanglement", "reason": "LU/SLOCC classification and witnesses" }, { "label": "MBQC resource", "reason": "Universal computation via Pauli measurements" }, { "label": "Non-stabilizer magic", "reason": "Resource theory quantification" } ], "emoji": "🕸️", "social_summary": "Hypergraph states unlock multipartite entanglement for universal MBQC!", "highlights_oneliner": "Hypergraph entanglement review" } ] }, "2026-03-11": { "word_cloud": [ { "word": "ErrorMitigation", "weight": 5 }, { "word": "FCQEM", "weight": 4 }, { "word": "ToricCode", "weight": 5 }, { "word": "Z3", "weight": 4 }, { "word": "PhaseTransition", "weight": 5 }, { "word": "QEM", "weight": 4 }, { "word": "Postprocessing", "weight": 3 }, { "word": "Eigenvalues", "weight": 3 }, { "word": "PEPS", "weight": 4 }, { "word": "Parafermion", "weight": 4 }, { "word": "ClusterState", "weight": 3 }, { "word": "VUMPS", "weight": 3 }, { "word": "LoopGas", "weight": 3 }, { "word": "QCM", "weight": 3 }, { "word": "GroundState", "weight": 4 }, { "word": "Rigetti", "weight": 2 }, { "word": "AshkinTeller", "weight": 3 }, { "word": "HilbertFragmentation", "weight": 3 } ], "social_highlights": "Highlights: introduces resource-free FCQEM for eigenvalue recovery, maps deformed $Z_3$ toric code phases to novel models.", "papers": [ { "arxiv_id": "2603.09302", "title": "Fictitious Copy Quantum Error Mitigation", "authors": "Akib Karim, Harish J. Vallury, Muhammad Usman", "arxiv_url": "https://arxiv.org/abs/2603.09302", "pdf_url": "https://arxiv.org/pdf/2603.09302", "summary": "Presents FCQEM, a classical postprocessing method that corrects expectation values using fictitious joint probability distributions from single noisy circuit copies, recovering eigenvalues without extra quantum resources. Demonstrates compatibility with QCM to enhance ground state energy estimation under noise. Validates on simulated models and Rigetti 84-qubit processor.", "motivation": "Noise limits current quantum devices, spurring error mitigation research beyond fault-tolerance. FCQEM addresses resource demands of existing QEM, enabling eigenvalue problems on NISQ hardware.", "highlights": [ "FCQEM recovers exact eigenvalues for eigenstates", "Combines with QCM for ground state energy", "Tested on Rigetti 84-qubit device" ], "keywords": [ { "label": "FCQEM", "reason": "Novel classical postprocessing technique using fictitious copies" }, { "label": "VirtualDistillation", "reason": "Formally equivalent to first-order truncation" }, { "label": "QCM", "reason": "Complementary method for ground state projection" }, { "label": "SharplyPeakedDistributions", "reason": "Optimal for eigenvalue problems like Ising models" } ], "emoji": "📚", "social_summary": "Introduces FCQEM: fixes quantum errors purely classically, no extra qubits needed.", "highlights_oneliner": "Resource-free error mitigation" }, { "arxiv_id": "2603.09107", "title": "Topological phase transition of deformed $\\mathbb{Z}_3$ toric code", "authors": "Yun-Tak Oh, Hyun-Yong Lee", "arxiv_url": "https://arxiv.org/abs/2603.09107", "pdf_url": "https://arxiv.org/pdf/2603.09107", "summary": "Maps deformed $\\mathbb{Z}_3$ toric code from cluster states to $Q=3$ Potts and novel AT$_3$ models via loop-gas framework. Phase diagram shows TC, $e$-confined, $e$-condensed phases with $\\mathbb{Z}_3$ parafermion ($c=4/5$), $c=8/5$ critical lines. Reveals square ice with $U(1)$ symmetry, fragmentation, scars at AFM points.", "motivation": "Extends $\\mathbb{Z}_2$ cluster-MBQC to $\\mathbb{Z}_3$ qudits for topological codes, linking computation and condensed matter. Probes richer $\\mathbb{Z}_3$ phases absent in $\\mathbb{Z}_2$ duality.", "highlights": [ "Three phases with $c=4/5$, $8/5$ transitions", "AT$_3$ model for two-parameter deformations", "Square ice scars at $c=1$ points" ], "keywords": [ { "label": "$\\mathbb{Z}_3$ Toric Code", "reason": "Deformed via cluster state measurements" }, { "label": "Parafermion CFT", "reason": "Governs critical lines at $c=4/5$, $8/5$" }, { "label": "AT$_3$ Model", "reason": "Novel $\\mathbb{Z}_3$ Ashkin-Teller generalization" }, { "label": "Hilbert Fragmentation", "reason": "Emerges in square ice limit" } ], "emoji": "🧭", "social_summary": "Maps deformed Z3 toric code phases to Potts and new AT3 models.", "highlights_oneliner": "Z3 toric code phases" } ] }, "2026-03-10": { "word_cloud": [ { "word": "heterogeneous", "weight": 4 }, { "word": "threshold", "weight": 5 }, { "word": "surface", "weight": 4 }, { "word": "product", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "decoder", "weight": 4 }, { "word": "postselection", "weight": 3 }, { "word": "bias", "weight": 3 }, { "word": "CV", "weight": 3 }, { "word": "mitigation", "weight": 4 }, { "word": "DFS", "weight": 3 }, { "word": "tensor", "weight": 3 }, { "word": "Singleton", "weight": 3 }, { "word": "placement", "weight": 2 }, { "word": "stabilizer", "weight": 3 }, { "word": "logical", "weight": 4 }, { "word": "noise", "weight": 4 }, { "word": "distance", "weight": 5 } ], "social_highlights": "Highlights: heterogeneous qubit placement boosts thresholds, coupled-layer product codes, sub-exceeding quantum LDPC, fidelity deviation for worst-case errors, scalable postselection cuts overhead, decoder comparisons in hybrid CV, extrapolative CV mitigation, stochastic BP loop corrections, quantum minimal learning mitigation, hour-long DFS entanglement storage, tight EACC Singleton bounds.", "papers": [ { "arxiv_id": "2603.06817", "title": "Heterogeneous quantum error-correcting codes", "authors": "Omid Khosravani, Guillermo Escobar-Arrieta, Kenneth R. Brown, Mauricio Gutierrez", "arxiv_url": "https://arxiv.org/abs/2603.06817", "pdf_url": "https://arxiv.org/pdf/2603.06817", "summary": "Introduces heterogeneous quantum error-correcting codes with distinct qubit error channels, studied via maximum-likelihood tensor network decoding. Optimal qubit placement yields thresholds exceeding $0.4$ for differing error rates and up to $0.398(4)$ for bias differences, with exponential logical error suppression. Proposes stabilizer-ratio hypothesis unifying placement rules.", "motivation": "Real quantum systems feature heterogeneous qubits with varying error rates and biases across platforms like trapped ions and superconducting devices. Exploiting this heterogeneity improves error correction beyond homogeneous assumptions, enabling better fault-tolerant performance.", "highlights": [ "Thresholds $>0.4$ with noisy bulk placement", "Bias inversion in logical channel", "Stabilizer-ratio hypothesis for code families" ], "keywords": [ { "label": "heterogeneous codes", "reason": "Core innovation placing distinct qubit types strategically" }, { "label": "tensor network decoding", "reason": "Method for code-capacity regime analysis" }, { "label": "stabilizer-ratio hypothesis", "reason": "Unified explanation for optimal placement" }, { "label": "bias inversion", "reason": "Logical channel becomes $X$-/$Y$-biased from $Z$-bias" } ], "emoji": "🧭", "social_summary": "Strategic qubit placement in heterogeneous codes boosts error thresholds over 40%.", "highlights_oneliner": "Heterogeneous QEC Optimization" }, { "arxiv_id": "2603.08711", "title": "Coupled-Layer Construction of Quantum Product Codes", "authors": "Shuyu Zhang, Tzu-Chieh Wei, Nathanan Tantivasadakarn", "arxiv_url": "https://arxiv.org/abs/2603.08711", "pdf_url": "https://arxiv.org/pdf/2603.08711", "summary": "Presents coupled-layer construction for tensor and balanced product codes by stacking one code and condensing excitations per the other code's checks. Framework unifies classical/quantum CSS inputs and anyon condensation for topological phases, extending to non-topological codes.", "motivation": "Product codes enable qLDPC with good distance-rate scaling, but physical assembly mechanisms were unclear. Intuitive construction aids understanding and implementation of these promising codes.", "highlights": [ "Coupled-layer product code construction", "Unifies anyon condensation mechanisms", "Extends to non-topological codes" ], "keywords": [ { "label": "coupled-layer construction", "reason": "Intuitive physical mechanism for products" }, { "label": "qLDPC chain complexes", "reason": "Extends to sparse metachecks and relations" }, { "label": "anyon condensation", "reason": "Unified topological phase construction" }, { "label": "code switching", "reason": "Enables ancilla introduction in layers" } ], "emoji": "🔗", "social_summary": "Coupled layers build quantum product codes intuitively from constituents.", "highlights_oneliner": "Product Code Layers" }, { "arxiv_id": "2603.08213", "title": "Construction of a Family of Quantum Codes Using Sub-exceding Functions via the Hypergraph Product and the Generalized Shor Construction", "authors": "Luc Rabefihavanana, Harinaivo Andriatahiny, Randriamiarampanahy Ferdinand", "arxiv_url": "https://arxiv.org/abs/2603.08213", "pdf_url": "https://arxiv.org/pdf/2603.08213", "summary": "Derives stabilizer quantum LDPC codes from classical $L_k$ and $L_k^+$ via sub-exceeding functions using hypergraph product and generalized Shor construction. Yields $[[6k^2, k^2, d]]$ codes with $d=3$ for $k=3$, $d=4$ for $k\\ge4$, featuring locality and LDPC structure.", "motivation": "Classical sub-exceeding codes showed strong distance and efficiency; quantum extension provides scalable LDPC family. Addresses need for structured quantum codes with good asymptotic properties.", "highlights": [ "$[[6k^2, k^2, d=4]]$ for $k\\ge4$", "$1/6$ constant rate", "Sparse stabilizer matrices LDPC" ], "keywords": [ { "label": "sub-exceeding functions", "reason": "Basis for novel classical codes extended to quantum" }, { "label": "hypergraph product", "reason": "Construction method with Shor generalization" }, { "label": "quantum LDPC", "reason": "Sparse locality for efficient decoding" } ], "emoji": "🚀", "social_summary": "Sub-exceeding functions yield scalable quantum LDPC codes.", "highlights_oneliner": "Sub-Exceeding LDPC Family" }, { "arxiv_id": "2603.07495", "title": "Sharpening Worst-Case Error Assessment for Fault-Tolerant Quantum Computing: Fidelity and Its Deviation", "authors": "Kyoungho Cho, Ilkwon Sohn, Yongsoo Hwang, Jeongho Bang", "arxiv_url": "https://arxiv.org/abs/2603.07495", "pdf_url": "https://arxiv.org/pdf/2603.07495", "summary": "Introduces fidelity deviation quantifying state-dependent fidelity fluctuations to complement average gate fidelity for worst-case diamond distance. Constrains spectral moments of coherent errors, providing tight worst-case certificates from randomized experiments without tomography.", "motivation": "Gate fidelity misses coherent error inflation in low-error regime critical for fault-tolerance. Companion metric enables reliable assessment of adversarial circuit behavior.", "highlights": [ "Fidelity deviation for fluctuations", "Spectral moment constraints", "Randomized experiment estimation" ], "keywords": [ { "label": "fidelity deviation", "reason": "New metric for state fluctuations" }, { "label": "diamond distance", "reason": "Worst-case error proxy improved" }, { "label": "coherent errors", "reason": "Unitary error analysis via moments" }, { "label": "Haar averages", "reason": "Algebraic foundation for integrals" } ], "emoji": "⚡", "social_summary": "Fidelity deviation sharpens worst-case quantum gate assessment.", "highlights_oneliner": "Fidelity Deviation Metric" }, { "arxiv_id": "2603.08697", "title": "Scalable Postselection of Quantum Resources", "authors": "J. Wilson Staples, Winston Fu, Jeff D. Thompson", "arxiv_url": "https://arxiv.org/abs/2603.08697", "pdf_url": "https://arxiv.org/pdf/2603.08697", "summary": "Develops scalable postselection using partial gap metric estimating post-consumption logical gap from decoder soft info. Achieves $4\\times$ overhead reduction per logical gate via cluster-state teleportation at fixed error probability.", "motivation": "Postselection reduces QEC overhead but naive scaling incurs exponential retries; size-extensive approach with fixed rejection maintains practicality. Enables efficient fault-tolerant gates.", "highlights": [ "$4\\times$ overhead reduction", "Partial gap metric", "Cluster-state teleportation" ], "keywords": [ { "label": "partial gap", "reason": "Postselection confidence metric" }, { "label": "scalable postselection", "reason": "Size-extensive sub-circuits" }, { "label": "cluster-state gates", "reason": "Teleportation implementation" } ], "emoji": "🔄", "social_summary": "Scalable postselection slashes quantum overhead fourfold.", "highlights_oneliner": "Scalable Postselection" }, { "arxiv_id": "2603.06730", "title": "Decoder Performance in Hybrid CV-Discrete Surface-Code Threshold Estimation Using LiDMaS+", "authors": "Dennis Delali Kwesi Wayo, Chinonso Onah, Vladimir Milchakov, Leonardo Goliatt, Sven Groppe", "arxiv_url": "https://arxiv.org/abs/2603.06730", "pdf_url": "https://arxiv.org/pdf/2603.06730", "summary": "Compares MWPM, Union-Find, neural-guided MWPM in Pauli and hybrid CV/discrete surface codes via LiDMaS+. MWPM outperforms Union-Find; neural tracks closely but shows decoder failures at high noise.", "motivation": "Thresholds depend on decoder choice, especially in hybrid GKP-style models bridging continuous noise to discrete decoding. Ensures reproducible inference across methods.", "highlights": [ "MWPM $p_c\\approx0.053$ at $d=5$", "Union-Find worse in hybrid", "Neural failure rate $0.1335$" ], "keywords": [ { "label": "LiDMaS+", "reason": "Platform for threshold sweeps" }, { "label": "hybrid CV/discrete", "reason": "GKP-motivated noise model" }, { "label": "neural-guided MWPM", "reason": "Trained decoder performance" }, { "label": "decoder failure", "reason": "Diagnostic at high noise" } ], "emoji": "📚", "social_summary": "Decoder choice impacts hybrid surface code thresholds.", "highlights_oneliner": "Hybrid Decoder Comparison" }, { "arxiv_id": "2603.08548", "title": "Extrapolative Quantum Error Mitigation in Continuous-Variable Systems beyond the Training Horizon", "authors": "Jingpeng Zhang, Shengyong Li, Jie Han, Qianchuan Zhao, Jing Zhang, Zeliang Xiang", "arxiv_url": "https://arxiv.org/abs/2603.08548", "pdf_url": "https://arxiv.org/pdf/2603.08548", "summary": "Time-conditioned Swin Transformer for extrapolative QEM embeds evolution time via adaptive normalization, recovering states beyond training in Markovian/non-Markovian CV noise from photon loss/dephasing.", "motivation": "Existing ML QEM limited to training horizon requires full evolution data; extrapolation reduces experimental demands for long-time CV processing.", "highlights": [ "Beyond-training recovery", "Swin Transformer time-conditioning", "Markovian/non-Markovian noise" ], "keywords": [ { "label": "Swin Transformer", "reason": "Architecture for phase-space correction" }, { "label": "adaptive layer norm", "reason": "Time embedding mechanism" }, { "label": "extrapolative QEM", "reason": "Beyond-training mitigation" }, { "label": "CV phase-space", "reason": "Quadrature noise handling" } ], "emoji": "⏱", "social_summary": "Extrapolative mitigation recovers CV states beyond training.", "highlights_oneliner": "CV Extrapolative Mitigation" }, { "arxiv_id": "2603.08427", "title": "Stochastic Loop Corrections to Belief Propagation for Tensor Network Contraction", "authors": "Gi Beom Sim, Tae Hyeon Park, Kwang S. Kim, Yanmei Zang, Xiaorong Zou, Hye Jung Kim, D. ChangMo Yang, Soohaeng Yoo Willow, Chang Woo Myung", "arxiv_url": "https://arxiv.org/abs/2603.08427", "pdf_url": "https://arxiv.org/pdf/2603.08427", "summary": "Hybrid BP with MCMC sampling of loop corrections via exact partition factorization for pairwise Markov fields. Umbrella sampling ensures exploration; applied to 2D Ising model across temperatures.", "motivation": "BP approximates tensor contraction on loopy graphs; exact stochastic corrections enable unbiased results for quantum/stat mech/ML applications.", "highlights": [ "Exact loop corrections", "Umbrella MCMC sampling", "2D Ising benchmarks" ], "keywords": [ { "label": "BPLMC", "reason": "Hybrid BP-MCMC method" }, { "label": "loop corrections", "reason": "Exact factorization sampling" }, { "label": "umbrella sampling", "reason": "Efficient correlation exploration" }, { "label": "tensor contraction", "reason": "#P-hard problem solved exactly" } ], "emoji": "🔀", "social_summary": "Stochastic loops perfect belief propagation contractions.", "highlights_oneliner": "BP Loop Corrections" }, { "arxiv_id": "2603.07532", "title": "Quantum Minimal Learning Machine: A Fidelity-Based Approach to Error Mitigation", "authors": "Clemens Lindner, Joonas Hämäläinen, Matti Raasakka", "arxiv_url": "https://arxiv.org/abs/2603.07532", "pdf_url": "https://arxiv.org/pdf/2603.07532", "summary": "Quantum minimal learning machine adapts classical MLM for fidelity-based similarity learning on quantum data. Applied as model-agnostic error mitigation for noisy states like depolarizing noise.", "motivation": "Quantum data from simulations needs direct learning; similarity-based QMLM mitigates hardware noise without noise model knowledge.", "highlights": [ "Fidelity-based QMLM", "Model-agnostic mitigation", "Depolarizing noise demo" ], "keywords": [ { "label": "QMLM", "reason": "Quantum minimal learning machine" }, { "label": "fidelity similarity", "reason": "Distance metric for quantum data" }, { "label": "error mitigation", "reason": "Noisy state recovery application" } ], "emoji": "🪢", "social_summary": "Quantum minimal machine mitigates errors via fidelity learning.", "highlights_oneliner": "Fidelity QMLM Mitigation" }, { "arxiv_id": "2603.07190", "title": "Long-time storage of entangled logical states in decoherence-free subspaces", "authors": "L. Zhang, Y. -L. Xu, Y. -K. Wu, C. Zhang, Z. -B. Cui, Y. -Y. Chen, W. -Q. Lian, J. -Y. Ma, B. -X. Qi, Y. -F. Pu, Z. -C. Zhou, L. He, P. -Y. Hou, L. -M. Duan", "arxiv_url": "https://arxiv.org/abs/2603.07190", "pdf_url": "https://arxiv.org/pdf/2603.07190", "summary": "Encodes two-qubit entanglement in four-ion DFS with crosstalk-free cooling and multi-state detection, achieving $\\sim1$ hour storage. Second-order DFS suppresses nonuniform noise better than first-order.", "motivation": "Long entanglement storage needed for NISQ quantum memories/repeaters without full QEC overhead. Ion DFS leverages hardware isolation for extended coherence.", "highlights": [ "$1$ hour DFS storage", "Crosstalk-free cooling", "Second-order DFS advantage" ], "keywords": [ { "label": "decoherence-free subspace", "reason": "Passive error protection method" }, { "label": "sympathetic cooling", "reason": "Maintains ion chain coherence" }, { "label": "second-order DFS", "reason": "Noise inhomogeneity suppression" }, { "label": "four-ion encoding", "reason": "Logical entanglement storage" } ], "emoji": "⏰", "social_summary": "One-hour entangled storage in ion DFS.", "highlights_oneliner": "DFS Entanglement Storage" }, { "arxiv_id": "2603.08563", "title": "Space-sharing and Singleton Bounds for Entanglement-assisted Classical Coding", "authors": "Yuhang Yao, Tushita Prasad, Markus Grassl, Syed Jafar, Hua Sun", "arxiv_url": "https://arxiv.org/abs/2603.08563", "pdf_url": "https://arxiv.org/pdf/2603.08563", "summary": "Elaborates space-sharing proving tight EACC Singleton bound; derives new entropic bound for distributed entanglement with local ops. Shows achievability for general parameters.", "motivation": "EACC Singleton tightness open; space-sharing resolves for classical messages with entanglement aid. Extends to constrained multi-encoder settings.", "highlights": [ "Tight EACC Singleton", "Distributed entanglement bound", "Space-sharing achievability" ], "keywords": [ { "label": "EACC Singleton", "reason": "Tight bound via space-sharing" }, { "label": "entropic Singleton", "reason": "New bound for distributed entanglement" }, { "label": "space-sharing", "reason": "Proof technique for tightness" } ], "emoji": "🔓", "social_summary": "Tight Singleton bounds for entanglement-assisted coding.", "highlights_oneliner": "EACC Singleton Tightness" } ] }, "2026-03-09": { "word_cloud": [ { "word": "lattice surgery", "weight": 5 }, { "word": "remote entanglement", "weight": 5 }, { "word": "distillation", "weight": 4 }, { "word": "surface code", "weight": 5 }, { "word": "optimal recovery", "weight": 5 }, { "word": "Petz map", "weight": 4 }, { "word": "mutual trace distance", "weight": 4 }, { "word": "threshold", "weight": 5 }, { "word": "toric code", "weight": 5 }, { "word": "Heisenberg perturbation", "weight": 4 }, { "word": "NQS", "weight": 3 }, { "word": "topological transition", "weight": 4 }, { "word": "Néel phase", "weight": 4 }, { "word": "Schrieffer-Wolff", "weight": 3 }, { "word": "fidelity susceptibility", "weight": 3 }, { "word": "Wilson loops", "weight": 3 }, { "word": "Pauli channels", "weight": 3 }, { "word": "Bayes decoder", "weight": 3 }, { "word": "ion-trap", "weight": 2 } ], "social_highlights": "Highlights: lattice surgery skips distillation for huge resource savings, optimal recovery thresholds via Petz/SW maps, toric code phase transition to Néel order under Heisenberg noise.", "papers": [ { "arxiv_id": "2603.06513", "title": "Remote Entanglement in Lattice Surgery: To Distill, or Not to Distill", "authors": "Sitong Liu, John Stack, Ke Sun, Roel Van Beeumen, Inder Monga, Katherine Klymko, Kenneth R. Brown, Erhan Saglamyurek", "arxiv_url": "https://arxiv.org/abs/2603.06513", "pdf_url": "https://arxiv.org/pdf/2603.06513", "summary": "Quantifies resource trade-offs between Bell pair distillation overhead and surface-code distance under realistic photonic constraints, identifying fidelity crossover where skipping distillation reduces overhead by up to two orders of magnitude at low fidelities and 68% at high fidelities. Demonstrates lattice-surgery tolerance to higher error rates, enabling co-design of photonic interconnects for distributed quantum computing. Applies methods to ion-trap and neutral-atom platforms.", "motivation": "Prior distributed quantum computing assumed distillation for remote Bell pairs, incurring high overhead despite recent lattice-surgery advances tolerating higher errors. Matters for scalable fault-tolerant architectures by optimizing resource use in noisy intermediate-scale quantum networks.", "highlights": [ "Fidelity crossover skips distillation", "Up to 100x resource reduction at low fidelity", "68% overhead cut at high fidelity" ], "keywords": [ { "label": "lattice surgery", "reason": "Core operation enabling high error tolerance at logical boundaries" }, { "label": "remote entanglement", "reason": "Photon-mediated linking for distributed computing" }, { "label": "surface-code distance", "reason": "Key trade-off parameter vs. distillation" }, { "label": "photonic interconnects", "reason": "Realistic constraint in resource analysis" } ], "emoji": "🔗", "social_summary": "Shows skipping Bell pair distillation in lattice surgery slashes distributed quantum computing costs by 100x!", "highlights_oneliner": "Distillation-free lattice surgery" }, { "arxiv_id": "2603.06520", "title": "Optimal recovery for quantum error correction", "authors": "Sun Woo P. Kim", "arxiv_url": "https://arxiv.org/abs/2603.06520", "pdf_url": "https://arxiv.org/pdf/2603.06520", "summary": "Introduces mutual trace distance as necessary/sufficient diagnostic for optimal recovery thresholds $p_\\mathrm{th}^\\mathrm{opt}$ over all quantum channels, proving Petz and SW schemes achieve it. For Pauli CSS codes, equates optimal recovery to syndrome measurement plus Bayes-optimal sampling decoder, matching ML performance. Explores structures and phase diagrams of optimal/non-optimal recoveries.", "motivation": "Standard thresholds use maximum-likelihood decoders, but true optimum spans all recovery channels like Petz/SW. Establishes optimality to refine error thresholds and decoder designs for practical QEC.", "highlights": [ "Mutual trace distance diagnostic", "Petz/SW are optimal", "Bayes decoder for CSS codes" ], "keywords": [ { "label": "Petz recovery", "reason": "Proven optimal quantum channel" }, { "label": "SW recovery", "reason": "Optimal with coherent information bound" }, { "label": "mutual trace distance", "reason": "Sharp $p_\\mathrm{th}^\\mathrm{opt}$ diagnostic" }, { "label": "Bayes-optimal decoder", "reason": "Optimal for Pauli CSS codes" } ], "emoji": "⚡", "social_summary": "Proves Petz and SW recoveries hit true optimal QEC thresholds using new trace distance tool.", "highlights_oneliner": "Optimal QEC recovery maps" }, { "arxiv_id": "2603.05707", "title": "The toric code under antiferromagnetic isotropic Heisenberg interactions", "authors": "Won Jang, Robert Peters, Thore Posske", "arxiv_url": "https://arxiv.org/abs/2603.05707", "pdf_url": "https://arxiv.org/pdf/2603.05707", "summary": "Uses NQS to track toric code phase transition under Heisenberg perturbation, validating SW effective theory for weak coupling where topology persists. Estimates critical $J_c \\approx 0.164$ via fidelity susceptibility, Wilson loops, and topological entanglement entropy. Identifies post-transition antiferromagnetic $\\pm X/\\pm Z$ Néel phase with fourfold degeneracy.", "motivation": "Toric code exemplifies topological order, but realistic two-spin interactions like Heisenberg destabilize it. Quantifies stability for fault-tolerant quantum memory implementations in noisy hardware.", "highlights": [ "$J_c \\approx 0.164$ critical point", "SW validates weak-coupling topology", "Néel phase beyond transition" ], "keywords": [ { "label": "toric code", "reason": "Model perturbed by Heisenberg" }, { "label": "Schrieffer-Wolff", "reason": "Effective theory for perturbation" }, { "label": "NQS", "reason": "Numerical method respecting symmetries" }, { "label": "topological entanglement entropy", "reason": "Diagnostic for phase transition" } ], "emoji": "🧭", "social_summary": "Maps toric code's meltdown to Néel order under Heisenberg noise, pinning critical point at $J_c=0.164$.", "highlights_oneliner": "Toric code Heisenberg transition" } ] }, "2026-03-06": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "decoder", "weight": 5 }, { "word": "threshold", "weight": 5 }, { "word": "surgery", "weight": 4 }, { "word": "magic", "weight": 4 }, { "word": "surface", "weight": 4 }, { "word": "ancilla", "weight": 4 }, { "word": "distance", "weight": 4 }, { "word": "syndrome", "weight": 4 }, { "word": "fault-tolerant", "weight": 3 }, { "word": "decoding", "weight": 3 }, { "word": "stabilizer", "weight": 3 }, { "word": "Clifford", "weight": 3 }, { "word": "graph-matching", "weight": 3 }, { "word": "layer", "weight": 3 }, { "word": "postselection", "weight": 3 }, { "word": "tensor", "weight": 2 }, { "word": "Lindbladian", "weight": 2 }, { "word": "qutrit", "weight": 2 }, { "word": "cat", "weight": 2 }, { "word": "fan-out", "weight": 2 } ], "social_highlights": "Highlights: parsimonious qLDPC surgery, graph-matching TTI decoders, layer weight reduction, parallel QGPU logic, FT QAOA/HHL execution.", "papers": [ { "arxiv_id": "2603.05082", "title": "Parsimonious Quantum Low-Density Parity-Check Code Surgery", "authors": "Andrew C. Yuan, Alexander Cowtan, Zhiyang He, Ting-Chun Lin, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2603.05082", "pdf_url": "https://arxiv.org/pdf/2603.05082", "summary": "Introduces ancilla system of qubit size $O(W \\log W)$ to measure arbitrary logical Pauli operator of weight $W$ in any qLDPC stabilizer code. Reduces asymptotic overhead in quantum code surgery schemes including parallel surgery and fast surgery. Serves as key primitive in extractor architectures.", "motivation": "qLDPC codes achieve high encoding rates but challenge fault-tolerant computation due to global logical qubits. Code surgery provides flexible, code-agnostic logical operations bypassing no-go theorems on transversal gates.", "highlights": [ "$O(W \\log W)$ ancilla qubits", "Reduces surgery overhead asymptotically", "Enables fast qLDPC surgery" ], "keywords": [ { "label": "qLDPC surgery", "reason": "Core technique for low-overhead logical measurements" }, { "label": "ancilla construction", "reason": "Innovative $O(W \\log W)$ qubit system" }, { "label": "extractor architecture", "reason": "Application to fault-tolerant qLDPC computing" }, { "label": "fast surgery", "reason": "Specific protocol improvement" } ], "emoji": "🔧", "social_summary": "Constructs tiny ancilla systems slashing qLDPC surgery overhead for fault-tolerant quantum computing.", "highlights_oneliner": "Parsimonious qLDPC Surgery" }, { "arxiv_id": "2603.05402", "title": "Generalized matching decoders for 2D topological translationally-invariant codes", "authors": "Shi Jie Samuel Tan, Ian Gill, Eric Huang, Pengyu Liu, Chen Zhao, Hossein Dehghani, Aleksander Kubica, Hengyun Zhou, Arpit Dua", "arxiv_url": "https://arxiv.org/abs/2603.05402", "pdf_url": "https://arxiv.org/pdf/2603.05402", "summary": "Develops graph-matching decoder for general TTI codes by coarse-graining to TC excitations. Proves correction of errors up to constant fraction of code distance with non-zero thresholds. Numerically matches BP+OS performance for BB codes.", "motivation": "TTI codes like toric and BB codes promising but lack efficient decoders with TC-style guarantees. Equivalence to TC copies suggests graph-matching potential.", "highlights": [ "Constant fraction distance correction", "Non-zero capacity thresholds", "BB code performance match" ], "keywords": [ { "label": "TTI codes", "reason": "Targets topological translationally-invariant codes" }, { "label": "graph-matching", "reason": "Decoder extending TC techniques" }, { "label": "coarse-graining", "reason": "Maps syndromes to TC excitations" }, { "label": "BB codes", "reason": "Practical code family benchmark" } ], "emoji": "🕸️", "social_summary": "Graph-matching decoders conquer TTI quantum codes with TC-level guarantees.", "highlights_oneliner": "TTI Graph-Matching Decoders" }, { "arxiv_id": "2603.04883", "title": "Quantum Weight Reduction with Layer Codes", "authors": "Andrew C. Yuan, Nouédyn Baspin, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2603.04883", "pdf_url": "https://arxiv.org/pdf/2603.04883", "summary": "Introduces layer code construction replacing qubits/checks with surface code patches achieving check weight 6, qubit degree 6. General procedure for CSS codes with geometric non-locality. Suited for modular architectures with long-range links.", "motivation": "Good qLDPC codes have high weights impractical for hardware. Weight reduction enables practical implementation at modest overhead.", "highlights": [ "Check weight 6", "Qubit degree 6", "Modular architecture fit" ], "keywords": [ { "label": "layer codes", "reason": "Novel geometric construction" }, { "label": "weight reduction", "reason": "Achieves $\\mathfrak{w}=6$, $\\mathfrak{q}=6$" }, { "label": "surface patches", "reason": "Replaces elements with surface code" }, { "label": "CSS general", "reason": "Applies to arbitrary CSS codes" } ], "emoji": "📚", "social_summary": "Layer codes slash qLDPC weights to 6 for modular quantum hardware.", "highlights_oneliner": "Layer Weight Reduction" }, { "arxiv_id": "2603.05398", "title": "QGPU: Parallel logic in quantum LDPC codes", "authors": "Boren Gu, Andy Zeyi Liu, Armanda O. Quintavalle, Qian Xu, Jens Eisert, Joschka Roffe", "arxiv_url": "https://arxiv.org/abs/2603.05398", "pdf_url": "https://arxiv.org/pdf/2603.05398", "summary": "Introduces clustered-cyclic qLDPC codes with direct logical basis enabling $k/2$ parallel Pauli measurements. Parallel product surgery uses auxiliary data copy for single-round measurements. Generates full Clifford group fault-tolerantly.", "motivation": "qLDPC high logical density hinders parallelism due to overlapping supports. Surface-code-style parallelism needed for practical computation.", "highlights": [ "$[[136,8,14]]$ code", "$k/2$ parallel measurements", "Clifford group generation" ], "keywords": [ { "label": "clustered-cyclic", "reason": "New qLDPC code family" }, { "label": "parallel surgery", "reason": "Product surgery protocol" }, { "label": "logical basis", "reason": "Direct addressing enables parallelism" } ], "emoji": "⚙️", "social_summary": "QGPU delivers surface-code parallelism in dense qLDPC logicals.", "highlights_oneliner": "Parallel qLDPC Logic" }, { "arxiv_id": "2603.04584", "title": "Fault-tolerant execution of error-corrected quantum algorithms", "authors": "Michael A. Perlin, Zichang He, Anthony Alexiades Armenakas, Pablo Andres-Martinez, Tianyi Hao, Dylan Herman, Yuwei Jin, Karl Mayer, Chris Self, David Amaro, Ciaran Ryan-Anderson, Ruslan Shaydulin", "arxiv_url": "https://arxiv.org/abs/2603.04584", "pdf_url": "https://arxiv.org/pdf/2603.04584", "summary": "Demonstrates FT QAOA/HHL execution on Quantinuum H2/Helios using $[[7,1,3]]$ Steane code. Shows performance gains from more QAOA layers/$T$ gates despite complexity. Achieves near-break-even with 12 logical qubits, 2132 physical gates.", "motivation": "End-to-end FT algorithmic execution unachieved despite primitive demonstrations. Requires full QEC stack integration.", "highlights": [ "12 logical qubit QAOA", "FT $T$ gate $2.6\\times10^{-3}$ infidelity", "Break-even performance" ], "keywords": [ { "label": "Steane code", "reason": "$[[7,1,3]]$ hardware demonstration" }, { "label": "FT QAOA", "reason": "Algorithmic execution benchmark" }, { "label": "dynamic circuits", "reason": "Measurement feedback essential" } ], "emoji": "⚡", "social_summary": "FT quantum algorithms run break-even on real hardware.", "highlights_oneliner": "FT Algorithmic Execution" }, { "arxiv_id": "2603.05429", "title": "Constant depth magic state cultivation with Clifford measurements by gauging", "authors": "Bence Hetényi, Benjamin J. Brown, Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2603.05429", "pdf_url": "https://arxiv.org/pdf/2603.05429", "summary": "Gauging transversal Clifford enables constant-depth $XS^\\dagger$ measurement on color code. Repeated gauging with post-selection reaches $10^{-12}$ at $0.05\\%$ error. Square grid compatible with sublattice separation.", "motivation": "Magic state cultivation limited by $O(d)$ Clifford depth beyond $d=5$. Constant depth needed for scalability.", "highlights": [ "Constant-depth Clifford", "$10^{-12}$ at $0.05\\%$", "Square grid compatible" ], "keywords": [ { "label": "gauging", "reason": "Constant-depth measurement technique" }, { "label": "color code", "reason": "Targeted lattice" }, { "label": "magic cultivation", "reason": "Post-selection protocol" } ], "emoji": "✨", "social_summary": "Constant-depth magic states via color code gauging.", "highlights_oneliner": "Gauged Magic Cultivation" }, { "arxiv_id": "2603.05145", "title": "Quantum advantages for syndrome-aware noisy logical observable estimation", "authors": "Kento Tsubouchi, Hyukgun Kwon, Liang Jiang, Nobuyuki Yoshioka", "arxiv_url": "https://arxiv.org/abs/2603.05145", "pdf_url": "https://arxiv.org/pdf/2603.05145", "summary": "Information-theoretic framework quantifies syndrome utility distinguishing classical/quantum protocols. Classical: at most factor-2 error improvement. Quantum control: exponential decay with logical qubits.", "motivation": "Syndrome information underutilized post-decoding. Active exploitation needed for early fault-tolerance.", "highlights": [ "Classical factor-2 limit", "Quantum exponential scaling", "Syndrome-aware protocols" ], "keywords": [ { "label": "syndrome-aware", "reason": "Exploits post-decoding information" }, { "label": "quantum estimation", "reason": "Information-theoretic bounds" }, { "label": "classical limit", "reason": "Proved factor-2 improvement cap" } ], "emoji": "📊", "social_summary": "Syndromes unlock exponential quantum estimation gains.", "highlights_oneliner": "Syndrome Quantum Advantage" }, { "arxiv_id": "2603.04543", "title": "Linear-Time Encodable and Decodable Quantum Error-Correcting Codes", "authors": "Adam Wills, Ting-Chun Lin, Rachel Yun Zhang, Min-Hsiu Hsieh", "arxiv_url": "https://arxiv.org/abs/2603.04543", "pdf_url": "https://arxiv.org/pdf/2603.04543", "summary": "Constructs asymptotically good codes with logarithmic-depth linear-gate encoding/decoding. Explicit codes with linear gates throughout, logarithmic-depth encoding/unencoding. Targets channel capacity communication.", "motivation": "Quantum communication needs fast encoding/decoding unlike computation focus. Classical analogs well-studied.", "highlights": [ "Log-depth linear gates", "Linear-time explicit codes", "Channel capacity" ], "keywords": [ { "label": "linear-time", "reason": "Encoding/decoding complexity" }, { "label": "channel capacity", "reason": "Communication application" }, { "label": "logarithmic depth", "reason": "Circuit efficiency" } ], "emoji": "⚡", "social_summary": "Linear-time quantum codes for fast communication.", "highlights_oneliner": "Fast Quantum Codes" }, { "arxiv_id": "2603.05481", "title": "High-performance syndrome extraction circuits for quantum codes", "authors": "Armands Strikis, Dan E. Browne, Michael E. Beverland", "arxiv_url": "https://arxiv.org/abs/2603.05481", "pdf_url": "https://arxiv.org/pdf/2603.05481", "summary": "Left-right circuits generalized to arbitrary CSS codes minimize idling/maximize distance. Residual error metrics bound circuit distance. Order-of-magnitude logical improvement over single-ancilla designs.", "motivation": "Syndrome extraction limits practical code performance. Non-interleaving limits understood.", "highlights": [ "Order-magnitude improvement", "Residual distance bounds", "$d_{\\mathrm{circ}}=11$ Gross code" ], "keywords": [ { "label": "left-right circuits", "reason": "General SEC design" }, { "label": "residual errors", "reason": "Distance metric innovation" }, { "label": "non-interleaving", "reason": "Proved limitations" } ], "emoji": "🔌", "social_summary": "Optimized syndrome circuits boost code performance 10x.", "highlights_oneliner": "SEC Optimization" }, { "arxiv_id": "2603.05320", "title": "Simplified circuit-level decoding using Knill error correction", "authors": "Ewan Murphy, Subhayan Sahu, Michael Vasmer", "arxiv_url": "https://arxiv.org/abs/2603.05320", "pdf_url": "https://arxiv.org/pdf/2603.05320", "summary": "Knill correction enables single-round syndrome measurement simplifying decoder. Same capacity-model decoder solves time-constrained problem. Fault tolerance proved under circuit noise.", "motivation": "Repeated measurements complicate decoding. Knill single-shot reduces classical overhead.", "highlights": [ "Single-round decoding", "Capacity decoder reuse", "qLDPC benchmarking" ], "keywords": [ { "label": "Knill correction", "reason": "Single-shot syndrome" }, { "label": "time-constrained", "reason": "Circuit-level decoding" }, { "label": "soft information", "reason": "Decoder output utility" } ], "emoji": "🎯", "social_summary": "Knill correction simplifies qLDPC circuit decoding.", "highlights_oneliner": "Knill Decoding" }, { "arxiv_id": "2603.04875", "title": "Macromux: scalable postselection for high-threshold fault-tolerant quantum computation", "authors": "Patrick Birchall, Jacob Bridgeman, Christopher Dawson, Terry Farrelly, Yehua Liu, Naomi Nickerson, Mihir Pant, Sam Roberts, Karthik Seetharam, David Tuckett", "arxiv_url": "https://arxiv.org/abs/2603.04875", "pdf_url": "https://arxiv.org/pdf/2603.04875", "summary": "Hierarchical postselection on space-time windows boosts Pauli/erasure thresholds $\\sim6\\times$. Constant overhead scalable to any protocol. $5.9\\%$ Pauli threshold for surface fusion.", "motivation": "Current devices exceed low-overhead scheme thresholds. High-threshold protocols needed.", "highlights": [ "$5.9\\%$ Pauli threshold", "$\\sim6\\times$ improvement", "Constant overhead" ], "keywords": [ { "label": "macromux", "reason": "Hierarchical postselection" }, { "label": "fusion-based", "reason": "Photonic architecture target" }, { "label": "erasure tolerant", "reason": "Handles loss errors" } ], "emoji": "🔄", "social_summary": "Macromux postselection hits record $5.9\\%$ thresholds.", "highlights_oneliner": "High-Threshold Postselection" }, { "arxiv_id": "2603.05502", "title": "Universal quantum computation with group surface codes", "authors": "Naren Manjunath, Vieri Mattei, Apoorv Tiwari, Tyler D. Ellison", "arxiv_url": "https://arxiv.org/abs/2603.05502", "pdf_url": "https://arxiv.org/pdf/2603.05502", "summary": "Group surface codes generalize $\\mathbb{Z}_2$ surface with transversal classical gates. Elementary operations enable non-Clifford in $\\mathbb{Z}_2$ surface. ZX-calculus spacetime constructions.", "motivation": "Bravyi-König limits topological Clifford gates. Group extensions bypass restrictions.", "highlights": [ "Transversal classical gates", "Non-Clifford in $\\mathbb{Z}_2$", "ZX spacetime codes" ], "keywords": [ { "label": "group surface", "reason": "Generalized topological codes" }, { "label": "transversal AND", "reason": "Classical gate implementation" }, { "label": "ZX-calculus", "reason": "Spacetime construction" } ], "emoji": "🧬", "social_summary": "Group surface codes unlock universal topological QC.", "highlights_oneliner": "Group Surface Universality" }, { "arxiv_id": "2603.05428", "title": "Optimal Decoding with the Worm", "authors": "Zac Tobias, Nikolas P. Breuckmann, Benedikt Placke", "arxiv_url": "https://arxiv.org/abs/2603.05428", "pdf_url": "https://arxiv.org/pdf/2603.05428", "summary": "Worm MCMC computes logical error class probabilities for matchable qLDPC. Defect susceptibility bounds mixing time. Correlated decoding beats MWPM under depolarizing noise.", "motivation": "Optimal decoding needed beyond MWPM capacity. Matchable codes enable MCMC.", "highlights": [ "Optimal logical probabilities", "Defect susceptibility", "Correlated threshold boost" ], "keywords": [ { "label": "worm algorithm", "reason": "MCMC optimal decoder" }, { "label": "matchable qLDPC", "reason": "Targeted code class" }, { "label": "defect susceptibility", "reason": "Mixing time bound" } ], "emoji": "🐛", "social_summary": "Worm decoder optimally cracks matchable qLDPC codes.", "highlights_oneliner": "Worm Optimal Decoding" }, { "arxiv_id": "2603.05409", "title": "Recursive Magic State Distillation on the Surface Code", "authors": "Jonathan E. Moussa", "arxiv_url": "https://arxiv.org/abs/2603.05409", "pdf_url": "https://arxiv.org/pdf/2603.05409", "summary": "Recursive 15-to-1 distillation matches Clifford $O(d^3)$ spacetime prefactor. $d\\times3d$ $|T\\rangle$, $3d\\times2d$ $|CCZ\\rangle$ grids. Lower physical threshold required.", "motivation": "Magic distillation historically $1000\\times$ costlier than Clifford. Asymptotic parity needed.", "highlights": [ "Matching $O(d^3)$ prefactor", "Recursive 15-to-1", "Space-optimized grids" ], "keywords": [ { "label": "recursive distillation", "reason": "15-to-1 implementation" }, { "label": "surface code", "reason": "Lattice surgery target" }, { "label": "$CCZ$ states", "reason": "Toffoli resource" } ], "emoji": "🔮", "social_summary": "Recursive distillation equalizes magic/Clifford costs.", "highlights_oneliner": "Surface Recursive Distillation" }, { "arxiv_id": "2603.05381", "title": "Achieving Thresholds via Standalone Belief Propagation on Surface Codes", "authors": "Pedro Hack, Luca Menti, Francisco Lazaro, Alexandru Paler", "arxiv_url": "https://arxiv.org/abs/2603.05381", "pdf_url": "https://arxiv.org/pdf/2603.05381", "summary": "Decoding graph BP achieves surface code capacity thresholds under depolarizing noise. MWPM-compatible, hardware-accelerable. Matches MWPM performance.", "motivation": "Tanner BP lacks threshold; MWPM $O(n^3\\log n)$ too slow. Fast BP alternative needed.", "highlights": [ "Standalone BP threshold", "Decoding graph messages", "MWPM performance" ], "keywords": [ { "label": "decoding graph", "reason": "BP message-passing venue" }, { "label": "standalone BP", "reason": "No outer iterations needed" }, { "label": "graphlike CSS", "reason": "Surface code application" } ], "emoji": "🌐", "social_summary": "BP decoding hits surface code thresholds sans MWPM.", "highlights_oneliner": "Threshold BP Decoding" }, { "arxiv_id": "2603.05496", "title": "Mirror codes: High-threshold quantum LDPC codes beyond the CSS regime", "authors": "Andrey Boris Khesin, Jonathan Z. Lu", "arxiv_url": "https://arxiv.org/abs/2603.05496", "pdf_url": "https://arxiv.org/pdf/2603.05496", "summary": "Mirror codes: group $G$-parameterized non-CSS LDPC with weight-6 examples $[[60,4,10]]$. 1-6 ancilla SECs provably FT. $0.2\\%$ pseudothreshold matching BB code.", "motivation": "CSS dominates LDPC; non-CSS unexplored. Small-scale FT memory needed.", "highlights": [ "Non-CSS $[[60,4,10]]$", "$0.2\\%$ pseudothreshold", "6-ancilla FT SEC" ], "keywords": [ { "label": "mirror codes", "reason": "Non-CSS LDPC family" }, { "label": "group algebra", "reason": "Construction basis" }, { "label": "provable FT", "reason": "Syndrome extraction" } ], "emoji": "🔮", "social_summary": "Mirror codes break CSS monopoly with high thresholds.", "highlights_oneliner": "Non-CSS LDPC Codes" }, { "arxiv_id": "2603.05474", "title": "Spatiotemporal Pauli processes: Quantum combs for modelling correlated noise in quantum error correction", "authors": "John F Kam, Angus Southwell, Spiro Gicev, Muhammad Usman, Kavan Modi", "arxiv_url": "https://arxiv.org/abs/2603.05474", "pdf_url": "https://arxiv.org/pdf/2603.05474", "summary": "SPPs map non-Markovian dynamics to Pauli trajectories via multi-time twirling. TN-efficient, transfer diagnostics, HMM representations. Surface $d=19$ correlated simulations.", "motivation": "Pauli models ignore correlations bursting QEC. Microscopic bridging needed.", "highlights": [ "Pauli twirl combs", "TN-bounded bond dim", "Critical avalanche regime" ], "keywords": [ { "label": "SPP", "reason": "Spatiotemporal Pauli process" }, { "label": "process tensor", "reason": "Non-Markovian mapping" }, { "label": "quantum comb", "reason": "Process-separable rep" } ], "emoji": "🌪️", "social_summary": "SPPs model correlated QEC noise scalably.", "highlights_oneliner": "Correlated Noise SPPs" }, { "arxiv_id": "2603.05486", "title": "Improved Decoding of Quantum Tanner Codes Using Generalized Check Nodes", "authors": "Olai Å. Mostad, Eirik Rosnes, Hsuan-Yin Lin", "arxiv_url": "https://arxiv.org/abs/2603.05486", "pdf_url": "https://arxiv.org/pdf/2603.05486", "summary": "Generalized BP uses MAP on Tanner local codes outperforming BP4/Relay-BP. Beats comparable GB/LP codes. Cycle analysis explains gains.", "motivation": "qLDPC BP underperforms classical due to 4-cycles/degeneracy. Tanner structure exploitable.", "highlights": [ "Tanner MAP checks", "Outperforms GB codes", "4-cycle reduction" ], "keywords": [ { "label": "quantum Tanner", "reason": "Targeted code structure" }, { "label": "generalized BP", "reason": "MAP check processing" }, { "label": "local codes", "reason": "Exploited structure" } ], "emoji": "🔗", "social_summary": "Generalized BP unleashes Tanner code potential.", "highlights_oneliner": "Tanner Generalized BP" }, { "arxiv_id": "2603.05391", "title": "SpiderCat: Optimal Fault-Tolerant Cat State Preparation", "authors": "Andrey Boris Khesin, Sarah Meng Li, Boldizsár Poór, Benjamin Rodatz, John van de Wetering, Richie Yeung", "arxiv_url": "https://arxiv.org/abs/2603.05391", "pdf_url": "https://arxiv.org/pdf/2603.05391", "summary": "ZX-derived CNOT lower bounds for $t\\leq5$ FT CAT circuits. Optimal graphs for $n\\leq100$. Constant-depth $O(n)$ trade-off.", "motivation": "CAT preparation primitive expensive; heuristics unscalable. Formal bounds needed.", "highlights": [ "CNOT lower bounds", "$n=100$ optimal circuits", "Constant-depth $O(n)$" ], "keywords": [ { "label": "SpiderCat", "reason": "Optimal CAT circuits" }, { "label": "ZX-diagrams", "reason": "Fault-equivalent rewrites" }, { "label": "3-regular graphs", "reason": "Bound derivation" } ], "emoji": "🕷️", "social_summary": "SpiderCat optimally prepares fault-tolerant GHZ states.", "highlights_oneliner": "Optimal CAT Circuits" }, { "arxiv_id": "2603.04548", "title": "Transversal AND in Quantum Codes", "authors": "Christine Li, Lia Yeh", "arxiv_url": "https://arxiv.org/abs/2603.04548", "pdf_url": "https://arxiv.org/pdf/2603.04548", "summary": "$[[6,2,2]]$ qutrit code with transversal AND ($T$-count 3). CSS interpretation of symmetric $T$-depth circuits. Concatenates to $[[48,2,4]]$; qubit-qutrit protocols.", "motivation": "AND enables efficient qubit-on-qutrit simulation. Transversal implementation needed.", "highlights": [ "Transversal qutrit AND", "$[[6,2,2]]$-$[[48,2,4]]$", "Qubit subspace codes" ], "keywords": [ { "label": "qutrit AND", "reason": "Transversal non-Clifford" }, { "label": "CSS circuit", "reason": "Symmetric $T$-depth interp" }, { "label": "magic injection", "reason": "Mixed protocols" } ], "emoji": "🔀", "social_summary": "Transversal AND gates in qutrit quantum codes.", "highlights_oneliner": "Qutrit Transversal AND" }, { "arxiv_id": "2603.04564", "title": "Demonstrating Noise-adapted Quantum Error Correction With Break-Even Performance", "authors": "Vismay Joshi, Anubhab Rudra, Sourav Dutta, Siddharth Dhomkar, Prabha Mandayam", "arxiv_url": "https://arxiv.org/abs/2603.04564", "pdf_url": "https://arxiv.org/pdf/2603.04564", "summary": "Noise-adapted 3-qubit AD QEC on IBM shows break-even $T_1$. Variational encoding/decoding with block-encoding. CHaDD protects crosstalk.", "motivation": "General QEC overhead prohibitive; noise-tailored codes resource-light. Hardware validation needed.", "highlights": [ "Hardware break-even", "Multi-cycle $T_1$ extension", "Gain metric defined" ], "keywords": [ { "label": "amplitude-damping", "reason": "Targeted noise adaptation" }, { "label": "variational QEC", "reason": "Hardware-efficient circuits" }, { "label": "CHaDD", "reason": "Crosstalk protection" } ], "emoji": "🎯", "social_summary": "Break-even noise-adapted QEC on real IBM hardware.", "highlights_oneliner": "Hardware Break-Even QEC" }, { "arxiv_id": "2603.05492", "title": "Ansatz-Free Learning of Lindbladian Dynamics In Situ", "authors": "Petr Ivashkov, Nikita Romanov, Weiyuan Gong, Andi Gu, Hong-Ye Hu, Susanne F. Yelin", "arxiv_url": "https://arxiv.org/abs/2603.05492", "pdf_url": "https://arxiv.org/pdf/2603.05492", "summary": "Sample-efficient sparse Lindbladian learning without structure assumptions. Ancilla-free, product states, Pauli measurements. Near-optimal time resolution.", "motivation": "Coarse benchmarking insufficient; full Lindbladian needed for error mechanisms. Structure-free needed.", "highlights": [ "Ansatz-free sparse", "Near-optimal resolution", "Physically moderate conditioning" ], "keywords": [ { "label": "Lindbladian learning", "reason": "Generator identification" }, { "label": "Pauli twirl", "reason": "Multi-time protocol" }, { "label": "time resolution", "reason": "Lower bound proved" } ], "emoji": "🔬", "social_summary": "Learns device Lindbladians ansatz-free from data.", "highlights_oneliner": "Lindbladian Learning" }, { "arxiv_id": "2603.05156", "title": "Constant-Depth Quantum Imaginary Time Evolution Using Dynamic Fan-out Circuits", "authors": "Albert Lund, Erika Magnusson, Werner Dobrautz, Laura García-Álvarez", "arxiv_url": "https://arxiv.org/abs/2603.05156", "pdf_url": "https://arxiv.org/pdf/2603.05156", "summary": "Reduced-parameter QITE ansatz with dynamic fan-out achieves constant two-qubit depth. IBM hardware: semi-classical beats unitary. $65\\%$ error reduction projects favorably.", "motivation": "QITE depth/parameters limit ground-state prep. Dynamic circuits reduce depth.", "highlights": [ "Constant two-qubit depth", "Hardware dynamic variants", "Fidelity threshold analysis" ], "keywords": [ { "label": "dynamic fan-out", "reason": "Constant-depth QITE" }, { "label": "QITE ansatz", "reason": "Reduced parameters" }, { "label": "LAQCC", "reason": "Adaptive framework" } ], "emoji": "⏳", "social_summary": "Constant-depth QITE via dynamic fan-out circuits.", "highlights_oneliner": "Dynamic QITE" } ] }, "2026-03-05": { "word_cloud": [ { "word": "decoding", "weight": 5 }, { "word": "threshold", "weight": 4 }, { "word": "magic", "weight": 4 }, { "word": "transversal", "weight": 4 }, { "word": "atom-loss", "weight": 3 }, { "word": "stabilizer", "weight": 5 }, { "word": "surface", "weight": 3 }, { "word": "colour", "weight": 3 }, { "word": "distillation", "weight": 4 }, { "word": "non-additivity", "weight": 3 }, { "word": "MWPM", "weight": 4 }, { "word": "tensor-network", "weight": 3 }, { "word": "nonstabiliserness", "weight": 3 }, { "word": "mitigation", "weight": 4 }, { "word": "noise", "weight": 5 }, { "word": "Pauli", "weight": 3 }, { "word": "concatenation", "weight": 3 }, { "word": "polylog", "weight": 3 } ], "social_highlights": "Highlights: Colour code decoding NP-hard, optimal atom-loss correction, transversal gates via tensor networks, Pauli threshold non-additivity, polylog MWPM decoder.", "papers": [ { "arxiv_id": "2603.04234", "title": "Minimum Weight Decoding in the Colour Code is NP-hard", "authors": "Mark Walters, Mark L. Turner", "arxiv_url": "https://arxiv.org/abs/2603.04234", "pdf_url": "https://arxiv.org/pdf/2603.04234", "summary": "Proves that exact minimum weight decoding for colour codes is NP-hard, contrasting with polynomial-time solvable surface codes. Resolves uncertainty about efficient exact decoding despite structural similarities. Motivates development of heuristic and approximate decoding algorithms.", "motivation": "Colour codes promise reduced overhead for logical operations across qubit types compared to surface codes, but decoding complexity was unknown. This work clarifies fundamental computational limits, guiding practical quantum computing implementations.", "highlights": [ "Colour code decoding NP-hard", "No polynomial algorithm unless P=NP", "Motivates approximate decoders" ], "keywords": [ { "label": "colour code", "reason": "Central object proven NP-hard for decoding" }, { "label": "minimum weight decoding", "reason": "Core problem shown computationally hard" }, { "label": "NP-hardness", "reason": "Key complexity result contrasting surface code" }, { "label": "ZZ-checks", "reason": "Simplified noise model used in proof" } ], "emoji": "📚", "social_summary": "Proves colour code decoding NP-hard, unlike surface codes—time for approximate decoders!", "highlights_oneliner": "Colour decoding NP-hard" }, { "arxiv_id": "2603.04156", "title": "Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope", "authors": "Pengyu Liu, Shi Jie Samuel Tan, Eric Huang, Umut A. Acar, Hengyun Zhou, Chen Zhao", "arxiv_url": "https://arxiv.org/abs/2603.04156", "pdf_url": "https://arxiv.org/pdf/2603.04156", "summary": "Introduces Pauli Envelope framework for atom-loss error correction in neutral-atom quantum computers. Designs Mid-SWAP syndrome extraction and Envelope-MLE/Envelope-Matching decoders achieving near-optimal $d_\\text{loss} \\sim d$. Shows 40% higher thresholds via simulations.", "motivation": "Atom loss dominates errors (>40%) in neutral-atom systems, challenging standard Pauli-based QEC. Provides provably optimal, efficient solutions addressing nonlinearity and correlations.", "highlights": [ "$d_\\text{loss} \\sim d$ optimal decoder", "Pauli Envelope framework", "40% threshold improvement" ], "keywords": [ { "label": "Pauli Envelope", "reason": "Novel framework bounding atom-loss effects" }, { "label": "atom-loss", "reason": "Primary error source targeted (>40% errors)" }, { "label": "Mid-SWAP", "reason": "New syndrome extraction circuit" }, { "label": "Envelope-MLE", "reason": "Optimal MILP decoder" } ], "emoji": "⚙️", "social_summary": "Optimal atom-loss correction achieves full code distance in neutral-atom quantum computers.", "highlights_oneliner": "Optimal atom-loss decoding" }, { "arxiv_id": "2603.03542", "title": "Quantum Lego Power-up: Designing Transversal Gates with Tensor Networks", "authors": "ChunJun Cao, Brad Lackey", "arxiv_url": "https://arxiv.org/abs/2603.03542", "pdf_url": "https://arxiv.org/pdf/2603.03542", "summary": "Uses quantum lego tensor network framework to construct codes with addressable transversal non-Clifford gates. Builds finite-rate families supporting $T$, $CCZ$, $SH$, $K_3$ gates. Demonstrates heterogeneous holographic codes with transversal $CZ$ gates.", "motivation": "Transversal gates offer simple fault-tolerance but hard to design for non-Cliffords beyond stabilizer/CSS. Tensor networks enable systematic construction overcoming these limitations.", "highlights": [ "Transversal non-Clifford gates", "Quantum lego code construction", "Addressable $T$, $CCZ$ families" ], "keywords": [ { "label": "quantum lego", "reason": "Framework enabling transversal gate design" }, { "label": "transversal gates", "reason": "Core achievement for non-Cliffords" }, { "label": "tensor networks", "reason": "Method overcoming stabilizer limitations" }, { "label": "holographic codes", "reason": "New constructions with $CZ$ gates" } ], "emoji": "🧱", "social_summary": "Tensor networks build codes with transversal T and CCZ gates using quantum lego framework.", "highlights_oneliner": "Transversal gates via lego" }, { "arxiv_id": "2603.04357", "title": "On Error Thresholds for Pauli Channels: Some answers with many more questions", "authors": "Avantika Agarwal, Alan Bu, Amolak Ratan Kalra, Debbie Leung, Luke Schaeffer, Graeme Smith", "arxiv_url": "https://arxiv.org/abs/2603.04357", "pdf_url": "https://arxiv.org/pdf/2603.04357", "summary": "Computes numerical lower bounds on Pauli channel thresholds using coset weight enumerators. Finds significant non-additivity in small concatenated stabilizer codes. Shows repetition code concatenations degrade with length.", "motivation": "Quantum channel capacities remain open; non-additivity challenges hashing bound expectations. Quantifies when small codes beat random hashing, informing code design.", "highlights": [ "New non-additive concatenations", "Repetition codes degrade", "Coset enumerator bounds" ], "keywords": [ { "label": "non-additivity", "reason": "Key phenomenon enabling threshold gains" }, { "label": "coset weight enumerators", "reason": "Analytic framework for bounds" }, { "label": "concatenated codes", "reason": "Structures showing non-additivity" }, { "label": "repetition codes", "reason": "Surprisingly strong performers" } ], "emoji": "⚡", "social_summary": "Reveals non-additive Pauli thresholds: small codes beat random hashing bounds.", "highlights_oneliner": "Pauli threshold non-additivity" }, { "arxiv_id": "2603.03776", "title": "Overflow-Safe Polylog-Time Parallel Minimum-Weight Perfect Matching Decoder: Toward Experimental Demonstration", "authors": "Ryo Mikami, Hayata Yamasaki", "arxiv_url": "https://arxiv.org/abs/2603.03776", "pdf_url": "https://arxiv.org/pdf/2603.03776", "summary": "Develops overflow-safe polylog-time parallel MWPM decoder using truncated polynomial rings. Reduces bit length >99.9% via optimizations while preserving scaling. Enables experimental demonstration in early-FTQC.", "motivation": "MWPM decoders limit FTQC time overhead; polylog methods promised speedup but impractical bit lengths. Makes asymptotic theory experimentally viable.", "highlights": [ "Polylog parallel MWPM", ">99.9% bit length reduction", "Overflow-safe implementation" ], "keywords": [ { "label": "MWPM decoder", "reason": "Targeted for polylog speedup" }, { "label": "polylog-time", "reason": "Achieved asymptotic scaling" }, { "label": "truncated polynomial ring", "reason": "Overflow-safe arithmetic" }, { "label": "determinant-based", "reason": "Fast parallel algorithm" } ], "emoji": "🕒", "social_summary": "Overflow-safe polylog MWPM decoder cuts bit needs 99.9%, ready for experiment.", "highlights_oneliner": "Polylog MWPM decoder" }, { "arxiv_id": "2603.04148", "title": "Non-local nonstabiliserness in Gluon and Graviton Scattering", "authors": "John Gargalionis, Nathan Moynihan, Michael L. Reichenberg Ashby, Ewan N. V. Wallace, Chris D. White, Martin J. White", "arxiv_url": "https://arxiv.org/abs/2603.04148", "pdf_url": "https://arxiv.org/pdf/2603.04148", "summary": "Computes basis-independent non-local nonstabiliserness (magic) for gluon/graviton scattering. Shows helicity basis manifests non-local magic for polarized beams. Breaks under Yang-Mills extensions.", "motivation": "Magic quantification motivates fault-tolerant algorithms; particle scattering tests quantum info measures. Validates helicity basis physically.", "highlights": [ "Non-local magic analytics", "Helicity basis optimal", "New physics breaks magic" ], "keywords": [ { "label": "non-local nonstabiliserness", "reason": "Basis-independent magic measure" }, { "label": "gluon scattering", "reason": "Primary system studied" }, { "label": "helicity basis", "reason": "Physically motivated optimum" }, { "label": "graviton", "reason": "Highest spin case" } ], "emoji": "✨", "social_summary": "Quantifies magic in gluon/graviton scattering using basis-independent non-local measure.", "highlights_oneliner": "Scattering non-local magic" }, { "arxiv_id": "2603.03925", "title": "Resource State Distillation via Stabilizer Channels", "authors": "Christopher Popp, Tobias C. Sutter, Beatrix C. Hiesmayr", "arxiv_url": "https://arxiv.org/abs/2603.03925", "pdf_url": "https://arxiv.org/pdf/2603.03925", "summary": "Formulates stabilizer distillation as channels with closed-form outputs for prime dimensions. Develops gF-IMAX, (S)CI-IMAX protocols optimizing fidelity/information measures. Reduces optimization complexity via invariances.", "motivation": "Stabilizer methods excel at entanglement but underdeveloped for key distillation. Unified framework enables broad resource tasks.", "highlights": [ "Stabilizer channel formalism", "IMAX optimization protocols", "Prime-dimension closed forms" ], "keywords": [ { "label": "stabilizer channels", "reason": "Unified distillation framework" }, { "label": "resource distillation", "reason": "Broadens beyond entanglement" }, { "label": "IMAX protocols", "reason": "Information-optimized methods" }, { "label": "prime dimension", "reason": "Enables field operations" } ], "emoji": "💊", "social_summary": "Stabilizer channels distill entanglement and private states with optimized protocols.", "highlights_oneliner": "Stabilizer distillation channels" }, { "arxiv_id": "2603.04310", "title": "Magic state distillation with permutation-invariant codes and a two-qubit example", "authors": "Heather Leitch, Yingkai Ouyang", "arxiv_url": "https://arxiv.org/abs/2603.04310", "pdf_url": "https://arxiv.org/pdf/2603.04310", "summary": "Develops distillation using permutation-invariant gnu codes as small as 2 qubits. Achieves 0.5 threshold, 1/2 rate surpassing prior schemes. Distills arbitrary magic via non-Clifford protocol.", "motivation": "Standard distillation incurs high qubit overhead; small codes typically useless. Enables base-layer enhancement of existing protocols.", "highlights": [ "2-qubit distillation (0.5 threshold)", "Arbitrary magic states", "Permutation-invariant codes" ], "keywords": [ { "label": "gnu codes", "reason": "Permutation-invariant family used" }, { "label": "2-qubit distillation", "reason": "Surprisingly effective small code" }, { "label": "magic states", "reason": "Targeted resource" }, { "label": "0.5 threshold", "reason": "Leading error suppression" } ], "emoji": "✨", "social_summary": "2-qubit codes distill magic states at 0.5 threshold, beating prior schemes.", "highlights_oneliner": "2-qubit magic distillation" }, { "arxiv_id": "2603.04339", "title": "Quantum error mitigation by hierarchy-informed sampling: chiral dynamics in the Schwinger model", "authors": "Theo Saporiti, Oleg Kaikov, Vasily Sazonov, Mohamed Tamaazousti", "arxiv_url": "https://arxiv.org/abs/2603.04339", "pdf_url": "https://arxiv.org/pdf/2603.04339", "summary": "Uses polynomial BBGKY hierarchy subset for physics-informed error mitigation sampling. Applies to Schwinger model CME simulations showing noise reduction scaling with constraints. Polynomial resource overhead for favorable Hamiltonians.", "motivation": "NISQ simulations noise-limited; physics knowledge underused in mitigation. Enables real-time dynamics beyond classical reach.", "highlights": [ "BBGKY hierarchy mitigation", "Schwinger CME recovery", "Polynomial resource scaling" ], "keywords": [ { "label": "BBGKY hierarchy", "reason": "Physics-informed sampling criterion" }, { "label": "Schwinger model", "reason": "Testbed for chiral dynamics" }, { "label": "hierarchy-informed", "reason": "Uses partial constraints effectively" }, { "label": "CME", "reason": "Chiral magnetic effect target" } ], "emoji": "🪄", "social_summary": "BBGKY hierarchy mitigates NISQ noise in Schwinger model chiral dynamics.", "highlights_oneliner": "BBGKY error mitigation" }, { "arxiv_id": "2603.03639", "title": "Mitigating many-body quantum crosstalk with tensor-network robust control", "authors": "Nguyen H. Le, Florian Mintert, Eran Ginossar", "arxiv_url": "https://arxiv.org/abs/2603.03639", "pdf_url": "https://arxiv.org/pdf/2603.03639", "summary": "Combines tensor networks + GRAPE for robust control suppressing many-body crosstalk. Achieves order-of-magnitude fidelity gains for 50-qubit gates, 30-GHZ, 20-Heisenberg states. Scales to system sizes via efficient sampling.", "motivation": "Crosstalk scales exponentially, overwhelming calibration; unknown strengths challenge control. Enables reliable large-scale operations.", "highlights": [ "50-qubit parallel gates", "Tensor-GRAPE robust control", "Order-of-magnitude fidelity gain" ], "keywords": [ { "label": "quantum crosstalk", "reason": "Primary error source targeted" }, { "label": "tensor-network control", "reason": "Scales many-body optimization" }, { "label": "GRAPE algorithm", "reason": "Robust optimal control method" }, { "label": "50-qubit gates", "reason": "Large-scale demonstration" } ], "emoji": "🔄", "social_summary": "Tensor networks + GRAPE suppress crosstalk for 50-qubit gates with huge fidelity gains.", "highlights_oneliner": "Crosstalk robust control" }, { "arxiv_id": "2603.03426", "title": "Bayesian post-correction of non-Markovian errors in multi-mode bosonic gravimetry", "authors": "Bharath Hebbe Madhusudhana, Andrew Harter, Avadh Saxena", "arxiv_url": "https://arxiv.org/abs/2603.03426", "pdf_url": "https://arxiv.org/pdf/2603.03426", "summary": "Bayesian post-correction recovers Heisenberg scaling $F_\\text{eff}=O(N^2)$ for non-Markovian inhomogeneity when $L\\geq\\ell+2$. Saturates at low modes; Haar states generically optimal. Proposes Loschmidt echo protocol.", "motivation": "Entangled sensors fragile to noise; quantum advantage requires scalable error handling. Bridges sensing and non-Hermitian dynamics.", "highlights": [ "Heisenberg scaling recovery", "$L\\geq\\ell+2$ condition", "Haar states optimal" ], "keywords": [ { "label": "non-Markovian errors", "reason": "Targeted noise type" }, { "label": "Bayesian post-correction", "reason": "Recovery method" }, { "label": "bosonic gravimetry", "reason": "Application domain" }, { "label": "effective Fisher", "reason": "Precision metric" } ], "emoji": "⚖️", "social_summary": "Bayesian correction recovers Heisenberg gravimetry scaling against non-Markovian noise.", "highlights_oneliner": "Gravimetry error correction" }, { "arxiv_id": "2603.03853", "title": "Towards Practical Quantum Federated Learning: Enhancing Efficiency and Noise Tolerance", "authors": "Suzukaze Kamei, Hideaki Kawaguchi, Takahiko Satoh", "arxiv_url": "https://arxiv.org/abs/2603.03853", "pdf_url": "https://arxiv.org/pdf/2603.03853", "summary": "Analyzes QFL communication-convergence-noise tradeoffs with light-cone reduction and Hybrid QFL. Shows decentralized aggregation noise-resilient; Steane code restores high-noise learning. Reduces transmissions from $3NMP$ to hybrid scaling.", "motivation": "Classical FL vulnerable to leakage; quantum secure aggregation overhead/noise-limited. Enables practical privacy-preserving distributed learning.", "highlights": [ "Hybrid QFL architecture", "Light-cone parameter reduction", "Steane code noise resilience" ], "keywords": [ { "label": "Quantum FL", "reason": "Secure distributed learning" }, { "label": "Hybrid QFL", "reason": "Communication reduction strategy" }, { "label": "light-cone selection", "reason": "Structured parameter reduction" }, { "label": "Steane code", "reason": "High-noise correction" } ], "emoji": "🤝", "social_summary": "Hybrid quantum federated learning cuts communication while beating noise with Steane codes.", "highlights_oneliner": "Practical quantum FL" } ] }, "2026-03-04": { "word_cloud": [ { "word": "entanglement-assisted", "weight": 5 }, { "word": "stabilizer", "weight": 5 }, { "word": "erasure", "weight": 4 }, { "word": "cat", "weight": 4 }, { "word": "toric", "weight": 4 }, { "word": "holonomic", "weight": 4 }, { "word": "scars", "weight": 4 }, { "word": "decoder", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "telecorrection", "weight": 3 }, { "word": "lattice", "weight": 3 }, { "word": "gauge", "weight": 3 }, { "word": "Zeno", "weight": 3 }, { "word": "degeneracy", "weight": 2 }, { "word": "sublattice", "weight": 2 }, { "word": "pseudo-threshold", "weight": 3 }, { "word": "feedback", "weight": 2 } ], "social_highlights": "Highlights: entanglement-assisted codes beyond stabilizers, stabilizer scars in lattice gauge theory, all-optical cat correction, fault-tolerant holonomic gates, high-threshold toric decoder.", "papers": [ { "arxiv_id": "2603.03182", "title": "Entanglement-Assisted Codes Outside the Stabilizer Framework", "authors": "Jaszmine DeFranco, Andrew Nemec", "arxiv_url": "https://arxiv.org/abs/2603.03182", "pdf_url": "https://arxiv.org/pdf/2603.03182", "summary": "Constructs entanglement-assisted codes from arbitrary quantum codes using correctable subsets for erasure channels. Shows receiver's share compression in degenerate codes. Introduces permutation-invariant and XP-stabilizer EA codes outside stabilizer/CWS frameworks.", "motivation": "Quantum error correction has relied heavily on stabilizer formalism since Shor's code, limiting EA code constructions. Generalizing beyond stabilizers enables broader applications in quantum communication and computation using shared entanglement.", "highlights": [ "EA codes from any quantum code", "Degeneracy enables receiver compression", "First non-stabilizer PI/XP EA codes" ], "keywords": [ { "label": "entanglement-assisted", "reason": "core construction method using shared ebits" }, { "label": "erasure channels", "reason": "links correctable subsets to bipartite states" }, { "label": "code degeneracy", "reason": "enables receiver share compression" }, { "label": "XP-stabilizer", "reason": "new EA code family introduced" } ], "emoji": "🔗", "social_summary": "Unlocks entanglement-assisted codes from ANY quantum code, beyond stabilizers!", "highlights_oneliner": "EA codes beyond stabilizers" }, { "arxiv_id": "2603.03062", "title": "Exact stabilizer scars in two-dimensional $U(1)$ lattice gauge theory", "authors": "Sabhyata Gupta, Piotr Sierant, Luis Santos, Paolo Stornati", "arxiv_url": "https://arxiv.org/abs/2603.03062", "pdf_url": "https://arxiv.org/pdf/2603.03062", "summary": "Identifies sublattice scars as exact stabilizer eigenstates in Rokhsar-Kivelson $U(1)$ lattice gauge theory from gauge-invariant zero modes. Shows vanishing stabilizer Rényi entropy with structured entanglement. Constructs Clifford circuits for state preparation.", "motivation": "Quantum many-body scars challenge thermalization expectations in constrained systems like lattice gauge theories. Connecting scars to stabilizer structure reveals non-ergodic dynamics and efficient simulation methods.", "highlights": [ "Exact stabilizer scars in $U(1)$ LGT", "Vanishing stabilizer Rényi entropy", "Clifford circuits for scar preparation" ], "keywords": [ { "label": "stabilizer scars", "reason": "exact eigenstates despite non-stabilizer Hamiltonian" }, { "label": "lattice gauge", "reason": "constrained Hilbert space enables scars" }, { "label": "Rokhsar-Kivelson", "reason": "paradigmatic model studied" }, { "label": "sublattice scars", "reason": "new class from gauge zero modes" } ], "emoji": "🧭", "social_summary": "Discovers exact stabilizer scars in 2D lattice gauge theory defying thermalization!", "highlights_oneliner": "Stabilizer scars in LGT" }, { "arxiv_id": "2603.03263", "title": "Generalised All-Optical Cat Correction", "authors": "Ari John Boon, Olivier Landon-Cardinal, Nicolás Quesada", "arxiv_url": "https://arxiv.org/abs/2603.03263", "pdf_url": "https://arxiv.org/pdf/2603.03263", "summary": "Generalizes all-optical telecorrection to higher-order cat codes, achieving 70x fewer iterations for 99.9% fidelity at 1dB loss. Introduces probabilistic deformation correction enabling basis changes. Higher orders trade photon number for performance.", "motivation": "Cat codes enable hardware-efficient quantum memories but require efficient correction of photon loss. All-optical telecorrection reduces overhead but needs scaling to higher code orders for practical performance.", "highlights": [ "70x fewer iterations with 3rd-order cats", "Probabilistic deformation correction", "99.9% fidelity at 1dB loss" ], "keywords": [ { "label": "cat codes", "reason": "higher-order generalization focus" }, { "label": "telecorrection", "reason": "all-optical protocol extension" }, { "label": "deformation correction", "reason": "new probabilistic scheme" } ], "emoji": "🐱", "social_summary": "Higher-order cat codes slash telecorrection iterations by 70x for lossy channels!", "highlights_oneliner": "Cat telecorrection scaled" }, { "arxiv_id": "2603.02552", "title": "Steering paths mid-flight for fault-tolerance in measurement-based holonomic gates", "authors": "Anirudh Lanka, Juan Garcia-Nila, Todd A. Brun", "arxiv_url": "https://arxiv.org/abs/2603.02552", "pdf_url": "https://arxiv.org/pdf/2603.02552", "summary": "Introduces fault-tolerant measurement-based holonomic gates with real-time feedback steering. Suppresses non-Markovian noise via Zeno effect; decodes Markovian errors to steer paths mid-flight. Corrects non-adiabatic measurement-induced errors.", "motivation": "Holonomic quantum computation offers geometric robustness but struggles with Eastin-Knill theorem limitations. Measurement-based holonomics need fault-tolerance against decoherence during continuous gate execution.", "highlights": [ "Mid-flight path steering via feedback", "Zeno suppression of non-Markovian noise", "Markovian error decoding/correction" ], "keywords": [ { "label": "holonomic gates", "reason": "geometric phase computation framework" }, { "label": "path steering", "reason": "real-time fault-tolerant correction" }, { "label": "quantum Zeno", "reason": "suppresses non-Markovian decoherence" }, { "label": "measurement-based", "reason": "continuous measurement protocol" } ], "emoji": "⚡", "social_summary": "Steers holonomic quantum gates mid-flight for true fault-tolerance!", "highlights_oneliner": "Fault-tolerant holonomics" }, { "arxiv_id": "2603.02328", "title": "Local decoder for the toric code with a high pseudo-threshold", "authors": "Louis Paletta", "arxiv_url": "https://arxiv.org/abs/2603.02328", "pdf_url": "https://arxiv.org/pdf/2603.02328", "summary": "Proposes 2D signal-rule local decoder for toric code treating odd-parity stabilizers as defects exchanging binary signals. Achieves exponential logical error suppression with optimal scaling. Halves threshold gap with state-of-the-art decoders.", "motivation": "Centralized decoding imposes hardware bottlenecks for real-time QEC. Local decoders enable distributed architectures but previously showed suboptimal thresholds and scaling for topological codes.", "highlights": [ "2D signal-rule local decoder", "Halves threshold gap vs. SOTA", "Optimal experimental scaling" ], "keywords": [ { "label": "local decoder", "reason": "distributed real-time architecture" }, { "label": "toric code", "reason": "topological code application" }, { "label": "pseudo-threshold", "reason": "exponential error suppression metric" }, { "label": "signal-rule", "reason": "defect attraction mechanism" } ], "emoji": "📚", "social_summary": "Local toric code decoder halves threshold gap, enables 2D quantum memory!", "highlights_oneliner": "High-threshold local decoder" } ] }, "2026-03-03": { "word_cloud": [ { "word": "Floquet", "weight": 5 }, { "word": "Stairway", "weight": 4 }, { "word": "Bicycle", "weight": 4 }, { "word": "Magic", "weight": 5 }, { "word": "Phase", "weight": 4 }, { "word": "Transition", "weight": 4 }, { "word": "Hook", "weight": 5 }, { "word": "Surface", "weight": 4 }, { "word": "Syndrome", "weight": 4 }, { "word": "Surgery", "weight": 4 }, { "word": "Hypergraph", "weight": 4 }, { "word": "Drift", "weight": 4 }, { "word": "Recalibration", "weight": 3 }, { "word": "Neutral", "weight": 4 }, { "word": "Atom", "weight": 4 }, { "word": "Continuous", "weight": 4 }, { "word": "Parity", "weight": 3 }, { "word": "ZX", "weight": 3 }, { "word": "Threshold", "weight": 3 } ], "papers": [ { "arxiv_id": "2603.00228", "title": "Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond", "authors": "Shoham Jacoby, Alex Retzker, Fernando Pastawski", "arxiv_url": "https://arxiv.org/abs/2603.00228", "pdf_url": "https://arxiv.org/pdf/2603.00228", "summary": "Introduces Stairway codes, high-rate Floquet protocols derived from Abelian two-block group algebra codes including bivariate bicycle codes, using foliated ZX-calculus networks. Decomposes weight-$w$ stabilizers into periodic pairwise measurements by rotating the time axis in space-time lattices. Achieves competitive encoding rates, high thresholds, and matches semi-hyperbolic Floquet codes' performance with under 300 physical qubits.", "motivation": "Floquet codes enable fault-tolerant protocols via periodic measurements without unitary entangling gates, but few achieve both high encoding rates and thresholds. Stairway codes address this gap by Floquetifying existing high-rate codes, offering efficient hardware implementations.", "highlights": [ "High-rate Floquet codes from bicycle codes", "<300 qubits match larger semi-hyperbolic codes", "ZX-calculus enables pairwise measurement decomposition" ], "keywords": [ { "label": "Stairway codes", "reason": "Novel Floquet code family from group algebra codes" }, { "label": "ZX-calculus", "reason": "Foliated networks for stabilizer decomposition" }, { "label": "Bivariate bicycle", "reason": "Floquetified for high-rate protocols" }, { "label": "Hook errors", "reason": "Analyzed in pairwise measurement compilation" } ] }, { "arxiv_id": "2603.00235", "title": "Theory of Magic Phase Transitions in Encoding-Decoding Circuits", "authors": "Piotr Sierant, Xhek Turkeshi", "arxiv_url": "https://arxiv.org/abs/2603.00235", "pdf_url": "https://arxiv.org/pdf/2603.00235", "summary": "Provides comprehensive theory of magic phase transitions in encoding-decoding circuits, showing behavior dictated by measurement protocols. Post-selected syndromes inherit error-resilience transition universality, surviving even random Haar encoders. Born-rule sampling introduces fluctuations altering criticality, revealing magic transitions as manifestations of error-resilience thresholds.", "motivation": "Magic resources enable universal quantum computation but interact complexly with errors, showing conflicting universality in prior empirical studies. Resolves ambiguities by linking magic transitions to error-resilience mechanisms.", "highlights": [ "Magic follows error-resilience universality", "Survives Haar random encoders", "Born-rule alters criticality via fluctuations" ], "keywords": [ { "label": "Magic phase transitions", "reason": "Links nonstabilizerness to error-resilience" }, { "label": "Encoding-decoding circuits", "reason": "Framework for magic/error interplay" }, { "label": "Stabilizer Rényi entropy", "reason": "Quantifies magic onset with fidelity" }, { "label": "Haar encoders", "reason": "Universal behavior beyond Cliffords" } ] }, { "arxiv_id": "2603.01628", "title": "No More Hooks in the Surface Code: Distance-Preserving Syndrome Extraction for Arbitrary Layouts at Minimum Depth", "authors": "Yuga Hirai, Shota Ikari, Yosuke Ueno, Yasunari Suzuki", "arxiv_url": "https://arxiv.org/abs/2603.01628", "pdf_url": "https://arxiv.org/pdf/2603.01628", "summary": "Proposes ZX interleaving syndrome extraction preserving full fault distance $d$ for any regular surface-code layout at minimum depth of four CNOT layers. Interleaves Z/X stabilizer tiles to shorten and eliminate hook-error edges in decoding graphs. Simulations confirm $d$ distance versus $d-1$ for prior minimum-depth methods.", "motivation": "Hook errors reduce surface code fault distance during logical operations, degrading thresholds despite experimental QEC progress. Existing solutions add depth or require simultaneous measurements/CNOTs, introducing overheads.", "highlights": [ "Full distance $d$ at minimum depth", "ZX interleaving eliminates hooks", "Works for arbitrary regular layouts" ], "keywords": [ { "label": "Hook errors", "reason": "Eliminated via ZX interleaving" }, { "label": "ZX interleaving", "reason": "Distance-preserving syndrome extraction" }, { "label": "Surface code", "reason": "Arbitrary layouts at 4-layer depth" }, { "label": "Fault distance", "reason": "Preserves $d$ under depolarizing noise" } ] }, { "arxiv_id": "2603.02157", "title": "Constant-Time Surgery on 2D Hypergraph Product Codes with Near-Constant Space Overhead", "authors": "Kathleen Chang, Zhiyang He, Theodore J. Yoder, Guanyu Zhu, Tomas Jochym-O'Connor", "arxiv_url": "https://arxiv.org/abs/2603.02157", "pdf_url": "https://arxiv.org/pdf/2603.02157", "summary": "Constructs surgery gadgets for parallel logical measurements on 2D hypergraph product codes in $O(1)$ time and $\\tilde{O}(1)$ space overhead via amortization. Combines surgery flexibility with transversal gate efficiency for fault-tolerant qLDPC computation. Enables fast logical operations suitable for near-term experiments.", "motivation": "Surgery provides low-overhead logical operations on qLDPC codes but suffers $O(d)$ time bottlenecks. Constant-time gadgets with minimal space address this for practical fault-tolerant computation.", "highlights": [ "$O(1)$ time surgery via amortization", "$\\tilde{O}(1)$ space for 2D hypergraph codes", "Combines surgery and transversal strengths" ], "keywords": [ { "label": "Surgery gadgets", "reason": "Constant-time logical measurements" }, { "label": "Hypergraph product", "reason": "2D codes with parallel operations" }, { "label": "qLDPC", "reason": "Low-overhead fault-tolerant computation" } ] }, { "arxiv_id": "2603.00837", "title": "ReloQate: Transient Drift Detection and In-Situ Recalibration in Surface Code Quantum Error Correction", "authors": "Maxwell Poster, Jason Chadwick, Jonathan Mark Baker", "arxiv_url": "https://arxiv.org/abs/2603.00837", "pdf_url": "https://arxiv.org/pdf/2603.00837", "summary": "Uses detector fire rate to predict logical error rates in real-time for surface codes, enabling conservative drift detection. Pairs with patch-based remapping to fresh tiles during recalibration of drifted regions. Demonstrates spatial efficiency scaling favorably with code distance.", "motivation": "Real hardware shows temporal/spatial noise drift unaccounted by standard QEC assuming uniform rates. Enables practical continuous operation via real-time mitigation.", "highlights": [ "DFR predicts LER without characterization", "Remapping for in-situ recalibration", "Efficient for small code distances" ], "keywords": [ { "label": "Drift detection", "reason": "Real-time LER prediction via DFR" }, { "label": "ReloQate", "reason": "Tile remapping for recalibration" }, { "label": "Detector fire rate", "reason": "Maps to logical error rates" }, { "label": "Surface code", "reason": "Handles temporal noise variation" } ] }, { "arxiv_id": "2603.01612", "title": "Sustaining high-fidelity quantum logic in neutral-atom circuits via mid-circuit operations", "authors": "Rui Lin, You Li, Le-Tian Zheng, Tai-Ran Hu, Si-Yuan Chen, Hong-Ming Wu, Yu-Chen Zhang, Hao-Wen Cheng, Yu-Hao Deng, Zhan Wu, Ming-Cheng Chen, Jun Rui, Chao-Yang Lu, Jian-Wei Pan", "arxiv_url": "https://arxiv.org/abs/2603.01612", "pdf_url": "https://arxiv.org/pdf/2603.01612", "summary": "Demonstrates 99.81% fidelity two-qubit gates in neutral atoms via mid-circuit Raman cooling and qubit reinitialization. Maintains ~99.8% gate fidelity across multiple rounds without degradation. Manages internal/motional entropy for continuous syndrome extraction.", "motivation": "Neutral-atom arrays show high-fidelity gates but suffer cumulative heating/loss in deep circuits below error-correction thresholds. Provides sustainable framework for fault-tolerant operation.", "highlights": [ "99.81% fidelity via erasure detection", "~99.8% sustained across rounds", "Mid-circuit cooling/reinitialization" ], "keywords": [ { "label": "Neutral atoms", "reason": "Sustainable high-fidelity logic" }, { "label": "Mid-circuit operations", "reason": "Raman cooling and reinitialization" }, { "label": "Motional entropy", "reason": "Active management for deep circuits" }, { "label": "Syndrome extraction", "reason": "Continuous cycles enabled" } ] }, { "arxiv_id": "2603.02106", "title": "Obstacles to Continuous Quantum Error Correction via Parity Measurements", "authors": "Anton Halaski, Christiane P. Koch", "arxiv_url": "https://arxiv.org/abs/2603.02106", "pdf_url": "https://arxiv.org/pdf/2603.02106", "summary": "Shows continuous parity measurements corrupt logical information due to two-body coupling approximations lacking native three-body interactions. Backaction cannot simultaneously protect logical/error subspaces in cQED platforms. Advocates three-body interactions or erasure encodings.", "motivation": "Continuous QEC essential for time-dependent Hamiltonians like adiabatic computing, requiring continuous syndrome measurements. Reveals fundamental limitations of parity protocols.", "highlights": [ "Two-body approximations corrupt logic", "Backaction hits both subspaces", "Needs native three-body couplings" ], "keywords": [ { "label": "Continuous QEC", "reason": "Limitations of parity measurements" }, { "label": "Three-body interactions", "reason": "Required for true continuous syndrome" }, { "label": "Measurement backaction", "reason": "Corrupts logical/error subspaces" }, { "label": "cQED platform", "reason": "Two-body coupling failures" } ] } ] }, "2026-03-02": { "word_cloud": [ { "word": "bosonic", "weight": 5 }, { "word": "GKP", "weight": 5 }, { "word": "NP", "weight": 5 }, { "word": "loss-dephasing", "weight": 4 }, { "word": "performance", "weight": 4 }, { "word": "Fradkin-Shenker", "weight": 5 }, { "word": "QED_3", "weight": 4 }, { "word": "self-duality", "weight": 4 }, { "word": "multicritical", "weight": 4 }, { "word": "toric-rotor", "weight": 5 }, { "word": "XY", "weight": 4 }, { "word": "resilience", "weight": 4 }, { "word": "stiffness", "weight": 3 }, { "word": "phase", "weight": 3 }, { "word": "transition", "weight": 3 }, { "word": "noise", "weight": 3 }, { "word": "CFT", "weight": 3 }, { "word": "lattice", "weight": 3 } ], "papers": [ { "arxiv_id": "2602.24102", "title": "Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes", "authors": "Kai-Xuan Wen, Dong-Long Hu, Shengyong Li, Ze-Liang Xiang", "arxiv_url": "https://arxiv.org/abs/2602.24102", "pdf_url": "https://arxiv.org/pdf/2602.24102", "summary": "Estimates quantitative performance boundary between GKP and NP bosonic codes under general photon loss-dephasing noise by optimizing code parameters. Identifies noise regimes where each code exhibits fundamental advantage, with crossover when dephasing strength is $\\approx 10^{-2}$ times loss strength. Establishes extensible methodology for benchmarking bosonic codes in realistic noise environments.", "motivation": "Bosonic QEC codes like GKP and NP have distinct symmetries making them resilient to different noise types, but comparative performance under combined loss-dephasing remained unclear. This work provides experimental guidance for selecting optimal encodings and parameters in realistic CV platforms.", "highlights": [ "Performance boundary: dephasing $\\ll 10^{-2} \\times$ loss", "GKP excels in loss-dominated, NP in dephasing-dominated regimes", "CMA-ES optimization framework for bosonic code parameters" ], "keywords": [ { "label": "GKP codes", "reason": "Translational symmetry protects against displacement errors from photon loss" }, { "label": "NP codes", "reason": "Number-phase lattice robust against phase rotations from dephasing" }, { "label": "loss-dephasing noise", "reason": "General noise model combining dominant CV decoherence channels" }, { "label": "CMA-ES optimization", "reason": "Scalable parameter optimization framework for bosonic encodings" } ] }, { "arxiv_id": "2602.23420", "title": "From QED$_3$ to Self-Dual Multicriticality in the Fradkin-Shenker Model", "authors": "Thomas T. Dumitrescu, Pierluigi Niro, Ryan Thorngren", "arxiv_url": "https://arxiv.org/abs/2602.23420", "pdf_url": "https://arxiv.org/pdf/2602.23420", "summary": "Maps staggered Fradkin-Shenker $\\mathbb{Z}_2$ gauge-Higgs model to QED$_3$ with $N_f=2$ Dirac fermions and charge-two Higgs. Proposes multicritical CFT with $(O(2)_e \\times O(2)_m)\\rtimes\\mathbb{Z}_2^\\mathsf{D}$ symmetry and $\\mathbb{Z}_2^\\mathsf{D}$ self-duality. Establishes multicritical duality to easy-plane $\\mathbb{CP}^1$ model describing Néel-VBS transitions.", "motivation": "Fradkin-Shenker model demonstrates Higgs-confinement continuity in $\\mathbb{Z}_2$ gauge theory, but multicritical points with non-local particles lacked continuum description. Understanding these self-dual CFTs crucial for deconfined quantum criticality in 2+1D gauge theories.", "highlights": [ "QED$_3$ description of staggered Fradkin-Shenker model", "$(O(2)_e \\times O(2)_m)\\rtimes\\mathbb{Z}_2^\\mathsf{D}$ multicritical CFT", "Duality to easy-plane $\\mathbb{CP}^1$ Néel-VBS transition" ], "keywords": [ { "label": "Fradkin-Shenker", "reason": "Original $\\mathbb{Z}_2$ gauge-Higgs model with Higgs-confinement continuity" }, { "label": "QED$_3$", "reason": "Continuum description with $N_f=2$ Dirac fermions and charge-two Higgs" }, { "label": "$\\mathbb{Z}_2^\\mathsf{D}$ self-duality", "reason": "Exchanges electric/magnetic particles on self-dual line $h_e=h_m$" }, { "label": "deconfined multicriticality", "reason": "Néel-VBS transition endpoint separating spin liquid phase" } ] }, { "arxiv_id": "2602.23751", "title": "Spin stiffness and resilience phase transition in a noisy toric-rotor code", "authors": "Morteza Zarei, Mohammad Hossein Zarei", "arxiv_url": "https://arxiv.org/abs/2602.23751", "pdf_url": "https://arxiv.org/pdf/2602.23751", "summary": "Maps fidelity in noisy toric-rotor code under phase-shift noise to $XY$ model partition function, identifying Kosterlitz-Thouless transition at $\\sigma_c\\approx0.89$. Develops quantum formalism for spin stiffness mapped to logical gate fidelity. Shows partial resilience below $\\sigma_c$ but no complete correctability.", "motivation": "Toric-rotor codes generalize qubit toric codes to continuous-variable rotors, but correctability under phase noise lacked rigorous characterization. Mapping to $XY$ model provides exact solvability for studying topological order under decoherence.", "highlights": [ "Resilience transition at $\\sigma_c\\approx0.89$", "Spin stiffness $\\mapsto$ logical gate fidelity", "Partial resilience but no complete correctability" ], "keywords": [ { "label": "toric-rotor code", "reason": "Continuous-variable generalization using U(1) rotors replacing qubits" }, { "label": "von Mises noise", "reason": "Phase-shift noise distribution mapping to $XY$ model temperature" }, { "label": "Kosterlitz-Thouless", "reason": "Mixed-state phase transition analogous to $XY$ model $T_c$" }, { "label": "spin stiffness", "reason": "Quantum order parameter for logical subspace resilience" } ] } ] }, "2026-02-27": { "word_cloud": [ { "word": "matching", "weight": 5 }, { "word": "decoder", "weight": 5 }, { "word": "bicycle", "weight": 5 }, { "word": "copy-cup", "weight": 4 }, { "word": "gates", "weight": 4 }, { "word": "Floquet", "weight": 4 }, { "word": "hyperbolic", "weight": 4 }, { "word": "magic", "weight": 4 }, { "word": "stabilizer", "weight": 4 }, { "word": "polytope", "weight": 3 }, { "word": "homodyne", "weight": 3 }, { "word": "Wigner", "weight": 3 }, { "word": "threshold", "weight": 3 }, { "word": "toric", "weight": 3 }, { "word": "LDPC", "weight": 3 }, { "word": "cylinder", "weight": 3 }, { "word": "tessellation", "weight": 2 }, { "word": "group", "weight": 2 }, { "word": "algebra", "weight": 2 } ], "papers": [ { "arxiv_id": "2602.22770", "title": "A matching decoder for bivariate bicycle codes", "authors": "Kaavya Sahay, Dominic J. Williamson, Benjamin J. Brown", "arxiv_url": "https://arxiv.org/abs/2602.22770", "pdf_url": "https://arxiv.org/pdf/2602.22770", "summary": "Proposes a minimum-weight perfect matching decoder for bivariate bicycle codes using the 'cylinder trick' that exploits equivalence to toric code copies. Benchmarks on gross codes, cyclic hypergraph-product codes, generalized toric codes, and directional codes. Augments matching with belief propagation and over-matching for state-of-the-art performance.", "motivation": "Discovery of new LDPC quantum error-correcting codes requires efficient decoding algorithms to support practical quantum computing architectures. Matching decoders proven effective for topological codes need generalization to lattice-based codes like bivariate bicycle codes.", "highlights": [ "Cylinder trick for matching decoding", "Equivalence to toric code copies", "Competitive with state-of-the-art decoders" ], "keywords": [ { "label": "cylinder trick", "reason": "Key innovation mapping bicycle codes to topological structure" }, { "label": "code symmetry", "reason": "Formalizes structure exploited by matching decoder" }, { "label": "bivariate bicycle codes", "reason": "Primary code family targeted by decoder" }, { "label": "minimum-weight perfect matching", "reason": "Core decoding algorithm adapted from topological codes" } ] }, { "arxiv_id": "2602.23307", "title": "Copy-cup Gates in Tensor Products of Group Algebra Codes", "authors": "Ryan Tiew, Nikolas P. Breuckmann", "arxiv_url": "https://arxiv.org/abs/2602.23307", "pdf_url": "https://arxiv.org/pdf/2602.23307", "summary": "Determines conditions on classical group algebra codes for pre-orientation enabling constant-depth CZ and CCZ gates via tensor products. Shows bivariate bicycle codes lack pre-orientation for copy-cup gates. Finds examples with inter-code constant-depth gates.", "motivation": "High-rate quantum LDPC codes require fault-tolerant non-Clifford gates for universal quantum computation. Copy-cup gates provide constant-depth circuits essential for magic state distillation and fault-tolerant architectures.", "highlights": [ "Pre-orientation conditions via perfect matching", "Bicycle codes lack copy-cup gates", "Inter-code constant-depth CCZ gates" ], "keywords": [ { "label": "copy-cup gates", "reason": "Central construction for constant-depth non-Clifford gates" }, { "label": "pre-orientation", "reason": "Key condition for gate implementation" }, { "label": "group algebra codes", "reason": "Classical codes enabling quantum tensor products" }, { "label": "perfect matching problem", "reason": "Combinatorial method determining gate conditions" } ] }, { "arxiv_id": "2602.22906", "title": "Hyperbolic and Semi-Hyperbolic Floquet Codes for Photonic Quantum Computing", "authors": "Aygul Azatovna Galimova", "arxiv_url": "https://arxiv.org/abs/2602.22906", "pdf_url": "https://arxiv.org/pdf/2602.22906", "summary": "Constructs hyperbolic Floquet codes from {8,3}, {10,3}, {12,3} tessellations using Wythoff kaleidoscopic construction and LINS algorithm. Evaluates under phenomenological, EM3, SDEM3, and erasure noise models. {8,3} codes achieve 2.2× surface code area efficiency encoding k=10 qubits.", "motivation": "Surface codes have poor encoding rates while hyperbolic codes achieve constant rate but require high-weight stabilizers. Floquet codes enable weight-2 measurements native to Majorana tetron and spin-optical platforms.", "highlights": [ "New {10,3} and {12,3} hyperbolic Floquet families", "8.5-9% erasure thresholds for {8,3} codes", "2.2× surface code area efficiency" ], "keywords": [ { "label": "hyperbolic Floquet codes", "reason": "New code families for native pair measurement hardware" }, { "label": "Wythoff kaleidoscopic construction", "reason": "Construction method from tessellations" }, { "label": "SDEM3 noise", "reason": "Majorana tetron motivated depolarizing model" }, { "label": "erasure thresholds", "reason": "Dominant photon loss error in SPOQC" } ] }, { "arxiv_id": "2602.22330", "title": "The unbearable hardness of deciding about magic", "authors": "Lorenzo Leone, Jens Eisert, Salvatore F. E. Oliviero", "arxiv_url": "https://arxiv.org/abs/2602.22330", "pdf_url": "https://arxiv.org/pdf/2602.22330", "summary": "Proves membership in stabilizer polytope requires super-exponential exp(n²) time via 3-SAT reduction. Shows magic monotones and witnesses are computationally intractable. Establishes even log(n)-doped Clifford circuits have super-exponentially hard stabilizer boundaries.", "motivation": "Magic states enable universal quantum computation but remain poorly characterized compared to entanglement. Computational complexity barriers limit magic distillation, certification, and classical simulability assessment.", "highlights": [ "exp(n²) hardness for stabilizer polytope membership", "Super-exponential magic monotone computation", "Log(n)-doped Clifford simulability is hard" ], "keywords": [ { "label": "stabilizer polytope", "reason": "Defines free states in magic resource theory" }, { "label": "super-exponential hardness", "reason": "exp(n²) computational complexity via 3-SAT" }, { "label": "magic witnesses", "reason": "Intractable certification of magic states" }, { "label": "t-doped stabilizer states", "reason": "Generalizes classical-quantum boundary" } ] }, { "arxiv_id": "2602.22336", "title": "Basis-independent stabilizerness and maximally noisy magic states", "authors": "Michael Zurel, Jack Davis", "arxiv_url": "https://arxiv.org/abs/2602.22336", "pdf_url": "https://arxiv.org/pdf/2602.22336", "summary": "Characterizes absolutely stabilizer states via spectral polytopes for prime-dimensional qudits. Shows absolutely Wigner-positive states contain bound magic. Computes radii giving purity bounds for non-stabilizer and Wigner-negative states.", "motivation": "Stabilizerness is basis-dependent but absolute stabilizerness enables spectrum-based testing without unitary conjugation. Understanding muggle set geometry illuminates magic state distillation thresholds.", "highlights": [ "Spectral polytope for absolutely stabilizer states", "Absolutely Wigner-positive bound magic", "Purity radii for non-stabilizer states" ], "keywords": [ { "label": "absolutely stabilizer states", "reason": "Unitarily invariant muggle set characterization" }, { "label": "spectral polytope", "reason": "Linear inequalities govern membership" }, { "label": "absolutely Wigner-positive", "reason": "Unitarily invariant Wigner negativity" }, { "label": "stabilizer purity", "reason": "Quantifies distance to stabilizer states" } ] }, { "arxiv_id": "2602.22511", "title": "Quantified convergence of general homodyne measurements with applications to continuous variable quantum computing", "authors": "Emanuel Knill, Ezad Shojaee, James R. van Meter, Akira Kyle, Scott Glancy", "arxiv_url": "https://arxiv.org/abs/2602.22511", "pdf_url": "https://arxiv.org/pdf/2602.22511", "summary": "Quantifies convergence of broadband pulsed homodyne measurements to ideal quadrature measurements via fidelity bounds depending on LO amplitude. Provides lower bounds for post-measurement classical-quantum states and conditional operations. Applies to Wigner function estimation, quantum teleportation, and GKP error correction.", "motivation": "Broadband pulsed homodyne enables calorimeter detectors with high efficiency over spectral ranges. Quantified convergence bounds ensure practical measurement fidelity for CV quantum computing protocols.", "highlights": [ "Fidelity bounds for BBP homodyne convergence", "GKP error correction performance guarantees", "Wigner function estimation convergence" ], "keywords": [ { "label": "broadband pulsed homodyne", "reason": "Generalizes standard pulsed homodyne" }, { "label": "convergence bounds", "reason": "Fidelity guarantees for measurement accuracy" }, { "label": "GKP codes", "reason": "CV error correction application" }, { "label": "local oscillator amplitude", "reason": "Key parameter governing convergence" } ] } ] }, "2026-02-26": { "word_cloud": [ { "word": "logical qubits", "weight": 5 }, { "word": "trapped-ion", "weight": 4 }, { "word": "high-rate codes", "weight": 4 }, { "word": "lattice gauge theory", "weight": 4 }, { "word": "non-Hermitian dynamics", "weight": 3 }, { "word": "Gauss's law", "weight": 4 }, { "word": "break-even", "weight": 3 }, { "word": "error mitigation", "weight": 4 }, { "word": "iceberg codes", "weight": 3 }, { "word": "concatenation", "weight": 3 }, { "word": "GKSL evolution", "weight": 2 }, { "word": "symmetry-based correction", "weight": 3 }, { "word": "qubit overhead", "weight": 3 }, { "word": "postselection", "weight": 2 }, { "word": "mixing speed", "weight": 2 }, { "word": "threshold", "weight": 3 }, { "word": "bitflip repetition", "weight": 2 }, { "word": "quantum simulation", "weight": 4 } ], "social_highlights": "Highlights: High-rate codes achieve beyond break-even performance on trapped-ion processors with 48-94 logical qubits, error mitigation simulates non-Hermitian dynamics without ancillas, Gauss's law correction reveals fundamental trade-offs in lattice gauge theory simulations.", "papers": [ { "arxiv_id": "2602.22211", "title": "Computing with many encoded logical qubits beyond break-even", "authors": "Shival Dasu, Matthew DeCross, Andrew Y. Guo, Ali Lavasani, Jan Behrends, Asmae Benhemou, Yi-Hsiang Chen, Karl Mayer, Chris N. Self, Selwyn Simsek, Basudha Srivastava, M. S. Allman, Jake Arkinstall, Justin G. Bohnet, Nathaniel Q. Burdick, J. P. Campora, Alex Chernoguzov, Samuel F. Cooper, Robert D. Delaney, Joan M. Dreiling, Brian Estey, Caroline Figgatt, Cameron Foltz, John P. Gaebler, Alex Hall, Craig A. Holliman, Ali A. Husain, Akhil Isanaka, Colin J. Kennedy, Yuga Kodama, Nikhil Kotibhaskar, Nathan K. Lysne, Ivaylo S. Madjarov, Michael Mills, Alistair R. Milne, Brian Neyenhuis, Annie J. Park, Anthony Ransford, Adam P. Reed, Steven J. Sanders, Charles H. Baldwin, David Hayes, Ben Criger, Andrew C. Potter, David Amaro", "arxiv_url": "https://arxiv.org/abs/2602.22211", "pdf_url": "https://arxiv.org/pdf/2602.22211", "summary": "Demonstrates beyond break-even quantum computation using high-rate $[[k+2, k, 2]]$ iceberg QED and $[[(k_2 + 2)(k_1 + 2), k_2k_1, 4]]$ concatenated iceberg QEC codes on a 98-qubit Quantinuum Helios trapped-ion processor. Achieves state-of-the-art logical component and state fidelities with 48-94 logical qubits across fault-tolerant and partially-fault-tolerant benchmarks including GHZ state preparation and 3D $XY$ model simulation. Demonstrates that postselection rates can be suppressed through code distance concatenation, providing evidence for near-term beyond-classical-scale computation.", "motivation": "High-rate quantum error correction codes promise to encode multiple logical qubits per physical qubit, addressing the critical challenge of qubit overhead that has limited practical quantum computation. Trapped-ion systems with high-fidelity gates and long-range connectivity provide an ideal platform to test whether these codes can achieve the break-even point where encoded computation outperforms unencoded alternatives.", "highlights": [ "Beyond break-even performance with 48-94 logical qubits on 98-qubit trapped-ion processor", "State-of-the-art logical fidelities via fault-tolerant state preparation, measurement, and gate benchmarking", "Postselection suppression through concatenation demonstrates scalability of high-rate codes" ], "keywords": [ { "label": "high-rate iceberg codes", "reason": "Core contribution: demonstrates $[[k+2, k, 2]]$ and concatenated $[[(k_2 + 2)(k_1 + 2), k_2k_1, 4]]$ codes as viable for near-term quantum computation" }, { "label": "trapped-ion quantum processors", "reason": "Experimental platform: Quantinuum Helios system with 98 qubits provides high-fidelity gates and long-range connectivity essential for high-rate code implementation" }, { "label": "beyond break-even threshold", "reason": "Key achievement: demonstrates encoded computation outperforming unencoded counterparts, a critical milestone for practical quantum advantage" }, { "label": "logical qubit scaling", "reason": "Technical contribution: achieves 48-94 logical qubits with fault-tolerant benchmarks including GHZ states and quantum simulation" } ], "emoji": "⚡", "social_summary": "Trapped-ion quantum computer achieves beyond break-even performance encoding 48-94 logical qubits using high-rate error correction codes.", "highlights_oneliner": "High-rate codes exceed break-even on trapped ions" }, { "arxiv_id": "2602.21879", "title": "Quantum Error Mitigation Simulates General Non-Hermitian Dynamics", "authors": "Hiroki Kuji, Suguru Endo, Tetsuro Nikuni, Ryusuke Hamazaki, Yuichiro Matsuzaki", "arxiv_url": "https://arxiv.org/abs/2602.21879", "pdf_url": "https://arxiv.org/pdf/2602.21879", "summary": "Proposes a hardware-friendly quantum error mitigation (QEM) protocol that simulates non-Hermitian dynamics via Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) evolution without continuous monitoring or ancilla qubits. The scheme uses classical Gaussian white-noise averaging to implement non-unitary time evolution and stochastic QEM to cancel quantum-jump contributions at the observable level, requiring only single-qubit operations. Validates the method through numerical simulations of asymmetric hopping, interaction, and disorder models.", "motivation": "Non-Hermitian Hamiltonians exhibit exotic dynamical phenomena relevant to open quantum systems and dissipative physics, but implementing their nonunitary evolution on near-term quantum devices remains a fundamental challenge. Developing ancilla-free, hardware-efficient protocols bridges the gap between theoretical non-Hermitian physics and practical quantum simulation on noisy intermediate-scale quantum (NISQ) devices.", "highlights": [ "Ancilla-free protocol simulates non-Hermitian GKSL dynamics using only single-qubit operations", "Stochastic quantum error mitigation cancels quantum-jump contributions at observable level", "Validated on models with asymmetric hopping, interaction, and disorder without continuous monitoring" ], "keywords": [ { "label": "quantum error mitigation", "reason": "Core technique: uses stochastic QEM to suppress non-unitary contributions in non-Hermitian simulation without full error correction overhead" }, { "label": "non-Hermitian dynamics", "reason": "Application domain: enables simulation of exotic non-completely-positive and non-trace-preserving evolution on near-term devices" }, { "label": "GKSL evolution", "reason": "Theoretical framework: Gorini-Kossakowski-Sudarshan-Lindblad master equation governs the open quantum system dynamics being simulated" }, { "label": "ancilla-free implementation", "reason": "Hardware advantage: eliminates need for ancilla qubits and controlled time-evolution, reducing resource requirements on NISQ devices" } ], "emoji": "✨", "social_summary": "Error mitigation protocol simulates exotic non-Hermitian quantum dynamics without ancilla qubits on near-term quantum devices.", "highlights_oneliner": "Ancilla-free non-Hermitian simulation via error mitigation" }, { "arxiv_id": "2602.22121", "title": "Trade-offs in Gauss's law error correction for lattice gauge theory quantum simulations", "authors": "Balint Pato, Natalie Klco", "arxiv_url": "https://arxiv.org/abs/2602.22121", "pdf_url": "https://arxiv.org/pdf/2602.22121", "summary": "Investigates fundamental trade-offs in Gauss's law-based quantum error correction (GLQEC) for lattice gauge theory simulations, proving via dimension-counting arguments that GLQEC requires periodic electric fields, constraining lattice QED design space. Numerically compares GLQEC with universal QEC using $d=3$ bitflip repetition codes, finding that while GLQEC achieves lower single-round logical error rates, it exhibits faster decoherence under multiple correction rounds with a mixing speed threshold of $p_{th}=0.277(2)$ above which GLQEC performs worse than no correction.", "motivation": "Symmetry-based error correction schemes like GLQEC promise reduced qubit overhead by leveraging built-in conservation laws in lattice gauge theories, offering potential advantages for quantum simulation. However, understanding the fundamental limitations and trade-offs of such approaches is essential for designing error-robust quantum simulation protocols that balance overhead reduction against decoherence rates.", "highlights": [ "Dimension-counting proof that GLQEC requires periodic electric fields, constraining lattice QED formulations", "GLQEC exhibits faster decoherence to steady-state mixed ensemble than universal codes under multiple correction rounds", "Mixing speed threshold $p_{th}=0.277(2)$ identifies regime where GLQEC degrades performance below uncorrected baseline" ], "keywords": [ { "label": "Gauss's law-based error correction", "reason": "Core innovation: symmetry-informed QEC leveraging conservation laws to reduce qubit overhead in lattice gauge theory simulations" }, { "label": "lattice gauge theory simulation", "reason": "Application domain: 1+1D lattice QED simulations where GLQEC is applied and compared against universal codes" }, { "label": "mixing speed penalty", "reason": "Key limitation: identifies fundamental decoherence trade-off where GLQEC exhibits faster approach to steady-state mixed ensemble than universal codes" }, { "label": "symmetry-based correction schemes", "reason": "Theoretical framework: demonstrates fundamental constraints on error correction approaches that exploit built-in symmetries rather than universal codes" } ], "emoji": "🧲", "social_summary": "Symmetry-based error correction for lattice gauge theory reveals fundamental trade-offs between overhead reduction and decoherence rates.", "highlights_oneliner": "Symmetry-based correction reveals decoherence trade-offs" } ] }, "2026-02-25": { "word_cloud": [ { "word": "threshold", "weight": 5 }, { "word": "decoder", "weight": 5 }, { "word": "surface", "weight": 4 }, { "word": "Clifford", "weight": 4 }, { "word": "qudit", "weight": 4 }, { "word": "LDPC", "weight": 4 }, { "word": "coherent", "weight": 5 }, { "word": "entanglement", "weight": 4 }, { "word": "identical", "weight": 3 }, { "word": "Singleton", "weight": 3 }, { "word": "time", "weight": 4 }, { "word": "brickwork", "weight": 3 }, { "word": "union-find", "weight": 4 }, { "word": "passive", "weight": 4 }, { "word": "stabilizer", "weight": 5 }, { "word": "gauge", "weight": 3 }, { "word": "QAOA", "weight": 3 }, { "word": "Pauli", "weight": 3 }, { "word": "bosonic", "weight": 3 } ], "social_highlights": "Highlights: proves UF decoder threshold, Clifford circuits for error correction, qudit codes for gauge theories, QAOA LDPC decoding, passive coherent error correction, entanglement resilience, identical particle codes, symplectic Singleton proof, time crystals as qubits.", "papers": [ { "arxiv_id": "2602.20238", "title": "Proof of a finite threshold for the union-find decoder", "authors": "Satoshi Yoshida, Ethan Lake, Hayata Yamasaki", "arxiv_url": "https://arxiv.org/abs/2602.20238", "pdf_url": "https://arxiv.org/pdf/2602.20238", "summary": "Proves a finite threshold for the union-find decoder on the surface code under circuit-level local stochastic error model using refined error-clustering framework. Establishes quasi-polylogarithmic runtime upper bound for parallel UF decoder and extends to greedy decoder. Provides theoretical foundation for practical UF-based decoders in fault-tolerant quantum computing.", "motivation": "Fast decoders like union-find offer near-linear time and strong empirical error suppression but lacked rigorous threshold proofs beyond simulations. This work addresses the gap, enabling confidence in UF decoders for scalable fault-tolerant quantum computers.", "highlights": [ "Finite UF decoder threshold proven", "Quasi-polylog runtime bound", "Greedy decoder threshold" ], "keywords": [ { "label": "union-find decoder", "reason": "Core decoder analyzed with rigorous threshold proof" }, { "label": "surface code", "reason": "Specific code family for which threshold is established" }, { "label": "error-clustering", "reason": "Refined framework enabling analytical control" }, { "label": "circuit-level noise", "reason": "Realistic error model used in proof" } ], "emoji": "📚", "social_summary": "Proves finite error threshold for fast union-find decoder on surface codes.", "highlights_oneliner": "UF decoder threshold proof" }, { "arxiv_id": "2602.20900", "title": "Error correction with brickwork Clifford circuits", "authors": "Twan Kroll, Jonas Helsen", "arxiv_url": "https://arxiv.org/abs/2602.20900", "pdf_url": "https://arxiv.org/pdf/2602.20900", "summary": "Proves random 1D Clifford brickwork circuits form good approximate quantum error correction codes in logarithmic depth using statistical mechanics techniques. Provides matching upper and lower bounds for depth required for exact error correction in random 1D Clifford brickwork circuits.", "motivation": "Random Clifford circuits enable efficient quantum error correction simulations; understanding their error-correcting properties bridges random circuit theory and practical QEC. Matters for designing shallow-depth fault-tolerant circuits.", "highlights": [ "Log-depth approximate QEC", "Exact depth bounds", "Statistical mechanics proof" ], "keywords": [ { "label": "brickwork circuits", "reason": "Specific circuit architecture analyzed" }, { "label": "Clifford circuits", "reason": "Unitary ensemble used for error correction" }, { "label": "1D random circuits", "reason": "Geometry where properties proven" }, { "label": "Haar moments", "reason": "Key mathematical tool employed" } ], "emoji": "🔗", "social_summary": "Random Clifford brickwork circuits enable log-depth quantum error correction.", "highlights_oneliner": "Brickwork Clifford QEC" }, { "arxiv_id": "2602.20661", "title": "Qudit stabiliser codes for $\\mathbb{Z}_N$ lattice gauge theories with matter", "authors": "Luca Spagnoli, Alessandro Roggero, Nathan Wiebe", "arxiv_url": "https://arxiv.org/abs/2602.20661", "pdf_url": "https://arxiv.org/pdf/2602.20661", "summary": "Expresses $\\mathbb{Z}_N$ gauge theory with prime $N$ and dynamical matter as qudit stabilizer code, revealing logical duality via error correction. Generalizes $\\mathbb{Z}_2$ qubit constructions to $\\mathbb{Z}_N$ qudits with universal fault-tolerant gates via state injection.", "motivation": "Connecting QEC and lattice gauge theories unifies frameworks; extending to qudits with matter enables simulation of complex gauge models. Crucial for fault-tolerant quantum simulation of particle physics.", "highlights": [ "Qudit stabilizer for $\\mathbb{Z}_N$ LGT", "Logical duality from QEC", "Universal qudit gates" ], "keywords": [ { "label": "qudit stabilizer", "reason": "Code family for gauge theories" }, { "label": "$\\mathbb{Z}_N$ gauge", "reason": "Theory encoded in stabilizers" }, { "label": "logical duality", "reason": "Emergent property from mapping" }, { "label": "state injection", "reason": "Method for fault-tolerant gates" } ], "emoji": "🧭", "social_summary": "Qudit codes encode $\\mathbb{Z}_N$ gauge theories with matter and duality.", "highlights_oneliner": "Qudit LGT stabilizer codes" }, { "arxiv_id": "2602.21124", "title": "Quantum Approximate Optimization for Decoding of Low-Density Parity-Check Codes", "authors": "Krishnakanta Barik, Goutam Paul", "arxiv_url": "https://arxiv.org/abs/2602.21124", "pdf_url": "https://arxiv.org/pdf/2602.21124", "summary": "Formulates LDPC decoding as QAOA optimization with parity-check and channel reliability cost function, outperforming BP in numerical experiments. Demonstrates higher codeword recovery probability than BP across settings.", "motivation": "BP decoding fails for short codes and high noise; quantum optimization like QAOA offers global search advantages. Enables near-term NISQ applications in classical coding.", "highlights": [ "QAOA LDPC decoder", "Beats BP performance", "Channel-aware cost" ], "keywords": [ { "label": "QAOA decoding", "reason": "Quantum algorithm for LDPC" }, { "label": "LDPC codes", "reason": "Target code family" }, { "label": "belief propagation", "reason": "Baseline outperformed" }, { "label": "NISQ optimization", "reason": "Near-term applicability" } ], "emoji": "📚", "social_summary": "QAOA decodes LDPC codes better than classical BP.", "highlights_oneliner": "QAOA for LDPC decoding" }, { "arxiv_id": "2602.21076", "title": "Correcting coherent quantum errors by going with the flow", "authors": "Wayne M. Witzel, Anand Ganti, Tzvetan S. Metodi", "arxiv_url": "https://arxiv.org/abs/2602.21076", "pdf_url": "https://arxiv.org/pdf/2602.21076", "summary": "Shows passive Pauli frame updates prevent coherent error compounding, matching Pauli noise performance for $d>3$ via perturbation theory and simulations. Demonstrates randomization and lazy correction mitigate correlated rotations.", "motivation": "Coherent errors from global fields or drift can quadratically worsen QEC; passive strategies avoid active corrections' pitfalls. Essential for realistic noise in ion traps, NMR, superconductors.", "highlights": [ "Passive corrects coherent errors", "Matches Pauli performance", "Pauli frame randomization" ], "keywords": [ { "label": "coherent noise", "reason": "Error type analyzed" }, { "label": "passive correction", "reason": "Key strategy proposed" }, { "label": "Pauli frame", "reason": "Update mechanism" }, { "label": "perturbation theory", "reason": "Analytical tool used" } ], "emoji": "⚡", "social_summary": "Passive corrections tame coherent quantum errors like Pauli noise.", "highlights_oneliner": "Passive coherent QEC" }, { "arxiv_id": "2602.20987", "title": "Entanglement-Induced Resilience of Quantum Dynamics", "authors": "Tianfeng Feng, Yue Cao, Wenjun Yu, Junkai Zeng, Xiaopeng Li, Xiu-Hao Deng, Qi Zhao", "arxiv_url": "https://arxiv.org/abs/2602.20987", "pdf_url": "https://arxiv.org/pdf/2602.20987", "summary": "Proves entanglement growth confines local Hamiltonian perturbations, suppressing dynamical errors in spin chains and fermionic lattices. Protection scales with subsystem entanglement entropy without extra overhead.", "motivation": "Noise destabilizes many-body quantum devices; native entanglement offers passive resilience beyond QEC or decoupling. Guides noise-robust simulator and control design.", "highlights": [ "Entanglement suppresses errors", "No overhead protection", "Scales with entropy" ], "keywords": [ { "label": "entanglement growth", "reason": "Mechanism for resilience" }, { "label": "dynamical errors", "reason": "Error type mitigated" }, { "label": "noiseless subsystem", "reason": "Effective protection space" }, { "label": "many-body dynamics", "reason": "Systems analyzed" } ], "emoji": "🔗", "social_summary": "Entanglement growth passively protects quantum dynamics from noise.", "highlights_oneliner": "Entanglement resilience" }, { "arxiv_id": "2602.20452", "title": "A Unified Error Correction Code for Universal Quantum Computing with Identical Particles", "authors": "S. L. Wu, Lian-Ao Wu", "arxiv_url": "https://arxiv.org/abs/2602.20452", "pdf_url": "https://arxiv.org/pdf/2602.20452", "summary": "Proposes unified QEC code for identical particle qubits using reversal operations beyond unitaries, unifying QECC, DD, DFS. Analytically solvable IPQ-bath model validates via simulations.", "motivation": "Identical particle qubits have distinct bath interactions requiring new decoherence strategies; unifies existing methods. Enables fault-tolerant computing with atoms, photons.", "highlights": [ "IPQ unified code", "Reversal operations", "DFS structure" ], "keywords": [ { "label": "identical particles", "reason": "Qubit platform" }, { "label": "reversal operations", "reason": "Generalized recovery" }, { "label": "decoherence-free", "reason": "Emergent subspace" }, { "label": "dynamical decoupling", "reason": "Integrated strategy" } ], "emoji": "🩸", "social_summary": "Unified code protects identical particle qubits fault-tolerantly.", "highlights_oneliner": "IPQ unified QEC" }, { "arxiv_id": "2602.20186", "title": "A Symplectic Proof of the Quantum Singleton Bound", "authors": "Frederick Dehmel, Shilun Li", "arxiv_url": "https://arxiv.org/abs/2602.20186", "pdf_url": "https://arxiv.org/pdf/2602.20186", "summary": "Provides symplectic linear-algebra proof of Quantum Singleton Bound $k + 2(d - 1) \\le n$ for stabilizer codes using erasure correctability and cleaning lemma. Includes Lean4 formalization.", "motivation": "Singleton bound fundamental for code parameters; symplectic proof avoids entropy methods, suits verification. Advances algebraic understanding of stabilizer codes.", "highlights": [ "Symplectic Singleton proof", "$k + 2(d-1) \\le n$ bound", "Lean4 formalization" ], "keywords": [ { "label": "Singleton bound", "reason": "Proven result" }, { "label": "symplectic algebra", "reason": "Proof framework" }, { "label": "cleaning lemma", "reason": "Key lemma used" }, { "label": "stabilizer codes", "reason": "Code class" } ], "emoji": "✨", "social_summary": "Symplectic proof of Quantum Singleton Bound with formal verification.", "highlights_oneliner": "Symplectic Singleton proof" }, { "arxiv_id": "2602.20269", "title": "Time Crystals as Passively Protected Oscillating Qubits", "authors": "Mert Esencan, A. I. Lvovsky, Berislav Buča", "arxiv_url": "https://arxiv.org/abs/2602.20269", "pdf_url": "https://arxiv.org/pdf/2602.20269", "summary": "Encodes oscillating qubit in driven-dissipative Bose-Hubbard dimer time crystal's noiseless subsystem, protected against global loss, dephasing, phase perturbations.", "motivation": "Passive correction limited to static memory; time crystals enable dynamic qubits autonomously. Advances in-situ processing in open systems.", "highlights": [ "Time crystal qubit", "Passive oscillation protection", "Bose-Hubbard dimer" ], "keywords": [ { "label": "time crystals", "reason": "Platform for qubits" }, { "label": "noiseless subsystem", "reason": "Protection mechanism" }, { "label": "driven-dissipative", "reason": "System dynamics" }, { "label": "Bose-Hubbard dimer", "reason": "Model implemented" } ], "emoji": "⏰", "social_summary": "Time crystals passively protect oscillating qubits from noise.", "highlights_oneliner": "Time crystal qubits" } ] }, "2026-02-24": { "word_cloud": [ { "word": "nonstabilizerness", "weight": 5 }, { "word": "magic", "weight": 5 }, { "word": "Pauli", "weight": 4 }, { "word": "stabilizer", "weight": 4 }, { "word": "polytope", "weight": 4 }, { "word": "toric", "weight": 4 }, { "word": "dissipative", "weight": 4 }, { "word": "self-correcting", "weight": 5 }, { "word": "Lindblad", "weight": 3 }, { "word": "CSS", "weight": 4 }, { "word": "group-valued", "weight": 4 }, { "word": "qudits", "weight": 3 }, { "word": "quantum double", "weight": 4 }, { "word": "directional", "weight": 4 }, { "word": "qLDPC", "weight": 5 }, { "word": "route", "weight": 3 }, { "word": "coherent", "weight": 4 }, { "word": "non-Markovian", "weight": 4 }, { "word": "tangent", "weight": 3 }, { "word": "dMLE", "weight": 4 }, { "word": "bicycle", "weight": 5 } ], "social_highlights": "Highlights: predicts magic from few measurements, dissipative self-correction in toric code, group-CSS qudits, directional qLDPC analysis, error decomposition, differentiable noise estimation, BB magic distillation.", "papers": [ { "arxiv_id": "2602.18939", "title": "Predicting Magic from Very Few Measurements", "authors": "J. M. Varela, L. L. Keller, A. de Oliveira Junior, D. A. Moreira, R. Chaves, R. A. Macêdo", "arxiv_url": "https://arxiv.org/abs/2602.18939", "pdf_url": "https://arxiv.org/pdf/2602.18939", "summary": "Introduces framework to witness and quantify nonstabilizerness using any set of $m$ $n$-qubit Pauli measurements containing anti-commuting pairs by projecting stabilizer polytope. Provides algorithm estimating magic with runtime exponential in $m$ and polynomial in $n$. Proves NP-hardness of reduced stabilizer polytope membership.", "motivation": "Nonstabilizerness (magic) is essential for universal quantum computation beyond stabilizer operations simulable classically, but traditional measures require exponential measurements and post-processing. Current quantum platforms with hundreds of qubits demand scalable characterization methods.", "highlights": [ "Magic from limited Pauli measurements", "NP-hardness of reduced polytope", "Lower bounds on simulation cost" ], "keywords": [ { "label": "nonstabilizerness", "reason": "core resource quantified via reduced measurements" }, { "label": "stabilizer polytope", "reason": "geometric object projected for analysis" }, { "label": "Pauli measurements", "reason": "input enabling scalable estimation" }, { "label": "quantum marginal problem", "reason": "related complexity proof" } ], "emoji": "✨", "social_summary": "Predicts quantum magic states from just a few measurements, beating exponential tomography limits.", "highlights_oneliner": "Few-shot magic prediction" }, { "arxiv_id": "2602.19288", "title": "Self-correction phase transition in the dissipative toric code", "authors": "Sanjeev Kumar, Hendrik Weimer", "arxiv_url": "https://arxiv.org/abs/2602.19288", "pdf_url": "https://arxiv.org/pdf/2602.19288", "summary": "Analyzes Lindblad master equation implementing cellular automaton decoder for toric code, revealing self-correcting phase in steady state via topological order. Computes phase diagram showing competition between error correction and update rates. Finds self-correction possible beyond conventional thresholds.", "motivation": "Quantum memories require long-term information storage against dynamical correlated errors beyond static depolarizing noise models. Dissipative many-body systems offer thermodynamic phases encoding error correction capabilities.", "highlights": [ "Self-correcting dissipative phase", "Threshold at error ratio 0.008", "$O(1)$ decoding complexity" ], "keywords": [ { "label": "dissipative toric code", "reason": "model exhibiting self-correction" }, { "label": "cellular automaton decoder", "reason": "implemented via Lindblad jumps" }, { "label": "self-correcting phase", "reason": "steady-state topological order" }, { "label": "error threshold", "reason": "beyond conventional QEC" } ], "emoji": "⚡", "social_summary": "Dissipative toric code self-corrects errors via phase transition, beating standard thresholds.", "highlights_oneliner": "Dissipative self-correction" }, { "arxiv_id": "2602.19558", "title": "Calderbank-Shor-Steane codes on group-valued qudits", "authors": "Ben T. McDonough, Jian-Hao Zhang, Victor V. Albert, Andrew Lucas", "arxiv_url": "https://arxiv.org/abs/2602.19558", "pdf_url": "https://arxiv.org/pdf/2602.19558", "summary": "Generalizes CSS codes to $G$-valued qudits using group multiplications for $X$-checks and word equations for $Z$-checks, reducing to qubit CSS and quantum doubles. Proves non-Abelian simple group codes reduce to CW quantum doubles. Constructs optimal rate-distance families and ghost vertex generalizations.", "motivation": "CSS codes enable efficient syndrome measurement but limited to Abelian groups; non-Abelian extensions access richer anyonic statistics. CW complexes generalize manifold-based topological models.", "highlights": [ "Group-CSS qudit codes", "CW quantum doubles", "Optimal non-Abelian families" ], "keywords": [ { "label": "group-CSS codes", "reason": "generalization to finite groups" }, { "label": "quantum double", "reason": "non-Abelian simple group limit" }, { "label": "CW complexes", "reason": "code space construction" }, { "label": "ghost vertices", "reason": "defect generalization" } ], "emoji": "🧭", "social_summary": "CSS codes go non-Abelian: group-valued qudits yield optimal quantum doubles.", "highlights_oneliner": "Group CSS qudits" }, { "arxiv_id": "2602.19057", "title": "Structural Analysis of Directional qLDPC Codes", "authors": "Mohammad Rowshan", "arxiv_url": "https://arxiv.org/abs/2602.19057", "pdf_url": "https://arxiv.org/pdf/2602.19057", "summary": "Develops word-first framework deriving route-to-support maps, commutation lattices, and admissibility criteria for translation-invariant CSS codes on tori. Provides word canonicalization, inverse realizability tests, and quasi-cyclic dimension analysis. Analyzes $\\texttt{NE}^2\\texttt{NE}^2\\texttt{N}$ word exactly.", "motivation": "Hardware-constrained qLDPC codes require strict lattice connectivity; direction words enforce ancilla routes but induce boundary-sensitive structure. Systematic enumeration needs symmetry reduction.", "highlights": [ "Route-to-support mapping", "Word canonicalization", "$k=4$ vs $k=0$ collapse" ], "keywords": [ { "label": "directional codes", "reason": "hardware-motivated qLDPC family" }, { "label": "direction word", "reason": "generates stabilizer support" }, { "label": "odd-multiplicity lattice", "reason": "classifies $X/Z$ layouts" }, { "label": "dimension collapse", "reason": "boundary condition theorem" } ], "emoji": "📚", "social_summary": "Cracks directional qLDPC structure: exact dimension collapse criteria revealed.", "highlights_oneliner": "Directional qLDPC analysis" }, { "arxiv_id": "2602.20128", "title": "Experimental characterization of coherent and non-Markovian errors using tangent space decomposition", "authors": "Elia Perego, Andrea Rodriguez-Blanco, K. Birgitta Whaley, Bharath Hebbe Madhusudhana", "arxiv_url": "https://arxiv.org/abs/2602.20128", "pdf_url": "https://arxiv.org/pdf/2602.20128", "summary": "Applies tangent-space decomposition separating gate errors into coherent, Markovian, and non-Markovian components from single tomographic snapshot. Validates on trapped $^{40}$Ca$^+$ gates with injected slow fluctuations. Quantifies contributions directly from Pauli/choi matrices.", "motivation": "Standard benchmarking assumes Markovian/time-independent noise, missing coherent miscalibrations and temporal correlations prevalent in real devices. Gate-level separation needed for targeted mitigation.", "highlights": [ "Tangent-space error decomposition", "Single-snapshot quantification", "Trapped ion validation" ], "keywords": [ { "label": "tangent decomposition", "reason": "separates error components" }, { "label": "non-Markovian errors", "reason": "quantified via fluctuations" }, { "label": "coherent miscalibration", "reason": "systematic gate errors" }, { "label": "Pauli transfer matrix", "reason": "experimental representation" } ], "emoji": "🔍", "social_summary": "Decomposes gate errors into coherent, Markovian, non-Markovian parts from one snapshot.", "highlights_oneliner": "Error type decomposition" }, { "arxiv_id": "2602.19722", "title": "Differentiable Maximum Likelihood Noise Estimation for Quantum Error Correction", "authors": "Hanyan Cao, Dongyang Feng, Cheng Ye, Feng Pan", "arxiv_url": "https://arxiv.org/abs/2602.19722", "pdf_url": "https://arxiv.org/pdf/2602.19722", "summary": "Introduces differentiable MLE framework computing exact syndrome log-likelihoods via Planar solver and optimized TN for surface codes up to $d=5$, $T=25$. Achieves 30.6% logical error reduction on repetition codes, 8.1% on Google surface data vs prior methods.", "motivation": "Decoder performance critically depends on accurate circuit-level noise parameters; existing estimation suboptimal. Gradient-based optimization needs differentiable likelihoods.", "highlights": [ "differentiable syndrome likelihood", "30.6% repetition error reduction", "8.1% surface code improvement" ], "keywords": [ { "label": "differentiable MLE", "reason": "gradient-based noise estimation" }, { "label": "syndrome likelihood", "reason": "exact computation via TN" }, { "label": "Planar solver", "reason": "repetition code exactness" }, { "label": "logical error reduction", "reason": "experimental validation" } ], "emoji": "ὐc", "social_summary": "Differentiable noise estimation cuts logical errors 30% on real quantum data.", "highlights_oneliner": "Gradient noise estimation" }, { "arxiv_id": "2602.20546", "title": "Distilling Magic States in the Bicycle Architecture", "authors": "Shifan Xu, Kun Liu, Patrick Rall, Zhiyang He, Yongshan Ding", "arxiv_url": "https://arxiv.org/abs/2602.20546", "pdf_url": "https://arxiv.org/pdf/2602.20546", "summary": "Designs single-block BB-code magic distillation factories executing Pauli-Clifford circuits via logical mapping, scheduling, nativization, qubit recycling. Achieves comparable space-time volume to leaders at lower error, smaller footprint. Optimizes as second-round distillers.", "motivation": "Surface code distillation requires massive multi-block surgery; BB codes promise low-overhead FTQC but lack distillation protocols. Non-Clifford resources bottleneck all architectures.", "highlights": [ "Single-block BB distillation", "Qubit recycling compression", "Lower error smaller footprint" ], "keywords": [ { "label": "Bicycle codes", "reason": "low-overhead qLDPC architecture" }, { "label": "magic distillation", "reason": "single-block factories" }, { "label": "Pauli nativization", "reason": "Clifford circuit optimization" }, { "label": "qubit recycling", "reason": "protocol compression" } ], "emoji": "🚃", "social_summary": "Distills magic states inside single Bicycle code blocks, slashing qubit needs.", "highlights_oneliner": "BB magic factories" } ] }, "2026-02-23": { "word_cloud": [ { "word": "Floquet", "weight": 5 }, { "word": "Hyperbolic", "weight": 5 }, { "word": "Distributed", "weight": 4 }, { "word": "Thresholds", "weight": 5 }, { "word": "Decision", "weight": 4 }, { "word": "Diagrams", "weight": 4 }, { "word": "Clifford", "weight": 4 }, { "word": "T-gates", "weight": 4 }, { "word": "Qudits", "weight": 5 }, { "word": "Toric", "weight": 4 }, { "word": "LDPC", "weight": 5 }, { "word": "Dynamical", "weight": 4 }, { "word": "Decoupling", "weight": 5 }, { "word": "Hybrid", "weight": 4 }, { "word": "Steane", "weight": 3 }, { "word": "Erasure", "weight": 3 }, { "word": "Spectral", "weight": 3 }, { "word": "Bisection", "weight": 3 }, { "word": "Stabilizer", "weight": 4 } ], "social_highlights": "Highlights: distributed hyperbolic Floquet codes with high thresholds, exact decision diagrams for Clifford+$T$ circuits, generalized qudit toric LDPC codes, hybrid LDD+QEC protocols.", "papers": [ { "arxiv_id": "2602.17969", "title": "Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise", "authors": "Aygul Azatovna Galimova", "arxiv_url": "https://arxiv.org/abs/2602.17969", "pdf_url": "https://arxiv.org/pdf/2602.17969", "summary": "Constructs hyperbolic and semi-hyperbolic Floquet codes from $\\{8,3\\}$, $\\{10,3\\}$, $\\{12,3\\}$ tessellations using Wythoff kaleidoscopic construction and LINS algorithm, distributing them across QPUs via spectral bisection. Simulates under depolarizing, SDEM3, correlated EM3, and erasure noise, achieving non-local pseudo-thresholds up to $3.0\\%$ for $\\{8,3\\}$ and $\\{10,3\\}$, and $35-40\\%$ erasure thresholds for $\\{8,3\\}$. Introduces $\\{10,3\\}$ and $\\{12,3\\}$ families as new to hyperbolic Floquet codes.", "motivation": "Hyperbolic Floquet codes address surface code limitations in encoding rate and high-weight stabilizers by using weight-2 measurements on negatively curved surfaces, enabling constant $k/n=\\Theta(1)$. Distributing across networked QPUs is essential for scaling beyond single-chip qubit limits, with demonstrated high pseudo-thresholds outperforming local rates by orders of magnitude.", "highlights": [ "$3.0\\%$ depolarizing pseudo-threshold for $\\{8,3\\}$ and $\\{10,3\\}$", "$35-40\\%$ erasure thresholds at $1\\%$ local loss for $\\{8,3\\}$", "New $\\{10,3\\}$, $\\{12,3\\}$ hyperbolic Floquet families" ], "keywords": [ { "label": "Hyperbolic Floquet", "reason": "Core code family using weight-2 measurements on tessellations" } ], "emoji": "\\u1f727", "social_summary": "Introduces distributed hyperbolic Floquet codes with $3\\%$ thresholds across QPUs.", "highlights_oneliner": "Distributed hyperbolic Floquet codes" }, { "arxiv_id": "2602.17775", "title": "Exact quantum decision diagrams with scaling guarantees for Clifford+$T$ circuits and beyond", "authors": "Arend-Jan Quist, Tim Coopmans, Alfons Laarman", "arxiv_url": "https://arxiv.org/abs/2602.17775", "pdf_url": "https://arxiv.org/pdf/2602.17775", "summary": "Develops exact quantum decision diagrams using algebraic representations for complex numbers to avoid floating-point errors in Clifford+$T$ circuit analysis. Proves linear bounds on representation sizes in $T$ gates and qubits, constant in Clifford gates, with runtime $2^t \\cdot poly(g,n)$. Links stabilizer nullity to decision diagram width, outperforming floating-point methods.", "motivation": "Floating-point errors hinder practical quantum decision diagrams for circuit verification and analysis despite their success in classical domains. Provides first scaling guarantees for exact simulation of universal gate sets like Clifford+$T$, enabling reliable analysis of quantum circuits.", "highlights": [ "Runtime $2^t \\cdot poly(g,n)$ for Clifford+$T$", "Linear size bounds in $t$, $n$", "Stabilizer nullity controls DD width" ], "keywords": [ { "label": "Quantum Decision Diagrams", "reason": "Data structure for exact circuit simulation" }, { "label": "Clifford+$T$", "reason": "Universal gate set with scaling proofs" }, { "label": "Algebraic Representation", "reason": "Replaces floating-point for exactness" } ], "emoji": "\\u1f4dd", "social_summary": "Delivers exact decision diagrams for Clifford+$T$ circuits with proven scaling.", "highlights_oneliner": "Exact DD for Clifford+$T$" }, { "arxiv_id": "2602.20158", "title": "Generalized $\\mathbb{Z}_p$ toric codes as qudit low-density parity-check codes", "authors": "Zijian Liang, Yu-An Chen", "arxiv_url": "https://arxiv.org/abs/2602.20158", "pdf_url": "https://arxiv.org/pdf/2602.20158", "summary": "Generalizes Kitaev $\\mathbb{Z}_p$ toric codes by augmenting stabilizers with two qudits on square lattice under twisted boundaries. Uses Laurent-polynomial Gröbner basis to compute logical $k$ efficiently, identifying optimal LDPC codes like $[[242,10,22]]_3$ and $[[120,6,20]]_{11}$ with $kd^2/n=20$. Observes $kd^2 = 0.0541 n^2 \\ln p + 3.84 n$ tradeoff improving with $p$.", "motivation": "Extends qubit toric codes to prime qudits for better finite-size LDPC performance on square lattices. Efficient computation enables systematic search for high $kd^2/n$, revealing $p$-dependent scaling compatible with BPT bounds.", "highlights": [ "$[[242,10,22]]_3$ with $kd^2/n=20$", "$kd^2=0.0541n^2\\ln p + 3.84n$", "$p$ improves finite-size performance" ], "keywords": [ { "label": "Qudit LDPC", "reason": "Optimal low-density parity-check codes" }, { "label": "Gröbner Basis", "reason": "Efficient logical dimension computation" }, { "label": "Twisted Boundaries", "reason": "Enables translation-invariant codes" }, { "label": "BPT Tradeoff", "reason": "Scaling relation observed" } ], "emoji": "\\u1f727", "social_summary": "Uncovers top qudit LDPC toric codes with $kd^2/n=20$.", "highlights_oneliner": "Qudit toric LDPC codes" }, { "arxiv_id": "2602.19042", "title": "Quantum Error Correction and Dynamical Decoupling: Better Together or Apart?", "authors": "Victor Kasatkin, Mario Morford-Oberst, Arian Vezvaee, Daniel A. Lidar", "arxiv_url": "https://arxiv.org/abs/2602.19042", "pdf_url": "https://arxiv.org/pdf/2602.19042", "summary": "Analyzes hybrid LDD+QEC using normalizer elements in $[[n,k,d]]$ codes, deriving entanglement-fidelity formulas via weight enumerator polynomials for QEC-only, LDD-only, physical DD, and hybrid. Hybrid outperforms QEC-only if LDD suppresses minimum-weight uncorrectable errors. Demonstrates advantages for Steane $[[7,1,3]]$ and $[[13,1,3]]$ codes.", "motivation": "QEC and DD protect quantum information differently, but physical DD conflicts with codespaces while LDD preserves them; clarifying hybrid benefits requires code-decoder-control co-design. Provides conditions and numerics showing when LDD+QEC exceeds individual methods.", "highlights": [ "LDD suppresses min-weight uncorrectables", "Hybrid fidelity via enumerators", "Steane code parameter maps" ], "keywords": [ { "label": "Logical DD", "reason": "Preserves codespace decoupling" }, { "label": "Hybrid LDD+QEC", "reason": "Protocol outperforming singles" }, { "label": "Weight Enumerators", "reason": "Closed-form fidelity formulas" } ], "emoji": "\\u2699", "social_summary": "Reveals when hybrid QEC+decoupling beats both alone.", "highlights_oneliner": "Hybrid LDD+QEC analysis" } ] }, "2026-02-20": { "word_cloud": [ { "word": "LDPC", "weight": 5 }, { "word": "cat", "weight": 4 }, { "word": "abort", "weight": 4 }, { "word": "entropic", "weight": 5 }, { "word": "decoder", "weight": 3 }, { "word": "interface", "weight": 3 }, { "word": "stabilization", "weight": 4 }, { "word": "surface", "weight": 3 }, { "word": "color", "weight": 3 }, { "word": "bosonic", "weight": 4 }, { "word": "topological", "weight": 4 }, { "word": "defects", "weight": 4 }, { "word": "syndrome", "weight": 3 }, { "word": "efficiency", "weight": 3 }, { "word": "toric", "weight": 4 }, { "word": "Rydberg", "weight": 3 }, { "word": "protection", "weight": 4 }, { "word": "noise", "weight": 3 }, { "word": "threshold", "weight": 3 } ], "social_highlights": "Highlights: constant-overhead LDPC interfaces, fault-tolerant cat code states, adaptive abort decoding, entropic defect suppression.", "papers": [ { "arxiv_id": "2602.16948", "title": "Fault-tolerant interfaces for quantum LDPC codes", "authors": "Matthias Christandl, Omar Fawzi, Ashutosh Goswami", "arxiv_url": "https://arxiv.org/abs/2602.16948", "pdf_url": "https://arxiv.org/pdf/2602.16948", "summary": "Constructs fault-tolerant interfaces that reduce protection levels for quantum LDPC codes with constant space overhead when using multiple code blocks. Achieves fault-tolerant quantum state preparation with constant overhead, improving on polylogarithmic requirements. Decoder gradually lowers encoding while increasing simultaneous block decoding to avoid error pileup.", "motivation": "Noisy quantum computers inevitably corrupt an $O(\\delta)$-fraction of qubits during state preparation, necessitating fault-tolerant methods with minimal overhead. This work advances efficient protocols for LDPC codes, crucial for scalable quantum computing beyond current limitations.", "highlights": [ "Constant space overhead for LDPC interfaces", "Fault-tolerant state preparation", "Gradual decoding across blocks" ], "keywords": [ { "label": "quantum LDPC", "reason": "Core code family targeted for fault-tolerant interfaces" }, { "label": "fault-tolerant interfaces", "reason": "Key construction reducing protection levels" }, { "label": "constant overhead", "reason": "Achieves $O(1)$ space improvement over polylog" }, { "label": "error pileup avoidance", "reason": "Decoder strategy via gradual lowering" } ], "emoji": "🔗", "social_summary": "Unlocks constant-overhead fault-tolerant preparation for quantum LDPC codes.", "highlights_oneliner": "LDPC Fault-Tolerant Interfaces" }, { "arxiv_id": "2602.17438", "title": "Fault-tolerant preparation of arbitrary logical states in the cat code", "authors": "Zi-Jie Chen, Weizhou Cai, Liang-Xu Xie, Qing-Xuan Jie, Xu-Bo Zou, Guang-Can Guo, Luyan Sun, Chang-Ling Zou", "arxiv_url": "https://arxiv.org/abs/2602.17438", "pdf_url": "https://arxiv.org/pdf/2602.17438", "summary": "Presents framework for fault-tolerant preparation of arbitrary logical states in four-legged cat code, suppressing incoherent errors via detection. Simulations show $10^{-4}$ logical infidelities and near-quadratic scaling of error rate with physical rate. Protocol suits 3D superconducting cavities and scales to multiple modes.", "motivation": "Balancing control complexity and resource overhead hinders high-fidelity logical state preparation in fault-tolerant computing. Cat codes offer bosonic encoding advantages, making efficient protocols vital for magic states and concatenated correction.", "highlights": [ "$10^{-4}$ logical infidelity", "Quadratic error scaling", "Scalable to multi-mode" ], "keywords": [ { "label": "cat code", "reason": "Specific four-legged encoding for states" }, { "label": "error detection", "reason": "Suppresses decay and dephasing" }, { "label": "bosonic mode", "reason": "Targets superconducting cavity hardware" }, { "label": "magic state", "reason": "Foundation for preparation" } ], "emoji": "🐱", "social_summary": "Enables high-fidelity arbitrary states in cat codes with low error rates.", "highlights_oneliner": "Cat Code State Prep" }, { "arxiv_id": "2602.16929", "title": "Adaptive Aborting Schemes for Quantum Error Correction Decoding", "authors": "Sanidhay Bhambay, Prakash Murali, Neil Walton, Thirupathaiah Vasantam", "arxiv_url": "https://arxiv.org/abs/2602.16929", "pdf_url": "https://arxiv.org/pdf/2602.16929", "summary": "Introduces adaptive abort module using early syndrome data to terminate risky shots, boosting decoder efficiency in surface and color codes. AdAbort outperforms fixed-depth and OSLA, with gains rising to 35% for $d=15$ surface and 60% color codes. Schemes dynamically adjust rounds balancing measurement and restart costs.", "motivation": "Standard QEC runs all syndrome rounds despite early failure signs, wasting resources and increasing latency. Adaptive aborts enhance efficiency for scaling to large architectures without hardware changes.", "highlights": [ "35% efficiency gain surface $d=15$", "60% gain color codes", "Real-time syndrome abort" ], "keywords": [ { "label": "adaptive abort", "reason": "Core module for early termination" }, { "label": "surface code", "reason": "Benchmarked with depolarizing noise" }, { "label": "color code", "reason": "Shows superior gains" }, { "label": "decoder efficiency", "reason": "Key metric improved 5-60%" } ], "emoji": "⏹️", "social_summary": "Adaptive aborts slash QEC decoder workload by up to 60%.", "highlights_oneliner": "Adaptive Abort Decoding" }, { "arxiv_id": "2602.16777", "title": "Entropic Barriers and the Kinetic Suppression of Topological Defects", "authors": "Yi-Lin Tsao, Zhu-Xi Luo", "arxiv_url": "https://arxiv.org/abs/2602.16777", "pdf_url": "https://arxiv.org/pdf/2602.16777", "summary": "Proposes entropic protection via auxiliary reservoirs creating free-energy barriers that grow with temperature, suppressing defect nucleation. In 2D, enhances finite-size stabilization for toric code and BKT transitions with double error reduction. Suggests Rydberg array experiment.", "motivation": "Energetic gaps fail at finite temperature where defects proliferate, destabilizing topological order without massive active correction. Entropic mechanisms offer passive, scalable stabilization for quantum memory in NISQ era.", "highlights": [ "$M^3$ memory lifetime boost", "Double parametric error reduction", "Rydberg toric code setup" ], "keywords": [ { "label": "entropic protection", "reason": "Novel mechanism using reservoirs" }, { "label": "topological defects", "reason": "Suppressed nucleation and transport" }, { "label": "toric code", "reason": "Enhanced finite-size stability" }, { "label": "Rydberg arrays", "reason": "Proposed experimental platform" } ], "emoji": "🔥", "social_summary": "Turns entropy into shield against topological defects.", "highlights_oneliner": "Entropic Defect Barriers" } ] }, "2026-02-19": { "status": "no_qec" }, "2026-02-18": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "self-dual", "weight": 4 }, { "word": "bicycle", "weight": 4 }, { "word": "stacking", "weight": 3 }, { "word": "threshold", "weight": 3 }, { "word": "superdense", "weight": 5 }, { "word": "GKP", "weight": 5 }, { "word": "TFGKP", "weight": 4 }, { "word": "frequency", "weight": 4 }, { "word": "combs", "weight": 4 }, { "word": "entanglement", "weight": 3 }, { "word": "communication", "weight": 3 }, { "word": "displacements", "weight": 3 }, { "word": "Clifford", "weight": 2 }, { "word": "transversal", "weight": 2 }, { "word": "memory", "weight": 2 }, { "word": "capacity", "weight": 2 }, { "word": "photonic", "weight": 2 } ], "social_highlights": "Highlights: self-dual qLDPC codes via stacking for fault-tolerant gates, GKP-inspired high-dimensional superdense coding with 8.91 bits/photon using frequency combs.", "papers": [ { "arxiv_id": "2602.15372", "title": "Self-dual Stacked Quantum Low-Density Parity-Check Codes", "authors": "Ze-Chuan Liu, Chong-Yuan Xu, Yong Xu", "arxiv_url": "https://arxiv.org/abs/2602.15372", "pdf_url": "https://arxiv.org/pdf/2602.15372", "summary": "Introduces a stacking method to construct self-dual qLDPC codes from non-self-dual ones, enabling transversal Clifford gates. Develops double-chain bicycle codes, double-layer bivariate bicycle codes, double-layer twisted BB codes, and double-layer reflection codes with favorable parameters. Numerical analysis shows reduced logical failure rates and high pseudo-thresholds under circuit-level noise.", "motivation": "qLDPC codes promise high encoding rates and distances for fault-tolerant quantum computation, but logical operations remain challenging. Self-dual codes address this by facilitating transversal Clifford gates, crucial for practical implementation.", "highlights": [ "Stacking constructs self-dual qLDPC codes", "Favorable parameters in new code families", "High pseudo-thresholds in noise model" ], "keywords": [ { "label": "self-dual qLDPC", "reason": "Core construction enabling transversal gates" }, { "label": "stacking method", "reason": "Novel technique to build self-dual from non-self-dual codes" }, { "label": "bicycle codes", "reason": "Specific family like double-chain and BB codes developed" }, { "label": "pseudo-threshold", "reason": "Key performance metric showing memory viability" } ], "emoji": "⚡", "social_summary": "Stacks non-self-dual codes into self-dual qLDPC for easy Clifford gates and strong error thresholds.", "highlights_oneliner": "Self-dual stacked qLDPC codes" }, { "arxiv_id": "2602.15125", "title": "GKP-inspired high-dimensional superdense coding with energy-time entanglement", "authors": "Kai-Chi Chang, Arjun Mirani, Murat Can Sarihan, Xiang Cheng, Michelle Harasimowicz, Patrick Hayden, Chee Wei Wong", "arxiv_url": "https://arxiv.org/abs/2602.15125", "pdf_url": "https://arxiv.org/pdf/2602.15125", "summary": "Proposes high-dimensional superdense coding using energy-time entangled biphoton frequency combs as TFGKP states, encoding via time-frequency displacements. Achieves 8.91 bits per photon with realistic telecom components and single-photon detectors. Outperforms prior schemes by over 2x while beating single-photon combs by 4.6x.", "motivation": "Superdense coding boosts classical capacity via entanglement, but photonic implementations hit Bell measurement limits. Time-frequency degrees in combs offer high-dimensional Hilbert spaces with error resilience, enabling practical high-rate protocols.", "highlights": [ "8.91 bits per photon achieved", "481 distinguishable messages", "2.2x better than Kwiat-Weinfurter scheme" ], "keywords": [ { "label": "TFGKP states", "reason": "Entangled time-frequency grid states central to protocol" }, { "label": "superdense coding", "reason": "High-dimensional application boosted by entanglement" }, { "label": "biphoton combs", "reason": "Experimental platform using frequency combs" }, { "label": "time-frequency displacements", "reason": "Encoding mechanism inspired by GKP" } ], "emoji": "🔗", "social_summary": "GKP-inspired protocol sends 8.91 bits per photon via entangled frequency combs, doubling top rates.", "highlights_oneliner": "High-dim superdense coding TFGKP" } ] }, "2026-02-17": { "word_cloud": [ { "word": "transversal", "weight": 5 }, { "word": "stabilizer", "weight": 4 }, { "word": "Clifford", "weight": 5 }, { "word": "no-go", "weight": 4 }, { "word": "permutation-invariant", "weight": 4 }, { "word": "homological", "weight": 3 }, { "word": "decoder", "weight": 5 }, { "word": "qLDPC", "weight": 4 }, { "word": "GKP", "weight": 3 }, { "word": "graph", "weight": 4 }, { "word": "exponential", "weight": 3 }, { "word": "CSS", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "logical", "weight": 5 }, { "word": "gadget", "weight": 3 }, { "word": "symmetric", "weight": 3 }, { "word": "automorphism", "weight": 3 }, { "word": "deletion", "weight": 3 } ], "social_highlights": "Highlights: no-go for multi-qubit Clifford gadgets, PI code theory, homological transversal gates, qLDPC logic, graph decoders, encoded exponentials, TF-GKP qubits.", "papers": [ { "arxiv_id": "2602.13395", "title": "No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits", "authors": "Aranya Chakraborty, Daniel Gottesman", "arxiv_url": "https://arxiv.org/abs/2602.13395", "pdf_url": "https://arxiv.org/pdf/2602.13395", "summary": "Proves no stabilizer code admits fully transversal Clifford group on more than one logical qubit. Shows fold-transversal Clifford impossible for more than two logical qubits. Introduces $k$-fold transversal gadgets requiring at least $k$-fold for $k$ logical qubits.", "motivation": "Stabilizer codes like $[[7,1,3]]$ Steane enable transversal Clifford for single qubits, but multi-qubit extensions remain elusive despite need for scalable fault-tolerant computation. Results constrain gadget designs, implying complex constructions for multi-logical qubit Clifford operations essential for universality.", "highlights": [ "No transversal Clifford for $>1$ logical qubit", "No fold-transversal for $>2$ logical qubits", "$k$-fold gadgets for $k$ qubits" ], "keywords": [ { "label": "no-go theorem", "reason": "Proves fundamental impossibility for transversal Clifford gadgets" } ], "emoji": "🚫", "social_summary": "Proves no stabilizer code supports transversal Clifford gates for multiple logical qubits.", "highlights_oneliner": "No-go for multi-qubit gadgets" }, { "arxiv_id": "2602.13638", "title": "A theory of quantum error correction for permutation-invariant codes", "authors": "Yingkai Ouyang, Gavin K. Brennen", "arxiv_url": "https://arxiv.org/abs/2602.13638", "pdf_url": "https://arxiv.org/pdf/2602.13638", "summary": "Develops general QEC theory for permutation-invariant codes using symmetric group representation theory. Constructs efficient algorithms via angular momentum measurements, Schur transforms for any correctible error. Simplifies erasure/deletion correction on PI codes.", "motivation": "Stabilizer codes limit non-Pauli and deletion error correction, relevant for Rydberg arrays; PI codes' symmetry ignores error locations, enabling simpler amplitude and loss correction with lower overhead.", "highlights": [ "PI code QEC via representation theory", "Deletion error correction", "Linear-time syndrome extraction" ], "keywords": [ { "label": "permutation-invariant codes", "reason": "Core code family with symmetry for location-independent errors" }, { "label": "symmetric group", "reason": "Representation theory enables efficient decoding" }, { "label": "deletion errors", "reason": "Correctable without location tracking" } ], "emoji": "🔄", "social_summary": "Unveils theory for correcting errors in permutation-invariant quantum codes.", "highlights_oneliner": "PI codes QEC theory" }, { "arxiv_id": "2602.14499", "title": "Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes", "authors": "Junichi Haruna", "arxiv_url": "https://arxiv.org/abs/2602.14499", "pdf_url": "https://arxiv.org/pdf/2602.14499", "summary": "Characterizes transversal Pauli $Z$ rotations in CSS codes via Bockstein homomorphism in homology. Proves linear independence of $X$-stabilizers ensures all discrete $Z$ rotations transversal under commutativity modulo $2^m$. Identifies homological obstruction to refinement.", "motivation": "Eastin-Knill limits universal transversal gates, but diagonal gates like $T$ in triorthogonal codes need unified structural origin; homological view unifies ad hoc algebraic conditions for CSS transversal gates.", "highlights": [ "Bockstein governs refinement", "All discrete $Z$ transversal in CSS", "Homological obstruction" ], "keywords": [ { "label": "homology theory", "reason": "Characterizes transversal implementability" }, { "label": "Bockstein homomorphism", "reason": "Obstruction to finer rotations" }, { "label": "CSS codes", "reason": "Framework for diagonal gates" } ], "emoji": "🔗", "social_summary": "Reveals homological roots of transversal diagonal gates in CSS codes.", "highlights_oneliner": "Homological transversal gates" }, { "arxiv_id": "2602.13876", "title": "Quantum computation and quantum error correction: the theoretical minimum", "authors": "Mark Wildon", "arxiv_url": "https://arxiv.org/abs/2602.13876", "pdf_url": "https://arxiv.org/pdf/2602.13876", "summary": "Introduces QC and QEC emphasizing stabilizers and Lie theory via $SU(2) \\to SO_3$. Covers entanglement, CNOT, Deutsch-Jozsa, Steane $[[7,1,3]]$-code. Develops unitary evolution and Born rule as needed using circuit model.", "motivation": "Foundational pedagogy links physics, math for QC entry; stabilizers central to modern QEC, Lie theory clarifies qubit states vs measurements amid rapid experimental advances.", "highlights": [ "Stabilizers via Lie theory", "$[[7,1,3]]$-code example", "Circuit model throughout" ], "keywords": [ { "label": "Steane code", "reason": "Main QEC example $[[7,1,3]]$" }, { "label": "stabilizers", "reason": "Emphasized mathematical foundation" }, { "label": "Lie theory", "reason": "Explains qubit states/measurements" } ], "emoji": "📚", "social_summary": "Introductory notes on quantum computing and error correction basics.", "highlights_oneliner": "QC and QEC minimum" }, { "arxiv_id": "2602.14273", "title": "RASCqL: Reaction-time-limited Architecture for Space-time-efficient Complex qLDPC Logic", "authors": "Willers Yang, Jason Chadwick, Mariesa H. Teo, Joshua Viszlai, Fred Chong", "arxiv_url": "https://arxiv.org/abs/2602.14273", "pdf_url": "https://arxiv.org/pdf/2602.14273", "summary": "Introduces RASCqL CISQ for qLDPC embedding complex Clifford instructions as automorphisms. Achieves $2\\times$-$7\\times$ footprint reduction vs surface codes at $p=2\\times10^{-3}$. Leverages neutral-atom arrays for fast QEC and transversal ops.", "motivation": "qLDPC reduce overhead but need efficient ISAs for utility-scale; surface codes high overhead, RASCqL tailors for arithmetic, lookups, distillation in reconfigurable hardware.", "highlights": [ "qLDPC CISQ architecture", "Footprint $2\\times$-$7\\times$ reduction", "Neutral-atom transversal" ], "keywords": [ { "label": "qLDPC", "reason": "Code family for low overhead" }, { "label": "CISQ", "reason": "Complex instruction-set quantum" }, { "label": "neutral-atom arrays", "reason": "Hardware for fast QEC" } ], "emoji": "⚙️", "social_summary": "RASCqL boosts qLDPC efficiency for fault-tolerant logic.", "highlights_oneliner": "qLDPC logic architecture" }, { "arxiv_id": "2602.14730", "title": "Faster Optimal Decoder for Graph Codes with a Single Logical Qubit", "authors": "Nirupam Basak, Goutam Paul", "arxiv_url": "https://arxiv.org/abs/2602.14730", "pdf_url": "https://arxiv.org/pdf/2602.14730", "summary": "Develops hierarchical polynomial-time decoder for single-logical graph codes exploiting graph state structure. Achieves optimal performance at lower hierarchy levels avoiding full MLD. Maps noise to effective Pauli via syndrome.", "motivation": "MLD NP-hard for graph codes underlying surface/topological; efficient decoders critical for reliable QEC performance in scalable quantum computers.", "highlights": [ "Polynomial hierarchical decoder", "Optimal at low levels", "Pauli correction from syndrome" ], "keywords": [ { "label": "graph codes", "reason": "Stabilizer subclass from graphs" }, { "label": "hierarchical decoder", "reason": "Faster optimal decoding" }, { "label": "syndrome structure", "reason": "Exploits post-measurement state" } ], "emoji": "📊", "social_summary": "Faster optimal decoder for single-logical graph codes.", "highlights_oneliner": "Graph code decoder" }, { "arxiv_id": "2602.13399", "title": "Protection of Exponential Operation using Stabilizer Codes in the Early Fault Tolerance Era", "authors": "Dawei Zhong, Todd A. Brun", "arxiv_url": "https://arxiv.org/abs/2602.13399", "pdf_url": "https://arxiv.org/pdf/2602.13399", "summary": "Encodes $\\exp(-i\\theta P)$ in stabilizer codes like $[[5,1,3]]$, $[[7,1,3]]$, $[[15,7,3]]$ with low overhead. Achieves 4-7x noise reduction vs unencoded at current noise, discarding $<3\\%$ runs. Uses error-detecting $[[n,n-2,2]]$ codes.", "motivation": "Non-Clifford ops limit EFTQC due to magic distillation overhead; simple stabilizer encodings suppress noise for practical advantage on near-term hardware.", "highlights": [ "Encoded $\\exp(-i\\theta P)$ circuits", "4-7x noise suppression", "Low discard EFTQC" ], "keywords": [ { "label": "exponential maps", "reason": "Protected non-Clifford ops" }, { "label": "error-detecting codes", "reason": "$[[n,n-2,2]]$ for early FT" }, { "label": "postselection", "reason": "Reduces logical error" } ], "emoji": "📈", "social_summary": "Encodes exponentials in stabilizers for early fault tolerance.", "highlights_oneliner": "Exponential protection" }, { "arxiv_id": "2602.14461", "title": "A hardware-native time-frequency GKP logical qubit toward fault-tolerant photonic operation", "authors": "Tai Hyun Yoon", "arxiv_url": "https://arxiv.org/abs/2602.14461", "pdf_url": "https://arxiv.org/pdf/2602.14461", "summary": "Realizes TF GKP qubit in single-photon frequency combs via entangled biphoton sources. Anchors stabilizers with comb reference for Gaussian displacement errors. Enables phase/delay logical ops and interferometric syndrome extraction.", "motivation": "GKP promising for bosonic FT but needs hardware-native photonic encoding; TF phase space leverages time-frequency conjugacy for propagating fault-tolerant qubits.", "highlights": [ "TF GKP photonic qubit", "Comb-anchored stabilizers", "Displacement recovery" ], "keywords": [ { "label": "time-frequency GKP", "reason": "Hardware-native encoding" }, { "label": "frequency combs", "reason": "Reference for lattice" }, { "label": "biphoton sources", "reason": "Finite-energy grids" } ], "emoji": "🌊", "social_summary": "Hardware-native time-frequency GKP qubit for photonics.", "highlights_oneliner": "TF GKP qubit" } ] }, "2026-02-16": { "word_cloud": [ { "word": "compilation", "weight": 5 }, { "word": "Clifford", "weight": 4 }, { "word": "Floquet", "weight": 5 }, { "word": "toric", "weight": 4 }, { "word": "fermionic", "weight": 4 }, { "word": "teleportation", "weight": 5 }, { "word": "puncturing", "weight": 4 }, { "word": "stabilizer", "weight": 3 }, { "word": "logical", "weight": 4 }, { "word": "depth", "weight": 3 }, { "word": "lattice", "weight": 4 }, { "word": "measurement", "weight": 3 }, { "word": "entanglement", "weight": 4 }, { "word": "purification", "weight": 3 }, { "word": "simulation", "weight": 3 }, { "word": "symplectic", "weight": 2 }, { "word": "Kekulé", "weight": 3 }, { "word": "syndrome", "weight": 2 }, { "word": "CSS", "weight": 3 } ], "social_highlights": "Highlights: optimizes Clifford compilation for low-depth circuits, introduces 3D Floquet fermionic toric code with full logicals, enables adaptive teleportation via code puncturing.", "papers": [ { "arxiv_id": "2602.12831", "title": "Optimized Compilation of Logical Clifford Circuits", "authors": "Alexander Popov, Nico Meyer, Daniel D. Scherer, Guido Dietl", "arxiv_url": "https://arxiv.org/abs/2602.12831", "pdf_url": "https://arxiv.org/pdf/2602.12831", "summary": "Proposes compiling quantum simulation primitives as single blocks on the $[[n,n-2,2]]$ code family to reduce circuit depth over gate-by-gate methods. Introduces a methodology to generalize small-instance primitives into size-invariant, depth-efficient strategies. Simulations demonstrate significant error-rate reductions, positioning it for peephole-based compilers.", "motivation": "Gate-by-gate compilation inflates overhead in surface codes due to repeated measurements and deformations, while prior logical Clifford synthesis scales poorly with circuit size. This matters for scaling fault-tolerant quantum computing by minimizing depth, space-time volume, and aligning with distillation and syndrome extraction.", "highlights": [ "Depth-efficient $[[n,n-2,2]]$ compilation primitives", "Size-invariant strategies from small instances", "Significant simulated error-rate reductions" ], "keywords": [ { "label": "$[[n,n-2,2]]$ codes", "reason": "Focus code family enabling exhaustive primitive comparison" }, { "label": "Clifford quantum simulation kernels", "reason": "Key primitives targeted for block compilation" }, { "label": "symplectic-geometry synthesis", "reason": "Foundation for enumerating logical realizations" }, { "label": "peephole compilers", "reason": "Envisioned application for extensible optimization" } ], "emoji": "📚", "social_summary": "Optimizes logical Clifford circuits into depth-efficient blocks slashing error rates.", "highlights_oneliner": "Clifford Compilation Optimization" }, { "arxiv_id": "2602.12685", "title": "Floquet implementation of a 3d fermionic toric code with full logical code space", "authors": "Yoshito Watanabe, Bianca Bannenberg, Simon Trebst", "arxiv_url": "https://arxiv.org/abs/2602.12685", "pdf_url": "https://arxiv.org/pdf/2602.12685", "summary": "Introduces a 3D Floquet code realizing a fermionic toric code via two-body measurements on a tricoordinated lattice preserving all three logical qubits. Uses Kekulé-like geometry where edge deletion yields loop-decomposable subgraphs to avoid logical collapse. Appends measurements to extract full syndromes without disturbing logical subspace.", "motivation": "2D Floquet codes like Hastings-Haah reduce overhead over static codes, but 3D extensions were limited despite higher-dimensional robustness and topological stability. Matters for fault-tolerant non-Clifford gates via emergent symmetries in 3D topological orders.", "highlights": [ "3D fermionic toric Floquet code", "Full 3 logical qubits preserved", "Loop-decomposable lattice geometry" ], "keywords": [ { "label": "Floquet codes", "reason": "Dynamically generated via periodic two-body measurements" }, { "label": "fermionic toric code", "reason": "Instantaneous stabilizer group target" }, { "label": "Kekulé lattice", "reason": "3D geometry preventing logical collapse" }, { "label": "monitored Kitaev models", "reason": "Broader family from tricoordinated lattices" } ], "emoji": "🧭", "social_summary": "Unveils 3D Floquet code for fermionic toric with preserved logical qubits.", "highlights_oneliner": "3D Floquet Fermionic Toric" }, { "arxiv_id": "2602.12309", "title": "Resource-Adaptive Teleportation Under Imperfect Entanglement: A Code-Puncturing Framework", "authors": "Mahmoud Saad Abouamer, Jaron Skovsted Gundersen, Søren Pilegaard Rasmussen, Petar Popovski", "arxiv_url": "https://arxiv.org/abs/2602.12309", "pdf_url": "https://arxiv.org/pdf/2602.12309", "summary": "Supplements entanglement purification with punctured CSS codes to adapt rates and error profiles for imperfect-EPR teleportation. Enables meeting reliability targets across purification regimes without hardware code switching. Numerical results show lowest logical errors in varying regimes versus fixed-rate encoding.", "motivation": "Heterogeneous EPR fidelities in multi-user quantum networks limit teleportation, with purification adding latency and fixed QEC failing across error structures. Enables adaptive reliability for distributed computing under varying entanglement and constraints.", "highlights": [ "Punctured CSS for teleportation", "Adapts to purification regimes", "Reduces required EPR fidelity" ], "keywords": [ { "label": "code puncturing", "reason": "Generates adaptive code variants from single stabilizer" }, { "label": "entanglement purification", "reason": "Complementary to QEC for EPR fidelity boost" }, { "label": "encoded teleportation", "reason": "Combines purification and QEC for reliability" } ], "emoji": "🔗", "social_summary": "Punctures codes for reliable teleportation across entanglement qualities.", "highlights_oneliner": "Punctured Teleportation Adaptation" } ] }, "2026-02-13": { "word_cloud": [ { "word": "QLDPC", "weight": 5 }, { "word": "Pinnacle", "weight": 4 }, { "word": "RSA-2048", "weight": 5 }, { "word": "anyons", "weight": 4 }, { "word": "braiding", "weight": 3 }, { "word": "non-Abelian", "weight": 4 }, { "word": "gauging", "weight": 4 }, { "word": "Clifford", "weight": 3 }, { "word": "unlearnable", "weight": 4 }, { "word": "CMI", "weight": 3 }, { "word": "surface", "weight": 3 }, { "word": "magic", "weight": 3 }, { "word": "topological", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "decoder", "weight": 2 }, { "word": "spacetime", "weight": 4 }, { "word": "bicycle", "weight": 2 }, { "word": "syndrome", "weight": 2 } ], "social_highlights": "Highlights: Pinnacle slashes RSA qubits to 100k, anyon braiding goes fault-tolerant, non-Abelian qLDPC via gauging, unlearnable phases reveal ML limits.", "papers": [ { "arxiv_id": "2602.11457", "title": "The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes", "authors": "Paul Webster, Lucas Berent, Omprakash Chandra, Evan T. Hockings, Nouédyn Baspin, Felix Thomsen, Samuel C. Smith, Lawrence Z. Cohen", "arxiv_url": "https://arxiv.org/abs/2602.11457", "pdf_url": "https://arxiv.org/pdf/2602.11457", "summary": "Introduces the Pinnacle Architecture using QLDPC codes for universal fault-tolerant quantum computation with spacetime overhead far below surface codes. Demonstrates factoring 2048-bit RSA with $<100,000$ physical qubits at $10^{-3}$ error rate, $1\\mu s$ cycle, $10\\mu s$ reaction time. Achieves order-of-magnitude qubit reduction versus prior architectures.", "motivation": "Surface code architectures require millions of qubits for utility-scale computation, posing massive scaling challenges. Pinnacle uses QLDPC codes with efficient gadgets to slash space overhead without inflating time costs.", "highlights": [ "$<100,000$ qubits break RSA-2048", "Pinnacle Architecture with QLDPC", "10x fewer qubits than surface code" ], "keywords": [ { "label": "Pinnacle Architecture", "reason": "Novel modular QLDPC-based fault-tolerant design" }, { "label": "RSA-2048 factoring", "reason": "Benchmark application showing qubit reduction" }, { "label": "magic engine", "reason": "New component for efficient magic state handling" }, { "label": "processing units", "reason": "Bridged QLDPC blocks enabling parallel computation" } ], "emoji": "🏔️", "social_summary": "Pinnacle Architecture breaks RSA-2048 with just 100k qubits using QLDPC codes!", "highlights_oneliner": "100k-qubit RSA breaker" }, { "arxiv_id": "2602.11258", "title": "Quantum computing with anyons is fault tolerant", "authors": "Anasuya Lyons, Benjamin J. Brown", "arxiv_url": "https://arxiv.org/abs/2602.11258", "pdf_url": "https://arxiv.org/pdf/2602.11258", "summary": "Presents error-correction scheme enabling robust universal quantum computation via anyon braiding on noisy hardware. Shows arbitrarily small failure rates below noise threshold using modern circuit elements. Enables fault-tolerant topological computing without zero-temperature ground states.", "motivation": "Kitaev's anyon model promised inherent robustness but assumed perfect zero-temperature states. Modern hardware requires active error correction for topological approaches.", "highlights": [ "Fault-tolerant anyon braiding", "Threshold theorem for topological QC", "Works with noisy circuit elements" ], "keywords": [ { "label": "anyon braiding", "reason": "Core computation mechanism made fault-tolerant" }, { "label": "topological error correction", "reason": "Active correction for Kitaev model" }, { "label": "noise threshold", "reason": "Arbitrarily low failure rates proven" }, { "label": "modern hardware", "reason": "Adapts to current noisy circuit tech" } ], "emoji": "🌀", "social_summary": "Anyon braiding becomes fault-tolerant for real quantum hardware!", "highlights_oneliner": "Fault-tolerant anyons" }, { "arxiv_id": "2602.12228", "title": "Non-Abelian Quantum Low-Density Parity Check Codes and Non-Clifford Operations from Gauging Logical Gates via Measurements", "authors": "Maine Christos, Chiu Fan Bowen Lo, Vedika Khemani, Rahul Sahay", "arxiv_url": "https://arxiv.org/abs/2602.12228", "pdf_url": "https://arxiv.org/pdf/2602.12228", "summary": "Constructs non-Abelian qLDPC codes by gauging transversal Clifford gates via measurement/feedback. Two approaches: Poincaré duality codes yield Type-III twisted double stabilizers; general codes use tailored ancilla graphs. Enables magic state preparation and non-Clifford gates on qLDPC codes.", "motivation": "qLDPC codes offer high-rate error correction but lack non-Abelian anyons for universal QC. Gauging provides path to non-Clifford operations while preserving qLDPC advantages.", "highlights": [ "Non-Abelian qLDPC construction", "Clifford gate gauging", "Magic state preparation protocol" ], "keywords": [ { "label": "gauging", "reason": "Measurement-based code transformation technique" }, { "label": "non-Abelian qLDPC", "reason": "Novel code family with topological properties" }, { "label": "magic preparation", "reason": "Non-Clifford operations on qLDPC" }, { "label": "Poincaré duality", "reason": "First construction approach for Clifford stabilizers" } ], "emoji": "🔄", "social_summary": "Non-Abelian qLDPC codes via gate gauging unlock universal quantum computing!", "highlights_oneliner": "Gauged non-Abelian qLDPC" }, { "arxiv_id": "2602.11262", "title": "Unlearnable phases of matter", "authors": "Tarun Advaith Kumar, Yijian Zou, Amir-Reza Negari, Roger G. Melko, Timothy H. Hsieh", "arxiv_url": "https://arxiv.org/abs/2602.11262", "pdf_url": "https://arxiv.org/pdf/2602.11262", "summary": "Proves non-trivial mixed-state phases with long-range CMI are unlearnable by autoregressive neural networks. Introduces conditional mutual information as LI diagnostic linking to learning hardness. Validates on toric/surface code syndromes showing ML failure at error thresholds.", "motivation": "Machine learning excels at learning phases but fails mysteriously on some mixed states. Understanding fundamental learning limits reveals new phase diagnostics and error thresholds.", "highlights": [ "CMI predicts unlearnability", "Long-range entanglement blocks ML", "Surface code learning threshold" ], "keywords": [ { "label": "unlearnable phases", "reason": "Fundamentally hard mixed-state phases" }, { "label": "conditional mutual information", "reason": "Diagnostic for learning hardness" }, { "label": "LI states", "reason": "Locally indistinguishable barrier to ML" }, { "label": "syndrome learning", "reason": "Practical validation on error codes" } ], "emoji": "🚫", "social_summary": "Some quantum phases are mathematically unlearnable by neural networks!", "highlights_oneliner": "Unlearnable quantum phases" } ] }, "2026-02-12": { "word_cloud": [ { "word": "hyperbolic", "weight": 5 }, { "word": "erasure", "weight": 5 }, { "word": "thresholds", "weight": 4 }, { "word": "surface", "weight": 4 }, { "word": "codes", "weight": 4 }, { "word": "robustness", "weight": 4 }, { "word": "optimal", "weight": 4 }, { "word": "control", "weight": 4 }, { "word": "state", "weight": 4 }, { "word": "discrimination", "weight": 5 }, { "word": "QSD", "weight": 3 }, { "word": "tessellations", "weight": 3 }, { "word": "Pauli", "weight": 3 }, { "word": "noise", "weight": 3 }, { "word": "fine-grained", "weight": 3 }, { "word": "toggling-frame", "weight": 3 }, { "word": "CrossQSD", "weight": 3 }, { "word": "FitQSD", "weight": 3 }, { "word": "Naimark", "weight": 2 } ], "social_highlights": "Highlights: hyperbolic codes boost erasure thresholds, robust control fixes numerical flaws, error-tolerant QSD enables noisy quantum discrimination.", "papers": [ { "arxiv_id": "2602.10423", "title": "Erasure Thresholds for Hyperbolic and Semi-Hyperbolic Surface Codes", "authors": "Aygul Azatovna Galimova", "arxiv_url": "https://arxiv.org/abs/2602.10423", "pdf_url": "https://arxiv.org/pdf/2602.10423", "summary": "Constructs 14 hyperbolic CSS surface codes from $\\{8,3\\}$, $\\{10,3\\}$, $\\{12,3\\}$ tessellations and 11 semi-hyperbolic codes, simulating them under circuit-level erasure and Pauli noise. Reports pseudothresholds increasing with code size ($0.24$--$0.49\\%$ for $\\{8,3\\}$) and high erasure thresholds ($p^*_\\mathrm{E} > 5\\%$ for most), with erasure-to-Pauli ratios up to $5.2\\times$. Fine-grained families achieve superior Pauli ($0.67$--$0.68\\%$) and erasure ($3.0$--$3.5\\%$) thresholds.", "motivation": "Hyperbolic surface codes offer constant encoding rate $k=\\Theta(n)$ with logarithmic distance $d=O(\\log n)$, building on prior CSS and Floquet formulations with established Pauli thresholds. Erasure noise, detectable in platforms like photonic qubits and superconducting circuits, yields $4$--$5\\times$ higher thresholds than Pauli noise, motivating tailored codes for hardware with known error locations.", "highlights": [ "Erasure thresholds $>5\\%$ for most codes", "Erasure-to-Pauli ratios $2.7$--$5.2\\times$", "Fine-grained Pauli pseudothresholds $0.67$--$0.68\\%$" ], "keywords": [ { "label": "hyperbolic tessellations", "reason": "Core construction basis using $\\{8,3\\}$, $\\{10,3\\}$, $\\{12,3\\}$ families" }, { "label": "erasure noise", "reason": "Key noise model with high thresholds $p^*_\\mathrm{E} > 5\\%$" }, { "label": "fine-grained codes", "reason": "Semi-hyperbolic scaling achieving top ratios $4.5$--$5.2\\times$" }, { "label": "pseudothresholds", "reason": "Measured metric increasing with code size per family" } ], "emoji": "🧭", "social_summary": "Built 25 hyperbolic codes with erasure thresholds over 5%, far outpacing Pauli noise.", "highlights_oneliner": "Hyperbolic Erasure Thresholds" }, { "arxiv_id": "2602.10349", "title": "Comparing and correcting robustness metrics for quantum optimal control", "authors": "Andrew T. Kamen, Samuel Fine, Bikrant Bhattacharyya, Frederic T. Chong, Andy J. Goldschmidt", "arxiv_url": "https://arxiv.org/abs/2602.10349", "pdf_url": "https://arxiv.org/pdf/2602.10349", "summary": "Compares adjoint end-point and toggling-frame approximations to first-order error susceptibility, revealing numerical differences despite theoretical equivalence. Introduces discretization correction improving toggling-frame estimator accuracy. Frames robustness as direct constrained optimal control objective for precise, physics-informed pulses under hardware limits.", "motivation": "Gaussian controls are fast but sensitive to coherent errors from drift and miscalibration across platforms like superconducting qubits and ions, pressuring QEC overhead. Robust control reduces recalibration needs and boosts uptime, balancing complexity against decoherence and constraints via optimal trajectory optimization.", "highlights": [ "Novel toggling-frame discretization correction", "Numerical differences in robustness estimators", "Constrained optimization isolates robustness" ], "keywords": [ { "label": "toggling-frame", "reason": "Robustness metric with identified numerical issues and correction" }, { "label": "adjoint end-point", "reason": "Alternative susceptibility approximation for comparison" }, { "label": "robust optimal control", "reason": "Direct framework handling fidelity and hardware constraints" }, { "label": "coherent errors", "reason": "Targeted noise from hardware drift motivating robustness" } ], "emoji": "⚡", "social_summary": "Fixed key flaws in robust quantum control metrics for error-resistant gates.", "highlights_oneliner": "Robust Control Metrics" }, { "arxiv_id": "2602.10731", "title": "Error-Tolerant Quantum State Discrimination: Optimization and Quantum Circuit Synthesis", "authors": "Chien-Kai Ma, Bo-Hung Chen, Tian-Fu Chen, Dah-Wei Chiou, Jie-Hong Roland Jiang", "arxiv_url": "https://arxiv.org/abs/2602.10731", "pdf_url": "https://arxiv.org/pdf/2602.10731", "summary": "Proposes CrossQSD generalizing unambiguous discrimination with tunable confidence and FitQSD optimizing outcome distributions to mimic noiseless cases. Introduces hybrid-objective framework interpolating MED and FitQSD, solved via convex/semidefinite programs. Provides Naimark-based circuit synthesis for efficient noisy implementations with open-source toolkit.", "motivation": "QSD underpins quantum cryptography (BB84, B92) and communication, addressing nonorthogonal state indistinguishability via strategies like MED and UQSD trading accuracy for confidence. Error-tolerant variants ensure reliable performance under noise, enabling practical deployment on current devices.", "highlights": [ "CrossQSD and FitQSD strategies", "Hybrid MED-FitQSD convex framework", "Naimark circuit synthesis toolkit" ], "keywords": [ { "label": "CrossQSD", "reason": "Generalizes UQSD with tunable confidence bounds" }, { "label": "FitQSD", "reason": "Optimizes distributions for noisy approximation" }, { "label": "Naimark dilation", "reason": "Basis for hardware-efficient circuit synthesis" }, { "label": "unambiguous discrimination", "reason": "Historical strategy extended for error tolerance" } ], "emoji": "🔍", "social_summary": "New error-tolerant QSD methods with circuits for noisy quantum devices.", "highlights_oneliner": "Noisy QSD Optimization" } ] }, "2026-02-11": { "word_cloud": [ { "word": "Clifford", "weight": 4 }, { "word": "transversal", "weight": 5 }, { "word": "surface", "weight": 5 }, { "word": "schedule", "weight": 4 }, { "word": "shuttling", "weight": 4 }, { "word": "coherence", "weight": 4 }, { "word": "tomography", "weight": 3 }, { "word": "neural", "weight": 3 }, { "word": "oracle", "weight": 3 }, { "word": "separation", "weight": 3 }, { "word": "Hamming", "weight": 3 }, { "word": "communication", "weight": 3 }, { "word": "hook", "weight": 4 }, { "word": "diagonal", "weight": 3 }, { "word": "mitigation", "weight": 4 }, { "word": "mobile", "weight": 4 }, { "word": "spin", "weight": 4 }, { "word": "silicon", "weight": 3 }, { "word": "list-recovery", "weight": 2 }, { "word": "QMA", "weight": 2 }, { "word": "BQP", "weight": 2 } ], "social_highlights": "Highlights: full Clifford for high-rate codes, QMA-QCMA oracle separation, diagonal surface code scheduling, constant-overhead quantum I/O, mobile spin coherence, NN tomography.", "papers": [ { "arxiv_id": "2602.09788", "title": "Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates", "authors": "Theerapat Tansuwannont, Tim Chan, Ryuji Takagi", "arxiv_url": "https://arxiv.org/abs/2602.09788", "pdf_url": "https://arxiv.org/pdf/2602.09788", "summary": "Constructs a generating set of the full logical Clifford group using only transversal and fold-transversal gates for a family of self-dual quantum Reed-Muller codes with parameters $[[n=2^m,k={m \\choose m/2}\\approx n/\\sqrt{\\pi\\log_2(n)/2},d=2^{m/2}=\\sqrt{n}]]$ where $m$ is even. Enables fault-tolerant implementation of any addressable Clifford gate without ancilla qubits. First such construction for codes where $k$ grows near-linearly in $n$ up to a $1/\\sqrt{\\log n}$ factor.", "motivation": "High-rate codes are essential for resource-efficient large-scale quantum computers, but realizing addressable logical gates fault-tolerantly often requires ancilla qubits or complex circuits. Transversal and fold-transversal gates offer constant-depth fault-tolerant implementations without ancillas, but were previously limited for high-rate codes.", "highlights": [ "Full logical Clifford group via transversal gates", "High-rate Reed-Muller codes $k\\approx n/\\sqrt{\\log n}$", "No ancilla qubits needed" ], "keywords": [ { "label": "Reed-Muller codes", "reason": "Specific high-rate self-dual code family studied with parameters $[[n=2^m,k={m \\choose m/2},d=2^{m/2}]]$" }, { "label": "fold-transversal gates", "reason": "Key technique enabling full Clifford group without ancillas" }, { "label": "addressable gates", "reason": "Enables gates on subsets of logical qubits fault-tolerantly" }, { "label": "constant-depth circuits", "reason": "Achieves fault-tolerance with minimal resource overhead" } ], "emoji": "✨", "social_summary": "Built full Clifford group for high-rate codes using only transversal gates—no ancillas needed!", "highlights_oneliner": "Full Clifford for high-rate codes" }, { "arxiv_id": "2602.09385", "title": "Separating Quantum and Classical Advice with Good Codes", "authors": "John Bostanci, Andrew Huang, Vinod Vaikuntanathan", "arxiv_url": "https://arxiv.org/abs/2602.09385", "pdf_url": "https://arxiv.org/pdf/2602.09385", "summary": "Proves unconditional classical oracle separation between $\\mathsf{QMA}$ and $\\mathsf{QCMA}$. Extends to first unconditional classical oracle separation between $\\mathsf{BQP}/\\mathsf{qpoly}$ and $\\mathsf{BQP}/\\mathsf{poly}$. Uses code intersection problem with good list-recovery codes.", "motivation": "Oracle separations clarify computational power differences between quantum proof and advice classes, building on prior quantum separations. Understanding these separations guides complexity theory and quantum advantage proofs.", "highlights": [ "QMA-QCMA classical oracle separation", "BQP/qpoly vs BQP/poly separation", "List-recovery code intersections" ], "keywords": [ { "label": "oracle separation", "reason": "Proves $\\mathsf{QMA} \\neq \\mathsf{QCMA}$ unconditionally with classical oracle" }, { "label": "code intersection", "reason": "Core problem from Yamakawa-Zhandry enabling separations" }, { "label": "list-recovery codes", "reason": "Provides extremely good properties for oracle construction" }, { "label": "quantum advice", "reason": "Separates $\\mathsf{qpoly}$ vs $\\mathsf{poly}$ advice classes" } ], "emoji": "🔍", "social_summary": "Proved classical oracle separations between quantum proof and advice classes using clever codes.", "highlights_oneliner": "QMA-QCMA oracle separation" }, { "arxiv_id": "2602.09099", "title": "Surface code off-the-hook: diagonal syndrome-extraction scheduling", "authors": "Gilad Kishony, Austin Fowler", "arxiv_url": "https://arxiv.org/abs/2602.09099", "pdf_url": "https://arxiv.org/pdf/2602.09099", "summary": "Introduces diagonal syndrome-extraction schedule for rotated surface code that orients hook errors diagonally, preserving full code distance regardless of boundary geometry. Achieves 6-time-step period vs 7 for traditional N/Z schedules. Simplifies circuit construction with globally uniform X/Z plaquette schedules.", "motivation": "Hook errors in surface codes can halve circuit-level distance if schedules align with logical operators, requiring complex geometry-dependent N/Z schedule planning. Uniform schedules that maintain full distance across lattice surgery primitives would simplify fault-tolerant implementations.", "highlights": [ "Diagonal schedule preserves full $d$", "6T period vs traditional 7T", "Geometry-independent hook immunity" ], "keywords": [ { "label": "diagonal schedule", "reason": "New uniform syndrome extraction avoiding hook-logical alignment" }, { "label": "hook errors", "reason": "Central problem addressed—auxiliary errors propagating to correlated data errors" }, { "label": "rotated surface code", "reason": "Target architecture with weight-4 stabilizers on square lattice" }, { "label": "lattice surgery", "reason": "Primitives like spatial Hadamard tested with new schedule" } ], "emoji": "🧭", "social_summary": "Diagonal surface code scheduling eliminates hook errors while simplifying circuits.", "highlights_oneliner": "Diagonal surface code scheduling" }, { "arxiv_id": "2602.09103", "title": "Constant-space-overhead fault-tolerant quantum input/output and communication", "authors": "Paula Belzig, Hayata Yamasaki", "arxiv_url": "https://arxiv.org/abs/2602.09103", "pdf_url": "https://arxiv.org/pdf/2602.09103", "summary": "Develops fault-tolerant quantum I/O circuits using concatenated quantum Hamming codes with constant space overhead encoding many logical qubits. Enables higher entanglement-assisted communication rates than single-logical-qubit concatenation approaches. Leverages limited noise correlations in high-rate Hamming code syndrome qubits.", "motivation": "Quantum communication requires fault-tolerant encoding/decoding on noisy devices, but prior analyses used inefficient single-logical-qubit concatenations. Constant-overhead codes enable practical analysis of achievable rates for distributed quantum computing and repeaters.", "highlights": [ "Constant space overhead Hamming codes", "Higher fault-tolerant communication rates", "Quantum I/O interfaces" ], "keywords": [ { "label": "quantum Hamming codes", "reason": "High-rate codes enabling constant space overhead concatenation" }, { "label": "fault-tolerant I/O", "reason": "Modular circuits with quantum input/output interfaces" }, { "label": "entanglement-assisted communication", "reason": "Application yielding superior achievable rates" } ], "emoji": "🔗", "social_summary": "Constant-overhead codes boost fault-tolerant quantum communication rates.", "highlights_oneliner": "Constant-overhead quantum I/O" }, { "arxiv_id": "2602.09179", "title": "Coherence Protection for Mobile Spin Qubits in Silicon", "authors": "Jan A. Krzywda, Yuta Matsumoto, Maxim De Smet, Larysa Tryputen, Sander L. de Snoo, Sergey V. Amitonov, Evert van Nieuwenburg, Giordano Scappucci, Lieven M. K. Vandersypen", "arxiv_url": "https://arxiv.org/abs/2602.09179", "pdf_url": "https://arxiv.org/pdf/2602.09179", "summary": "Demonstrates noise mitigation during spin shuttling in $^{28}$Si/SiGe dots: passive gradient reduction doubles $T_2^*(x_n)$ to $8.5\\,\\mu$s, motional narrowing reaches $T_2^{*,sh}=11.5\\,\\mu$s, dynamical decoupling achieves $T_2^{H,sh}=32\\,\\mu$s over $200\\,\\text{nm}$. Dressed-state shuttling gives $T_R^{\\text{sh}}=21\\,\\mu$s without pulsed control. Establishes mobile spins viable for scalable silicon processors.", "motivation": "Stationary spin qubits face connectivity/scalability limits; mobile architectures enable flexible error correction but shuttling through disorder threatened coherence. Preserving coherence beyond gate/readout timescales validates mobile spins for practical processors.", "highlights": [ "$T_2^{H,sh}=32\\,\\mu$s shuttling DD", "Dressed-state $T_R^{\\text{sh}}=21\\,\\mu$s", "$>200\\,\\text{nm}$ coherent transport" ], "keywords": [ { "label": "mobile spin qubits", "reason": "Architecture enabling flexible connectivity for error correction" }, { "label": "spin shuttling", "reason": "Core challenge—preserving coherence during transport in Si/SiGe" }, { "label": "motional narrowing", "reason": "Technique doubling dephasing time via periodic shuttling" }, { "label": "dynamical decoupling", "reason": "Achieves $32\\,\\mu$s coherence during $200\\,\\text{nm}$ transport" } ], "emoji": "🚀", "social_summary": "Extended mobile silicon spin coherence to 32 μs during shuttling.", "highlights_oneliner": "Mobile spin coherence protection" }, { "arxiv_id": "2602.09733", "title": "Error-mitigated quantum state tomography using neural networks", "authors": "Yixuan Hu, Mengru Ma, Jiangwei Shang", "arxiv_url": "https://arxiv.org/abs/2602.09733", "pdf_url": "https://arxiv.org/pdf/2602.09733", "summary": "Proposes scalable multilayer perceptron-based tomography mitigating unknown noise via supervised learning without noise model assumptions. Effective across pure/mixed states vs unmitigated baselines. Data-driven approach extends to general systems with limited measurements.", "motivation": "Quantum state tomography is degraded by experimental noise, but explicit noise characterization is costly and model-based methods fail for general noise. Neural networks offer model-free mitigation scaling to larger systems with practical measurement constraints.", "highlights": [ "NN-based noise mitigation", "No noise model required", "Scales to mixed states" ], "keywords": [ { "label": "quantum state tomography", "reason": "Core task enhanced with noise-robust reconstruction" }, { "label": "multilayer perceptron", "reason": "Neural architecture enabling supervised noise mitigation" }, { "label": "supervised learning", "reason": "Data-driven approach without noise model assumptions" }, { "label": "measurement-efficient", "reason": "Works for structured states with fewer settings" } ], "emoji": "👁️", "social_summary": "Neural networks mitigate noise in quantum state tomography without models.", "highlights_oneliner": "NN error-mitigated tomography" } ] }, "2026-02-10": { "word_cloud": [ { "word": "Erasure", "weight": 5 }, { "word": "Bicycle", "weight": 5 }, { "word": "QLDPC", "weight": 4 }, { "word": "BiBiEQ", "weight": 5 }, { "word": "Insertion", "weight": 4 }, { "word": "Deletion", "weight": 4 }, { "word": "Synchronization", "weight": 4 }, { "word": "Permutation-invariant", "weight": 4 }, { "word": "Pseudo-threshold", "weight": 3 }, { "word": "LER", "weight": 3 }, { "word": "Insdel", "weight": 4 }, { "word": "Decoder", "weight": 3 }, { "word": "Circuit", "weight": 3 }, { "word": "Schedule", "weight": 3 }, { "word": "Overhead", "weight": 3 }, { "word": "Threshold", "weight": 3 }, { "word": "Equivalence", "weight": 4 } ], "social_highlights": "Highlights: BiBiEQ enables erasure qubits on BB codes with 26-34x LER drop $d:6\\to10$, quantum insertion-deletion equivalence proven for PI codes.", "papers": [ { "arxiv_id": "2602.07578", "title": "BiBiEQ: Bivariate Bicycle Codes on Erasure Qubits", "authors": "Ameya S. Bhave, Navnil Choudhury, Andrew Nemec, Kanad Basu", "arxiv_url": "https://arxiv.org/abs/2602.07578", "pdf_url": "https://arxiv.org/pdf/2602.07578", "summary": "BiBiEQ compiles Bivariate Bicycle (BB) codes into erasure-aware memory circuits with erasure checks and resets over 2EC/4EC schedules, converting them to stabilizer circuits via BiBiEQ-Exact (correlation-preserving) and BiBiEQ-Approx (independence approximation) engines for general decoding. It quantifies per-round logical error rates (LER) and EC schedule effects below pseudo-thresholds. The $d:6\\to10$ hop yields 10-17x LER drop, with 4EC minimizing engine accuracy gaps.", "motivation": "Erasure qubits address quadratic overhead growth in 2D-local QEC by converting faults to detectable erasures, improving thresholds in surface/Floquet codes but unexplored in efficient QLDPC like BB codes. Balancing EC frequency's information gain against added noise is critical for low-overhead scalable quantum memory.", "highlights": [ "$d:6\\to10$ drops LER by 26-34x at low erasure", "4EC shrinks Approx/Exact gap by 70-83%", "Pseudo-thresholds $\\hat{e}\\approx1.05\\times10^{-2}$ (2EC Exact)" ], "keywords": [ { "label": "Erasure Qubits", "reason": "Core hardware model converting faults to detectable erasures" }, { "label": "Bivariate Bicycle Codes", "reason": "QLDPC family targeted for erasure-aware implementation" }, { "label": "BiBiEQ Framework", "reason": "Novel compilation/conversion engines (Exact/Approx)" }, { "label": "EC Schedules", "reason": "2EC/4EC balancing information vs. circuit overhead" } ], "emoji": "🧭", "social_summary": "BiBiEQ brings erasure qubits to BB codes, slashing logical errors 26-34x from $d=6$ to $d=10$ with smart schedules.", "highlights_oneliner": "Erasure-aware BB codes" }, { "arxiv_id": "2602.08780", "title": "The equivalence of quantum deletion and insertion errors on permutation-invariant codes", "authors": "Lewis Bulled, Yingkai Ouyang", "arxiv_url": "https://arxiv.org/abs/2602.08780", "pdf_url": "https://arxiv.org/pdf/2602.08780", "summary": "Proves quantum insertion-deletion equivalence on permutation-invariant (PI) codes by deriving $t$-insertion conditions equivalent to $2t$-deletion conditions. Extends to $(t,s)$-insdel error-correctability with more restrictive conditions. Resolves key questions in quantum synchronization error correction.", "motivation": "Classical insertion-deletion equivalence established 60 years ago, but quantum counterpart remained open despite synchronization errors' prevalence in optical communication. Quantum insdel research lagged behind deletion codes, limiting fault-tolerant quantum networks.", "highlights": [ "Quantum insertion-deletion equivalence for PI codes", "$t$-insertion conditions $= 2t$-deletion conditions", "New $(t,s)$-insdel correctability conditions" ], "keywords": [ { "label": "Synchronization Errors", "reason": "Class including erasure/deletion/insertion in quantum channels" }, { "label": "Permutation-Invariant Codes", "reason": "Code family enabling insertion-deletion equivalence" }, { "label": "Insdel Errors", "reason": "Combined insertion-deletion errors with new correctability" }, { "label": "Levenshtein Equivalence", "reason": "Quantum analog of classical insertion-deletion result" } ], "emoji": "🔄", "social_summary": "Proves quantum insertion equals deletion errors on PI codes, solving 60-year synchronization challenge.", "highlights_oneliner": "Quantum insdel equivalence" } ] }, "2026-02-09": { "word_cloud": [ { "word": "surface code", "weight": 5 }, { "word": "radiation-induced errors", "weight": 5 }, { "word": "quasiparticles", "weight": 4 }, { "word": "topological superconductor", "weight": 4 }, { "word": "Majorana zero modes", "weight": 4 }, { "word": "parafermion", "weight": 4 }, { "word": "Clifford gates", "weight": 4 }, { "word": "correlated errors", "weight": 3 }, { "word": "phonon downconversion", "weight": 3 }, { "word": "magic state distillation", "weight": 3 }, { "word": "equational theory", "weight": 3 }, { "word": "universal quantum computation", "weight": 3 }, { "word": "superconducting qubits", "weight": 3 }, { "word": "non-Abelian statistics", "weight": 3 }, { "word": "decoder", "weight": 2 }, { "word": "mitigation strategies", "weight": 2 }, { "word": "topological order", "weight": 2 }, { "word": "vortex braiding", "weight": 2 } ], "social_highlights": "Highlights: Computational framework for modeling radiation-induced correlated errors in surface codes with phonon downconversion mitigation, Complete equational theory for real-Clifford+CH quantum circuits enabling finitely-generated universality, Charge-4e superconductor with parafermionic vortices achieving universal topological quantum computation.", "papers": [ { "arxiv_id": "2602.06202", "title": "Characterizing Quantum Error Correction Performance of Radiation-induced Errors", "authors": "Paul G. Baity, Anuj K. Nayak, Lav R. Varshney, Nicholas Jeon, Byung-Jun Yoon, Peter J. Love, Adolfy Hoisie", "arxiv_url": "https://arxiv.org/abs/2602.06202", "pdf_url": "https://arxiv.org/pdf/2602.06202", "summary": "Develops a computational model simulating radiation impacts on quantum error correction performance in superconducting devices by mapping quasiparticle density dynamics onto quantum error channels and simulating a $[[9,1,3]]$ surface code. Introduces a novel performance metric $\\zeta_c$ to quantify QEC code resilience to radiation-induced correlated errors and demonstrates phonon downconversion as a mitigation strategy requiring increased qubit separation distances.", "motivation": "Radiation-induced correlated errors pose a fundamental challenge to superconducting quantum processors, as standard QEC codes are designed for independent errors. This work addresses a critical gap between theoretical error correction frameworks and real-world radiation environments, enabling holistic design optimization for fault-tolerant quantum computing.", "highlights": [ "Holistic computational framework linking radiation-induced quasiparticle effects to logical error probability evolution", "Novel resilience metric $\\zeta_c$ for quantifying QEC performance under radiation impacts", "Phonon downconversion mitigation reduces error rates but requires increased qubit-packing density constraints" ], "keywords": [ { "label": "surface code", "reason": "Core QEC architecture tested; $[[9,1,3]]$ code used for radiation impact simulations" }, { "label": "radiation-induced correlated errors", "reason": "Primary error model; spatially and temporally correlated across sequential QEC rounds" }, { "label": "quasiparticle dynamics", "reason": "Physical mechanism connecting radiation strikes to qubit error rates via phonon propagation" }, { "label": "phonon downconversion mitigation", "reason": "Tested error suppression strategy using flipside Cu to limit quasiparticle generation" } ], "emoji": "☢️", "social_summary": "Model radiation-induced errors in quantum processors using quasiparticle dynamics and surface codes with phonon downconversion mitigation.", "highlights_oneliner": "Radiation error modeling for surface codes" }, { "arxiv_id": "2602.06644", "title": "A Complete Equational Theory for Real-Clifford+CH Quantum Circuits", "authors": "Alexandre Clément", "arxiv_url": "https://arxiv.org/abs/2602.06644", "pdf_url": "https://arxiv.org/pdf/2602.06644", "summary": "Establishes the first complete equational theory for quantum circuits generated by real Clifford gates plus the two-qubit controlled-Hadamard gate, providing a finite set of circuit equalities from which all other true equations can be derived. This finitely-generated, universal fragment requires no parameterized gates or ancillas, enabling complete algebraic characterization of a computationally universal gate set.", "motivation": "Complete equational theories provide foundational understanding of quantum circuit algebras and enable automated circuit optimization and verification. Prior completeness results required either infinite gate families or ancillary qubits; this work achieves universality with minimal resources, advancing the theoretical foundations of quantum computation.", "highlights": [ "First completeness result for finitely-generated universal quantum circuit fragment without parameterized gates", "Real-Clifford+CH gate set achieves computational universality with simple equational characterization", "No ancillas required, enabling practical circuit optimization and verification" ], "keywords": [ { "label": "Clifford gates", "reason": "Core gate family; real Clifford subset forms basis of the equational theory" }, { "label": "controlled-Hadamard gate", "reason": "Two-qubit gate enabling universality when combined with real Clifford operations" }, { "label": "equational theory", "reason": "Complete set of circuit identities enabling derivation of all true equations in the fragment" }, { "label": "circuit universality", "reason": "Finitely-generated gate set achieves computational universality without parameterization" } ], "emoji": "⚙️", "social_summary": "Complete algebraic theory for universal quantum circuits using Clifford and controlled-Hadamard gates without ancillas.", "highlights_oneliner": "Complete equational theory for universal circuits" }, { "arxiv_id": "2602.06963", "title": "Charge-$4e$ superconductor with parafermionic vortices: A path to universal topological quantum computation", "authors": "Zhengyan Darius Shi, Zhaoyu Han, Srinivas Raghu, Ashvin Vishwanath", "arxiv_url": "https://arxiv.org/abs/2602.06963", "pdf_url": "https://arxiv.org/pdf/2602.06963", "summary": "Proposes a charge-$4e$ topological superconductor combining a charge-$4e$ condensate with Abelian chiral $\\mathbb{Z}_3$ topological order, obtainable by proliferating vortex-antivortex pairs in stacked $2e$ $p+ip$ superconductors. The $hc/(4e)$ fluxes act as charge-conjugation defects whose braiding with anyons generates the full many-qutrit Clifford group, with topologically protected magic-state preparation enabling universal quantum computation.", "motivation": "Majorana-based topological superconductors are computationally constrained to single-qubit Clifford gates, requiring resource-intensive magic state distillation for universality. This work overcomes this bottleneck by hierarchical electron aggregation, achieving native multi-qutrit Clifford operations and simplified magic-state preparation through parafermionic zero modes.", "highlights": [ "Charge-$4e$ TSC with $\\mathbb{Z}_3$ parafermion zero modes naturally encodes qubits and qutrit Clifford operations", "Braiding parafermionic defects alone generates full many-qutrit Clifford group without measurements", "Single-probe interferometric measurement enables topologically protected magic-state preparation for universality" ], "keywords": [ { "label": "topological superconductor", "reason": "Platform for fault-tolerant quantum computation; charge-$4e$ variant overcomes Majorana computational constraints" }, { "label": "parafermion zero modes", "reason": "Non-Abelian excitations trapped in vortex cores; encode qutrit information with enhanced computational power" }, { "label": "vortex braiding", "reason": "Topological operation generating Clifford gates; braiding parafermionic defects achieves full multi-qutrit Clifford group" }, { "label": "magic state distillation", "reason": "Simplified via topologically protected interferometric measurement; enables universal gate set from Clifford operations" } ], "emoji": "🧬", "social_summary": "Charge-4e superconductor with parafermionic vortices enables universal topological quantum computation via simplified magic-state preparation.", "highlights_oneliner": "Parafermionic vortices for universal topological computation" } ] }, "2026-02-06": { "word_cloud": [ { "word": "error mitigation", "weight": 5 }, { "word": "tensor networks", "weight": 4 }, { "word": "Zero Noise Extrapolation", "weight": 4 }, { "word": "distributed quantum computing", "weight": 4 }, { "word": "noise mitigation", "weight": 4 }, { "word": "pre-processing", "weight": 3 }, { "word": "post-processing", "weight": 3 }, { "word": "circuit partitioning", "weight": 3 }, { "word": "quantum networks", "weight": 3 }, { "word": "surrogate observable", "weight": 3 }, { "word": "measurement overhead", "weight": 2 }, { "word": "scalability", "weight": 3 }, { "word": "quantum processors", "weight": 2 }, { "word": "communication noise", "weight": 3 }, { "word": "error reduction", "weight": 3 }, { "word": "classical computation", "weight": 2 }, { "word": "noisy quantum state", "weight": 2 }, { "word": "QPU coordination", "weight": 2 } ], "social_highlights": "Highlights: Pre-processing error mitigation via tensor networks achieves $10^6$ classical speedup over post-processing, Global ZNE outperforms local optimization in distributed quantum computing with up to $48\\%$ error reduction across six QPUs", "papers": [ { "arxiv_id": "2602.05916", "title": "Quantum Error Mitigation at the pre-processing stage", "authors": "Juan F. Martin, Giuseppe Cocco, Javier Fonollosa", "arxiv_url": "https://arxiv.org/abs/2602.05916", "pdf_url": "https://arxiv.org/pdf/2602.05916", "summary": "This work introduces a pre-processing error mitigation strategy that identifies a surrogate observable $Y$ whose expectation value on a noisy state $\\mathcal{E}(\\rho)$ matches the target observable $X$ on the noiseless state $\\rho$. The method leverages tensor networks to achieve $\\sim 10^6$ times improvement in classical computation complexity compared to post-processing Tensor Error Mitigation (TEM), while approaching theoretical lower bounds on measurement overhead.", "motivation": "Standard quantum error mitigation relies on expensive post-processing strategies requiring informationally complete positive operator-valued measurements (IC-POVM) and tomographic procedures. Pre-processing mitigation addresses the computational bottleneck by shifting noise correction before measurement, enabling practical near-term quantum advantage on noisy hardware.", "highlights": [ "Surrogate observable approach reduces classical complexity by $\\sim 10^6$ versus TEM post-processing", "Tensor networks enable practical implementation with measurement overhead approaching theoretical lower bound", "Eliminates need for IC-POVM and tomographic measurements required by standard error mitigation" ], "keywords": [ { "label": "Tensor Networks", "reason": "Core computational tool enabling efficient pre-processing mitigation in practical scenarios" }, { "label": "Surrogate Observable", "reason": "Central technique: finding observable $Y$ on noisy state equivalent to target observable $X$ on ideal state" }, { "label": "Classical Computation Complexity", "reason": "Key metric showing $10^6$ speedup over post-processing approaches" }, { "label": "Measurement Overhead", "reason": "Quantifies sampling cost, approaching theoretical lower bound in proposed method" } ], "emoji": "⚡", "social_summary": "Replace expensive post-measurement error correction with tensor-network-powered pre-processing, achieving million-fold classical speedup.", "highlights_oneliner": "Pre-processing mitigation via tensor networks" }, { "arxiv_id": "2602.04981", "title": "Distributed Quantum Error Mitigation: Global and Local ZNE encodings", "authors": "Maria Gragera Garces", "arxiv_url": "https://arxiv.org/abs/2602.04981", "pdf_url": "https://arxiv.org/pdf/2602.04981", "summary": "This work investigates Zero Noise Extrapolation (ZNE) in distributed quantum computing by comparing Global optimization (ZNE applied before circuit partitioning) versus Local optimization (ZNE applied independently to each sub-circuit). Global ZNE achieves superior scalability with up to $48\\%$ error reduction across six quantum processing units (QPUs), demonstrating that preserving circuit topology before partitioning enables capture of cross-partition error correlations.", "motivation": "Distributed quantum computing emerges as a necessity for scaling beyond individual device limitations, but introduces communication-induced noise from quantum networks. While ZNE proves effective for standalone processors, its behavior in distributed architectures with multiple QPUs and teleportation-based communication remains unexplored.", "highlights": [ "Global ZNE achieves $48\\%$ error reduction across six QPUs, outperforming local optimization", "Counterintuitive result: increasing QPU count improves mitigation effectiveness despite higher communication overhead", "Global approach captures cross-partition error correlations by preserving entanglement structure before circuit partitioning" ], "keywords": [ { "label": "Zero Noise Extrapolation", "reason": "Primary error mitigation technique adapted and compared in distributed setting" }, { "label": "Circuit Partitioning", "reason": "Critical strategy for distributing monolithic circuits across multiple QPUs with communication overhead" }, { "label": "Distributed Quantum Computing", "reason": "Application domain where circuits span multiple interconnected quantum processors via quantum networks" }, { "label": "Error Correlation Propagation", "reason": "Key phenomenon showing how errors span partition boundaries, motivating global optimization approach" } ], "emoji": "🔗", "social_summary": "Global noise extrapolation outperforms local strategies in distributed quantum computing, achieving 48% error reduction across multiple processors.", "highlights_oneliner": "Global ZNE optimization for distributed quantum networks" } ] }, "2026-02-05": { "word_cloud": [ { "word": "twisted-torus", "weight": 5 }, { "word": "qudit", "weight": 5 }, { "word": "LDPC", "weight": 4 }, { "word": "bivariate", "weight": 4 }, { "word": "bicycle", "weight": 4 }, { "word": "superconducting", "weight": 3 }, { "word": "simulation", "weight": 3 }, { "word": "error-mitigation", "weight": 3 }, { "word": "threshold", "weight": 3 }, { "word": "distance", "weight": 4 }, { "word": "rate", "weight": 3 }, { "word": "CSS", "weight": 3 }, { "word": "finite-fields", "weight": 3 }, { "word": "topological", "weight": 4 }, { "word": "decoder", "weight": 2 }, { "word": "noise-modeling", "weight": 2 }, { "word": "algorithmic", "weight": 2 }, { "word": "measurement", "weight": 2 } ], "social_highlights": "Highlights: twisted-torus qudit codes boost $kd^2/n$, superconducting qubit advances enable large-scale simulations.", "papers": [ { "arxiv_id": "2602.04443", "title": "Qudit Twisted-Torus Codes in the Bivariate Bicycle Framework", "authors": "Mourad Halla", "arxiv_url": "https://arxiv.org/abs/2602.04443", "pdf_url": "https://arxiv.org/pdf/2602.04443", "summary": "This paper extends qubit twisted-torus codes to qudits using the bivariate bicycle framework, constructing finite-length quantum LDPC codes on two-dimensional tori with twisted boundary conditions. Algebraic methods over finite fields compute the number of logical qudits $k$, identifying compact codes with superior rate-distance tradeoffs $kd^2/n$. Twisted constructions outperform untwisted and prior qubit instances for explored finite sizes.", "motivation": "Topological stabilizer codes like Kitaev's toric code and quantum LDPC codes address scalability challenges in fault-tolerant quantum computing by enabling nonlocal encoding with local checks. Twisted boundary conditions, building on recent qubit insights, significantly enhance finite-size performance, making translation-invariant high-rate codes more practical.", "highlights": [ "Twisted-torus qudits exceed untwisted $d$", "Superior $kd^2/n$ vs. qubit codes", "Algebraic $k$ computation for sparse ansätze" ], "keywords": [ { "label": "twisted-torus", "reason": "Core geometry improving finite-size $kd^2/n$" } ], "emoji": "🌀", "social_summary": "Unveils twisted-torus qudit codes outperforming qubits in rate-distance tradeoffs.", "highlights_oneliner": "Twisted qudit torus LDPC" }, { "arxiv_id": "2602.04719", "title": "Enabling large-scale digital quantum simulations with superconducting qubits", "authors": "Laurin E. Fischer", "arxiv_url": "https://arxiv.org/abs/2602.04719", "pdf_url": "https://arxiv.org/pdf/2602.04719", "summary": "This thesis advances digital quantum simulation on noisy superconducting qubits by integrating hardware innovations, noise modeling, error mitigation, and efficient measurement processing. It addresses qubit overhead in fault-tolerant computing through hybrid quantum-classical strategies and hardware-native operations. Contributions span the computational stack to extract meaningful results from noisy data for quantum chemistry and materials science.", "motivation": "Digital quantum simulation promises to solve intractable problems in quantum chemistry and materials, but current superconducting hardware imperfections hinder practical advantage without full fault-tolerance. Hybrid methods combining error mitigation with hardware optimizations bridge the gap toward scalable simulations.", "highlights": [ "Hardware-level superconducting advances", "Refined noise modeling and mitigation", "Algorithmic gains via measurement efficiency" ], "keywords": [ { "label": "superconducting qubits", "reason": "Platform for scalable quantum simulation hardware" }, { "label": "error mitigation", "reason": "Key technique to extract results from noisy data" }, { "label": "digital simulation", "reason": "Primary application in chemistry and materials" }, { "label": "noise modeling", "reason": "Enables refined hybrid quantum-classical strategies" } ], "emoji": "⚛️", "social_summary": "Pioneers superconducting qubit methods for large-scale quantum simulations.", "highlights_oneliner": "Superconducting simulation advances" } ] }, "2026-02-04": { "word_cloud": [ { "word": "Tesseract", "weight": 5 }, { "word": "A*", "weight": 4 }, { "word": "speedup", "weight": 5 }, { "word": "Surface", "weight": 4 }, { "word": "Color", "weight": 3 }, { "word": "Bicycle", "weight": 4 }, { "word": "soft-output", "weight": 5 }, { "word": "Union-Find", "weight": 4 }, { "word": "cluster", "weight": 4 }, { "word": "FPGA", "weight": 3 }, { "word": "early-stopping", "weight": 4 }, { "word": "threshold", "weight": 3 }, { "word": "decoder", "weight": 5 }, { "word": "optimization", "weight": 4 }, { "word": "syndrome", "weight": 3 }, { "word": "latency", "weight": 3 }, { "word": "accuracy", "weight": 4 } ], "social_highlights": "Highlights: Accelerating Tesseract decoder 2-5x faster, Efficient soft-outputs via cluster growth and early stopping for real-time QEC.", "papers": [ { "arxiv_id": "2602.02985", "title": "Accelerating the Tesseract Decoder for Quantum Error Correction", "authors": "Dragana Grbic, Laleh Aghababaie Beni, Noah Shutty", "arxiv_url": "https://arxiv.org/abs/2602.02985", "pdf_url": "https://arxiv.org/pdf/2602.02985", "summary": "Optimizes Tesseract MLE decoder using A* search via low-level C++ enhancements including data structure replacement, memory layout reorganization from SoA to AoS, and hardware-accelerated bit operations. Achieves consistent ~$2\\times$ speedups across Color Codes, Surface Codes, Bivariate-Bicycle Codes, and Transversal CNOT, peaking at $>$5$\\times$ for demanding Bivariate-Bicycle configurations. Demonstrates scalable high-performance engineering for real-time QEC decoding.", "motivation": "QEC decoding represents a computational bottleneck for fault-tolerant quantum computing as decoders must efficiently explore exponentially large error configuration spaces for large $d$. Tesseract's A* approach offered high accuracy but required low-level optimization to match real-time syndrome extraction rates across diverse code families.", "highlights": [ "~$2\\times$ speedup most code families", "$>5\\times$ peak for Bivariate-Bicycle codes", "SoA→AoS memory layout optimization" ], "keywords": [ { "label": "Tesseract", "reason": "Novel A*-based MLE decoder being optimized" }, { "label": "A* search", "reason": "Core algorithm for error hypothesis exploration" }, { "label": "Bivariate-Bicycle", "reason": "Code family yielding peak 5x speedup" }, { "label": "cache optimization", "reason": "Memory layout reorganization (SoA→AoS)" } ], "emoji": "🔋", "social_summary": "Turbocharged Tesseract decoder delivers 2-5x speedups across quantum codes via clever C++ optimizations.", "highlights_oneliner": "2-5x Tesseract decoder speedup" }, { "arxiv_id": "2602.03336", "title": "Even More Efficient Soft-Output Decoding with Extra-Cluster Growth and Early Stopping", "authors": "Kaito Kishi, Riki Toshio, Jun Fujisaki, Hirotaka Oshima, Shintaro Sato, Keisuke Fujii", "arxiv_url": "https://arxiv.org/abs/2602.03336", "pdf_url": "https://arxiv.org/pdf/2602.03336", "summary": "Introduces bounded cluster gap with early-stopping to reduce Meister et al. soft-output complexity and extra-cluster gap via minimal cluster expansion for FPGA-compatible reliability metrics in Union-Find decoders. Both methods enable high-quality soft outputs with superior $d$ scaling and no architecture changes. Supports decoder-switching frameworks for real-time high-accuracy surface code decoding.", "motivation": "Soft outputs quantifying decoder confidence enable decoder-switching between fast weak and slow strong decoders to balance real-time latency with accuracy. Existing cluster-based soft-output methods incur excessive overhead and lack FPGA compatibility for hardware-accelerated Union-Find decoders.", "highlights": [ "Early-stopping bounded cluster gap", "FPGA-compatible extra-cluster growth", "Improved $d$ scaling vs Meister method" ], "keywords": [ { "label": "soft-output", "reason": "Decoder confidence metrics enabling switching" }, { "label": "Union-Find", "reason": "Target cluster-based decoder architecture" }, { "label": "extra-cluster gap", "reason": "Novel FPGA-compatible reliability measure" }, { "label": "early-stopping", "reason": "Complexity reduction technique" } ], "emoji": "🌐", "social_summary": "FPGA-friendly soft outputs via cluster growth slash decoder overhead while boosting real-time accuracy.", "highlights_oneliner": "Efficient cluster soft-outputs" } ] }, "2026-02-03": { "word_cloud": [ { "word": "Pauli", "weight": 5 }, { "word": "Cloners", "weight": 5 }, { "word": "Cloning", "weight": 4 }, { "word": "Niu-Griffiths", "weight": 4 }, { "word": "MUB", "weight": 4 }, { "word": "QKD", "weight": 4 }, { "word": "Noise", "weight": 3 }, { "word": "Universal", "weight": 3 }, { "word": "Phase", "weight": 3 }, { "word": "Biased", "weight": 3 }, { "word": "Eavesdropping", "weight": 3 }, { "word": "Fidelity", "weight": 3 }, { "word": "Circuit", "weight": 3 }, { "word": "Multi-qubit", "weight": 3 }, { "word": "Asymmetric", "weight": 3 }, { "word": "BB84", "weight": 2 } ], "social_highlights": "Highlights: New quantum circuit clones $N$-qubit Pauli channels, extends Niu-Griffiths architecture, boosts QKD security analysis.", "papers": [ { "arxiv_id": "2602.00646", "title": "Pauli Cloners for Pauli Channels", "authors": "S. F. Kerstan, M. Gallezot, T. Decker, M. Braun, N. Hegemann", "arxiv_url": "https://arxiv.org/abs/2602.00646", "pdf_url": "https://arxiv.org/pdf/2602.00646", "summary": "Presents a quantum circuit for one-to-two cloning of $N$-qubit registers implementing Pauli cloners by extending the Niu--Griffiths architecture to multi-qubit systems. Provides explicit single-qubit constructions for asymmetric universal, phase covariant, and biased cloners. Explores links between Pauli errors, mutually unbiased bases, and cloning, with tailoring to noise models for quantum communication and QKD.", "motivation": "Quantum cloning, no-go in the universal case since the 1980s, found practical realizations in phase-covariant and universal cloners like Niu--Griffiths for eavesdropping in QKD. This work generalizes to multi-qubit Pauli channels, enabling optimized attacks and noise-tailored cloning critical for secure quantum communication protocols.", "highlights": [ "Multi-qubit Pauli cloner circuit", "Single-qubit asymmetric cloners", "Tailored for QKD noise models" ], "keywords": [ { "label": "Pauli cloners", "reason": "Core class of cloners implemented for Pauli channels" }, { "label": "Niu-Griffiths", "reason": "Architecture extended to $N$-qubit systems" }, { "label": "Mutually unbiased bases", "reason": "Fundamental relation to Pauli errors and cloning fidelities" }, { "label": "QKD eavesdropping", "reason": "Application tailoring to quantum key distribution attacks" } ], "emoji": "🔧", "social_summary": "Unveils multi-qubit Pauli cloners extending Niu-Griffiths for secure QKD noise analysis.", "Highlights_oneliner": "Multi-qubit Pauli cloning circuits" } ] }, "2026-02-02": { "word_cloud": [ { "word": "magic states", "weight": 5 }, { "word": "surface codes", "weight": 5 }, { "word": "lattice surgery", "weight": 4 }, { "word": "qLDPC codes", "weight": 5 }, { "word": "logical operations", "weight": 4 }, { "word": "syndrome extraction", "weight": 4 }, { "word": "transversal gates", "weight": 4 }, { "word": "error mitigation", "weight": 4 }, { "word": "stabilizer codes", "weight": 3 }, { "word": "code distance", "weight": 3 }, { "word": "fault tolerance", "weight": 4 }, { "word": "spin qubits", "weight": 3 }, { "word": "product codes", "weight": 3 }, { "word": "locally recoverable codes", "weight": 3 }, { "word": "noise amplification", "weight": 3 }, { "word": "topological codes", "weight": 3 }, { "word": "CSS codes", "weight": 3 }, { "word": "circuit compilation", "weight": 3 } ], "social_highlights": "Highlights: Fast parallel magic state preparation via higher-form gates, efficient logical noise learning from syndrome data, scalable lattice surgery compilation, structural conditions for native CCZ fountains, unified quantum bootstrap product framework, weight-four parity checks with silicon spins, orders-of-magnitude sampling overhead reduction, quantum locally recoverable BCH codes.", "papers": [ { "arxiv_id": "2601.22939", "title": "Fast magic state preparation by gauging higher-form transversal gates in parallel", "authors": "Dominic J. Williamson", "arxiv_url": "https://arxiv.org/abs/2601.22939", "pdf_url": "https://arxiv.org/pdf/2601.22939", "summary": "Introduces a fast code surgery procedure that performs fault-tolerant measurement of many transversal logic gates in parallel via generalized gauging on quantum codes supporting higher-form transversal gates. Achieves constant time overhead and linear qubit overhead for parallel magic state preparation on codes with higher-form Clifford gates. Motivates search for good quantum low-density parity-check codes supporting higher-form Clifford gates.", "motivation": "Magic states are foundational resources for universal quantum computation but must be prepared fault-tolerantly in realistic noisy environments. Recent discoveries of efficient quantum low-density parity-check codes with efficient logic gates create opportunities for low-overhead fault-tolerant quantum computation, necessitating fast parallel protocols for logical magic state preparation.", "highlights": [ "Constant-time fault-tolerant measurement of multiple transversal gates in parallel", "Linear qubit overhead with inherited fault-tolerance from base code structure", "Fast parallel magic state preparation for codes with higher-form Clifford gates" ], "keywords": [ { "label": "magic states", "reason": "Core resource for universal quantum computation via gate teleportation" }, { "label": "higher-form transversal gates", "reason": "Enables parallel logical operations without sequential overhead" }, { "label": "code surgery", "reason": "Technique for fault-tolerant measurement and state preparation" }, { "label": "qLDPC codes", "reason": "Target code family with low-density parity checks for efficiency" } ], "emoji": "✨", "social_summary": "Prepare multiple magic states in parallel with constant time overhead using higher-form transversal gates on quantum codes.", "highlights_oneliner": "Parallel magic state preparation via code surgery" }, { "arxiv_id": "2601.22286", "title": "Efficient learning of logical noise from syndrome data", "authors": "Han Zheng, Chia-Tung Chu, Senrui Chen, Argyris Giannisis Manes, Su-un Lee, Sisi Zhou, Liang Jiang", "arxiv_url": "https://arxiv.org/abs/2601.22286", "pdf_url": "https://arxiv.org/pdf/2601.22286", "summary": "Extends syndrome-based logical channel inference from phenomenological to realistic circuit-level noise models using spacetime code formalism and derives necessary/sufficient conditions for learning from syndrome data alone. Develops efficient estimators using Fourier analysis and compressed sensing with provable sample complexity and computational guarantees. Demonstrates orders-of-magnitude sample-complexity savings over direct logical benchmarking on syndrome-extraction circuits.", "motivation": "Characterizing errors in fault-tolerant quantum circuits is essential for device calibration, but detecting rare logical error events requires prohibitively large sample sizes. Direct logical measurements become impractical as logical error probabilities are suppressed to higher order relative to physical noise.", "highlights": [ "Necessary and sufficient conditions for learning logical channel from syndrome data", "Efficient estimators with provable sample complexity and computational guarantees", "Orders-of-magnitude sample-complexity savings over direct logical benchmarking" ], "keywords": [ { "label": "syndrome-based learning", "reason": "Infers logical errors from syndrome measurements without direct logical measurements" }, { "label": "circuit-level noise models", "reason": "Realistic noise characterization beyond phenomenological Pauli models" }, { "label": "spacetime code formalism", "reason": "Unified framework for analyzing circuit-level faults in error correction" }, { "label": "compressed sensing", "reason": "Efficient estimation technique for sparse error characterization" } ], "emoji": "📊", "social_summary": "Learn logical noise from syndrome data alone, reducing calibration samples by orders of magnitude for fault-tolerant quantum devices.", "highlights_oneliner": "Efficient logical noise learning from syndrome data" }, { "arxiv_id": "2601.23109", "title": "TopoLS: Lattice Surgery Compilation via Topological Program Transformations", "authors": "Junyu Zhou, Yuhao Liu, Ethan Decker, Justin Kalloor, Mathias Weiden, Kean Chen, Costin Iancu, Gushu Li", "arxiv_url": "https://arxiv.org/abs/2601.23109", "pdf_url": "https://arxiv.org/pdf/2601.23109", "summary": "Presents TopoLS, a topological compiler combining ZX-diagram optimizations with Monte Carlo tree search for lattice-surgery compilation on surface codes. Achieves $33\\%$ average reduction in space-time volume over prior heuristic compilers while maintaining linear compilation time scaling. Provides scalable solution superior to SAT-solver approaches for large circuits.", "motivation": "Surface codes are leading candidates for fault-tolerant quantum computing due to high error thresholds and 2D locality, but implementing logical operations via lattice surgery incurs significant resource overhead. Efficient compilation of logical circuits into lattice-surgery instructions is critical for minimizing space-time volume in practical quantum computers.", "highlights": [ "$33\\%$ average space-time volume reduction over heuristic-based compilers", "Linear compilation time scaling enabling scalable circuit optimization", "Effective solution outperforming SAT-solver approaches for large circuits" ], "keywords": [ { "label": "lattice surgery", "reason": "Technique for implementing logical two-qubit gates via code patch merging/splitting" }, { "label": "surface codes", "reason": "Primary code architecture with high threshold and 2D nearest-neighbor locality" }, { "label": "ZX-diagram optimization", "reason": "Graphical calculus for circuit simplification and resource reduction" }, { "label": "Monte Carlo tree search", "reason": "Heuristic search method for exploring lattice surgery compilation structures" } ], "emoji": "🧩", "social_summary": "Compile logical circuits to lattice surgery with 33% less space-time volume using topological optimizations and tree search.", "highlights_oneliner": "Scalable lattice surgery compilation via topological transformations" }, { "arxiv_id": "2601.22489", "title": "Structural Conditions for Native CCZ Magic-State Fountains in qLDPC Codes", "authors": "Mohammad Rowshan", "arxiv_url": "https://arxiv.org/abs/2601.22489", "pdf_url": "https://arxiv.org/pdf/2601.22489", "summary": "Identifies coding-theoretic structural conditions under which CSS qLDPC code families necessarily support constant-depth $CCZ$ magic-state fountains via algebraic notion of magic-friendly triples and 3-uniform hypergraph models. Shows that $\\Omega(n^{1+\\gamma})$ magic-friendly triples with bounded per-qubit participation enable constant-depth implementation of $\\Omega(n^\\gamma)$ logical $CCZ$ gates in parallel. Reduces existence problem to concrete combinatorial counting in quantum Tanner codes.", "motivation": "Quantum low-density parity-check codes promise constant-rate, linear-distance families with bounded-weight checks, but no explicit qubit qLDPC family simultaneously achieves constant rate, linear distance, bounded stabilizer weight, and native magic-state fountains. Understanding structural requirements for native non-Clifford resource state preparation is essential for practical qLDPC-based quantum computers.", "highlights": [ "Algebraic characterization of magic-friendly triples controlling $CCZ$ phases", "Constant-depth parallel $CCZ$ magic-state fountain from bounded-overlap triple collections", "Reduction to combinatorial problem for asymptotically good qLDPC families" ], "keywords": [ { "label": "qLDPC codes", "reason": "Asymptotically good codes with constant rate and linear distance" }, { "label": "magic-state fountains", "reason": "Constant-depth preparation of multiple non-Clifford resource states" }, { "label": "CSS codes", "reason": "Calderbank-Shor-Steane code family supporting structured logical operators" }, { "label": "hypergraph packing", "reason": "Combinatorial technique for distributing overlapping gate circuits" } ], "emoji": "🌊", "social_summary": "Identify structural conditions enabling constant-depth CCZ magic-state fountains in quantum low-density parity-check codes.", "highlights_oneliner": "Structural conditions for native CCZ fountains in qLDPC" }, { "arxiv_id": "2601.22363", "title": "Quantum bootstrap product codes", "authors": "Meng-Yuan Li", "arxiv_url": "https://arxiv.org/abs/2601.22363", "pdf_url": "https://arxiv.org/pdf/2601.22363", "summary": "Introduces quantum bootstrap product (QBP) paradigm extending beyond standard homological product constructions via bootstrap equation consistency conditions, unifying hypergraph product codes and fracton codes. Demonstrates QBP generates self-correcting quantum codes from input codes with constant energy barriers and surpasses code-rate upper bounds of hypergraph product codes. Elucidates topological structures of fracton codes via fork complexes with multiple chain group components.", "motivation": "Product constructions are powerful methods for generating quantum CSS codes, but existing homological formalisms via tensor products of chain complexes have limitations. Understanding deeper topological structures and developing new construction paradigms enables design of codes with improved properties for fault-tolerant quantum memories.", "highlights": [ "Unified framework encompassing hypergraph product and fracton codes", "Self-correcting codes from constant-energy-barrier input codes", "Surpasses code-rate upper bounds of standard hypergraph product construction" ], "keywords": [ { "label": "quantum bootstrap product", "reason": "Novel product construction paradigm via bootstrap equation consistency" }, { "label": "hypergraph product codes", "reason": "Generalized product construction for arbitrary-dimensional codes" }, { "label": "fracton codes", "reason": "Topological codes with subdimensional excitations and self-correction" }, { "label": "fork complexes", "reason": "Chain complexes with multiple components elucidating fracton topology" } ], "emoji": "🌳", "social_summary": "Unify hypergraph and fracton codes via quantum bootstrap product paradigm, enabling self-correcting quantum memories.", "highlights_oneliner": "Unified quantum bootstrap product code framework" }, { "arxiv_id": "2601.23267", "title": "Weight-four parity checks with silicon spin qubits", "authors": "Brennan Undseth, Nicola Meggiato, Yi-Hsien Wu, Sam R. Katiraee-Far, Larysa Tryputen, Sander L. de Snoo, Davide Degli Esposti, Giordano Scappucci, Eliška Greplová, Lieven M. K. Vandersypen", "arxiv_url": "https://arxiv.org/abs/2601.23267", "pdf_url": "https://arxiv.org/pdf/2601.23267", "summary": "Demonstrates silicon spin-qubit device with coherent shuttling bus enabling dynamic qubit transport and interaction at isolated bus stops, achieving universal control of five-qubit processor with surface-code stabilizer plaquette supporting weight-four $X$- and $Z$-type parity checks. Reports genuine five-qubit Greenberger-Horne-Zeilinger entanglement, largest such state in gate-defined semiconductor spins. Establishes protocols for modular calibration of sparse spin qubit arrays.", "motivation": "Coherent spin shuttling in sparse semiconductor spin qubit arrays offers appealing solid-state platform with dynamic long-range connectivity essential for quantum error correction. Demonstrating multi-qubit entanglement and parity checks is critical milestone toward practical QEC experiments with spin qubits.", "highlights": [ "Weight-four parity checks supporting surface-code stabilizer plaquettes", "Five-qubit GHZ entanglement, largest in gate-defined semiconductor spins", "Protocols for modular calibration of sparse spin qubit arrays" ], "keywords": [ { "label": "silicon spin qubits", "reason": "Solid-state platform with long coherence times and scalability" }, { "label": "coherent shuttling", "reason": "Dynamic qubit transport enabling long-range interactions" }, { "label": "parity checks", "reason": "Multi-qubit measurements for surface code error detection" }, { "label": "GHZ entanglement", "reason": "Multi-qubit entangled state for benchmarking quantum control" } ], "emoji": "⚛️", "social_summary": "Demonstrate weight-four parity checks and five-qubit GHZ entanglement with silicon spin qubits via coherent shuttling.", "highlights_oneliner": "Weight-four parity checks with silicon spin qubits" }, { "arxiv_id": "2601.22785", "title": "Orders of magnitude sampling overhead reduction in quantum error mitigation", "authors": "Raam Uzdin", "arxiv_url": "https://arxiv.org/abs/2601.22785", "pdf_url": "https://arxiv.org/pdf/2601.22785", "summary": "Introduces virtual noise scaling (VNS) framework combined with layered mitigation to reduce sampling overhead in agnostic noise amplification quantum error mitigation. Identifies circuit-independent noise threshold for layered mitigation determining when overhead decreases or increases. Achieves several orders-of-magnitude sampling overhead reduction in strong-noise regime compared to conventional zero-noise extrapolation.", "motivation": "Quantum error mitigation infers noiseless expectation values from noisy circuits without additional hardware, making it practical for contemporary quantum processors. However, sampling cost remains major bottleneck limiting applicability of QEM strategies based on noise amplification.", "highlights": [ "Virtual noise scaling framework reducing sampling overhead by orders of magnitude", "Circuit-independent noise threshold for layered mitigation performance", "Compatible with dynamic circuits, error detection, and quantum error correction" ], "keywords": [ { "label": "quantum error mitigation", "reason": "Hardware-efficient noise suppression without additional qubits" }, { "label": "virtual noise scaling", "reason": "Framework for reducing sampling overhead in noise amplification" }, { "label": "agnostic noise amplification", "reason": "Resilient to temporal noise drift during circuit execution" }, { "label": "zero-noise extrapolation", "reason": "Post-processing technique for inferring noiseless expectation values" } ], "emoji": "⚡", "social_summary": "Reduce quantum error mitigation sampling overhead by orders of magnitude using virtual noise scaling and layered mitigation.", "highlights_oneliner": "Orders-of-magnitude sampling overhead reduction in QEM" }, { "arxiv_id": "2601.22567", "title": "Quantum $(r,\\delta)$-Locally Recoverable BCH and Homothetic-BCH Codes", "authors": "Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto", "arxiv_url": "https://arxiv.org/abs/2601.22567", "pdf_url": "https://arxiv.org/pdf/2601.22567", "summary": "Constructs quantum $(r,\\delta)$-locally recoverable codes from BCH and homothetic-BCH codes that are Euclidean or Hermitian dual-containing, enabling recovery of multiple failures in distributed storage systems. Derives pure quantum $(r,\\delta)$-LRCs achieving optimal Singleton-like bounds. Extends classical locally recoverable code theory to quantum setting for large-scale cloud storage applications.", "motivation": "Quantum locally recoverable codes are quantum versions of classical $(r,\\delta)$-LRCs designed for recovering multiple failures in large-scale distributed and cloud storage systems. Developing quantum LRCs from well-studied BCH code families provides practical codes with proven performance characteristics.", "highlights": [ "Quantum $(r,\\delta)$-LRCs from BCH and homothetic-BCH codes", "Pure quantum codes achieving optimal Singleton-like bounds", "Multiple-failure recovery for distributed quantum storage systems" ], "keywords": [ { "label": "locally recoverable codes", "reason": "Codes enabling recovery of multiple failures with locality constraints" }, { "label": "BCH codes", "reason": "Classical cyclic codes with well-understood algebraic structure" }, { "label": "Euclidean dual-containing", "reason": "Property enabling quantum code construction via CSS construction" }, { "label": "Singleton bound", "reason": "Upper bound on code rate relating to code distance and locality" } ], "emoji": "💾", "social_summary": "Construct quantum locally recoverable codes from BCH codes for efficient multiple-failure recovery in distributed storage.", "highlights_oneliner": "Quantum locally recoverable BCH codes for storage" } ] }, "2026-01-30": { "word_cloud": [ { "word": "phantom", "weight": 5 }, { "word": "transversal", "weight": 4 }, { "word": "Floquet", "weight": 4 }, { "word": "decoder", "weight": 5 }, { "word": "topological", "weight": 4 }, { "word": "bosonic", "weight": 4 }, { "word": "erasure", "weight": 4 }, { "word": "Clifford", "weight": 3 }, { "word": "spacetime", "weight": 3 }, { "word": "threshold", "weight": 3 }, { "word": "fidelity", "weight": 3 }, { "word": "stabilizer", "weight": 3 }, { "word": "logical", "weight": 4 }, { "word": "entangling", "weight": 3 }, { "word": "BPQM", "weight": 3 }, { "word": "hierarchy", "weight": 3 }, { "word": "anyons", "weight": 3 }, { "word": "bias", "weight": 2 }, { "word": "Gram", "weight": 2 } ], "social_highlights": "Highlights: phantom codes for entanglement, in-situ Clifford benchmarking, transversal CSS gates, Floquet BK theorem, hierarchical decoders, S3 topological gates, bosonic QEC gains, biased-erasure qubits, q-ary BPQM.", "papers": [ { "arxiv_id": "2601.20927", "title": "Entangling logical qubits without physical operations", "authors": "Jin Ming Koh, Anqi Gong, Andrei C. Diaconu, Daniel Bochen Tan, Alexandra A. Geim, Michael J. Gullans, Norman Y. Yao, Mikhail D. Lukin, Shayan Majidy", "arxiv_url": "https://arxiv.org/abs/2601.20927", "pdf_url": "https://arxiv.org/pdf/2601.20927.pdf", "summary": "Phantom codes enable fault-tolerant logical entangling gates via qubit relabelling without physical operations, achieving perfect fidelity. Exhaustive enumeration identifies codes up to $n=14$ and higher-distance families from Reed-Muller and qudit codes. Noisy simulations show 1-2 orders of magnitude lower infidelity than surface codes for GHZ and simulation tasks.", "motivation": "Scalable quantum computing requires fault-tolerant gates but physical two-qubit gates limit performance due to errors and overheads. Phantom codes address this by realizing dense entanglement purely through compilation relabelling.", "highlights": [ "Phantom codes via relabelling", "Enumerated up to $n=14$", "1-2 order infidelity reduction" ], "keywords": [ { "label": "phantom codes", "reason": "Novel code family for operation-free entanglement" }, { "label": "Reed-Muller codes", "reason": "Constructs higher-distance families" }, { "label": "spacetime simulations", "reason": "Demonstrates scalable advantages" } ], "emoji": "👻", "social_summary": "Phantom codes entangle logical qubits by relabelling alone, slashing errors for scalable quantum computing.", "highlights_oneliner": "Phantom entanglement codes" }, { "arxiv_id": "2601.21472", "title": "In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits", "authors": "Xiao Xiao, Dominik Hangleiter, Dolev Bluvstein, Mikhail D. Lukin, Michael J. Gullans", "arxiv_url": "https://arxiv.org/abs/2601.21472", "pdf_url": "https://arxiv.org/pdf/2601.21472.pdf", "summary": "Maps Clifford circuits to spacetime subsystem codes for in-situ noise estimation from syndrome data. Provides learnability conditions and polynomial sample complexity for physical/logical errors, even at exponential suppression. Validates on synthetic and experimental data from fault-tolerant demonstrations.", "motivation": "Benchmarking devices and verifying algorithms is key for scalable quantum computing, but prior methods require separate protocols. In-situ syndrome-based characterization enables efficient calibration and verification during operation.", "highlights": [ "Spacetime code mapping", "Polynomial sample learning", "Experimental validation" ], "keywords": [ { "label": "spacetime codes", "reason": "Formalism for circuit-to-code mapping" }, { "label": "syndrome learning", "reason": "Estimates Pauli noise in-situ" }, { "label": "Clifford circuits", "reason": "Focus of benchmarking protocol" }, { "label": "detector model", "reason": "Relates to fault-tolerance tools" } ], "emoji": "⏱️", "social_summary": "Benchmark fault-tolerant circuits directly from syndrome data with polynomial samples.", "highlights_oneliner": "In-situ Clifford benchmarking" }, { "arxiv_id": "2601.21514", "title": "Transversal gates for quantum CSS codes", "authors": "Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews, Narayanan Rengaswamy, Rodrigo San-José", "arxiv_url": "https://arxiv.org/abs/2601.21514", "pdf_url": "https://arxiv.org/pdf/2601.21514.pdf", "summary": "Computes diagonal transversal gates fixing CSS codes, determining logical actions and group equations. Fully characterizes transversal stabilizers and gates for monomial CSS codes including polar and decreasing monomial. Extends results on CSS-T, triorthogonal, and divisible codes.", "motivation": "Fault-tolerant computing needs transversal Cliffords plus $T$-gates, but Eastin-Knill limits universality; magic distillation requires transversal $T$. Systematic transversal gate computation aids code design for these protocols.", "highlights": [ "Diagonal transversal groups", "Monomial CSS complete set", "Extends CSS-T results" ], "keywords": [ { "label": "transversal gates", "reason": "Core computation for CSS codes" }, { "label": "monomial codes", "reason": "Family with full characterization" }, { "label": "CSS-T codes", "reason": "Extends triorthogonal results" } ], "emoji": "🔄", "social_summary": "Fully computes transversal gates for monomial CSS codes, advancing fault-tolerant designs.", "highlights_oneliner": "CSS transversal gates" }, { "arxiv_id": "2601.21863", "title": "A Bravyi-König theorem for Floquet codes generated by locally conjugate instantaneous stabiliser groups", "authors": "Jelena Mackeprang, Jonas Helsen", "arxiv_url": "https://arxiv.org/abs/2601.21863", "pdf_url": "https://arxiv.org/pdf/2601.21863.pdf", "summary": "Proves Bravyi-König theorem for Floquet codes with locally conjugate ISGs, limiting short-depth logicals to $D$-th Clifford hierarchy. Defines generalized unitaries preserving logicals with measurements, deriving canonical form and extending BK theorem.", "motivation": "Floquet codes enable dynamic high-weight measurement decomposition but lack no-go theorems like Bravyi-König for topological stabilizers. Extending BK clarifies logical operation limits in dynamical codes.", "highlights": [ "BK for Floquet codes", "Locally conjugate ISGs", "Generalized unitaries" ], "keywords": [ { "label": "Floquet codes", "reason": "Dynamical stabilizer framework" }, { "label": "Bravyi-König theorem", "reason": "No-go for logical operations" }, { "label": "instantaneous stabilisers", "reason": "Locally conjugate definition" } ], "emoji": "🔄", "social_summary": "Bravyi-König theorem now proven for Floquet codes, bounding their logical power.", "highlights_oneliner": "Floquet BK theorem" }, { "arxiv_id": "2601.21715", "title": "Hierarchical quantum decoders", "authors": "Nirupam Basak, Ankith Mohan, Andrew Tanggara, Tobias Haug, Goutam Paul, Kishor Bharti", "arxiv_url": "https://arxiv.org/abs/2601.21715", "pdf_url": "https://arxiv.org/pdf/2601.21715.pdf", "summary": "Proposes Lasserre SOS hierarchy of SDPs for decoding with tunable speed-accuracy trade-off and optimality guarantees. Low levels outperform LP relaxations and approach exact decoding on surface and honeycomb codes. Analyzes convergence via rank-loop criteria.", "motivation": "Optimal decoding is NP-hard; fast heuristics lack guarantees while exact solvers are slow. Hierarchical SOS bridges this with rigorous approximations outperforming common methods.", "highlights": [ "SOS hierarchy SDPs", "Near-exact at low levels", "Rank-loop analysis" ], "keywords": [ { "label": "SOS hierarchy", "reason": "Relaxation for decoding" }, { "label": "Semidefinite programs", "reason": "Tunable approximations" }, { "label": "rotated surface codes", "reason": "Benchmarked performance" } ], "emoji": "📊", "social_summary": "Hierarchical SOS decoders tune speed vs accuracy with optimality guarantees.", "highlights_oneliner": "Hierarchical decoders" }, { "arxiv_id": "2601.20956", "title": "Universal Topological Gates from Braiding and Fusing Anyons on Quantum Hardware", "authors": "Chiu Fan Bowen Lo, Anasuya Lyons, Dan Gresh, Michael Mills, Peter E. Siegfried, Maxwell D. Urmey, Nathanan Tantivasadakarn, Henrik Dreyer, Ashvin Vishwanath, Ruben Verresen, Mohsin Iqbal", "arxiv_url": "https://arxiv.org/abs/2601.20956", "pdf_url": "https://arxiv.org/pdf/2601.20956.pdf", "summary": "Demonstrates $S_3$ TO on 54-qubit H2 processor with cyclic anyon fusion for universality beyond braiding. Encodes qutrits in fusion space, realizes universal gates via braiding and fusion measurements, prepares magic states.", "motivation": "Non-Abelian TO enables topological gates but simplest beyond toric code lack braiding universality. Combining fusion as primitive achieves universality in minimal non-Abelian phase.", "highlights": [ "$S_3$ TO on hardware", "Fusion-enabled universality", "Magic state preparation" ], "keywords": [ { "label": "S3 topological order", "reason": "Minimal non-Abelian phase" }, { "label": "anyon fusion", "reason": "Computational primitive" }, { "label": "qutrit encoding", "reason": "Nonlocal fusion space" } ], "emoji": "🌀", "social_summary": "Universal gates from anyon braiding and fusion on 54-qubit hardware.", "highlights_oneliner": "S3 anyon universality" }, { "arxiv_id": "2601.21838", "title": "Error-detectable Universal Control for High-Gain Bosonic Quantum Error Correction", "authors": "Weizhou Cai, Zi-Jie Chen, Ming Li, Qing-Xuan Jie, Xu-Bo Zou, Guang-Can Guo, Luyan Sun, Chang-Ling Zou", "arxiv_url": "https://arxiv.org/abs/2601.21838", "pdf_url": "https://arxiv.org/pdf/2601.21838.pdf", "summary": "Error-detectable control discards ancilla relaxation trajectories, suppressing operational errors in bosonic QEC. Achieves >99.6% gate fidelities and $8.33\times$ QEC gain beyond break-even for binomial codes.", "motivation": "Bosonic logical qubits achieve only ~2x physical coherence due to ancilla errors despite good cavities. Detecting and postselecting ancilla failures unlocks high QEC gains.", "highlights": [ "$8.33\\times$ QEC gain", "99.6% gate fidelity", "Ancilla postselection" ], "keywords": [ { "label": "binomial codes", "reason": "Bosonic encoding benchmarked" }, { "label": "error-detectable control", "reason": "Suppresses ancilla errors" }, { "label": "QEC gain", "reason": "Beyond break-even metric" } ], "emoji": "🔒", "social_summary": "Error-detectable gates yield 8x coherence gain in bosonic QEC.", "highlights_oneliner": "Bosonic QEC gains" }, { "arxiv_id": "2601.21616", "title": "A biased-erasure cavity qubit with hardware-efficient quantum error detection", "authors": "Jiasheng Mai, Qiyu Liu, Xiaowei Deng, Yanyan Cai, Zhongchu Ni, Libo Zhang, Ling Hu, Pan Zheng, Song Liu, Yuan Xu, Dapeng Yu", "arxiv_url": "https://arxiv.org/abs/2601.21616", "pdf_url": "https://arxiv.org/pdf/2601.21616.pdf", "summary": "Biased-erasure qubit in cavity vacuum/two-photon Fock states with >265 bias ratio and <1% logical errors. Postselection yields 6x coherence gain with strong error hierarchy and 0.29% gate error.", "motivation": "Erasure qubits relax thresholds; biased versions from one basis enhance hierarchy. Hardware-efficient cavity implementation enables concatenation to stabilizers.", "highlights": [ "265 erasure bias", "6x coherence gain", "0.29% gate error" ], "keywords": [ { "label": "biased-erasure qubit", "reason": "Vacuum/two-photon encoding" }, { "label": "cavity qubit", "reason": "Hardware platform" }, { "label": "error hierarchy", "reason": "Postselected rates" } ], "emoji": "🕳️", "social_summary": "Biased-erasure cavity qubit achieves 6x coherence gain with strong hierarchy.", "highlights_oneliner": "Biased cavity erasure" }, { "arxiv_id": "2601.21330", "title": "Belief Propagation with Quantum Messages for Symmetric Q-ary Pure-State Channels", "authors": "Avijit Mandal, Henry D. Pfister", "arxiv_url": "https://arxiv.org/abs/2601.21330", "pdf_url": "https://arxiv.org/pdf/2601.21330.pdf", "summary": "Extends BPQM to symmetric $q$-ary PSCs via Gram eigenvalues for efficient recursions and explicit unitaries. Enables DE thresholds for LDPC and polar code design without state simulation.", "motivation": "BPQM enables low-complexity decoding for binary PSCs but $q$-ary extensions lacked efficient analysis. Gram eigenvalue approach scales to multi-level symmetries for capacity-approaching codes.", "highlights": [ "Gram eigenvalue recursions", "q-ary polar/LDPC design", "DE thresholds" ], "keywords": [ { "label": "BPQM", "reason": "Quantum message passing" }, { "label": "Gram matrix", "reason": "Eigenvalue tracking" }, { "label": "q-ary PSCs", "reason": "Symmetric channel class" } ], "emoji": "📡", "social_summary": "BPQM for q-ary channels via Gram eigenvalues enables efficient decoding.", "highlights_oneliner": "q-ary BPQM" } ] }, "2026-01-29": { "word_cloud": [ { "word": "fault-tolerant", "weight": 5 }, { "word": "autonomous", "weight": 5 }, { "word": "cellular", "weight": 4 }, { "word": "Lindbladian", "weight": 4 }, { "word": "QSP", "weight": 5 }, { "word": "error", "weight": 4 }, { "word": "mitigation", "weight": 5 }, { "word": "coherent", "weight": 4 }, { "word": "ensemble", "weight": 4 }, { "word": "algorithms", "weight": 3 }, { "word": "architecture", "weight": 3 }, { "word": "software", "weight": 3 }, { "word": "threshold", "weight": 4 }, { "word": "concatenated", "weight": 4 }, { "word": "noise", "weight": 3 }, { "word": "logical", "weight": 3 }, { "word": "qubits", "weight": 3 }, { "word": "Hamiltonian", "weight": 3 }, { "word": "simulation", "weight": 3 } ], "social_highlights": "Highlights: CS challenges for early fault-tolerant QC, 2D autonomous QEC with threshold, ensemble QSP mitigates coherent errors.", "papers": [ { "arxiv_id": "2601.20247", "title": "Computer Science Challenges in Quantum Computing: Early Fault-Tolerance and Beyond", "authors": "Jens Palsberg, Jason Cong, Yufei Ding, Bill Fefferman, Moinuddin Qureshi, Gokul Subramanian Ravi, Kaitlin N. Smith, Hanrui Wang, Xiaodi Wu, Henry Yuen", "arxiv_url": "https://arxiv.org/abs/2601.20247", "pdf_url": "https://arxiv.org/pdf/2601.20247", "summary": "Early fault-tolerant quantum computing shifts bottlenecks from hardware to computer-science areas like algorithms, error correction, software, and architecture. Systems with few logical qubits face tight constraints on error rates, connectivity, latency, and control. Key research challenges are organized around these four areas, each with a fundamental question.", "motivation": "As quantum hardware improves, progress depends increasingly on computer science innovations rather than physics alone. This matters for enabling practical near- and medium-term quantum systems before full-scale fault-tolerance.", "highlights": [ "CS-driven bottlenecks in early FTQC", "Challenges in algorithms, EC, software, architecture", "Few logical qubits with tight constraints" ], "keywords": [ { "label": "early fault-tolerance", "reason": "Focuses on near-term systems with small logical qubit counts" }, { "label": "system design", "reason": "Shifts emphasis to integration and evaluation bottlenecks" }, { "label": "research challenges", "reason": "Organizes problems around four CS areas" }, { "label": "logical qubits", "reason": "Central to constrained near-term architectures" } ], "emoji": "👨‍💻", "social_summary": "Shifts quantum computing bottlenecks to CS challenges in algorithms, error correction, and architecture.", "highlights_oneliner": "CS Challenges Early FTQC" }, { "arxiv_id": "2601.20818", "title": "Quantum Memory and Autonomous Computation in Two Dimensions", "authors": "Gesa Dünnweber, Georgios Styliaris, Rahul Trivedi", "arxiv_url": "https://arxiv.org/abs/2601.20818", "pdf_url": "https://arxiv.org/pdf/2601.20818", "summary": "Presents autonomous QEC in 2D using quantum cellular automaton with local, translation-invariant rules based on Gács-inspired hierarchical control and measurement-free concatenated code. Proves noise threshold where logical errors suppress with size increase and memory lifetime diverges thermodynamically. Enables fault-tolerant encoding of arbitrary quantum circuits as self-correcting universal QC.", "motivation": "Standard QEC needs active measurements, but passive autonomous QEC was only known in unphysical dimensions. This 2D breakthrough enables measurement-free, feedback-free fault-tolerance, advancing self-correcting quantum memories.", "highlights": [ "2D autonomous QEC threshold", "Diverging memory lifetime", "Universal fault-tolerant computation" ], "keywords": [ { "label": "quantum cellular automaton", "reason": "Core update rule for autonomous dynamics" }, { "label": "self-simulating control", "reason": "Hierarchical elements from Gács classical schemes" }, { "label": "concatenated code", "reason": "Measurement-free encoding for hierarchy" }, { "label": "Lindbladian", "reason": "Continuous-time dissipative implementation" } ], "emoji": "⚡", "social_summary": "Achieves autonomous 2D quantum error correction with proven noise threshold and universal computation.", "highlights_oneliner": "2D Autonomous QEC" }, { "arxiv_id": "2601.20073", "title": "Ensemble-Based Quantum Signal Processing for Error Mitigation", "authors": "Suying Liu, Yulong Dong, Dong An, Murphy Yuezhen Niu", "arxiv_url": "https://arxiv.org/abs/2601.20073", "pdf_url": "https://arxiv.org/pdf/2601.20073", "summary": "Introduces noise-resilient QSP framework using ensembles of noisy circuits and measurement averaging to suppress random coherent errors without added depth or ancillas. Develops robust QSP for polynomial functions, observable estimation, with apps in Hamiltonian simulation, linear systems, ground-state prep. Analyzes error-noise trade-off for NISQ constraints.", "motivation": "Coherent errors dominate NISQ noise, challenging QSP optimality assumed under negligible errors. This integrates mitigation into QSP design for practical near-term quantum algorithms.", "highlights": [ "Mitigates coherent errors in QSP", "No depth/ancilla overhead", "Apps to simulation, linear systems" ], "keywords": [ { "label": "Quantum Signal Processing", "reason": "Core framework made noise-resilient" }, { "label": "ensemble averaging", "reason": "Suppresses random phase errors via measurements" }, { "label": "coherent errors", "reason": "Targets dominant NISQ noise source" }, { "label": "polynomial transformations", "reason": "Enables robust Hamiltonian simulation etc." } ], "emoji": "🪄", "social_summary": "Ensemble QSP mitigates coherent errors for NISQ algorithms without extra resources.", "highlights_oneliner": "Robust QSP Error Mitigation" } ] }, "2026-01-28": { "word_cloud": [ { "word": "stabilizer", "weight": 5 }, { "word": "low-weight", "weight": 4 }, { "word": "qLDPC", "weight": 4 }, { "word": "decoding", "weight": 5 }, { "word": "surface", "weight": 3 }, { "word": "spectral", "weight": 3 }, { "word": "qutrit", "weight": 3 }, { "word": "bicycle", "weight": 4 }, { "word": "reinforcement", "weight": 4 }, { "word": "T-count", "weight": 3 }, { "word": "QRAC", "weight": 3 }, { "word": "chain", "weight": 4 }, { "word": "LP", "weight": 3 }, { "word": "folded", "weight": 3 }, { "word": "metachecks", "weight": 4 }, { "word": "transversal", "weight": 3 }, { "word": "RL", "weight": 4 }, { "word": "Koszul", "weight": 3 } ], "social_highlights": "Highlights: bounds low-weight codes, folded surface codes, spectral QEC geometry, qutrit AME codes, MM single-shot codes, RL decoding, T-count reduction, optimal QRACs.", "papers": [ { "arxiv_id": "2601.19848", "title": "Theory of low-weight quantum codes", "authors": "Fuchuan Wei, Zhengyi Han, Austin Yubo He, Zimu Li, Zi-Wen Liu", "arxiv_url": "https://arxiv.org/abs/2601.19848", "pdf_url": "https://arxiv.org/pdf/2601.19848", "summary": "Proves computing optimal code weight is $\\mathsf{NP}$-hard and provides analytical lower bounds for weight-constrained stabilizer codes, fully characterizing those with weight $\\leq 3$ as having distance 2 and rate $\\leq 1/4$. Develops a linear programming scheme yielding exact optimal weights for $n\\leq 9$ and applies to practical architectures like IBM 127-qubit chip.", "motivation": "Low check weight is crucial for fault-tolerant quantum computing to reduce circuit complexity and error propagation, driving interest in qLDPC codes amid challenges in scalable QEC. This work establishes weight as a core parameter, providing bounds essential for code design in realistic noisy systems.", "highlights": [ "$\\mathsf{NP}$-hard optimal weight", "Weight $\\leq 3$ codes: $d=2$, rate $\\leq 1/4$", "LP bounds for $n\\leq 9$" ], "keywords": [ { "label": "qLDPC", "reason": "Focus on low-density parity-check codes with constant weight checks" } ], "emoji": "⚖️", "social_summary": "Proves low-weight code optimization NP-hard, gives tight bounds for stabilizer codes.", "highlights_oneliner": "Low-weight code bounds" }, { "arxiv_id": "2601.19823", "title": "A Folded Surface Code Architecture for 2D Quantum Hardware", "authors": "Zhu Sun, Zhenyu Cai", "arxiv_url": "https://arxiv.org/abs/2601.19823", "pdf_url": "https://arxiv.org/pdf/2601.19823", "summary": "Proposes folded surface codes using short-range qubit shuttling on 2D hardware for constant-time single-qubit Clifford gates and CNOTs, reducing from $\\mathcal{O}(d)$. Shows transversal $S$ gate cuts 8T-to-CCZ magic-state distillation spacetime by >10x versus 2D lattice surgery. Introduces virtual-stack layout for efficient multilayer routing.", "motivation": "Qubit shuttling enables scaling in trapped-ion and neutral-atom platforms but requires architectures exploiting 2D hardware for 3D connectivity. Folded codes address surface code latency issues, enhancing fault-tolerant gates critical for practical quantum advantage.", "highlights": [ "Constant-time Cliffords/CNOTs", "10x magic-state savings", "Virtual-stack routing" ], "keywords": [ { "label": "folded surface code", "reason": "New architecture using shuttling for 2D hardware" }, { "label": "lattice surgery", "reason": "Improved gate times vs standard method" }, { "label": "magic-state distillation", "reason": "Reduced spacetime via transversal $S$" } ], "emoji": "📏", "social_summary": "Folds surface codes for constant-time gates on 2D hardware.", "highlights_oneliner": "Folded 2D surface codes" }, { "arxiv_id": "2601.19765", "title": "Spectral Codes: A Geometric Formalism for Quantum Error Correction", "authors": "Satoshi Kanno, Yoshi-aki Shimada", "arxiv_url": "https://arxiv.org/abs/2601.19765", "pdf_url": "https://arxiv.org/pdf/2601.19765", "summary": "Reformulates QEC codes as spectral projections of Dirac operators in noncommutative geometry, unifying classical, stabilizer, GKP, topological codes. Relates leakage to spectral gap, enabling gap enhancement via code-preserving perturbations for better thresholds. Interprets Berezin-Toeplitz as mixed spectral code with holographic implications.", "motivation": "Traditional QEC lacks unified geometric view across code types; noncommutative geometry offers spectral tools to link locality, distance, thresholds. Provides mechanism to boost performance without changing logical space, advancing theoretical foundations.", "highlights": [ "Unified spectral triple codes", "Spectral gap controls leakage", "Geometric threshold boost" ], "keywords": [ { "label": "spectral triples", "reason": "Core geometric formalism for codes" }, { "label": "Dirac operator", "reason": "Projects logical from error subspaces" }, { "label": "noncommutative geometry", "reason": "Unifies diverse code families" } ], "emoji": "🌐", "social_summary": "Unifies QEC via spectral geometry in noncommutative space.", "highlights_oneliner": "Spectral QEC geometry" }, { "arxiv_id": "2601.19677", "title": "Transversal gates of the ((3,3,2)) qutrit code and local symmetries of the absolutely maximally entangled state of four qutrits", "authors": "Ian Tan", "arxiv_url": "https://arxiv.org/abs/2601.19677", "pdf_url": "https://arxiv.org/pdf/2601.19677", "summary": "Proves bijection between LU orbits of 4-qutrit AME states and $((3,3,2))_3$ qutrit codes, both unique up to LU. Shows transversal gates of code relate to local symmetries of AME state, finding generators via Vinberg graded Lie algebras.", "motivation": "Connections between entanglement, QECC, geometric invariant theory underexplored; qutrit codes extend qubit results. Links AME states to unique codes, using Vinberg theory for transversal gates vital in fault-tolerance.", "highlights": [ "AME-qutrit code bijection", "Unique $((3,3,2))_3$ code", "Vinberg generators" ], "keywords": [ { "label": "AME state", "reason": "Bijection to pure qutrit code" }, { "label": "qutrit code", "reason": "$((3,3,2))_3$ transversal gates" }, { "label": "Vinberg theory", "reason": "Generates symmetry groups" } ], "emoji": "🔗", "social_summary": "Links 4-qutrit AME to unique code's transversal gates.", "highlights_oneliner": "Qutrit AME-code symmetries" }, { "arxiv_id": "2601.18879", "title": "Multivariate Multicycle Codes for Complete Single-Shot Decoding", "authors": "Feroz Ahmed Mian, Owen Gwilliam, Stefan Krastanov", "arxiv_url": "https://arxiv.org/abs/2601.18879", "pdf_url": "https://arxiv.org/pdf/2601.18879", "summary": "Introduces MM codes unifying bicycle, tricycle, toric codes as CSS from $t\\geq4$ chain complexes with metachecks for single-shot decoding. Uses Koszul for explicit maps, finds high-rate/distance codes like $[[216,12,12]]$, surpassing confinement records.", "motivation": "Advanced codes need single-shot decoding for efficiency; prior families fragmented. MM unifies with algebraic structure for non-Cliffords, enabling scalable high-performance QEC beyond surface codes.", "highlights": [ "$[[216,12,12]]$ code", "Record confinement", "Koszul chain complexes" ], "keywords": [ { "label": "MM codes", "reason": "Unifies multicycle families" }, { "label": "single-shot decoding", "reason": "Complete via metachecks" }, { "label": "Koszul complex", "reason": "Explicit boundary maps" } ], "emoji": "🔄", "social_summary": "New MM codes enable full single-shot decoding with top confinement.", "highlights_oneliner": "Multicyle single-shot codes" }, { "arxiv_id": "2601.19279", "title": "Reinforcement Learning for Enhanced Advanced QEC Architecture Decoding", "authors": "Yidong Zhou, Lingyi Kong, Yifeng Peng, Zhiding Liang", "arxiv_url": "https://arxiv.org/abs/2601.19279", "pdf_url": "https://arxiv.org/pdf/2601.19279", "summary": "Applies hybrid/multi-agent RL for decoding advanced QLDPC like BB codes, adapting to syndrome-dependent errors and hardware. Introduces SPA-MARL with learnable synergy for distributed QPUs, achieving linear latency scaling.", "motivation": "Advanced QLDPC promise efficiency but decoding complexity bottlenecks real-time FTQC; traditional methods fail at scale. RL adapts to noise/hardware, enabling modular scaling essential for practical systems.", "highlights": [ "SPA-MARL framework", "Syndrome-dependent decomposition", "Linear distributed latency" ], "keywords": [ { "label": "SPA-MARL", "reason": "Synergy-aware multi-agent RL" }, { "label": "BB codes", "reason": "Targets high-rate QLDPC" }, { "label": "distributed decoding", "reason": "Adapts to QPU networks" } ], "emoji": "🤖", "social_summary": "RL boosts decoding for advanced QEC architectures.", "highlights_oneliner": "RL for QLDPC decoding" }, { "arxiv_id": "2601.19738", "title": "Quantum Circuit Pre-Synthesis: Learning Local Edits to Reduce $T$-count", "authors": "Daniele Lizzio Bosco, Lukasz Cincio, Giuseppe Serra, M. Cerezo", "arxiv_url": "https://arxiv.org/abs/2601.19738", "pdf_url": "https://arxiv.org/pdf/2601.19738", "summary": "Proposes Q-PreSyn using RL to learn local merges optimizing circuit representation pre-synthesis, cutting $T$-count up to 20% on 25-qubit circuits without approximation error. Works atop existing synthesizers via unitary-preserving edits.", "motivation": "$T$ gates dominate FTQC cost; local synthesis suboptimal due to representation sensitivity. Pre-synthesis optimizes this, reducing overhead critical for near-term stabilizer code implementations.", "highlights": [ "20% $T$-count reduction", "RL local merges", "Synthesis-agnostic" ], "keywords": [ { "label": "Q-PreSyn", "reason": "RL pre-synthesis framework" }, { "label": "$T$-count", "reason": "Key metric reduction target" }, { "label": "local edits", "reason": "Unitary-preserving merges" } ], "emoji": "✂️", "social_summary": "RL edits circuits to slash T-gate counts before synthesis.", "highlights_oneliner": "Pre-synth T-count cuts" }, { "arxiv_id": "2601.19190", "title": "Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound", "authors": "Takayuki Suzuki", "arxiv_url": "https://arxiv.org/abs/2601.19190", "pdf_url": "https://arxiv.org/pdf/2601.19190", "summary": "Gives explicit operator construction for $(n,n-1)$-QRACs achieving conjectured $\\mathcal{P} = 1/2 + \\sqrt{(n-1)/n}/2$. Decomposes optimal POVM to $O(n)$ depth adjacent gates. Shows $O(\\log n)$ gap from Holevo in high-$n$ symmetric encoding.", "motivation": "Optimal QRACs test quantum advantage in communication/computation; analytical general-$n$ constructions open. Scalable circuits enable high-D protocols like security proofs, dimension tests.", "highlights": [ "Saturates $\\mathcal{P}$ bound", "$O(n)$ depth decoding", "Holevo gap analysis" ], "keywords": [ { "label": "QRAC", "reason": "$(n,n-1)$ optimal construction" }, { "label": "POVM decomposition", "reason": "Standard gates $O(n)$ depth" }, { "label": "Holevo bound", "reason": "High-D information gap" } ], "emoji": "📡", "social_summary": "Analytical optimal (n,n-1) QRACs with efficient circuits.", "highlights_oneliner": "Optimal QRAC construction" } ] }, "2026-01-27": { "word_cloud": [ { "word": "decoding", "weight": 5 }, { "word": "qLDPC", "weight": 4 }, { "word": "post-selection", "weight": 4 }, { "word": "syndrome", "weight": 4 }, { "word": "mitigation", "weight": 5 }, { "word": "PEC", "weight": 4 }, { "word": "surface", "weight": 3 }, { "word": "code", "weight": 3 }, { "word": "bicycles", "weight": 3 }, { "word": "Chase", "weight": 3 }, { "word": "Holstein-Primakoff", "weight": 4 }, { "word": "spin", "weight": 4 }, { "word": "Bayesian", "weight": 4 }, { "word": "optimization", "weight": 5 }, { "word": "LDPC", "weight": 3 }, { "word": "concatenated", "weight": 3 }, { "word": "benchmarking", "weight": 3 }, { "word": "entropy", "weight": 3 } ], "social_highlights": "Highlights: argument reweighting boosts qLDPC decoding, PropHunt optimizes syndrome circuits, physical QEM enhances code distance, Chase decoding for concatenated codes, HP spin codes for collective noise, QEM-aware optimization benchmarking, Bayesian search discovers top qLDPC codes.", "papers": [ { "arxiv_id": "2601.17757", "title": "Simple, Efficient, and Generic Post-Selection Decoding for qLDPC codes", "authors": "Haipeng Xie, Nobuyuki Yoshioka, Kento Tsubouchi, Ying Li", "arxiv_url": "https://arxiv.org/abs/2601.17757", "pdf_url": "https://arxiv.org/pdf/2601.17757", "summary": "Introduces argument reweighting, a post-selection decoding strategy compatible with maximum-likelihood decoders like MWPM and belief-propagation for qLDPC codes. Suppresses logical errors via additional decoding rounds under reweighted models with low rejection rates. Simulations show nearly two orders of magnitude logical error reduction for $[[144,12,12]]$ bicycle code at $1.44\\times10^{-5}$ rejection.", "motivation": "qLDPC codes reduce qubit overhead for fault-tolerant quantum computing, but decoding performance limits error suppression. Post-selection enhances logical fidelity without extra qubits, addressing hardware constraints in scalable QEC.", "highlights": [ "$[[144,12,12]]$ code: 100x error reduction at low rejection", "Works with MWPM and BP decoders", "Generic for multiple qLDPC families" ], "keywords": [ { "label": "argument reweighting", "reason": "Core post-selection technique using reweighted decoding rounds" }, { "label": "qLDPC", "reason": "Targeted code family with low overhead" }, { "label": "bivariate bicycle", "reason": "Specific high-rate code tested extensively" }, { "label": "MWPM", "reason": "Compatible decoder family benchmarked" } ], "emoji": "📚", "social_summary": "Argument reweighting slashes qLDPC logical errors 100x with tiny rejection rate.", "highlights_oneliner": "Post-selection qLDPC decoding" }, { "arxiv_id": "2601.17580", "title": "PropHunt: Automated Optimization of Quantum Syndrome Measurement Circuits", "authors": "Joshua Viszlai, Satvik Maurya, Swamit Tannu, Margaret Martonosi, Frederic T. Chong", "arxiv_url": "https://arxiv.org/abs/2601.17580", "pdf_url": "https://arxiv.org/pdf/2601.17580", "summary": "PropHunt automates optimization of syndrome measurement circuits for CSS codes by minimizing error ambiguity. Recovers hand-designed circuits and improves LP/RQT codes by 2.5x-4x lower logical error rates. Introduces Hook-ZNE using optimized circuits for 3x-6x better error mitigation.", "motivation": "SM circuits critically impact QEC logical error rates but lack NISQ-tailored optimization tools. Better circuits enable practical FTQC and enhance near-term mitigation like ZNE.", "highlights": [ "2.5x-4x lower errors for LP/RQT codes", "Recovers hand-designed circuits", "Hook-ZNE: 3x-6x mitigation gain" ], "keywords": [ { "label": "PropHunt", "reason": "Novel automated SM circuit optimizer" }, { "label": "syndrome measurement", "reason": "Circuit type optimized for error propagation" }, { "label": "CSS codes", "reason": "Code family targeted" }, { "label": "Hook-ZNE", "reason": "New ZNE application using intermediates" } ], "emoji": "🔀", "social_summary": "PropHunt auto-optimizes syndrome circuits, slashing QEC errors 4x.", "highlights_oneliner": "SM circuit optimizer" }, { "arxiv_id": "2601.18384", "title": "Quantum Error Correction on Error-mitigated Physical Qubits", "authors": "Minjun Jeon, Zhenyu Cai", "arxiv_url": "https://arxiv.org/abs/2601.18384", "pdf_url": "https://arxiv.org/pdf/2601.18384", "summary": "Framework integrates linear QEM (PEC, ZNE) at physical layer without decoder changes, leveraging QEC linearity. PEC removes leading-order logical error, boosting effective distance by 2. Distance-$3$ codes with PEC match distance-$5$ unmitigated using 40-64% fewer qubits.", "motivation": "Limited qubits demand hybrid QEC-QEM for early FTQC; logical QEM alone misses physical noise leverage. Physical QEM maximizes near-term hardware utility.", "highlights": [ "Effective distance +2 via PEC", "d=3 repetition: 5x lower error, 40% fewer qubits", "d=3 surface rivals d=5, 64% fewer qubits" ], "keywords": [ { "label": "physical QEM", "reason": "Application layer for mitigation-QEC hybrid" }, { "label": "PEC", "reason": "Proven QEM removing $\\mathcal{O}(p^{\\lceil d/2\\rceil})$ term" }, { "label": "code distance", "reason": "Key metric boosted by 2" }, { "label": "linearity", "reason": "QEC property enabling decoder compatibility" } ], "emoji": "⚙️", "social_summary": "Physical error mitigation boosts QEC distance by 2, saves 64% qubits.", "highlights_oneliner": "QEM-QEC hybrid" }, { "arxiv_id": "2601.18743", "title": "Approximate level-by-level maximum-likelihood decoding based on the Chase algorithm for high-rate concatenated stabilizer codes", "authors": "Takeshi Kakizaki", "arxiv_url": "https://arxiv.org/abs/2601.18743", "pdf_url": "https://arxiv.org/pdf/2601.18743", "summary": "Proposes LMLD-CA decoder extending LMDD with Chase algorithm for candidate error sets in high-rate concatenated stabilizer codes. Outperforms conventional decoders for concatenated Hamming codes under bit-flip noise. Enables low-overhead FT protocols with constant-space overhead.", "motivation": "High-rate concatenated codes revive for FTQC with polylog time overhead, but need better decoders than LMDD. Chase algorithm from classical coding boosts ML decoding efficiency.", "highlights": [ "Exponential decoding error improvement", "For high-rate Hamming concatenation", "Chase-based candidate generation" ], "keywords": [ { "label": "Chase algorithm", "reason": "Classical technique adapted for error candidates" }, { "label": "LMLD-CA", "reason": "Proposed approximate ML decoder" }, { "label": "concatenated Hamming", "reason": "High-rate code family tested" }, { "label": "level-by-level", "reason": "Decoding strategy extended" } ], "emoji": "⏭", "social_summary": "Chase decoding exponentially improves high-rate concatenated codes.", "highlights_oneliner": "Chase ML decoding" }, { "arxiv_id": "2601.17592", "title": "Holstein Primakoff spin codes for local and collective noise", "authors": "Sivaprasad Omanakuttan, Tyler Thurtell, Andrew K. Forbes, Vikas Buchemmavari, Ben Q. Baragiola", "arxiv_url": "https://arxiv.org/abs/2601.17592", "pdf_url": "https://arxiv.org/pdf/2601.17592", "summary": "Develops Holstein-Primakoff spin codes mapping bosonic codes to permutation-symmetric spin ensembles via HP approximation. Robust to collective/local noise with measurement-free local recovery converting local to collective errors. Builds on spin-GKP for ensemble platforms.", "motivation": "Spin ensemble platforms favor collective operations over local control; PI codes lack feasible correction. HP mapping enables bosonic code benefits for symmetric spins.", "highlights": [ "Maps bosonic to spin ensembles", "Local recovery sans measurement", "Robust to depolarizing noise" ], "keywords": [ { "label": "Holstein-Primakoff", "reason": "Approximation enabling bosonic-spin mapping" }, { "label": "spin ensembles", "reason": "Target hardware with collective ops" }, { "label": "permutation-invariant", "reason": "Code subspace exploited" }, { "label": "spin-GKP", "reason": "Inspiration for optimal properties" } ], "emoji": "🔗", "social_summary": "HP spin codes correct local/collective noise measurement-free.", "highlights_oneliner": "Spin ensemble codes" }, { "arxiv_id": "2601.18680", "title": "Error-mitigation aware benchmarking strategy for quantum optimization problems", "authors": "Marine Demarty, Bo Yang, Kenza Hammam, Pauline Besserve", "arxiv_url": "https://arxiv.org/abs/2601.18680", "pdf_url": "https://arxiv.org/pdf/2601.18680", "summary": "Benchmarking incorporates finite-shot/QEM overhead, assessing quantum advantage via energy confidence between classical bounds. Identifies PEC-advantageous regimes for Fermi-Hubbard $8\\times8$. Extends entropy benchmarking for practical utility tasks.", "motivation": "Quantum advantage unverifiable classically needs application-specific benchmarks accounting for noise/shots/QEM. Entropy framework misses finite statistics and mitigation costs.", "highlights": [ "Finite-shot QEM benchmarking", "PEC advantageous regimes identified", "Fermi-Hubbard $8\\times8$ study" ], "keywords": [ { "label": "entropy benchmarking", "reason": "Extended for advantage assessment" }, { "label": "PEC overhead", "reason": "QEM resource cost modeled" }, { "label": "Fermi-Hubbard", "reason": "Optimization task benchmarked" }, { "label": "finite-shot", "reason": "Statistical effects incorporated" } ], "emoji": "📊", "social_summary": "QEM-aware benchmarking finds quantum advantage regimes.", "highlights_oneliner": "Optimization benchmarking" }, { "arxiv_id": "2601.18562", "title": "Bayesian Optimization for Quantum Error-Correcting Code Discovery", "authors": "Yihua Chengyu, Richard Meister, Conor Carty, Sheng-Ku Lin, Roberto Bondesan", "arxiv_url": "https://arxiv.org/abs/2601.18562", "pdf_url": "https://arxiv.org/pdf/2601.18562", "summary": "Bayesian optimization with multi-view chain-complex embedding predicts qLDPC logical error rates sans simulation. Discovers $[[144,36]]$ high-rate and $[[144,16]]$ low-error codes beating gross code per-qubit performance. Outperforms evolutionary search.", "motivation": "Code discovery combinatorial; simulations expensive for practical rates/distances. ML surrogates enable scalable search balancing rate/error.", "highlights": [ "$[[144,36]]$ high-rate discovery", "$[[144,16]]$ beats gross LERpq", "Sample-efficient vs baselines" ], "keywords": [ { "label": "Bayesian optimization", "reason": "Search framework for codes" }, { "label": "chain-complex embedding", "reason": "Neural predictor of LER" }, { "label": "bivariate bicycle", "reason": "qLDPC family searched" }, { "label": "LERpq", "reason": "Per-qubit error metric optimized" } ], "emoji": "🪄", "social_summary": "Bayesian search finds top qLDPC codes balancing rate/error.", "highlights_oneliner": "Code discovery BO" } ] }, "2026-01-26": { "word_cloud": [ { "word": "stabilizer", "weight": 5 }, { "word": "multi-invariants", "weight": 5 }, { "word": "entanglement", "weight": 4 }, { "word": "GKP", "weight": 5 }, { "word": "magic-states", "weight": 5 }, { "word": "photonic", "weight": 4 }, { "word": "squeezing", "weight": 4 }, { "word": "surface-code", "weight": 4 }, { "word": "topology", "weight": 3 }, { "word": "GHZ", "weight": 3 }, { "word": "RUS", "weight": 3 }, { "word": "fidelity", "weight": 3 }, { "word": "injection", "weight": 3 }, { "word": "toric-code", "weight": 3 }, { "word": "X-cube", "weight": 3 }, { "word": "dephasing", "weight": 2 }, { "word": "overhead", "weight": 2 }, { "word": "Coxeter", "weight": 2 } ], "social_highlights": "Highlights: multi-invariant formulas for stabilizer states, GKP magic-state injection modeling in photonics.", "papers": [ { "arxiv_id": "2601.16258", "title": "Multi-invariants in stabilizer states", "authors": "Sriram Akella, Abhijit Gadde, Jay Pandey", "arxiv_url": "https://arxiv.org/abs/2601.16258", "pdf_url": "https://arxiv.org/pdf/2601.16258", "summary": "Develops efficient numerical algorithm and explicit formulas for computing multi-invariants in stabilizer states, including tripartite cases via GHZ-extraction and Coxeter multi-invariants via counting arguments. Provides simplifications for X-stabilizer states relevant to toric code and X-cube models. Uncovers connections between multi-invariants, stabilizer states, and topology.", "motivation": "Multipartite entanglement generalizes bipartite measures but lacks understanding, crucial for quantum tasks and condensed matter insights like AdS/CFT. Tools for stabilizer states enable quantification in topological models, advancing entanglement studies.", "highlights": [ "Efficient multi-invariant algorithm for stabilizers", "Tripartite formula via GHZ-extraction", "Topology link in Coxeter invariants" ], "keywords": [ { "label": "multi-invariants", "reason": "Core entanglement measures computed for stabilizers" }, { "label": "stabilizer states", "reason": "Class of states targeted with efficient algorithms" }, { "label": "GHZ-extraction", "reason": "Theorem enabling tripartite formulas" }, { "label": "Coxeter multi-invariants", "reason": "Counting argument and conjecture provided" } ], "emoji": "🔗", "social_summary": "Computed multi-invariants for stabilizer states with efficient algorithms and topology links.", "highlights_oneliner": "Stabilizer multi-invariants" }, { "arxiv_id": "2601.16244", "title": "LiDMaS: Architecture-Level Modeling of Fault-Tolerant Magic-State Injection in GKP Photonic Qubits", "authors": "Dennis Delali Kwesi Wayo", "arxiv_url": "https://arxiv.org/abs/2601.16244", "pdf_url": "https://arxiv.org/pdf/2601.16244", "summary": "Presents LiDMaS simulator for $T$-gate magic-state preparation in GKP photonic qubits using RUS injection with surface-code protection. Models finite squeezing as dephasing, photon loss as erasure, achieving $F_{\\mathrm{log}} \\approx 0.765$--$0.796$ for $8$--$16$ dB squeezing. Provides phase diagrams for squeezing needs versus code distance $d=1,3,5,7$.", "motivation": "Photonic quantum computing needs fault-tolerant non-Clifford gates like $T$ amid loss and finite squeezing challenges. Bridges GKP decoder analyses to system-level magic-state requirements for scalable architectures.", "highlights": [ "$F_{\\mathrm{log}} 0.765$--$0.796$ post-protection", "RUS overhead $1.15$--$1.21$ rounds", "Squeezing dominates over loss" ], "keywords": [ { "label": "GKP qubits", "reason": "Encoding for photonic fault-tolerance" }, { "label": "magic-state injection", "reason": "RUS protocol for $T$-gates modeled" }, { "label": "LiDMaS simulator", "reason": "Density-matrix tool with noise models" }, { "label": "surface-code", "reason": "Outer protection for logical fidelity" } ], "emoji": "✨", "social_summary": "Modeled GKP magic-state injection achieving high logical fidelity in photonics.", "highlights_oneliner": "GKP magic-state simulation" } ] }, "2026-01-23": { "word_cloud": [ { "word": "stabilizer codes", "weight": 5 }, { "word": "decoding", "weight": 5 }, { "word": "logical error rate", "weight": 4 }, { "word": "surface code", "weight": 4 }, { "word": "syndrome measurement", "weight": 4 }, { "word": "neural decoder", "weight": 4 }, { "word": "check weight", "weight": 3 }, { "word": "qLDPC codes", "weight": 3 }, { "word": "Pauli channels", "weight": 3 }, { "word": "GKP encoding", "weight": 3 }, { "word": "deep learning", "weight": 3 }, { "word": "hardware noise", "weight": 3 }, { "word": "real-time decoding", "weight": 3 }, { "word": "code distance", "weight": 3 }, { "word": "tensor networks", "weight": 2 }, { "word": "Bell nonlocality", "weight": 2 }, { "word": "continuous variables", "weight": 2 }, { "word": "symmetry optimization", "weight": 2 } ], "social_highlights": "Highlights: Unified algebraic framework for Clifford and free-fermion models via quadratic tensors, fundamental bounds on qLDPC codes with constrained check weights, Bell nonlocality from GKP-encoded multipartite states, improved quantum capacity bounds via stabilizer channel transforms, symmetry-based deep learning decoders for arbitrary stabilizer codes, hardware-conditioned neural decoders achieving 11× error reduction on IBM processors.", "papers": [ { "arxiv_id": "2601.15396", "title": "Quadratic tensors as a unification of Clifford, Gaussian, and free-fermion physics", "authors": "Andreas Bauer, Seth Lloyd", "arxiv_url": "https://arxiv.org/abs/2601.15396", "pdf_url": "https://arxiv.org/pdf/2601.15396", "summary": "Demonstrates that Clifford circuits, stabilizer codes, free-boson/fermion models, and GKP codes can be unified as quadratic functions over abelian groups and Hopf algebras. Quadratic tensors with $n$ degrees of freedom require only $O(n^2)$ coefficients and enable efficient contraction via Schur complement operations. Generalizes framework to $i$-th order tensors and mixed-dimension qudit systems.", "motivation": "Classical simulation of quantum systems has long relied on exploiting special structure in specific model families. This work reveals a deep algebraic unity underlying seemingly disparate quantum systems, providing a principled foundation for understanding which quantum models admit efficient classical description and enabling new algorithmic approaches.", "highlights": [ "Unified algebraic structure for Clifford, Gaussian, free-fermion, rotor, and GKP models", "Efficient tensor contraction using Schur complement on $O(n^2)$ coefficients", "Generalized stabilizer codes and Clifford gates for arbitrary abelian groups" ], "keywords": [ { "label": "Quadratic tensors", "reason": "Core mathematical framework unifying multiple quantum model families through quadratic functions" }, { "label": "Stabilizer codes", "reason": "Generalized to arbitrary abelian groups within the quadratic tensor formalism" }, { "label": "Classical simulation", "reason": "Efficient contraction algorithms enable polynomial-time classical computation for these models" }, { "label": "Mixed-dimension systems", "reason": "Framework naturally incorporates qudits of different dimensions and fermionic modes" } ], "emoji": "🧮", "social_summary": "Unify Clifford circuits, stabilizer codes, and free-fermion models through quadratic tensor algebra with efficient classical contraction.", "highlights_oneliner": "Algebraic unification of quantum models via quadratic tensors" }, { "arxiv_id": "2601.15446", "title": "Check-weight-constrained quantum codes: Bounds and examples", "authors": "Lily Wang, Andy Zeyi Liu, Ray Li, Aleksander Kubica, Shouzhen Gu", "arxiv_url": "https://arxiv.org/abs/2601.15446", "pdf_url": "https://arxiv.org/pdf/2601.15446", "summary": "Establishes fundamental upper bounds on parameters of quantum low-density parity-check (qLDPC) codes with constrained check weight, proving stabilizer codes with weight-3 checks cannot have nontrivial distance. Derives tight rate-distance tradeoffs for CSS codes with weight-4 and weight-2 checks respectively using analytical arguments and linear programming optimization. Identifies explicit code constructions approaching these limits for practical finite-size regimes.", "motivation": "qLDPC codes are essential for noise-resilient quantum computers since low-weight checks are compatible with noisy hardware, but fundamental limits on achievable parameters under weight constraints remain poorly understood. This work closes gaps in code design by quantifying what parameters are theoretically possible given hardware constraints.", "highlights": [ "Weight-3 stabilizer codes provably cannot achieve nontrivial distance", "Tight rate-distance tradeoffs for weight-4 and weight-2 CSS codes", "Explicit constructions for tens-to-hundreds qubit regimes approaching theoretical limits" ], "keywords": [ { "label": "qLDPC codes", "reason": "Primary focus: quantum low-density parity-check codes with constrained check weights" }, { "label": "Check weight constraints", "reason": "Central technical constraint limiting code parameters and hardware compatibility" }, { "label": "CSS codes", "reason": "Specific code family analyzed with tight parameter bounds derived" }, { "label": "Linear programming bounds", "reason": "Numerical optimization technique used to establish upper bounds on code parameters" } ], "emoji": "📊", "social_summary": "Prove fundamental limits on quantum codes with low-weight checks, guiding practical hardware-compatible code design.", "highlights_oneliner": "Fundamental bounds on low-weight quantum codes" }, { "arxiv_id": "2601.16189", "title": "Robust Bell Nonlocality from Gottesman-Kitaev-Preskill States", "authors": "Xiaotian Yang, Santiago Zamora, Rafael Chaves, Ulrik L. Andersen, Jonatan Bohr Brask, A. de Oliveira Junior", "arxiv_url": "https://arxiv.org/abs/2601.16189", "pdf_url": "https://arxiv.org/pdf/2601.16189", "summary": "Investigates Bell nonlocality in continuous-variable systems using Gottesman-Kitaev-Preskill (GKP) encoding with homodyne detection and periodic binning. Proves bipartite no-go theorem: CHSH cannot be violated for Bell-pair states under this measurement model. Demonstrates multipartite nonlocality in GKP-encoded GHZ and W states, quantifying squeezing thresholds and loss robustness.", "motivation": "Bell tests in continuous-variable systems face fundamental constraints from homodyne detection limitations. GKP codes bridge discrete and continuous quantum information, offering potential to overcome these constraints and enable practical homodyne-based nonlocality tests.", "highlights": [ "Bipartite CHSH violation impossible for GKP-encoded Bell pairs with homodyne readout", "Multipartite Bell inequality violations in GKP-encoded GHZ and W states", "Quantified squeezing thresholds and loss robustness for practical implementation" ], "keywords": [ { "label": "GKP encoding", "reason": "Gottesman-Kitaev-Preskill codes enable logical Pauli measurements via homodyne detection" }, { "label": "Bell nonlocality", "reason": "Core quantum property tested; multipartite violations demonstrated in GKP states" }, { "label": "Continuous variables", "reason": "Physical platform studied; homodyne detection provides measurement access" }, { "label": "Multipartite entanglement", "reason": "GHZ and W states analyzed for nonlocality in multipartite settings" } ], "emoji": "🔗", "social_summary": "Reveal multipartite Bell nonlocality in GKP-encoded quantum states measurable via homodyne detection.", "highlights_oneliner": "Bell nonlocality from GKP-encoded multipartite states" }, { "arxiv_id": "2601.15505", "title": "Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds", "authors": "Tyler Kann, Matthieu R. Bloch, Shrinivas Kudekar, Ruediger Urbanke", "arxiv_url": "https://arxiv.org/abs/2601.15505", "pdf_url": "https://arxiv.org/pdf/2601.15505", "summary": "Generalizes the induced-channel framework for quantum capacity bounds by treating arbitrary $[[n,k]]$ stabilizer codes as channel transforms. Develops computational pipeline to construct full symplectic tableaux, compute induced logical Pauli error distributions, and apply hashing bounds with decoder side information. Demonstrates improved achievable rates beyond baseline hashing bound for asymmetric Pauli channels through structured search over small stabilizer transforms.", "motivation": "The quantum hashing bound provides achievable rates for Pauli channels but is generally not tight. Understanding how stabilizer codes transform channels and reduce residual error entropy reveals structural principles underlying capacity-achieving constructions, analogous to classical polar codes.", "highlights": [ "General pipeline for computing induced channels from arbitrary stabilizer code transforms", "Improved achievable rates for asymmetric Pauli channels beyond baseline hashing bound", "Structured search identifies small stabilizer transforms beating repetition codes" ], "keywords": [ { "label": "Pauli channels", "reason": "Quantum channel model studied; hashing bound provides achievable rates" }, { "label": "Stabilizer code transforms", "reason": "Small stabilizer codes used as channel transforms to improve capacity bounds" }, { "label": "Quantum capacity", "reason": "Fundamental information-theoretic quantity; improved achievable rates derived" }, { "label": "Symplectic tableau", "reason": "Computational representation enabling efficient induced-channel calculations" } ], "emoji": "📈", "social_summary": "Improve quantum channel capacity bounds using stabilizer code transforms beyond simple repetition codes.", "highlights_oneliner": "Improved capacity bounds via stabilizer channel transforms" }, { "arxiv_id": "2601.15361", "title": "USDs: A universal stabilizer decoder framework using symmetry", "authors": "Hoshitaro Ohnishi, Hideo Mukai", "arxiv_url": "https://arxiv.org/abs/2601.15361", "pdf_url": "https://arxiv.org/pdf/2601.15361", "summary": "Generalizes symmetry-based decoder re-optimization from toric codes to arbitrary stabilizer codes, addressing label degeneracy in deep-learning decoders. Employs multilayer perceptrons to approximate continuous functions complementing syndrome measurements for Color and Golay codes. Achieves $\\sim 0.8\\%$ accuracy improvement for Color code at $p=0.05$ by incorporating geometric structure through re-optimization.", "motivation": "Deep learning decoders for quantum codes face fundamental challenge of non-unique error patterns per syndrome measurement. Prior symmetry-based approaches succeeded for toric codes; generalizing to arbitrary stabilizer codes enables practical neural decoders for diverse code families.", "highlights": [ "Generalized symmetry-based re-optimization for arbitrary stabilizer codes", "0.8% accuracy gain for Color code, 0.1% for Golay code at physical error rate 5%", "Demonstrated importance of code structure in neural function approximation" ], "keywords": [ { "label": "Stabilizer codes", "reason": "Framework applies to arbitrary stabilizer codes including Color and Golay codes" }, { "label": "Deep learning decoders", "reason": "Neural networks (MLPs, Transformers) used for syndrome-to-error inference" }, { "label": "Symmetry optimization", "reason": "Core technique: re-optimizing decoders with respect to parity-check symmetries" }, { "label": "Label degeneracy", "reason": "Fundamental challenge addressed: multiple error patterns map to same syndrome" } ], "emoji": "🧠", "social_summary": "Extend symmetry-based neural decoders to arbitrary stabilizer codes, improving accuracy via structure-aware learning.", "highlights_oneliner": "Symmetry-optimized neural decoders for stabilizer codes" }, { "arxiv_id": "2601.16123", "title": "Calibration-Conditioned FiLM Decoders for Low-Latency Decoding of Quantum Error Correction Evaluated on IBM Repetition-Code Experiments", "authors": "Samuel Stein, Shuwen Kan, Chenxu Liu, Adrian Harkness, Sean Garner, Zefan Du, Yufei Ding, Ying Mao, Ang Li", "arxiv_url": "https://arxiv.org/abs/2601.16123", "pdf_url": "https://arxiv.org/pdf/2601.16123", "summary": "Introduces hardware-conditioned neural decoder exploiting timescale separation in superconducting processors: calibration drifts over hours while error correction requires microsecond responses. Uses graph-based encoder processing calibration data and feature-wise linear modulation (FiLM) conditioning lightweight CNN for low-latency syndrome decoding. Evaluated on IBM processors with $2.7$ million experimental shots up to distance $d=11$, achieving $11.1\\times$ logical error rate reduction versus modified minimum-weight perfect matching.", "motivation": "Real-time decoding is essential for fault-tolerant quantum computation but must handle spatial and temporal hardware noise variations. Existing decoders either ignore calibration data or require expensive retraining; exploiting natural hardware timescales enables adaptive, low-latency decoding.", "highlights": [ "11.1× logical error rate reduction versus MWPM on unseen IBM experiments", "Single model generalizes to unseen qubit chains and calibration data days later", "Negligible latency overhead via asynchronous calibration-decoding architecture" ], "keywords": [ { "label": "Real-time decoding", "reason": "Primary application: microsecond-scale syndrome decoding for fault-tolerant QEC" }, { "label": "Neural decoders", "reason": "FiLM-conditioned CNN architecture for hardware-adaptive decoding" }, { "label": "Hardware calibration", "reason": "Calibration data (T1, T2, gate error, readout error) conditions decoder via FiLM" }, { "label": "Repetition codes", "reason": "Testbed code family; evaluated on IBM Fez, Kingston, Pittsburgh processors" } ], "emoji": "⚡", "social_summary": "Deploy hardware-conditioned neural decoders achieving 11× error reduction on real IBM quantum processors with microsecond latency.", "highlights_oneliner": "Hardware-conditioned neural decoders for real-time QEC" } ] }, "2026-01-22": { "word_cloud": [ { "word": "MBQC", "weight": 5 }, { "word": "binomial", "weight": 5 }, { "word": "cavity-QED", "weight": 5 }, { "word": "optical", "weight": 4 }, { "word": "cluster", "weight": 4 }, { "word": "Pauli", "weight": 3 }, { "word": "photonic", "weight": 4 }, { "word": "non-Gaussian", "weight": 3 }, { "word": "atom-cavity", "weight": 4 }, { "word": "measurement-based", "weight": 3 }, { "word": "resource", "weight": 2 }, { "word": "conditional", "weight": 3 }, { "word": "generation", "weight": 2 }, { "word": "toolkit", "weight": 2 }, { "word": "protocol", "weight": 3 }, { "word": "architectures", "weight": 2 } ], "social_highlights": "Highlights: cavity-QED toolkit enables MBQC with simpler optical binomial codes.", "papers": [ { "arxiv_id": "2601.15019", "title": "Cavity-QED tools for MBQC with optical binomial-codes", "authors": "G. P. Teja, Radim Filip", "arxiv_url": "https://arxiv.org/abs/2601.15019", "pdf_url": "https://arxiv.org/pdf/2601.15019", "summary": "This paper introduces a cavity-QED protocol for conditional generation of cluster states using optical binomial codes in measurement-based quantum computation ($MBQC$). It details tools for implementing Pauli measurements, providing an experimentally accessible alternative to complex encodings like GKP states. The work lays foundational steps for optical atom-cavity systems in quantum computing.", "motivation": "Photonic $MBQC$ has been limited by the need for complex non-Gaussian resource states like GKP, hindering practical implementation. Binomial codes offer a simpler alternative, and this paper provides essential cavity-QED tools to enable their use in existing optical architectures, advancing fault-tolerant photonic quantum computing.", "highlights": [ "Cavity-QED protocol for binomial cluster states", "Pauli measurement toolkit for optical $MBQC$", "First steps for atom-cavity quantum computation" ], "keywords": [ { "label": "binomial codes", "reason": "Simpler continuous-variable encoding alternative to GKP for photonic $MBQC$" }, { "label": "cavity-QED", "reason": "Protocol enabling conditional state generation in optical systems" }, { "label": "cluster states", "reason": "Key resource states generated for $MBQC$ implementation" }, { "label": "Pauli measurements", "reason": "Essential operations detailed for binomial code $MBQC$" } ], "emoji": "🔗", "social_summary": "Unveils cavity-QED toolkit for MBQC using simpler optical binomial codes.", "highlights_oneliner": "Cavity-QED for binomial MBQC" } ] }, "2026-01-21": { "word_cloud": [ { "word": "Syndrome", "weight": 5 }, { "word": "Scheduling", "weight": 4 }, { "word": "MCTS", "weight": 3 }, { "word": "Steane", "weight": 4 }, { "word": "State", "weight": 3 }, { "word": "Preparation", "weight": 4 }, { "word": "3D", "weight": 5 }, { "word": "Stacked", "weight": 4 }, { "word": "MFEC", "weight": 5 }, { "word": "Deep", "weight": 4 }, { "word": "Learning", "weight": 4 }, { "word": "Mitigation", "weight": 5 }, { "word": "Vision", "weight": 4 }, { "word": "Transformer", "weight": 5 }, { "word": "MoE", "weight": 4 }, { "word": "Color", "weight": 5 }, { "word": "Code", "weight": 4 }, { "word": "Anyons", "weight": 3 }, { "word": "Topological", "weight": 5 }, { "word": "Decoder", "weight": 5 }, { "word": "Surface", "weight": 4 } ], "social_highlights": "Highlights: AlphaSyndrome schedules syndrome circuits, Steane synthesis for ancillas, 3D MFEC architecture, deep mitigation, MoE toric decoder, infinite color code anyons.", "papers": [ { "arxiv_id": "2601.12509", "title": "AlphaSyndrome: Tackling the Syndrome Measurement Circuit Scheduling Problem for QEC Codes", "authors": "Yuhao Liu, Shuohao Ping, Junyu Zhou, Ethan Decker, Justin Kalloor, Mathias Weiden, Kean Chen, Yunong Shi, Ali Javadi-Abhari, Costin Iancu, Gushu Li", "arxiv_url": "https://arxiv.org/abs/2601.12509", "pdf_url": "https://arxiv.org/pdf/2601.12509", "summary": "AlphaSyndrome is an automated framework using Monte Carlo Tree Search ($MCTS$) to optimize syndrome-measurement scheduling for general commuting-stabilizer codes, shaping error propagation to avoid logical operators and stay within decoder correctable regions. It reduces logical error rates by $80.6\\%$ on average (up to $96.2\\%$) across diverse codes relative to depth-optimal baselines.", "motivation": "Syndrome scheduling beyond surface codes remains underexplored despite its dominance in QEC spacetime costs, with prior works limited to manual designs for specific families ignoring decoder feedback and non-uniform noise. This matters for scalable QEC as optimal schedules drastically lower logical errors under realistic conditions.", "highlights": [ "$80.6\\%$ average logical error reduction", "Matches Google surface-code schedules", "Outperforms IBM Bivariate Bicycle" ], "keywords": [ { "label": "AlphaSyndrome", "reason": "novel $MCTS$-based synthesis framework" }, { "label": "Syndrome Scheduling", "reason": "core optimization problem tackled" }, { "label": "Hook Errors", "reason": "error propagation mechanism addressed" }, { "label": "Bicycle Codes", "reason": "specific family benchmarked" } ], "emoji": "🐲", "social_summary": "AlphaSyndrome automates syndrome scheduling to slash QEC logical errors by up to 96%.", "highlights_oneliner": "Smart Syndrome Scheduler" }, { "arxiv_id": "2601.13313", "title": "Synthesis of Fault-tolerant State Preparation Circuits using Steane-type Error Detection", "authors": "Erik Weilandt, Tom Peham, Robert Wille", "arxiv_url": "https://arxiv.org/abs/2601.13313", "pdf_url": "https://arxiv.org/pdf/2601.13313", "summary": "Proposes automated synthesis for Steane-type fault-tolerant state preparation in arbitrary CSS codes up to distance $d=7$, reducing ancilla overhead to constant via error detection across multiple initializations. Circuits enable high-fidelity ancilla states for syndrome readout under circuit-level noise.", "motivation": "Steane-style correction needs robust ancillas but prior low-overhead methods rely on symmetric codes like Golay, limiting generality. This advances near-term fault-tolerant demos by automating preparation for diverse CSS codes.", "highlights": [ "Constant ancilla overhead", "Applies to arbitrary CSS codes", "$d=7$ simulations succeed" ], "keywords": [ { "label": "Steane-type", "reason": "error detection preparation method" }, { "label": "CSS Codes", "reason": "general code family targeted" }, { "label": "Automated Synthesis", "reason": "key methodological contribution" }, { "label": "Ancilla Overhead", "reason": "resource metric optimized" } ], "emoji": "🔍", "social_summary": "Synthesizes fault-tolerant ancilla states for any CSS code with constant overhead.", "highlights_oneliner": "Steane Prep Synthesis" }, { "arxiv_id": "2601.13648", "title": "3D Stacked Surface-Code Architecture for Measurement-Free Fault-Tolerant Quantum Error Correction", "authors": "GunSik Min, IlKwon Sohn, Jun Heo", "arxiv_url": "https://arxiv.org/abs/2601.13648", "pdf_url": "https://arxiv.org/pdf/2601.13648", "summary": "Introduces 3D stacked surface-code with vertical couplers enabling constant-depth $O(1)$ inter-layer operations, eliminating $O(d)$ SWAP overhead in 2D MFEC. Fault-tolerant protocol suppresses hook errors, outperforming measurement-based and 2D MFEC under slow/noisy readouts.", "motivation": "Mid-circuit measurements bottleneck superconducting QEC due to slowness/noisiness vs. gates; MFEC helps but 2D connectivity causes high overhead. 3D stacking leverages hardware for scalable measurement-free fault tolerance.", "highlights": [ "Zero SWAP overhead", "Beats readout error floor", "$O(1)$ inter-layer depth" ], "keywords": [ { "label": "3D Stacking", "reason": "architectural innovation" }, { "label": "MFEC", "reason": "measurement-free protocol" }, { "label": "Vertical Couplers", "reason": "hardware enabler" }, { "label": "Hook Errors", "reason": "noise mechanism mitigated" } ], "emoji": "📀", "social_summary": "3D surface code enables measurement-free QEC without SWAP overhead.", "highlights_oneliner": "3D MFEC Surface Code" }, { "arxiv_id": "2601.14226", "title": "Deep Learning Approaches to Quantum Error Mitigation", "authors": "Leonardo Placidi, Ifan Williams, Enrico Rinaldi, Daniel Mills, Cristina Cîrstoiu, Vanya Eccles, Ross Duncan", "arxiv_url": "https://arxiv.org/abs/2601.14226", "pdf_url": "https://arxiv.org/pdf/2601.14226", "summary": "Compares neural architectures for mitigating noisy quantum circuit outputs, finding sequence-to-sequence transformers most effective on simulated/IBM QPU data up to 5 qubits. Outperforms baselines across depths; shows device transfer learning and cross-circuit generalization.", "motivation": "Noisy intermediate-scale quantum devices need mitigation for reliable circuits; deep learning offers data-driven improvement over traditional methods. Enables better use of current QPUs toward fault-tolerant regimes.", "highlights": [ "Transformers outperform baselines", "Cross-QPU transfer learning", "5-qubit IBM validation" ], "keywords": [ { "label": "Transformers", "reason": "top-performing architecture" }, { "label": "Error Mitigation", "reason": "primary application" }, { "label": "Sequence-to-Sequence", "reason": "optimal training modality" }, { "label": "Cross-Device Generalization", "reason": "key capability shown" } ], "emoji": "🪐", "social_summary": "Transformers mitigate quantum errors better than baselines on real IBM hardware.", "highlights_oneliner": "DL Error Mitigation" }, { "arxiv_id": "2601.12483", "title": "A Mixture of Experts Vision Transformer for High-Fidelity Surface Code Decoding", "authors": "Hoang Viet Nguyen, Manh Hung Nguyen, Hoang Ta, Van Khu Vu, Yeow Meng Chee", "arxiv_url": "https://arxiv.org/abs/2601.12483", "pdf_url": "https://arxiv.org/pdf/2601.12483", "summary": "QuantumSMoE uses plus-shaped embeddings, adaptive masking, and MoE layers to exploit toric code geometry for superior decoding. Outperforms ML and classical baselines in logical error rate under depolarizing noise.", "motivation": "Decoding bottlenecks real-time QEC for topological codes; ML decoders promise speed but often ignore lattice structure. Combines vision transformers and MoE for scalable, geometry-aware performance.", "highlights": [ "Beats SOTA ML decoders", "Toric code geometry bias", "MoE scalability boost" ], "keywords": [ { "label": "QuantumSMoE", "reason": "proposed MoE Vision Transformer" }, { "label": "Toric Code", "reason": "benchmark topological code" }, { "label": "Plus Embeddings", "reason": "lattice-aware feature" }, { "label": "Mixture of Experts", "reason": "scalability technique" } ], "emoji": "📚", "social_summary": "MoE Vision Transformer decodes surface codes with top fidelity.", "highlights_oneliner": "MoE Toric Decoder" }, { "arxiv_id": "2601.12409", "title": "Topological quantum color code model on infinite lattice", "authors": "Shiyu Cao, Zhian Jia, Sheng Tan", "arxiv_url": "https://arxiv.org/abs/2601.12409", "pdf_url": "https://arxiv.org/pdf/2601.12409", "summary": "Analyzes infinite-lattice color code in quasi-local $C^*$-algebra via DHR, classifying irreducible anyon sectors with string operators and fusion/braiding. Topological order is $\\mathsf{Rep}(D(\\mathbb{Z}_2 \\times \\mathbb{Z}_2))$, matching toric code bilayer.", "motivation": "Color codes enable transversal Cliffords but excitations need thermodynamic-limit analysis for phase understanding. Provides rigorous anyon theory on infinite lattices, bridging finite models to continuum.", "highlights": [ "Infinite lattice anyons", "String operator construction", "Bilayer toric equivalence" ], "keywords": [ { "label": "Color Code", "reason": "CSS topological model studied" }, { "label": "DHR Analysis", "reason": "quasi-local framework used" }, { "label": "Anyon Superselection", "reason": "sector classification" }, { "label": "$\\mathbb{Z}_2 \\times \\mathbb{Z}_2$", "reason": "topological order type" } ], "emoji": "🧭", "social_summary": "Classifies anyons in infinite color code as toric bilayer.", "highlights_oneliner": "Infinite Color Anyons" } ] }, "2026-01-20": { "status": "no_arxiv" }, "2026-01-19": { "word_cloud": [ { "word": "stabilizer", "weight": 5 }, { "word": "universal", "weight": 4 }, { "word": "ancilla", "weight": 3 }, { "word": "biased", "weight": 5 }, { "word": "concatenation", "weight": 4 }, { "word": "overhead", "weight": 4 }, { "word": "fluxonium", "weight": 5 }, { "word": "erasure", "weight": 5 }, { "word": "relaxation", "weight": 3 }, { "word": "convergence", "weight": 4 }, { "word": "output", "weight": 3 }, { "word": "distribution", "weight": 3 }, { "word": "threshold", "weight": 4 }, { "word": "Clifford", "weight": 3 }, { "word": "T-gate", "weight": 4 }, { "word": "heterogeneous", "weight": 3 }, { "word": "repetition", "weight": 3 }, { "word": "lifetime", "weight": 4 } ], "social_highlights": "Highlights: generic universal gates for any stabilizer code, 50% qubit overhead cut under biased noise, fluxonium turns relaxation to erasures, good quantum codes converge to optimal outputs.", "papers": [ { "arxiv_id": "2601.10964", "title": "Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation", "authors": "Nicholas J. C. Papadopoulos, Ramin Ayanzadeh", "arxiv_url": "https://arxiv.org/abs/2601.10964", "pdf_url": "https://arxiv.org/pdf/2601.10964", "summary": "Implements logical Clifford and $T$ gates via ancilla-mediated protocols that are deterministic, ancilla-conserving, and generic over all stabilizer codes. Enables universal fault-tolerant computation without code modification or consumption of ancilla registers. Facilitates communication between heterogeneous stabilizer codes using helper codes and mid-circuit measurements.", "motivation": "Traditional methods like code concatenation, switching, and magic state distillation are code-specific, costly, and experimentally demanding, limiting universality. This work circumvents the Eastin-Knill theorem generically, enabling any stabilizer code for universal computation and heterogeneous interactions critical for scalable quantum systems.", "highlights": [ "Stabilizer-generic universal gates", "No ancilla consumption or code changes", "Enables heterogeneous code communication" ], "keywords": [ { "label": "ancilla-mediated protocols", "reason": "Core technique for implementing universal gates without code modification" }, { "label": "Eastin-Knill circumvention", "reason": "Novel approach bypassing theorem limitations generically" }, { "label": "heterogeneous codes", "reason": "Enables communication between different stabilizer codes" }, { "label": "Generalized Shor Code", "reason": "Key helper code required for the framework" } ], "emoji": "🔗", "social_summary": "Unlocks universal quantum computing for ANY stabilizer code using clever ancilla tricks!", "highlights_oneliner": "Generic universal stabilizer gates" }, { "arxiv_id": "2601.10786", "title": "Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise", "authors": "Peter Shanahan, Diego Ruiz", "arxiv_url": "https://arxiv.org/abs/2601.10786", "pdf_url": "https://arxiv.org/pdf/2601.10786", "summary": "Introduces Elevator Codes, a 2D concatenation of repetition phase-flip inner codes and high-rate bit-flip outer codes, outperforming surface and XZZX codes. Achieves over 50% qubit overhead reduction at $p_Z=10^{-3}$, $\\eta=2\\times10^6$ for logical error $10^{-12}$. Exploits biased noise by separating phase-flip and bit-flip correction layers.", "motivation": "Biased-noise qubits promise overhead reduction but existing codes like rectangular surface ($low threshold$) and XZZX ($2\\times$ qubits) underperform. Demonstrates layered coding optimizes strong bias regimes where high-rate outer codes match repetition code efficiency.", "highlights": [ "50%+ qubit overhead reduction", "$\\eta\\ge7\\times10^4$ bias advantage", "Layered phase/bit-flip correction" ], "keywords": [ { "label": "Elevator Codes", "reason": "Novel 2D concatenated code family for biased noise" }, { "label": "biased noise", "reason": "$\\eta\\ge7\\times10^4$ regime optimization" }, { "label": "high-rate outer codes", "reason": "Enables efficient bit-flip correction at logical level" }, { "label": "qubit overhead", "reason": "50% reduction metric vs existing codes" } ], "emoji": "⚡", "social_summary": "Elevator codes slash qubit needs 50% under extreme biased noise!", "highlights_oneliner": "Biased noise overhead crusher" }, { "arxiv_id": "2601.11086", "title": "Converting qubit relaxation into erasures with a single fluxonium", "authors": "Chenlu Liu, Yulong Li, Jiahui Wang, Quan Guan, Lijing Jin, Lu Ma, Ruizi Hu, Tenghui Wang, Xing Zhu, Hai-Feng Yu, Chunqing Deng, Xizheng Ma", "arxiv_url": "https://arxiv.org/abs/2601.11086", "pdf_url": "https://arxiv.org/pdf/2601.11086", "summary": "Realizes erasure conversion in single zero-flux fluxonium using 0-2 subspace encoding with engineered resonator for mid-circuit detection and EOL measurement. Post-selection boosts logical lifetime 4x from $193\\mu$s to $869\\mu$s. Characterizes measurement-induced dephasing with erasure check error $7.2\\times10^{-5}$.", "motivation": "Erasure qubits enable high-fidelity operations but dual-rail schemes increase hardware overhead. Single-fluxonium solution eliminates extra hardware while achieving resource-efficient erasure-based mitigation.", "highlights": [ "4x lifetime boost: $193\\to869\\mu$s", "Single fluxonium erasure conversion", "Erasure check error $7.2\\times10^{-5}$" ], "keywords": [ { "label": "fluxonium", "reason": "Hardware platform enabling single-qubit erasure" }, { "label": "erasure conversion", "reason": "Transforms relaxation into detectable erasures" }, { "label": "zero-flux operation", "reason": "Specific operating point using 0-2 subspace" }, { "label": "logical lifetime", "reason": "4x improvement key performance metric" } ], "emoji": "⏱", "social_summary": "Single fluxonium turns qubit decay into 4x longer life!", "highlights_oneliner": "Single-qubit erasure boost" }, { "arxiv_id": "2601.11498", "title": "Convergence Properties of Good Quantum Codes for Classical Communication", "authors": "Alptug Aytekin, Mohamed Nomeir, Lei Hu, Sennur Ulukus", "arxiv_url": "https://arxiv.org/abs/2601.11498", "pdf_url": "https://arxiv.org/pdf/2601.11498", "summary": "Proves uniqueness of optimal output distribution for quantum codes in classical communication. Extends vanishing error probability convergence results from classical to quantum using similar techniques. Applies non-vanishing error results to block codes via second-order converses and hypercontractivity of quantum depolarizing semigroups.", "motivation": "Classical coding theory shows good codes' output distributions converge to capacity-achieving distributions; quantum analog remained open. Establishes information-theoretic properties of good quantum codes critical for understanding capacity-achieving behavior.", "highlights": [ "Optimal output uniqueness proven", "Vanishing error convergence extended", "Hypercontractivity-based converses" ], "keywords": [ { "label": "output distribution", "reason": "Core object proven unique and convergent" }, { "label": "quantum channel capacity", "reason": "Setting for classical communication via quantum codes" }, { "label": "hypercontractivity", "reason": "Key technique for non-vanishing error results" }, { "label": "second-order converse", "reason": "Method for block code analysis" } ], "emoji": "⇄", "social_summary": "Quantum codes behave like classical: good ones converge to optimal!", "highlights_oneliner": "Quantum code convergence" } ] }, "2026-01-16": { "word_cloud": [ { "word": "qLDPC", "weight": 5 }, { "word": "decoder", "weight": 5 }, { "word": "threshold", "weight": 4 }, { "word": "surface", "weight": 4 }, { "word": "shift", "weight": 3 }, { "word": "erasure", "weight": 4 }, { "word": "heterogeneous", "weight": 3 }, { "word": "fracton", "weight": 3 }, { "word": "shuttling", "weight": 3 }, { "word": "Hamming", "weight": 3 }, { "word": "neural", "weight": 4 }, { "word": "Maxwell", "weight": 3 }, { "word": "dynamic", "weight": 3 }, { "word": "list", "weight": 2 }, { "word": "orthoplex", "weight": 2 }, { "word": "ST", "weight": 3 }, { "word": "fidelity", "weight": 3 }, { "word": "threshold", "weight": 4 } ], "social_highlights": "Highlights: dynamic shift circuits for qLDPC, Maxwell erasure decoder, zero-error list decoding, parallel neural decoding, heterogeneous architectures, fracton excitations, noise-resilient evolution, ST qubit shuttling, minimal Hamming FTMS.", "papers": [ { "arxiv_id": "2601.09911", "title": "Time-Dynamic Circuits for Fault-Tolerant Shift Automorphisms in Quantum LDPC Codes", "authors": "Younghun Kim, Spiro Gicev, Martin Sevior, Muhammad Usman", "arxiv_url": "https://arxiv.org/abs/2601.09911", "pdf_url": "https://arxiv.org/pdf/2601.09911", "summary": "Introduces time-dynamic syndrome measurement circuits to implement shift automorphisms in qLDPC codes without reducing circuit distance. Benchmarks on weight-6 generalized toric codes show over an order of magnitude reduction in logical error rates compared to SWAP-based schemes at $p=10^{-3}$. Enables practical fault-tolerant gates and alternative designs like leakage removal.", "motivation": "qLDPC codes promise low-overhead logical memories but lack efficient universal gates due to high-error SWAP-based shifts. This work addresses the gap by improving error resilience and time overhead for shift automorphisms, advancing qLDPC beyond surface codes.", "highlights": [ "Dynamic circuits match idle error rates", "$>$1 order magnitude error reduction", "BP-OSD decoding on Gross code" ], "keywords": [ { "label": "shift automorphisms", "reason": "Core technique for universal gates in qLDPC" } ], "emoji": "🔄", "social_summary": "Dynamic circuits slash shift automorphism errors in qLDPC codes by orders of magnitude.", "highlights_oneliner": "Dynamic qLDPC shift circuits" }, { "arxiv_id": "2601.10713", "title": "Quantum Maxwell Erasure Decoder for qLDPC codes", "authors": "Bruno Costa Alves Freire, François-Marie Le Régent, Anthony Leverrier", "arxiv_url": "https://arxiv.org/abs/2601.10713", "pdf_url": "https://arxiv.org/pdf/2601.10713", "summary": "Presents quantum Maxwell erasure decoder extending peeling with symbolic bounded guessing for CSS qLDPC codes. Provides tunable complexity-performance tradeoff, with constant budget yielding linear-time near-ML decoding. Theoretical guarantees and strong finite-length performance on bicycle/Tanner codes.", "motivation": "qLDPC requires fast decoders for fault tolerance; erasure channel tests inform practical designs amid short cycles and degeneracy challenges. Bridges peeling limitations via guessing, matching ML with low overhead.", "highlights": [ "Symbolic guessing tracks ML", "Linear time for constant $G_{\\max}$", "Matches ML failure exponent" ], "keywords": [ { "label": "Maxwell decoder", "reason": "Novel quantum erasure decoding algorithm" }, { "label": "symbolic guessing", "reason": "Key innovation for complexity tradeoff" }, { "label": "bicycle codes", "reason": "Benchmarked code family" }, { "label": "stopping sets", "reason": "Quantum-specific challenge addressed" } ], "emoji": "🧹", "social_summary": "Quantum Maxwell decoder achieves near-ML erasure decoding for qLDPC with linear time.", "highlights_oneliner": "Maxwell qLDPC erasure decoder" }, { "arxiv_id": "2601.09786", "title": "Zero-Error List Decoding for Classical-Quantum Channels", "authors": "Marco Dalai, Filippo Girardi, Ludovico Lami", "arxiv_url": "https://arxiv.org/abs/2601.09786", "pdf_url": "https://arxiv.org/pdf/2601.09786", "summary": "Derives achievability and converse bounds for zero-error list decoding capacity of pure-state CQ channels. Bounds coincide when pairwise overlaps form PSD matrix. Highlights non-achievability of sphere-packing divergence rate in quantum list codes.", "motivation": "Zero-error list decoding extends classical results to quantum, unstudied for CQ channels despite connections to TCS. Matters for reliable communication without error probability.", "highlights": [ "List-size 2 achievability", "PSD matrix tight bounds", "Quantum sphere-packing peculiarity" ], "keywords": [ { "label": "zero-error list decoding", "reason": "Main capacity setting" }, { "label": "pure-state CQ channels", "reason": "Channel class studied" }, { "label": "sphere-packing bound", "reason": "Key non-achievability result" } ], "emoji": "📜", "social_summary": "Tight bounds on zero-error list decoding for classical-quantum channels.", "highlights_oneliner": "Zero-error CQ list decoding" }, { "arxiv_id": "2601.09921", "title": "Learning to Decode in Parallel: Self-Coordinating Neural Network for Real-Time Quantum Error Correction", "authors": "Kai Zhang, Zhengzhong Yi, Shaojun Guo, Linghang Kong, Situ Wang, Xiaoyu Zhan, Tan He, Weiping Lin, Tao Jiang, Dongxin Gao, Yiming Zhang, Fangming Liu, Fang Zhang, Zhengfeng Ji, Fusheng Chen, Jianxin Chen", "arxiv_url": "https://arxiv.org/abs/2601.09921", "pdf_url": "https://arxiv.org/pdf/2601.09921", "summary": "Trains recurrent transformer for parallel window decoding of surface codes, self-coordinating across windows for real-time throughput. Achieves SOTA accuracy on Zuchongzhi 3.2 up to $d=7$; single TPU decodes $d=25$ in 1$\\mu$s/round.", "motivation": "Neural decoders like AlphaQubit excel in accuracy but lack parallelism for real-time FTQC on streaming syndromes. Enables scalable integration with superconducting hardware.", "highlights": [ "1$\\mu$s$ decoding on TPU", "Self-coordination across windows", "SOTA on $d=7$ hardware" ], "keywords": [ { "label": "parallel window decoding", "reason": "Core real-time technique" }, { "label": "recurrent transformer", "reason": "NN architecture innovation" }, { "label": "surface codes", "reason": "Targeted code family" } ], "emoji": "🧠", "social_summary": "Self-coordinating neural net enables real-time parallel QEC decoding.", "highlights_oneliner": "Parallel neural QEC decoder" }, { "arxiv_id": "2601.10144", "title": "Bridging Superconducting and Neutral-Atom Platforms for Efficient Fault-Tolerant Quantum Architectures", "authors": "Xiang Fang, Jixuan Ruan, Sharanya Prabhu, Ang Li, Travis Humble, Dean Tullsen, Yufei Ding", "arxiv_url": "https://arxiv.org/abs/2601.10144", "pdf_url": "https://arxiv.org/pdf/2601.10144", "summary": "Proposes HQA with SC-NA role assignments: MagicAcc offloads MSF to SC, NA for compute; MCSep uses NA qLDPC memory, SC surface compute. Achieves $752\\times$ speedup, $10\\times$ qubit reduction vs. homogeneous.", "motivation": "No single modality excels in speed/connectivity/scalability; interconnects enable HQA like classical specialization. Optimizes FTQC space-time via principled heterogeneity.", "highlights": [ "$752\\times$ NA speedup", "10$\\times$ qubit reduction", "MagicAcc/MCSep strategies" ], "keywords": [ { "label": "heterogeneous QA", "reason": "Architectural paradigm" }, { "label": "MagicAcc", "reason": "SC MSF + NA compute" }, { "label": "MCSep", "reason": "NA qLDPC + SC surface" } ], "emoji": "🔌", "social_summary": "Heterogeneous SC-NA architectures yield 752x speedup for FTQC.", "highlights_oneliner": "SC-NA heterogeneous FTQC" }, { "arxiv_id": "2601.09850", "title": "Fragmented Topological Excitations in Generalized Hypergraph Product Codes", "authors": "Meng-Yuan Li, Yue Wu", "arxiv_url": "https://arxiv.org/abs/2601.09850", "pdf_url": "https://arxiv.org/pdf/2601.09850", "summary": "Studies fracton orders in generalized HGP codes as orthoplex spin models. 3D: non-monotonic GSD, non-Abelian defects; 4D: fragmented excitations appearing point-like but projecting to loops.", "motivation": "Stabilizer codes map to solvable models revealing many-body orders; generalized HGP extends HGP for rich fracton physics. Bridges QEC and topological matter.", "highlights": [ "Fragmented 4D excitations", "Non-monotonic 3D GSD", "Non-Abelian defects" ], "keywords": [ { "label": "fragmented excitations", "reason": "Novel 4D topological feature" }, { "label": "orthoplex models", "reason": "Spin model for gen. HGP" }, { "label": "fracton orders", "reason": "Targeted many-body phase" } ], "emoji": "🧩", "social_summary": "Discovers fragmented topological excitations in 4D generalized HGP codes.", "highlights_oneliner": "Fragmented fracton excitations" }, { "arxiv_id": "2601.10206", "title": "Noise-Resilient Quantum Evolution in Open Systems through Error-Correcting Frameworks", "authors": "Nirupam Basak, Goutam Paul, Pritam Chattopadhyay", "arxiv_url": "https://arxiv.org/abs/2601.10206", "pdf_url": "https://arxiv.org/pdf/2601.10206", "summary": "Benchmarks 5-qubit/Steane/toric codes in microscopic system-bath models via 2nd-order master eq. 5-qubit excels at low T; critical time for Werner states where QEC improves fidelity.", "motivation": "NISQ to FTQC needs realistic open-system QEC beyond channels. Guides architectures via quantitative fidelity under thermal noise.", "highlights": [ "5-qubit best low-T fidelity", "Critical time for entanglement", "Open-system master eq." ], "keywords": [ { "label": "microscopic baths", "reason": "Realistic noise modeling" }, { "label": "five-qubit code", "reason": "Top performer" }, { "label": "Werner states", "reason": "Entanglement benchmark" } ], "emoji": "🌡️", "social_summary": "5-qubit code shines in open quantum systems under thermal noise.", "highlights_oneliner": "Open-system QEC benchmarks" }, { "arxiv_id": "2601.10461", "title": "Erasure conversion for singlet-triplet spin qubits enables high-performance shuttling-based quantum error correction", "authors": "Adam Siegel, Simon Benjamin", "arxiv_url": "https://arxiv.org/abs/2601.10461", "pdf_url": "https://arxiv.org/pdf/2601.10461", "summary": "Fault-tolerant framework for ST qubits as erasure qubits with leakage-detection projecting back to subspace. With XZZX surface code, doubles threshold, orders-of-magnitude logical error reduction.", "motivation": "Shuttling enables scalable semiconductor QEC; ST qubits optimize fidelity but need leakage handling. Enables erasure-based FTQC.", "highlights": [ "2x threshold increase", "Erasure qubit shuttling", "Leakage auto-projection" ], "keywords": [ { "label": "singlet-triplet qubits", "reason": "Optimal shuttling encoding" }, { "label": "erasure conversion", "reason": "Leakage-detection protocol" }, { "label": "XZZX surface", "reason": "Noise-biased code" } ], "emoji": "🚀", "social_summary": "ST spin qubits double QEC threshold via erasure conversion.", "highlights_oneliner": "ST erasure shuttling QEC" }, { "arxiv_id": "2601.10042", "title": "Towards Minimal Fault-tolerant Error-Correction Sequence with Quantum Hamming Codes", "authors": "Sha Shi, Xiao-Yang Xu, Min-Quan Cheng, Dong-Sheng Wang, Yun-Jiang Wang", "arxiv_url": "https://arxiv.org/abs/2601.10042", "pdf_url": "https://arxiv.org/pdf/2601.10042", "summary": "Constructs FTMS for $[[2^r-1,2^r-1-2r,3]]$ Hamming codes with $r=3k+1$, length exactly $2r+1$ (tight bound). Cyclic transformations enable circuit reuse via boundary Hadamard toggles.", "motivation": "High FTMS overhead challenges stabilizer QEC; minimal sequences cut time/hardware for Hamming codes. Advances open minimal FTMS problem.", "highlights": [ "$2r+1$ minimal length", "Circuit multiplexing symmetry", "Distance-3 Hamming" ], "keywords": [ { "label": "quantum Hamming", "reason": "Targeted code class" }, { "label": "FTMS minimal", "reason": "Tight sequence length" }, { "label": "cyclic symmetry", "reason": "Circuit reuse technique" } ], "emoji": "🔢", "social_summary": "Minimal FTMS for quantum Hamming codes cuts overhead sharply.", "highlights_oneliner": "Minimal Hamming FTMS" } ] }, "2026-01-15": { "word_cloud": [ { "word": "bidirectional decoding", "weight": 5 }, { "word": "concatenated codes", "weight": 5 }, { "word": "quantum Hamming codes", "weight": 5 }, { "word": "syndrome information", "weight": 4 }, { "word": "threshold improvement", "weight": 4 }, { "word": "code distance scaling", "weight": 4 }, { "word": "hard-decision decoder", "weight": 4 }, { "word": "logical error suppression", "weight": 4 }, { "word": "bit-flip noise", "weight": 3 }, { "word": "fault-tolerant computation", "weight": 3 }, { "word": "local decoding", "weight": 3 }, { "word": "polynomial complexity", "weight": 3 }, { "word": "greedy reassignment", "weight": 3 }, { "word": "high-rate codes", "weight": 3 }, { "word": "error correction capability", "weight": 2 }, { "word": "spatial overhead", "weight": 2 }, { "word": "recovery decisions", "weight": 2 } ], "social_highlights": "Highlights: Bidirectional decoder for concatenated quantum Hamming codes improves error threshold from 1.56% to 4.35% while preserving full code-distance scaling.", "papers": [ { "arxiv_id": "2601.09131", "title": "Bidirectional Decoding for Concatenated Quantum Hamming Codes", "authors": "Chao Zhang, Zipeng Wu, Jiahui Wu, Shilin Huang", "arxiv_url": "https://arxiv.org/abs/2601.09131", "pdf_url": "https://arxiv.org/pdf/2601.09131", "summary": "This work introduces a polynomial-time hard-decision decoder for concatenated quantum Hamming codes that leverages higher-level syndrome information to revise lower-level recovery decisions through bidirectional information flow. For the $[[15,7,3]]$ code under bit-flip noise, the decoder achieves a threshold of $4.35\\%$ compared to $1.56\\%$ for standard local decoding. The decoder empirically preserves the full $3^L$ code-distance scaling across three concatenation levels, enabling substantially faster logical-error suppression than the $2^{L+1}$ scaling of local decoders.", "motivation": "Concatenated quantum codes have historically been central to establishing fault-tolerance thresholds and offer a promising pathway toward practical fault-tolerant quantum computation with reduced spatial overhead compared to surface codes. Recent advances in programmable nonlocal connectivity and high-rate concatenated architectures have renewed interest in these codes, yet designing efficient decoders that fully exploit their error-correction capability remains a critical challenge.", "highlights": [ "Threshold improved from $1.56\\%$ to $4.35\\%$ for $[[15,7,3]]$ code under bit-flip noise", "Preserves full $3^L$ code-distance scaling for three concatenation levels versus $2^{L+1}$ for local decoders", "Polynomial-time complexity via greedy reassignment strategy avoiding brute-force enumeration" ], "keywords": [ { "label": "Bidirectional decoding", "reason": "Core algorithmic innovation enabling information flow from higher to lower concatenation levels to revise recovery decisions" }, { "label": "Concatenated quantum Hamming codes", "reason": "Primary code family studied, specifically $[[15,7,3]]$ codes with distance-3 properties enabling high-rate fault-tolerant computation" }, { "label": "Syndrome-based error correction", "reason": "Fundamental technique leveraging higher-level syndrome information to improve decoding performance beyond local hard-decision methods" }, { "label": "Fault-tolerance threshold", "reason": "Key performance metric demonstrating practical viability for scalable quantum computation with improved error suppression rates" } ], "emoji": "🔄", "social_summary": "Introduce bidirectional decoder for quantum Hamming codes achieving 4.35% error threshold and preserving full code-distance scaling for fault-tolerant quantum computation.", "highlights_oneliner": "Bidirectional decoding boosts quantum Hamming code threshold" } ] }, "2026-01-14": { "word_cloud": [ { "word": "LDPC", "weight": 5 }, { "word": "CSS", "weight": 5 }, { "word": "girth", "weight": 4 }, { "word": "orthogonality", "weight": 4 }, { "word": "Clifford", "weight": 4 }, { "word": "transversal", "weight": 4 }, { "word": "Bell", "weight": 3 }, { "word": "dyadic", "weight": 3 }, { "word": "CAMEL", "weight": 3 }, { "word": "Quantum Lego", "weight": 3 }, { "word": "syndrome", "weight": 4 }, { "word": "Floquet", "weight": 3 }, { "word": "bosonic", "weight": 3 }, { "word": "symmetry", "weight": 3 }, { "word": "projector", "weight": 3 }, { "word": "threshold", "weight": 4 }, { "word": "decoding", "weight": 5 }, { "word": "stabilizer", "weight": 4 } ], "social_highlights": "Highlights: girth-8 QLDPC, transversal Clifford CSS, optimal Bell measurements, dyadic QLDPC, hybrid QML codes, fault-tolerant Hamming, Floquet bosonic, symmetry projectors.", "papers": [ { "arxiv_id": "2601.08824", "title": "Breaking the Orthogonality Barrier in Quantum LDPC Codes", "authors": "Kenta Kasai", "arxiv_url": "https://arxiv.org/abs/2601.08824", "pdf_url": "https://arxiv.org/pdf/2601.08824", "summary": "Overcomes orthogonality constraints in quantum LDPC codes using permutation matrices with controlled commutativity, enabling large girth while preserving regular structures. Constructs a girth-8, $(3,12)$-regular $[[9216,4612,\\leq 48]]$ code achieving $10^{-8}$ frame error rate under BP decoding on depolarizing channel.", "motivation": "Classical LDPC codes excel with high girth and regularity for good performance, but quantum versions face orthogonality constraints reducing girth and bounding distance. This work enables application of classical design principles to quantum setting for scalable QEC.", "highlights": [ "Girth-8 $[[9216,4612,\\leq48]]$ QLDPC", "Breaks orthogonality barrier", "BP FER $10^{-8}$ at 4% errors" ], "keywords": [ { "label": "permutation matrices", "reason": "Key innovation for controlled commutativity bypassing orthogonality" } ], "emoji": "🔓", "social_summary": "Breaks orthogonality barrier to build high-girth quantum LDPC codes with excellent decoding performance.", "highlights_oneliner": "Girth-8 Quantum LDPC" }, { "arxiv_id": "2601.08568", "title": "Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly", "authors": "K. Sai Mineesh Reddy, Navin Kashyap", "arxiv_url": "https://arxiv.org/abs/2601.08568", "pdf_url": "https://arxiv.org/pdf/2601.08568", "summary": "Introduces framework for CSS codes supporting fault-tolerant transversal $Z$-rotations, yielding asymptotically good codes realizing logical transversal Clifford group. Analyzes CSS-$T$ codes, showing necessity of $C_2 \\ast C_1 \\subseteq C_1^\\perp$ and revising characterizations.", "motivation": "Eastin-Knill theorem limits universal transversal gates, but Clifford group enables efficient simulation; fault-tolerant transversal Cliffords aid magic state distillation for universality. Provides good families beyond surface codes.", "highlights": [ "Asymp good transversal Clifford CSS", "CSS-T with logical $S^\\dagger$", "Revised CSS-T conditions" ], "keywords": [ { "label": "transversal Clifford", "reason": "Core achievement for fault-tolerant gates" }, { "label": "CSS-T codes", "reason": "Analyzed for $T$ gate logic" }, { "label": "magic state distillation", "reason": "Enabled by Clifford support" } ], "emoji": "🔄", "social_summary": "Constructs good CSS codes for fault-tolerant transversal Clifford gates.", "highlights_oneliner": "Transversal Clifford CSS" }, { "arxiv_id": "2601.08820", "title": "Optimal logical Bell measurements on stabilizer codes with linear optics", "authors": "Simon D. Reiß, Peter van Loock", "arxiv_url": "https://arxiv.org/abs/2601.08820", "pdf_url": "https://arxiv.org/pdf/2601.08820", "summary": "Maps any logical Bell measurement on stabilizer codes to a single physical BM on qubit pairs, providing upper bound on success probability. Formulates criteria for full logical info from one successful BM; attains bound for parity, 5-qubit, surface, tree, Steane codes.", "motivation": "Bell measurements essential for quantum communication, computation, error correction; photonic implementations limited by linear optics even without loss. Optimizes readout of stabilizer syndromes for loss-tolerant fusion.", "highlights": [ "Single physical BM for logical", "Upper bound on success prob", "Optimal for multiple codes" ], "keywords": [ { "label": "linear optics", "reason": "Hardware constraint addressed" }, { "label": "stabilizer group theory", "reason": "Basis for mapping approach" }, { "label": "syndrome readout", "reason": "Enhanced for photonics" } ], "emoji": "🔔", "social_summary": "Optimizes logical Bell measurements for stabilizer codes using linear optics.", "highlights_oneliner": "Optimal photonic Bell meas." }, { "arxiv_id": "2601.08636", "title": "Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding", "authors": "Alessio Baldelli, Massimo Battaglioni, Jonathan Mandelbaum, Sisi Miao, Laurent Schmalen", "arxiv_url": "https://arxiv.org/abs/2601.08636", "pdf_url": "https://arxiv.org/pdf/2601.08636", "summary": "Algebraic dyadic matrix construction yields girth-6 classical LDPC, extended to CSS QLDPC satisfying CAMEL-ensemble compatibility. Mitigates 4-cycles by decimating assembled variable nodes, offering flexibility in length and rate.", "motivation": "QLDPC promising for scalable QEC but orthogonality hinders classical LDPC principles like high girth. CAMEL decoder requires compatible matrices to handle short cycles effectively.", "highlights": [ "Girth-6 quasi-dyadic CSS QLDPC", "CAMEL-ensemble compatible", "Error-floor mitigation" ], "keywords": [ { "label": "dyadic matrices", "reason": "Algebraic construction basis" }, { "label": "CAMEL decoder", "reason": "Targets quaternary BP" }, { "label": "cycle assembling", "reason": "Mitigates 4-cycles" } ], "emoji": "📊", "social_summary": "Dyadic matrices enable compatible CSS QLDPC for advanced BP decoding.", "highlights_oneliner": "Dyadic CSS QLDPC" }, { "arxiv_id": "2601.08014", "title": "Learning Better Error Correction Codes with Hybrid Quantum-Assisted Machine Learning", "authors": "Yariv Yanay", "arxiv_url": "https://arxiv.org/abs/2601.08014", "pdf_url": "https://arxiv.org/pdf/2601.08014", "summary": "Hybrid classical-quantum RL using Quantum Lego generates stabilizer codes optimized for device-specific errors including photon loss. Demonstrates on Quantinuum and IBM hardware with renormalized rewards for above-threshold noise.", "motivation": "Surface code dominant but suboptimal scaling; Quantum Lego systematizes code construction, RL automates search, quantum evaluation enables device-tailored codes. Hybrid approach leverages real hardware feedback.", "highlights": [ "Hybrid quantum RL for QECC", "Quantum Lego + device testing", "Biased noise optimization" ], "keywords": [ { "label": "Quantum Lego", "reason": "Framework for code building" }, { "label": "hybrid RL", "reason": "Classical-quantum algorithm" }, { "label": "device-specific noise", "reason": "Tailors to hardware errors" } ], "emoji": "🤖", "social_summary": "Hybrid quantum ML learns better error codes for real devices.", "highlights_oneliner": "Quantum-assisted code learning" }, { "arxiv_id": "2601.07860", "title": "Fault-Tolerant Quantum Error Correction: Implementing Hamming-Based Codes with Advanced Syndrome Extraction Techniques", "authors": "Soham Bhadra, Diyansha Singh, Angana Chowdhury", "arxiv_url": "https://arxiv.org/abs/2601.07860", "pdf_url": "https://arxiv.org/pdf/2601.07860", "summary": "Implements Shor cat-state, Steane encoded-ancilla, unified syndrome extraction for Steane $[[7,1,3]]$ code. Achieves $5.1\\times10^{-5}$ logical error at $p_{\\text{phys}}=10^{-3}$, 2.4$\\times$ suppression via Qiskit sims.", "motivation": "Ancilla errors propagate in syndrome measurement, threatening QEC; advanced techniques like cat-states, encoded ancillas mitigate for near-term hardware. Benchmarks for Hamming codes guide scaling.", "highlights": [ "2.4$\\times$ error suppression", "$5.1\\times10^{-5}$ logical error", "Threshold $p\\approx1\\%$" ], "keywords": [ { "label": "syndrome extraction", "reason": "Core techniques compared" }, { "label": "Steane code", "reason": "Testbed $[[7,1,3]]$" }, { "label": "ancilla management", "reason": "Addresses error propagation" } ], "emoji": "🐱", "social_summary": "Advanced syndrome methods boost Steane code performance 2.4x.", "highlights_oneliner": "Fault-tolerant syndrome" }, { "arxiv_id": "2601.08782", "title": "Single-Period Floquet Control of Bosonic Codes with Quantum Lattice Gates", "authors": "Tangyou Huang, Lei Du, Lingzhen Guo", "arxiv_url": "https://arxiv.org/abs/2601.08782", "pdf_url": "https://arxiv.org/pdf/2601.08782", "summary": "Single-period Floquet method synthesizes arbitrary unitaries with Haar-random statistics for bosonic codes. Prepares codes from vacuum, implements logical gates using quantum lattice gates leveraging Josephson nonlinearity.", "motivation": "Bosonic codes promising for fault-tolerance; prior Floquet needs slow adiabatic ramps over thousands periods. Single-period enables practical continuous-variable QC.", "highlights": [ "Single-period Floquet", "Haar-random unitaries", "Quantum lattice gates" ], "keywords": [ { "label": "Floquet control", "reason": "Single-period synthesis" }, { "label": "bosonic codes", "reason": "Target encoding" }, { "label": "lattice gates", "reason": "Efficient primitives" } ], "emoji": "🔄", "social_summary": "Single-period Floquet drives bosonic codes efficiently.", "highlights_oneliner": "Floquet bosonic control" }, { "arxiv_id": "2601.08533", "title": "Symmetry-Adapted State Preparation for Quantum Chemistry on Fault-Tolerant Quantum Computers", "authors": "Viktor Khinevich, Wataru Mizukami", "arxiv_url": "https://arxiv.org/abs/2601.08533", "pdf_url": "https://arxiv.org/pdf/2601.08533", "summary": "LCU/GQSP projectors for $U(1)$ particle number, $SU(2)$ spin symmetries as QPE filters. Reduces T-gates $10^6$--$10^7$ for FeMoco vs $10^{10}$ QPE; boosts success probability.", "motivation": "QPE for quantum chemistry needs symmetry projectors for efficiency; fault-tolerant implementations resource-heavy for large correlated systems like FeMoco. Low-ancilla GQSP scalable.", "highlights": [ "GQSP symmetry projectors", "3-4 orders cost reduction", "FeMoco $10^7$ T-gates" ], "keywords": [ { "label": "GQSP", "reason": "Low-ancilla projector method" }, { "label": "symmetry projectors", "reason": "$U(1)$, $SU(2)$ filters" }, { "label": "quantum chemistry", "reason": "FeMoco application" } ], "emoji": "⚗️", "social_summary": "Symmetry projectors slash quantum chemistry simulation costs.", "highlights_oneliner": "Symmetry QPE prep" } ] }, "2026-01-13": { "word_cloud": [ { "word": "non-Abelian", "weight": 5 }, { "word": "qLDPC", "weight": 5 }, { "word": "TQFT", "weight": 4 }, { "word": "gauging", "weight": 4 }, { "word": "magic", "weight": 4 }, { "word": "QML", "weight": 5 }, { "word": "QED", "weight": 4 }, { "word": "partial", "weight": 3 }, { "word": "resource", "weight": 3 }, { "word": "noise", "weight": 3 }, { "word": "connectivity", "weight": 3 }, { "word": "universality", "weight": 3 }, { "word": "path", "weight": 2 }, { "word": "integral", "weight": 2 }, { "word": "symmetries", "weight": 2 }, { "word": "fountain", "weight": 3 }, { "word": "detection", "weight": 3 }, { "word": "mitigation", "weight": 2 }, { "word": "constraints", "weight": 2 } ], "social_highlights": "Highlights: non-Abelian qLDPC enables 2D magic states, QEC strategies boost QML under constraints.", "papers": [ { "arxiv_id": "2601.06736", "title": "Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes", "authors": "Guanyu Zhu, Ryohei Kobayashi, Po-Shen Hsin", "arxiv_url": "https://arxiv.org/abs/2601.06736", "pdf_url": "https://arxiv.org/pdf/2601.06736", "summary": "This paper extends Kitaev's non-Abelian topological codes to non-Abelian qLDPC codes using TQFT on CW complexes and constructs spacetime path integrals as topological invariants. It demonstrates native non-Clifford logical gates via addressable gauging measurements on constant-rate 2D hypergraph-product codes. The approach enables parallel preparation of $O(\\sqrt{n})$ disjoint CZ magic states with $O(\\sqrt{n})$ code distance using $n$ qubits.", "motivation": "Historically, qLDPC codes faced tradeoffs between connectivity and universality, often requiring 3D constructions for non-Clifford gates. This work matters as it achieves native non-Clifford operations in 2D, advancing scalable fault-tolerant quantum computing.", "highlights": [ "2D non-Abelian qLDPC with non-Clifford gates", "Addressable gauging via spacetime path integrals", "Magic state fountain with $O(\\sqrt{n})$ states" ], "keywords": [ { "label": "non-Abelian qLDPC", "reason": "Core code family extending topological codes to LDPC regime" }, { "label": "TQFT formalism", "reason": "Theoretical framework using CW complexes for non-Abelian codes" }, { "label": "addressable gauging", "reason": "Measurement technique enabling transversal Clifford gates" }, { "label": "magic state fountain", "reason": "Application for parallel $O(\\sqrt{n})$ CZ states preparation" } ], "emoji": "🧭", "social_summary": "Unlocks non-Clifford gates on 2D qLDPC codes via TQFT gauging for magic states.", "highlights_oneliner": "2D Non-Abelian qLDPC Magic" }, { "arxiv_id": "2601.07223", "title": "Quantum Error Correction and Detection for Quantum Machine Learning", "authors": "Eromanga Adermann, Haiyue Kang, Martin Sevior, Muhammad Usman", "arxiv_url": "https://arxiv.org/abs/2601.07223", "pdf_url": "https://arxiv.org/pdf/2601.07223", "summary": "The paper quantifies resource demands of fully error-corrected QML and proposes partial QEC to reduce overhead while enabling correction. It demonstrates a simple QED method, evaluating its impact on QML performance under realistic constraints. Challenges to fully fault-tolerant QML are highlighted.", "motivation": "Quantum machine learning promises AI breakthroughs but is hindered by noisy quantum hardware requiring massive qubits for full QEC. This matters for near-term viable QML by integrating lightweight QEC/QED strategies.", "highlights": [ "Partial QEC reduces QML overhead", "QED boosts QML performance", "Quantifies full QEC resource needs" ], "keywords": [ { "label": "quantum machine learning", "reason": "Primary application domain integrating QEC" }, { "label": "partial QEC", "reason": "Technique reducing overhead for realistic use" }, { "label": "quantum error detection", "reason": "Simple method evaluated for QML impact" }, { "label": "resource constraints", "reason": "Key challenge addressed in noisy hardware" } ], "emoji": "📚", "social_summary": "Integrates partial QEC and QED to make quantum machine learning viable now.", "highlights_oneliner": "QEC for Noisy QML" } ] }, "2026-01-12": { "word_cloud": [ { "word": "Heisenberg", "weight": 5 }, { "word": "metrology", "weight": 5 }, { "word": "repetition", "weight": 4 }, { "word": "threshold", "weight": 4 }, { "word": "photon", "weight": 5 }, { "word": "distillation", "weight": 5 }, { "word": "indistinguishability", "weight": 4 }, { "word": "bosonic", "weight": 3 }, { "word": "block-encoding", "weight": 4 }, { "word": "Pauli", "weight": 4 }, { "word": "stabilizer", "weight": 4 }, { "word": "surface", "weight": 4 }, { "word": "GHZ", "weight": 4 }, { "word": "emission", "weight": 4 }, { "word": "modular", "weight": 3 }, { "word": "fault-tolerant", "weight": 3 }, { "word": "QSVT", "weight": 3 }, { "word": "interference", "weight": 3 } ], "social_highlights": "Highlights: fault-tolerant Heisenberg limit metrology, photon distillation below threshold, stabilizer block encodings, emission-based surface code thresholds.", "papers": [ { "arxiv_id": "2601.05457", "title": "Achieving the Heisenberg limit using fault-tolerant quantum error correction", "authors": "Himanshu Sahu, Qian Xu, Sisi Zhou", "arxiv_url": "https://arxiv.org/abs/2601.05457", "pdf_url": "https://arxiv.org/pdf/2601.05457", "summary": "Proposes a fault-tolerant metrological protocol using repetition code prepared via repeated syndrome measurements and fault-tolerant logical measurement for estimating Pauli-$Z$ signal under bit-flip noise with state preparation and measurement errors. Demonstrates an error threshold below which errors are suppressed and Heisenberg limit ($n^{-1}$) is attained despite noise in all QEC operations.", "motivation": "Previous QEC metrology protocols assumed noiseless state preparation and measurement, limiting practicality. This work bridges theory and experiment by enabling Heisenberg limit recovery with fully noisy fault-tolerant QEC.", "highlights": [ "Fault-tolerant repetition code metrology", "Error threshold for Heisenberg limit", "Logarithmic overhead in circuit depth" ], "keywords": [ { "label": "Heisenberg limit", "reason": "Core precision scaling target $n^{-1}$ achieved fault-tolerantly" }, { "label": "repetition code", "reason": "Optimal code for Pauli-$Z$ estimation under bit-flip noise" }, { "label": "fault-tolerant metrology", "reason": "Protocol with noise in all operations including preparation" }, { "label": "syndrome repetition", "reason": "Preparation method using repeated measurements with logarithmic overhead" } ], "emoji": "⚡", "social_summary": "Achieved Heisenberg limit with fully fault-tolerant quantum error correction under realistic noise!", "highlights_oneliner": "Fault-tolerant Heisenberg metrology" }, { "arxiv_id": "2601.05947", "title": "Below-threshold error reduction in single photons through photon distillation", "authors": "F. H. B. Somhorst, J. Saied, N. Kannan, B. Kassenberg, J. Marshall, M. de Goede, H. J. Snijders, P. Stremoukhov, A. Lukianenko, P. Venderbosch, T. B. Demille, A. Roos, N. Walk, J. Eisert, E. G. Rieffel, D. H. Smith, J. J. Renema", "arxiv_url": "https://arxiv.org/abs/2601.05947", "pdf_url": "https://arxiv.org/pdf/2601.05947", "summary": "Demonstrates scalable photon distillation reducing indistinguishability errors more efficiently than QEC with higher thresholds. Achieves unconditional below-threshold error reduction experimentally, compatible with fault-tolerant photonic quantum computing. Exploits bosonic quantum interference for coherent error mitigation without encoding.", "motivation": "Photonic QEC requires excessive overhead due to low error thresholds; distillation provides resource-efficient alternative. Enables practical large-scale photonic quantum computing by addressing which-way information errors.", "highlights": [ "Below-threshold photon distillation", "Higher efficiency than QEC", "Net-gain error mitigation demonstrated" ], "keywords": [ { "label": "photon distillation", "reason": "Core technique exploiting bosonic interference for error reduction" }, { "label": "indistinguishability errors", "reason": "Primary error source in photonic quantum computing" }, { "label": "below-threshold behavior", "reason": "Unconditional error reduction even with gate noise" }, { "label": "multimode statistics", "reason": "Enhanced interference enabling linear scaling $\\gamma=1$" } ], "emoji": "🔗", "social_summary": "Photon distillation beats QEC thresholds for fault-tolerant photonic computing!", "highlights_oneliner": "Photon distillation below threshold" }, { "arxiv_id": "2601.05740", "title": "Block Encoding Linear Combinations of Pauli Strings Using the Stabilizer Formalism", "authors": "Niclas Schillo, Andreas Sturm, Rüdiger Quay", "arxiv_url": "https://arxiv.org/abs/2601.05740", "pdf_url": "https://arxiv.org/pdf/2601.05740", "summary": "Introduces method transforming Pauli strings to anti-commuting set for direct unitary implementation, corrected via stabilizer formalism with logarithmic ancilla. Achieves circuit complexity comparable or better than LCU, especially when exploiting operator structure. Enables efficient block encodings crucial for QSVT-based quantum algorithms.", "motivation": "Block encoding gate complexity dominates QSVT algorithm costs; LCU inefficient for Pauli strings. Stabilizer-based approach reduces overhead for Hamiltonian simulation and quantum machine learning applications.", "highlights": [ "Logarithmic ancilla block encoding", "Stabilizer correction technique", "Matches/beats LCU complexity" ], "keywords": [ { "label": "block encoding", "reason": "Core QSVT input model for non-unitary operations" }, { "label": "stabilizer formalism", "reason": "Enables efficient Pauli string correction" }, { "label": "anti-commuting transformation", "reason": "Makes linear combination directly unitary" }, { "label": "Pauli strings", "reason": "Target operators for Hamiltonian applications" } ], "emoji": "🧭", "social_summary": "Efficient stabilizer block encodings rival LCU for QSVT algorithms!", "highlights_oneliner": "Stabilizer Pauli block encoding" }, { "arxiv_id": "2601.07241", "title": "Fault-tolerant modular quantum computing with surface codes using single-shot emission-based hardware", "authors": "Siddhant Singh, Rikiya Kashiwagi, Kazufumi Tanji, Wojciech Roga, Daniel Bhatti, Masahiro Takeoka, David Elkouss", "arxiv_url": "https://arxiv.org/abs/2601.07241", "pdf_url": "https://arxiv.org/pdf/2601.07241", "summary": "Develops fully distributed surface code using single-shot GHZ generation via emission-based entanglement, eliminating slow Bell-pair fusions. Achieves $0.19\\%$ thresholds without memory two-qubit gates, rising to $0.24\\%$ with photon-number-resolving detectors. Enables scalable fault-tolerant modular quantum computing with feasible hardware.", "motivation": "Emission-based entanglement distribution feasible but limited by slow fusion gates; scattering-based requires challenging hardware. Single-shot GHZ enables practical surface code thresholds for modular architectures.", "highlights": [ "Single-shot GHZ surface codes", "$0.19\\%$ threshold no memory gates", "$0.24\\%$ with PNR detectors" ], "keywords": [ { "label": "surface code", "reason": "Distributed code for modular quantum computing" }, { "label": "emission-based", "reason": "Hardware platform using single-shot GHZ" }, { "label": "single-shot GHZ", "reason": "Eliminates Bell-pair fusion overhead" }, { "label": "modular threshold", "reason": "$0.19\\%-0.24\\%$ error rates achieved" } ], "emoji": "🧭", "social_summary": "Emission-based surface codes hit $0.19\\%$ thresholds without memory gates!", "highlights_oneliner": "Single-shot emission surface codes" } ] }, "2026-01-09": { "word_cloud": [ { "word": "surface code", "weight": 5 }, { "word": "logical qubits", "weight": 4 }, { "word": "syndrome extraction", "weight": 4 }, { "word": "topological codes", "weight": 4 }, { "word": "Pauli errors", "weight": 4 }, { "word": "circuit depth", "weight": 3 }, { "word": "noise mitigation", "weight": 3 }, { "word": "stabilizer measurement", "weight": 3 }, { "word": "trapped ions", "weight": 3 }, { "word": "belief propagation", "weight": 3 }, { "word": "holographic codes", "weight": 3 }, { "word": "ZX-calculus", "weight": 2 }, { "word": "rare-event sensing", "weight": 2 }, { "word": "error threshold", "weight": 2 }, { "word": "lattice surgery", "weight": 2 }, { "word": "depolarizing noise", "weight": 2 }, { "word": "neutral atoms", "weight": 2 }, { "word": "logical operators", "weight": 2 } ], "social_highlights": "Highlights: distance-preserving unitary encoding for surface codes with $O(d)$ depth, holographic codes analyzed via ZX-calculus with belief propagation decoding, noise tailoring for error mitigation on NISQ devices, rare-event quantum sensing using logical qubits.", "papers": [ { "arxiv_id": "2601.05113", "title": "Unitary fault-tolerant encoding of Pauli states in surface codes", "authors": "Luis Colmenarez, Remmy Zen, Jan Olle, Florian Marquardt, Markus Müller", "arxiv_url": "https://arxiv.org/abs/2601.05113", "pdf_url": "https://arxiv.org/pdf/2601.05113", "summary": "Presents a unitary, scalable, distance-preserving encoding scheme for preparing Pauli eigenstates in surface codes that maintains fault-distance with increasing code distance $d$. The scheme uses only geometrically local gates compatible with 2D qubit connectivity and achieves circuit depth scaling as $O(d)$, generalizing reinforcement-learning strategies from the surface-17 code to arbitrary distances. Numerical simulations show the measurement-free unitary encoding without ancillas outperforms stabilizer-measurement-based schemes by up to an order of magnitude under depolarizing noise.", "motivation": "Logical state preparation is a ubiquitous subroutine in fault-tolerant quantum computation, yet previous unitary approaches failed to preserve code protection during state preparation. This work is particularly relevant for platforms like trapped ions and neutral atoms where measurements are costly and idling noise is weak compared to gate noise.", "highlights": [ "Distance-preserving unitary encoding with $O(d)$ circuit depth", "Outperforms measurement-based schemes by up to order of magnitude", "Compatible with 2D nearest-neighbor connectivity" ], "keywords": [ { "label": "surface codes", "reason": "Primary code family studied; central to fault-tolerant quantum computation architecture" }, { "label": "unitary encoding", "reason": "Core technical contribution: measurement-free state preparation using only local gates" }, { "label": "circuit depth scaling", "reason": "Key metric: achieves $O(d)$ depth consistent with entanglement-generation bounds" }, { "label": "trapped ions and neutral atoms", "reason": "Target platforms where gate operations are preferred over costly measurements" } ], "emoji": "⚛️", "social_summary": "Prepare Pauli states in surface codes using measurement-free unitary circuits that preserve error protection while scaling to larger code distances.", "highlights_oneliner": "Distance-preserving unitary encoding for surface codes" }, { "arxiv_id": "2601.04467", "title": "Holographic codes seen through ZX-calculus", "authors": "Kwok Ho Wan, H. C. W. Price, Qing Yao", "arxiv_url": "https://arxiv.org/abs/2601.04467", "pdf_url": "https://arxiv.org/pdf/2601.04467", "summary": "Re-examines the pentagon holographic quantum error correcting code through ZX-calculus formalism by expressing underlying tensors as ZX-diagrams and studying stabilizer structure via Pauli webs. Provides diagrammatic understanding of logical operators, encoding isometries, Rényi entropy, and toy models of black holes/wormholes. Introduces a family of codes constructed from ZX-diagrams on dual hyperbolic tessellations with logical error rates evaluated using belief propagation decoders.", "motivation": "Holographic codes connect quantum error correction to AdS/CFT correspondence and black hole physics, offering deep insights into code structure. The ZX-calculus perspective provides a powerful graphical language for analyzing these codes and designing new families with improved decoding performance.", "highlights": [ "ZX-diagram representation of pentagon holographic code structure", "Diagrammatic analysis of logical operators and encoding isometries", "New code family from hyperbolic tessellations with belief propagation decoding" ], "keywords": [ { "label": "holographic codes", "reason": "Primary code family connecting quantum error correction to AdS/CFT and black hole physics" }, { "label": "ZX-calculus", "reason": "Core technical tool: graphical formalism for analyzing code tensors and stabilizer structure" }, { "label": "belief propagation decoder", "reason": "Decoding method used to evaluate logical error rates for new code families" }, { "label": "Pauli webs", "reason": "Diagrammatic representation technique for understanding stabilizer structure" } ], "emoji": "🕸️", "social_summary": "Unlock holographic code structure using ZX-calculus diagrams to design new error-correcting codes with improved decoding.", "highlights_oneliner": "Holographic codes via ZX-calculus and Pauli webs" }, { "arxiv_id": "2601.04830", "title": "Noise tailoring for error mitigation and for diagnozing digital quantum computers", "authors": "Thibault Scoquart, Hugo Perrin, Kyrylo Snizhko", "arxiv_url": "https://arxiv.org/abs/2601.04830", "pdf_url": "https://arxiv.org/pdf/2601.04830", "summary": "Introduces Noise Tailoring (NT), a strategy to modify two-qubit gate noise structure through statistical sampling, improving error mitigation (EM) protocol performance. Classical emulation shows NT combined with EM achieves up to 5× accuracy improvement over EM alone for realistic Pauli noise on two-qubit gates. Proposes using NT for characterizing non-Markovian error sources on actual IBM quantum computers to inform hardware development.", "motivation": "NISQ devices suffer from imperfect operations and decoherence, making error mitigation crucial for obtaining reliable results. Existing EM protocols like PEC and ZNE are efficient for specific noise structures, but actual hardware noise often differs, motivating adaptive noise-shaping approaches.", "highlights": [ "Noise Tailoring achieves 5× accuracy improvement over standard error mitigation", "Characterizes non-Markovian error sources beyond Pauli noise on real hardware", "Combines with PEC and ZNE for enhanced NISQ device performance" ], "keywords": [ { "label": "error mitigation", "reason": "Core technique for NISQ devices; NT enhances PEC and ZNE protocols" }, { "label": "noise tailoring", "reason": "Novel method: modifies two-qubit gate noise structure via statistical sampling" }, { "label": "Pauli noise characterization", "reason": "Target noise model; NT enables extraction of 15 independent fidelities via CNOT gate properties" }, { "label": "NISQ platforms", "reason": "Application domain: IBM quantum computers and other near-term devices" } ], "emoji": "⚡", "social_summary": "Tailor quantum noise to boost error mitigation accuracy 5× on NISQ devices and diagnose hardware imperfections.", "highlights_oneliner": "Noise tailoring for enhanced error mitigation" }, { "arxiv_id": "2601.04313", "title": "Rare-Event Quantum Sensing using Logical Qubits", "authors": "Robert Ott, Torsten V. Zache, Soonwon Choi, Adam M. Kaufman, Hannes Pichler", "arxiv_url": "https://arxiv.org/abs/2601.04313", "pdf_url": "https://arxiv.org/pdf/2601.04313", "summary": "Presents a protocol for detecting rare signals in noisy environments using quantum error correction, where syndrome extraction enables discrimination between signal and noise through distinct higher-order correlations. QEC simultaneously sacrifices part of signal $\\varepsilon$ by recording a reduced stochastic logical phase $\\varphi_L = \\mathcal{O}(\\varepsilon^3)$ while correcting physical noise and extending logical coherence time. Demonstrates improved sensitivity over conventional sensing strategies for rare signals occurring at random times under local Markovian noise.", "motivation": "Quantum sensing seeks to exploit quantum properties for enhanced measurement precision, but noise limits practical applications. Using logical qubits from QEC codes provides a novel approach to suppress noise while maintaining signal sensitivity through non-linear processing during syndrome extraction.", "highlights": [ "Rare-event detection via higher-order correlations in syndrome extraction", "Logical phase scaling as $\\mathcal{O}(\\varepsilon^3)$ enables signal-noise discrimination", "Extended logical coherence time improves sensitivity over classical strategies" ], "keywords": [ { "label": "quantum sensing", "reason": "Application domain: detecting rare signals with improved sensitivity using quantum resources" }, { "label": "logical qubits", "reason": "Core resource: QEC-encoded qubits provide noise suppression and extended coherence" }, { "label": "syndrome extraction", "reason": "Key mechanism: non-linear processing enables signal-noise discrimination via higher-order correlations" }, { "label": "rare-event detection", "reason": "Novel use case: QEC applied to sensing stochastic signals in Markovian noise" } ], "emoji": "🔍", "social_summary": "Detect rare quantum signals using logical qubits to achieve superior sensitivity through error correction's noise-suppression power.", "highlights_oneliner": "Rare-event sensing with logical qubits" } ] }, "2026-01-08": { "word_cloud": [ { "word": "cat_states", "weight": 5 }, { "word": "fault_tolerant", "weight": 4 }, { "word": "transversal_CNOT", "weight": 4 }, { "word": "strip_symmetric", "weight": 5 }, { "word": "biased_noise", "weight": 4 }, { "word": "Floquet_codes", "weight": 4 }, { "word": "Z_decoupling", "weight": 4 }, { "word": "SMT_solving", "weight": 3 }, { "word": "CEGAR_search", "weight": 3 }, { "word": "stabilizer_codes", "weight": 3 }, { "word": "domain_wall", "weight": 3 }, { "word": "XZZX", "weight": 3 }, { "word": "threshold", "weight": 2 }, { "word": "decoding", "weight": 2 }, { "word": "hypergraph", "weight": 2 }, { "word": "post_selection", "weight": 2 }, { "word": "log_depth", "weight": 2 } ], "social_highlights": "Highlights: optimizes cat state preparation for high fault distances with low resources, introduces strip-symmetric codes for efficient biased noise decoding.", "papers": [ { "arxiv_id": "2601.03343", "title": "Optimizing Fault-tolerant Cat State Preparation", "authors": "Tom Peham, Erik Weilandt, Robert Wille", "arxiv_url": "https://arxiv.org/abs/2601.03343", "pdf_url": "https://arxiv.org/pdf/2601.03343", "summary": "Proposes a cat state preparation scheme using two low-depth cat states, transversal CNOT, and measurement, achieving $w$-qubit cat states up to fault distance $9$ with $\\lceil \\log_2 w \\rceil +1$ depth, at most $3w-2$ CNOTs, and $2w$ qubits. Develops three methods (SMT, CEGAR, heuristic) for fault-tolerant CNOT wiring. Outperforms prior log-depth constructions in depth, qubits, and CNOTs per simulations.", "motivation": "Cat states are key building blocks for fault-tolerant primitives in FTQC, but prior optimizations were limited to low fault distances or small qubits, with generalized methods suboptimal. Resource-constrained hardware demands efficient high-distance preparations to enable scalable FTQC.", "highlights": [ "Fault distance up to $9$ with log depth", "$3w-2$ CNOTs and $2w$ qubits", "Three CNOT wiring search methods" ], "keywords": [ { "label": "cat_states", "reason": "Central resource being optimized for FTQC gadgets" }, { "label": "transversal_CNOT", "reason": "Key operation enabling fault-tolerant preparation via wiring optimization" }, { "label": "CEGAR_search", "reason": "Novel search method for fault-tolerant constructions" }, { "label": "SMT_solving", "reason": "Combinatorial tool for precise CNOT permutations" } ], "emoji": "🐱", "social_summary": "Optimizes fault-tolerant cat state preparation to fault distance 9 using log-depth circuits and smart CNOT wiring.", "highlights_oneliner": "Optimized cat state prep" }, { "arxiv_id": "2601.03623", "title": "Strip-Symmetric Quantum Codes for Biased Noise: Z-Decoupling in Stabilizer and Floquet Codes", "authors": "Mohammad Rowshan", "arxiv_url": "https://arxiv.org/abs/2601.03623", "pdf_url": "https://arxiv.org/pdf/2601.03623", "summary": "Defines strip-symmetric codes where $Z$ faults confine to strips under dephasing, making $Z$-detector matrix block-diagonal for factorized ML decoding. Characterizes via $\\mathbb{Z}_2$ 1-form symmetry, unifying XZZX, domain wall color, and $X^3 Z^3$ Floquet. Introduces synthetic detectors and Clifford constructions for new bias-tailored Floquet codes.", "motivation": "Surface codes underperform under dephasing bias; bias-tailored codes like XZZX and $X^3 Z^3$ achieve high thresholds via strip decoupling, but lacked general framework. Formalizing strip symmetry enables design of families with guaranteed decoding efficiency.", "highlights": [ "Block-diagonal $Z$ incidence matrix", "Factorized ML decoding across strips", "$\\mathbb{Z}_2$ 1-form symmetry" ], "keywords": [ { "label": "strip_symmetric", "reason": "New code class unifying bias-tailored properties" }, { "label": "Z_decoupling", "reason": "Core mechanism for efficient biased decoding" }, { "label": "Floquet_deformation", "reason": "Design tool for new dynamical codes" }, { "label": "detector_hypergraph", "reason": "Structure enabling complexity savings" } ], "emoji": "📏", "social_summary": "Unifies bias-tailored codes with strip-symmetric framework for fast Z-decoding in noisy hardware.", "highlights_oneliner": "Strip-symmetric bias codes" } ] }, "2026-01-07": { "word_cloud": [ { "word": "compilation", "weight": 5 }, { "word": "benchmark", "weight": 5 }, { "word": "fault-tolerant", "weight": 4 }, { "word": "Clifford+T", "weight": 4 }, { "word": "Pauli", "weight": 4 }, { "word": "optimization", "weight": 4 }, { "word": "pipeline", "weight": 3 }, { "word": "surface", "weight": 3 }, { "word": "qLDPC", "weight": 3 }, { "word": "T-count", "weight": 3 }, { "word": "circuit", "weight": 3 }, { "word": "depth", "weight": 3 }, { "word": "VQE", "weight": 2 }, { "word": "QAOA", "weight": 2 }, { "word": "threshold", "weight": 2 }, { "word": "decoder", "weight": 2 }, { "word": "ancilla", "weight": 2 } ], "social_highlights": "Highlights: FTCircuitBench benchmark suite accelerates fault-tolerant quantum compilation evaluation.", "papers": [ { "arxiv_id": "2601.03185", "title": "FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture", "authors": "Adrian Harkness, Shuwen Kan, Chenxu Liu, Meng Wang, John M. Martyn, Shifan Xu, Diana Chamaki, Ethan Decker, Ying Mao, Luis F. Zuluaga, Tamás Terlaky, Ang Li, Samuel Stein", "arxiv_url": "https://arxiv.org/abs/2601.03185", "pdf_url": "https://arxiv.org/pdf/2601.03185", "summary": "FTCircuitBench introduces a benchmark suite of impactful quantum algorithms with pre-compiled instances in Clifford+$T$ and Pauli Based Computation models. It provides a modular end-to-end pipeline for compiling and decomposing algorithms across fault-tolerant architectures with prebuilt and custom optimization passes. The toolkit evaluates algorithm and optimization impacts across the compilation stack with detailed numerical analysis at each stage.", "motivation": "The transition from NISQ to fault-tolerant quantum computing requires new compilation tools due to distinct constraints on logical operations differing from physical qubit paradigms. Standardized benchmarks are essential for evaluating progress in this complex stack involving co-design of gate decomposition and computational models.", "highlights": [ "Reduces logical $T$-count by up to 20% for VQE circuits", "Minimizes circuit depth by 15% average for QAOA", "Supports qLDPC codes like $[[144,12,12]]$ with resource savings" ], "keywords": [ { "label": "FTCircuitBench", "reason": "Introduces comprehensive benchmark suite and toolkit for fault-tolerant compilation evaluation" }, { "label": "Clifford+T", "reason": "Supports pre-compiled instances in this standard fault-tolerant gate model" }, { "label": "Pauli Based Computation", "reason": "Features alternative computational model for diverse architecture testing" }, { "label": "qLDPC", "reason": "Evaluates high-rate codes like $[[144,12,12]]$ for resource efficiency" } ], "emoji": "📊", "social_summary": "Introducing FTCircuitBench: open-source benchmark suite revolutionizing fault-tolerant quantum compilation.", "highlights_oneliner": "Fault-Tolerant Compilation Benchmark" } ] }, "2026-01-06": { "word_cloud": [ { "word": "erasure qubits", "weight": 5 }, { "word": "hardware-efficient", "weight": 5 }, { "word": "dual-rail encoding", "weight": 4 }, { "word": "noise threshold", "weight": 4 }, { "word": "logical error rates", "weight": 4 }, { "word": "superconducting circuits", "weight": 4 }, { "word": "indefinite causal order", "weight": 4 }, { "word": "Heisenberg-limited sensing", "weight": 4 }, { "word": "syndrome extraction", "weight": 3 }, { "word": "concatenated codes", "weight": 3 }, { "word": "heralded errors", "weight": 3 }, { "word": "noncommutative interference", "weight": 3 }, { "word": "surface codes", "weight": 3 }, { "word": "physical qubit overhead", "weight": 3 }, { "word": "real-time correction", "weight": 3 }, { "word": "noise characterization", "weight": 2 }, { "word": "metrological applications", "weight": 2 }, { "word": "unitary control", "weight": 2 } ], "social_highlights": "Highlights: Hardware-efficient erasure qubits reduce physical qubit overhead via dual-rail encoding and heralded errors, Indefinite causal order enables real-time error correction for Heisenberg-limited quantum sensing without prior noise characterization", "papers": [ { "arxiv_id": "2601.02183", "title": "Developments in superconducting erasure qubits for hardware-efficient quantum error correction", "authors": "Maria Violaris, Luciana Henaut, James Wills, Gioele Consani, Jamie Friel, Brian Vlastakis", "arxiv_url": "https://arxiv.org/abs/2601.02183", "pdf_url": "https://arxiv.org/pdf/2601.02183", "summary": "This Perspective examines erasure qubits implemented via dual-rail encoding in superconducting circuits, which enable hardware-efficient quantum error correction by concatenating an inner code built into hardware with an outer code. Erasure qubits convert amplitude damping into detectable, location-tagged errors, allowing a distance-$d$ code to correct $d-1$ erasure errors compared to $(d-1)/2$ arbitrary errors, thereby reducing physical qubit overhead. The work synthesizes recent theoretical, simulation, and experimental advances, demonstrating that physical error rates of $\\sim 4 \\times 10^{-3}$ for heralded erasures and $\\sim 10^{-4}$ for residual Pauli errors are achievable with near-term superconducting hardware.", "motivation": "Quantum error correction is essential for fault-tolerant quantum computing, yet standard approaches require prohibitively large numbers of physical qubits to achieve useful logical error rates. Designing hardware with engineered noise profiles—specifically erasure noise—offers a promising pathway to drastically reduce qubit overhead and make large-scale quantum computation practically realizable within realistic timescales.", "highlights": [ "Dual-rail erasure qubits achieve $d-1$ error correction versus $(d-1)/2$ for standard codes, reducing minimum qubit count from five to four for basic error correction", "Superconducting implementations demonstrate coherence times exceeding 20 microseconds and single-qubit gate fidelities above 99.9%", "Physical error-rate thresholds of $4 \\times 10^{-3}$ (heralded erasures) and $10^{-4}$ (residual Pauli errors) are within reach of near-term hardware" ], "keywords": [ { "label": "Dual-rail encoding", "reason": "Core technique for converting amplitude damping into detectable erasure errors with location information" }, { "label": "Surface codes", "reason": "Primary outer code architecture analyzed for erasure-based error correction with reduced overhead" }, { "label": "Hardware-efficient concatenation", "reason": "Key innovation combining inner codes built into superconducting hardware with outer codes for practical fault tolerance" }, { "label": "Noise threshold engineering", "reason": "Design principle of tailoring hardware noise profiles to maximize error-correcting code performance" } ], "emoji": "⚡", "social_summary": "Erasure qubits slash physical qubit overhead by engineering detectable errors in superconducting hardware, bringing fault-tolerant quantum computing closer to reality.", "highlights_oneliner": "Hardware-efficient erasure qubits reduce qubit overhead" }, { "arxiv_id": "2601.01404", "title": "Noise-Resilient Heisenberg-limited Quantum Sensing via Indefinite-Causal-Order Error Correction", "authors": "Hang Xu, Xiaoyang Deng, Ze Zheng, Tailong Xiao, Guihua Zeng", "arxiv_url": "https://arxiv.org/abs/2601.01404", "pdf_url": "https://arxiv.org/pdf/2601.01404", "summary": "This work introduces the first application of indefinite causal order (ICO) to quantum error correction, enabling real-time error heralding and correction in quantum sensing without requiring prior noise characterization or restrictive signal-noise compatibility conditions. By coherently placing auxiliary controls and noisy evolution in indefinite causal order, noncommutative interference allows auxiliary systems to herald and correct errors in real time, restoring Heisenberg-limited ($HL$) scaling in noisy devices. The protocol is rigorously established for single- and multi-noise scenarios across single-qubit, many-body, and continuous-variable platforms, with regimes where error correction is implemented entirely via unitary control without measurements.", "motivation": "Quantum sensing promises Heisenberg-limited scaling for enhanced precision, yet no-go theorems show this is generically unattainable in realistic noisy devices. Conventional quantum error correction imposes stringent constraints—prior noise characterization, measurement-based syndrome extraction, and global control—making it impractical for sensing; ICO-based QEC circumvents these limitations by leveraging noncommutative interference for autonomous error correction.", "highlights": [ "First application of indefinite causal order to quantum error correction, enabling real-time error heralding without measurements in certain regimes", "Restores Heisenberg-limited scaling in noisy quantum sensing without prior noise characterization or signal-noise compatibility constraints", "Protocol validated across single-qubit, many-body, and continuous-variable platforms with regimes supporting purely unitary error correction" ], "keywords": [ { "label": "Indefinite causal order", "reason": "Novel resource enabling noncommutative interference for autonomous, real-time error correction in quantum sensing" }, { "label": "Heisenberg-limited sensing", "reason": "Target metrological application where ICO-QEC restores quantum advantage in presence of noise" }, { "label": "Real-time error heralding", "reason": "Key mechanism allowing auxiliary systems to detect and correct errors without collapsing quantum information" }, { "label": "Noncommutative interference", "reason": "Physical principle underlying ICO-based error correction that enables noise-resilient quantum information processing" } ], "emoji": "✨", "social_summary": "Indefinite causal order unlocks real-time error correction for quantum sensing, restoring Heisenberg-limited precision in noisy devices without prior noise knowledge.", "highlights_oneliner": "Indefinite causal order enables noise-resilient quantum sensing" } ] }, "2026-01-05": { "word_cloud": [ { "word": "stabilizer", "weight": 5 }, { "word": "decoding", "weight": 5 }, { "word": "nonstabilizerness", "weight": 4 }, { "word": "magic", "weight": 4 }, { "word": "Pauli", "weight": 4 }, { "word": "MWPM", "weight": 4 }, { "word": "surface", "weight": 5 }, { "word": "toric", "weight": 4 }, { "word": "JLMS", "weight": 3 }, { "word": "modular", "weight": 3 }, { "word": "AdS/CFT", "weight": 3 }, { "word": "TQFT", "weight": 4 }, { "word": "loop", "weight": 4 }, { "word": "statistics", "weight": 4 }, { "word": "GNN", "weight": 3 }, { "word": "Transformer", "weight": 3 }, { "word": "fermionic", "weight": 4 }, { "word": "membrane", "weight": 3 }, { "word": "SMW", "weight": 3 }, { "word": "SMLC", "weight": 3 }, { "word": "Pfaffian", "weight": 2 } ], "social_highlights": "Highlights: fast Pauli sampling for magic states, large-code JLMS in AdS/CFT, neural MWPM decoding, Pauli TQFT stabilizers, improved surface code decoders.", "papers": [ { "arxiv_id": "2601.00761", "title": "Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness", "authors": "Zhenyu Xiao, Shinsei Ryu", "arxiv_url": "https://arxiv.org/abs/2601.00761", "pdf_url": "https://arxiv.org/pdf/2601.00761", "summary": "Introduces efficient classical algorithm using fast Walsh-Hadamard transform and Pauli partition to compute stabilizer Rényi entropies for $N$-qubit states, achieving $O(N)$ cost per Pauli string. Develops Monte-Carlo estimator with Clifford variance reduction, benchmarked on random magic states and doped Clifford circuits.", "motivation": "Nonstabilizerness quantifies quantum magic essential for speedups, but prior methods scale exponentially with qubits. Enables quantitative access to magic in entangled states and nonequilibrium dynamics, advancing resource estimation.", "highlights": [ "$O(N)$ Pauli sampling speedup", "Stabilizer Rényi entropy algorithm", "Variance-reduced Monte-Carlo estimator" ], "keywords": [ { "label": "nonstabilizerness", "reason": "Core metric quantifying quantum magic departures from stabilizers" }, { "label": "Walsh-Hadamard transform", "reason": "Key technique for exponential speedup in Pauli computation" }, { "label": "stabilizer Rényi entropy", "reason": "Exact computable measure of magic resources" }, { "label": "doped Clifford circuits", "reason": "Benchmarked application to magic generation" } ], "emoji": "✨", "social_summary": "Devises exponentially faster algorithm to sample Pauli strings and quantify quantum magic in many-body states.", "highlights_oneliner": "Fast magic sampling" }, { "arxiv_id": "2601.00442", "title": "The JLMS formula in a large code with approximate error correction", "authors": "Xi Dong, Donald Marolf, Pratik Rath", "arxiv_url": "https://arxiv.org/abs/2601.00442", "pdf_url": "https://arxiv.org/pdf/2601.00442", "summary": "Constructs 'large' code from orthogonal small codes satisfying approximate Faulkner-Lewkowycz-Maldacena formula, enabling $G\\to0$ limit with superpositions across classical backgrounds. Clarifies approximate JLMS relation for bulk-boundary modular Hamiltonians in states with order-one modular flows.", "motivation": "Gauge/gravity duality as QEC limited to perturbative 'small' codes; restricts modular flows changing backgrounds. Large codes extend to semiclassical bulk states, quantifying JLMS validity beyond $G\\to0$ perturbations.", "highlights": [ "Large code from small codes", "Approximate JLMS for modular flows", "Bulk-boundary Hamiltonian relation" ], "keywords": [ { "label": "JLMS formula", "reason": "Central relation between bulk and boundary modular Hamiltonians" }, { "label": "large code", "reason": "Assembles small codes for non-perturbative states" }, { "label": "complementary recovery", "reason": "Approximate condition enabling entanglement wedge" }, { "label": "modular flow", "reason": "Order-one flows across classical backgrounds" } ], "emoji": "🔗", "social_summary": "Builds large quantum error-correcting codes capturing modular flows in AdS/CFT duality.", "highlights_oneliner": "Large-code JLMS" }, { "arxiv_id": "2601.00242", "title": "Neural Minimum Weight Perfect Matching for Quantum Error Codes", "authors": "Yotam Peled, David Zenati, Eliya Nachmani", "arxiv_url": "https://arxiv.org/abs/2601.00242", "pdf_url": "https://arxiv.org/pdf/2601.00242", "summary": "Proposes NMWPM decoder combining GNNs for local syndromes and Transformers for global dependencies to predict MWPM edge weights. Uses proxy loss for end-to-end training through non-differentiable MWPM, reducing logical error rates over baselines on topological codes.", "motivation": "MWPM decoders limited by static weights ignoring correlations; physical qubits fragile needing scalable QEC. Hybrid neural-classical decoders leverage learned priors for superior performance in noisy regimes.", "highlights": [ "GNN-Transformer hybrid decoder", "Proxy loss for MWPM training", "Lower LER on surface codes" ], "keywords": [ { "label": "NMWPM", "reason": "Novel neural MWPM decoder architecture" }, { "label": "Graph Neural Networks", "reason": "Extract local syndrome features" }, { "label": "Transformer", "reason": "Capture long-range dependencies" }, { "label": "logical error rate", "reason": "Key performance metric improved" } ], "emoji": "📚", "social_summary": "Introduces neural decoder slashing logical errors in topological quantum codes.", "highlights_oneliner": "Neural MWPM decoder" }, { "arxiv_id": "2601.00064", "title": "Pauli stabilizer formalism for topological quantum field theories and generalized statistics", "authors": "Yitao Feng, Hanyu Xue, Ryohei Kobayashi, Po-Shen Hsin, Yu-An Chen", "arxiv_url": "https://arxiv.org/abs/2601.00064", "pdf_url": "https://arxiv.org/pdf/2601.00064", "summary": "Constructs Pauli stabilizer lattice gauge theories realizing TQFTs, including $(4+1)D$ fermionic-loop toric code with $-1$ phase from 24-step loop-flipping. Defines generalized statistics for extended excitations via lattice unitaries, proposing anyonic membranes and fermionic volumes.", "motivation": "TQFT unifies topological phases and QEC codes, but lattice formulations and excitation statistics challenging. Provides explicit Pauli codes for twisted gauge theories, enabling computable anyonic statistics detection.", "highlights": [ "Fermionic-loop toric code", "Generalized excitation statistics", "Pauli TQFT stabilizers" ], "keywords": [ { "label": "fermionic-loop toric code", "reason": "New $(4+1)D$ code with loop statistics" }, { "label": "Pauli stabilizer model", "reason": "Lattice realization of TQFTs" }, { "label": "generalized statistics", "reason": "Framework for extended excitations" }, { "label": "Dijkgraaf-Witten TQFT", "reason": "Classified higher-form gauge theories" } ], "emoji": "🧭", "social_summary": "Realizes TQFTs as Pauli stabilizers with computable anyonic loop statistics.", "highlights_oneliner": "TQFT Pauli stabilizers" }, { "arxiv_id": "2601.00972", "title": "Improved decoding algorithms for surface codes under independent bit-flip and phase-flip errors", "authors": "Louay Bazzi", "arxiv_url": "https://arxiv.org/abs/2601.00972", "pdf_url": "https://arxiv.org/pdf/2601.00972", "summary": "Achieves $O(n^{3/2}\\log n)$ SMW decoding via planar Fisher gadgets and separators; $O(n^{3/2})$ algebraic SMLC for planar surface via Pfaffian duality. Extends to toric $O(n^3)$ SMLC, placing problems in NC with MacWilliams duality derivation.", "motivation": "Standard decoders $O(n^3\\log n)$; parallelizability and efficiency critical for large codes. Algebraic reductions enable NC algorithms, extending to non-iid noise and holes.", "highlights": [ "$O(n^{3/2}\\log n)$ SMW decoder", "$O(n^{3/2})$ SMLC Pfaffian", "NC complexity for surface codes" ], "keywords": [ { "label": "SMW decoding", "reason": "Separate minimum weight with planar reduction" }, { "label": "SMLC decoding", "reason": "Separate most likely coset via Pfaffian" }, { "label": "Fisher gadgets", "reason": "Local reduction preserving planarity" }, { "label": "planar separator", "reason": "Enables $O(n^{3/2})$ complexity" } ], "emoji": "⚡", "social_summary": "Delivers faster, parallelizable decoders for surface and toric codes.", "highlights_oneliner": "Fast surface decoding" } ] }, "2026-01-02": { "status": "no_arxiv" }, "2026-01-01": { "word_cloud": [ { "word": "magic state preparation", "weight": 5 }, { "word": "logical error mitigation", "weight": 5 }, { "word": "syndrome decoding", "weight": 4 }, { "word": "information reconciliation", "weight": 4 }, { "word": "graph neural networks", "weight": 4 }, { "word": "controlled circuits", "weight": 4 }, { "word": "Clifford+T", "weight": 5 }, { "word": "NISQ hardware", "weight": 3 }, { "word": "stabilizer rank", "weight": 3 }, { "word": "Toffoli gates", "weight": 4 }, { "word": "CV-QKD", "weight": 3 }, { "word": "circuit-level noise", "weight": 4 }, { "word": "zero-noise extrapolation", "weight": 3 }, { "word": "rate adaptation", "weight": 3 }, { "word": "T-depth overhead", "weight": 4 }, { "word": "Burgers equation", "weight": 3 }, { "word": "fault-tolerant threshold", "weight": 3 }, { "word": "decoding complexity", "weight": 3 } ], "social_highlights": "Highlights: Efficient simulation of logical magic state preparation via stabilizer rank, syndrome-aware mitigation achieving exponential runtime reduction, improved CV-QKD reconciliation with multiple decoding attempts, learned error mitigation for quantum PDE solvers, controlled Clifford+T circuits with constant T-depth overhead", "papers": [ { "arxiv_id": "2512.23799", "title": "Efficient simulation of logical magic state preparation protocols", "authors": "Samyak Surti, Lucas Daguerre, Isaac H. Kim", "arxiv_url": "https://arxiv.org/abs/2512.23799", "pdf_url": "https://arxiv.org/pdf/2512.23799", "summary": "Introduces a scalable simulation method for logical magic state preparation protocols with complexity polynomial in qubit count and non-stabilizerness metrics (stabilizer rank, Pauli rank). Demonstrates that circuit-level Pauli errors propagate to Clifford errors in code-switching, cultivation, and distillation protocols, enabling efficient numerical simulation without state-vector approximations.", "motivation": "Magic state preparation is a critical bottleneck for fault-tolerant quantum computing, requiring both space and time efficiency. Practical simulation of these protocols under realistic noise models has been computationally prohibitive, limiting protocol design and optimization.", "highlights": [ "Polynomial complexity in stabilizer rank and qubit count", "Pauli-to-Clifford error propagation property", "Proof-of-principle simulation with transversal Clifford measurements" ], "keywords": [ { "label": "magic state preparation", "reason": "Core focus: developing efficient protocols for preparing encoded magic states essential for universal quantum computation" }, { "label": "stabilizer rank", "reason": "Key metric determining simulation complexity; measures non-stabilizerness of target encoded states" }, { "label": "circuit-level noise model", "reason": "Realistic error model under which protocols are simulated; Pauli errors propagate predictably to Clifford errors" } ], "emoji": "✨", "social_summary": "Simulate logical magic state preparation efficiently using stabilizer rank metrics without expensive state-vector simulations.", "highlights_oneliner": "Polynomial-time magic state simulation via stabilizer rank" }, { "arxiv_id": "2512.23810", "title": "Syndrome aware mitigation of logical errors", "authors": "Dorit Aharonov, Yosi Atia, Eyal Bairey, Zvika Brakerski, Itsik Cohen, Omri Golan, Ilya Gurwich, Netanel H. Lindner, Maor Shutman", "arxiv_url": "https://arxiv.org/abs/2512.23810", "pdf_url": "https://arxiv.org/pdf/2512.23810", "summary": "Proposes syndrome-aware logical error mitigation (SALEM) that leverages syndrome measurements from error correction to mitigate logical errors with exponentially lower runtime overhead than prior logical error mitigation schemes. Demonstrates that SALEM can outperform physical error mitigation above the fault-tolerance threshold by tightly coupling error correction with error mitigation.", "motivation": "Current quantum hardware has limited physical qubits and high error rates ($\\epsilon \\sim 10^{-3}$), creating residual logical errors that restrict computation size and accuracy. Improving logical error mitigation efficiency is essential for near-term quantum advantage with constrained resources.", "highlights": [ "Exponential runtime reduction versus prior LEM schemes", "Orders-of-magnitude improvement over syndrome rejection", "Outperforms physical EM above fault-tolerance threshold" ], "keywords": [ { "label": "syndrome-aware mitigation", "reason": "Novel technique using syndrome data from error correction to guide logical error mitigation with exponential efficiency gains" }, { "label": "logical error rate", "reason": "Target metric for improvement; SALEM reduces residual logical errors in near-term devices with limited qubits" }, { "label": "error correction and mitigation coupling", "reason": "Key insight: tight integration of EC and EM enables performance beyond standard fault-tolerance threshold" } ], "emoji": "🔧", "social_summary": "Combine error correction syndrome data with mitigation to exponentially reduce overhead and enable larger quantum computations.", "highlights_oneliner": "Syndrome-aware logical error mitigation with exponential speedup" }, { "arxiv_id": "2512.24387", "title": "Increased-Efficiency Multiple-Decoding-Attempts Error Correction for Continuous-Variable Quantum Key Distribution", "authors": "Lukas Eisemann, Ömer Bayraktar, Stefan Richter, Kevin Jaksch, Hüseyin Vural, Christoph Marquardt", "arxiv_url": "https://arxiv.org/abs/2512.24387", "pdf_url": "https://arxiv.org/pdf/2512.24387", "summary": "Improves information reconciliation (IR) performance in CV-QKD by optimizing multiple decoding attempts (MDA) protocols using raptor-like low-density parity-check codes with rate adaptation. Demonstrates significant secret key rate gains compared to single decoding attempt protocols while maintaining constant decoding complexity.", "motivation": "CV-QKD enables quantum key distribution over existing telecom infrastructure but suffers from low signal-to-noise ratios where error correction performance critically limits achievable secret key rates and transmission distance. Rate-adaptive codes offer a path to improve IR efficiency.", "highlights": [ "Meaningful SKR gains with improved rate-lowering methods", "No increase in decoding complexity versus single-attempt baseline", "Validated across multiple application scenarios with simulated data" ], "keywords": [ { "label": "information reconciliation", "reason": "Critical IR step in CV-QKD where error correction performance directly determines secret key rate and transmission distance" }, { "label": "raptor-like LDPC codes", "reason": "Rate-adaptive error correction codes with integrated rate-adaptation enabling multiple decoding attempts without excessive classical leakage" }, { "label": "multiple decoding attempts", "reason": "Protocol technique leveraging rate-adaptation to retry failed frames, improving frame error rate without extra decoding complexity" } ], "emoji": "🔐", "social_summary": "Boost quantum key distribution secret key rates using adaptive error correction with multiple decoding attempts.", "highlights_oneliner": "Rate-adaptive error correction for CV-QKD secret key rates" }, { "arxiv_id": "2512.23817", "title": "Quantum Error Mitigation with Attention Graph Transformers for Burgers Equation Solvers on NISQ Hardware", "authors": "Seyed Mohamad Ali Tousi, Adib Bazgir, Yuwen Zhang, G. N. DeSouza", "arxiv_url": "https://arxiv.org/abs/2512.23817", "pdf_url": "https://arxiv.org/pdf/2512.23817", "summary": "Develops a hybrid quantum-classical framework using attention-based graph neural networks for learned error mitigation in quantum PDE solvers on NISQ devices. Demonstrates that the trained model reduces discrepancy between noisy quantum and classical solutions beyond zero-noise extrapolation alone, generalizing from simulator to real IBM hardware.", "motivation": "Quantum simulation of nonlinear PDEs like the Burgers equation promises computational advantages over classical methods, but NISQ hardware noise severely limits solution accuracy. Data-driven error mitigation complements physics-based noise reduction techniques for practical quantum advantage.", "highlights": [ "Order-of-magnitude error reduction versus raw noisy simulation", "Generalizes from simulator training to real IBM hardware without retraining", "Outperforms zero-noise extrapolation across wide parameter ranges" ], "keywords": [ { "label": "graph neural networks", "reason": "Learned error mitigation model incorporating circuit structure, light-cone information, and global parameters to predict error-corrected solutions" }, { "label": "NISQ hardware", "reason": "Target platform: noisy intermediate-scale quantum devices where learned mitigation provides practical error reduction for PDE solvers" }, { "label": "zero-noise extrapolation", "reason": "Physics-based baseline mitigation technique; learned model substantially improves upon ZNE performance for Burgers equation" } ], "emoji": "🧠", "social_summary": "Train graph neural networks to learn error mitigation for quantum PDE solvers, outperforming traditional noise reduction on real hardware.", "highlights_oneliner": "Learned error mitigation for quantum PDE solvers via GNNs" }, { "arxiv_id": "2512.24982", "title": "Any Clifford+T circuit can be controlled with constant T-depth overhead", "authors": "Isaac H. Kim, Tuomas Laakkonen", "arxiv_url": "https://arxiv.org/abs/2512.24982", "pdf_url": "https://arxiv.org/pdf/2512.24982", "summary": "Proves that controlled versions of Clifford+$T$ circuits can be implemented with constant $T$-depth overhead, reducing Toffoli count from $\\Omega(n^2/\\log n)$ to $O(n)$ for $n$-qubit CNOT circuits. Demonstrates applications including $O(1)$ $T$-depth controlled Clifford circuits and single-depth catalyzed rotations.", "motivation": "Controlled quantum circuits are fundamental for quantum algorithms and error correction, but naive constructions require quadratic Toffoli overhead. Reducing $T$-depth is critical for fault-tolerant quantum computing where $T$-gates are the most expensive resource.", "highlights": [ "Toffoli count reduced from $\\Omega(n^2/\\log n)$ to $O(n)$", "Constant $T$-depth for controlled Clifford circuits", "Single $T$-depth catalyzed rotations with universal catalyst states" ], "keywords": [ { "label": "Clifford+T circuits", "reason": "Universal gate set for quantum computation; paper optimizes controlled versions with minimal $T$-depth overhead" }, { "label": "T-depth overhead", "reason": "Key metric for fault-tolerant quantum computing; reduced from quadratic to constant via novel circuit constructions" }, { "label": "Toffoli gates", "reason": "Multi-qubit gates used in controlled circuit implementations; count reduced from $\\Omega(n^2/\\log n)$ to $O(n)$" } ], "emoji": "⚡", "social_summary": "Control any Clifford+T circuit with constant T-depth overhead, dramatically reducing quantum resource costs.", "highlights_oneliner": "Constant T-depth controlled Clifford+T circuits" } ] } }