Testing identity of collections of quantum states: sample complexity analysis

03/26/2021
by   Marco Fanizza, et al.
0

We study the problem of testing identity of a collection of unknown quantum states given sample access to this collection, each state appearing with some known probability. We show that for a collection of d-dimensional quantum states of cardinality N, the sample complexity is O(√(N)d/ϵ^2), which is optimal up to a constant. The test is obtained by estimating the mean squared Hilbert-Schmidt distance between the states, thanks to a suitable generalization of the estimator of the Hilbert-Schmidt distance between two unknown states by Bădescu, O'Donnell, and Wright (https://dl.acm.org/doi/10.1145/3313276.3316344).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/16/2022

Optimal algorithms for learning quantum phase states

We analyze the complexity of learning n-qubit quantum phase states. A de...
research
10/28/2017

Wasserstein Identity Testing

Uniformity testing and the more general identity testing are well studie...
research
08/03/2018

Maximum likelihood quantum state tomography is inadmissible

Maximum likelihood estimation (MLE) is the most common approach to quant...
research
09/07/2022

Learning Distributions over Quantum Measurement Outcomes

Shadow tomography for quantum states provides a sample efficient approac...
research
03/02/2022

The quantum low-rank approximation problem

We consider a quantum version of the famous low-rank approximation probl...
research
07/15/2021

Improving application performance with biased distributions of quantum states

We consider the properties of a specific distribution of mixed quantum s...
research
11/10/2022

Random density matrices: Analytical results for mean fidelity and variance of squared Bures distance

One of the key issues in quantum information theory related problems con...

Please sign up or login with your details

Forgot password? Click here to reset