Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2309.10565

A Simplified Expression for Quantum Fidelity

Müller, Adrian

Published Sep 19, 2023• 9 citations
arXivHTMLPDF

Abstract

Quantum fidelity is one of the most important measures of similarity between mixed quantum states. However, the usual formulation is cumbersome and hard to understand when encountering the first time. This work shows in a novel, elegant proof that the expression can be rewritten into a form, which is not only more concise but also makes its symmetry property more obvious. Further, the simpler expression gives rise to a formulation that is subsequently shown to be more computationally efficient than the best previous methods by avoiding any full decomposition. Future work might look for ways in which other theorems could be affected or utilize the reformulation where fidelity is the computational bottleneck.

DOI
10.48550/arxiv.2309.10565

Related papers

Improved graph formalism for quantum circuit simulation

Alexander Tianlin Hu, Andrey Boris Khesin

Improving the simulation of quantum circuits on classical computers is important for understanding quantum advantage and increasing development speed. In this paper, we explore a way to express stabilizer states and further improve the speed of simulating stabilizer circuits with a current existing approach. First, we discover a unique and elegant canonical form for stabilizer states based on graph states to better represent stabilizer states and show how to efficiently simplify stabilizer states to canonical form. Second, we develop an improved algorithm for graph state stabilizer simulation and establish limitations on reducing the quadratic runtime of applying controlled Pauli $Z$ gates. We do so by creating a simpler formula for combining two Pauli-related stabilizer states into one. Third, to better understand the linear dependence of stabilizer states, we characterize all linearly dependent triplets, revealing symmetries in the inner products. Using our controlled Pauli $Z$ algorithm, we improve runtime for inner product computation from $O({n}^{3})$ to $O(n{d}^{2})$, where $d$ is the maximum degree of the graph encountered during the calculation.

arXiv:2109.10210•Physical Review A•Feb 22, 2022•11 citations

A limit formula for the quantum fidelity

Gaetana Spedalieri, Christian Weedbrook, Stefano Pirandola

Quantum fidelity is a central tool in quantum information, quantifying how much two quantum states are similar. Here we propose a limit formula for the quantum fidelity between a mixed state and a pure state. As an example of an application, we apply this formula to the case of multimode Gaussian states, achieving a simple expression in terms of their first and second-order statistical moments.

arXiv:1204.2473•Journal of Physics A Mathematical and Theoretical•Dec 12, 2012•32 citations

Quantum fidelity measures for mixed states

Yeong-Cherng Liang, Yu-Hao Yeh, Paulo E. M. F. Mendonça +3 more

Applications of quantum technology often require fidelities to quantify performance. These provide a fundamental yardstick for the comparison of two quantum states. While this is straightforward in the case of pure states, it is much more subtle for the more general case of mixed quantum states often found in practice. A large number of different proposals exist. In this review, we summarize the required properties of a quantum fidelity measure, and compare them, to determine which properties each of the different measures has. We show that there are large classes of measures that satisfy all the required properties of a fidelity measure, just as there are many norms of Hilbert space operators, and many measures of entropy. We compare these fidelities, with detailed proofs of their properties. We also summarize briefly the applications of these measures in teleportation, quantum memories and quantum computers, quantum communications, and quantum phase-space simulations.

arXiv:1810.08034•Reports on Progress in Physics•Apr 25, 2019•203 citations

Demystifying Quantum Gate Fidelity for Electronics Engineers

M. Borgarino, Alessandro Badiali

The implementation of quantum gates by means of microwave cryo-RFICs controlling qubits is a promising path toward scalable quantum processors. Quantum gate fidelity quantifies how well an actual quantum gate produces a quantum state close to the desired ideal one. Regrettably, the literature usually reports on quantum gate fidelity in a highly theoretical way, making it hard for RFIC designers to understand. This paper explains quantum gate fidelity by moving from Shannon’s concept of fidelity and proposing a detailed mathematical proof of a valuable integral formulation of quantum gate fidelity. Shannon’s information theory and the simple mathematics adopted for the proof are both expected to be in the background of electronics engineers. By using Shannon’s fidelity, this paper rationalizes the integral formulation of quantum gate fidelity. Because of the simple mathematics adopted, this paper also demystifies to electronics engineers how this integral formulation can be reduced to a more practical algebraic product matrix. This paper makes evident the practical utility of this matrix formulation by applying it to the specific examples of one- and two-qubit quantum gates. Moreover, this paper also compares mixed states, entanglement fidelity, and the error rate’s upper bound.

Applied Sciences•Mar 2, 2025•3 citations

Efficient fidelity estimation: alternative derivation and related applications

Diego S Starke, Marcos L. W. Basso, Jonas Maziero

Abstract In [Phys. Rev. A 107 012427 (2023)], Baldwin and Jones prove that Uhlmann–Jozsa’s fidelity between two quantum states ρ and σ, i.e., F ( ρ , σ ) ≔ Tr ρ σ ρ 2 , can be written in a simplified form as F ( ρ , σ ) = Tr ρ σ 2 . In this article, we give an alternative proof of this result, using a function power series expansion and the properties of the trace function. Our approach not only reinforces the validity of the simplified expression but also facilitates the exploration of novel dissimilarity functions for quantum states and more complex trace functions of density operators.

arXiv:2312.12438•Communications in Theoretical Physics•Jun 10, 2024•3 citations

Efficient algorithm for fidelity estimation of two quantum states

Anumita Mukhopadhyay, Shibdas Roy, Arun Kumar Pati

The fidelity estimation between two quantum states is crucial for quantum computation and information science. However, an efficacious method for this, especially for mixed states and higher-dimensional density matrices, remains elusive. While there are many existing algorithms on computing the fidelity between two pure states, there is not much work on how to obtain the fidelity between two mixed states. Here, an efficient quantum algorithm for the fidelity estimation is proposed, based primarily on the density matrix exponentiation and interferometeric scheme for mixed states, with a time complexity of $O(κ^2N^2/ε^7)$, where $N$ is the system size, $κ$ is the larger of the condition number of the density matrices and $ε$ is a precision error. This algorithm may serve as a resource-efficient technique to deduce fidelity of any two (pure or mixed) unknown or known quantum states, when the density matrices of the quantum states commute with each other.

quant-pharXiv:2511.13383•Advanced Quantum Technologies•Nov 18, 2025•0 citations
Quantum fidelity is one of the most important measures of similarity between mixed quantum states. However, the usual formulation is cumbersome and hard to understand when encountering the first time. This work shows in a novel, elegant proof that the expression can be rewritten into a form, which is not only more concise but also makes its symmetry property more obvious. Further, the simpler expression gives rise to a formulation that is subsequently shown to be more computationally efficient than the best previous methods by avoiding any full decomposition. Future work might look for ways in which other theorems could be affected or utilize the reformulation where fidelity is the computational bottleneck.
Improving the simulation of quantum circuits on classical computers is important for understanding quantum advantage and increasing development speed. In this paper, we explore a way to express stabilizer states and further improve the speed of simulating stabilizer circuits with a current existing approach. First, we discover a unique and elegant canonical form for stabilizer states based on graph states to better represent stabilizer states and show how to efficiently simplify stabilizer states to canonical form. Second, we develop an improved algorithm for graph state stabilizer simulation and establish limitations on reducing the quadratic runtime of applying controlled Pauli ZZZ gates. We do so by creating a simpler formula for combining two Pauli-related stabilizer states into one. Third, to better understand the linear dependence of stabilizer states, we characterize all linearly dependent triplets, revealing symmetries in the inner products. Using our controlled Pauli ZZZ algorithm, we improve runtime for inner product computation from O(n3)O({n}^{3})O(n3) to O(nd2)O(n{d}^{2})O(nd2), where ddd is the maximum degree of the graph encountered during the calculation.
Applications of quantum technology often require fidelities to quantify performance. These provide a fundamental yardstick for the comparison of two quantum states. While this is straightforward in the case of pure states, it is much more subtle for the more general case of mixed quantum states often found in practice. A large number of different proposals exist. In this review, we summarize the required properties of a quantum fidelity measure, and compare them, to determine which properties each of the different measures has. We show that there are large classes of measures that satisfy all the required properties of a fidelity measure, just as there are many norms of Hilbert space operators, and many measures of entropy. We compare these fidelities, with detailed proofs of their properties. We also summarize briefly the applications of these measures in teleportation, quantum memories and quantum computers, quantum communications, and quantum phase-space simulations.
The implementation of quantum gates by means of microwave cryo-RFICs controlling qubits is a promising path toward scalable quantum processors. Quantum gate fidelity quantifies how well an actual quantum gate produces a quantum state close to the desired ideal one. Regrettably, the literature usually reports on quantum gate fidelity in a highly theoretical way, making it hard for RFIC designers to understand. This paper explains quantum gate fidelity by moving from Shannon’s concept of fidelity and proposing a detailed mathematical proof of a valuable integral formulation of quantum gate fidelity. Shannon’s information theory and the simple mathematics adopted for the proof are both expected to be in the background of electronics engineers. By using Shannon’s fidelity, this paper rationalizes the integral formulation of quantum gate fidelity. Because of the simple mathematics adopted, this paper also demystifies to electronics engineers how this integral formulation can be reduced to a more practical algebraic product matrix. This paper makes evident the practical utility of this matrix formulation by applying it to the specific examples of one- and two-qubit quantum gates. Moreover, this paper also compares mixed states, entanglement fidelity, and the error rate’s upper bound.
Abstract In [Phys. Rev. A 107 012427 (2023)], Baldwin and Jones prove that Uhlmann–Jozsa’s fidelity between two quantum states ρ and σ, i.e., F ( ρ , σ ) ≔ Tr ρ σ ρ 2 , can be written in a simplified form as F ( ρ , σ ) = Tr ρ σ 2 . In this article, we give an alternative proof of this result, using a function power series expansion and the properties of the trace function. Our approach not only reinforces the validity of the simplified expression but also facilitates the exploration of novel dissimilarity functions for quantum states and more complex trace functions of density operators.
The fidelity estimation between two quantum states is crucial for quantum computation and information science. However, an efficacious method for this, especially for mixed states and higher-dimensional density matrices, remains elusive. While there are many existing algorithms on computing the fidelity between two pure states, there is not much work on how to obtain the fidelity between two mixed states. Here, an efficient quantum algorithm for the fidelity estimation is proposed, based primarily on the density matrix exponentiation and interferometeric scheme for mixed states, with a time complexity of O(κ2N2/ε7)O(κ^2N^2/ε^7)O(κ2N2/ε7), where NNN is the system size, κκκ is the larger of the condition number of the density matrices and εεε is a precision error. This algorithm may serve as a resource-efficient technique to deduce fidelity of any two (pure or mixed) unknown or known quantum states, when the density matrices of the quantum states commute with each other.