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:2009.07741 · Entropy

Adaptive State Fidelity Estimation for Higher Dimensional Bipartite Entanglement

Jun-Yi Wu

Published Aug 12, 2020• 4 citations
arXivHTMLPDF

Abstract

An adaptive method for quantum state fidelity estimation in bipartite higher dimensional systems is established. This method employs state verifier operators which are constructed by local POVM operators and adapted to the measurement statistics in the computational basis. Employing this method, the state verifier operators that stabilize Bell-type entangled states are constructed explicitly. Together with an error operator in the computational basis, one can estimate the lower and upper bounds on the state fidelity for Bell-type entangled states in few measurement configurations. These bounds can be tighter than the fidelity bounds derived in [Bavaresco et al., Nature Physics (2018), 14, 1032-1037], if one constructs more than one local POVM measurements additional to the measurement in the computational basis.

DOI
10.3390/e22080886

Related papers

Efficient estimation of multipartite quantum coherence

Qi-Ming Ding, Xiao‐Xu Fang, Xiao Yuan +2 more

Quantification of coherence lies at the heart of quantum information processing and fundamental physics.Exact evaluation of coherence measures generally needs a full reconstruction of the density matrix, which becomes intractable for large-scale multipartite systems.Here, we propose a systematic theoretical approach to efficiently estimating lower and upper bounds of coherence in multipartite states.Under the stabilizer formalism, the lower bound is determined by the spectrum estimation method with a small number of measurements, and the upper bound is determined by a single measurement.We verify our theory with a four-qubit optical quantum system.We experimentally implement various multiqubit entangled states, including the Greenberger-Horne-Zeilinger state, the cluster state, and the W state, and show how their coherences are efficiently inferred from measuring a few observables.

arXiv:2010.02612•Physical Review Research•Jun 22, 2021•14 citations

Efficient verification of bipartite pure states

Zihao Li, Yun-Guang Han, Huangjun Zhu

We propose practical and efficient protocols for verifying bipartite pure states for any finite dimension, which can also be applied to fidelity estimation. Our protocols are based on adaptive local projective measurements with either one-way or two-way communications, which are very easy to implement in practice. They can extract the key information much more efficiently than known protocols based on tomography or direct fidelity estimation, and their efficiencies are comparable to the best protocols based on entangling measurements. These protocols highlight the significance of mutually unbiased bases and complex projective 2-designs in quantum state verification and fidelity estimation. Moreover, our protocols can be applied to the adversarial scenario, in which states are controlled by a malicious adversary. In this case, surprisingly, one of our protocols based on local measurements is even optimal among protocols without locality restriction.

arXiv:1901.09783•Physical Review A•Sep 10, 2019•57 citations

Multipartite entanglement measures via Bell-basis measurements

Jacob L. Beckey, G. Pelegrí, Steph Foulds +1 more

We show how to estimate a broad class of multipartite entanglement measures from Bell-basis measurement data. In addition to lowering the experimental requirements relative to previously known methods of estimating these measures, our proposed scheme also enables a simpler analysis of the number of measurement repetitions required to achieve an $\ensuremath{\epsilon}$-close approximation of the measures, which we provide for each. We focus our analysis on the recently introduced concentratable entanglements [Beckey et al., Phys. Rev. Lett. 127, 140501 (2021)] because many other well-known multipartite entanglement measures are recovered as special cases of this family of measures. We extend the definition of the concentratable entanglements to mixed states and show how to construct lower bounds on the mixed state concentratable entanglements that can also be estimated using only Bell-basis measurement data. Finally, we demonstrate the feasibility of our methods by classically simulating their implementation on a noisy Rydberg atom quantum computer.

arXiv:2210.02575•Physical Review A•Jun 30, 2023•17 citations

Directly estimating the fidelity of measurement-based quantum computation

David T. Stephen, Michael Foss-Feig

In measurement-based quantum computation (MBQC), quantum circuits are implemented using adaptive measurements on an entangled resource state. In practice, the resource state will always be prepared with some noise, and it is crucial to understand the effect of this noise on the operation of MBQC. Typically, one measures the fidelity of the noisy resource state with the assumption that a high fidelity state means a high fidelity computation. However, the precise relationship between these two fidelities is not known. Here, we derive an expression that equates the average fidelity of the MBQC output state to a certain correlation function evaluated on the noisy resource state. Using this expression, we show that state fidelity provides a tight lower bound on average MBQC fidelity. Conversely, we also find that state fidelity can greatly underestimate average MBQC fidelity, implying that state fidelity is not a good indicator of MBQC performance in general. In response, we formulate an efficient method to directly estimate average MBQC fidelity by measuring the aforementioned correlation function. These results therefore improve our ability to characterize noisy resource states in quantum computers and benchmark MBQC performance.

quant-pharXiv:2603.13753•Mar 17, 2026•2 citations

Entangled States of Qutrit Bipartite System

Surajit Sen, Dey, Tushar Kanti

We develop a systematic method to construct the Bell states of a qubit bipartite system while taking $SU(2)$ group as the basis group. An alternative formulation of fidelity, called $SU(2)$ fidelity, is proposed which gives the Bell-CHSH inequality. Taking analogy from the octet theory governed by the $SU(3)$ group, it is shown that the method can be easily generalized to derive all possible entangled states and the $SU(3)$ fidelity of the higher dimensional bipartite qutrit system. The properties of these states are studied which reveal the existence of some inequalities for the qutrit bipartite system.

arXiv:1911.03628•Nov 9, 2019•0 citations

Variational Quantum Fidelity Estimation

Marco Cerezo, Alexander Poremba, Łukasz Cincio +1 more

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 ( ρ , σ ) based on the ``truncated fidelity'' F ( ρ m , σ ) , which is evaluated for a state ρ m obtained by projecting ρ 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 ρ , (2) compute matrix elements of σ in the eigenbasis of ρ , and (3) combine these matrix elements to compute our bounds. Our algorithm is aimed at the case where σ is arbitrary and ρ is low rank, which we call low-rank fidelity estimation, and we prove that no classical algorithm can efficiently solve this problem under reasonable assumptions. Finally, we demonstrate that our bounds can detect quantum phase transitions and are often tighter than previously known computable bounds for realistic situations.

arXiv:1906.09253•Quantum•Mar 26, 2020•132 citations
An adaptive method for quantum state fidelity estimation in bipartite higher dimensional systems is established. This method employs state verifier operators which are constructed by local POVM operators and adapted to the measurement statistics in the computational basis. Employing this method, the state verifier operators that stabilize Bell-type entangled states are constructed explicitly. Together with an error operator in the computational basis, one can estimate the lower and upper bounds on the state fidelity for Bell-type entangled states in few measurement configurations. These bounds can be tighter than the fidelity bounds derived in [Bavaresco et al., Nature Physics (2018), 14, 1032-1037], if one constructs more than one local POVM measurements additional to the measurement in the computational basis.
Quantification of coherence lies at the heart of quantum information processing and fundamental physics.Exact evaluation of coherence measures generally needs a full reconstruction of the density matrix, which becomes intractable for large-scale multipartite systems.Here, we propose a systematic theoretical approach to efficiently estimating lower and upper bounds of coherence in multipartite states.Under the stabilizer formalism, the lower bound is determined by the spectrum estimation method with a small number of measurements, and the upper bound is determined by a single measurement.We verify our theory with a four-qubit optical quantum system.We experimentally implement various multiqubit entangled states, including the Greenberger-Horne-Zeilinger state, the cluster state, and the W state, and show how their coherences are efficiently inferred from measuring a few observables.
We propose practical and efficient protocols for verifying bipartite pure states for any finite dimension, which can also be applied to fidelity estimation. Our protocols are based on adaptive local projective measurements with either one-way or two-way communications, which are very easy to implement in practice. They can extract the key information much more efficiently than known protocols based on tomography or direct fidelity estimation, and their efficiencies are comparable to the best protocols based on entangling measurements. These protocols highlight the significance of mutually unbiased bases and complex projective 2-designs in quantum state verification and fidelity estimation. Moreover, our protocols can be applied to the adversarial scenario, in which states are controlled by a malicious adversary. In this case, surprisingly, one of our protocols based on local measurements is even optimal among protocols without locality restriction.
We show how to estimate a broad class of multipartite entanglement measures from Bell-basis measurement data. In addition to lowering the experimental requirements relative to previously known methods of estimating these measures, our proposed scheme also enables a simpler analysis of the number of measurement repetitions required to achieve an $\ensuremath{\epsilon}$-close approximation of the measures, which we provide for each. We focus our analysis on the recently introduced concentratable entanglements [Beckey et al., Phys. Rev. Lett. 127, 140501 (2021)] because many other well-known multipartite entanglement measures are recovered as special cases of this family of measures. We extend the definition of the concentratable entanglements to mixed states and show how to construct lower bounds on the mixed state concentratable entanglements that can also be estimated using only Bell-basis measurement data. Finally, we demonstrate the feasibility of our methods by classically simulating their implementation on a noisy Rydberg atom quantum computer.
In measurement-based quantum computation (MBQC), quantum circuits are implemented using adaptive measurements on an entangled resource state. In practice, the resource state will always be prepared with some noise, and it is crucial to understand the effect of this noise on the operation of MBQC. Typically, one measures the fidelity of the noisy resource state with the assumption that a high fidelity state means a high fidelity computation. However, the precise relationship between these two fidelities is not known. Here, we derive an expression that equates the average fidelity of the MBQC output state to a certain correlation function evaluated on the noisy resource state. Using this expression, we show that state fidelity provides a tight lower bound on average MBQC fidelity. Conversely, we also find that state fidelity can greatly underestimate average MBQC fidelity, implying that state fidelity is not a good indicator of MBQC performance in general. In response, we formulate an efficient method to directly estimate average MBQC fidelity by measuring the aforementioned correlation function. These results therefore improve our ability to characterize noisy resource states in quantum computers and benchmark MBQC performance.
We develop a systematic method to construct the Bell states of a qubit bipartite system while taking SU(2)SU(2)SU(2) group as the basis group. An alternative formulation of fidelity, called SU(2)SU(2)SU(2) fidelity, is proposed which gives the Bell-CHSH inequality. Taking analogy from the octet theory governed by the SU(3)SU(3)SU(3) group, it is shown that the method can be easily generalized to derive all possible entangled states and the SU(3)SU(3)SU(3) fidelity of the higher dimensional bipartite qutrit system. The properties of these states are studied which reveal the existence of some inequalities for the qutrit bipartite system.
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 ( ρ , σ ) based on the ``truncated fidelity'' F ( ρ m , σ ) , which is evaluated for a state ρ m obtained by projecting ρ 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 ρ , (2) compute matrix elements of σ in the eigenbasis of ρ , and (3) combine these matrix elements to compute our bounds. Our algorithm is aimed at the case where σ is arbitrary and ρ is low rank, which we call low-rank fidelity estimation, and we prove that no classical algorithm can efficiently solve this problem under reasonable assumptions. Finally, we demonstrate that our bounds can detect quantum phase transitions and are often tighter than previously known computable bounds for realistic situations.