High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study

Abstract

In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are used to find walk coins making the quantum algorithm more robust to deviations in the coin's parameters. By applying deep neural network we make prediction for the parameters of an optimal coin with arbitrary size and estimate the stability for such coin.

arXiv comment31 pages, 19 figures, added two paragraphs and two figures to better explain our results

References in corpus (16)

• A Quantum Random Walk Search Algorithm
• Optimal eavesdropping in cryptography with three-dimensional quantum states
• Implementing the quantum random walk
• Asymptotically Optimal Quantum Circuits for d-level Systems
• Security of Quantum Key Distribution with entangled quNits
• Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
• Quantum Random Walks Hit Exponentially Faster
• Time-efficient implementation of quantum search with qudits
• Qutrit-based semi-quantum key distribution protocol
• Finding paths in tree graphs with a quantum walk
• An efficient protocol of quantum walk in circuit QED
• Quantum diffusion map for nonlinear dimensionality reduction
• Quantum walk on a cylinder
• A single-interaction step implementation of a quantum search in coupled micro-cavities
• Search of clustered marked states with lackadaisical quantum walks
• Optimizing the walk coin in the quantum random walk search algorithm through machine learning