Related papers: Computing the Degenerate Ground Space of Gapped Sp…
We develop a no-go theorem for two-dimensional bosonic systems with crystal symmetries: if there is a half-integer spin at a rotation center, where the point-group symmetry is $\mathbb D_{2,4,6}$, such a system must have a ground-state…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We give a characterization of the class of gapped Hamiltonians introduced in PartI [O]. The Hamiltonians in this class are given as MPS (Matrix product state) Hamiltonians. In [O], we list up properties of ground state structures of…
In this paper, we study a Markov chain-based stochastic gradient algorithm in general Hilbert spaces, aiming at approximating the optimal solution of a quadratic loss function. We establish probabilistic upper bounds on its convergence. We…
We discuss the ground state of a two dimensional electron-lattice system described by a Su-Schrieffer-Heeger type Hamiltonian with a half-filled electronic band, for which it has been pointed out in the previous paper [J. Phys. Soc. Jpn. 69…
A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…
It was recently shown that a version of the greedy algorithm gives a construction of fault-tolerant spanners that is size-optimal, at least for vertex faults. However, the algorithm to construct this spanner is not polynomial-time, and the…
We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…
A technique to forecast spatiotemporal time series is presented. it uses a Proper Ortogonal or Karhunen-Lo\`{e}ve Decomposition to encode large spatiotemporal data sets in a few time-series, and Genetic Algorithms to efficiently extract…
In this work, we analytically investigate a degenerating PDE system for phase separation and complete damage processes considered on a nonsmooth time-dependent domain with mixed boundary conditions. The evolution of the system is described…
In this paper, based on a one-dimensional non-Hermitian spin model with $\mathcal{RT}$-invariant term, we study the non-Hermitian physics for the two (nearly) degenerate ground states. By using the high-order perturbation method, an…
We study the occurrence of ground-state factorization in dimerized $XY$ spin chains in a transverse field. Together with the usual ferromagnetic and antiferromagnetic regimes, a third case emerges, with no analogous in…
We prove that estimating the ground state energy of a translationally-invariant, nearest-neighbour Hamiltonian on a 1D spin chain is QMAEXP-complete, even for systems of low local dimension (roughly 40). This is an improvement over the best…
Given a set of overlapping local views (patches) of a dataset, we consider the problem of finding a rigid alignment of the views that minimizes a $2$-norm based alignment error. In general, the views are noisy and a perfect alignment may…
The topological degeneracy of ground states in transverse field Ising chain cannot be removed by local perturbation and allows it to be a promising candidate for topological computation. We study the dynamic processes of crystallization and…
We consider a network of sensors deployed to sense a spatio-temporal field and estimate a parameter of interest. We are interested in the case where the temporal process sensed by each sensor can be modeled as a state-space process that is…
Graph alignment aims at finding the vertex correspondence between two correlated graphs, a task that frequently occurs in graph mining applications such as social network analysis. Attributed graph alignment is a variant of graph alignment,…
We show that any short-range Hamiltonian with a gap between the ground and excited states can be written as a sum of local operators, such that the ground state is an approximate eigenvector of each operator separately. We then show that…
We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension D of the MPS, we discuss how to minimize the…
The treedepth of a graph $G$ is the least possible depth of an elimination forest of $G$: a rooted forest on the same vertex set where every pair of vertices adjacent in $G$ is bound by the ancestor/descendant relation. We propose an…