arXiv subjects

Paolo Perinotti

Publications and source records attributed to Paolo Perinotti.

At least 73 records · Page 4Linked to original sources

arXiv2013

Optimal processing of reversible quantum channels

We consider the general problem of the optimal transformation of N uses of (possibly different) unitary channels to a single use of another unitary channel in any finite dimension. We show how the optimal transformation can be fully parallelized, consisting in a preprocessing channel followed by a parallel action of all the N unitaries and a final postprocessing channel. Our techniques allow to achieve an exponential reduction in the number of the free parameters of the optimization problem making it amenable to an efficient numerical treatment. Finally, we apply our general results to find the analytical solution for special cases of interest like the cloning of qubit phase gates.

quant-ph↗

arXiv2013

Ergodic and Mixing Quantum Channels in Finite Dimensions

The paper provides a systematic characterization of quantum ergodic and mixing channels in finite dimensions and a discussion of their structural properties. In particular, we discuss ergodicity in the general case where the fixed point of the channel is not a full-rank (faithful) density matrix. Notably, we show that ergodicity is stable under randomizations, namely that every random mixture of an ergodic channel with a generic channel is still ergodic. In addition, we prove several conditions under which ergodicity can be promoted to the stronger property of mixing. Finally, exploiting a suitable correspondence between quantum channels and generators of quantum dynamical semigroups, we extend our results to the realm of continuous-time quantum evolutions, providing a characterization of ergodic Lindblad generators and showing that they are dense in the set of all possible generators.

quant-ph↗

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

Determinism without causality

Causality has been often confused with the notion of determinism. It is mandatory to separate the two notions in view of the debate about quantum foundations. Quantum theory provides an example of causal not-deterministic theory. Here we introduce a toy operational theory that is deterministic and non-causal, thus proving that the two notions of causality and determinism are totally independent.

quant-ph↗

arXiv2012

Universality of Computation in Real Quantum Theory

Recently de La Torre et al. [1] reconstructed Quantum Theory from its local structure on the basis of local discriminability and the existence of a one-parameter group of bipartite transformations containing an entangling gate. This result relies on universality of an entangling gate for quantum computation. Here we prove universality of C-NOT with local gates for Real Quantum Theory (RQT), showing that such universality would not be sufficient for the result, whereas local discriminability and the qubit structure play a crucial role. For reversible computation, generally an extra rebit is needed for RQT. As a byproduct we also provide a short proof of universality of C-NOT for CQT.

quant-ph↗

arXiv2012

Spooky action at a distance in general probabilistic theories

We call a probabilistic theory "complete" if it cannot be further refined by no-signaling hidden-variable models, and name a theory "spooky" if every equivalent hidden-variable model violates Shimony's Outcome Independence. We prove that a complete theory is spooky if and only if it admits a pure steering state in the sense of Schrödinger. Finally we show that steering of complementary states leads to a Schrödinger's cat-like paradox.

quant-ph↗

arXiv2012

Quantum computation with programmable connections between gates

A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the "quantum switch", which can be programmed to switch the order of two channels with a single use of each one.

quant-ph↗

arXiv2011

Discord and non-classicality in probabilistic theories

Quantum discord quantifies non-classical correlations in quantum states. We introduce discord for states in causal probabilistic theories, inspired by the original definition proposed in Ref. [17]. We show that the only probabilistic theory in which all states have null discord is classical probability theory. Non-null discord is then not just a quantum feature, but a generic signature of non-classicality.

quant-ph↗

arXiv2011

Memory cost of quantum protocols

In this paper we consider the problem of minimizing the ancillary systems required to realize an arbitrary strategy of a quantum protocol, with the assistance of classical memory. For this purpose we introduce the notion of memory cost of a strategy, which measures the resources required in terms of ancillary dimension. We provide a condition for the cost to be equal to a given value, and we use this result to evaluate the cost in some special cases. As an example we show that any covariant protocol for the cloning of a unitary transformation requires at most one ancillary qubit. We also prove that the memory cost has to be determined globally, and cannot be calculated by optimizing the resources independently at each step of the strategy.

quant-ph↗

arXiv2011

Quantum learning algorithms for quantum measurements

We study quantum learning algorithms for quantum measurements. The optimal learning algorithm is derived for arbitrary von Neumann measurements in the case of training with one or two examples. The analysis of the case of three examples reveals that, differently from the learning of unitary gates, the optimal algorithm for learning of quantum measurements cannot be parallelized, and requires quantum memories for the storage of information.

quant-ph↗

arXiv2011

Extremal quantum protocols

Generalized quantum instruments correspond to measurements where the input and output are either states or more generally quantum circuits. These measurements describe any quantum protocol including games, communications, and algorithms. The set of generalized quantum instruments with a given input and output structure is a convex set. Here we investigate the extremal points of this set for the case of finite dimensional quantum systems and generalized instruments with finitely many outcomes. We derive algebraic necessary and sufficient conditions for extremality.

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↗

arXiv2011

Cloning of a quantum measurement

We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about 1 -> 2 learning of the measurement, otherwise the task is called 1 -> 2 cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension of the Hilbert space. For 1 -> 2 cloning we also propose a simple quantum network that realizes the optimal strategy.

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

No-signaling, entanglement-breaking, and localizability in bipartite channels

A bipartite quantum channel represents the interaction between systems, generally allowing for exchange of information. A special class of bipartite channels are the no-signaling ones, which do not allow communication. In Ref. [1] it has been conjectured that all no-signaling channels are mixtures of entanglement-breaking and localizable channels, which require only local operations and entanglement. Here we provide the general realization scheme, giving a counterexample to the conjecture.

quant-ph↗

arXiv2009

The Quantum No-Stretching: A geometrical interpretation of the no-cloning theorem

We consider the ideal situation in which a space rotation is transferred from a quantum spin j to a quantum spin l different from j. Quantum-information theoretical considerations lead to the conclusion that such operation is possible only for lj. For l>j the optimal stretching transformation is derived. We show that for qubits the present no-stretching theorem is equivalent to the usual no-cloning theorem.

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↗