Efficient and Practical Black-Box Verification of Quantum Metric Learning Algorithms
Ahmed Shokry, Movahhed Sadeghi, Mahmut Kandemir

TL;DR
This paper introduces a practical black-box verification protocol for quantum metric learning models, enabling the assessment of data separation quality on limited quantum hardware without revealing model details.
Contribution
It presents a novel verification algorithm that estimates quantum data separation angles without prior knowledge of the model or measurement setup, applicable to NISQ devices.
Findings
The protocol accurately estimates quantum embedding separation angles.
The method is robust against adversarial model manipulations.
Implementation on QAOAEmbedding models validates effectiveness.
Abstract
Quantum metric learning enhances machine learning by mapping classical data to a quantum Hilbert space with maximal separation between classes. However, on current NISQ hardware, this mapping process itself is prone to errors and could be fundamentally incorrect. Verifying that a quantum embedding model successfully achieves its promised separation is essential to ensure the correctness and reliability. In this paper, we propose a practical black-box verification protocol to audit the performance of quantum metric learning models. We define a setting with two parties: a powerful but untrusted prover, who claims to have a parameterized unitary circuit that embeds classical data from different groups with a guaranteed angular separation, and a limited verifier, whose quantum capabilities are restricted to performing only basic measurements. The verifier has no knowledge of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
