Estimating distinguishability measures on quantum computers

Abstract

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. 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 many of these algorithms by using a variational approach with parameterized quantum circuits. We find that the simulations converge well in both the noiseless and noisy scenarios, for all examples considered. Furthermore, the noisy simulations exhibit a parameter noise resilience. Finally, we establish a strong relationship between various quantum computational complexity classes and distance estimation problems.

arXiv commentv4: 45 pages, 17 figures, accepted for publication in Physical Review A

References in corpus (53)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Noisy intermediate-scale quantum (NISQ) algorithms
• Strengths and Weaknesses of Quantum Computing
• Quantum fingerprinting
• On quantum Renyi entropies: a new generalization and some properties
• The operational meaning of min- and max-entropy
• Distance measures to compare real and ideal quantum processes
• Theoretical framework for quantum networks
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• From Classical to Quantum Shannon Theory
• Universal Quantum Estimator
• Direct estimations of linear and non-linear functionals of a quantum state
• Distinguishability and Accessible Information in Quantum Theory
• Noise Resilience of Variational Quantum Compiling
• The SWAP test and the Hong-Ou-Mandel effect are equivalent
• Memory effects in quantum channel discrimination
• NP-complete Problems and Physical Reality
• Variational Quantum Fidelity Estimation
• Approaches for approximate additivity of the Holevo information of quantum channels
• On the strong converses for the quantum channel capacity theorems
• Fundamental bound on the reliability of quantum information transmission
• Principles of Quantum Communication Theory: A Modern Approach
• Resource theory of asymmetric distinguishability for quantum channels
• Minimum-error discrimination between mixed quantum states
• Localized closed timelike curves can perfectly distinguish quantum states
• Fidelity of recovery, geometric squashed entanglement, and measurement recoverability
• Entanglement spectroscopy with a depth-two quantum circuit
• Geometric distinguishability measures limit quantum channel estimation and discrimination
• On a measure of distance for quantum strategies
• Quantum Algorithm for Fidelity Estimation
• Quantum Proofs
• Fundamental limits on the capacities of bipartite quantum interactions
• Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
• Quantum state cloning using Deutschian closed timelike curves
• A lower bound on the probability of error in quantum state discrimination
• Open timelike curves violate Heisenberg's uncertainty principle
• Quantum Mixed State Compiling
• On the modified logarithmic Sobolev inequality for the heat-bath dynamics for 1D systems
• Variational quantum algorithms to estimate rank, quantum entropies, fidelity and Fisher information via purity minimization
• Learning unknown pure quantum states
• Operational meaning of quantum measures of recovery
• Quantum interactive proofs and the complexity of separability testing
• Parallel approximation of min-max problems
• Replicating the benefits of closed timelike curves without breaking causality
• Closed Timelike Curves Make Quantum and Classical Computing Equivalent
• Symmetric distinguishability as a quantum resource
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
• Evaluating the Advantage of Adaptive Strategies for Quantum Channel Distinguishability
• Computational Distinguishability of Quantum Channels
• Quantum Noise Sensing by generating Fake Noise

Cited by in corpus (18)

• New Quantum Algorithms for Computing Quantum Entropies and Distances
• Fast Quantum Algorithms for Trace Distance Estimation
• Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems
• Quantum Neural Estimation of Entropies
• Testing symmetry on quantum computers
• Variational quantum state discriminator for supervised machine learning
• Subsystem distances between quasiparticle excited states
• Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
• Trace distance between fermionic Gaussian states from a truncation method
• QSlack: A slack-variable approach for variational quantum semi-definite programming
• Multivariate Fidelities
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
• Efficient quantum algorithms for testing symmetries of open quantum systems
• Quantum Computational Complexity and Symmetry
• Quantum distinguishability measures: projectors vs. states maximization
• Quantum Lower Bounds by Sample-to-Query Lifting
• Quantum Circuit Unoptimization
• Riemannian-geometric generalizations of quantum fidelities and Bures-Wasserstein distance