Efficient algorithm for fidelity estimation of two quantum states

• URL: http://arxiv.org/abs/2511.13383v1
• Date: Mon, 17 Nov 2025 13:54:47 GMT
• Title: Efficient algorithm for fidelity estimation of two quantum states
• Authors: Anumita Mukhopadhyay, Shibdas Roy, Arun Kumar Pati,
• Abstract summary: We propose an efficient algorithm for the fidelity estimation, based primarily on the density matrix exponentiation and interferometeric scheme for mixed states.<n>Our 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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, we propose an efficient quantum algorithm for the fidelity estimation, based primarily on the density matrix exponentiation and interferometeric scheme for mixed states, with a time complexity of $O(N^2/ε^7)$, where $N$ is the system size and $ε$ is a precision error. Our 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.

Related papers

• Explicit Formulas for Estimating Trace of Reduced Density Matrix Powers via Single-Circuit Measurement Probabilities [10.43657724071918]
  We propose a universal framework to simultaneously estimate the traces of the $2$nd to the $n$th powers of a reduced density matrix.<n>We develop two algorithms: a purely quantum method and a hybrid quantum-classical approach combining Newton-Girard iteration.<n>We explore various applications including the estimation of nonlinear functions and the representation of entanglement measures.
  arXiv  Detail & Related papers  (2025-07-23T01:41:39Z)
• Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
  We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types.<n>We generate massive datasets of one trillion and one million shots, respectively.
  arXiv  Detail & Related papers  (2025-04-22T22:36:18Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Large-Scale Quantum Separability Through a Reproducible Machine Learning Lens [5.499796332553708]
  The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. We propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in large-scale scenarios.
  arXiv  Detail & Related papers  (2023-06-15T18:53:26Z)
• Fast Quantum Algorithms for Trace Distance Estimation [8.646488471216262]
  We propose efficient quantum algorithms for estimating the trace distance within additive error $varepsilon$ between mixed quantum states of rank $r$. We show that the decision version of low-rank trace distance estimation is $mathsfBQP$-complete.
  arXiv  Detail & Related papers  (2023-01-17T10:16:14Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation [7.247285982078057]
  We introduce hybrid quantum-classical algorithms for two distance measures on near-term quantum devices. First, we introduce the Variational Trace Distance Estimation (VTDE) algorithm. Second, we introduce the Variational Fidelity Estimation (VFE) algorithm.
  arXiv  Detail & Related papers  (2020-12-10T15:56:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.