Searcharxiv⌕ Search

arXiv subjects

Massimiliano F. Sacchi

Publications and source records attributed to Massimiliano F. Sacchi.

At least 37 records · Page 2Linked to original sources

Experimental detection of quantum channel capacities

We present an effcient experimental procedure that certifies non vanishing quantum capacities for qubit noisy channels. Our method is based on the use of a fixed bipartite entangled state, where the system qubit is sent to the channel input. A particular set of local measurements is performed at the channel output and the ancilla qubit mode, obtaining lower bounds to the quantum capacities for any unknown channel with no need of a quantum process tomography. The entangled qubits have a Bell state configuration and are encoded in photon polarization. The lower bounds are found by estimating the Shannon and von Neumann entropies at the output using an optimized basis, whose statistics is obtained by measuring only the three observables $σ_{x}\otimesσ_{x}$, $σ_{y}\otimesσ_{y}$ and $σ_{z}\otimesσ_{z}$.

quant-ph↗

Convex approximations of quantum channels

We address the problem of optimally approximating the action of a desired and unavailable quantum channel $Φ$ having at our disposal a single use of a given set of other channels $\{Ψ_i \}$. The problem is recast to look for the least distinguishable channel from $Φ$ among the convex set $\sum_i p_i Ψ_i$, and the corresponding optimal weights $\{ p_i \}$ provide the optimal convex mixing of the available channels $\{Ψ_i \}$. For single-qubit channels we study specifically the cases where the available convex set corresponds to covariant channels or to Pauli channels, and the desired target map is an arbitrary unitary transformation or a generalized damping channel.

quant-ph↗

Witnessing quantum capacities of correlated channels

We test a general method to detect lower bounds of the quantum channel capacity for two-qubit correlated channels. We consider in particular correlated dephasing, depolarising and amplitude damping channels. We show that the method is easily implementable, it does not require a priori knowledge about the channels, and it is very efficient, since it does not rely on full quantum process tomography.

quant-ph↗

Detecting lower bounds to quantum channel capacities

We propose a method to detect lower bounds to quantum capacities of a noisy quantum communication channel by means of few measurements. The method is easily implementable and does not require any knowledge about the channel. We test its efficiency by studying its performance for most well known single qubit noisy channels and for the generalised Pauli channel in arbitrary finite dimension.

quant-ph↗

How much a Quantum Measurement is Informative?

The informational power of a quantum measurement is the maximum amount of classical information that the measurement can extract from any ensemble of quantum states. We discuss its main properties. Informational power is an additive quantity, being equivalent to the classical capacity of a quantum-classical channel. The informational power of a quantum measurement is the maximum of the accessible information of a quantum ensemble that depends on the measurement. We present some examples where the symmetry of the measurement allows to analytically derive its informational power.

quant-ph↗

Informational power of quantum measurements

We introduce the informational power of a quantum measurement as the maximum amount of classical information that the measurement can extract from any ensemble of quantum states. We prove the additivity by showing that the informational power corresponds to the classical capacity of a quantum-classical channel. We restate the problem of evaluating the informational power as the maximization of the accessible information of a suitable ensemble. We provide a numerical algorithm to find an optimal ensemble, and quantify the informational power.

quant-ph↗

Quantum state decorrelation

We address the general problem of removing correlations from quantum states while preserving local quantum information as much as possible. We provide a complete solution in the case of two qubits, by evaluating the minimum amount of noise that is necessary to decorrelate covariant sets of bipartite states. We show that two harmonic oscillators in arbitrary Gaussian state can be decorrelated by a Gaussian covariant map. Finally, for finite-dimensional Hilbert spaces, we prove that states obtained from most cloning channels (e.g., universal and phase-covariant cloning) can be decorrelated only at the expense of a complete erasure of information about the copied state. More generally, in finite dimension, cloning without correlations is impossible for continuous sets of states. On the contrary, for continuos variables cloning, a slight modification of the customary set-up for cloning coherent states allows one to obtain clones without correlations.

quant-ph↗

Phase-covariant cloning of coherent states

We consider the problem of phase-covariant cloning for coherent states. We show that an experimental scheme based on ideal phase measurement and feedforward outperforms the semiclassical procedure of ideal phase measurement and preparation in terms of fidelity. A realistic scheme where the ideal phase measurement is replaced with double-homodyne detection is shown to be unable to overcome the semiclassical cloning strategy. On the other hand, such a realistic scheme is better than semiclassical cloning based on double-homodyne phase measurement and preparation.

quant-ph↗

Information-disturbance tradeoff for spin coherent state estimation

We show how to quantify the optimal tradeoff between the amount of information retrieved by a quantum measurement in estimating an unknown spin coherent state and the disturbance on the state itself, and how to derive the corresponding minimum-disturbing measurement.

quant-ph↗

Information-Disturbance Tradeoff in Quantum State Discrimination

When discriminating between two pure quantum states, there exists a quantitative tradeoff between the information retrieved by the measurement and the disturbance caused on the unknown state. We derive the optimal tradeoff and provide the corresponding quantum measurement. Such an optimal measurement smoothly interpolates between the two limiting cases of maximal information extraction and no measurement at all.

quant-ph↗

A minimum-disturbing quantum state discriminator

We propose two experimental schemes for quantum state discrimination that achieve the optimal tradeoff between the probability of correct identification and the disturbance on the quantum state.

quant-ph↗

Superbroadcasting of conjugate quantum variables

We consider the problem of broadcasting arbitrary states of radiation modes from N to M>N copies by a map that preserves the average value of the field and optimally reduces the total noise in conjugate variables. For N>=2 the broadcasting can be achieved perfectly, and for sufficiently noisy input states one can even purify the state while broadcasting--the so-called superbroadcasting. For purification (i.e. M<=N), the reduction of noise is independent of M. Similar results are proved for broadcasting with phase-conjugation. All the optimal maps can be implemented by linear optics and linear amplification.

quant-ph↗

Information-disturbance tradeoff in estimating a maximally entangled state

We derive the amount of information retrieved by a quantum measurement in estimating an unknown maximally entangled state, along with the pertaining disturbance on the state itself. The optimal tradeoff between information and disturbance is obtained, and a corresponding optimal measurement is provided.

quant-ph↗

Superbroadcasting of continuous variables mixed states

We consider the problem of broadcasting quantum information encoded in the average value of the field from N to M>N copies of mixed states of radiation modes. We derive the broadcasting map that preserves the complex amplitude, while optimally reducing the noise in conjugate quadratures. We find that from two input copies broadcasting is feasible, with the possibility of simultaneous purification (superbroadcasting). We prove similar results for purification (M<=N) and for phase-conjugate broadcasting.

quant-ph↗

Minimax discrimination of two Pauli channels

We consider the problem of optimally discriminating two Pauli channels in the minimax strategy, maximizing the smallest of the probabilities of correct identification of the channel. We find the optimal input state at the channel and show the conditions under which using entanglement strictly enhances distinguishability. We finally compare the minimax strategy with the Bayesian one.

quant-ph↗

Minimum error discrimination of Pauli channels

We solve the problem of discriminating with minimum error probability two given Pauli channels. We show that, differently from the case of discrimination between unitary transformations, the use of entanglement with an ancillary system can strictly improve the discrimination, and any maximally entangled state allows to achieve the optimal discrimination. We also provide a simple necessary and sufficient condition in terms of the structure of the channels for which the ultimate minimum error probability can be achieved without entanglement assistance. When such a condition is satisfied, the optimal input state is simply an eigenstate of one of the Pauli matrices.

quant-ph↗