Quick Navigation
Topics
Trapped Ion Quantum Computing
Superconducting Qubits
Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
arXiv
Authors: C. Figgatt, A. Ostrander, N. M. Linke, K. A. Landsman, D. Zhu, D. Maslov, C. Monroe
Year
2018
Paper ID
23753
Status
Preprint
Abstract Read
~2 min
Abstract Words
201
Citations
N/A
Abstract
The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear efficiency gains in numerous quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, quantum gate parallelism is essential for the practical fault-tolerant error correction of qubits that suffer from idle errors. The implementation of parallel quantum gates is complicated by potential crosstalk, especially between qubits fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions or cavity-coupled superconducting transmons. Here, we present the first experimental results for parallel 2-qubit entangling gates in an array of fully-connected trapped ion qubits. We demonstrate an application of this capability by performing a 1-bit full addition operation on a quantum computer using a depth-4 quantum circuit. These results exploit the power of highly connected qubit systems through classical control techniques, and provide an advance toward speeding up quantum circuits and achieving fault tolerance with trapped ion quantum computers.
Why This Paper Matters
- This paper contributes to the Superconducting Qubits research area in the Quantum Articles archive.
- It adds a 2018 reference point for readers tracking recent quantum research.
- The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations.
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.