ALAndrey Y. Lokhov

Andrey Y. Lokhov

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Andrey Y. Lokhov has a total of 92 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Discrete distributions are learnable from metastable samples

    by Abhijith Jayakumar, Andrey Y. Lokhov, Sidhant Misra, Marc Vuffray

    Physically motivated stochastic dynamics are widely used to sample from high-dimensional distributions. However, such samplers often get trapped in metastable states, approximately sampling from a distribution that differs significantly from the desired stationary state. We rigorously show that for multivariable discrete distributions, the true stationary model can nevertheless be recovered from these metastable samples. This relies on a fundamental observation: for distributions satisfying a strong metastability condition, their single-variable conditional probabilities are on average extremely close to those of the true stationary distribution. This remains true even when the two distributions are far apart under global metrics such as Kullback-Leibler divergence. Consequently, we can effectively learn the true model using a conditional-likelihood estimator even when the samples are drawn from a restricted state space. Extending these general results to Ising models, we prove rigorous parameter and structure learning guarantees. Finally, we demonstrate this phenomenon numerically on higher-alphabet spin glass models.

  • Open Access

    Potential Applications of Quantum Computing at Los Alamos National Laboratory, v0.3.0

    by Andreas Baertschi, Francesco Caravelli, Carleton Coffrin, Jonhas Saul Colina, Stephan Johannes Eidenbenz, Abhijith Jayakumar, Ammar Ahmad Kirmani, Scott Ross Lawrence, Minseong Lee, Andrey Lokhov, et al.

  • Open Access

    Efficient Learning of Lattice Gauge Theories with Fermions

    by Shreya Shukla, Yukari Yamauchi, Andrey Y. Lokhov, Scott Lawrence, Abhijith Jayakumar

    We introduce a learning method for recovering action parameters in lattice field theories. Our method is based on the minimization of a convex loss function constructed using the Schwinger-Dyson relations. We show that score matching, a popular learning method, is a special case of our construction of an infinite family of valid loss functions. Importantly, our general Schwinger-Dyson-based construction applies to gauge theories and models with Grassmann-valued fields used to represent dynamical fermions. In particular, we extend our method to realistic lattice field theories including quantum chromodynamics.

  • Open Access

    Learning of Statistical Field Theories

    by Shreya Shukla, Abhijith Jayakumar, Andrey Y. Lokhov

    Recovering microscopic couplings directly from data provides a route to solving the inverse problem in statistical field theories, one that complements the traditional-often computationally intractable-forward approach of predicting observables from an action or Hamiltonian. Here, we propose an approach for the inverse problem that uniformly accommodates systems with discrete, continuous, and hybrid variables. We demonstrate accurate parameter recovery in several benchmark systems-including Wegner's Ising gauge theory, $φ^4$ theory, Schwinger and Sine-Gordon models, and mixed spin-gauge systems, and show how iterating the procedure under coarse-graining reconstructs full non-perturbative renormalization-group flows. This gives direct access to phase boundaries, fixed points, and emergent interactions without relying on perturbation theory. We also address a realistic setting where full gauge configurations may be unavailable, and reformulate learning algorithms for multiple field theories so that they are recovered directly using observables such as correlations from scattering data or quantum simulators. We anticipate that our methodology will find widespread use in practical learning of field theories in strongly coupled regimes where analytical tools might fail.

  • Open Access

    Autoregressive pairwise Graphical Models efficiently find ground state representations of stoquastic Hamiltonians

    by Yuchen Pang, Abhijith Jayakumar, Evan McKinney, Carleton Coffrin, Marc Vuffray, Andrey Y. Lokhov

    We introduce Autoregressive Graphical Models (AGMs) as an Ansatz for modeling the ground states of stoquastic Hamiltonians. Exact learning of these models for smaller systems show the dominance of the pairwise terms in the autoregressive decomposition, which informs our modeling choices when the Ansatz is used to find representations for ground states of larger systems. We find that simple AGMs with pairwise energy functions trained using first-order stochastic gradient methods often outperform more complex non-linear models trained using the more expensive stochastic reconfiguration method. We also test our models on Hamiltonians with frustration and observe that the simpler linear model used here shows faster convergence to the variational minimum in a resource-limited setting.

  • Open Access

    Learning response functions of analog quantum computers: analysis of neutral-atom and superconducting platforms

    by Cenk Tüysüz, Abhijith Jayakumar, Carleton Coffrin, Marc Vuffray, Andrey Y. Lokhov

    Analog quantum computation is an attractive paradigm for the simulation of time-dependent quantum systems. Programmable analog quantum computers have been realized in hardware using a variety of physical principles, including neutral-atom and superconducting technologies. The input parameters of the physical Hamiltonians that are used to program the quantum simulator generally differ from the parameters that characterize the output distribution of data produced under a specified quantum dynamics. The relationship between the input and output parameters is known as the response function of the analog device. Here, we introduce a streaming algorithm for learning the response function of analog quantum computers from arbitrary user inputs, thus not requiring special calibration runs. We use the method to learn and compare the response functions of several generations of analog quantum simulators based on superconducting and neutral-atom programmable arrays.

  • Open Access

    Congruity of genomic and epidemiological data in modeling of local cholera outbreaks

    by Mateusz Wilinski, Lauren Castro, Jeffrey Keithley, Carrie Manore, Josefina Campos, Ethan Romero-Severson, Daryl Domman, Andrey Y. Lokhov

    Cholera continues to be a global health threat. Understanding how cholera spreads between locations is fundamental to the rational, evidence-based design of intervention and control efforts. Traditionally, cholera transmission models have utilized cholera case count data. More recently, whole genome sequence data has qualitatively described cholera transmission. Integrating these data streams may provide much more accurate models of cholera spread, however no systematic analyses have been performed so far to compare traditional case-count models to the phylodynamic models from genomic data for cholera transmission. Here, we use high-fidelity case count and whole genome sequencing data from the 1991-1998 cholera epidemic in Argentina to directly compare the epidemiological model parameters estimated from these two data sources. We find that phylodynamic methods applied to cholera genomics data provide comparable estimates that are in line with established methods. Our methodology represents a critical step in building a framework for integrating case-count and genomic data sources for cholera epidemiology and other bacterial pathogens.

  • Signatures of Open and Noisy Quantum Systems in Single-Qubit Quantum Annealing

    by Los Alamos Los Alamos National Laboratory (Lanl), Zachary Alexander Morrell, Ldrd, Marc Denis Vuffray, Andrey Lokhov, Andreas Baertschi, Tameem Albash, Carleton James Coffrin

    The U.S. Department of Energy's Office of Scientific and Technical Information

  • Top Cited Papers
    Open Access

    Quantum Algorithm Implementations for Beginners

    by Abhijith J., Adetokunbo Adedoyin, John Ambrosiano, Petr Anisimov, William Casper, Gopinath Chennupati, Carleton Coffrin, Hristo Djidjev, David Gunter, Satish Karra, et al.

    As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM’s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.