High-dimensional graphs convolution for quantum walks photonic applications

DOI10.1007/S11128-024-04351-8MaRDI QIDQ6550783zbMATH OpenFDO

Authors Roman Abramov, Leonid Fedichkin, Dmitry Tsarev, A. P. Alodjants

Publication date 5 June 2024

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-024-04351-8

zbMATH Keywords

hypercubeshypercyclesphotonic waveguide arraysquantum algorithmsquantum walks

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum stochastic calculus (81S25)

Recommendations

• A random walk approach to quantum algorithms
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• Quantum walks in an array of quantum dots
• Quantum walk and its application domains: a systematic review
• Quantum walks: a comprehensive review

Cites work

• Discrete quantum walks hit exponentially faster
• Exponential algorithmic speedup by a quantum walk
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• One-dimensional quantum walks
• QUANTUM HITTING TIME ON THE COMPLETE GRAPH
• Quantum walks and search algorithms
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum walks on graphs
• Quantum walks: a comprehensive review
• Random Walk and the Theory of Brownian Motion
• Topological quantum memory
• Tunneling in double-layer optical waveguides as quantum walks on graphs

Cited in

(2)

• Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice
• Quantum walk on simplicial complexes for simplicial community detection

This page was built for publication: High-dimensional graphs convolution for quantum walks photonic applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550783)