Quantum Approximation of Normalized Schatten Norms and Applications to Learning
Yiyou Chen, Hideyuki Miyahara, Louis-S. Bouchard, Vwani, Roychowdhury

TL;DR
This paper introduces an efficient quantum sampling method to estimate a normalized Schatten 2-norm based similarity measure for quantum operations, enabling practical applications in quantum circuit learning with size-independent sample complexity.
Contribution
It develops a quantum sampling circuit for estimating the Schatten 2-norm difference between quantum operations with size-independent complexity, linking it to fidelity-based similarity.
Findings
Sample complexity is Poly(1/ε), independent of system size.
Small Schatten 2-norm difference implies high fidelity for processed states.
Application demonstrated in quantum circuit learning tasks.
Abstract
Efficient measures to determine similarity of quantum states, such as the fidelity metric, have been widely studied. In this paper, we address the problem of defining a similarity measure for quantum operations that can be \textit{efficiently estimated}. Given two quantum operations, and , represented in their circuit forms, we first develop a quantum sampling circuit to estimate the normalized Schatten 2-norm of their difference () with precision , using only one clean qubit and one classical random variable. We prove a Poly upper bound on the sample complexity, which is independent of the size of the quantum system. We then show that such a similarity metric is directly related to a functional definition of similarity of unitary operations using the conventional fidelity metric of quantum states (): If $\| U_1-U_2…
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.
