Quick Navigation
Topics
Trapped Ion Quantum Computing
Superconducting Qubits
Geometrical Formalism for Dynamically Corrected Gates in Multiqubit Systems
arXiv
Authors: Donovan Buterakos, Sankar Das Sarma, Edwin Barnes
Year
2020
Paper ID
21833
Status
Preprint
Abstract Read
~2 min
Abstract Words
181
Citations
N/A
Abstract
The ability to perform gates in multiqubit systems that are robust to noise is of crucial importance for the advancement of quantum information technologies. However, finding control pulses that cancel noise while performing a gate is made difficult by the intractability of the time-dependent Schrodinger equation, especially in multiqubit systems. Here, we show that this issue can be sidestepped by using a formalism in which the cumulative error during a gate is represented geometrically as a curve in a multi-dimensional Euclidean space. Cancellation of noise errors to leading order corresponds to closure of the curve, a condition that can be satisfied without solving the Schrodinger equation. We develop and uncover general properties of this geometric formalism, and derive a recursion relation that maps control fields to curvatures for Hamiltonians of arbitrary dimension. We demonstrate examples by using the geometric method to design dynamically corrected gates for a class of two-qubit Hamiltonians that is relevant for both superconducting transmon qubits and semiconductor spin qubits. We propose this geometric formalism as a general technique for pulse-induced error suppression in quantum computing gate operations.
Why This Paper Matters
- This paper contributes to the Superconducting Qubits research area in the Quantum Articles archive.
- It adds a 2020 reference point for readers tracking recent quantum research.
- The ability to perform gates in multiqubit systems that are robust to noise is of crucial importance for the advancement of quantum information technologies.
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.