Related papers: Quantum Markov Chains on the Comb graphs: Ising mo…
Topological phases, edge states, and flat bands in synthetic quantum systems are a key resource for topological quantum computing and noise-resilient information processing. We introduce a scheme based on step-dependent quantum walks on…
Graph clustering is a central topic in unsupervised learning with a multitude of practical applications. In recent years, multi-view graph clustering has gained a lot of attention for its applicability to real-world instances where one has…
The ground-state phase diagram and quantum phase transitions (QPTs) in a spin-1 compass chain are investigated by the infinite time-evolving block decimation (iTEBD) method. Various phases are discerned by energy densities, spin…
In this note, a general approach to the study of non-stationary Markov chains with catastrophes and the corresponding queuing models is considered, as well as to obtain estimates of the limiting regime itself. As an illustration, an example…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
We propose to use the steered quantum coherence (SQC) as a signature of quantum phase transitions (QPTs). By considering various spin chain models, including the transverse-field Ising model, \textit{XY} model, and \textit{XX} model with…
In this work, we present a quantum Markov chain algorithm for many-body systems that utilizes a special phase of matter known as the Many-Body Localized (MBL) phase. We show how the properties of the MBL phase enable one to address the…
We perform a quantum simulation of the Ising model with a transverse field using a collection of three trapped atomic ion spins. By adiabatically manipulating the Hamiltonian, we directly probe the ground state for a wide range of fields…
We investigate sudden quenches across the critical point in the transverse field Ising chain with a perturbing non-integrable next-nearest-neighbour interaction. Expressions for the return (Loschmidt) amplitude and associated rate function…
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…
Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of…
Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…
The Markov chain Monte Carlo method as a statistical mechanics technique for the study of macroscopic systems has furnished the scientific community with great knowledge and advances in the theory of phase transitions. While a number of…
A while ago, Luck (J. Stat. Phys. 72 (1993) 417) investigated the critical behaviour of one-dimensional Ising quantum chains with couplings constants modulated according to general non-periodic sequences. In this short note, we take a…
We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time…
We study non-equilibrium dynamics for an ensemble of tilted one-dimensional atomic Bose-Hubbard chains after a sudden quench to the vicinity of the transition point of the Ising paramagnetic to anti-ferromagnetic quantum phase transition.…
We investigate the influence of topology on the magnetic response of inductively coupled superconducting flux-qubit networks. Using exact diagonalization methods and linear response theory, we compare the magnetic response of linear and…
We consider Markov processes of cubic stochastic (in a fixed sense) matrices which are also called quadratic stochastic process (QSPs). A QSP is a particular case of a continuous-time dynamical system whose states are stochastic cubic…
We present a graph-theoretical approach to data clustering, which combines the creation of a graph from the data with Markov Stability, a multiscale community detection framework. We show how the multiscale capabilities of the method allow…
Markov chain Monte Carlo (MCMC) methods are often used in clustering since they guarantee asymptotically exact expectations in the infinite-time limit. In finite time, though, slow mixing often leads to poor performance. Modern computing…