Time-Efficient Qudit Gates through Incremental Pulse Re-seeding
arXiv:2206.14975 · doi:10.1109/QCE53715.2022.00051
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 (13)
- Quantum Computing in the NISQ era and beyond
- Charge insensitive qubit design derived from the Cooper pair box
- Procedure for systematically tuning up crosstalk in the cross resonance gate
- A universal qudit quantum processor with trapped ions
- Effective Hamiltonian models of the cross-resonance gate
- Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
- Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
- Computational speed-up in a single qudit NMR quantum information processor
- Computational speed-up with a single qudit
- Asymptotic Improvements to Quantum Circuits via Qutrits
- Discrete Adjoints for Accurate Numerical Optimization with Application to Quantum Control
- Optimal Control of Closed Quantum Systems via B-Splines with Carrier Waves
- Cross-resonance interactions between superconducting qubits with variable detuning