4 citations · 4 across the 2 of their papers we have counts for
2 papers
quant-ph2025
An edge-based and subspace reduction encoding scheme to solve the traveling salesman problem in quantum computers
Anandu Kalleri Madhu, Chi-Kwong Li, Jami Rönkkö +2
This paper introduces a novel edge-based encoding technique for solving the Traveling Salesman Problem (TSP) on a quantum computer, reducing the required number of qubits. For impl…
quant-ph2020★ 4 cited
Quantum walk processes in quantum devices
Anandu Kalleri Madhu, Alexey A. Melnikov, Leonid E. Fedichkin +2
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information s…