{"total":6,"items":[{"citing_arxiv_id":"2607.08133","ref_index":57,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Communication Advantages from Quantum Dense Network Coding","primary_cat":"quant-ph","submitted_at":"2026-07-09T06:08:43+00:00","verdict":"ACCEPT","verdict_confidence":"HIGH","novelty_score":7.5,"formal_verification":"none","one_line_summary":"Dense network coding computes group operations over multiaccess networks with half the classical communication cost using shared entanglement plus quantum channels, and yields measurement-device-independent quantum key growing.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.07666","ref_index":13,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems","primary_cat":"quant-ph","submitted_at":"2026-06-04T04:30:28+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"An integrated compilation and data-driven QED framework raises algorithmic success probability by up to 68% over SABRE on an 8-qubit VQE instance in simulations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2509.01892","ref_index":25,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing","primary_cat":"quant-ph","submitted_at":"2025-09-02T02:30:02+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2507.21883","ref_index":35,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Sampling (noisy) quantum circuits through randomized rounding","primary_cat":"quant-ph","submitted_at":"2025-07-29T14:56:17+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Gaussian randomized rounding on two-qubit marginals of depth-D circuits with local depolarizing noise p yields samples whose expected Max-Cut cost matches the noisy quantum device up to an approximation ratio of 1-O[(1-p)^D].","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2409.00433","ref_index":23,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","primary_cat":"quant-ph","submitted_at":"2024-08-31T12:10:32+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2401.15829","ref_index":4,"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}