Quick Navigation
Topics
Quantum Algorithms
A short note on the 0-fidelity
arXiv
Authors: Karl Mayer
Year
2021
Paper ID
61416
Status
Preprint
Abstract Read
~2 min
Abstract Words
81
Citations
N/A
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.
Why This Paper Matters
- It adds a 2021 reference point for readers tracking recent quantum research.
- A recent article introduced a hierarchy of quantities called k-fidelities that approximate the quantum process fidelity with increasing accuracy.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.