Geometric and holonomic quantum gates perform transformations that only dependon the geometry of a loop covered by the parameters controlling the gate. Thesegates require adiabatic time evolution, which is achieved in the limit when the looptakes infinite time to complete. However, it is of interest to also know thetransformation properties of the gates for finite run times. It has been shown [Phys.Rev. A 73, 022327 (2006)] that some holonomic gates for a trapped ion system showrevival structures, i.e., for some finite run time the gate performs the sametransformation as it does in the adiabatic limit. The purpose of this thesis is to investigate if similar revival structures are shown alsofor geometric and holonomic quantum gates for spin...
The nonadiabatic holonomic quantum computation based on the geometric phase is robust against the bu...
Holonomic gates for quantum computation are commonly considered to be robust against certain kinds o...
Topological features in quantum computing provide controllability and noise error avoidance in the p...
Non-Abelian geometric phases are attracting increasing interest because of possible experimental app...
A three-level system can be used in a Λ-type configuration in order to construct auniversal set of n...
A practical quantum computer must be capable of performing high fidelity quantum gates on a set of q...
Experimental realization of a universal set of quantum logic gates is the central requirement for im...
To reach the error threshold required to successfully perform error-correcting algorithms in quantum...
Geometric phases and holonomies are a promising resource for the realization of high-fidelity quantu...
Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tole...
We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed unive...
Geometric phases are an interesting resource for quantum computation in view of their robustness aga...
It is proposed that high-speed universal quantum gates can be realized by using non-Abelian holonomi...
For circuit-based quantum computation, experimental implementation of a universal set of quantum log...
publisher[Abstract] Adiabatic quantum gate implementation generally takes longer time, which is disa...
The nonadiabatic holonomic quantum computation based on the geometric phase is robust against the bu...
Holonomic gates for quantum computation are commonly considered to be robust against certain kinds o...
Topological features in quantum computing provide controllability and noise error avoidance in the p...
Non-Abelian geometric phases are attracting increasing interest because of possible experimental app...
A three-level system can be used in a Λ-type configuration in order to construct auniversal set of n...
A practical quantum computer must be capable of performing high fidelity quantum gates on a set of q...
Experimental realization of a universal set of quantum logic gates is the central requirement for im...
To reach the error threshold required to successfully perform error-correcting algorithms in quantum...
Geometric phases and holonomies are a promising resource for the realization of high-fidelity quantu...
Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tole...
We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed unive...
Geometric phases are an interesting resource for quantum computation in view of their robustness aga...
It is proposed that high-speed universal quantum gates can be realized by using non-Abelian holonomi...
For circuit-based quantum computation, experimental implementation of a universal set of quantum log...
publisher[Abstract] Adiabatic quantum gate implementation generally takes longer time, which is disa...
The nonadiabatic holonomic quantum computation based on the geometric phase is robust against the bu...
Holonomic gates for quantum computation are commonly considered to be robust against certain kinds o...
Topological features in quantum computing provide controllability and noise error avoidance in the p...