High-dimensional graphs convolution for quantum walks photonic applications

作     者：Abramov, Roman Fedichkin, Leonid Tsarev, Dmitry Alodjants, Alexander 

作者机构：Tech Univ Munich Arcisstr 21 D-80333 Munich Germany Russian Acad Sci Valiev Inst Phys & Technol Moscow 117218 Russia ITMO Univ Inst Adv Data Transfer Kronverksky Pr 49bldg St Petersburg 197101 Russia South Ural State Univ Inst Nat & Exact Sci Quantum Light Engn Lab Lenin Ave 76 Chelyabinsk 454080 Russia 

出 版 物：《QUANTUM INFORMATION PROCESSING》 (量子信息处理)

年 卷 期：2024年第23卷第5期

页      面：175-175页

核心收录：

学科分类：07[理学] 070201[理学-理论物理] 0702[理学-物理学] 

基　　金：Ministry of Science and Higher Education of the Russian Federation Ministry of Science and Higher Education of the Russian Federation [075-15-2022-1116, 2019-1339] South Ural State University 

主　　题：Quantum walks Quantum algorithms Hypercycles Hypercubes Photonic waveguide arrays 

摘      要：Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and hypercycle convolution that preserves quantum walk dynamics. Our method is based on the fact that some graphs represent a result of Kronecker s product of line graphs. We support our methods by means of various numerical experiments that check quantum and classical random walks on hypercycles and their convolutions. Our findings may be useful for saving a significant number of qubits required for algorithms that use quantum walk simulation on quantum devices.