Related papers: Quantum Markov Chains on the Comb graphs: Ising mo…

We study the phase diagram of a class of models in which a generalized cluster interaction can be quenched by Ising exchange interaction and external magnetic field. We characterize the various phases through winding numbers. They may be…

Measurement-based quantum computation (MBQC) represents a powerful and flexible framework for quantum information processing, based on the notion of entangled quantum states as computational resources. The most prominent application is the…

The discovery of nontrivial topology in quantum critical states has introduced a new paradigm for classifying quantum phase transitions and challenges the conventional belief that topological phases are typically associated with a bulk…

We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…

We explore the phase diagram of Ising spins on one-dimensional chains which criss-cross in two perpendicular directions and which are connected by interchain couplings. This system is of interest as a simpler, classical analog of a quantum…

We study the magnetic behaviors of a spin-1/2 quantum compass chain (QCC) in a transverse magnetic field, by means of the analytical spinless fermion approach and numerical Lanczos method. In the absence of the magnetic field, the phase…

We study the two-dimensional Ising model on a network with a novel type of quenched topological (connectivity) disorder. We construct random lattices of constant coordination number and perform large scale Monte Carlo simulations in order…

We propose that neuromorphic computing can perform quantum operations. Spiking neurons in the active or silent states are connected to the two states of Ising spins. A quantum density matrix is constructed from the expectation values and…

The article introduces a new method for applying Quantum Clustering to graph structures. Quantum Clustering (QC) is a novel density-based unsupervised learning method that determines cluster centers by constructing a potential function. In…

Analogously to the quantum case considered in Cruz-de-la-Rosa and Guerrero-Poblete (Open Syst. Inf. Dyn. 32, 2550005, 2025), this work proposes a graph-theoretic approach to studying non-equilibrium properties in Markov chains. We prove…

In this research paper, weighted / unweighted, directed / undirected graphs are associated with interesting Discrete Time Markov Chains (DTMCs) as well as Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of such…

Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…

Markov chains are one of the well-known tools for modeling and analyzing stochastic systems. At the same time, they are used for constructing random walks that can achieve a given stationary distribution. This paper is concerned with…

We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us…

We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as…

We have studied the antiferromagnetic Ising chain in a transverse magnetic field $h_{x}$ and uniform longitudinal field $h_{z}$. Using the density matrix renormalization group calculation combined with a finite-size scaling the ground state…

Sampling problems are promising candidates for demonstrating quantum advantage, and one approach known as quantum-enhanced Markov chain Monte Carlo [Layden, D. et al., Nature 619, 282-287 (2023)] uses quantum samples as a proposal…

We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…

In this paper, we consider the classical Ising model on the Cayley tree of order k and show the existence of the phase transition in the following sense: there exists two quantum Markov states which are not quasi-equivalent. It turns out…

A Quark-Meson Coupling (QMC) model is extended to finite nuclei in the relativistic mean-field or Hartree approximation. The ultra-relativistic quarks are assumed to be bound in non-overlapping nucleon bags, and the interaction between…