pith. sign in

arxiv: 2310.20108 · v1 · pith:R4W2SJKXnew · submitted 2023-10-31 · 🪐 quant-ph · cond-mat.supr-con

Fast elementary gates for universal quantum computation with Kerr parametric oscillator qubits

classification 🪐 quant-ph cond-mat.supr-con
keywords gatesquantumelementarykposmethodsqubitsadiabaticcomputation
0
0 comments X
read the original abstract

Kerr parametric oscillators (KPOs) can stabilize the superpositions of coherent states, which can be utilized as qubits, and are promising candidates for realizing hardware-efficient quantum computers. Although elementary gates for universal quantum computation with KPO qubits have been proposed, these gates are usually based on adiabatic operations and thus need long gate times, which result in errors caused by photon loss in KPOs realized by, e.g., superconducting circuits. In this work, we accelerate the elementary gates by experimentally feasible control methods, which are based on numerical optimization of pulse shapes for shortcuts to adiabaticity. By numerical simulations, we show that the proposed methods can achieve speedups compared to adiabatic ones by up to six times with high gate fidelities of 99.9%. These methods are thus expected to be useful for quantum computers with KPOs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.