Performance of two different quantum annealing correction codes |
| |
| Authors: | Anurag Mishra,Tameem Albash,Daniel A. Lidar |
| |
| Affiliation: | 1.Department of Physics and Astronomy,University of Southern California,Los Angeles,USA;2.Center for Quantum Information Science and Technology,University of Southern California,Los Angeles,USA;3.Information Sciences Institute,University of Southern California,Marina del Rey,USA;4.Department of Electrical Engineering,University of Southern California,Los Angeles,USA;5.Department of Chemistry,University of Southern California,Los Angeles,USA |
| |
| Abstract: | Quantum annealing is a promising approach for solving optimization problems, but like all other quantum information processing methods, it requires error correction to ensure scalability. In this work, we experimentally compare two quantum annealing correction (QAC) codes in the setting of antiferromagnetic chains, using two different quantum annealing processors. The lower-temperature processor gives rise to higher success probabilities. The two codes differ in a number of interesting and important ways, but both require four physical qubits per encoded qubit. We find significant performance differences, which we explain in terms of the effective energy boost provided by the respective redundantly encoded logical operators of the two codes. The code with the higher energy boost results in improved performance, at the expense of a lower-degree encoded graph. Therefore, we find that there exists an important trade-off between encoded connectivity and performance for quantum annealing correction codes. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
