Related papers: Efficient computation of cumulant evolution and fu…
Integration of quantum computing in generative machine learning models has the potential to offer benefits such as training speed-up and superior feature extraction. However, the existing quantum generative adversarial networks (QGANs) fail…
We show that an high temperature expansion at fixed order parameter can be derived for the quantum Ising model. The basic point is to consider a statistical generating functional associated to the local spin state. The probability at…
Complete information on the equilibrium behaviour and dynamics of a quantum field theory (QFT) is provided by multipoint correlation functions. However, their theoretical calculation is a challenging problem, even for exactly solvable…
Maximum entropy inference and learning of graphical models are pivotal tasks in learning theory and optimization. This work extends algorithms for these problems, including generalized iterative scaling (GIS) and gradient descent (GD), to…
Low temperature dynamics of the S=1/2 Heisenberg chain is studied via a simple ansatz generalizing the conformal mapping and analytic continuation procedures to correlation functions with multiplicative logarithmic factors. Closed form…
We introduce the concept of the quark quasifragmentation function (qFF) using an equal-time and spatially boosted form of the Collins-Soper fragmentation function where the out-meson fragment is replaced by the current asymptotic condition.…
In order to establish the computational equivalence between quantum Turing machines (QTMs) and quantum circuit families (QCFs) using Yao's quantum circuit simulation of QTMs, we previously introduced the class of uniform QCFs based on an…
Nonlocal QFT of one-component scalar field $\varphi$ in $D$-dimensional Euclidean spacetime is considered. The generating functional (GF) of complete Green functions $\mathcal{Z}$ as a functional of external source $j$, coupling constant…
We demonstrate the possibility of a genuine quantum advantage in the efficiency of quantum batteries by analyzing a model that enables a consistent comparison between quantum and classical regimes. Our system consists of $N$ harmonic…
A random number generator for the Kappa velocity distribution in particle simulations is proposed. Approximating the cumulative distribution function with the q-exponential function, an inverse transform procedure is constructed. The…
It is shown that the canonical problem of classical statistical thermodynamics, the computation of the partition function, is in the case of +/-J Ising spin glasses a particular instance of certain simple sums known as quadratically signed…
This paper combines probabilistic and algebraic techniques for computing quantum expectations of operator exponentials (and their products) of quadratic forms of quantum variables in Gaussian states. Such quadratic-exponential functionals…
In this work, we study the pairing Hamiltonian with four particles at finite temperatures on a quantum simulator and a superconducting quantum computer. The excited states are obtained by the variational quantum deflation (VQD). The…
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with impractically small success probabilities or coherent (quantum…
The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the…
Interesting problems in quantum computation take the form of finding low-energy states of (pseudo)spin systems with engineered Hamiltonians that encode the problem data. Motivated by the practical possibility of producing very…
We solve general 1-matrix models without taking the double scaling limit. A method of computing generating functions is presented. We calculate the generating functions for a simple and double torus. Our method is also applicable to more…
We outline a strategy to compute deeply inelastic scattering structure functions using a hybrid quantum computer. Our approach takes advantage of the representation of the fermion determinant in the QCD path integral as a quantum mechanical…
The quantum speed limit (QSL) provides a fundamental upper bound on the speed of quantum evolution, but its evaluation in generic open quantum systems still presents a formidable computational challenge. Herein, we introduce a hybrid…
Systems of interacting quantum spins show a rich spectrum of quantum phases and display interesting many-body dynamics. Computing characteristics of even small systems on conventional computers poses significant challenges. A quantum…