paper

Quantum Approximation of Normalized Schatten Norms and Applications to Learning

arXiv:2206.11506 · doi:10.1103/PhysRevA.106.052409

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 is sufficiently small (e.g. ) then the fidelity of states obtained by processing the same randomly and uniformly picked pure state, , is as high as needed () with probability exceeding . We provide example applications of this efficient similarity metric estimation framework to quantum circuit learning tasks, such as finding the square root of a given unitary operation.

25 pages, 4 figures, 6 tables, 1 algorithm

References in corpus (16)

Cited by in corpus (2)