English
Related papers

Related papers: Space-efficient Quantization Method for Reversible…

200 papers

The entanglement in a quantum system that possess an internal symmetry, characterized by the Sz-magnetization or U(1)-charge, is distributed among different sectors. The aim of this letter is to gain a deeper understanding of the…

Statistical Mechanics · Physics 2018-07-25 J. C. Xavier , F. C. Alcaraz , G. Sierra

One of the proposals for the exploitation of two-dimensional quantum walks has been the efficient generation of entanglement. Unfortunately, the technological effort required for the experimental realization of standard two-dimensional…

Quantum Physics · Physics 2013-07-12 C. Di Franco , M. Mc Gettrick , T. Machida , Th. Busch

We treat three types of measures of the quantum walk (QW) with the spatial perturbation at the origin, which was introduced by [1]: time averaged limit measure, weak limit measure, and stationary measure. From the first two measures, we see…

Quantum Physics · Physics 2013-06-12 Norio Konno , Tomasz Luczak , Etsuo Segawa

Consider a probability measure on a Hilbert space defined via its density with respect to a Gaussian. The purpose of this paper is to demonstrate that an appropriately defined Markov chain, which is reversible with respect to the measure in…

Statistics Theory · Mathematics 2014-04-21 Natesh S. Pillai , Andrew M. Stuart , Alexandre H. Thiery

We introduce and develop the concept of Maximal Entropy Random Walks (MERWs) on Weighted Bratteli Diagrams (WBDs), maximizing entropy production along paths as a natural criterion for choosing random walks on networks. Initially defined for…

Combinatorics · Mathematics 2025-03-12 Yoann Offret , Sergey Dovgal

We propose a scheme to implement the one-dimensional coined quantum walk with electrons transported through a two-dimensional network of spintronic semiconductor quantum rings. The coin degree of freedom is represented by the spin of the…

Mesoscale and Nanoscale Physics · Physics 2009-07-30 Orsolya Kálmán , Tamás Kiss , Péter Földi

We study a class of Markov chains that model the evolution of a quantum system subject to repeated measurements. Each Markov chain in this class is defined by a measure on the space of matrices. It is then given by a random product of…

Probability · Mathematics 2017-04-03 Tristan Benoist , Martin Fraas , Yan Pautrat , Clément Pellegrini

The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph with a weighted self-loop at each vertex. It uses a generalized Grover coin and the flip-flop shift, which makes it equivalent to Szegedy's quantum Markov…

Quantum Physics · Physics 2020-09-18 Mason L. Rhodes , Thomas G. Wong

We introduce a three-parameter random walk with reinforcement, called the $(\theta,\alpha,\beta)$ scheme, which generalizes the linearly edge reinforced random walk to uncountable spaces. The parameter $\beta$ smoothly tunes the…

Statistics Theory · Mathematics 2013-06-07 Sergio Bacallado , Stefano Favaro , Lorenzo Trippa

We prove that the energy gap of the model proposed by Zhang, Ahmadain, and Klich [1] is exponentially small in the square of the system size. In [2] a class of exactly solvable quantum spin chain models was proposed that have integer spins…

Quantum Physics · Physics 2017-07-21 Lionel Levine , Ramis Movassagh

Open Quantum Random Walks, as developed in \cite{APSS}, are a quantum generalization of Markov chains on finite graphs or on lattices. These random walks are typically quantum in their behavior, step by step, but they seem to show up a…

Probability · Mathematics 2013-12-20 Stephane Attal , Nadine Guillotin-Plantard , Christophe Sabot

In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states (e.g., the spin-up and down states of an…

Quantum Physics · Physics 2023-02-28 Ryo Asaka , Kazumitsu Sakai , Ryoko Yahagi

The capability to generate and manipulate quantum states in high-dimensional Hilbert spaces is a crucial step for the development of quantum technologies, from quantum communication to quantum computation. One-dimensional quantum walk…

It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the…

Probability · Mathematics 2019-02-15 Itai Benjamini , Jonathan Hermon

This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…

Quantum Physics · Physics 2015-01-27 Antonio Sciarretta

Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…

Quantum Physics · Physics 2024-12-02 Shyam Dhamapurkar , Yuhang Dang , Saniya Wagh , Xiu-Hao Deng

Localization is a characteristic phenomenon of space-inhomogeneous quantum walks in one dimension, where particles remain localized around their initial position. The existence of eigenvalues of time evolution operators is a necessary and…

Mathematical Physics · Physics 2022-10-25 Chusei Kiumi , Kei Saito

We consider homogeneous open quantum random walks on a lattice with finite dimensional local Hilbert space and we study in particular the position process of the quantum trajectories of the walk. We prove that the properly rescaled position…

Probability · Mathematics 2022-06-08 Raffaella Carbone , Federico Girotti , Anderson Melchor Hernandez

We investigate the genuinely quantum features of continuous-time quantum walks by combining a single-time and a multi-time quantifier of nonclassicality. On the one hand, we consider the quantum-classical dynamical distance…

Quantum Physics · Physics 2026-04-15 Paolo Luppi , Claudia Benedetti , Andrea Smirne

We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration in the form of…

Probability · Mathematics 2024-01-30 Vishwaraj Doshi , Jie Hu , Do Young Eun