English
Related papers

Related papers: Time-Polynomial Lieb-Robinson bounds for finite-ra…

200 papers

Spin chains have long been considered as candidates for quantum channels to facilitate quantum communication. We consider the transfer of a single excitation along a spin-1/2 chain governed by Heisenberg-type interactions. We build on the…

Quantum Physics · Physics 2010-09-14 Michael Murphy , Simone Montangero , Vittorio Giovannetti , Tommaso Calarco

We review the mathematical speed limits on quantum information processing in many-body systems. After the proof of the Lieb-Robinson Theorem in 1972, the past two decades have seen substantial developments in its application to other…

Quantum Physics · Physics 2023-10-02 Chi-Fang Chen , Andrew Lucas , Chao Yin

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Information Theory · Computer Science 2013-02-08 Yuxin Chen , Jeffrey G. Andrews

Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…

Discrete Mathematics · Computer Science 2011-03-04 Andrea Clementi , Angelo Monti , Francesco Pasquale , Riccardo Silvestri

Motivated by recent experiments with ultra-cold matter, we derive a new bound on the propagation of information in $D$-dimensional lattice models exhibiting $1/r^{\alpha}$ interactions with $\alpha>D$. The bound contains two terms: One…

Quantum Physics · Physics 2015-10-06 Zhe-Xuan Gong , Michael Foss-Feig , Spyridon Michalakis , Alexey V. Gorshkov

We study lower bounds on information dissemination in adversarial dynamic networks. Initially, k pieces of information (henceforth called tokens) are distributed among n nodes. The tokens need to be broadcast to all nodes through a…

Data Structures and Algorithms · Computer Science 2012-08-31 Bernhard Haeupler , Fabian Kuhn

In the problem of influence maximization in information networks, the objective is to choose a set of initially active nodes subject to some budget constraints such that the expected number of active nodes over time is maximized. The linear…

Social and Information Networks · Computer Science 2016-11-06 T. -H. Hubert Chan , Li Ning

The propagation of an external transverse magnetic signal acting locally on a 1d chain of spins generates a disturbance which runs through the system. This quantum effect can be interpreted as a classical traveling wave which contains a…

Quantum Physics · Physics 2015-05-30 Jean Richert , Tarek Khalil

We consider a two type (red and blue or $R$ and $B$) particle population that evolves on the $d$-dimensional lattice according to some reaction-diffusion process $R+B\to 2R$ and starts with a single red particle and a density $\rho$ of blue…

Probability · Mathematics 2009-01-07 A. Gaudilliere , F. R. Nardi

The evaluation of the minimal evolution time between two distinguishable states of a system is important for assessing the maximal speed of quantum computers and communication channels. Lower bounds for this minimal time have been proposed…

Quantum Physics · Physics 2013-02-01 M. M. Taddei , B. M. Escher , L. Davidovich , R. L. de Matos Filho

The hypergeometric distributions have many important applications, but they have not had sufficient attention in information theory. Hypergeometric distributions can be approximated by binomial distributions or Poisson distributions. In…

Probability · Mathematics 2020-02-11 Peter Harremoës , František Matúš

We consider a model for the propagation of a driven interface through a random field of obstacles. The evolution equation, commonly referred to as the Quenched Edwards-Wilkinson model, is a semilinear parabolic equation with a constant…

Probability · Mathematics 2011-03-01 Patrick W Dondl , Michael Scheutzow

In this paper we consider a model for the diffusion of a population in a strip-shaped field, where the growth of the species is governed by a Fisher-KPP equation and which is bounded on one side by a road where the species can have a…

Analysis of PDEs · Mathematics 2015-06-30 Andrea Tellini

By tightening the conventional Lieb-Robinson bounds to better handle systems which lack translation invariance, we determine the extent to which "weak links" suppress operator growth in disordered one-dimensional spin chains. In particular,…

Disordered Systems and Neural Networks · Physics 2024-04-23 Christopher L. Baldwin , Adam Ehrenberg , Andrew Y. Guo , Alexey V. Gorshkov

We propose a mathematical framework to systematically explore the propagation properties of a class of continuous in time nonlinear neural network models comprising a hierarchy of processing areas, mutually connected according to the…

Analysis of PDEs · Mathematics 2025-05-15 Andrea Alamia , Léa Dalliès , Grégory Faye , Rufin Vanrullen

We derive a dynamical bound on the propagation of correlations in local random quantum circuits - lattice spin systems where piecewise quantum operations - in space and time - occur with classical probabilities. Correlations are quantified…

Quantum Physics · Physics 2017-05-15 Siddhartha Santra , Radhakrishnan Balu

In quantum many-body systems with local interactions, quantum information and entanglement cannot spread outside of a linear light cone, which expands at an emergent velocity analogous to the speed of light. Local operations at sufficiently…

We derive generalized quantum speed limit inequalities that represent limitations on the time evolution of quantum states. They are extensions of the original inequality and are applied to the overlap between the time-evolved state and an…

Quantum Physics · Physics 2022-06-22 Kazutaka Takahashi

A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of…

Information Theory · Computer Science 2013-01-29 Ramanan Subramanian , Badri Vellambi , Ingmar Land

We consider multitype Markovian branching processes evolving in a Markovian random environment. To determine whether or not the branching process becomes extinct almost surely is akin to computing the maximal Lyapunov exponent of a sequence…

Probability · Mathematics 2014-12-01 Sophie Hautphenne , Guy Latouche
‹ Prev 1 3 4 5 6 7 10 Next ›