{"total":12,"items":[{"citing_arxiv_id":"2606.24170","ref_index":5,"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.19593","ref_index":11,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation","primary_cat":"quant-ph","submitted_at":"2026-06-17T20:47:45+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A pipelined framework with speculation for logical operations in fault-tolerant quantum computation reduces total pipeline steps by 20-40% on benchmarks by overlapping control, execution, and decoding stages.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.18408","ref_index":13,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Characterization of nested Walsh parity-check filters in a single-photon eight-mode register on a cloud photonic processor","primary_cat":"quant-ph","submitted_at":"2026-06-16T19:01:47+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Experimental tests of parity-check filters in a single-photon eight-mode photonic register on Quandela's Belenos processor show mean 0.6% DC leakage with 21x suppression and 94-99% syndrome channel selectivity.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.17956","ref_index":20,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Fabless Quantum Chip Design and Commercial Production","primary_cat":"quant-ph","submitted_at":"2026-06-16T14:08:45+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Proposes a fabless-foundry ecosystem for superconducting quantum chips built on certified PDKs, SPICE-Q multiphysics modeling, parameterized cells, Q-EDA automation, and a quantum-IP market.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.22603","ref_index":74,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Sudden death of entanglement, rebirth of magic","primary_cat":"quant-ph","submitted_at":"2026-05-21T15:16:42+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.16595","ref_index":20,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"qstack: Compositional End-to-End Compilation for Fault-Tolerant Quantum Programs","primary_cat":"quant-ph","submitted_at":"2026-05-15T19:57:31+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"qstack introduces callback wrapping in a quantum IR to allow compositional end-to-end compilation of fault-tolerant quantum programs including concatenated error-correcting codes without manual classical logic adaptation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.07983","ref_index":18,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation","primary_cat":"quant-ph","submitted_at":"2026-05-08T16:44:12+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Stochastic magic-state production in fault-tolerant quantum computing inflates execution time but reduces peak resource demand, allowing stochastic-aware factory allocation to cut space-time volume by up to 27% and factories by up to 30% versus deterministic optima.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"†Electrical and Computer Engineering, Duke University §Computer Science and Engineering, University of Michigan ∗aditiawasthi@utexas.edu Abstract-A promising approach to achieving scalable fault- tolerant quantum computation (FTQC) is the use of quantum error correction (QEC) codes augmented with magic states i.e. resource states produced via distillation [3], [18], cultivation [10], orR z synthesis [1], [26] and teleported into the circuit as needed. Because magic-state production dominates the space-time volume of fault-tolerant programs, system architects must decide how many production units to allocate. Current approaches [2], [20] rely on deterministic analysis that either provisions for worst-case peak demand (wasting valuable qubit resources on factories that"},{"citing_arxiv_id":"2605.03854","ref_index":10,"ref_count":1,"confidence":0.88,"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":"background","top_context_polarity":"background","context_text":"35-65, Dec. 2002. [8] J. Miyazaki, M. Hajdušek, and M. Murao, \"Analysis of the trade-off between spatial and temporal resources for measurement-based quantum computation,\" Physical Review A , vol. 91, no. 5, p. 052302, May 2015, doi:10.1103/PhysRevA.91.052302. [9] A. G. Fowler, \"Time-optimal quantum computation,\" Feb. 2013, doi:10.48550/arXiv.1210.4626. [10] D. Litinski, \"A Game of Surface Codes: Large-Scale Quantum Com- puting with Lattice Surgery,\" Quantum, vol. 3, p. 128, Mar. 2019, doi:10.22331/q-2019-03-05-128. [11] R. Raussendorf, J. Harrington, and K. Goyal, \"Topological fault- tolerance in cluster state quantum computation,\" New Journal of Physics, vol. 9, no. 6, pp. 199-199, Jun. 2007, doi:10."},{"citing_arxiv_id":"2604.15099","ref_index":35,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling","primary_cat":"quant-ph","submitted_at":"2026-04-16T14:57:58+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"gate set Clifford+Tis well-suited for surface codes. It consists of the Hadamard gateH, the phase gateS, theTgate requiring the consumption of magic state|0⟩+e iπ/4 |1⟩, and the controlled-NOT gate (CNOT). However, implementingT gates requires the consumption of magic states, which must be generated through magic state distillation protocols [7], [8], [27], [35] to enable universal quantum computation. B. Lattice Surgery in Surface Code Abstraction of surface code to patches.Each patch corresponds to a distance-dsurface code, which encodes a logical qubit usingd 2 physical data qubits, as illustrated in Fig.2(b) for the case ofd= 3. These surface codes are then abstracted as patches placed on tiles, as shown in Fig."},{"citing_arxiv_id":"2512.06484","ref_index":20,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"PureMagic: A Dynamic Scheduler for Lattice Surgery","primary_cat":"quant-ph","submitted_at":"2025-12-06T16:16:20+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2503.05003","ref_index":37,"ref_count":1,"confidence":0.88,"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},{"citing_arxiv_id":"2401.15829","ref_index":18,"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}