66 citations · 158 across the 5 of their papers we have counts for
3 papers · 1 filter
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…
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…
Solving hadron structures using the basis light-front quantization approach on quantum computers
Wenyang Qian, Robert Basili, Soham Pal +2
Quantum computing has demonstrated the potential to revolutionize our understanding of nuclear, atomic, and molecular structure by obtaining forefront solutions in non-relativistic…