output
20052022
most citedThe Uncertainty Principle in the Presence of Quantum Memory

850 citations

Showing 2009Show all

8 papers · 1 filter

cs.CG2009★ 9 cited

Zone Diagrams in Euclidean Spaces and in Other Normed Spaces

Akitoshi Kawamura, Jiří Matoušek, Takeshi Tokuyama

Zone diagram is a variation on the classical concept of a Voronoi diagram. Given n sites in a metric space that compete for territory, the zone diagram is an equilibrium state in t…

math.CO2009

Probabilistic one-player Ramsey games via deterministic two-player games

Michael Belfrage, Torsten Mütze, Reto Spöhel

Consider the following probabilistic one-player game: The board is a graph with vertices, which initially contains no edges. In each step, a new edge is drawn uniformly at rand…

math.OC2009★ 5 cited

Combinatorial Characterizations of K-matrices

Jan Foniok, Komei Fukuda, Lorenz Klaus

We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Ptak on linear-algebraic characterizations of K-matrices to the setting…

quant-ph2009★ 95 cited

All reversible dynamics in maximally non-local theories are trivial

David Gross, Markus Mueller, Roger Colbeck +1

A remarkable feature of quantum theory is non-locality (i.e. the presence of correlations which violate Bell inequalities). However, quantum correlations are not maximally non-loca…

quant-ph2009★ 850 cited

The Uncertainty Principle in the Presence of Quantum Memory

Mario Berta, Matthias Christandl, Roger Colbeck +2

The uncertainty principle, originally formulated by Heisenberg, dramatically illustrates the difference between classical and quantum mechanics. The principle bounds the uncertaint…

quant-ph2009★ 239 cited

Duality Between Smooth Min- and Max-Entropies

Marco Tomamichel, Roger Colbeck, Renato Renner

In classical and quantum information theory, operational quantities such as the amount of randomness that can be extracted from a given source or the amount of space needed to stor…

q-bio.QM2009★ 67 cited

A new class of highly efficient exact stochastic simulation algorithms for chemical reaction networks

Rajesh Ramaswamy, Nélido González-Segredo, Ivo F. Sbalzarini

We introduce an alternative formulation of the exact stochastic simulation algorithm (SSA) for sampling trajectories of the chemical master equation for a well-stirred system of co…

cs.IT2009★ 10 cited

Simple Channel Coding Bounds

Ligong Wang, Roger Colbeck, Renato Renner

New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the "smooth 0-divergenc…