Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Assuming quantum computers cannot solve NP-complete problems efficiently implies that certain quantum measurements and time evolutions are unperformable, rendering some superpositions indistinguishable from mixtures and linking to superselection sectors.
Engineered random states in exponential-dimensional Hilbert spaces generically deliver Heisenberg-limited metrology, experimentally demonstrated with 6.98 dB enhancement beyond the standard quantum limit on a trapped-ion processor.
citing papers explorer
-
A Modular Approach to Succinct Arguments for QMA
Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.
-
Unobservables and Decoherence from Complexity
Assuming quantum computers cannot solve NP-complete problems efficiently implies that certain quantum measurements and time evolutions are unperformable, rendering some superpositions indistinguishable from mixtures and linking to superselection sectors.
-
Engineered Randomness for Ubiquitous Quantum-Enhanced Metrology in Exponential-Dimensional Manifolds
Engineered random states in exponential-dimensional Hilbert spaces generically deliver Heisenberg-limited metrology, experimentally demonstrated with 6.98 dB enhancement beyond the standard quantum limit on a trapped-ion processor.