Bulletin of the American Physical Society
53rd Annual Meeting of the APS Division of Atomic, Molecular and Optical Physics
Volume 67, Number 7
Monday–Friday, May 30–June 3 2022; Orlando, Florida
Session Q07: New Frontiers for Quantum Computing with Trapped Ions
8:00 AM–10:00 AM,
Thursday, June 2, 2022
Room: Salon 5/6
Chair: Raghavendra Srinivas, University of Oxford
Abstract: Q07.00007 : Comparing Two-Qubit and Multi-Qubit Gates within the Toric Code
9:12 AM–9:24 AM
Presenter:
David Schwerdt
(Weizmann Institute of Science)
Authors:
David Schwerdt
(Weizmann Institute of Science)
Yotam Shapira
(Weizmann Institute of Science)
Tom Manovitz
(Weizmann Institute of Science)
Roee Ozeri
(Weizman Insitute)
We focus on the toric code, and study its performance when using either two-qubit or five-qubit gates [1]. While using five-qubit gates dramatically reduces the number of required operations, these gates may also be more susceptible to error. Because of this trade-off, it is hard to predict which method yields better results.
We simulate the toric code using both methods and extract the fault tolerance (FT) threshold in each case. We show that using five-qubit gates offers an approximately 40% improvement in the FT threshold over the standard two-qubit gate method. Moreover, the former gives a 3.7 times improvement in logical error rates at low physical error probabilities. These results indicate an advantage of using multi-qubit gates in the context of QEC.
[1] D. Schwerdt et al. PRA (2022, accepted)
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2024 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700