Related papers: Quantitatively improved finite-size criteria for s…
The present review is devoted to the problems of finite-size scaling due to the presence of long-range interaction decaying at large distance as $1/r^{d+\sigma}$, where $d$ is the spatial dimension and the long-range parameter $\sigma>0$.…
Most of the calculations in standard sphere decoders are redundant, in the sense that they either calculate quantities that are never used or calculate some quantities more than once. A new method, which is applicable to lattices as well as…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
Let (X,d) be a finite metric space. This paper first discusses the spectrum of the p-distance matrix of a finite metric space of p-negative type and then gives upper and lower bounds for the so called gap of a finite metric space of strict…
In order to reach (sub-)per cent level precision in lattice calculations of the hadronic vacuum polarisation, isospin breaking corrections must be included. This requires introducing QED on the lattice, and the associated finite-size…
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our…
Scalable frames are frames with the property that the frame vectors can be rescaled resulting in tight frames. However, if a frame is not scalable, one has to aim for an approximate procedure. For this, in this paper we introduce three…
An efficient scheme to compute the geometric entanglement per lattice site for quantum many-body systems on a periodic finite-size chain is proposed in the context of a tensor network algorithm based on the matrix product state…
We construct a variety of supersymmetric gauge theories on a spatial lattice, including N=4 supersymmetric Yang-Mills theory in 3+1 dimensions. Exact lattice supersymmetry greatly reduces or eliminates the need for fine tuning to arrive at…
In the microcanonical ensemble, suitably defined observables show non-analyticities and power law behaviour even for finite systems. For these observables, a microcanonical finite-size scaling theory is established which facilitates an…
Open quantum-system dynamics can follow exponential decay, non-exponential relaxation, or oscillatory dynamics, depending on the system-environment coupling. We study a lattice with a boundary defect that transitions between these regimes,…
We prove that for any finite set of generalized valence bond solid (GVBS) states of a quantum spin chain there exists a translation invariant finite-range Hamiltonian for which this set is the set of ground states. This result implies that…
We estimate the size of the spectral gap at zero for some Hermitian block matrices. Included are quasi-definite matrices, quasi-semidefinite matrices (the closure of the set of the quasi-definite matrices) and some related block matrices…
Calculations of the heavy-heavy spectrum present a good opportunity for precision tests of QCD using lattice techniques. All methods make use of a non-relativistic expansion of the action and its systematic improvement to remove lattice…
Demonstrating quantum speedup for approximate optimization of classical spin glasses is of current interest. Such a demonstration must be done with respect to the best-known scaling of classical heuristics at a given optimality gap of a…
The problem of determining the existence of a spectral gap in a lattice quantum spin system was previously shown to be undecidable for one [J. Bausch et al., "Undecidability of the spectral gap in one dimension", Physical Review X 10…
Gradient-based optimization is a key ingredient of variational quantum algorithms, with applications ranging from quantum machine learning to quantum chemistry and simulation. The parameter-shift rule provides a hardware-friendly method for…
Topology optimization using gradient search with negative and positive elliptical masks and honeycomb tessellation is presented. Through a novel skeletonization algorithm for topologies defined using filled and void hexagonal…
The status of lattice calculations in Quantum Field Theory is reviewed. A major part is devoted to recent progress in formulating exact chiral symmetry on the lattice. Another topic which has received a lot of attention is the influence of…
We present a robust scheme to derive effective models non-perturbatively for quantum lattice models when at least one degree of freedom is gapped. A combination of graph theory and the method of continuous unitary transformations (gCUTs) is…