Pith. sign in

REVIEW

Error metric for non-trace-preserving quantum operations

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 2110.02290 v5 pith:WAOWT43K submitted 2021-10-05 quant-ph

Error metric for non-trace-preserving quantum operations

classification quant-ph
keywords quantummetricerroroperationserrorsnon-trace-preservingcomputingdistance
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study the problem of measuring errors in non-trace-preserving quantum operations, with a focus on their impact on quantum computing. We propose an error metric that efficiently provides an upper bound on the trace distance between the normalized output states from imperfect and ideal operations, while remaining compatible with the diamond distance. As a demonstration of its application, we apply our metric in the analysis of a lossy beam splitter and a nondeterministic conditional sign-flip gate, two primary non-trace-preserving operations in the Knill-Laflamme-Milburn protocol. We then turn to the leakage errors of neutral-atom quantum computers, finding that these errors scale worse than previously anticipated, implying a more stringent fault-tolerant threshold. We also assess the quantum Zeno gate's error using our metric. In a broader context, we discuss the potential of our metric to analyze general postselected protocols, where it can be employed to study error propagation and estimate thresholds in fault-tolerant quantum computing. The results highlight the critical role of our proposed error metric in understanding and addressing challenges in practical quantum information processing.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.