G. F. Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
G. F. Xu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Dianmin Tong
Shandong University
10 shared publications P. Z. Zhao
10 shared publications- Erik Sjöqvist
Uppsala University
4 shared publications T. H. Xing
Department of Physics, Shandong University, Jinan 250100, China
3 shared publicationsX. Wu
Department of Physics, Shandong University, Jinan 250100, China
3 shared publicationsQ. M. Ding
Department of Physics Shandong University 250100 Jinan China
2 shared publications
Latest Publications
- 8 January 2020
- Published by American Physical Society (APS) in Physical Review A
- Vol. 101 (1) , 012306
Nonadiabatic holonomic three-qubit controlled gates realized by one-shot implementation
Nonadiabatic holonomic gates provide a promising way to realize high-fidelity quantum gates because of their robustness and high-speed implementation. Compared with quantum computation that consists of many nonadiabatic holonomic one-qubit and two-qubit gates, the nonadiabatic holonomic multiqubit gate, which can reduce the number of quantum gates, is more efficient to construct simpler and faster complicated quantum computation. We propose the simplest scheme to realize nonadiabatic holonomic three-qubit controlled gates. On the one hand, the parameters we set to realize the three-qubit controlled gates are all time independent, which makes it easy to control and operate the quantum systems. On the other hand, our scheme avoids the combination of the elementary gates and realizes the three-qubit controlled gates only by one-shot implementation.
- 8 January 2020
- Published by American Physical Society (APS) in Physical Review A
- Vol. 101 (1) , 012306
Nonadiabatic holonomic three-qubit controlled gates realized by one-shot implementation
Nonadiabatic holonomic gates provide a promising way to realize high-fidelity quantum gates because of their robustness and high-speed implementation. Compared with quantum computation that consists of many nonadiabatic holonomic one-qubit and two-qubit gates, the nonadiabatic holonomic multiqubit gate, which can reduce the number of quantum gates, is more efficient to construct simpler and faster complicated quantum computation. We propose the simplest scheme to realize nonadiabatic holonomic three-qubit controlled gates. On the one hand, the parameters we set to realize the three-qubit controlled gates are all time independent, which makes it easy to control and operate the quantum systems. On the other hand, our scheme avoids the combination of the elementary gates and realizes the three-qubit controlled gates only by one-shot implementation.
- Open Access
Nonadiabatic holonomic multiqubit controlled gates
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.Open AccessNonadiabatic holonomic multiqubit controlled gates
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. - 8 May 2019
- Published by American Physical Society (APS) in Physical Review A
- Vol. 99 (5) , 052309
Nonadiabatic holonomic multiqubit controlled gates
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 -qubit controlled- gate is realized by -basic operations instead of decomposing it into the universal gates, whereas a -qubit controlled arbitrary rotation gate can be obtained by combining only two such controlled- gates. Our scheme greatly reduces the operations of nonadiabatic holonomic quantum computation.- 8 May 2019
- Published by American Physical Society (APS) in Physical Review A
- Vol. 99 (5) , 052309
Nonadiabatic holonomic multiqubit controlled gates
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 -qubit controlled- gate is realized by -basic operations instead of decomposing it into the universal gates, whereas a -qubit controlled arbitrary rotation gate can be obtained by combining only two such controlled- gates. Our scheme greatly reduces the operations of nonadiabatic holonomic quantum computation.- Open Access
Nonadiabatic holonomic quantum computation with Rydberg superatoms
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various physical systems, each of which has some particular merits. In this paper, we put forward an alternative scheme of nonadiabatic holonomic quantum computation, in which a universal set of quantum gates is realized based on Rydberg superatoms. A Rydberg superatom is a mesoscopic atomic ensemble that allows for only a single Rydberg excitation shared by many atoms within a blockade radius and can be used to generate the collective states to encode the qubits. In our scheme, the qubit is encoded into two collective ground states of Rydberg superatoms and the interaction between two long-range Rydberg superatoms is mediated by a microwave cavity with the aid of two additional collective Rydberg states. Different from the previous schemes,which are based on the systems in the microscope scale, the present scheme is based on atomic ensembles in the mesoscopic scale. Besides the common merits of nonadiabatic holonomic quantum computation such as the robustness and the speediness, the Rydberg-superatom-based scheme has the following particular merits: the long coherence time of Rydberg states and the operability of the mesoscopic systems.
Open AccessNonadiabatic holonomic quantum computation with Rydberg superatoms
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various physical systems, each of which has some particular merits. In this paper, we put forward an alternative scheme of nonadiabatic holonomic quantum computation, in which a universal set of quantum gates is realized based on Rydberg superatoms. A Rydberg superatom is a mesoscopic atomic ensemble that allows for only a single Rydberg excitation shared by many atoms within a blockade radius and can be used to generate the collective states to encode the qubits. In our scheme, the qubit is encoded into two collective ground states of Rydberg superatoms and the interaction between two long-range Rydberg superatoms is mediated by a microwave cavity with the aid of two additional collective Rydberg states. Different from the previous schemes,which are based on the systems in the microscope scale, the present scheme is based on atomic ensembles in the mesoscopic scale. Besides the common merits of nonadiabatic holonomic quantum computation such as the robustness and the speediness, the Rydberg-superatom-based scheme has the following particular merits: the long coherence time of Rydberg states and the operability of the mesoscopic systems.
- 11 September 2018
- Published by American Physical Society (APS) in Physical Review A
- Vol. 98 (3) , 032313
Nonadiabatic holonomic quantum computation with Rydberg superatoms
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various physical systems, each of which has some particular merits. In this paper, we put forward an alternative scheme of nonadiabatic holonomic quantum computation, in which a universal set of quantum gates is realized based on Rydberg superatoms. A Rydberg superatom is a mesoscopic atomic ensemble that allows for only a single Rydberg excitation shared by many atoms within a blockade radius and can be used to generate the collective states to encode the qubits. In our scheme, the qubit is encoded into two collective ground states of Rydberg superatoms and the interaction between two long-range Rydberg superatoms is mediated by a microwave cavity with the aid of two additional collective Rydberg states. Different from the previous schemes, which are based on the systems in the microscope scale, the present scheme is based on atomic ensembles in the mesoscopic scale. Besides the common merits of nonadiabatic holonomic quantum computation such as the robustness and the speediness, the Rydberg-superatom-based scheme has the following particular merits: the long coherence time of Rydberg states and the operability of the mesoscopic systems.
- 11 September 2018
- Published by American Physical Society (APS) in Physical Review A
- Vol. 98 (3) , 032313
Nonadiabatic holonomic quantum computation with Rydberg superatoms
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various physical systems, each of which has some particular merits. In this paper, we put forward an alternative scheme of nonadiabatic holonomic quantum computation, in which a universal set of quantum gates is realized based on Rydberg superatoms. A Rydberg superatom is a mesoscopic atomic ensemble that allows for only a single Rydberg excitation shared by many atoms within a blockade radius and can be used to generate the collective states to encode the qubits. In our scheme, the qubit is encoded into two collective ground states of Rydberg superatoms and the interaction between two long-range Rydberg superatoms is mediated by a microwave cavity with the aid of two additional collective Rydberg states. Different from the previous schemes, which are based on the systems in the microscope scale, the present scheme is based on atomic ensembles in the mesoscopic scale. Besides the common merits of nonadiabatic holonomic quantum computation such as the robustness and the speediness, the Rydberg-superatom-based scheme has the following particular merits: the long coherence time of Rydberg states and the operability of the mesoscopic systems.
- Open Access
Rydberg-atom-based scheme of nonadiabatic geometric quantum computation
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance and superconducting circuits. Another system being adequate for implementation of nonadiabatic geometric quantum computation may be Rydberg atoms, since their internal states have very long coherence time and the Rydberg-mediated interaction facilitates the implementation of a two-qubit gate. Here, we propose a scheme of nonadiabatic geometric quantum computation based on Rydberg atoms, which combines the robustness of nonadiabatic geometric gates with the merits of Rydberg atoms.
Open AccessRydberg-atom-based scheme of nonadiabatic geometric quantum computation
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance and superconducting circuits. Another system being adequate for implementation of nonadiabatic geometric quantum computation may be Rydberg atoms, since their internal states have very long coherence time and the Rydberg-mediated interaction facilitates the implementation of a two-qubit gate. Here, we propose a scheme of nonadiabatic geometric quantum computation based on Rydberg atoms, which combines the robustness of nonadiabatic geometric gates with the merits of Rydberg atoms.
- 13 November 2017
- Published by American Physical Society (APS) in Physical Review A
- Vol. 96 (5) , 052316
Rydberg-atom-based scheme of nonadiabatic geometric quantum computation
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance, and superconducting circuits. Another system being adequate for implementation of nonadiabatic geometric quantum computation may be Rydberg atoms, since their internal states have very long coherence time and the Rydberg-mediated interaction facilitates the implementation of a two-qubit gate. Here, we propose a scheme of nonadiabatic geometric quantum computation based on Rydberg atoms, which combines the robustness of nonadiabatic geometric gates with the merits of Rydberg atoms.
- 13 November 2017
- Published by American Physical Society (APS) in Physical Review A
- Vol. 96 (5) , 052316
Rydberg-atom-based scheme of nonadiabatic geometric quantum computation
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance, and superconducting circuits. Another system being adequate for implementation of nonadiabatic geometric quantum computation may be Rydberg atoms, since their internal states have very long coherence time and the Rydberg-mediated interaction facilitates the implementation of a two-qubit gate. Here, we propose a scheme of nonadiabatic geometric quantum computation based on Rydberg atoms, which combines the robustness of nonadiabatic geometric gates with the merits of Rydberg atoms.
- Open Access
Single-shot realization of nonadiabatic holonomic quantum gates in decoherence-free subspaces
Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to error sources as well as the resource expenditure. In this paper, we propose an alternative protocol for nonadiabatic holonomic quantum computation in decoherence-free subspaces, in which an arbitrary one-qubit gate in decoherence-free subspaces is realized by a single-shot implementation. The present protocol not only maintains the merits of the original protocol, but also avoids the extra work of combining two gates to implement an arbitrary one-qubit gate and thereby reduces the exposure time to various error sources.
Open AccessSingle-shot realization of nonadiabatic holonomic quantum gates in decoherence-free subspaces
Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to error sources as well as the resource expenditure. In this paper, we propose an alternative protocol for nonadiabatic holonomic quantum computation in decoherence-free subspaces, in which an arbitrary one-qubit gate in decoherence-free subspaces is realized by a single-shot implementation. The present protocol not only maintains the merits of the original protocol, but also avoids the extra work of combining two gates to implement an arbitrary one-qubit gate and thereby reduces the exposure time to various error sources.
- 6 June 2017
- Published by American Physical Society (APS) in Physical Review A
- Vol. 95 (6) , 062310
Single-shot realization of nonadiabatic holonomic quantum gates in decoherence-free subspaces
Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to error sources as well as the resource expenditure. In this paper, we propose an alternative protocol for nonadiabatic holonomic quantum computation in decoherence-free subspaces, in which an arbitrary one-qubit gate in decoherence-free subspaces is realized by a single-shot implementation. The present protocol not only maintains the merits of the original protocol but also avoids the extra work of combining two gates to implement an arbitrary one-qubit gate and thereby reduces the exposure time to various error sources.
- 6 June 2017
- Published by American Physical Society (APS) in Physical Review A
- Vol. 95 (6) , 062310
Single-shot realization of nonadiabatic holonomic quantum gates in decoherence-free subspaces
Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to error sources as well as the resource expenditure. In this paper, we propose an alternative protocol for nonadiabatic holonomic quantum computation in decoherence-free subspaces, in which an arbitrary one-qubit gate in decoherence-free subspaces is realized by a single-shot implementation. The present protocol not only maintains the merits of the original protocol but also avoids the extra work of combining two gates to implement an arbitrary one-qubit gate and thereby reduces the exposure time to various error sources.
- Open Access
Nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases
Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the previous schemes in this direction have been based on the conventional geometric phases, of which the dynamical phases need to be removed. In this paper, we put forward a scheme of nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases, of which the dynamical phases do not need to be removed. Specifically, by using three physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of geometric gates nonadiabatically and unconventionally. Our scheme not only maintains all the merits of nonadiabatic geometric quantum computation in decoherence-free subspaces, but also avoids the additional operations required in the conventional schemes to cancel the dynamical phases.
Open AccessNonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases
Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the previous schemes in this direction have been based on the conventional geometric phases, of which the dynamical phases need to be removed. In this paper, we put forward a scheme of nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases, of which the dynamical phases do not need to be removed. Specifically, by using three physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of geometric gates nonadiabatically and unconventionally. Our scheme not only maintains all the merits of nonadiabatic geometric quantum computation in decoherence-free subspaces, but also avoids the additional operations required in the conventional schemes to cancel the dynamical phases.