Searcharxiv⌕ Search

arXiv subjects

A. Winter

Publications and source records attributed to A. Winter.

30 records · Page 2Linked to original sources
arXiv2006

Localization and its consequences for quantum walk algorithms and quantum communication

The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that quantum mechanics can also lead, through the phenomenon of localization, to exponential suppression of motion on these graphs (even in the absence of decoherence). In fact, for physical embodiments of graphs, this will be the generic behaviour. It also has implications for proposals for using spin networks, including spin chains, as quantum communication channels.

quant-ph↗
arXiv2005

A family of quantum protocols

We introduce two dual, purely quantum protocols: for entanglement distillation assisted by quantum communication (``mother'' protocol) and for entanglement assisted quantum communication (``father'' protocol). We show how a large class of ``children'' protocols (including many previously known ones) can be derived from the two by direct application of teleportation or super-dense coding. Furthermore, the parent may be recovered from most of the children protocols by making them ``coherent''. We also summarize the various resource trade-offs these protocols give rise to.

quant-ph↗
arXiv2005

A Resource Framework for Quantum Shannon Theory

Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distillation, etc., which characterize asymptotic properties of quantum and classical channels and states. In this paper we advocate a unified approach to an important class of problems in quantum Shannon theory, consisting of those that are bipartite, unidirectional and memoryless. We formalize two principles that have long been tacitly understood. First, we describe how the Church of the larger Hilbert space allows us to move flexibly between states, channels, ensembles and their purifications. Second, we introduce finite and asymptotic (quantum) information processing resources as the basic objects of quantum Shannon theory and recast the protocols used in direct coding theorems as inequalities between resources. We develop the rules of a resource calculus which allows us to manipulate and combine resource inequalities. This framework simplifies many coding theorem proofs and provides structural insights into the logical dependencies among coding theorems. We review the above-mentioned basic coding results and show how a subset of them can be unified into a family of related resource inequalities. Finally, we use this family to find optimal trade-off curves for all protocols involving one noisy quantum resource and two noiseless ones.

quant-ph↗
arXiv2004

Stripe-hexagon competition in forced pattern forming systems with broken up-down symmetry

We investigate the response of two-dimensional pattern forming systems with a broken up-down symmetry, such as chemical reactions, to spatially resonant forcing and propose related experiments. The nonlinear behavior immediately above threshold is analyzed in terms of amplitude equations suggested for a $1:2$ and $1:1$ ratio between the wavelength of the spatial periodic forcing and the wavelength of the pattern of the respective system. Both sets of coupled amplitude equations are derived by a perturbative method from the Lengyel-Epstein model describing a chemical reaction showing Turing patterns, which gives us the opportunity to relate the generic response scenarios to a specific pattern forming system. The nonlinear competition between stripe patterns and distorted hexagons is explored and their range of existence, stability and coexistence is determined. Whereas without modulations hexagonal patterns are always preferred near onset of pattern formation, single mode solutions (stripes) are favored close to threshold for modulation amplitudes beyond some critical value. Hence distorted hexagons only occur in a finite range of the control parameter and their interval of existence shrinks to zero with increasing values of the modulation amplitude. Furthermore depending on the modulation amplitude the transition between stripes and distorted hexagons is either sub- or supercritical.

nlin.PS↗
arXiv2004

Distilling common randomness from bipartite quantum states

The problem of converting noisy quantum correlations between two parties into noiseless classical ones using a limited amount of one-way classical communication is addressed. A single-letter formula for the optimal trade-off between the extracted common randomness and classical communication rate is obtained for the special case of classical-quantum correlations. The resulting curve is intimately related to the quantum compression with classical side information trade-off curve $Q^*(R)$ of Hayden, Jozsa and Winter. For a general initial state we obtain a similar result, with a single-letter formula, when we impose a tensor product restriction on the measurements performed by the sender; without this restriction the trade-off is given by the regularization of this function. Of particular interest is a quantity we call ``distillable common randomness'' of a state: the maximum overhead of the common randomness over the one-way classical communication if the latter is unbounded. It is an operational measure of (total) correlation in a quantum state. For classical-quantum correlations it is given by the Holevo mutual information of its associated ensemble, for pure states it is the entropy of entanglement. In general, it is given by an optimization problem over measurements and regularization; for the case of separable states we show that this can be single-letterized.

quant-ph↗
arXiv2003

Multiplicativity of Accessible Fidelity and Quantumness for Sets of Quantum States

Two measures of sensitivity to eavesdropping for alphabets of quantum states were recently introduced by Fuchs and Sasaki in quant-ph/0302092. These are the accessible fidelity and quantumness. In this paper we prove an important property of both measures: They are multiplicative under tensor products. The proof in the case of accessible fidelity shows a connection between the measure and characteristics of entanglement-breaking quantum channels.

quant-ph↗
arXiv2003

Measuring Polynomial Invariants of Multi-Party Quantum States

We present networks for directly estimating the polynomial invariants of multi-party quantum states under local transformations. The structure of these networks is closely related to the structure of the invariants themselves and this lends a physical interpretation to these otherwise abstract mathematical quantities. Specifically, our networks estimate the invariants under local unitary (LU) transformations and under stochastic local operations and classical communication (SLOCC). Our networks can estimate the LU invariants for multi-party states, where each party can have a Hilbert space of arbitrary dimension and the SLOCC invariants for multi-qubit states. We analyze the statistical efficiency of our networks compared to methods based on estimating the state coefficients and calculating the invariants.

quant-ph↗
arXiv2003

Classical data compression with quantum side information

The problem of classical data compression when the decoder has quantum side information at his disposal is considered. This is a quantum generalization of the classical Slepian-Wolf theorem. The optimal compression rate is found to be reduced from the Shannon entropy of the source by the Holevo information between the source and side information.

quant-ph↗
arXiv2001

Strong Converse for Identification via Quantum Channels

In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in selfadjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph covering problems.

quant-ph↗
arXiv2001

Quantum Finite State Transducers

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their `little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.

quant-ph↗
arXiv2000

Compression of quantum measurement operations

We generalize recent work of Massar and Popescu dealing with the amount of classical data that is produced by a quantum measurement on a quantum state ensemble. In the previous work it was shown how spurious randomness generally contained in the outcomes can be eliminated without decreasing the amount of knowledge, to achieve an amount of data equal to the von Neumann entropy of the ensemble. Here we extend this result by giving a more refined description of what constitute equivalent measurements (that is measurements which provide the same knowledge about the quantum state) and also by considering incomplete measurements. In particular we show that one can always associate to a POVM with elements a_j, an equivalent POVM acting on many independent copies of the system which produces an amount of data asymptotically equal to the entropy defect of an ensemble canonically associated to the ensemble average state and the initial measurement (a_j). In the case where the measurement is not maximally refined this amount of data is strictly less than the von Neumann entropy, as obtained in the previous work. We also show that this is the best achievable, i.e. it is impossible to devise a measurement equivalent to the initial measurement (a_j) that produces less data. We discuss the interpretation of these results. In particular we show how they can be used to provide a precise and model independent measure of the amount of knowledge that is obtained about a quantum state by a quantum measurement. We also discuss in detail the relation between our results and Holevo's bound, at the same time providing a new proof of this fundamental inequality.

quant-ph↗