Learning Unitary Transformation by Quantum Machine Learning Model

被引:3
|
作者
Huang, Yi-Ming [1 ]
Li, Xiao-Yu [1 ]
Zhu, Yi-Xuan [1 ]
Lei, Hang [1 ]
Zhu, Qing-Sheng [2 ]
Yang, Shan [3 ]
机构
[1] Univ Elect Sci & Technol China, Sch Informat & Software Engn, Chengdu 610054, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Phys, Chengdu 610054, Peoples R China
[3] Jackson State Univ, Dept Chem Phys & Atmospher Sci, Jackson, MS 39217 USA
来源
CMC-COMPUTERS MATERIALS & CONTINUA | 2021年 / 68卷 / 01期
关键词
Machine learning; quantum computing; unitary transformation;
D O I
10.32604/cmc.2021.016663
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Quantum machine learning (QML) is a rapidly rising research field that incorporates ideas from quantum computing and machine learning to develop emerging tools for scientific research and improving data processing. How to efficiently control or manipulate the quantum system is a fundamental and vexing problem in quantum computing. It can be described as learning or approximating a unitary operator. Since the success of the hybrid-based quantum machine learning model proposed in recent years, we investigate to apply the techniques from QML to tackle this problem. Based on the Choi-Jamiolkowski isomorphism in quantum computing, we transfer the original problem of learning a unitary operator to a min-max optimization problem which can also be viewed as a quantum generative adversarial network. Besides, we select the spectral norm between the target and generated unitary operators as the regularization term in the loss function. Inspired by the hybrid quantum-classical framework widely used in quantum machine learning, we employ the variational quantum circuit and gradient descent based optimizers to solve the min-max optimization problem. In our numerical experiments, the results imply that our proposed method can successfully approximate the desired unitary operator and dramatically reduce the number of quantum gates of the traditional approach. The average fidelity between the states that are produced by applying target and generated unitary on random input states is around 0.997.
引用
收藏
页码:789 / 803
页数:15
相关论文
共 50 条
  • [1] Optimal quantum learning of a unitary transformation
    Bisio, Alessandro
    Chiribella, Giulio
    D'Ariano, Giacomo Mauro
    Facchini, Stefano
    Perinotti, Paolo
    [J]. PHYSICAL REVIEW A, 2010, 81 (03):
  • [2] Optimal Quantum Dataset for Learning a Unitary Transformation
    Yu, Zhan
    Zhao, Xuanqiang
    Zhao, Benchi
    Wang, Xin
    [J]. PHYSICAL REVIEW APPLIED, 2023, 19 (03)
  • [3] Machine Learning Applied in Reconstruction of Unitary Matrix for Quantum Computation
    Zhang, H.
    Cai, H.
    Paesani, S.
    Santagati, R.
    Laing, A.
    Kwek, L. C.
    Liu, A. Q.
    [J]. 2019 CONFERENCE ON LASERS AND ELECTRO-OPTICS (CLEO), 2019,
  • [4] Quantum model learning agent: characterisation of quantum systems through machine learning
    Flynn, Brian
    Gentile, Antonio A.
    Wiebe, Nathan
    Santagati, Raffaele
    Laing, Anthony
    [J]. NEW JOURNAL OF PHYSICS, 2022, 24 (05):
  • [5] An Improved Classical Singular Value Transformation for Quantum Machine Learning
    Bakshi, Ainesh
    Tang, Ewin
    [J]. PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2398 - 2453
  • [6] Blind quantum machine learning based on quantum circuit model
    Zhou, Xu
    Qiu, Daowen
    [J]. QUANTUM INFORMATION PROCESSING, 2021, 20 (11)
  • [7] Blind quantum machine learning based on quantum circuit model
    Xu Zhou
    Daowen Qiu
    [J]. Quantum Information Processing, 2021, 20
  • [8] Detecting unitary synaptic events with machine learning
    Wang, Nien- Shao
    Marino, Marc
    Malinow, Roberto
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2024, 121 (06)
  • [9] Quantum machine learning
    [J]. Wu, Re-Bing (rbwu@tsinghua.edu.cn), 2017, South China University of Technology (34):
  • [10] Quantum machine learning
    Jonathan Allcock
    Shengyu Zhang
    [J]. National Science Review, 2019, 6 (01) : 26 - 28