Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userApproach to realizing nonadiabatic geometric gates with prescribed evolution paths
116
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Nonadiabatic geometric phases are only dependent on the evolution path of a quantum system but independent of the evolution details, and therefore quantum computation based on nonadiabatic geometric phases is robust against control errors. To realize nonadiabatic geometric quantum computation, it is necessary to ensure that the quantum system undergoes a cyclic evolution and the dynamical phases are removed from the total phases. To satisfy these conditions, the evolution paths in previous schemes are usually restricted to some special forms, e.g, orange-slice-shaped loops, which make the paths unnecessarily long in general. In this paper, we put forward an approach to the realization of nonadiabatic geometric quantum computation by which a universal set of nonadiabatic geometric gates can be realized with any desired evolution paths. Our approach makes it possible to realize geometric quantum computation with an economical evolution time so the influence of environment noises on the quantum gates can be minimized further.
rate research
Read More
Geometric phases are robust against certain types of local noises, and thus provide a promising way towards high-fidelity quantum gates. However, comparing with the dynamical ones, previous implementations of nonadiabatic geometric quantum gates usually require longer evolution time, due to the needed longer evolution path. Here, we propose a scheme to realize nonadiabatic geometric quantum gates with short paths based on simple pulse control techniques, instead of deliberated pulse control in previous investigations, which can thus further suppress the influence from the environment induced noises. Specifically, we illustrate the idea on a superconducting quantum circuit, which is one of the most promising platforms for realizing practical quantum computer. As the current scheme shortens the geometric evolution path, we can obtain ultra-high gate fidelity, especially for the two-qubit gate case, as verified by our numerical simulation. Therefore, our protocol suggests a promising way towards high-fidelity and roust quantum computation on a solid-state quantum system.
For circuit-based quantum computation, experimental implementation of universal set of quantum logic gates with high-fidelity and strong robustness is essential and central. Quantum gates induced by geometric phases, which depend only on global properties of the evolution paths, have built-in noise-resilience features. Here, we propose and experimentally demonstrate nonadiabatic holonomic single-qubit quantum gates on two dark paths in a trapped $^{171}mathrm{Yb}^{+}$ ion based on four-level systems with resonant drives. We confirm the implementation with measured gate fidelity through both quantum process tomography and randomized benchmarking methods. Meanwhile, we find that nontrivial holonomic two-qubit quantum gates can also be realized within current experimental technologies. Compared with previous implementations on three-level systems, our experiment share both the advantage of fast nonadiabatic evolution and the merit of robustness against systematic errors, and thus retains the main advantage of geometric phases. Therefore, our experiment confirms a promising method for fast and robust holonomic quantum computation.
Previous schemes of nonadiabatic holonomic quantum computation were focused mainly on realizing a universal set of elementary gates. Multiqubit controlled gates could be built by decomposing them into a series of the universal gates. In this article, we propose an approach for realizing nonadiabatic holonomic multiqubit controlled gates in which a $(n+1)$-qubit controlled-$(boldsymbol{mathrm{n}cdot mathrm{sigma}})$ gate is realized by $(2n-1)$ basic operations instead of decomposing it into the universal gates, whereas an $(n+1)$-qubit controlled arbitrary rotation gate can be obtained by combining only two such controlled-$(boldsymbol{mathrm{n}cdot mathrm{sigma}})$ gates. Our scheme greatly reduces the operations of nonadiabatic holonomic quantum computation.
High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.
We review a time-dependent version of the Schrieffer-Wolff transformation that accounts for real-time control of system parameters, soon to be rendered possible on a broad basis due to technical progress. The dispersive regime of $N$ multilevel systems coupled to a cavity via a Jaynes-Cummings interaction is extended to the most general case. As a concrete example we rigorously apply the technique to dispersive two-qubit gates in a superconducting architecture, showing that fidelities based on previous models are off by up to $10^{-2}$, which is certainly relevant for high-fidelity gates compatible with fault-tolerant quantum information devices. A closed analytic form for the error depending on the target evolution closes our work.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
