Quick Navigation
Topics
Trapped Ion Quantum Computing
Bounding the average gate fidelity of composite channels using the unitarity
arXiv
Authors: Arnaud Carignan-Dugas, Joel J. Wallman, Joseph Emerson
Year
2016
Paper ID
42889
Status
Preprint
Abstract Read
~2 min
Abstract Words
191
Citations
N/A
Abstract
There is currently a significant need for robust and efficient methods for characterizing quantum devices. While there has been significant progress in this direction, there remains a crucial need to precisely determine the strength and type of errors on individual gate operations, in order to assess and improve control as well as reliably bound the total error in a quantum circuit given some partial information about the errors on the components. In this work, we first provide an optimal bound on the total fidelity of a circuit in terms of component fidelities, which can be efficiently experimentally estimated via randomized benchmarking. We then derive a tighter bound that applies under additional information about the coherence of the error, namely, the unitarity, which can also be efficiently estimated via a related experimental protocol. This improved bound smoothly interpolates between the worst-case quadratic and best-case linear scalings for composite error channels. As an application we show how our analysis substantially improves the achievable precision on estimates of the error rates of individual gates under interleaved randomized benchmarking, enabling greater precision for current experimental methods to assess and tune-up control over quantum gate operations.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2016 reference point for readers tracking recent quantum research.
- There is currently a significant need for robust and efficient methods for characterizing quantum devices.
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.