Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design

被引:83
|
作者
Luo, Xiu-Zhe [1 ,2 ,3 ,4 ]
Liu, Jin-Guo [1 ]
Zhang, Pan [2 ]
Wang, Lei [1 ,5 ]
机构
[1] Chinese Acad Sci, Inst Phys, Beijing 100190, Peoples R China
[2] Chinese Acad Sci, Inst Theoret Phys, Beijing 100190, Peoples R China
[3] Univ Waterloo, Dept Phys & Astron, Waterloo, ON N2L 3G1, Canada
[4] Perimeter Inst Theoret Phys, Waterloo, ON N2L 2Y5, Canada
[5] Songshan Lake Mat Lab, Dongguan 523808, Guangdong, Peoples R China
来源
QUANTUM | 2020年 / 4卷
基金
中国国家自然科学基金;
关键词
COMPUTATION; SUPREMACY;
D O I
10.22331/q-2020-10-11-341
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We introduce Yao, an extensible, efficient open-source framework for quantum algorithm design. Yao features generic and differentiable programming of quantum circuits. It achieves state-of-the-art performance in simulating small to intermediatesized quantum circuits that are relevant to near-term applications. We introduce the design principles and critical techniques behind Yao. These include the quantum block intermediate representation of quantum circuits, a builtin automatic differentiation engine optimized for reversible computing, and batched quantum registers with GPU acceleration. The extensibility and efficiency of Yao help boost innovation in quantum algorithm design.
引用
收藏
页数:34
相关论文
共 19 条
  • [1] BrainPy, a flexible, integrative, efficient, and extensible framework for general-purpose brain dynamics programming
    Wang, Chaoming
    Zhang, Tianqiu
    Chen, Xiaoyu
    He, Sichao
    Li, Shangyang
    Wu, Si
    ELIFE, 2023, 12
  • [2] Quantum Algorithm Design: Techniques and Applications
    Shao Changpeng
    Li Yang
    Li Hongbo
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2019, 32 (01) : 375 - 452
  • [3] Quantum Mechanics, Ambiguity and Design: Towards a Framework
    Verstegen, Bas B. P. M.
    Ozcan, Elif
    Delle Monache, Stefano S.
    PROCEEDINGS OF THE 14TH CREATIVITY AND COGNITION, C&C 2022, 2022, : 575 - 582
  • [4] Efficient state initialization by a quantum spectral filtering algorithm
    Fillion-Gourdeau, Francois
    MacLean, Steve
    Laflamme, Raymond
    PHYSICAL REVIEW A, 2017, 95 (04)
  • [5] Efficient Quantum Algorithm for the Parity Problem of a Certain Function
    Nagata, Koji
    Nakamura, Tadao
    Batle, Josep
    Farouk, Ahmed
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2018, 57 (10) : 3098 - 3103
  • [6] Quantum adiabatic algorithm design using reinforcement learning
    Lin, Jian
    Lai, Zhong Yuan
    Li, Xiaopeng
    PHYSICAL REVIEW A, 2020, 101 (05)
  • [7] Machine learning assisted quantum adiabatic algorithm design
    Lin Jian
    Ye Meng
    Zhu Jia-Wei
    Li Xiao-Peng
    ACTA PHYSICA SINICA, 2021, 70 (14)
  • [8] An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups
    Ivanyos, Gabor
    Sanselme, Luc
    Santha, Miklos
    ALGORITHMICA, 2012, 62 (1-2) : 480 - 498
  • [9] Efficient realization of quantum primitives for Shor's algorithm using PennyLane library
    Antipov, A., V
    Kiktenko, E. O.
    Fedorov, A. K.
    PLOS ONE, 2022, 17 (07):
  • [10] An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group
    Decker, Thomas
    Ivanyos, Gabor
    Kulkarni, Raghav
    Qiao, Youming
    Santha, Miklos
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 226 - 238