Fast binomial-code holonomic quantum computation with ultrastrong light-matter coupling
| Autor: | Ye-Hong Chen, Franco Nori, Xin Wang, Roberto Stassi, Wei Qin |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Physics
Artificial atoms Correct error Driving field Error sensitivity Holonomic quantum computation Light-matter coupling Non-adiabatic Physical resources Protocol cans Superposition of fock state Quantum Physics Binomial (polynomial) Holonomic FOS: Physical sciences Coupling (probability) Fock space Resonator Quantum gate Quantum mechanics Code (cryptography) Quantum Physics (quant-ph) Quantum computer |
| Popis: | 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. 15 pages, 7 figures, the manuscript has been accepted for publication as a Regular Article in Physical Review Research |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|