Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Time-Efficient Qudit Gates through Incremental Pulse Re-seeding

Conference · · 2022 IEEE International Conference on Quantum Computing and Engineering (QCE)
 [1];  [2];  [1];  [1];  [1]
  1. University of Chicago, IL (United States)
  2. 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

References (18)

Completely positive dynamical semigroups of N-level systems journal January 1976
Generalization of the Bernstein–Vazirani algorithm beyond qubit systems journal May 2019
Quantum Key Distribution Protocol Based on Modified Generalization of Deutsch-Jozsa Algorithm in d-level Quantum System journal October 2018
Effective Hamiltonian models of the cross-resonance gate journal May 2020
Quantum Computing in the NISQ era and beyond journal August 2018
Factoring with qutrits: Shor's algorithm on ternary and metaplectic quantum architectures journal July 2017
Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithms journal February 2005
Computational speed-up with a single qudit journal October 2015
Charge-insensitive qubit design derived from the Cooper pair box journal October 2007
Asymptotic improvements to quantum circuits via qutrits
  • Gokhale, Pranav; Baker, Jonathan M.; Duckering, Casey
  • ISCA '19: The 46th Annual International Symposium on Computer Architecture, Proceedings of the 46th International Symposium on Computer Architecture https://doi.org/10.1145/3307650.3322253
conference June 2019
Fault-Tolerant Quantum Computation with Higher-Dimensional Systems book January 1999
On the generators of quantum dynamical semigroups journal June 1976
Procedure for systematically tuning up cross-talk in the cross-resonance gate journal June 2016
Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
  • Shi, Yunong; Leung, Nelson; Gokhale, Pranav
  • ASPLOS '19: Architectural Support for Programming Languages and Operating Systems, Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems https://doi.org/10.1145/3297858.3304018
conference April 2019
Constructing All Qutrit Controlled Clifford+T gates in Clifford+T book January 2022
Fully microwave-tunable universal gates in superconducting qubits with linear couplings and fixed transition frequencies journal April 2010
Quantum optimal control for pure-state preparation using one initial state journal December 2021
Efficient Quantum Circuit Decompositions via Intermediate Qudits conference November 2020

Similar Records

Benchmarking the algorithmic reach of a high-Q cavity qudit
Journal Article · 2024 · TBD · OSTI ID:2440224

Let Each Quantum Bit Choose Its Basis Gates
Conference · 2022 · 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO) · OSTI ID:1986254

Reinforcement learning pulses for transmon qubit entangling gates
Journal Article · 2024 · Machine Learning: Science and Technology · OSTI ID:2403309