Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExperimental Realization of Nonadiabatic Holonomic Single-Qubit Quantum Gates with Two Dark Paths in a Trapped Ion
94
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
Quantum computation with quantum gates induced by geometric phases is regarded as a promising strategy in fault tolerant quantum computation, due to its robustness against operational noises. However, because of the parametric restriction of previous schemes, the main robust advantage of holonomic quantum gates is smeared. Here, we experimentally demonstrate a solution scheme, demonstrating nonadiabatic holonomic single qubit quantum gates with optimal control in a trapped Yb ion based on three level systems with resonant drives, which also hold the advantages of fast evolution and convenient implementation. Compared with corresponding previous geometric gates and conventional dynamic gates, the superiority of our scheme is that it is more robust against control amplitude errors, which is confirmed by the measured gate infidelity through both quantum process tomography and random benchmarking methods. In addition, we also outline that nontrivial two qubit holonomic gates can also be realized within current experimental technologies. Therefore, our experiment validates the feasibility for this robust and fast holonomic quantum computation strategy.
Quantum computing is currently limited by the cost of two-qubit entangling operations. In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make them robust to drift in experimental parameters, and shorten the gate times. In this paper, we present two methods, one exact and one approximate, to construct optimal pulses for entangling gates on a pair of ions within a trapped ion chain, one of the leading quantum computing architectures. Our methods are direct, non-iterative, and linear, and can construct gate-steering pulses requiring less power than the standard method by more than an order of magnitude in some parameter regimes. The power savings may generally be traded for reduced gate time and greater qubit connectivity. Additionally, our methods provide increased robustness to mode drift. We illustrate these trade-offs on a trapped-ion quantum computer.
Universal single-qubit operations based on purely geometric phase factors in adiabatic processes are demonstrated by utilizing a four-level system in a trapped single $^{40}$Ca$^+$ ion connected by three oscillating fields. Robustness against parameter variations is studied. The scheme demonstrated here can be employed as a building block for large-scale holonomic quantum computations, which may be useful for large qubit systems with statistical variations in system parameters.
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.
A global race towards developing a gate-based, universal quantum computer that one day promises to unlock the never before seen computational power has begun and the biggest challenge in achieving this goal arguably is the quality implementation of a two-qubit gate. In a trapped-ion quantum computer, one of the leading quantum computational platforms, a two-qubit gate is typically implemented by modulating the individual addressing beams that illuminate the two target ions, which, together with others, form a linear chain. The required modulation, expectedly so, becomes increasingly more complex, especially as the quantum computer becomes larger and runs faster, complicating the control hardware design. Here, we develop a simple method to essentially remove the pulse-modulation complexity at the cost of engineering the normal modes of the ion chain. We demonstrate that the required mode engineering is possible for a three ion chain, even with a trapped-ion quantum computational system built and optimized for a completely different mode of operations. This indicates that a system, if manufactured to target specifically for the mode-engineering based two-qubit gates, would readily be able to implement the gates without significant additional effort.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
