Robert Basili

Dr. Robert Basili


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 December 2022 in Physical Review Research
Verified
Journal Article
Open access
PDF file
WQWenyang Qian
Wenyang Qian
RBRobert Basili
Robert Basili
SPSoham Pal
Soham Pal
GLGlenn Luecke
Glenn Luecke
JVJames P Vary
James P Vary
Quantum computing has demonstrated the potential to revolutionize our understanding of nuclear, atomic, and molecular structure by obtaining forefront solutions in nonrelativistic quantum many-body theory. In this work, we show that quantum computing can be used to solve for the structure of hadrons, governed by strongly interacting relativistic quantum field theory. Following our previous work on light unflavored mesons as a relativistic bound-state problem within the nonperturbative Hamiltonian formalism, we present the numerical calculations on simulated quantum devices using the basis light-front quantization approach. We implement and compare the variational quantum eigensolver and the subspace-search variational quantum eigensolver to find the low-lying mass spectrum of the light meson system and its corresponding light-front wave functions as quantum states from ideal simulators, noisy simulators, and IBM quantum computers. Based on obtained quantum states, we evaluate the meson decay constants and parton distribution functions directly on the quantum circuits. Our calculations on the quantum computers and simulators are in reasonable agreement with accurate numerical solutions solved on classical computers when noises are moderately small, and our overall results are comparable with the available experimental data.

21 August 2023 in Entropy
Verified
Journal Article
Open access
PDF file
WQWenyang Qian
Wenyang Qian
RBRobert Basili
Robert Basili
MEMary Shaina Eshaghian-Wilner
Mary Shaina Eshaghian-Wilner
AKAshfaq Khokhar
Ashfaq Khokhar
GLGlenn Luecke
Glenn Luecke
JVJames P Vary
James P Vary
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 this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.

31 October 2022 in arXiv
Verified
Preprint
Open access
PDF file
WQWenyang Qian
Wenyang Qian
RBRobert Basili
Robert Basili
SPSoham Pal
Soham Pal
GLGlenn Luecke
Glenn Luecke
JVJames P Vary
James P Vary
Quantum computing has demonstrated the potential to revolutionize our understanding of nuclear, atomic, and molecular structure by obtaining forefront solutions in non-relativistic quantum many-body theory. In this work, we show that quantum computing can be used to solve for the structure of hadrons, governed by strongly-interacting relativistic quantum field theory. Following our previous work on light unflavored mesons as a relativistic bound-state problem within the nonperturbative Hamiltonian formalism, we present the numerical calculations on simulated quantum devices using the basis light-front quantization (BLFQ) approach. We implement and compare the variational quantum eigensolver (VQE) and the subspace-search variational quantum eigensolver (SSVQE) to find the low-lying mass spectrum of the light meson system and its corresponding light-front wave functions as quantum states from ideal simulators, noisy simulators, and IBM quantum computers. Based on obtained quantum states, we evaluate the meson decay constants and parton distribution functions directly on the quantum circuits. Our calculations on the quantum computers and simulators are in reasonable agreement with accurate numerical solutions solved on classical computers when noises are moderately small, and our overall results are comparable with the available experimental data.

15 October 2025 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
RBRobert Basili
Robert Basili
WQWenyang Qian
Wenyang Qian
SSShiplu Sarker
Shiplu Sarker
STShuo Tang
Shuo Tang
ACAustin Castellino
Austin Castellino
JVJames P. Vary
James P. Vary

22 July 2025 in Research Square
Verified
Preprint
Open access
PDF file
RBRobert Basili
Robert Basili
WQWenyang Qian
Wenyang Qian
SSShiplu Sarker
Shiplu Sarker
STShuo Tang
Shuo Tang
ACAustin Castellino
Austin Castellino
JVJames P. Vary
James P. Vary
The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers , and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. We analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

14 July 2023 in arXiv
Verified
Preprint
Open access
PDF file
WQWenyang Qian
Wenyang Qian
RBRobert Basili
Robert Basili
MEMary Shaina Eshaghian-Wilner
Mary Shaina Eshaghian-Wilner
AKAshfaq Khokhar
Ashfaq Khokhar
GLGlenn Luecke
Glenn Luecke
JVJames P Vary
James P Vary
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 this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layerwise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.