The paper formalizes backend identifiability as hypothesis testing, proves anonymity decays at the Chernoff rate under persistent i.i.d. probing, establishes a utility-anonymity trade-off, and demonstrates 87-100% backend classification on real cloud QPUs.
Simulating two-dimensional lattice gauge theories on a qudit quantum computer.Nature Physics, 21(4):570–576, 2025
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Routing Anonymity and Identifiability of Noisy Quantum Hardware
The paper formalizes backend identifiability as hypothesis testing, proves anonymity decays at the Chernoff rate under persistent i.i.d. probing, establishes a utility-anonymity trade-off, and demonstrates 87-100% backend classification on real cloud QPUs.