Researcher profile

Michael Lindsey

Michael Lindsey contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
10topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

9 published item(s)

preprint2026arXiv

GoForth: Language Models for RNA Design under Structure, Sequence, and Coding Constraints

RNA inverse sequence design has broad biological and engineering applications, but computational methods for practical design queries remain limited. Such queries may impose several constraints at once, including target folds or motifs, fixed bases, and coding restrictions, while leaving arbitrary sequence and structure in unspecified regions. Because these constraints may permit many acceptable sequences, we study RNA design as a conditional generative modeling problem. The basic object is a conditional law over RNA sequences given a user-specified condition, with full inverse folding as a special case. We introduce GoForth, a forward-trained RNA language model that conditions on structure, sequence, and coding targets. The formulation separates three ingredients that are often entangled in RNA design: a sequence prior, a forward folding sampler, and a reward or likelihood oracle. We train encoder-decoder models on witnessed folds rather than on outputs from an inverse-design teacher and validate our methodology on full inverse-folding benchmarks, as well as tasks involving constraints on structure, sequence, and coding. The resulting models achieve fast and high-quality candidate generation for mixed RNA design specifications. Moreover they furnish useful semantic embeddings of design tasks and a robust learned notion of designability.

preprint2025arXiv

Simple Diagonal State Designs with Reconfigurable Real-Time Circuits

Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.

preprint2024arXiv

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

preprint2020arXiv

Efficient hybridization fitting for dynamical mean-field theory via semi-definite relaxation

We introduce a nested optimization procedure using semi-definite relaxation for the fitting step in Hamiltonian-based cluster dynamical mean-field theory (DMFT) methodologies. We show that the proposed method is more efficient and flexible than state-of-the-art fitting schemes, which allows us to treat as large a number of bath sites as the impurity solver at hand allows. We characterize its robustness to initial conditions and symmetry constraints, thus providing conclusive evidence that in the presence of a large bath, our semi-definite relaxation approach can find the correct set of bath parameters without needing to include \emph{a priori} knowledge of the properties that are to be described. We believe this method will be of great use for Hamiltonian-based calculations, simplifying and improving one of the key steps in cluster dynamical mean-field theory calculations.

preprint2020arXiv

Enhancing robustness and efficiency of density matrix embedding theory via semidefinite programming and local correlation potential fitting

Density matrix embedding theory (DMET) is a powerful quantum embedding method for solving strongly correlated quantum systems. Theoretically, the performance of a quantum embedding method should be limited by the computational cost of the impurity solver. However, the practical performance of DMET is often hindered by the numerical stability and the computational time of the correlation potential fitting procedure, which is defined on a single-particle level. Of particular difficulty are cases in which the effective single-particle system is gapless or nearly gapless. To alleviate these issues, we develop a semidefinite programming (SDP) based approach that can significantly enhance the robustness of the correlation potential fitting procedure compared to the traditional least squares fitting approach. We also develop a local correlation potential fitting approach, which allows one to identify the correlation potential from each fragment independently in each self-consistent field iteration, avoiding any optimization at the global level. We prove that the self-consistent solutions of DMET using this local correlation potential fitting procedure are equivalent to those of the original DMET with global fitting. We find that our combined approach, called L-DMET, in which we solve local fitting problems via semidefinite programming, can significantly improve both the robustness and the efficiency of DMET calculations. We demonstrate the performance of L-DMET on the 2D Hubbard model and the hydrogen chain. We also demonstrate with theoretical and numerical evidence that the use of a large fragment size can be a fundamental source of numerical instability in the DMET procedure.

preprint2020arXiv

Semidefinite relaxation of multi-marginal optimal transport for strictly correlated electrons in second quantization

We consider the strictly correlated electron (SCE) limit of the fermionic quantum many-body problem in the second-quantized formalism. This limit gives rise to a multi-marginal optimal transport (MMOT) problem. Here the marginal state space for our MMOT problem is the binary set $\{0,1\}$, and the number of marginals is the number $L$ of sites in the model. The costs of storing and computing the exact solution of the MMOT problem both scale exponentially with respect to $L$. We propose an efficient convex relaxation which can be solved by semidefinite programming (SDP). In particular, the semidefinite constraint is only of size $2L\times 2L$. Moreover, the SDP-based method yields an approximation of the dual potential needed to the perform self-consistent field iteration in the so-called Kohn-Sham SCE framework, which, once converged, yields a lower bound for the total energy of the system. We demonstrate the effectiveness of our methods on spinless and spinful Hubbard-type models. Numerical results indicate that our relaxation methods yield tight lower bounds for the optimal cost, in the sense that the error due to the semidefinite relaxation is much smaller than the intrinsic modeling error of the Kohn-Sham SCE method. We also describe how our relaxation methods generalize to arbitrary MMOT problems with pairwise cost functions.

preprint2020arXiv

Sparsity pattern of the self-energy for classical and quantum impurity problems

We prove that for various impurity models, in both classical and quantum settings, the self-energy matrix is a sparse matrix with a sparsity pattern determined by the impurity sites. In the quantum setting, such a sparsity pattern has been known since Feynman. Indeed, it underlies several numerical methods for solving impurity problems, as well as many approaches to more general quantum many-body problems, such as the dynamical mean field theory. The sparsity pattern is easily motivated by a formal perturbative expansion using Feynman diagrams. However, to the extent of our knowledge, a rigorous proof has not appeared in the literature. In the classical setting, analogous considerations lead to a perhaps less-known result, i.e., that the precision matrix of a Gibbs measure of a certain kind differs only by a sparse matrix from the precision matrix of a corresponding Gaussian measure. Our argument for this result mainly involves elementary algebraic manipulations and is in particular non-perturbative. Nonetheless, the proof can be robustly adapted to various settings of interest in physics, including quantum systems (both fermionic and bosonic) at zero and finite temperature, non-equilibrium systems, and superconducting systems.

preprint2020arXiv

Variational embedding for quantum many-body problems

Quantum embedding theories are powerful tools for approximately solving large-scale strongly correlated quantum many-body problems. The main idea of quantum embedding is to glue together a highly accurate quantum theory at the local scale and a less accurate quantum theory at the global scale. We introduce the first quantum embedding theory that is also variational, in that it is guaranteed to provide a one-sided bound for the exact ground-state energy. Our method, which we call the variational embedding method, provides a lower bound for this quantity. The method relaxes the representability conditions for quantum marginals to a set of linear and semidefinite constraints that operate at both local and global scales, resulting in a semidefinite program (SDP) to be solved numerically. The accuracy of the method can be systematically improved. The method is versatile and can be applied, in particular, to quantum many-body problems for both quantum spin systems and fermionic systems, such as those arising from electronic structure calculations. We describe how the proper notion of quantum marginal, sufficiently general to accommodate both of these settings, should be phrased in terms of certain algebras of operators. We also investigate the duality theory for our SDPs, which offers valuable perspective on our method as an embedding theory. As a byproduct of this investigation, we describe a formulation for efficiently implementing the variational embedding method via a partial dualization procedure and the solution of quantum analogs of the Kantorovich problem from optimal transport theory.

preprint2017arXiv

Variational structure of Luttinger-Ward formalism and bold diagrammatic expansion for Euclidean lattice field theory

The Luttinger-Ward functional was proposed more than five decades ago to provide a link between static and dynamic quantities in a quantum many-body system. Despite its widespread usage, the derivation of the Luttinger-Ward functional remains valid only in the formal sense, and even the very existence of this functional has been challenged by recent numerical evidence. In a simpler and yet highly relevant regime, namely the Euclidean lattice field theory, we rigorously prove that the Luttinger-Ward functional is a well-defined universal functional over all physical Green's functions. Using the Luttinger-Ward functional, the free energy can be variationally minimized with respect to Green's functions in its domain. We then derive the widely used bold diagrammatic expansion rigorously, without relying on formal arguments such as partial resummation of bare diagrams to infinite order.