Log In Sign Up

Estimating distinguishability measures on quantum computers

by   Rochisha Agarwal, et al.

The performance of a quantum information processing protocol is ultimately judged by distinguishability measures that quantify how distinguishable the actual result of the protocol is from the ideal case. The most prominent distinguishability measures are those based on the fidelity and trace distance, due to their physical interpretations. In this paper, we propose and review several algorithms for estimating distinguishability measures based on trace distance and fidelity, and we evaluate their performance using simulators of quantum computers. The algorithms can be used for distinguishing quantum states, channels, and strategies (the last also known in the literature as "quantum combs"). The fidelity-based algorithms offer novel physical interpretations of these distinguishability measures in terms of the maximum probability with which a single prover (or competing provers) can convince a verifier to accept the outcome of an associated computation. We simulate these algorithms by using a variational approach with parameterized quantum circuits and find that they converge well for the examples that we consider.


page 2

page 3

page 4

page 7

page 18

page 28

page 29

page 30


Variational Quantum Algorithms for Trace Distance and Fidelity Estimation

Estimating the difference between quantum data is crucial in quantum com...

Quantum Telecloning on NISQ Computers

Due to the no-cloning theorem, generating perfect quantum clones of an a...

Variational quantum Gibbs state preparation with a truncated Taylor series

The preparation of quantum Gibbs state is an essential part of quantum c...

Security of Quantum Key Distribution from Attacker's View

In 2005, trace distance between an ideal quantum state to be distributed...

Testing symmetry on quantum computers

Symmetry is a unifying concept in physics. In quantum information and be...

Approximate Equivalence Checking of Noisy Quantum Circuits

We study the fundamental design automation problem of equivalence checki...

Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance

Distance measures provide the foundation for many popular algorithms in ...