arXiv subjects

Giulio Chiribella

Publications and source records attributed to Giulio Chiribella.

142 records · Page 8Linked to original sources

arXiv2013

The completeness of quantum theory for predicting measurement outcomes

The predictions that quantum theory makes about the outcomes of measurements are generally probabilistic. This has raised the question whether quantum theory can be considered complete, or whether there could exist alternative theories that provide improved predictions. Here we review recent work that considers arbitrary alternative theories, constrained only by the requirement that they are compatible with a notion of "free choice" (defined with respect to a natural causal order). It is shown that quantum theory is "maximally informative", i.e., there is no other compatible theory that gives improved predictions. Furthermore, any alternative maximally informative theory is necessarily equivalent to quantum theory. This means that the state a system has in such a theory is in one-to-one correspondence with its quantum-mechanical state (the wave function). In this sense, quantum theory is complete.

quant-ph↗

arXiv2013

Optimal design and quantum benchmarks for coherent state amplifiers

We establish the ultimate quantum limits to the amplification of an unknown coherent state, both in the deterministic and probabilistic case, investigating the realistic scenario where the expected photon number is finite. In addition, we provide the benchmark that experimental realizations have to surpass in order to beat all classical amplification strategies and to demonstrate genuine quantum amplification. Our result guarantees that a successful demonstration is in principle possible for every finite value of the expected photon number.

quant-ph↗

arXiv2013

Confusability graphs for symmetric sets of quantum states

For a set of quantum states generated by the action of a group, we consider the graph obtained by considering two group elements adjacent whenever the corresponding states are non-orthogonal. We analyze the structure of the connected components of the graph and show two applications to the optimal estimation of an unknown group action and to the search for decoherence free subspaces of quantum channels with symmetry.

quant-ph↗

arXiv2012

Optimal Probabilistic Simulation of Quantum Channels from the Future to the Past

We introduce the study of quantum protocols that probabilistically simulate quantum channels from a sender in the future to a receiver in the past. The maximum probability of simulation is determined by causality and depends on the amount and type (classical or quantum) of information that the channel can transmit. We illustrate this dependence in several examples, including ideal classical and quantum channels, measure-and-prepare channels, partial trace channels, and universal cloning channels. For the simulation of partial trace channels, we consider generalized teleportation protocols that take N input copies of a pure state in the future and produce M < N output copies of the same state in the past. In this case, we show that the maximum probability of successful teleportation increases with the number of input copies, a feature that was impossible in classical physics. In the limit of asymptotically large N, the probability converges to the probability of simulation for an ideal classical channel. Similar results are found for universal cloning channels from N copies to M > N approximate copies, exploiting a time-reversal duality between universal cloning and partial trace.

quant-ph↗

arXiv2011

Quantum error correction with degenerate codes for correlated noise

We introduce a quantum packing bound on the minimal resources required by nondegenerate error correction codes for any kind of noise. We prove that degenerate codes can outperform nondegenerate ones in the presence of correlated noise, by exhibiting examples where the quantum packing bound is violated.

quant-ph↗

arXiv2010

Information - Disturbance Tradeoff in the Estimation of a Unitary Transformation

We address the problem of the information-disturbance trade-off associated to the estimation of a quantum transformation, and show how the extraction of information about the a black box causes a perturbation of the corresponding input-output evolution. In the case of a black box performing a unitary transformation, randomly distributed according to the invariant measure, we give a complete solution of the problem, deriving the optimal trade-off curve and presenting an explicit construction of the optimal quantum network.

quant-ph↗

arXiv2010

On quantum estimation, quantum cloning and finite quantum de Finetti theorems

This paper presents a series of results on the interplay between quantum estimation, cloning and finite de Finetti theorems. First, we consider the measure-and-prepare channel that uses optimal estimation to convert M copies into k approximate copies of an unknown pure state and we show that this channel is equal to a random loss of all but s particles followed by cloning from s to k copies. When the number k of output copies is large with respect to the number M of input copies the measure-and-prepare channel converges in diamond norm to the optimal universal cloning. In the opposite case, when M is large compared to k, the estimation becomes almost perfect and the measure-and-prepare channel converges in diamond norm to the partial trace over all but k systems. This result is then used to derive de Finetti-type results for quantum states and for symmetric broadcast channels, that is, channels that distribute quantum information to many receivers in a permutationally invariant fashion. Applications of the finite de Finetti theorem for symmetric broadcast channels include the derivation of diamond-norm bounds on the asymptotic convergence of quantum cloning to state estimation and the derivation of bounds on the amount of quantum information that can be jointly decoded by a group of k receivers at the output of a symmetric broadcast channel.

quant-ph↗

arXiv2009

Theoretical framework for quantum networks

We present a framework to treat quantum networks and all possible transformations thereof, including as special cases all possible manipulations of quantum states, measurements, and channels, such as, e.g., cloning, discrimination, estimation, and tomography. Our framework is based on the concepts of quantum comb-which describes all transformations achievable by a given quantum network-and link product-the operation of connecting two quantum networks. Quantum networks are treated both from a constructive point of view-based on connections of elementary circuits-and from an axiomatic one-based on a hierarchy of admissible quantum maps. In the axiomatic context a fundamental property is shown, which we call universality of quantum memory channels: any admissible transformation of quantum networks can be realized by a suitable sequence of memory channels. The open problem whether this property fails for some nonquantum theory, e.g., for no-signaling boxes, is posed.

quant-ph↗

arXiv2009

Realization schemes for quantum instruments in finite dimensions

We present a general dilation scheme for quantum instruments with continuous outcome space in finite dimensions, in terms of an indirect POVM measurement performed on a finite dimensional ancilla. The general result is then applied to a large class of instruments generated by operator frames, which contains group-covariant instruments as a particular case, and allows to construct dilation schemes based on a measurement on the ancilla followed by a conditional feed-forward operation on the output. In the case of tight operator frames our construction generalizes quantum teleportation and telecloning, producing a whole family of generalized teleportation schemes in which the instrument is realized via a joint POVM at the sender combined with a conditional feed-forward operation at the receiver.

quant-ph↗

arXiv2008

Secret quantum communication of a reference frame

We propose quantum cryptographic protocols to secretly communicate a reference frame- unspeakable information in the sense it cannot be encoded into a string of bits. Two distant parties can secretly align their Cartesian axes by exchanging N spin 1/2 particles, achieving the optimal accuracy 1/N. A possible eavesdropper cannot gain any information without being detected.

quant-ph↗

arXiv2008

Quantum Benchmark for Teleportation and Storage of Squeezed States

We provide a quantum benchmark for teleportation and storage of single-mode squeezed states with zero displacement and a completely unknown degree of squeezing along a given direction. For pure squeezed input states, a fidelity higher than 81.5% has to be attained in order to outperform any classical strategy based on an estimation of the unknown squeezing and repreparation of squeezed states. For squeezed thermal input states, we derive an upper and a lower bound on the classical average fidelity which tighten for moderate degree of mixedness. These results enable a critical discussion of recent experiments with squeezed light.

quant-ph↗

arXiv2008

Memory effects in quantum channel discrimination

We consider quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance for channels with memory. For optimal discrimination and estimation of sets of unitary channels memory-assisted protocols are not required.

quant-ph↗

arXiv2007

Quantum Circuits Architecture

We present a method for optimizing quantum circuits architecture. The method is based on the notion of "quantum comb", which describes a circuit board in which one can insert variable subcircuits. The method allows one to efficiently address novel kinds of quantum information processing tasks, such as storing-retrieving, and cloning of channels.

quant-ph↗

arXiv2005

Inverting quantum decoherence by classical feedback from the environment

We show that for qubits and qutrits it is always possible to perfectly recover quantum coherence by performing a measurement only on the environment, whereas for dimension d>3 there are situations where recovery is impossible, even with complete access to the environment. For qubits, the minimal amount of classical information to be extracted from the environment equals the entropy exchange.

quant-ph↗

arXiv2004

Extremal covariant POVM's

We consider the convex set of positive operator valued measures (POVM) which are covariant under a finite dimensional unitary projective representation of a group. We derive a general characterization for the extremal points, and provide bounds for the ranks of the corresponding POVM densities, also relating extremality to uniqueness and stability of optimized measurements. Examples of applications are given.

quant-ph↗

arXiv2004

Covariant quantum measurements which maximize the likelihood

We derive the class of covariant measurements which are optimal according to the maximum likelihood criterion. The optimization problem is fully resolved in the case of pure input states, under the physically meaningful hypotheses of unimodularity of the covariance group and measurability of the stability subgroup. The general result is applied to the case of covariant state estimation for finite dimension, and to the Weyl-Heisenberg displacement estimation in infinite dimension. We also consider estimation with multiple copies, and compare collective measurements on identical copies with the scheme of independent measurements on each copy. A "continuous-variables" analogue of the measurement of direction of the angular momentum with two anti-parallel spins by Gisin and Popescu is given.

quant-ph↗