{"total":10,"items":[{"citing_arxiv_id":"2606.24170","ref_index":9,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Low Spatial Cost CCZ Magic State Factory","primary_cat":"quant-ph","submitted_at":"2026-06-23T05:51:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A design framework that converts an eight-to-three CCZ distillation protocol into a joint-measurement surface-code layout using smaller patches, claimed to cut spatial cost versus Gidney-Fowler while preserving leading-order error suppression and single-fault detection.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.24048","ref_index":6,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"An Analysis of Speculative Window Decoders for Quantum Error Correction","primary_cat":"quant-ph","submitted_at":"2026-06-23T01:19:35+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Speculative decoding for QEC reduces waiting time for prior windows but yields gains only under high speculation accuracy and low decoder latency; non-speculative decoders outperform under other conditions across gate speeds and platforms.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.17230","ref_index":113,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Maximum Likelihood Decoding of Quantum Error Correction Codes","primary_cat":"quant-ph","submitted_at":"2026-05-17T02:32:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.12385","ref_index":35,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","primary_cat":"quant-ph","submitted_at":"2026-05-12T16:47:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.25863","ref_index":52,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"MCMit: Mid-Circuit Measurement Error Mitigation","primary_cat":"quant-ph","submitted_at":"2026-04-28T17:00:53+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"rate Mid-Circuit Measurements (MCMs) and subsequent classical feedback [25, 41, 100]. These operations are indispensable for core operations, such as syndrome measurements in QEC and the clas- sical communication inherent in quantum teleportation protocols, essential for DQC [104, 105]. Despite their utility, MCMs, particularly in superconducting ar- chitectures [52], exhibit both high error rates and substantial latency, often representing the slowest and most error-prone operations in a quantum circuit [28, 77, 89]. Furthermore, the subsequent classical feedback required for dynamic circuits introduces additional, often unaddressed, latency that ranks second only to the measurements themselves, further hindering performance, as we show in Table 1."},{"citing_arxiv_id":"2511.13657","ref_index":36,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads","primary_cat":"quant-ph","submitted_at":"2025-11-17T18:14:38+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2511.02900","ref_index":25,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic","primary_cat":"quant-ph","submitted_at":"2025-11-04T19:00:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Extends n-dimensional topological stabilizer codes to Clifford hierarchy versions corresponding to non-Abelian gauge theories and constructs transversal gates at the (n+1)th Clifford level.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2506.11552","ref_index":47,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction","primary_cat":"quant-ph","submitted_at":"2025-06-13T08:02:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2406.17995","ref_index":34,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Managing Classical Processing Requirements for Quantum Error Correction","primary_cat":"quant-ph","submitted_at":"2024-06-26T00:50:10+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2401.15829","ref_index":7,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice","primary_cat":"quant-ph","submitted_at":"2024-01-29T01:28:42+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}