Using copies can improve precision in continuous-time quantum computing

被引:1
作者
Bennett, Jemma [1 ,5 ]
Callison, Adam [2 ]
O'Leary, Tom [1 ,3 ]
West, Mia [1 ]
Chancellor, Nicholas [1 ]
Kendon, Viv [1 ,4 ]
机构
[1] Univ Durham, Phys Dept, South Rd, Durham DH1 3LE, England
[2] UCL, Dept Phys & Astron, Gower St, London WC1E 6BT, England
[3] Univ Oxford, Dept Phys, Clarendon Lab, Parks Rd, Oxford OX1 3PU, England
[4] Univ Strathclyde, Dept Phys, Glasgow G4 0NG, Scotland
[5] Univ Innsbruck, Innsbruck, Austria
基金
英国工程与自然科学研究理事会;
关键词
adiabatic quantum computing; error suppression; quantum walks; quantum annealing; COMPUTATION;
D O I
10.1088/2058-9565/acdcb5
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
In the quantum optimisation setting, we build on a scheme introduced by Young et al (2013 Phys. Rev. A 88 062314), where physical qubits in multiple copies of a problem encoded into an Ising spin Hamiltonian are linked together to increase the logical system's robustness to error. We introduce several innovations that improve the error suppression of this scheme under a special model of control noise, designed to understand how limited precision could be overcome. First, we note that only one copy needs to be correct by the end of the computation, since solution quality can be checked efficiently. Second, we find that ferromagnetic links do not generally help in this 'one correct copy' setting, but anti-ferromagnetic links do help on average, by suppressing the chance of the same error being present on all of the copies. Third, we find that minimum-strength anti-ferromagnetic links perform best, by counteracting the spin-flips induced by the errors. We have numerically tested our innovations on small instances of spin glasses from Callison et al (2019 New J. Phys. 21 123022), and we find improved error tolerance for three or more copies in configurations that include frustration. Interpreted as an effective precision increase, we obtain several extra bits of precision on average for three copies connected in a triangle. This provides proof-of-concept of a method for scaling quantum annealing beyond the precision limits of hardware, a step towards fault tolerance in this setting.
引用
收藏
页数:19
相关论文
共 75 条
[1]   Fault-tolerant quantum computation with long-range correlated noise [J].
Aharonov, D ;
Kitaev, A ;
Preskill, J .
PHYSICAL REVIEW LETTERS, 2006, 96 (05)
[2]  
Anaconda, 2016, AN SOFTW DISTR
[3]  
[Anonymous], 2019, FINDING SPIN GLASS G, DOI DOI 10.15128/R21544BP097
[4]  
[Anonymous], 2018, MIN
[5]  
Atalaya J, 2020, Arxiv, DOI arXiv:2003.11248
[6]   Coherence-preserving quantum bits [J].
Bacon, D ;
Brown, KR ;
Whaley, KB .
PHYSICAL REVIEW LETTERS, 2001, 87 (24) :247902-247902
[7]  
Bernstein E., 1993, Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, P11, DOI 10.1145/167088.167097
[8]   Computational multiqubit tunnelling in programmable quantum annealers [J].
Boixo, Sergio ;
Smelyanskiy, Vadim N. ;
Shabani, Alireza ;
Isakov, Sergei V. ;
Dykman, Mark ;
Denchev, Vasil S. ;
Amin, Mohammad H. ;
Smirnov, Anatoly Yu. ;
Mohseni, Masoud ;
Neven, Hartmut .
NATURE COMMUNICATIONS, 2016, 7
[9]   Error suppression in Hamiltonian-based quantum computation using energy penalties [J].
Bookatz, Adam D. ;
Farhi, Edward ;
Zhou, Leo .
PHYSICAL REVIEW A, 2015, 92 (02)
[10]  
Brady L. T., 2021, arXiv