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.
hub Mixed citations
arXiv preprint arXiv:2503.10390 , year=
Mixed citation behavior. Most common role is background (62%).
15
Pith papers citing it
Background
62% of classified citations
hub tools
citation-role summary
background 5
method 3
citation-polarity summary
fields
quant-ph 15representative citing papers
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噪声
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
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.
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.
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.
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.
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.
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.
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.
Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.
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.
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.
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.
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.
citing papers explorer
-
Logical Compilation for Multi-Qubit Iceberg Patches
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.
-
In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes
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噪声
-
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
-
Parallel Logical Measurements via Quantum Code Surgery
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.
-
Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes
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.
-
Forced Gap Post-Selection for Quantum LDPC Codes and their Operations
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.
-
INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures
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.
-
Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage
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.
-
Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
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.
-
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
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.
-
Optimising Quantum Error Correction Using Morphing Circuits
Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.
-
Geometry-induced correlated noise in qLDPC syndrome extraction
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.
-
Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
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.
-
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
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.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
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.