Recognition: unknown
Quantum computation using the Aharonov-Casher set up
classification
🪐 quant-ph
keywords
aharonov-cashercomputationquantumarguedaroundbasicblockbuilding
read the original abstract
It is argued that the Aharonov-Casher set up could be used as the basic building block for quantum computation. We demonstrate explicitly in this scenario one- and two-qubit phase shift gates that are fault tolerant to deformations of the path when encircling two sites of the computational system around each other.
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.