{"total":18,"items":[{"citing_arxiv_id":"2605.11318","ref_index":111,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Spatial overhead reduction for 2D hypergraph product codes","primary_cat":"quant-ph","submitted_at":"2026-05-11T23:11:40+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.10924","ref_index":18,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Multi-Qubit Stabilizer Readout on a Dual-Species Rydberg Array","primary_cat":"quant-ph","submitted_at":"2026-05-11T17:55:33+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Dual-species Na-Cs Rydberg array enables simultaneous non-destructive readout of multiple Pauli-Z stabilizers on four-qubit plaquettes using a single global pulse sequence after compensating geometric phase errors.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.05347","ref_index":54,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"The true cost of factoring: Linking magic and number-theoretic complexity in Shor's algorithm","primary_cat":"quant-ph","submitted_at":"2026-05-06T18:16:29+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Shor's algorithm generates and consumes magic resources in direct proportion to the difficulty of the underlying factoring problem.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.03951","ref_index":17,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","primary_cat":"quant-ph","submitted_at":"2026-05-05T16:37:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.03854","ref_index":43,"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":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.03715","ref_index":1,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Real-time Krylov Diagonalisation for Open Quantum Systems","primary_cat":"quant-ph","submitted_at":"2026-05-05T13:05:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Real-time Krylov subspace methods are extended to Lindblad open quantum systems and demonstrated on a Kerr resonator for estimating the Liouvillian gap in cat qubit regimes.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.03180","ref_index":10,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding","primary_cat":"quant-ph","submitted_at":"2026-05-04T21:42:12+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"An automated predecoder generator for arbitrary qLDPC codes cuts decoder utilization by up to 3963x and supports hardware scaling to tens or hundreds of thousands of logical qubits within power limits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.27943","ref_index":2,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Adaptable Continuous Variable Quantum Network with Finite Size Security","primary_cat":"quant-ph","submitted_at":"2026-04-30T14:42:23+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Experimental demonstration of an active 1:4 CV-QKD quantum network in the finite-size regime with adaptable protocols achieving 0.19 bits per channel use over 11 km channels.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.19735","ref_index":12,"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":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.19481","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","primary_cat":"quant-ph","submitted_at":"2026-04-21T14:02:12+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.16613","ref_index":8,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs","primary_cat":"quant-ph","submitted_at":"2026-04-17T18:11:20+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.16209","ref_index":75,"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":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.15094","ref_index":26,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"QLLVM: A Scalable Quantum-Classical Co-Compilation Framework based on LLVM","primary_cat":"quant-ph","submitted_at":"2026-04-16T14:53:41+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"QLLVM delivers an LLVM-based end-to-end co-compiler that unifies classical HPC and quantum programs into one executable, with a three-stage quantum path via MLIR and QIR that reduces circuit depth and gate counts on MQTBench versus prior compilers.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.13158","ref_index":41,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Fast measurement of neutral atoms with a multi-atom gate","primary_cat":"quant-ph","submitted_at":"2026-04-14T18:00:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A multi-atom Rydberg gate with N ancillae enables N-fold photon collection for fast neutral-atom measurement, achieving infidelity below 10^{-3} in 6 μs with N=5 in Cs-Rb simulations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.08669","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays","primary_cat":"cond-mat.quant-gas","submitted_at":"2026-04-09T18:00:17+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A graph neural network path planner and phase-aware Gerchberg-Saxton algorithm enable defect-free assembly of 10,000-atom arrays in under 6 ms, faster than typical atom loss times.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.06322","ref_index":28,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Probing the Planck scale with quantum computation","primary_cat":"quant-ph","submitted_at":"2026-04-07T18:00:35+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.06319","ref_index":35,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting","primary_cat":"quant-ph","submitted_at":"2026-04-07T18:00:11+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Heterogeneous quantum architectures with task-specific hardware and QEC encodings deliver up to 138x lower physical-qubit overhead than monolithic baselines for fault-tolerant algorithms, including RSA-2048 factoring at 190k-381k qubits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.04600","ref_index":59,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Phase-Stable Hologram Updates for Large-Scale Neutral-Atom Array Reconfiguration","primary_cat":"quant-ph","submitted_at":"2026-04-06T11:25:16+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"WPGS algorithm enforces inter-frame phase continuity in holographic tweezers to suppress refresh-induced atom loss and speed up updates for large neutral-atom arrays.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}