arXiv:1402.6731 · Physical Review A

Entropy rate of message sources driven by quantum walks

Bálint Kollár, Mátyás Koniorczyk

Published Feb 26, 2014• 15 citations

Abstract

The amount of information generated by a discrete time stochastic processes in a single step can be quantified by the entropy rate. We investigate the differences between two discrete time walk models, the discrete time quantum walk and the classical random walk, in terms of entropy rate. We develop analytical methods to calculate and approximate it. This allows us to draw conclusions about the differences between classical stochastic and quantum processes in terms of the classical information theory.

DOI: 10.1103/physreva.89.022338

Related papers

Dynamical Entropy of Quantum Random Walks

Duncan Wright

In this manuscript, we study discrete-time dynamics of systems that arise in physics and information theory, and the measure of disorder in these systems known as dy- namical entropy. The study of dynamics in classical systems is done from two distinct viewpoints: random walks and dynamical systems. Random walks are probabilistic in nature and are described by stochastic processes. On the other hand, dynami- cal systems are described algebraically and deterministic in nature. The measure of disorder from either viewpoint is known as dynamical entropy. Entropy is an essential notion in physics and information theory. Motivated by the study of disorder for the positions and velocities of gas molecules, the notion of entropy was first introduced mathematically by Boltzmann near the end of the 19th Century and gives rise to the second law of thermodynamics. Almost eighty years after Boltzmann, Shannon became the father of the new field of information theory when he produced his groundbreaking works where he used entropy as a measure of information transfer between two sources. In the last two years of the 1950’s, Kolmogorov and Sinai extended the notions of Boltzmann to a dynamical entropy. The Kolmogorov-Sinai dynamical entropy gives a measure for the disorder of a system of particles (e.g. gas molecules) averaged over time, quantifying the uncertainty in the dynamics of a system. The advent of quantum mechanics and its pervasiveness in nature has required the development of non-commutative generalizations of dynamics and dynamical entropy to the quantum regime. Many of each have been proposed. In particular, we recall the definitions of quantum random walks, dynamical systems and Markov chains. We motivate each generalization by relating to its classical counterpart. Quantum dynamical entropy (QDE) is a generalization of the Kolmogorov-Sinai dynamical entropy to quantum mechanics. There have been numerous definitions for QDE beginning with that of Connes, Narnhofer and Thirring in 1987. We focus on the semi- classical approach given by Słomczyński and Życzkowski in 1994 and the quantum Markov chain approach which started with Accardi, Ohya and Watanabe in 1997. Linearity of a dynamical entropy means that the dynamical entropy of the n-fold composition of a dynamical map with itself is equal to n times the dynamical entropy of the map for every positive integer n. We show that the quantum dynamical entropy introduced by Słomczyński and Życzkowski is nonlinear in the time interval between successive measurements of a quantum dynamical system. This is in contrast to Kolmogorov-Sinai dynamical entropy for classical dynamical systems, which is linear in time. We also compute the exact values of quantum dynamical entropy for the Hadamard walk with varying Lüders-von Neumann instruments and partitions. In 1948, Shannon proved the Source Coding Theorem which gives upper and lower bounds on the minimal expected codeword length in terms of the entropy of a ran- dom variable. This theorem can be leveraged to give the minimal expected average codeword length for a string of symbols in terms of entropy rate, which can be in- terpreted as the dynamical entropy of a stochastic process. In 1994, Schumacher defined indeterminate-length quantum codes and proved a Quantum Source Coding Theorem. We introduce the notion of stochastic ensembles of pure states and give a novel representation in terms of quantum Markov chains. Moreover, this representa- tion allows us to extend the Quantum Source Coding Theorem, giving the minimal expected average codeword length of an indeterminate-length quantum code in terms of quantum dynamical entropy. This manuscript includes joint work with Dr. George Androulakis (Mathematics, University of South Carolina).

Jan 1, 20190 citations

Entanglement for discrete-time quantum walks on the line

Ide, Yusuke, Norio Konno, Takuya Machida

The discrete-time quantum walk is a quantum counterpart of the random walk. It is expected that the model plays important roles in the quantum field. In the quantum information theory, entanglement is a key resource. We use the von Neumann entropy to measure the entanglement between the coin and the particle's position of the quantum walks. Also we deal with the Shannon entropy which is an important quantity in the information theory. In this paper, we show limits of the von Neumann entropy and the Shannon entropy of the quantum walks on the one dimensional lattice starting from the origin defined by arbitrary coin and initial state. In order to derive these limits, we use the path counting method which is a combinatorial method for computing probability amplitude.

arXiv:1012.4164Dec 19, 20103 citations

Recurrence in discrete-time quantum stochastic walks

M. Štefaňák, Václav Potoček, İ. Yalçınkaya +2 more

Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which is a quantum stochastic process that interpolates between quantum and classical walk dynamics. Surprisingly, we find that introducing classical randomness can reduce the recurrence probability – despite the fact that the classical random walk returns with certainty – and we identify the conditions under which this intriguing phenomenon occurs. Numerical evaluation of the first-return generating function allows us to investigate the asymptotics of the return probability as the step number approaches infinity. This provides strong evidence that the suppression of recurrence probability is not a transient effect but a robust feature of the underlying quantum-classical interplay in the asymptotic limit. Our results show that for certain tasks discrete-time quantum stochastic walks outperform both classical random walks and unitary quantum walks.

arXiv:2501.08674QuantumJan 22, 20262 citations

Entanglement for quantum walks on the line

Yusuke Ide, Norio Konno, Takuya Machida

Quantum Information and ComputationSep 1, 201111 citations

Entropy Rate of Thermal Diffusion

John L. Haller

The thermal diffusion of a free particle is a random process and generates entropy at a rate equal to twice the particle’s temperature, (in natural units of information per second). The rate is calculated using a Gaussian process with a variance of which is a combination of quantum and classical diffusion. The solution to the quantum diffusion of a free particle is derived from the equation for kinetic energy and its associated imaginary diffusion constant; a real diffusion constant (representing classical diffusion) is shown to be . We find the entropy of the initial state is one natural unit, which is the same amount of entropy the process generates after the de-coherence time, .

Journal of Modern PhysicsJan 1, 20133 citations

Entanglement phenomena in one-dimensional Quantum Walks

Sofía Catalina Rodríguez Vidal

The present work focuses on understanding entanglement in quantum walks. In particular, we analyse this property on a specific one-dimensional quantum walk model, the discrete-time quantum walk. For this, we address entanglement through a measure called quantum negativity. We highlight the relevance of entanglement and quantum walks in quantum information and computation, including a description of quantum information theory. Then, we show the results of an original simulation for negativity in quantum walks, and draw conclusions regarding the behaviour of negativity under a quantum walk evolution for several configurations. Lastly, we address mathematical aspects of these observations and provide formal proofs for some of the numerical re- sults. Due to the interdisciplinary nature of this work, we aim to provide an insight of the behaviour of entanglement in quantum walks and the relevance of this property from a quantum information perspective, as well as shedding a light on the utility of the model and the flexible formalism it provides for testing this property and others.

Jan 1, 20240 citations