In-Saeng Suh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
In-Saeng Suh has a total of 141 co-authors. Here are the top co-authors by number of shared publications:
- Grant. J. Mathews
University of Notre Dame
10 shared publications - Muralikrishnan Gopalakrishnan Meena
Oak Ridge National Laboratory
6 shared publications - Ashley Barker
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
5 shared publications - Christopher Fuson
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
5 shared publications - Christopher Zimmer
Oak Ridge National Laboratory
5 shared publications - Feiyi Wang
Oak Ridge National Laboratory
5 shared publications
Latest Publications
- Open Access
- 8 June 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (3)
Quantum solver for single-impurity Anderson models with particle-hole symmetry
Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottleneck in DMFT is in solving the Anderson impurity model (AIM), whose exact solution is classically intractable for large bath sizes. In this work, we benchmark a quantum-classical hybrid solver tailored for particle-hole symmetric AIMs, using the variational quantum eigensolver to prepare the ground state of the model with shallow quantum circuits. The solver uses shallow quantum ansätze and one set of variational parameters to prepare the ground state and its particle and hole excitations, enabling the construction of the impurity Green’s function through a continued-fraction expansion. We evaluate the performance of this approach across a few bath sizes and interaction strengths under noisy, shot-limited conditions. We compare three optimization routines (COBYLA, Adam, and L-BFGS-B) in terms of convergence and fidelity, assess the benefits of estimating a quantum-computed moment correction to the variational energies, and benchmark the approach by comparing the density of states computed from the impurity Green’s function against that obtained using a classical pipeline. Our results demonstrate the feasibility of Green’s function construction on near-term devices and establish practical benchmarks for quantum impurity solvers embedded within self-consistent DMFT loops.
- 8 June 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (3)
Open AccessQuantum solver for single-impurity Anderson models with particle-hole symmetry
Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottleneck in DMFT is in solving the Anderson impurity model (AIM), whose exact solution is classically intractable for large bath sizes. In this work, we benchmark a quantum-classical hybrid solver tailored for particle-hole symmetric AIMs, using the variational quantum eigensolver to prepare the ground state of the model with shallow quantum circuits. The solver uses shallow quantum ansätze and one set of variational parameters to prepare the ground state and its particle and hole excitations, enabling the construction of the impurity Green’s function through a continued-fraction expansion. We evaluate the performance of this approach across a few bath sizes and interaction strengths under noisy, shot-limited conditions. We compare three optimization routines (COBYLA, Adam, and L-BFGS-B) in terms of convergence and fidelity, assess the benefits of estimating a quantum-computed moment correction to the variational energies, and benchmark the approach by comparing the density of states computed from the impurity Green’s function against that obtained using a classical pipeline. Our results demonstrate the feasibility of Green’s function construction on near-term devices and establish practical benchmarks for quantum impurity solvers embedded within self-consistent DMFT loops.
- Top Cited Papers
- 19 March 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
The role of quantum computing in advancing scientific high-performance computing: A perspective from the ADAC institute
- 19 March 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
Top Cited PapersThe role of quantum computing in advancing scientific high-performance computing: A perspective from the ADAC institute
- Open Access
Quantum solver for single-impurity Anderson models with particle-hole symmetry
Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottleneck in DMFT is in solving the Anderson impurity model (AIM), whose exact solution is classically intractable for large bath sizes. In this work, we develop and benchmark a quantum-classical hybrid solver tailored for DMFT applications, using the variational quantum eigensolver (VQE) to prepare the ground state of the AIM with shallow quantum circuits. The solver uses a unified ansatz framework to prepare the particle and hole excitations of the ground-state from parameter-shifted circuits, enabling the reconstruction of the impurity Green's function through a continued-fraction expansion. We evaluate the performance of this approach across a few bath sizes and interaction strengths under noisy, shot-limited conditions. We compare three optimization routines (COBYLA, Adam, and L-BFGS-B) in terms of convergence and fidelity, assess the benefits of estimating a quantum-computed moment (QCM) correction to the variational energies, and benchmark the approach by comparing the reconstructed density of states (DOS) against that obtained using a classical pipeline. Our results demonstrate the feasibility of Green's function reconstruction on near-term devices and establish practical benchmarks for quantum impurity solvers embedded within self-consistent DMFT loops.
Open AccessQuantum solver for single-impurity Anderson models with particle-hole symmetry
Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottleneck in DMFT is in solving the Anderson impurity model (AIM), whose exact solution is classically intractable for large bath sizes. In this work, we develop and benchmark a quantum-classical hybrid solver tailored for DMFT applications, using the variational quantum eigensolver (VQE) to prepare the ground state of the AIM with shallow quantum circuits. The solver uses a unified ansatz framework to prepare the particle and hole excitations of the ground-state from parameter-shifted circuits, enabling the reconstruction of the impurity Green's function through a continued-fraction expansion. We evaluate the performance of this approach across a few bath sizes and interaction strengths under noisy, shot-limited conditions. We compare three optimization routines (COBYLA, Adam, and L-BFGS-B) in terms of convergence and fidelity, assess the benefits of estimating a quantum-computed moment (QCM) correction to the variational energies, and benchmark the approach by comparing the reconstructed density of states (DOS) against that obtained using a classical pipeline. Our results demonstrate the feasibility of Green's function reconstruction on near-term devices and establish practical benchmarks for quantum impurity solvers embedded within self-consistent DMFT loops.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1888-1897
Scaling Hybrid Quantum--HPC Applications with the Quantum Framework
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1888-1897
Open AccessScaling Hybrid Quantum--HPC Applications with the Quantum Framework
- Open Access
- 19 September 2025
- Published by Wiley in Advanced Intelligent Discovery
- Vol. 2 (5)
Factorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data
The optimization of functional materials is important to enhance their properties, but their complex geometries pose great challenges to optimization. Data‐driven algorithms efficiently navigate such complex design spaces by learning relationships between material structures and performance metrics to discover high‐performance functional materials. Surrogate‐based active learning, continually improving its surrogate model by iteratively including high‐quality data points, has emerged as a cost‐effective data‐driven approach. Furthermore, it can be coupled with quantum computing to enhance optimization processes, especially when paired with a special form of surrogate model (i.e., quadratic unconstrained binary optimization), formulated by factorization machine (FM). However, current practices often overlook the variability in design space sizes when determining the initial data size for optimization. In this work, we investigate the optimal initial data sizes required for efficient convergence across various design space sizes. By employing averaged piecewise linear regression, we identify initiation points where convergence begins, highlighting the crucial role of employing adequate initial data in achieving efficient optimization. These results contribute to the efficient optimization of functional materials by ensuring faster convergence and reducing computational costs in FM‐based active learning.
- 19 September 2025
- Published by Wiley in Advanced Intelligent Discovery
- Vol. 2 (5)
Open AccessFactorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data
The optimization of functional materials is important to enhance their properties, but their complex geometries pose great challenges to optimization. Data‐driven algorithms efficiently navigate such complex design spaces by learning relationships between material structures and performance metrics to discover high‐performance functional materials. Surrogate‐based active learning, continually improving its surrogate model by iteratively including high‐quality data points, has emerged as a cost‐effective data‐driven approach. Furthermore, it can be coupled with quantum computing to enhance optimization processes, especially when paired with a special form of surrogate model (i.e., quadratic unconstrained binary optimization), formulated by factorization machine (FM). However, current practices often overlook the variability in design space sizes when determining the initial data size for optimization. In this work, we investigate the optimal initial data sizes required for efficient convergence across various design space sizes. By employing averaged piecewise linear regression, we identify initiation points where convergence begins, highlighting the crucial role of employing adequate initial data in achieving efficient optimization. These results contribute to the efficient optimization of functional materials by ensuring faster convergence and reducing computational costs in FM‐based active learning.
- Top Cited PapersOpen Access
- 16 May 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-8
Quantum annealing for combinatorial optimization: a benchmarking study
- 16 May 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-8
Top Cited PapersOpen AccessQuantum annealing for combinatorial optimization: a benchmarking study
- 1 April 2025
- Published by Office of Scientific and Technical Information (OSTI)
(undefined)
- Open Access
- 1 August 2024
- Published by Office of Scientific and Technical Information (OSTI)
High Performance Computing and Quantum Computing Integration Framework Architecture and Requirements Document
Requirements document outlining a framework for the integration of quantum computing into high performance computing environment
- 1 August 2024
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessHigh Performance Computing and Quantum Computing Integration Framework Architecture and Requirements Document
Requirements document outlining a framework for the integration of quantum computing into high performance computing environment