Exact Solutions of Holonomic Quantum Computation
classification
🪐 quant-ph
keywords
computationexactholonomicquantumsolutionsanalyzedarbitrarycircle
read the original abstract
Holonomic quantum computation is analyzed from geometrical viewpoint. We develop an optimization scheme in which an arbitrary unitary gate is implemented with a small circle in a complex projective space. Exact solutions for the Hadamard, CNOT and 2-qubit discrete Fourier transform gates are explicitly constructed.
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.