English

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

Quantum Physics 2021-09-29 v3

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 (35\sim 35 ns) generate fault-tolerant and high-fidelity (98%\gtrsim 98\% with experimentally realistic parameters) quantum gates.

Keywords

Cite

@article{arxiv.2012.06090,
  title  = {Fast binomial-code holonomic quantum computation with ultrastrong light-matter coupling},
  author = {Ye-Hong Chen and Wei Qin and Roberto Stassi and Xin Wang and Franco Nori},
  journal= {arXiv preprint arXiv:2012.06090},
  year   = {2021}
}

Comments

15 pages, 7 figures, the manuscript has been accepted for publication as a Regular Article in Physical Review Research

R2 v1 2026-06-23T20:53:29.828Z