A Machine Learning Study of High Robustness Quantum Walk Search Algorithm with Qudit Householder Coins
In this work, the quantum random walk search algorithm with a walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with an arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are u...
Main Authors: | Hristo Tonchev, Petar Danev |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-03-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/16/3/150 |
Similar Items
-
Reducing number of gates in quantum random walk search algorithm via modification of coin operators
by: Hristo Tonchev, et al.
Published: (2023-03-01) -
Qudits and High-Dimensional Quantum Computing
by: Yuchen Wang, et al.
Published: (2020-11-01) -
Robustness of different modifications of Grover’s algorithm based on generalized Householder reflections with different phases
by: Hristo Tonchev, et al.
Published: (2024-04-01) -
Qudit machine learning
by: Sebastián Roca-Jerat, et al.
Published: (2024-01-01) -
Emulators of Quantum Computers on Qubits and on Qudits
by: Andrey Andreev, et al.
Published: (2022-07-01)