The detection of change points is a pivotal task in statistical analysis. In the quantum realm, it is a new primitive where one aims at identifying the point where a source that supposedly prepares a sequence of particles in identical quantum states starts preparing a mutated one. We obtain the optimal procedure to identify the change point with certainty-naturally at the price of having a certain probability of getting an inconclusive answer. We obtain the analytical form of the optimal probability of successful identification for any length of the particle sequence. We show that the conditional success probabilities of identifying each possible change point show an unexpected oscillatory behavior. We also discuss local (online) protocols and compare them with the optimal procedure.

}, issn = {0031-9007}, doi = {10.1103/PhysRevLett.119.140506}, author = {Sent{\'\i}s, Gael and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon} } @article {784, title = {Quantum Change Point}, journal = {Physical Review Letters}, volume = {117}, year = {2016}, month = {Jan-10-2016}, issn = {0031-9007}, doi = {10.1103/PhysRevLett.117.150502}, url = {http://link.aps.org/doi/10.1103/PhysRevLett.117.150502http://link.aps.org/article/10.1103/PhysRevLett.117.150502}, author = {Sent{\'\i}s, Gael and Bagan, Emilio and Calsamiglia, John and Chiribella, Giulio and Mu{\~n}oz-Tapia, Ramon} } @article {gendra_probabilistic_2014, title = {Probabilistic Metrology Attains Macroscopic Cloning of Quantum Clocks}, journal = {Physical Review Letters}, volume = {113}, number = {26}, year = {2014}, issn = {0031-9007, 1079-7114}, doi = {10.1103/PhysRevLett.113.260402}, url = {http://link.aps.org/doi/10.1103/PhysRevLett.113.260402}, author = {Gendra, B. and Calsamiglia, John and Mu{\~n}oz-Tapia, R. and E. Bagan and Chiribella, G.} } @article {523, title = {Quantum information: The occasional super clock-cloner}, journal = {Nature Physics}, volume = {10}, number = {2}, year = {2014}, month = {2/2014}, pages = {91}, issn = {1745-2473}, doi = {10.1038/nphys2853}, author = {Calsamiglia, John} } @article {piani_quantumness_2014, title = {Quantumness of correlations, quantumness of ensembles and quantum data hiding}, journal = {New Journal of Physics}, volume = {16}, number = {11}, year = {2014}, pages = {113001}, issn = {1367-2630}, doi = {10.1088/1367-2630/16/11/113001}, url = {http://stacks.iop.org/1367-2630/16/i=11/a=113001?key=crossref.9f5154f8c85e7f9471e2931d9a02df88}, author = {Piani, M and Narasimhachar, V and Calsamiglia, John} } @article {499, title = {Programmable discrimination with an error margin}, journal = {Physical Review A}, volume = {88}, year = {2013}, month = {11/2013}, pages = {052304}, issn = {1094-1622}, doi = {10.1103/PhysRevA.88.052304}, author = {Sent{\'\i}s, G and E. Bagan and Calsamiglia, John and Mu{\~n}oz-Tapia, R.} } @article {436, title = {Quantum Metrology Assisted by Abstention}, journal = {Physical Review Letters}, volume = {110}, year = {2013}, month = {3/2013}, pages = {100501}, abstract = {The main goal of quantum metrology is to obtain accurate values of physical parameters using quantum probes. In this context, we show that abstention, i.e., the possibility of getting an inconclusive answer at readout, can drastically improve the measurement precision and even lead to a change in its asymptotic behavior, from the shot-noise to the Heisenberg scaling. We focus on phase estimation and quantify the required amount of abstention for a given precision. We also develop analytical tools to obtain the asymptotic behavior of the precision and required rate of abstention for arbitrary pure states.}, issn = {1079-7114}, doi = {10.1103/PhysRevLett.110.100501}, url = {http://prl.aps.org/abstract/PRL/v110/i10/e100501}, author = {Gendra, B. and Ronco-Bonvehi, E. and Calsamiglia, John and Mu{\~n}oz-Tapia, R. and E. Bagan} } @article {gendra_beating_2012, title = {Beating noise with abstention in state estimation}, journal = {New Journal of Physics}, volume = {14}, number = {10}, year = {2012}, pages = {105015}, issn = {1367-2630}, doi = {10.1088/1367-2630/14/10/105015}, url = {http://iopscience.iop.org/1367-2630/14/10/105015}, author = {Gendra, Bernat and Ronco-Bonvehi, Elio and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon and Bagan, Emilio} } @mastersthesis {391, title = {Entanglement distribution in quantum complex networks}, volume = {Doctorat en F{\'\i}sica}, year = {2012}, month = {11/2012}, school = {Universitat Aut{\`o}noma de Barcelona}, type = {PhD}, address = {Barcelona}, abstract = {This thesis deals with the study of quantum networks with a complex structure, the implications this structure has in the distribution of entanglement and how their functioning can be enhanced by operating in the quantum regime. We first consider a complex network of bipartite states, both pure and mixed, and study the distribution of long-distance entanglement. Then, we move to a network with noisy channels and study the creation and distribution of large, multipartite states. The work contained in this thesis is primarily motivated by the idea that the interplay between quantum information and complex networks may give rise to a new understanding and characterization of natural systems. Complex networks are of particular importance in communication infrastructures, as most present telecommunication networks have a complex structure. In the case of quantum networks, which are the necessary framework for distributed quantum processing and for quantum communication, it is very plausible that in the future they acquire a complex topology resembling that of existing networks, or even that methods will be developed to use current infrastructures in the quantum regime. A central task in quantum networks is to devise strategies to distribute entanglement among its nodes. In the first part of this thesis, we consider the distribution of bipartite entanglement as an entanglement percolation process in a complex network. Within this approach, perfect entanglement is established probabilistically between two arbitrary nodes. We see that for large networks, the probability of doing so is a constant strictly greater than zero (and independent of the size of the network) if the initial amount of entanglement is above a certain critical value. Quantum mechanics offer here the possibility to change the structure of the network without need to establish new, "physical" channels. By a proper local transformation of the network, the critical entanglement can be decreased and the probability increased. We apply this transformation to complex network models with arbitrary degree distribution. In the case of a noisy network of mixed states, we see that for some classes of states, the same approach of entanglement percolation can be used. For general mixed states, we consider a limited-path-length entanglement percolation constrained by the amount of noise in the connections. We see how complex networks still offer a great advantage in the probability of connecting two nodes. In the second part, we move to the multipartite scenario. We study the creation and distribution of graph states with a structure that mimic the underlying communication network. In this case, we use an arbitrary complex network of noisy channels, and consider that operations and measurements are also noisy. We propose an efficient scheme to distribute and purify small subgraphs, which are then merged to reproduce the desired state. We compare this approach with two bipartite protocols that rely on a central station and full knowledge of the network structure. We show that the fidelity of the generated graphs can be written as the partition function of a classical disordered spin system (a spin glass), and its decay rate is the analog of the free energy. Applying the three protocols to a one-dimensional network and to complex networks, we see that they are all comparable, and in some cases the proposed subgraph protocol, which needs only local information of the network, performs even better. }, author = {Cuquet, Mart{\'\i}} } @mastersthesis {390, title = {Entanglement percolation with graph-states{\textquoteright}}, volume = {Grau en F{\'\i}sica}, year = {2012}, month = {09/2012}, school = {Universitat Aut{\`o}noma de Barcelona}, type = {BSc Thesis}, address = {Barcelona}, author = {Franquet, Abert} } @article {cuquet_growth_2012, title = {Growth of graph states in quantum networks}, journal = {Physical Review A}, volume = {86}, number = {4}, year = {2012}, pages = {042304}, abstract = {We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We benchmark our scheme with two protocols where each connected component is prepared in a node belonging to the component and subsequently distributed via quantum repeaters to the remaining connected nodes. We show that the fidelity of the generated graphs can be written as the partition function of a classical Ising-type Hamiltonian. We give exact expressions of the fidelity of the linear cluster and results for its decay rate in random graphs with arbitrary (uncorrelated) degree distributions.}, doi = {10.1103/PhysRevA.86.042304}, url = {http://link.aps.org/doi/10.1103/PhysRevA.86.042304}, author = {Cuquet, Mart{\'\i} and Calsamiglia, John} } @article {Sentis:2012uq, title = {Quantum learning without quantum memory}, journal = {Scientific Reports (Nature Publishing Group)}, volume = {2}, year = {2012}, month = {10/2012}, pages = {708}, publisher = {Nature Publishing Group}, abstract = {A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an {\textquotedblleft}estimate-and-discriminate{\textquotedblright} machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.}, doi = {10.1038/srep00708}, url = {http://www.nature.com/srep/2012/121005/srep00708/full/srep00708.html}, author = {Sent{\'\i}s, Gael and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon and Bagan, Emilio} } @article {PhysRevLett.106.220403, title = {All Nonclassical Correlations Can Be Activated into Distillable Entanglement}, journal = {Phys. Rev. Lett.}, volume = {106}, number = {22}, year = {2011}, month = {Jun}, pages = {220403}, publisher = {American Physical Society}, doi = {10.1103/PhysRevLett.106.220403}, url = {http://prl.aps.org/abstract/PRL/v106/i22/e220403}, author = {Piani, Marco and Gharibian, Sevag and Adesso, Gerardo and Calsamiglia, John and Horodecki, Pawe{\l} and Winter, Andreas} } @article {Gharibian:2011kq, title = {Characterizing quantumness via entanglement creation}, journal = {International Journal of Quantum Information}, volume = {9}, year = {2011}, month = {05}, pages = {1701-1713}, doi = {10.1142/S0219749911008258}, url = {http://arxiv.org/abs/1105.3419}, author = {Gharibian, Sevag and Piani, Marco and Adesso, Gerardo and Calsamiglia, John and Pawel Horodecki} } @article {303, title = {Limited-path-length entanglement percolation in quantum complex networks}, journal = {Physical Review A}, volume = {83}, number = {3}, year = {2011}, month = {03/2011}, pages = {032319-14}, abstract = {We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.}, doi = {10.1103/PhysRevA.83.032319}, url = {http://pra.aps.org/abstract/PRA/v83/i3/e032319}, author = {Cuquet, Mart{\'\i} and Calsamiglia, John} } @mastersthesis {392, title = {Quantum Accuracy Limits and Benchmarks in Continuos Variable Systems}, volume = {Doctorat en F{\'\i}sica}, year = {2011}, month = {10/2011}, school = {Universitat Aut{\`o}noma de Barcelona}, type = {PhD}, address = {Barcelona}, author = {Bracons, Mariona (formerly Mariona Aspachs)} } @article {oreshkov_adiabatic_2010, title = {Adiabatic Markovian Dynamics}, journal = {Phys. Rev. Lett.}, volume = { 105}, year = {2010}, pages = {050503}, abstract = {We propose a theory of adiabaticity in quantum Markovian dynamics based on a structural decomposition of the Hilbert space induced by the asymptotic behavior of the Lindblad semigroup. A central idea of our approach is that the natural generalization of the concept of eigenspace of the Hamiltonian in the case of Markovian dynamics is a noiseless subsystem with a minimal noisy cofactor. Unlike previous attempts to define adiabaticity for open systems, our approach deals exclusively with physical entities and provides a simple, intuitive picture at the underlying Hilbert-space level, linking the notion of adiabaticity to the theory of noiseless subsystems. As an application of our theory, we propose a framework for decoherence-assisted computation in noiseless codes under general Markovian noise. We also formulate a dissipation-driven approach to holonomic computation based on adiabatic dragging of subsystems that is generally not achievable by non-dissipative means.}, keywords = {Quantum Physics}, doi = {10.1103/PhysRevLett.105.050503}, url = {http://arxiv.org/abs/1002.2219}, author = {Oreshkov, Ognyan and Calsamiglia, John} } @article {de_vicente_estimation_2010, title = {Estimation of quantum finite mixtures}, journal = {Physical Review A}, volume = {81}, number = {1}, year = {2010}, month = {1/2010}, pages = {012332}, abstract = {We consider the problem of determining the weights of a quantum ensemble. That is to say, given a quantum system that is in a set of possible known states according to an unknown probability law, we give strategies to estimate the individual probabilities, weights, or mixing proportions. Such strategies can be used to estimate the frequencies at which different independent signals are emitted by a source. They can also be used to estimate the weights of particular terms in a canonical decomposition of a quantum channel. The quality of these strategies is quantified by a covariance-type error matrix. According with this cost function, we give optimal strategies in both the single-shot and multiple-copy scenarios. The latter is also analyzed in the asymptotic limit of large number of copies. We give closed expressions of the error matrix for two-component quantum mixtures of qubit systems. The Fisher information plays an unusual role in the problem at hand, providing exact expressions of the minimum covariance matrix for any number of copies.}, doi = {10.1103/PhysRevA.81.012332}, url = {http://link.aps.org/doi/10.1103/PhysRevA.81.012332}, author = {de Vicente, J. I. and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon and Bagan, Emilio} } @article {PhysRevLett.105.080504, title = {Local Discrimination of Mixed States}, journal = {Phys. Rev. Lett.}, volume = {105}, number = {8}, year = {2010}, month = {Aug}, pages = {080504}, publisher = {American Physical Society}, doi = {10.1103/PhysRevLett.105.080504}, author = {Calsamiglia, John and de Vicente, J. I. and Mu{\~n}oz-Tapia, R. and E. Bagan} } @mastersthesis {293, title = {Localitat i separabilitat en discriminaci{\'o} d{\textquoteright}hip{\`o}tesis qu{\`a}ntiques}, volume = {Grau en F{\'\i}sica}, year = {2010}, month = {07/2010}, school = {Universitat Aut{\`o}noma de Barcelona}, type = {BSc Thesis}, address = {Barcelona}, abstract = {En aquest treball s{\textquoteright}estudiar{\`a} la probabilitat {\`o}ptima d{\textquoteright}obtenir l{\textquoteright}estat correcte en una mesura sobre un sistema de N c{\`o}pies de tres estats qu{\`a}ntics amb probabilitats a priori id{\`e}ntiques i separats 120{\textordmasculine}. S{\textquoteright}estudiaran diferents estrat{\`e}gies, posant especial {\`e}mfasi en la localitat i l{\textquoteright}entrella{\c c}ament de les mesures. Finalment es far{\`a} una generalitzaci{\'o} d{\textquoteright}aquestes estrat{\`e}gies per a estats mescla, estudiant la probabilitat de discriminar-los en funci{\'o} de la seva puresa i l{\textquoteright}estrat{\`e}gia portada a terme.}, author = {Caminal Armadans, Roger} } @mastersthesis {298, title = {Localitzaci{\'o} en xarxes complexes}, volume = {Grau en F{\'\i}sica}, year = {2010}, month = {07/2010}, school = {Universitat Aut{\`o}noma de Barcelona}, type = {BSc Thesis}, address = {Barcelona}, abstract = {En els anys 1950s, P.W. Anderson va suggerir la possibilitat d{\textquoteright}un nou fenomen en f{\'\i}sica de l{\textquoteright}estat s{\`o}lid: la localitzaci{\'o}. Aquest fenomen consisteix en que la funci{\'o} d{\textquoteright}ona dels electrons es queda totalment localitzada en l{\textquoteright}espai provocant que el material passi de ser un conductor a un a{\"\i}llant. Ha estat extensament estudiat en xarxes ordenades i {\'e}s conseq{\"u}{\`e}ncia de les impureses del material. En aquest treball, pretenem estudiar la localitzaci{\'o} en xarxes amb naturalesa aleat{\`o}ria, en particular, en xarxes complexes. La idea b{\`a}sica {\'e}s, tenint en compte que l{\textquoteright}aleatorietat de les impureses del material provoca localitzaci{\'o}, veure si l{\textquoteright}aleatorietat en l{\textquoteright}estructura del material produeix el mateix efecte.}, author = {Perarnau Llobet, Mart{\'\i}} } @article {sentis_multicopy_2010, title = {Multicopy programmable discrimination of general qubit states}, journal = {Physical Review A}, volume = {82}, number = {4}, year = {2010}, month = {10/2010}, pages = {042312}, abstract = {Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task when the pair of possible states is not a priori known but instead the two possible states are provided through two respective program ports. We study optimal programmable discrimination machines for general qubit states when several copies of states are available in the data or program ports. Two scenarios are considered: One in which the purity of the possible states is a priori known, and the fully universal one where the machine operates over generic mixed states of unknown purity. We find analytical results for both the unambiguous and minimum error discrimination strategies. This allows us to calculate the asymptotic performance of programmable discrimination machines when a large number of copies are provided and to recover the standard state discrimination and state comparison values as different limiting cases.}, doi = {10.1103/PhysRevA.82.042312}, url = {http://link.aps.org/doi/10.1103/PhysRevA.82.042312}, author = {Sent{\'\i}s, Gael and Bagan, Emili and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon} } @article {rapcan_recycling_2010, title = {Recycling of qubits}, journal = {Physica Scripta}, volume = {T140}, year = {2010}, pages = {014059}, abstract = {We consider a finite number, N, of qubits that encode a pure single qubit state SU(2) covariantly. Given the N-qubit state has already been measured optimally to estimate the single-qubit state, we analyse the maximum information obtainable by a second, and subsequent observers ignorant of important details of the previous measurements. We quantify the information acquired by each observer as a function of N and of the number of independent observers that in succession have independently measured the same ensemble of qubits before him.}, issn = {0031-8949}, doi = {10.1088/0031-8949/2010/T140/014059}, url = {http://iopscience.iop.org/1402-4896/2010/T140/014059?fromSearchPage=true}, author = {P Rapcan and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon and Bagan, Emilio and V Buzek} } @article {Oreshkov2009c, title = {Comment on {\textquotedblleft}Nongeometric Conditional Phase Shift via Adiabatic Evolution of Dark Eigenstates: A New Approach to Quantum Computation{\textquotedblright}}, journal = {Physical Review Letters}, volume = {103}, number = {18}, year = {2009}, pages = {188901}, issn = {0031-9007}, doi = {10.1103/PhysRevLett.103.188901}, url = {http://prl.aps.org/abstract/PRL/v103/i18/e188901}, author = {Oreshkov, Ognyan and Calsamiglia, John} } @article {Oreshkov2009, title = {Distinguishability measures between ensembles of quantum states}, journal = {Physical Review A (Atomic, Molecular, and Optical Physics)}, volume = {79}, number = {3}, year = {2009}, pages = {032336{\textendash}29}, issn = {1050-2947}, doi = {10.1103/PhysRevA.79.032336}, url = {http://link.aps.org/doi/10.1103/PhysRevA.79.032336}, author = {Oreshkov, Ognyan and Calsamiglia, John} } @article {Cuquet2009, title = {Entanglement Percolation in Quantum Complex Networks}, journal = {Physical Review Letters}, volume = {103}, number = {24}, year = {2009}, month = {12/2009}, pages = {240503{\textendash}4}, publisher = {APS}, abstract = {Quantum networks are essential to quantum information distributed applications, and communicatingover them is a key challenge. Complex networks have richand intriguing properties, which are as yet unexplored in thequantum setting. Here, we study the effect of entanglement percolationas a means to establish long-distance entanglement between arbitrary nodesof quantum complex networks. We develop a theory to analyticallystudy random graphs with arbitrary degree distribution and give exactresults for some models. Our findings are in good agreementwith numerical simulations and show that the proposed quantum strategiesenhance the percolation threshold substantially. Simulations also show a clearenhancement in small-world and other real-world networks.}, keywords = {complex networks, entanglement distribution, entanglement percolation, erdos-renyi, generating function, quantum complex networks, quantum networks, scale-free, small-world}, doi = {10.1103/PhysRevLett.103.240503}, url = {http://link.aps.org/abstract/PRL/v103/e240503}, author = {Cuquet, Mart{\'\i} and Calsamiglia, John} } @article {Aspachs2009, title = {Phase estimation for thermal Gaussian states}, journal = {Physical Review A (Atomic, Molecular, and Optical Physics)}, volume = {79}, number = {3}, year = {2009}, month = {03/2009}, pages = {033834{\textendash}12}, keywords = {gaussian noise, gaussian states, optical losses, optical squeezing, phase estimation, quantum noise, thermal noise}, doi = {10.1103/PhysRevA.79.033834}, url = {http://link.aps.org/abstract/PRA/v79/e033834}, author = {Aspachs, Mariona and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon and Bagan, Emili} } @article {Calsamiglia2009, title = {Phase-covariant quantum benchmarks}, journal = {Physical Review A (Atomic, Molecular, and Optical Physics)}, volume = {79}, number = {5}, year = {2009}, pages = {050301{\textendash}4}, keywords = {quantum benchmarks}, issn = {1050-2947}, doi = {10.1103/PhysRevA.79.050301}, url = {http://link.aps.org/doi/10.1103/PhysRevA.79.050301}, author = {Calsamiglia, John and Aspachs, Mariona and Mu{\~n}oz-Tapia, Ramon and Bagan, Emili} } @article {Calsamiglia2008, title = {Quantum Chernoff bound as a measure of distinguishability between density matrices: Application to qubit and Gaussian states}, journal = {Physical Review A (Atomic, Molecular, and Optical Physics)}, volume = {77}, number = {3}, year = {2008}, month = {03/2008}, pages = {032311{\textendash}15}, keywords = {Bayes methods, error statistics, quantum chernoff bound, quantum statistical mechanics, quantum theory}, doi = {10.1103/PhysRevA.77.032311}, url = {http://link.aps.org/abstract/PRA/v77/e032311}, author = {Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon and Masanes, Llu{\'\i}s and Ac{\'\i}n, Antonio and Bagan, Emili} } @article {Audenaert2007, title = {Discriminating States: The Quantum Chernoff Bound}, journal = {Physical Review Letters}, volume = {98}, number = {16}, year = {2007}, month = {04/2007}, pages = {160501{\textendash}4}, keywords = {quantum chernoff bound, state discrimination}, doi = {10.1103/PhysRevLett.98.160501}, url = {http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal\&id=PRLTAO000098000016160501000001\&idtype=cvips\&gifs=yes}, author = {K. M. R. Audenaert and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon and Bagan, Emili and Masanes, Llu{\'\i}s and Ac{\'\i}n, Antonio and Verstraete, Frank} } @article {Bagan2007, title = {How to hide a secret direction}, journal = {New Journal of Physics}, volume = {9}, year = {2007}, pages = {244}, abstract = {We present a procedure to share a secret spatial direction in the absence of a common reference frame using a multipartite quantum state. The procedure guarantees that the parties can determine the direction if they perform joint measurements on the state, but fail to do so if they restrict themselves to local operations and classical communication (LOCC). We calculate the fidelity for joint measurements, give bounds on the fidelity achievable by LOCC, and prove that there is a non-vanishing gap between the two of them, even in the limit of infinitely many copies. The robustness of the procedure under particle loss is also studied. As a by-product we find bounds on the probability of discriminating by LOCC between the invariant subspaces of total angular momentum N/2 and N/2-1 in a system of N elementary spins.}, doi = {doi:10.1088/1367-2630/9/8/244}, url = {http://iopscience.iop.org/1367-2630/9/8/244/pdf/1367-2630\_9\_8\_244.pdf}, author = {Bagan, Emili and Calsamiglia, John and Demkowicz-Dobrzanski, R. and Mu{\~n}oz-Tapia, Ramon} } @article {Rapcan2007, title = {Recycling of quantum information: Multiple observations of quantum systems}, journal = {arXiv}, year = {2007}, month = {08/2007}, abstract = {Given a finite number of copies of an unknown qubit state that have already been measured optimally, can one still extract any information about the original unknown state? We give a positive answer to this question and quantify the information obtainable by a given observer as a function of the number of copies in the ensemble, and of the number of independent observers that, one after the other, have independently measured the same ensemble of qubits before him. The optimality of the protocol is proven and extensions to other states and encodings are also studied. According to the general lore, the state after a measurement has no information about the state before the measurement. Our results manifestly show that this statement has to be taken with a grain of salt, specially in situations where the quantum states encode confidential information.}, url = {http://arxiv.org/abs/0708.1086}, author = {Rapcan, Peter and Calsamiglia, John and Mu{\~n}oz-Tapia, Ramon and Bagan, Emili and Bu{\.z}ek, Vladimir} } @article {Hartmann2007, title = {Weighted graph states and applications to spin chains, lattices and gases}, journal = {Journal of Physics B: Atomic, Molecular and Optical Physics}, volume = {40}, number = {9}, year = {2007}, pages = {S1}, doi = {10.1088/0953-4075/40/9/S01}, url = {http://www.iop.org/EJ/abstract/0953-4075/40/9/S01}, author = {Hartmann, L. and Calsamiglia, John and D{\"u}r, Wolfgang and Briegel, Hans J.} } @article {Calsamiglia2005, title = {Spin Gases: Quantum Entanglement Driven by Classical Kinematics}, journal = {Physical Review Letters}, volume = {95}, number = {18}, year = {2005}, month = {10/2005}, pages = {180502}, abstract = {A spin gas is a natural extension of a classical gas. It consists of a large number of particles whose (random) motion is described classically, but, in addition, have internal (quantum mechanical) degrees of freedom that interact during collisions. For specific types of quantum interactions we determine the entanglement that occurs naturally in such systems. We analyze how the evolution of the quantum state is determined by the underlying classical kinematics of the gas. For the Boltzmann gas, we calculate the rate at which entanglement is produced and characterize the entanglement properties of the equilibrium state.}, keywords = {entanglement distribution, spin gas}, doi = {10.1103/PhysRevLett.95.180502}, url = {http://link.aps.org/abstract/PRL/v95/e180502}, author = {Calsamiglia, John and Hartmann, L. and D{\"u}r, Wolfgang and Briegel, Hans J.} }