No-Go Theorems for Universal Entanglement Purification
Not Available
Engineering topics
Publications and source records attributed to Chitambar, Eric.
Not Available
Statistical correlations that can be generated across the nodes in a quantum network depend crucially on its topology. However, this topological information might not be known a priori, or it may need to be verified. In this paper, we propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We leverage entropic quantities-namely, the von Neumann entropy and the measured mutual information-as well as measurement covariance to uniquely characterize the topology. We show that the entropic quantities are sufficient to distinguish two networks that prepare GHZ states. Moreover, if qubit measurements are available, both entropic quantities and covariance can be used to infer the network topology without state-preparation assumptions. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization. Numerical experiments on both classical simulators and quantum hardware show that covariance is generally more reliable for accurately and efficiently inferring the topology, whereas entropy-based methods are often better at identifying the absence of entanglement in the low-shot regime.
In this work, we experimentally investigate the properties of hyperentangled states displaying simultaneous entanglement in multiple degrees of freedom and find that Bell tests beyond the standard Clauser-Horne-Shimony-Holt inequality can reveal a higher-dimensional nature in a device-independent way. Specifically, we show that hyperentangled states possess more than just simultaneous entanglement in separate degrees of freedom but also entanglement in a higher-dimensional Hilbert space. We also verify the steerability of hyperentangled quantum states by steering different photonic degrees of freedom.
Created by Q-NEXT, a U.S. Department of Energy (DOE) National Quantum Information Science Research Center, this document is a roadmap for quantum interconnects research and its impact for quantum information science and technology. It is the outcome of the collective work of a large team of Q-NEXT members and participants from academia, industry and DOE national laboratories. The roadmap addresses the role of quantum interconnects in three emerging areas of quantum information: computing, communication and sensing. It reviews the materials, components and systems used for these purposes; summarizes relevant scientific questions and issues; and addresses the most pressing research needs. The document then distills these considerations into recommendations for strategic science and technology research imperatives for the next decade. In addition to informing Q-NEXT’s internal activities, the roadmap has also been created with a broader objective of developing a guide for key issues and research needed over the next decade for the worldwide scientific and engineering community interested in quantum information.
Quantum position verification (QPV) is the art of verifying the geographical location of an untrusted party. It has recently been shown that the widely studied Bennett & Brassard 1984 (BB84) QPV protocol is insecure after the 3 dB loss point assuming local operations and classical communication (LOCC) adversaries. Here in this paper, we propose a time-reversed entanglement swapping QPV protocol (based on measurement-device-independent quantum cryptography) that is highly robust against quantum channel loss. First, assuming ideal qubit sources, we show that the protocol is secure against LOCC adversaries for any quantum channel loss, thereby overcoming the 3 dB loss limit. Then, we analyze the security of the protocol in a more practical setting involving weak laser sources and linear optics. Lastly, in this setting, we find that the security only degrades by an additive constant and the protocol is able to verify positions up to 47 dB channel loss.
In this paper, we consider the problem of discriminating quantum states by local operations and classical communication (LOCC) when an arbitrarily small amount of error is permitted. This paradigm is known as asymptotic state discrimination, and we derive necessary conditions for when two multipartite states of any size can be discriminated perfectly by asymptotic LOCC. We use this new criterion to prove a gap in the LOCC and separable distinguishability norms. We then turn to the operational advantage of using two-way classical communication over one-way communication in LOCC processing. With a simple two-qubit product state ensemble, we demonstrate a strict majorization of the two-way LOCC norm over the one-way norm.
No abstract prepared.
We study various types of multipartite states lying near the quantum-classical boundary. The so-called classical states are precisely those in which each party can perfectly identify a locally held state without disturbing the global state, a task known as nondisruptive local state identification (NDLID). We show NDLID to be closely related local broadcasting, and we introduce a class of states called generalized classical states which allow for both NDLID and multipartite broadcasting when the most general quantum measurements are permitted. Simple analytical methods and a physical criterion are given for detecting whether a multipartite state is classical or generalized classical. For deciding the latter, a semidefinite programming algorithm is presented which may find use in other fields such as signal processing.
Maximally entangled states (MES) represent a valuable resource in quantum information processing. In N-qubit systems the MES are N-GHZ states [i.e., the collection of |GHZ{sub N}>=(1/{radical}(2))(|00...0>+|11...1>)] and its local unitary (LU) equivalences. While it is well known that such states are uniquely stabilized by N commuting observables, in this article we consider the minimum number of noncommuting observables needed to characterize an N-qubit MES as the unique common eigenstate. Here, we prove, rather surprisingly, that in this general case any N-GHZ state can be uniquely stabilized by only two observables. Thus, for the task of MES certification, only two correlated measurements are required with each party observing the spin of his or her system along one of two directions.
We investigate the physically allowed probabilities for transforming one N-partite W-class state to another by means of local operations assisted with classical communication. Recently, S. Kintas and S. Turgut [J. Math. Phys. 51, 092202 (2010)] obtained an upper bound for the maximum probability of transforming two such states. Here, we provide a simple sufficient and necessary condition for when this upper bound can be satisfied and, thus, when optimality of state transformation can be achieved. Our discussion involves obtaining lower bounds for the transformation of arbitrary W-class states and showing precisely when this bound saturates the bound of Kintas and Turgut. Finally, we consider the question of transforming symmetric W-class states and find that, in general, the optimal one-shot procedure for converting two symmetric states requires a nonsymmetric filter by all the parties.
We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol.
Tensor rank refers to the number of product states needed to express a given multipartite quantum state. Its nonadditivity as an entanglement measure has recently been observed. In this Brief Report, we estimate the tensor rank of multiple copies of the tripartite state |W>=(1/sq root(3))(|100>+|010>+|001>). Both an upper bound and a lower bound of this rank are derived. In particular, it is proven that the rank of |W>{sup x}2 is 7, thus resolving a previously open problem. Some implications of this result are discussed in terms of transformation rates between |W>{sup xn} and multiple copies of the state |GHZ>=(1/sq root(2))(|000>+|111>).