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.
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
4 Pith papers cite this work. Polarity classification is still indexing.
fields
quant-ph 4representative citing papers
Bivariate bicycle codes enable a modular architecture that supports an order of magnitude more logical circuit volume per physical qubit than surface-code designs under circuit noise.
A space-efficient quantum ECDLP algorithm uses 5n + 4⌊log₂n⌋ + O(1) logical qubits and O(n³) Toffoli gates, lowering the 256-bit estimate from 2124 to 1333 qubits.
MCMit mitigates mid-circuit measurement errors via a new multi-control branch instruction, CNN and transformer discriminators, and software techniques, reporting up to 70% latency reduction and 80% lower logical error rates in QEC.
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.
-
Tour de gross: A modular quantum computer based on bivariate bicycle codes
Bivariate bicycle codes enable a modular architecture that supports an order of magnitude more logical circuit volume per physical qubit than surface-code designs under circuit noise.
-
Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation
A space-efficient quantum ECDLP algorithm uses 5n + 4⌊log₂n⌋ + O(1) logical qubits and O(n³) Toffoli gates, lowering the 256-bit estimate from 2124 to 1333 qubits.
-
MCMit: Mid-Circuit Measurement Error Mitigation
MCMit mitigates mid-circuit measurement errors via a new multi-control branch instruction, CNN and transformer discriminators, and software techniques, reporting up to 70% latency reduction and 80% lower logical error rates in QEC.