Quantum Approximation of Normalized Schatten Norms and Applications to Learning

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, $U_1$ and $U_2$, represented in their circuit forms, we first develop a quantum sampling circuit to estimate the normalized Schatten 2-norm of their difference ($\Vert U_1-U_2{\Vert }_{S_2}$) with precision $\epsilon$, using only one clean qubit and one classical random variable. We prove a Poly$(\frac{1}{\epsilon })$ 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 ($F$): If $\Vert U_1-U_2{\Vert }_{S_2}$ is sufficiently small (e.g. $\le \frac{\epsilon }{1+\sqrt{2(1/\delta -1)}}$) then the fidelity of states obtained by processing the same randomly and uniformly picked pure state, $|\psi ⟩$, is as high as needed ($F(U_1|\psi ⟩,U_2|\psi ⟩)\ge 1-\epsilon$) with probability exceeding $1-\delta$. 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.

arXiv comment25 pages, 4 figures, 6 tables, 1 algorithm

References in corpus (51)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• A Quantum Approximate Optimization Algorithm
• Quantum Circuit Learning
• Quantum Convolutional Neural Networks
• Efficient Learning for Deep Quantum Neural Networks
• Distance measures to compare real and ideal quantum processes
• A new proof for the existence of mutually unbiased bases
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• The Quantum Chernoff Bound
• Quantum Natural Gradient
• Quantum state discrimination and its applications
• Fidelity of quantum operations
• Variational quantum algorithms for nonlinear problems
• Statistical distinguishability between unitary operations
• Optimal discrimination of quantum operations
• How to generate random matrices from the classical compact groups
• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• All entangled states are useful for channel discrimination
• Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled States
• Contractivity of positive and trace preserving maps under $L_p$ norms
• Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators
• The Perfect Distinguishability of Quantum Operations
• Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
• Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
• Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1
• Unambiguous discrimination among quantum operations
• Distinguishing Arbitrary Multipartite Basis Unambiguously Using Local Operations and Classical Communication
• Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
• Distinguishability of Quantum States by Separable Operations
• A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs
• A fidelity measure for quantum channels
• Distinguishability of Quantum States by Positive Operator-Valued Measures with Positive Partial Transpose
• Quantum Circuits with Mixed States
• Quantum state discrimination: a geometric approach
• Quantum Neural Network Classifiers: A Tutorial
• When do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?
• On the natural gradient for variational quantum eigensolver
• Unambiguous discrimination among oracle operators
• Approximate Quantum Circuit Synthesis using Block-Encodings
• Operational applications of the diamond norm and related measures in quantifying the non-physicality of quantum maps
• Parallel distinguishability of quantum operations
• Exact Quantum Search by Parallel Unitary Discrimination Schemes
• Distinguishability, classical information of quantum operations
• Equivalence determination of unitary operations
• Local Unambiguous Discrimination with Remaining Entanglement
• Optimal Perfect Distinguishability between Unitaries and Quantum Operations
• Estimating Jones polynomials is a complete problem for one clean qubit
• Ancilla-Assisted Discrimination of Quantum Gates

Cited by in corpus (2)

• Cross-Platform Verification in Quantum Networks
• Quantum Wasserstein distance between unitary operations