Searcharxiv⌕ Search

arXiv subjects

Giacomo Mauro D'Ariano

Publications and source records attributed to Giacomo Mauro D'Ariano.

At least 91 records · Page 5Linked to original sources

Universal and phase covariant superbroadcasting for mixed qubit states

We describe a general framework to study covariant symmetric broadcasting maps for mixed qubit states. We explicitly derive the optimal N to M superbroadcasting maps, achieving optimal purification of the single-site output copy, in both the universal and the phase covariant cases. We also study the bipartite entanglement properties of the superbroadcast states.

quant-ph↗

Optimal estimation of quantum observables

We consider the problem of estimating the ensemble average of an observable on an ensemble of equally prepared identical quantum systems. We show that, among all kinds of measurements performed jointly on the copies, the optimal unbiased estimation is achieved by the usual procedure that consists in performing independent measurements of the observable on each system and averaging the measurement outcomes.

quant-ph↗

Optimal superbroadcasting of mixed qubit states

"Broadcasting", namely distributing information over many users, suffers in-principle limitations when the information is quantum. This poses a critical issue in quantum information theory, for distributed processing and networked communications. For pure states ideal broadcasting coincides with the so-called "quantum cloning", describing an hypothetical ideal device capable of producing from a finite number N of copies of a state (drawn from a set) a larger number M>N of output copies of the same state. Since such a transformation is not isometric, it cannot be achieved by any physical machine for a quantum state drawn from a non orthogonal set: this is essentially the content of the "no-cloning" theorem. For mixed states the situation is quite different, since from the point of view of each single user a local marginal mixed state is indistinguishable from the partial trace of an entangled state, and there are infinitely many joint output states that correspond to ideal broadcasting. Indeed, for sufficiently large number $N$ of input copies, not only ideal broadcasting of noncommuting mixed states is possible, but one can even purify the state in the process. Such state purification with an increasing number of copies has been named "superbroadcasting". In this paper we will review some recent results on superbroadcasting of qubits, for two different sets of input states, corresponding to universally covariant broadcasting and to phase-covariant broadcasting of equatorial states.

quant-ph↗

Programmable quantum channels and measurements

We review some partial results for two strictly related problems. The first problem consists in finding the optimal joint unitary transformation on system and ancilla which is the most efficient in programming any desired channel on the system by changing the state of the ancilla. In this respect we present a solution for dimension two for both system and ancilla. The second problem consists in finding the optimal universal programmable detector, namely a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension for the ancilla only approximate universal programmability is possible, with minimal dimension increasing function versus the precision of the approximation. We show that one can achieve a dimension growing polynomially versus the precision, and even linearly in specific cases.

quant-ph↗

Optimal Time-Reversal of Multi-phase Equatorial States

Even though the time-reversal is unphysical (it corresponds to the complex conjugation of the density matrix), for some restricted set of states it can be achieved unitarily, typically when there is a common de-phasing in a n-level system. However, in the presence of multiple phases (i. e. a different de-phasing for each element of an orthogonal basis occurs) the time reversal is no longer physically possible. In this paper we derive the channel which optimally approaches in fidelity the time-reversal of multi-phase equatorial states in arbitrary (finite) dimension. We show that, in contrast to the customary case of the Universal-NOT on qubits (or the universal conjugation in arbitrary dimension), the optimal phase covariant time-reversal for equatorial states is a nonclassical channel, which cannot be achieved via a measurement/preparation procedure. Unitary realizations of the optimal time-reversal channel are given with minimal ancillary dimension, exploiting the simplex structure of the optimal maps.

quant-ph↗

Optimal phase estimation for qubit mixed states

We address the problem of optimal estimation of the relative phase for two-dimensional quantum systems in mixed states. In particular, we derive the optimal measurement procedures for an arbitrary number of qubits prepared in the same mixed state.

quant-ph↗

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↗

Minimax quantum state discrimination

We derive the optimal measurement for quantum state discrimination without a priori probabilities, i.e. in a minimax strategy instead of the usually considered Bayesian one. We consider both minimal-error and unambiguous discrimination problems, and provide the relation between the optimal measurements according to the two schemes. We show that there are instances in which the minimum risk cannot be achieved by an orthogonal measurement, and this is a common feature of the minimax estimation strategy.

quant-ph↗

On the missing axiom of Quantum Mechanics

The debate on the nature of quantum probabilities in relation to Quantum Non Locality has elevated Quantum Mechanics to the level of an "Operational Epistemic Theory". In such context the quantum superposition principle has an extraneous non epistemic nature. This leads us to seek purely operational foundations for Quantum Mechanics, from which to derive the current mathematical axiomatization based on Hilbert spaces. In the present work I present a set of axioms of purely operational nature, based on a general definition of "the experiment", the operational/epistemic archetype of information retrieval from reality. As we will see, this starting point logically entails a series of notions [state, conditional state, local state, pure state, faithful state, instrument, propensity (i.e. "effect"), dynamical and informational equivalence, dynamical and informational compatibility, predictability, discriminability, programmability, locality, a-causality, rank of the state, maximally chaotic state, maximally entangled state, informationally complete propensity, etc. ], along with a set of rules (addition, convex combination, partial orderings, ...), which, far from being of quantum origin as often considered, instead constitute the universal "syntactic manual" of the operational/epistemic approach. The missing ingredient is, of course, the quantum superposition axiom for probability amplitudes: for this I propose some substitute candidates of purely operational/epistemic nature.

quant-ph↗

Dense coding with multipartite quantum states

We consider generalisations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity of such information transfer is found exactly. It is shown that the capacity is not enhanced by allowing the senders to perform joint operations. We provide a nontrivial upper bound on the capacity in the case of two receivers. We also give a classification of the set of all multiparty states in terms of their usefulness for dense coding. We provide examples for each of these classes, and discuss some of their properties.

quant-ph↗

Superbroadcasting of mixed states

We derive the optimal universal broadcasting for mixed states of qubits. We show that the nobroadcasting theorem cannot be generalized to more than a single input copy. Moreover, for four or more input copies it is even possible to purify the input states while broadcasting. We name such purifying broadcasting superbroadcasting.

quant-ph↗

Classical randomness in quantum measurements

Similarly to quantum states, also quantum measurements can be "mixed", corresponding to a random choice within an ensemble of measuring apparatuses. Such mixing is equivalent to a sort of hidden variable, which produces a noise of purely classical nature. It is then natural to ask which apparatuses are "indecomposable", i. e. do not correspond to any random choice of apparatuses. This problem is interesting not only for foundations, but also for applications, since most optimization strategies give optimal apparatuses that are indecomposable. Mathematically the problem is posed describing each measuring apparatus by a positive operator-valued measure (POVM), which gives the statistics of the outcomes for any input state. The POVM's form a convex set, and in this language the indecomposable apparatuses are represented by extremal points--the analogous of "pure states" in the convex set of states. Differently from the case of states, however, indecomposable POVM's are not necessarily rank-one, e. g. von Neumann measurements. In this paper we give a complete classification of indecomposable apparatuses (for discrete spectrum), by providing different necessary and sufficient conditions for extremality of POVM's, along with a simple general algorithm for the decomposition of a POVM into extremals. As an interesting application, "informationally complete" measurements are analyzed in this respect. The convex set of POVM's is fully characterized by determining its border in terms of simple algebraic properties of the corresponding POVM's.

quant-ph↗

Operational distance and fidelity for quantum channels

We define and study a fidelity criterion for quantum channels, which we term the minimax fidelity, through a noncommutative generalization of maximal Hellinger distance between two positive kernels in classical probability theory. Like other known fidelities for quantum channels, the minimax fidelity is well-defined for channels between finite-dimensional algebras, but it also applies to a certain class of channels between infinite-dimensional algebras (explicitly, those channels that possess an operator-valued Radon--Nikodym density with respect to the trace in the sense of Belavkin--Staszewski) and induces a metric on the set of quantum channels which is topologically equivalent to the CB-norm distance between channels, precisely in the same way as the Bures metric on the density operators associated with statistical states of quantum-mechanical systems, derived from the well-known fidelity (`generalized transition probability') of Uhlmann, is topologically equivalent to the trace-norm distance.

quant-ph↗

Economical Phase-Covariant Cloning of Qudits

We derive the optimal N to M phase-covariant quantum cloning for equatorial states in dimension d with M=kd+N, k integer. The cloning maps are optimal for both global and single-qudit fidelity. The map is achieved by an ``economical'' cloning machine, which works without ancilla.

quant-ph↗

Distributed quantum dense coding

We introduce the notion of distributed quantum dense coding, i.e. the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a non-trivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.

quant-ph↗