Related papers: Macroscopic cycles for the interchange and quantum…
It is shown that oriented random walk on the Heisenberg group admits exponential intersection tail. As a corollary we get that on any transitive graph of polynomial volume growth, which is not a finite extension of $\mathbb{Z},…
The isotropic XY model $(s=1/2)$ in a transverse field, with uniform long-range interactions among the transverse components of the spins, on the inhomogeneous periodic chain, is studied. The model, composed of $N$ segments with $n$…
Quantum circuits that generate coherent superpositions of stochastic processes are key to many downstream quantum-accelerated tasks, such as risk analysis, importance sampling, and DNA sequencing. However, traditional methods for designing…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
We explore the use of machine-learning techniques to detect quantum speedup in random walks on graphs. Specifically, we investigate the performance of three different neural-network architectures (variations on fully connected and…
The construction of the random intersection graph model is based on a random family of sets. Such structures, which are derived from intersections of sets, appear in a natural manner in many applications. In this article we study the…
The Hopfield model in a transverse field is investigated in order to clarify how quantum fluctuations affect the macroscopic behavior of neural networks. Using the Trotter decomposition and the replica method, we find that the $\alpha$ (the…
A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…
The inherent properties of specific physical systems can be used as metaphors for investigation of the behavior of complex networks. This insight has already been put into practice in previous work, e.g., studying the network evolution in…
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based…
Transformer architectures, capable of capturing sequential dependencies in the history of user interactions, have become the dominant approach in sequential recommender systems. Despite their success, such models consider sequence elements…
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…
If the interaction between qubits in a quantum computer has a non-diagonal form (e.g. the Heisenberg interaction), then one must be able to "switch it off" in order to prevent uncontrolled propagation of states. Therefore, such QC schemes…
We make for the first time a large-scale Monte-Carlo simulation of a ferromagnetic Heisenberg model with dipolar interactions on a two dimensional square lattice with open boundaries using an efficient new technique. We find that a phase…
The Heisenberg model, a quantum mechanical analogue of the Ising model, has a large ground state degeneracy, due to the symmetry generated by the total spin. This symmetry is also responsible for degeneracies in the rest of the spectrum. We…
We give new observations on the mixing dynamics of a continuous-time quantum walk on circulants and their bunkbed extensions. These bunkbeds are defined through two standard graph operators: the join G + H and the Cartesian product of…
The quantum-to-classical correspondence (QCC) in spin models is a puzzling phenomenon where the static susceptibility of a quantum system agrees with its classical-system counterpart, at a different corresponding temperature, within the…
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point. By combining the replica-exchange algorithm with cluster updates…
The competition between interactions and dissipative processes in a quantum many-body system can drive phase transitions of different order. Exploiting a combination of cluster methods and quantum trajectories, we show how the systematic…
Quantum Turing machines are discussed and reviewed in this paper. Most of the paper is concerned with processes defined by a step operator $T$ that is used to construct a Hamiltonian $H$ according to Feynman's prescription. Differences…