中国物理B ›› 2020, Vol. 29 ›› Issue (1): 10308-010308.doi: 10.1088/1674-1056/ab5f02

• SPECIAL TOPIC—Recent advances in thermoelectric materials and devices • 上一篇    下一篇

Quantum adiabatic algorithms using unitary interpolation

Shuo Zhang(张硕), Qian-Heng Duan(段乾恒), Tan Li(李坦), Xiang-Qun Fu(付向群), He-Liang Huang(黄合良), Xiang Wang(汪翔), Wan-Su Bao(鲍皖苏)   

  1. 1 Henan Key Laboratory of Quantum Information and Cryptography, SSE IEU, Zhengzhou 450001, China;
    2 Synergetic Innovation Center of Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei 230026, China
  • 收稿日期:2019-06-30 修回日期:2019-11-19 出版日期:2020-01-05 发布日期:2020-01-05
  • 通讯作者: Wan-Su Bao E-mail:bws@qiclab.cn
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 11504430, 11805279, 61501514, and 61502526).

Quantum adiabatic algorithms using unitary interpolation

Shuo Zhang(张硕)1, Qian-Heng Duan(段乾恒)1, Tan Li(李坦)1, Xiang-Qun Fu(付向群)1, He-Liang Huang(黄合良)1, Xiang Wang(汪翔)1, Wan-Su Bao(鲍皖苏)1,2,3   

  1. 1 Henan Key Laboratory of Quantum Information and Cryptography, SSE IEU, Zhengzhou 450001, China;
    2 Synergetic Innovation Center of Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei 230026, China
  • Received:2019-06-30 Revised:2019-11-19 Online:2020-01-05 Published:2020-01-05
  • Contact: Wan-Su Bao E-mail:bws@qiclab.cn
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 11504430, 11805279, 61501514, and 61502526).

RichHTML

0

PDF (PC)

224

赞

摘要： We present two efficient quantum adiabatic algorithms for Bernstein-Vazirani problem and Simon's problem. We show that the time complexities of the algorithms for Bernstein-Vazirani problem and Simon's problem are O(1) and O(n), respectively, which are the same complexities as the corresponding algorithms in quantum circuit model. In these two algorithms, the adiabatic Hamiltonians are realized by unitary interpolation instead of standard linear interpolation. Comparing with the adiabatic algorithms using linear interpolation, the energy gaps of our algorithms keep constant. Therefore, the complexities are much easier to analyze using this method.

关键词: adiabatic quantum computation, quantum adiabatic algorithms

Abstract: We present two efficient quantum adiabatic algorithms for Bernstein-Vazirani problem and Simon's problem. We show that the time complexities of the algorithms for Bernstein-Vazirani problem and Simon's problem are O(1) and O(n), respectively, which are the same complexities as the corresponding algorithms in quantum circuit model. In these two algorithms, the adiabatic Hamiltonians are realized by unitary interpolation instead of standard linear interpolation. Comparing with the adiabatic algorithms using linear interpolation, the energy gaps of our algorithms keep constant. Therefore, the complexities are much easier to analyze using this method.

Key words: adiabatic quantum computation, quantum adiabatic algorithms

中图分类号:  (Quantum computation architectures and implementations)

  • 03.67.Lx
03.67.Ac (Quantum algorithms, protocols, and simulations)