A family of unitaries for the quantum period finding algorithm

被引:0
|
作者
Francis, John George [1 ]
Shaji, Anil [1 ]
机构
[1] IISER Thiruvananthapuram, Sch Phys, Thiruvananthapuram 695551, Kerala, India
关键词
Quantum period finding; Machine learning; Quantum Fourier transform; Equivalent unitary transformations; NETWORKS;
D O I
10.1007/s11128-023-04079-x
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We use differentiable programming and gradient descent to find unitary matrices that can be used in the period finding algorithm to extract period information from the state of a quantum computer post-application of the oracle. The standard procedure is to use the inverse quantum Fourier transform. Our findings suggest that this is not the only unitary matrix appropriate for the period finding algorithm. There exists a family of unitary matrices that can affect out the same transformation and they are related by a symmetry. An analysis of this symmetry is presented. These unitary matrices can be learned by an algorithm which reveals the underlying symmetry. We also find simple neural networks are able to learn this symmetry and differentiate such unitary matrices from randomly generated ones.
引用
收藏
页数:27
相关论文
共 50 条
  • [21] A period-finding method for Shor's algorithm
    Zhang, Weiqiang
    Xu, Chen
    Li, Feipeng
    Feng, Jiqiang
    CIS: 2007 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PROCEEDINGS, 2007, : 778 - 780
  • [22] Quantum Algorithm for Triangle Finding in Sparse Graphs
    Le Gall, Francois
    Nakajima, Shogo
    ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 590 - 600
  • [23] Improved Quantum Multicollision-Finding Algorithm
    Hosoyamada, Akinori
    Sasaki, Yu
    Tani, Seiichiro
    Xagawa, Keita
    POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2019, 2019, 11505 : 350 - 367
  • [24] Quantum Algorithm for Triangle Finding in Sparse Graphs
    François Le Gall
    Shogo Nakajima
    Algorithmica, 2017, 79 : 941 - 959
  • [25] Quantum algorithm for the root-finding problem
    Koji Nagata
    Tadao Nakamura
    Quantum Studies: Mathematics and Foundations, 2019, 6 : 135 - 139
  • [26] Quantum algorithm for the root-finding problem
    Nagata, Koji
    Nakamura, Tadao
    QUANTUM STUDIES-MATHEMATICS AND FOUNDATIONS, 2019, 6 (01) : 135 - 139
  • [27] Quantum Algorithm for Polynomial Root Finding Problem
    Sun, Guodong
    Su, Shenghui
    Xu, Maozhi
    2014 TENTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2014, : 469 - 473
  • [28] Quantum Algorithm for Triangle Finding in Sparse Graphs
    Le Gall, Francois
    Nakajima, Shogo
    ALGORITHMICA, 2017, 79 (03) : 941 - 959
  • [29] Efficient quantum circuits for arbitrary sparse unitaries
    Jordan, Stephen P.
    Wocjan, Pawel
    PHYSICAL REVIEW A, 2009, 80 (06):
  • [30] From multiplicative unitaries to quantum groups II
    Soltan, Piotr M.
    Woronowicz, Stanislaw L.
    JOURNAL OF FUNCTIONAL ANALYSIS, 2007, 252 (01) : 42 - 67