Pith. sign in

REVIEW 2 cited by

Simplest fidelity-estimation method for graph states with depolarizing noise

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.10952 v2 pith:7UMHRQMO submitted 2023-04-21 quant-ph

classification quant-ph
keywords noisegraphstatesbit-fliperrormethoddepolarizingphase-flip
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph states are entangled states useful for several quantum information processing tasks such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more essential to devise efficient methods estimating the fidelity between the ideal graph state and an experimentally-realized actual state. Any efficient fidelity-estimation method, in general, must use multiple experimental settings, i.e., needs to switch between at least two measurements. Recently, it has been shown that a single measurement is sufficient if the noise can be modeled as the phase-flip error. Since the bit-flip error should also occur in several experiments, it is desired to extend this simplest method to noise models that include phase and bit-flip errors. However, it seems to be nontrivial because their result strongly depends on properties of the phase-flip error. In this paper, by analyzing effects of the bit-flip error on stabilizer operators of graph states, we achieve the extension to the depolarizing noise, which is a major noise model including phase and bit-flip errors. We also numerically evaluate our simplest method for noise models interpolating between the phase-flip and depolarizing noises.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Detecting entanglement from few partial transpose moments and their decay via weight enumerators

    quant-ph 2026-04 accept novelty 6.5 of 10

    Any three PT moments of orders k<l<m certify NPT entanglement if p_l > p_k^x p_m^{1-x}, and Stieltjes-m equals PPT when ρ^Γ has at most (m+1)/2 distinct eigenvalues.

  2. Detecting entanglement from few partial transpose moments and their decay via weight enumerators

    quant-ph 2026-04 unverdicted novelty 6.0 of 10

    Entanglement is certified if any three PT moments satisfy p_l > p_k^x p_m^{1-x} with x=(m-l)/(m-k), and quantum weight enumerators describe moment decay under local noise.

Pith tools