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.
Unconditionally verifiable blind quantum computation
5 Pith papers cite this work, alongside 273 external citations. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Circuit-cutting metadata leaks algorithm family and Hamiltonian k-locality with near-perfect accuracy via topological transpilation penalties on production QPUs.
QML-PipeGuard is a framework for runtime behavioral fingerprinting of QML pipelines that absorbs benign drift while detecting adversarial channel substitution via informationally complete measurements.
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.
The paper provides a method to construct and translate measurement-based delegated quantum computing protocols between prepare-and-send and receive-and-measure settings.
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.
-
Post-Cut Metadata Inference Attacks on Quantum Circuit Cutting Pipelines
Circuit-cutting metadata leaks algorithm family and Hamiltonian k-locality with near-perfect accuracy via topological transpilation penalties on production QPUs.
-
QML-PipeGuard: Drift-Aware Behavioral Fingerprinting for Quantum Machine Learning Pipeline Integrity
QML-PipeGuard is a framework for runtime behavioral fingerprinting of QML pipelines that absorbs benign drift while detecting adversarial channel substitution via informationally complete measurements.
-
Time-Delayed Publicly Verifiable Quantum Computation for Classical Verifiers
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.
-
Unifying communication paradigms in measurement-based delegated quantum computing
The paper provides a method to construct and translate measurement-based delegated quantum computing protocols between prepare-and-send and receive-and-measure settings.