Publications
Talk · Lecture notes in computer science · January 1, 2019
On the Quantum and Classical Complexity of Solving Subtraction Games
Dmitry Kravchenko, Kamil Ravilevich Khadiev, Danil Serov
Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in GraphsQuantum Information and Cryptographysubtraction gamesquantum algorithmsquery complexity
More by Kamil Khadiev
- Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering PatharXiv · 2026
- Quantum k-means based on Quantum Local Sensitive Hashing with Application to Irrigation Machine Sensors Data ClusteringIEEE International Conference on Smart Computing Workshops and Other Affiliated Events · 2026
- Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity GrapharXiv · 2026
- Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs Based on 1-Cover PathInternational Conference on Quantum Communications, Networking, and Computing · 2026 · Citations: 1