arrow
Return

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

delete2021-09-24
delete33
delete
OA
AI
Y
Ye‐Hong Chen
秦伟 (Wei Qin) *
R
Roberto Stassi
王信 cover
王信 (Xin Wang)
F
Franco Nori
DOI:10.1103/PhysRevResearch.3.033275delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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. Noise induced by control imperfections can be suppressed by a systematic-error-sensitivity nullification method. As a result, this protocol can rapidly (similar to 35 ns) generate fault-tolerant and high-fidelity (greater than or similar to 98% with experimentally realistic parameters) quantum gates.
Keywords:
ERROR-CORRECTION
EXPERIMENTAL REALIZATION
STATES
OPERATION
PARTICLE
GATES

Journal

Physical Review Research cover
Physical Review Research
IF:
4.2
Papers:
7.6K
Citations:
2.7W

Organization

R
riken
Scholars:
2.2W
Papers: 1.9W
Citations: 24