arrow
返回

Applying quantum algorithms to constraint satisfaction problems

delete2019-07-18
delete61
delete
OA
AI
C
Campbell, Earl
K
Khurana, Ankur
A
Ashley Montanaro *
DOI:10.22331/q-2019-07-18-167delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical algorithms and taking into account realistic hardware parameters and overheads for fault-tolerance. All known examples of such speedups correspond to problems related to simulation of quantum systems and cryptography. Here we apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-complete problems: boolean satisfiability and graph colouring. We consider two quantum approaches: Grover's algorithm and a quantum algorithm for accelerating backtracking algorithms. We compare the performance of optimised versions of these algorithms, when applied to random problem instances, against leading classical algorithms. Even when considering only problem instances that can be solved within one day, we find that there are potentially large quantum speedups available. In the most optimistic parameter regime we consider, this could be a factor of over 105 relative to a classical desktop computer; in the least optimistic regime, the speedup is reduced to a factor of over 10(3). However, the number of physical qubits used is extremely large, and improved fault-tolerance methods will likely be needed to make these results practical. In particular, the quantum advantage disappears if one includes the cost of the classical processing power required to perform decoding of the surface code using current techniques.
Keyword:
TIME
THRESHOLD
NUMBER
BOUNDS
PROOF
GATES
SAT

期刊

Quantum 封面图
Quantum
IF:
5.4
论文数:
974
被引数:
1.0W

机构

U
University of Sheffield
学者数:
3.0W
论文数: 2.9W
被引数: 3.9W
U
University of Bristol
学者数:
3.1W
论文数: 3.0W
被引数: 5.3W
引用论文

引用论文

HOSPITAL STUDY OF ADULT COMMUNITY-ACQUIRED PNEUMONIA
err1982-07-01
err0
PREAI
errJ.T. Macfarlane; M.J. Ward; R.G. Finch; A.D. Macrae
err分享
err收藏
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity具有线性T复杂度的量子电路中的电子光谱编码
err2018-10-23
err245
errOAAI
errBabbush, Ryan; Gidney, Craig; Berry, Dominic W.; Wiebe, Nathan; McClean, Jarrod; Paler, Alexandra; Fowler, Austin; Neven, Hartmut
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Validation of EORTC QLQ-LC43 for Chinese patients with lung cancer
err2014-07-01
err0
PREAI
errLei Zhang; Yanjun Su; Yanni Hua; Weiran Liu; Lin Yue; Jinglian Wu; Le Luo; Weidong Lü; Stephanie Mu-Lian Woo; Adam R. Miller; Shumin Xie; Hong Zhu; Chong Pang; Jing Zhang; Changli Wang
err分享
err收藏
学者 查看更多内容