Fast binomial-code holonomic quantum computation with ultrastrong light-matter coupling

TL;DR

This paper introduces a fast, resource-efficient protocol for holonomic quantum computation using bosonic binomial codes in ultrastrong light-matter coupling systems, achieving high fidelity and fault tolerance within tens of nanoseconds.

Contribution

It presents a novel nonadiabatic holonomic quantum computation protocol utilizing binomial codes and shortcuts-to-adiabaticity in ultrastrong coupling regimes, significantly reducing gate times and enhancing noise robustness.

Findings

Gate time reduced to ~35 ns

Achieves >98% fidelity with realistic parameters

Protocol is robust against control noise

Abstract

We propose a protocol for bosonic binomial-code nonadiabatic holonomic quantum computation in a system composed of an artificial atom ultrastrongly coupled to a cavity resonator. In our protocol, the binomial codes, formed by superpositions of Fock states, can greatly save physical resources to correct errors in quantum computation. We apply to the system strong driving fields designed by shortcuts-to-adiabatic methods. This reduces the gate time to tens of nanoseconds. Decoherence of the system accumulated over time can be effectively reduced by such a fast evolution. Noise induced by control imperfections can be suppressed by a systematic-error-sensitivity nullification method, thus the protocol is mostly insensitive to such noises. As a result, this protocol can rapidly ($\sim 35$ ns) generate fault-tolerant and high-fidelity ($\gtrsim 98\%$ with experimentally realistic parameters) quantum gates.