Glenn R. Luecke

Glenn R. Luecke

Auto-generated profile, based on publicly available information

Glenn R. Luecke

Department of Mathematics Iowa State University 50011 Ames IA USA

Research Focus & Metrics

Academic Career Length

25Years (2002-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.

6 January 2003 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
GLGlenn Luecke
Glenn Luecke
HCHua Chen
Hua Chen
JCJames Coyle
James Coyle
JHJim Hoekstra
Jim Hoekstra
MKMarina Kraeva
Marina Kraeva
YZYan Zou
Yan Zou

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.

14 August 2002 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
GLGlenn R. Luecke
Glenn R. Luecke
YZYan Zou
Yan Zou
JCJames Coyle
James Coyle
JHJim Hoekstra
Jim Hoekstra
MKMarina Kraeva
Marina Kraeva

10 June 2004 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
GLGlenn R. Luecke
Glenn R. Luecke
SSSilvia Spanoyannis
Silvia Spanoyannis
MKMarina Kraeva
Marina Kraeva

4 April 2006 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
GLGlenn R. Luecke
Glenn R. Luecke
JCJames Coyle
James Coyle
JHJim Hoekstra
Jim Hoekstra
MKMarina Kraeva
Marina Kraeva
YLYing Li
Ying Li
YWYanmei Wang
Yanmei Wang