Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
88 tokens/sec
Gemini 2.5 Pro Premium
46 tokens/sec
GPT-5 Medium
16 tokens/sec
GPT-5 High Premium
17 tokens/sec
GPT-4o
95 tokens/sec
DeepSeek R1 via Azure Premium
90 tokens/sec
GPT OSS 120B via Groq Premium
461 tokens/sec
Kimi K2 via Groq Premium
212 tokens/sec
2000 character limit reached

A short note on the 0-fidelity (2109.09629v1)

Published 20 Sep 2021 in quant-ph

Abstract: A recent article introduced a hierarchy of quantities called $k$-fidelities that approximate the quantum process fidelity with increasing accuracy. The lowest approximation in this hiearchy is the $0$-fidelity. The authors gave a protocol for estimating the $0$-fidelity and showed numerical evidence that it approximates the process fidelity. In this note, we prove lower and upper bounds on the process fidelity as linear functions of the 0-fidelity. By solving a semidefinite program, we provide evidence that the lower bound is tight.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)