Fault tolerance for holonomic quantum computation
classification
🪐 quant-ph
keywords
computationholonomicinformationquantumadiabaticalongapproacharound
read the original abstract
We review an approach to fault-tolerant holonomic quantum computation on stabilizer codes. We explain its workings as based on adiabatic dragging of the subsystem containing the logical information around suitable loops along which the information remains protected.
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.