Variational Quantum Fidelity Estimation

Abstract

Computing quantum state fidelity will be important to verify and characterize states prepared on a quantum computer. In this work, we propose novel lower and upper bounds for the fidelity $F(\rho ,\sigma )$ based on the "truncated fidelity" $F({\rho }_m,\sigma )$, which is evaluated for a state ${\rho }_m$ obtained by projecting $\rho$ onto its $m$-largest eigenvalues. Our bounds can be refined, i.e., they tighten monotonically with $m$. To compute our bounds, we introduce a hybrid quantum-classical algorithm, called Variational Quantum Fidelity Estimation, that involves three steps: (1) variationally diagonalize $\rho$, (2) compute matrix elements of $\sigma$ in the eigenbasis of $\rho$, and (3) combine these matrix elements to compute our bounds. Our algorithm is aimed at the case where $\sigma$ is arbitrary and $\rho$ is low rank, which we call low-rank fidelity estimation, and we prove that a classical algorithm cannot efficiently solve this problem. Finally, we demonstrate that our bounds can detect quantum phase transitions and are often tighter than previously known computable bounds for realistic situations.

arXiv comment6 + 8 pages, 4 figures

References in corpus (28)

• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• The theory of variational hybrid quantum-classical algorithms
• Entanglement Spectrum as a Generalization of Entanglement Entropy: Identification of Topological Order in Non-Abelian Fractional Quantum Hall Effect States
• On the Power of One Bit of Quantum Information
• Distance measures to compare real and ideal quantum processes
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• From Classical to Quantum Shannon Theory
• Quantum-assisted quantum compiling
• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• Maximum Likelihood, Minimum Effort
• Duality Between Smooth Min- and Max-Entropies
• Mixed-state fidelity and quantum criticality at finite temperature
• Variational Quantum State Diagonalization
• The SWAP test and the Hong-Ou-Mandel effect are equivalent
• Quantum fidelity measures for mixed states
• Quantum circuits for strongly correlated quantum systems
• Systematic errors in current quantum state tomography tools
• Alternative fidelity measure for quantum states
• Quantum Fidelity and Thermal Phase Transitions
• Variational Consistent Histories as a Hybrid Algorithm for Quantum Foundations
• Impossibility of Classically Simulating One-Clean-Qubit Computation
• Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
• Hardness of classically sampling one clean qubit model with constant total variation distance error
• Direct method for measuring of purity, superfidelity, and subfidelity of photonic two-qubit mixed states
• Bound on trace distance based on superfidelity
• Bound entangled states fit for robust experimental verification
• Uhlmann fidelities from tensor networks

Cited by in corpus (75)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Hybrid quantum-classical algorithms and quantum error mitigation
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Effect of barren plateaus on gradient-free optimization
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Real- and imaginary-time evolution with compressed quantum circuits
• Variational Quantum Linear Solver
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Fundamental limits of quantum error mitigation
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Variational Quantum State Eigensolver
• Barren plateaus preclude learning scramblers
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Machine learning of noise-resilient quantum circuits
• Quantum Machine Learning in High Energy Physics
• Evaluating the noise resilience of variational quantum algorithms
• Variational Quantum Algorithm for Estimating the Quantum Fisher Information
• Thermofield dynamics: Quantum Chaos versus Decoherence
• Variational Quantum Singular Value Decomposition
• Reformulation of the No-Free-Lunch Theorem for Entangled Data Sets
• Noise-Assisted Quantum Autoencoder
• The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
• Direct Fidelity Estimation of Quantum States using Machine Learning
• Detecting and quantifying entanglement on near-term quantum devices
• Quantum Algorithm for Fidelity Estimation
• Practical distributed quantum information processing with LOCCNet
• Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
• New Quantum Algorithms for Computing Quantum Entropies and Distances
• Estimating distinguishability measures on quantum computers
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• Quantum Mixed State Compiling
• Sub-Quantum Fisher Information
• Variational Quantum Linear Solver with Dynamic Ansatz
• Localization Driven Quantum Sensing
• Retrieving information from a black hole using quantum machine learning
• Variational quantum algorithms to estimate rank, quantum entropies, fidelity and Fisher information via purity minimization
• Fast Quantum Algorithms for Trace Distance Estimation
• Wishart and random density matrices: Analytical results for the mean-square Hilbert-Schmidt distance
• A Variational Approach to the Quantum Separability Problem
• Accelerated variational quantum eigensolver with joint Bell measurement
• Mitigating algorithmic errors in quantum optimization through energy extrapolation
• Enhanced estimation of quantum properties with common randomized measurements
• Generalized Measure of Quantum Fisher Information
• QuEst: Graph Transformer for Quantum Circuit Reliability Estimation
• Fast optimization of parametrized quantum optical circuits
• Variational Quantum Cloning: Improving Practicality for Quantum Cryptanalysis
• Jarzynski-like Equality of Nonequilibrium Information Production Based on Quantum Cross Entropy
• Experimental Quantum Learning of a Spectral Decomposition
• Subsystem distances between quasiparticle excited states
• Detecting high-dimensional entanglement in cold-atom quantum simulators
• Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
• Enhancing variational quantum state diagonalization using reinforcement learning techniques
• Noise-adapted recovery circuits for quantum error correction
• A Continuous Variable Born Machine
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
• Trace distance between fermionic Gaussian states from a truncation method
• Mitigating Quantum Errors via Truncated Neumann Series
• Qsun: an open-source platform towards practical quantum machine learning applications
• Random density matrices: Analytical results for mean root fidelity and mean square Bures distance
• A quantum information theoretic analysis of reinforcement learning-assisted quantum architecture search
• Theory of versatile fidelity estimation with confidence
• Variational certification of quantum devices
• Random density matrices: Analytical results for mean fidelity and variance of squared Bures distance
• Quantum computing quantum Monte Carlo algorithm
• Partitioned Quantum Subspace Expansion
• Estimating many properties of a quantum state via quantum reservoir processing
• Efficient fidelity estimation: Alternative derivation and related applications
• Operation fidelity explored by numerical range of Kraus operators
• Performance Guarantees for Quantum Neural Estimation of Entropies
• Qubit frugal entanglement determination with the deep multi-scale entanglement renormalization ansatz