| Literature DB >> 28409975 |
Kebiao Xu1, Tianyu Xie1, Zhaokai Li1,2, Xiangkun Xu1, Mengqi Wang1, Xiangyu Ye1, Fei Kong1, Jianpei Geng1, Changkui Duan1, Fazhan Shi1,2, Jiangfeng Du1,2.
Abstract
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.Entities:
Year: 2017 PMID: 28409975 DOI: 10.1103/PhysRevLett.118.130504
Source DB: PubMed Journal: Phys Rev Lett ISSN: 0031-9007 Impact factor: 9.161