{"total":15,"items":[{"citing_arxiv_id":"2605.21898","ref_index":71,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","primary_cat":"quant-ph","submitted_at":"2026-05-21T02:12:36+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Concatenating quantum Reed-Solomon outer codes over the gross code using Galois qudits reaches teraquop regime at 10^{-3} physical noise with lower overhead than prior two-gross-code constructions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.21746","ref_index":23,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","primary_cat":"quant-ph","submitted_at":"2026-05-20T21:17:42+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.20346","ref_index":69,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Forced Gap Post-Selection for Quantum LDPC Codes and their Operations","primary_cat":"quant-ph","submitted_at":"2026-05-19T18:03:20+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Forced-gap post-selection on bivariate bicycle codes and surgery gadgets improves logical error rates by a factor of more than 4 using Relay-BP decoding at fixed post-selection rate.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.03854","ref_index":40,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures","primary_cat":"quant-ph","submitted_at":"2026-05-05T15:19:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"struct circuits tailored for DQC. Because practical FTQC demands measurement-based execution, we explicitly target architectures employing high-rate quantum codes operated arXiv:2605.03854v1 [quant-ph] 5 May 2026 via PBC [ 39]-[43]. In particular, we utilize qLDPC codes equipped with extractors-a generic surgery approach with a fixed ancilla system proposed by He et al. [ 40]. While high-rate codes drastically reduce spatial overhead, they often suffer from slow sequential gate operations that scale with the code distance unless mitigated by code-specific crafted gates, which we avoid to maintain generality. To evaluate our approach, we use the Q-Fly architecture [ 44], a hierarchically interconnected system mimicking the dragonfly topology of"},{"citing_arxiv_id":"2604.25094","ref_index":10,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","primary_cat":"quant-ph","submitted_at":"2026-04-28T00:58:22+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"INJEQT reduces synthillation error by up to 22x, wall-clock time by 13x, and space-time cost by 7.2x in extractor FTQC architectures via auxiliary Rz synthesis and pre-fetching.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"making the total error rate of factory injects be dominated by the more expensive of the two, which necessitates that factories have comparable LERs, and/or 2. inter-module measurements operate between different codes, which are typically placed on distinct quantum processes and connected via photonic/optical inter-connects which makes them more erroneous [10], [18], [26]. The error rate for cultivation is much lower than the error rates for other factories, sinced= 3colour code does not suffice to achieve comparable error rates (they saturate at ∼10 −6) toε C atp= 10 −4 [7], [22], however, usingd= 5 colour code ends up beingtoo good. The discard rate for distillation is∼5.5×10 −3, and there- fore we model distillation as a deterministic state preparation"},{"citing_arxiv_id":"2604.19735","ref_index":24,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage","primary_cat":"quant-ph","submitted_at":"2026-04-21T17:57:43+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A teleportation-based parallelization architecture for neutral-atom quantum error correction delivers up to 3x speedup over extractor methods at fixed space cost and enables simulated quantum advantage at 11,495 atoms and 15-hour runtime.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"consider systems of similar scale that are beyond the reach of state-of-the-art classical simulation methods. In particular, we consider four systems: the Heisenberg model [3, 19, 62], the nearest-neighbour (NN) and long-range (LR) transverse-field Ising models [ 15, 19], and the Fermi- Hubbard [23] model. For the Fermi-Hubbard model, we use the Jordan-Wigner transformation [24] to map fermionic operators to qubit operators. We simulate the time dynamics by approximating the time-evolution operator,𝑒 −𝑖 ˆ𝐻𝑡 , using higher-order Trotter-Suzuki product formulas [50]. We con- struct efficient circuits for time evolution by grouping the Hamiltonian into sets of commuting terms and constructing Clifford circuits for simultaneous diagonalization, following"},{"citing_arxiv_id":"2604.18714","ref_index":26,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","primary_cat":"quant-ph","submitted_at":"2026-04-20T18:14:28+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Theoretical results indicate that long-range interac- tions are not merely an implementation nuisance but a requirement for high-performance qLDPC codes. For local-expansion qLDPC codes implemented with 2D- local gates, the depth of a full syndrome-extraction cycle is at least Ω(n/ √ N), whereNis the total number of data, check, and ancilla qubits [26]. Thus one cannot simulta- neously maintain constant encoding rate and constant- depth extraction using onlyO(n) qubits. Moreover, re- alizing a qLDPC code with distanced= Θ(n 1/2+ϵ) in 2D requires Ω(n 1/2+ϵ) interactions of range ˜Ω(nϵ) [27], implying that both the number and range of long-range interactions must grow with code size to surpass the"},{"citing_arxiv_id":"2604.16209","ref_index":61,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","primary_cat":"quant-ph","submitted_at":"2026-04-17T16:19:55+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A family of quantum LDPC codes with encoding rates exceeding 1/2 achieves logical error rates of 10^{-13} per round on atom arrays under 0.1% circuit noise using hierarchical decoding.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"1126/sci- adv.abn1717 (2022). [59] B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphi- nais, Fault-Tolerant Logical Measurements via Homolog- ical Measurement, Physical Review X15, 021088 (2025). [60] D. J. Williamson and T. J. Yoder, Low-overhead fault- tolerant quantum computation by gauging logical opera- tors, arXiv preprint arXiv:2410.02213 (2024). [61] E. Swaroop, T. Jochym-O'Connor, and T. J. Yoder, Uni- versal adapters between quantum LDPC codes, arXiv preprint arXiv:2410.03628 (2024). [62] G. Zhang and Y. Li, Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes, Physical Review Letters134, 10.1103/PhysRevLett.134.070602 (2024). [63] N. Baspin, L. Berent, and L. Z. Cohen, Fast surgery for"},{"citing_arxiv_id":"2604.09956","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Logical Compilation for Multi-Qubit Iceberg Patches","primary_cat":"quant-ph","submitted_at":"2026-04-10T23:31:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"A new heuristic compiler for multi-qubit iceberg patches reduces circuit depth by 34 percent, cuts gate counts, and improves fidelity metrics on 71 benchmarks compared with naive mapping.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.09797","ref_index":29,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Optimising Quantum Error Correction Using Morphing Circuits","primary_cat":"quant-ph","submitted_at":"2026-04-10T18:19:25+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"for 2D topological codes, the principles could be used to put boundaries on morphing circuits for topological codes in higher dimensions. Our first task is to explain how to create a bound- ary in the infinite codeCinf for the surface and colour codes as shown in Fig. 12(i-iii); this procedure is often called \"anyon condensation\" in the literature [29, 30]. We do this by fixing a location of the boundary, and then measuring all the qubits beyond this boundary in a basis that is determined by the \"type\" of topo- logical boundary that we impose. These measure- ments introduce new stabilisers and remove some ex- isting anticommuting stabilisers in accordance with the Gottesman-Knill theorem [1]. Because the mea-"},{"citing_arxiv_id":"2604.05126","ref_index":69,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","primary_cat":"quant-ph","submitted_at":"2026-04-06T19:40:46+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.01040","ref_index":50,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Geometry-induced correlated noise in qLDPC syndrome extraction","primary_cat":"quant-ph","submitted_at":"2026-04-01T15:50:51+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Geometry choices in bivariate-bicycle qLDPC syndrome extraction determine leading correlated error structure via weighted exposure, which correlates strongly with logical error rates and is reduced by biplanar layouts.","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"(49) if the minimizer of weff is attained among minimum-weight logicals, which is the case in all BB72 instances studied here. Proof of Theorem 3. Upper bound.Let M be a maximum matching in C σ ϕ[S], so |M| = νσ ϕ(L). Use one retained pair fault for each edge in M and one single-qubit fault for each unmatched vertex. The total is |M|+ |S| −2|M| \u0001 =|S| −ν.(50) Lower bound.Let F be any set of retained pair edges used to realize L on S. Every support vertex must be covered an odd number of times by the union of pair and single faults. Vertices of odd degree in ( S, F) require no additional single fault; all others require one. The minimum number of singles is therefore |S| −o (F ), where o(F ) is the number of odd-degree vertices in the subgraph"},{"citing_arxiv_id":"2602.11457","ref_index":46,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","primary_cat":"quant-ph","submitted_at":"2026-02-12T00:30:48+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"jecting a noisy |T⟩ state from a small ancillary Jna,1, d aK code. This is done using generalised surgery to perform a joint measurement (repeated da times) between the L logical sector of the GB code and the ancillary code. The noisy |T⟩ states are prepared using standard techniques (in- cluding, if necessary, methods to increase the input state fidelity, such as zero-level distillation [ 46, 47] or magic 11 TABLE I. Instances of the family of generalised bicycle codes. For each code, the parameters Jn, k, dK are provided, along with the number of code cycles per logical cycle, dt =d+ 2 . The codes are defined by l, A, and B, alongside Eq. (1) and Eq. (2). The remaining columns show the number of physical qubits in their code blocks, gadgets, bridges and processing blocks."},{"citing_arxiv_id":"2510.19442","ref_index":54,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes","primary_cat":"quant-ph","submitted_at":"2025-10-22T10:15:40+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A new scheme for fault-tolerant quantum computation on qLDPC codes achieves constant qubit overhead and time overhead O(d^{1+o(1)}) for good codes, faster than prior code surgery methods for a<2.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2503.05003","ref_index":59,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Parallel Logical Measurements via Quantum Code Surgery","primary_cat":"quant-ph","submitted_at":"2025-03-06T22:05:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}