Related papers: Quasi-exact ground-state algorithm for the random-…
The information theoretic observables entropy (a measure of disorder), excess entropy (a measure of complexity) and multi information are used to analyze ground-state spin configurations for disordered and frustrated model systems in 2D and…
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. Therefore, it is explained how the respective ground state…
Ground states of three-dimensional EA Ising spin glasses are calculated for sizes up to 14^3 using a combination of a genetic algorithm and cluster-exact approximation. For each realization several independent ground states are obtained.…
We outline the recent results on the ground state for a class of one- and two-dimensional frustrated quantum spin models with competing ferro(F)- and antiferromagnetic (AF) interactions. Frustrated spin systems are known to have many…
Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search of…
The three-state Potts model is numerically investigated on three-dimensional simple cubic lattices of up to \(128^3\) volume, concentrating on the neighborhood of the first-order phase transition separating the ordered and disordered…
In the molecular quantum chemistry community, coupled-cluster (CC) methods are well-recognized for their systematic convergence and reliability. The extension of the theory to extended systems has been comparably recent, so that…
Numerical approximation of quantum states via convex combinations of states with positive partial transposes (bi-PPT state) in multipartite systems constitutes a fundamental challenge in quantum information science. We reformulate this…
We analyze the problem of how different ground states associated to the same set of the Hamiltonian parameters evolve after a sudden quench. To realize our analysis we define a quantitative approach to the local distinguishability between…
We present new algorithms and fast implementations to find efficient approximations for modelling stochastic processes. For many numerical computations it is essential to develop finite approximations for stochastic processes. While the…
We compare the ground state of the random-field Ising model with Gaussian distributed random fields, with its non-equilibrium hysteretic counterpart, the demagnetized state. This is a low energy state obtained by a sequence of slow magnetic…
The generalization of matrix product states (MPS) to continuous systems, as proposed in the breakthrough paper [F. Verstraete, J.I. Cirac, Phys. Rev. Lett. 104, 190405(2010)], provides a powerful variational ansatz for the ground state of…
Compressive sampling has become a widely used approach to construct polynomial chaos surrogates when the number of available simulation samples is limited. Originally, these expensive simulation samples would be obtained at random locations…
We develop exact simulation (also known as perfect sampling) algorithms for a family of assemble-to-order systems. Due to the finite capacity, and coupling in demands and replenishments, known solving techniques are inefficient for larger…
Ground-state properties are central to our understanding of quantum many-body systems. At first glance, it seems natural and essential to obtain the ground state before analyzing its properties; however, its exponentially large Hilbert…
The Potts model is a generalization of the Ising model with $Q>2$ components. In the fully connected ferromagnetic Potts model, a first-order phase transition is induced by varying thermal fluctuations. Therefore, the computational time…
A general procedure based on shift operators is formulated to deal with anharmonic potentials. It is possible to extract the ground state energy analytically using our method provided certain consistency relations are satisfied. Analytic…
This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mechanism consists in over-approximating the automata…
This paper is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states…
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary…