arXiv subjects

C. Macchiavello

Publications and source records attributed to C. Macchiavello.

At least 19 recordsLinked to original sources

arXiv2015

Information transmission over an amplitude damping channel with an arbitrary degree of memory

We study the performance of a partially correlated amplitude damping channel acting on two qubits. We derive lower bounds for the single-shot classical capacity by studying two kinds of quantum ensembles, one which allows to maximize the Holevo quantity for the memoryless channel and the other allowing the same task but for the full-memory channel. In these two cases, we also show the amount of entanglement which is involved in achieving the maximum of the Holevo quantity. For the single-shot quantum capacity we discuss both a lower and an upper bound, achieving a good estimate for high values of the channel transmissivity. We finally compute the entanglement-assisted classical channel capacity.

quant-ph↗

arXiv2014

Entanglement and nonclassical properties of hypergraph states

Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a hypergraph that indicates a possible generation procedure of these states; alternatively, they can also be phrased in terms of a non-local stabilizer formalism. In this paper, we explore the entanglement properties and nonclassical features of hypergraph states. First, we identify the equivalence classes under local unitary transformations for up to four qubits, as well as important classes of five- and six-qubit states, and determine various entanglement properties of these classes. Second, we present general conditions under which the local unitary equivalence of hypergraph states can simply be decided by considering a finite set of transformations with a clear graph-theoretical interpretation. Finally, we consider the question whether hypergraph states and their correlations can be used to reveal contradictions with classical hidden variable theories. We demonstrate that various noncontextuality inequalities and Bell inequalities can be derived for hypergraph states.

quant-ph↗

arXiv2014

Hypergraph states in Grover's quantum search algorithm

We study the entanglement content of the states employed in the Grover algorithm after the first oracle call when a few searched items are concerned. We then construct a link between these initial states and hypergraphs, which provides an illustration of their entanglement properties.

quant-ph↗

arXiv2014

Two-qubit non-Markovianity induced by a common environment

We study non-Markovianity as backflow of information in two-qubit systems. We consider a setting where, by changing the distance between the qubits, one can interpolate between independent reservoir and common reservoir scenarios. We demonstrate that non-Markovianity can be induced by the common reservoir and single out the physical origin of this phenomenon. We show that two-qubit non-Markovianity coincides with instances of non-divisibility of the corresponding dynamical map, and we discuss the pair of states maximizing information flowback. We also discuss the issue of additivity for the measure we use and in doing so, give an indication of its usefulness as a resource for multipartite quantum systems.

quant-ph↗

arXiv2013

Detection methods to rule out completely co-positive and bi-entangling operations

In this work we extend the quantum channel detection method developed in [Phys. Rev. A 88, 042335 (2013)] and [Phys. Script. T153, 014044 (2013)] in order to detect other interesting convex sets of quantum channels. First we work out a procedure to detect non completely co-positive maps. Then we focus on the set of so-called bi-entangling operations and show how a map outside this set can be revealed. In both cases we provide explicit examples showing the theoretical technique and the corresponding experimental procedure.

quant-ph↗

arXiv2013

Quantum Hypergraph States

We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a generalised stabilizer formalism to describe this class of states. We introduce the notion of k-uniformity and show that this gives rise to classes of states which are inequivalent under the action of the local Pauli group. Finally we disclose a one-to-one correspondence with states employed in quantum algorithms, such as Deutsch-Jozsa's and Grover's.

quant-ph↗

arXiv2013

Classical and quantum capacities of a fully correlated amplitude damping channel

We study information transmission over a fully correlated amplitude damping channel acting on two qubits. We derive the single-shot classical channel capacity and show that entanglement is needed to achieve the channel best performance. We discuss the degradability properties of the channel and evaluate the quantum capacity for any value of the noise parameter. We finally compute the entanglement-assisted classical channel capacity.

quant-ph↗

arXiv2013

Noise robustness in the detection of non separable random unitary maps

We briefly review a recently proposed method to detect properties of quantum noise processes and quantum channels. We illustrate in detail the method for detecting non separable random unitary channels and consider in particular the explicit examples of the CNOT and CZ gates. We analyse their robustness in the presence of noise for several quantum noise models.

quant-ph↗

arXiv2013

Quantum channel detection

We present a method to detect properties of quantum channels, assuming that some a priori information about the form of the channel is available. The method is based on a correspondence with entanglement detection methods for multipartite density matrices based on witness operators. We first illustrate the method in the case of entanglement breaking channels and non separable random unitary channels, and show how it can be implemented experimentally by means of local measurements. We then study the detection of non separable maps and show that for pairs of systems of dimension higher than two the detection operators are not the same as in the random unitary case, highlighting a richer separability structure of quantum channels with respect to quantum states. Finally we consider the set of PPT maps, developing a technique to reveal NPT maps.

quant-ph↗

arXiv2013

Quantum Cloning by Cellular Automata

We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations for improving the performance with given resources.

quant-ph↗

arXiv2013

Scale invariance of entanglement dynamics in Grover's quantum search algorithm

We calculate the amount of entanglement of the multiqubit quantum states employed in the Grover algorithm, by following its dynamics at each step of the computation. We show that genuine multipartite entanglement is always present. Remarkably, the dynamics of any type of entanglement as well as of genuine multipartite entanglement is independent of the number n of qubits for large n, thus exhibiting a scale invariance property. We compare this result with the entanglement dynamics induced by a fixed-point quantum search algorithm. We also investigate criteria for efficient simulatability in the context of Grover's algorithm.

quant-ph↗

arXiv2011

Experimental Realization of Optimal Noise Estimation for a General Pauli Channel

We present the experimental realization of the optimal estimation protocol for a Pauli noisy channel. The method is based on the generation of 2-qubit Bell states and the introduction of quantum noise in a controlled way on one of the state subsystems. The efficiency of the optimal estimation, achieved by a Bell measurement, is shown to outperform quantum process tomography.

quant-ph↗

arXiv2010

Hyperentangled mixed phased Dicke states: optical design and detection

We present an experimental method to produce 4-qubit phased Dicke states, based on a source of 2-photon hyperentangled states. By introducing quantum noise in the multipartite system in a controlled way, we have tested the robustness of these states. To this purpose the entanglement of the resulting multipartite entangled mixed states has been verified by using a new kind of structural witness.

quant-ph↗

arXiv2010

Multipartite entanglement in quantum algorithms

We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.

quant-ph↗

arXiv2006

Optimal quantum circuits for general phase estimation

We address the problem of estimating the phase phi given N copies of the phase rotation gate u(phi). We consider, for the first time, the optimization of the general case where the circuit consists of an arbitrary input state, followed by any arrangement of the N phase rotations interspersed with arbitrary quantum operations, and ending with a POVM. Using the polynomial method, we show that, in all cases where the measure of quality of the estimate phi' for phi depends only on the difference phi'-phi, the optimal scheme has a very simple fixed form. This implies that an optimal general phase estimation procedure can be found by just optimizing the amplitudes of the initial state.

quant-ph↗

arXiv2006

Superbroadcasting and classical information

We address the problem of broadcasting N copies of a generic qubit state to M>N copies by estimating its direction and preparing a suitable output state according to the outcome of the estimate. This semiclassical broadcasting protocol is more restrictive than a general one, since it requires an intermediate step where classical information is extracted and processed. However, we prove that a suboptimal superbroadcasting, namely broadcasting with simultaneous purification of the local output states with respect to the input ones, is possible. We show that in the asymptotic limit of $M \to \infty$ the purification rate converges to the optimal one, proving the conjecture that optimal broadcasting and state estimation are asymptotically equivalent. We also show that it is possible to achieve superbroadcasting with simultaneous inversion of the Bloch vector direction (universal NOT). We prove that in this case the semiclassical procedure of state estimation and preparation turns out to be optimal. We finally analyse semiclassical superbroadcasting in the phase-covariant case.

quant-ph↗

arXiv2005

Cloning transformations in spin networks without external control

In this paper we present an approach to quantum cloning with unmodulated spin networks. The cloner is realized by a proper design of the network and a choice of the coupling between the qubits. We show that in the case of phase covariant cloner the XY coupling gives the best results. In the 1->2 cloning we find that the value for the fidelity of the optimal cloner is achieved, and values comparable to the optimal ones in the general N->M case can be attained. If a suitable set of network symmetries are satisfied, the output fidelity of the clones does not depend on the specific choice of the graph. We show that spin network cloning is robust against the presence of static imperfections. Moreover, in the presence of noise, it outperforms the conventional approach. In this case the fidelity exceeds the corresponding value obtained by quantum gates even for a very small amount of noise. Furthermore we show how to use this method to clone qutrits and qudits. By means of the Heisenberg coupling it is also possible to implement the universal cloner although in this case the fidelity is 10% off that of the optimal cloner.

quant-ph↗

arXiv2005

Reduced randomness in quantum cryptography with sequences of qubits encoded in the same basis

We consider the cloning of sequences of qubits prepared in the states used in the BB84 or 6-state quantum cryptography protocol, and show that the single-qubit fidelity is unaffected even if entire sequences of qubits are prepared in the same basis. This result is of great importance for practical quantum cryptosystems because it reduces the need for high-speed random number generation without impairing on the security against finite-size attacks.

quant-ph↗