Related papers: Semidefinite Programs at Finite Fermion Density
We introduce a machine-learning density-functional-theory formalism for the spinless Hubbard model in one dimension at both zero and finite temperature. In the zero-temperature case this establishes a one-to-one relation between the site…
We give asymptotically converging semidefinite programming hierarchies of outer bounds on bilinear programs of the form $\mathrm{Tr}\big[M(X\otimes Y)\big]$, maximized with respect to semidefinite constraints on $X$ and $Y$. Applied to the…
Bounded linear types have proved to be useful for automated resource analysis and control in functional programming languages. In this paper we introduce an affine bounded linear typing discipline on a general notion of resource which can…
We present for the first time time-dependent density-matrix renormalization-group simulations (t-DMRG) at finite temperatures. It is demonstrated how a combination of finite-temperature t-DMRG and time-series prediction allows for an easy…
In the study of quantum limits to parameter estimation, the high dimensionality of the density operator and that of the unknown parameters have long been two of the most difficult challenges. Here we propose a theory of quantum…
Lattice QCD at nonzero baryon density is a big challenge in hadron physics. In this presentation, I discuss the quantum computation of lattice gauge theory at nonzero density. I show some benchmark results of the Schwinger model obtained by…
The study of QCD at finite baryon density is severely hampered by the so-called fermion sign problem. As a result, we have no known first principles approach to study nuclear matter, or neutron stars from QCD. On the surface, the large Nc…
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model…
In this note, we show the class of finite, epistemic programs to be Turing complete. Epistemic programs is a widely used update mechanism used in epistemic logic, where it such are a special type of action models: One which does not contain…
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum…
The grand partition function of a model of confined quarks is exactly calculated at arbitrary temperatures and quark chemical potentials. The model is inspired by a softly BRST-broken version of QCD and possesses a quark mass function…
One of the potential applications of a quantum computer is solving quantum chemical systems. It is known that one of the fastest ways to obtain somewhat accurate solutions classically is to use approximations of density functional theory.…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. These…
We study the light-front Schwinger model at finite temperature following the recent proposal in \cite{alves}. We show that the calculations are carried out efficiently by working with the full propagator for the fermion, which also avoids…
This paper studies a class of so-called linear semi-infinite polynomial programming (LSIPP) problems. It is a subclass of linear semi-infinite programming problems whose constraint functions are polynomials in parameters and index sets are…
Fermionic reduced density matrices summarize the key observables in fermionic systems. In electronic systems, the two-particle reduced density matrix (2-RDM) is sufficient to determine the energy and most physical observables of interest.…
We study the sign problem of the fermion determinant at nonzero baryon chemical potential. For this purpose we apply a simple model derived from Quantum Chromodynamics, in the limit of large chemical potential and mass. For SU(2) color,…
We present an unconstrained tree tensor network approach to the study of lattice gauge theories in two spatial dimensions showing how to perform numerical simulations of theories in presence of fermionic matter and four-body magnetic terms,…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…