40 citations · 41 across the 2 of their papers we have counts for
2 papers
quant-ph2023★ 40 cited
Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem
Wenyang Qian, Robert A. M. Basili, Mary Eshaghian-Wilner +3
The Traveling Salesman Problem (TSP) is one of the most often-used NP-Hard problems in computer science to study the effectiveness of computing models and hardware platforms. In th…
quant-ph2021★ 1 cited
Performance Evaluations of Signed and Unsigned Noisy Approximate Quantum Fourier Arithmetic
Robert A. M. Basili, Wenyang Qian, Shiplu Sarker +6
The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers…