arXiv subjects

Pu Shen

Publications and source records attributed to Pu Shen.

8 recordsLinked to original sources

arXiv2023

Nonadiabatic Holonomic Quantum Computation and Its Optimal Control

Geometric phase has the intrinsic property of being resistant to some types of local noises as it only depends on global properties of the evolution path. Meanwhile, the non-Abelian geometric phase is in the matrix form, and thus can naturally be used to implement high performance quantum gates, i.e., the so-called holonomic quantum computation. This article reviews recent advances in nonadiabatic holonomic quantum computation, and focuses on various optimal control approaches that can improve the gate performance, in terms of the gate fidelity and robustness. Besides, we also pay special attention to its possible physical realizations and some concrete examples of experimental realizations. Finally, with all these efforts, within state-of-the-art technology, the performance of the implemented holonomic quantum gates can outperform the conventional dynamical ones, under certain conditions.

quant-ph↗

arXiv2023

Accelerated super-robust nonadiabatic holonomic quantum gates

The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous conventional schemes, the states of the calculation subspace have always leaked to the noncomputation subspace, resulting in less robustness than anticipated. Recent efforts to address this problem are at the cost of excessively long gate time, which will lead to more decoherence-induced errors. Here, we propose a solution to the problem without the severe limitation of the much longer gate time. Specifically, we implement arbitrary holonomic gates via a three-segment Hamiltonian, where the gate time depends on the rotation angle, and the smaller the rotation angle, the shorter the gate time will be. Compared with the previous solutions, our numerical simulations indicate that the decoherence-induced gate errors of our scheme are greatly decreased and the robustness of our scheme is also better, particularly for small-angle rotation gates. Moreover, we provide a detailed physical realization of our proposal on a two-dimensional superconducting quantum circuit. Therefore, our protocol provides a promising alternative for future fault-tolerant quantum computation.

quant-ph↗

arXiv2023

State-independent Nonadiabatic Geometric Quantum Gates

Quantum computation has demonstrated advantages over classical computation for special hard problems, where a set of universal quantum gates is essential. Geometric phases, which have built-in resilience to local noise, have been used to construct quantum gates with excellent performance. However, this advantage has been smeared in previous schemes. Here, we propose a state-independent nonadiabatic geometric quantum-gate scheme that is able to realize a more fully geometric gate than previous approaches, allowing for the cancelation of dynamical phases accumulated by an arbitrary state. Numerical simulations demonstrate that our scheme has significantly stronger gate robustness than the previous geometric and dynamical ones. Meanwhile, we give a detailed physical implementation of our scheme with the Rydberg atom system based on the Rydberg blockade effect, specifically for multiqubit control-phase gates, which exceeds the fault-tolerance threshold of multiqubit quantum gates within the considered error range. Therefore, our scheme provides a promising way for fault-tolerant quantum computation in atomic systems.

quant-ph↗

arXiv2022

Nonadiabatic Holonomic Quantum Computation via Path Optimization

Nonadiabatic holonomic quantum computation (NHQC) is implemented by fast evolution processes in a geometric way to withstand local noises. However, recent works of implementing NHQC are sensitive to the systematic noise and error. Here, we present a path-optimized NHQC (PONHQC) scheme based on the non-Abelian geometric phase, and find that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. Due to the flexibility of the PONHQC scheme, we can choose an optimized path that can lead to excellent gate performance. Numerical simulation shows that our optimized scheme can greatly outperform the conventional NHQC scheme, in terms of both fidelity and robustness of the gates. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding with the experiment-friendly two-body exchange interaction. Therefore, we present a flexible NHQC scheme that is promising for the future robust quantum computation.

quant-ph↗

arXiv2022

Composite Short-path Nonadiabatic Holonomic Quantum Gates

Nonadiabatic holonomic quantum computation (NHQC) has attracted significant attention due to its fast evolution and the geometric nature induced resilience to local noises. However, its long operation time and complex physical implementation make it hard to surpass the dynamical scheme, and thus hindering its wide application. Here, we present to implement NHQC with the shortest path under some conditions, through the inverse Hamiltonian engineering technique, which posseses higher fidelity and stronger robustness than previous NHQC schemes. Meanwhile, the gate performance in our scheme can be further improved by using the proposed composite dynamical decoupling pulses, which can efficiently improve both the gate fidelity and robustness, making our scheme outperform the optimal dynamical scheme in certain parameters range. Remarkably, our scheme can be readily implemented with Rydberg atoms, and a simplified implementation of the controlled-not gate in the Rydberg blockade regime can be achieved. Therefore, our scheme represents a promising progress towards future fault-tolerant quantum computation in atomic systems.

quant-ph↗

arXiv2021

Ultrafast Holonomic Quantum Gates

Quantum computation based on geometric phase is generally believed to be more robust against certain errors or noises than the conventional dynamical strategy. However, the gate error caused by the decoherence effect is inevitable, and thus faster gate operations are highly desired. Here, we propose a nonadiabatic holonomic quantum computation (NHQC) scheme with detuned interactions on $Δ$-type three-level system, which combines the time-optimal control technique with the time-independent detuning adjustment to further accelerate universal gate operations, {so that the gate-time can be greatly shortened within the hardware limitation}, and thus high-fidelity gates can be obtained. Meanwhile, our numerical simulations show that the gate robustness is also stronger than previous schemes. Finally, we present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding, based on the experimentally demonstrated parametrically tunable coupling technique, which simplifies previous investigations. Therefore, our protocol provides a more promising alternative for future fault-tolerant quantum computation.

quant-ph↗

arXiv2021

Noncyclic nonadiabatic holonomic quantum gates via shortcuts to adiabaticity

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.

quant-ph↗

arXiv2020

Robust and Fast Holonomic Quantum Gates with Encoding on Superconducting Circuits

High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However, the longer gate time for geometric operations and more physical-implementation difficulties hinder its practical and wide applications. Here, we propose a simplified implementation of universal holonomic quantum gates on superconducting circuits with experimentally demonstrated techniques, which can remove the two main challenges by introducing the time-optimal control into the construction of quantum gates. Remarkably, our scheme is also based on a decoherence-free subspace encoding, with minimal physical qubit resource, which can further immune to error caused by qubit-frequency drift, which is regarded as the main error source for large scale superconducting circuits. Meanwhile, we deliberately design the quantum evolution to eliminate gate error caused by unwanted leakage sources. Therefore, our scheme is more robust than the conventional ones, and thus provides a promising alternative strategy for scalable fault-tolerant quantum computation.

quant-ph↗