Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?

Batle, J. and Raymond Ooi, C.H. and Farouk, A. and Abutalib, M. and Abdalla, S. (2016) Do multipartite correlations speed up adiabatic quantum computation or quantum annealing? Quantum Information Processing, 15 (8). pp. 3081-3099. ISSN 1570-0755, DOI https://doi.org/10.1007/s11128-016-1324-x.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/s11128-016-1324-x

Abstract

Quantum correlations are thought to be the reason why certain quantum algorithms overcome their classical counterparts. Since the nature of this resource is still not fully understood, we shall investigate how multipartite entanglement and non-locality among qubits vary as the quantum computation runs. We shall encounter that quantum measures on the whole system cannot account for their corresponding speedup.

Item Type: Article
Funders: Ministry of Education Malaysia: High Impact Research MoE Grant UM.C/625/1/HIR/MoE/CHAN/04
Uncontrolled Keywords: Non-locality; Entanglement; Multipartite systems; Quantum speedup; Adiabatic quantum computation; Quantum annealing
Subjects: Q Science > Q Science (General)
Q Science > QC Physics
Divisions: Faculty of Science > Department of Physics
Depositing User: Ms. Juhaida Abd Rahim
Date Deposited: 07 Dec 2017 04:03
Last Modified: 07 Dec 2017 04:03
URI: http://eprints.um.edu.my/id/eprint/18482

Actions (login required)

View Item View Item