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 条
  • [41] A quantum algorithm for finding minimum exclusive-or expressions
    Sampson, M.
    Voudouris, D.
    Papakonstantinou, G.
    IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI, PROCEEDINGS: EMERGING VLSI TECHNOLOGIES AND ARCHITECTURES, 2007, : 416 - +
  • [42] An improved claw finding algorithm using quantum walk
    Tani, Seiichiro
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 536 - 547
  • [43] Global Roots and Poles Finding Algorithm on Quantum Computer
    Buczkowski, Jakub
    Kozminski, Tomasz
    Szczepanski, Filip
    Wilinski, Michal
    Stefanski, Tomasz P.
    IEEE ACCESS, 2024, 12 : 181041 - 181051
  • [44] Shorter gate sequences for quantum computing by mixing unitaries
    Campbell, Earl
    PHYSICAL REVIEW A, 2017, 95 (04)
  • [45] Quantum tomography using state-preparation unitaries
    van Apeldoorn, Joran
    Cornelissen, Arjan
    Gilyen, Andras
    Nannicini, Giacomo
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 1265 - 1318
  • [46] A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
    Wakakuwa, Eyuri
    Soeda, Akihito
    Murao, Mio
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (08) : 5372 - 5403
  • [47] AN EFFICIENT GREEDY ALGORITHM FOR FINDING THE NEAREST SIMULTANEOUS DIAGONALIZABLE FAMILY
    Akema, Riku
    Yamagishi, Masao
    Yamada, Isao
    2018 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2018, : 771 - 775
  • [48] Parallel Quantum Algorithm for Finding the Consistency of Saaty's Matrices
    Piech, Henryk
    Siedlecka-Lamch, Olga
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, PT I, 2012, 7203 : 102 - 111
  • [49] Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
    Le Gall, Francois
    2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 216 - 225
  • [50] A new quantum claw-finding algorithm for three functions
    Kazuo Iwama
    Akinori Kawachi
    New Generation Computing, 2003, 21 : 319 - 327