Time-Efficient Qudit Gates through Incremental Pulse Re-seeding

Conference · Tue Nov 22 04:00:00 EST 2022 · 2022 IEEE International Conference on Quantum Computing and Engineering (QCE)

DOI:https://doi.org/10.1109/qce53715.2022.00051· OSTI ID:1986251

Seifert, Lennart Maximilian ^[1]; Chadwick, Jason ^[2]; Litteken, Andrew ^[3]; Chong, Frederic T. ^[3]; Baker, Jonathan M. ^[3]

---

1. University of Chicago, IL (United States); The University of Chicago
2. Carnegie Mellon University, Pittsburgh, PA (United States)
3. University of Chicago, IL (United States)

Current efforts to build quantum computers focus mainly on the two-state qubit, which often involves suppressing readily-available higher states. In this work, we break this abstraction and synthesize short-duration control pulses for gates on generalized d-state qudits. We present Incremental Pulse Reseeding, a practical scheme to guide optimal control software to the lowest-duration pulse by iteratively seeding the optimizer with previous results. We find a near-linear relationship between Hilbert space dimension and gate duration through explicit pulse optimization for one- and two-qudit gates on transmons. Furthermore, our results suggest that qudit operations are much more efficient than previously expected in the practical regime of interest and have the potential to significantly increase the computational power of current hardware.

• Research Organization: University of Chicago, IL (United States)
• Sponsoring Organization: USDOE Office of Science (SC)
• DOE Contract Number: SC0020331
• OSTI ID: 1986251
• Conference Information: Journal Name: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE)
• Country of Publication: United States
• Language: English

Related Subjects

pulse synthesis
quantum computing
quantum optimal control
qudit