Time-Efficient Qudit Gates through Incremental Pulse Re-seeding

Abstract

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 Re-seeding, 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. 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.

References in corpus (6)

• Charge insensitive qubit design derived from the Cooper pair box
• A universal qudit quantum processor with trapped ions
• Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
• Asymptotic Improvements to Quantum Circuits via Qutrits
• Optimal Control of Closed Quantum Systems via B-Splines with Carrier Waves
• Cross-resonance interactions between superconducting qubits with variable detuning

Cited by in corpus (2)

• Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
• Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication Reduction