30 citations · 63 across the 7 of their papers we have counts for
Showing 2018 · quant-phShow all
2 papers · 2 filters
quant-ph2018★ 26 cited
Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience
Karthik Srinivasan, Saipriya Satyajit, Bikash K. Behera +1
The famous Travelling Salesman Problem (TSP) is an important category of optimization problems that is mostly encountered in various areas of science and engineering. Studying opti…
quant-ph2018
Solving Linear Systems of Equations by Using the Concept of Grover's Search Algorithm: An IBM Quantum Experience
Rituparna Maji, Bikash K. Behera, Prasanta K. Panigrahi
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for so…