Embedding experimental quantum states into high-distance codes enables exponential speedups in fault-tolerant shadow tomography and cubic observable estimation over unencoded adaptive strategies.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
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.
Block routing number on Ramanujan hypergraphs for surface code patches is Θ(d_C log N_L), with spectral analysis and integration into error correction protocols.
citing papers explorer
-
Exponential speedups in fault-tolerant processing of quantum experiments
Embedding experimental quantum states into high-distance codes enables exponential speedups in fault-tolerant shadow tomography and cubic observable estimation over unencoded adaptive strategies.
-
Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting
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.
-
Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
Block routing number on Ramanujan hypergraphs for surface code patches is Θ(d_C log N_L), with spectral analysis and integration into error correction protocols.