Time-Efficient Qudit Gates through Incremental Pulse Re-seeding
- University of Chicago, IL (United States)
- Carnegie Mellon University, Pittsburgh, PA (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
- Journal Information:
- 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), Conference: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), Broomfield, CO (United States), 18-23 Sep 2022
- Country of Publication:
- United States
- Language:
- English
Similar Records
Let Each Quantum Bit Choose Its Basis Gates
Reinforcement learning pulses for transmon qubit entangling gates