n-bit anticoncentrated distributions can be generated from O(log n) qubits via a holographic protocol of interleaved random unitaries and mid-circuit measurements.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4representative citing papers
Optimized QED intervals plus steady-state extraction enable PEC+QED to deliver 2-11x lower error than PEC alone on Iceberg codes for QAOA.
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.
Proves Θ(log N) routing number for Ramanujan (d,r)-regular hypergraphs via clique expansion matchings and develops applications to neutral atom qubit routing including virtual overlays, entanglement assistance, and hierarchical methods.
citing papers explorer
-
Anticoncentrated $n$-bit distribution from $\log(n)$ qubits
n-bit anticoncentrated distributions can be generated from O(log n) qubits via a holographic protocol of interleaved random unitaries and mid-circuit measurements.
-
Co-Designing Error Mitigation and Error Detection for Logical Qubits
Optimized QED intervals plus steady-state extraction enable PEC+QED to deliver 2-11x lower error than PEC alone on Iceberg codes for QAOA.
-
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.
-
Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures
Proves Θ(log N) routing number for Ramanujan (d,r)-regular hypergraphs via clique expansion matchings and develops applications to neutral atom qubit routing including virtual overlays, entanglement assistance, and hierarchical methods.