ILIsaac Lyngaas

Isaac Lyngaas

*This is an algorithmically generated author record based on publicly available information.

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


Isaac Lyngaas has a total of 48 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Precision Limits of Hamiltonian Learning for Quantum Processors under Calibration Uncertainty

    by Yi Pan, Meng Hsiu Tsai, Hanqi Jiang, Junhao Chen, Wei Zhang, Isaac Lyngaas, Yingfeng Wang, Tianming Liu

    Learning the Hamiltonian of a quantum processor is important for controlling and certifying quantum devices, but the state preparation and measurement used to probe it are themselves imperfect. Even when exact data identify an interaction uniquely, identifiability alone does not determine finite-data precision. Here we show, for n-qubit Markovian dynamics under geometric regularity conditions, that the local uncertainty of a Hamiltonian coefficient scales either linearly or as the square root of the entrywise error in the generator matrix in the readout gauge. Square-root scaling occurs exactly when a gauge transformation moves the coefficient at first order while noise positivity can be restored at second order, and real noise correlations drive this first-order change. As a consequence, under suitable dynamical and readout conditions, square-root scaling forces uniformly valid confidence intervals from N shots to have expected length Ω(N⁻¹⁄⁴), even for adaptive local experiments. Under a common generator norm bound, estimating this matrix attains this rate up to logarithmic factors. Experiments on three superconducting processors show that additional measurement bases increase the visibility of injected rotations at a matched number of shots. Whether a coupling admits the usual N⁻¹⁄² scaling is therefore set by how noise correlations and positivity constrain its gauge directions.

  • Open Access

    Efficient and identifiable noise models for symmetry-preserving quantum circuits

    by Yi Pan, Meng Hsiu Tsai, Hanqi Jiang, Junhao Chen, Weihang You, Yifan Zhou, Wei Zhang, Isaac Lyngaas, Yingfeng Wang, Tianming Liu

    Noise models support quantum-circuit simulation and need recalibration as hardware and workloads change. For circuits whose ideal outputs occupy one Hamming-weight sector, independent bit-flip (IBF) models tie leakage from the sector to the flip rate. We introduce SA-IBF, a two-parameter closed-form model whose sector-preserving weight mixes independent bit flips with flips conditioned on the sector to control this leakage separately. For nonzero weights, no mixture of product bit-flip channels reproduces its kernel. Given ideal distributions, we derive local identifiability conditions and a rank diagnostic for each fit. Across two data sets on four IBM Heron processors, SA-IBF predicts test data with lower Hellinger distance than IBF on every execution. On molecular quantum-autoencoder circuits, it matches a 21-parameter noise model fitted by Bayesian optimization to within 0.01 in Hellinger distance at three of four qubit numbers, at over 200-fold lower computational cost. This enables low-cost noise modeling of small symmetry-preserving circuits.

  • Open Access

    ORBIT-2: Scaling Exascale Vision Foundation Models for Weather and Climate Downscaling

    by Xiao Wang, Jong-Youl Choi, Takuya Kurihaya, Isaac Lyngaas, Hong-Jun Yoon, Xi Xiao, David Pugmire, Ming Fan, Nasik Muhammad Nafi, Aristeidis Tsaris, et al.


  • Open Access

    Distributed Cross-Channel Hierarchical Aggregation for Foundation Models

    by Aristeidis Tsaris, Isaac Lyngaas, John Lagergren, Mohamed Wahib, Larry York, Prasanna Balaprakash, Dan Lu, Feiyi Wang, Xiao Wang


  • Open Access

    Real-time High-resolution X-Ray Computed Tomography

    by Du Wu, Peng Chen, Xiao Wang, Issac Lyngaas, Takaaki Miyajima, Toshio Endo, Satoshi Matsuoka, Mohamed Wahib

    Computed Tomography (CT) serves as a key imaging technology that relies on computationally intensive filtering and back-projection algorithms for 3D image reconstruction. While conventional high-resolution image reconstruction (> 2K3) solutions provide quick results, they typically treat reconstruction as an offline workload to be performed remotely on large-scale HPC systems. The growing demand for post-construction AI-driven analytics and the need for real-time adjustments call for high-resolution reconstruction solutions that are feasible on local computing resources, i.e. a multi-GPU server at most. In this paper, we propose a novel approach that utilizes Tensor Cores to optimize image reconstruction without sacrificing precision. We also introduce a framework designed to enable real-time execution of end-to-end distributed image reconstruction in a multi-GPU environment. Evaluations conducted on a single Nvidia A100 and H100 GPU show performance improvements of 1.91 × and 2.15 × compared to highly optimized production libraries. Furthermore, our framework, when deployed on 8-card Nvidia A100 GPU system, demonstrates the ability to reconstruct real-world datasets into 20483 volumes (32 GB) in slightly more than one minute and 40963 volumes (256 GB) in 7 minutes.


  • Open Access

    Path-BigBird: An AI-Driven Transformer Approach to Classification of Cancer Pathology Reports

    by Mayanka Chandrashekar, Isaac Lyngaas, Heidi A. Hanson, Shang Gao, Xiao-Cheng Wu, John Gounley

    PURPOSE: Surgical pathology reports are critical for cancer diagnosis and management. To accurately extract information about tumor characteristics from pathology reports in near real time, we explore the impact of using domain-specific transformer models that understand cancer pathology reports. METHODS: We built a pathology transformer model, Path-BigBird, by using 2.7 million pathology reports from six SEER cancer registries. We then compare different variations of Path-BigBird with two less computationally intensive methods: Hierarchical Self-Attention Network (HiSAN) classification model and an off-the-shelf clinical transformer model (Clinical BigBird). We use five pathology information extraction tasks for evaluation: site, subsite, laterality, histology, and behavior. Model performance is evaluated by using macro and micro F1 scores. RESULTS: We found that Path-BigBird and Clinical BigBird outperformed the HiSAN in all tasks. Clinical BigBird performed better on the site and laterality tasks. Versions of the Path-BigBird model performed best on the two most difficult tasks: subsite (micro F1 score of 72.53, macro F1 score of 35.76) and histology (micro F1 score of 80.96, macro F1 score of 37.94). The largest performance gains over the HiSAN model were for histology, for which a Path-BigBird model increased the micro F1 score by 1.44 points and the macro F1 score by 3.55 points. Overall, the results suggest that a Path-BigBird model with a vocabulary derived from well-curated and deidentified data is the best-performing model. CONCLUSION: The Path-BigBird pathology transformer model improves automated information extraction from pathology reports. Although Path-BigBird outperforms Clinical BigBird and HiSAN, these less computationally expensive models still have utility when resources are constrained.


  • Open Access

    Language Models for the Prediction of SARS-CoV-2 Inhibitors

    by Andrew E Blanchard, John Gounley, Debsindhu Bhowmik, Mayanka Chandra Shekar, Isaac Lyngaas, Shang Gao, Junqi Yin, Aristeidis Tsaris, Feiyi Wang, Jens Glaser

    The COVID-19 pandemic highlights the need for computational tools to automate and accelerate drug design for novel protein targets. We leverage deep learning language models to generate and score drug candidates based on predicted protein binding affinity. We pre-trained a deep learning language model (BERT) on ∼9.6 billion molecules and achieved peak performance of 603 petaflops in mixed precision. Our work reduces pre-training time from days to hours, compared to previous efforts with this architecture, while also increasing the dataset size by nearly an order of magnitude. For scoring, we fine-tuned the language model using an assembled set of thousands of protein targets with binding affinity data and searched for inhibitors of specific protein targets, SARS-CoV-2 Mpro and PLpro. We utilized a genetic algorithm approach for finding optimal candidates using the generation and scoring capabilities of the language model. Our generalizable models accelerate the identification of inhibitors for emerging therapeutic targets.


  • SAM++: Porting the E3SM-MMF cloud resolving model using a C++ portability library

    by Isaac Lyngaas, Matthew Norman, Youngsung Kim

    In this work, we demonstrate the process for porting the cloud resolving model (CRM) used in the Energy Exascale Earth System Model Multi-Scale Modeling Framework (E3SM-MMF) from its original Fortran code base to C++ code using a portability library. This porting process is performed using the Yet Another Kernel Library (YAKL), a simplified C++ portability library that specializes in Fortran porting. In particular, we detail our step-by-step approach for porting the System for Atmospheric Modeling (SAM), the CRM used in E3SM-MMF, using a hybrid Fortran/C++ framework that allows for systematic reproduction and correctness testing of gradually ported YAKL C++ code. Additionally, analysis is done on the performance of the ported code using OLCF’s Summit supercomputer.


  • Using radial basis function‐generated quadrature rules to solve nonlocal continuum models

    by Isaac Lyngaas, Janet S. Peterson

    The goal of this work is to expand on a previously devised approach for approximating nonlocal diffusion and nonlocal anomalous diffusion models with continuous solutions which used radial basis functions to generate accurate quadrature rules for the nonlocal integrals. We extend this approach to solve nonlocal models for convection‐diffusion problems and nonlinear advection problems such as Burgers' equation. In addition, nonlocal problems with discontinuous solutions are considered for cases where the location of the discontinuity is known exactly and when the location is known to be in an interval dependent upon the grid spacing.


  • Using RBF-Generated Quadrature Rules to Solve Nonlocal Anomalous Diffusion

    by Isaac Lyngaas, Janet Peterson

    The goal of this work is to solve nonlocal diffusion and anomalous diffusion problems by approximating the nonlocal integral appearing in the integro-differential equation by novel quadrature rules. These quadrature rules are derived so that they are exact for a nonlocal integral evaluated at translations of a given radial basis function (RBF). We first illustrate how to derive RBF-generated quadrature rules in one dimension and demonstrate their accuracy for approximating a nonlocal integral. Once the quadrature rules are derived as a preprocessing step, we apply them to approximate the nonlocal integral in a nonlocal diffusion problem and when the temporal derivative is approximated by a standard difference approximation a system of difference equations are obtained. This approach is extended to two dimensions where both a circular and rectangular nonlocal neighborhood are considered. Numerical results are provided and we compare our results to published results solving nonlocal problems using standard finite element methods.