arXiv subjects

Eric Chitambar

Publications and source records attributed to Eric Chitambar.

At least 55 records · Page 3Linked to original sources

arXiv2023

The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation

A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how many rounds of classical communication are needed to complete the task. Despite some results separating one-round versus two-round protocols, very little is known about higher round complexities. In this paper, we revisit the task of one-shot random-party entanglement distillation as a way to highlight some interesting features of LOCC round complexity. We first show that for random-party distillation in three qubits, the number of communication rounds needed in an optimal protocol depends on the entanglement measure used; for the same fixed state some entanglement measures need only two rounds to maximize whereas others need an unbounded number of rounds. In doing so, we construct a family of LOCC instruments that require an unbounded number of rounds to implement. We then prove explicit tight lower bounds on the LOCC round number as a function of distillation success probability. Our calculations show that the original W-state random distillation protocol by Fortescue and Lo is essentially optimal in terms of round complexity.

quant-ph↗

arXiv2023

Information Carried by a Single Particle in Quantum Multiple-Access Channels

Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how well multi-party information can be transmitted to a single receiver using just one classical or quantum particle. Our approach is based on a multiple-access communication model in which messages can be encoded into a single particle that is coherently distributed across multiple spatial modes. Theoretically, we derive lower bounds on the accessible information in the quantum setting that strictly separate it from the classical scenario. This separation is found whenever there is more than one sender, and also when there is just a single sender who has a shared phase reference with the receiver. Experimentally, we demonstrate such quantum advantage in single-particle communication by implementing a multi-port interferometer with messages being encoded along the different trajectories. Specifically, we consider a two-sender communication protocol built by a three-port optical interferometer. In this scenario, the rate sum achievable with a classical particle is upper bounded by one bit, while we experimentally observe a rate sum of $1.0152\pm0.0034$ bits in the quantum setup.

quant-ph↗

arXiv2023

Tensor Rank and Other Multipartite Entanglement Measures of Graph States

Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and their multipartite entanglement content. We continue this line of investigation by identifying additional entanglement properties for certain types of graph states. From the perspective of tensor theory, we tighten both upper and lower bounds on the tensor rank of odd ring states ($|R_{2n+1}\rangle$) to read $2^n+1 \leq rank(|R_{2n+1}\rangle) \leq 3*2^{n-1}$. Next, we show that several multipartite extensions of bipartite entanglement measures are dichotomous for graph states based on the connectivity of the corresponding graph. Lastly, we give a simple graph rule for computing the n-tangle $τ_n$.

quant-ph↗

arXiv2022

Regarding the Maximal Qubit Violations of n-Locality in Star and Chain Networks

The nonlocal correlations of noisy quantum systems are important for both understanding nature and developing quantum technology. We consider the correlations of star and chain quantum networks where noisy entanglement sources are measured by nonsignaling parties. When pairs of local dichotomic observables are considered on qubit systems, we derive maximal n-local violations that are larger and more robust to noise than the maximal n-local violations reported previously. To obtain these larger values, we consider observables overlooked in the previous studies. Thus, we gain new insights into self-testing measurements and entanglement sources in star and chain networks.

quant-ph↗

arXiv2022

Quantum Telescopy Clock Games

We consider the clock game-a task formulated in the framework of quantum information theory-that can be used to improve the existing schemes of quantum-enhanced telescopy. The problem of learning when a stellar photon reaches a telescope is translated into an abstract game, which we call the clock game. A winning strategy is provided that involves performing a quantum non-demolition measurement that verifies which stellar spatio-temporal modes are occupied by a photon without disturbing the phase information. We prove tight lower bounds on the entanglement cost needed to win the clock game, with the amount of necessary entangled bits equaling the number of time-bins being distinguished. This lower bound on the entanglement cost applies to any telescopy protocol that aims to non-destructively extract the time-bin information of an incident photon through local measurements, and our result implies that the protocol of Khabiboulline et al. [\text{Phys. Rev. Lett.} 123, 70504 (2019)] is optimal in terms of entanglement consumption. The full task of the phase extraction is also considered, and we show that the quantum Fisher information of the stellar phase can be achieved by local measurements and shared entanglement without the necessity of nonlinear optical operations. The optimal phase measurement is achieved asymptotically with increasing number of ancilla qubits, whereas a single qubit pair is required if nonlinear operations are allowed.

quant-ph↗

arXiv2022

Entanglement Verification of Hyperentangled Photon Pairs

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.

quant-ph↗

arXiv2022

A Hierarchy of Multipartite Correlations Based on Concentratable Entanglement

Multipartite entanglement is one of the hallmarks of quantum mechanics and is central to quantum information processing. In this work we show that Concentratable Entanglement (CE), an operationally motivated entanglement measure, induces a hierarchy upon pure states from which different entanglement structures can be certified. In particular, we find that nearly all genuine multipartite entangled states can be verified through CE. In the process we find the exact maximal value of CE and corresponding states for up to 18 qubits and show that these correspond to extremal quantum error correcting codes. The latter allows us to unravel a deep connection between CE and coding theory. Finally, our results also offer an alternative proof, on up to 31 qubits, that absolutely maximally entangled states do not exist.

quant-ph↗

arXiv2022

Variational Quantum Optimization of Nonlocality in Noisy Quantum Networks

The inherent noise and complexity of quantum communication networks leads to challenges in designing quantum network protocols using classical methods. To address this issue, we develop a variational quantum optimization framework that simulates quantum networks on quantum hardware and optimizes the network using differential programming techniques. We use our hybrid framework to optimize nonlocality in noisy quantum networks. On the noisy IBM quantum computers, we demonstrate our framework's ability to maximize quantum nonlocality. On a classical simulator with a static noise model, we investigate the noise robustness of quantum nonlocality with respect to unital and nonunital channels. In both cases, we find that our optimization methods can reproduce known results, while uncovering interesting phenomena. When unital noise is present we find numerical evidence suggesting that maximally entangled state preparations yield maximal nonlocality. When nonunital noise is present we find that nonmaximally entangled states can yield maximal nonlocality. Thus, we show that variational quantum optimization is a practical design tool for quantum networks in the near-term. In the long-term, our variational quantum optimization techniques show promise of scaling beyond classical approaches and can be deployed on quantum network hardware to optimize quantum communication protocols against their inherent noise.

quant-ph↗

arXiv2022

Building Multiple Access Channels with a Single Particle

A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an N-port interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle. We provide a full characterization of the N-party classical MACs that can be built from a single particle, and we show that every non-classical particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of 1<K<= N parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a "generalized fingerprinting inequality" as a valid facet for this polytope, and we verify that a quantum particle distributed among N separated parties can violate this inequality even when K=N-1. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with K-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number.

quant-ph↗

arXiv2021

Process-optimized phase covariant quantum cloning

After the appearance of the no-cloning theorem, approximate quantum cloning machines (QCMs) have become one of the most well-studied subject in quantum information theory. Among several measures to quantify the performance of a QCM, single-qudit fidelity and global fidelity have been most widely used. In this paper we compute the optimal global fidelity for phase-covariant cloning machines via semi-definite programming optimization, thereby completing a remaining gap in the previous results on QCMs. We also consider optimal simulations of the cloning and transpose cloning map, both by a direct optimization and by a composition of component-wise optimal QCMs. For the cloning map the composition method is sub-optimal whereas for the transpose cloning map the method is asymptotically optimal.

quant-ph↗

arXiv2021

The Communication Value of a Quantum Channel

There are various ways to quantify the communication capabilities of a quantum channel. In this work we study the communication value (cv) of channel, which describes the optimal success probability of transmitting a randomly selected classical message over the channel. The cv also offers a dual interpretation as the classical communication cost for zero-error channel simulation using non-signaling resources. We first provide an entropic characterization of the cv as a generalized conditional min-entropy over the cone of separable operators. Additionally, the logarithm of a channel's cv is shown to be equivalent to its max-Holevo information, which can further be related to channel capacity. We evaluate the cv exactly for all qubit channels and the Werner-Holevo family of channels. While all classical channels are multiplicative under tensor product, this is no longer true for quantum channels in general. We provide a family of qutrit channels for which the cv is non-multiplicative. On the other hand, we prove that any pair of qubit channels have multiplicative cv when used in parallel. Even stronger, all entanglement-breaking channels and the partially depolarizing channel are shown to have multiplicative cv when used in parallel with any channel. We then turn to the entanglement-assisted cv and prove that it is equivalent to the conditional min-entropy of the Choi matrix of the channel. A final component of this work investigates relaxations of the channel cv to other cones such as the set of operators having a positive partial transpose (PPT). The PPT cv is analytically and numerically investigated for well-known channels such as the Werner-Holevo family and the dephrasure family of channels.

quant-ph↗

arXiv2021

Entanglement of assistance in three-qubit systems

The entanglement of assistance quantifies the amount of entanglement that can be concentrated among a group of spatially-separated parties using the assistance of some auxiliary system. In this paper we study the entanglement of assistance in the simplest scenario of three qubits. We consider how much entanglement is lost when the helper party becomes uncoupled by local measurement and classical communication. For three-qubit pure states, it is found that lossless decoupling is always possible when entanglement is quantified by the maximum probability of locally generating a Bell state. However, with respect to most other entanglement measures, such as concurrence and entanglement entropy, a lossless decoupling of the helper is possible only for a special family of states that we fully characterize.

quant-ph↗

arXiv2021

Certifying the Classical Simulation Cost of a Quantum Channel

A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight Bell inequalities is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in $d$ dimensions. The bounds are found to be tight for the special case of the erasure channel.

quant-ph↗

arXiv2020

Quantum Bell Nonlocality is Entanglement

Bell nonlocality describes a manifestation of quantum mechanics that cannot be explained by any local hidden variable model. Its origin lies in the nature of quantum entanglement, although understanding the precise relationship between nonlocality and entanglement has been a notorious open problem. In this paper, we resolve this problem by developing a dynamical framework in which quantum Bell nonlocality emerges as special form of entanglement, and both are unified as resources under local operations and classical communication (LOCC). Our framework is built on the notion of quantum processes, which are abstract quantum channels mapping elements between fixed intervals in space and time. Entanglement is then identified as a quantum process that cannot be generated by LOCC while Bell nonlocality is the subset of these processes that have an instantaneous input-output delay time. LOCC pre-processing is a natural set of free operations in this theory, thereby enabling all entangled states to activate some form of Bell nonlocality. In addition, we generalize the CHSH witnesses from the state domain to the domain of entangled quantum measurements, and provide a systematic method to quantify the Bell nonlocality of a bipartite quantum channel.

quant-ph↗

arXiv2020

Achieving a quantum smart workforce

Interest in building dedicated Quantum Information Science and Engineering (QISE) education programs has greatly expanded in recent years. These programs are inherently convergent, complex, often resource intensive and likely require collaboration with a broad variety of stakeholders. In order to address this combination of challenges, we have captured ideas from many members in the community. This manuscript not only addresses policy makers and funding agencies (both public and private and from the regional to the international level) but also contains needs identified by industry leaders and discusses the difficulties inherent in creating an inclusive QISE curriculum. We report on the status of eighteen post-secondary education programs in QISE and provide guidance for building new programs. Lastly, we encourage the development of a comprehensive strategic plan for quantum education and workforce development as a means to make the most of the ongoing substantial investments being made in QISE.

physics.ed-ph↗

arXiv2020

Simple Bounds for One-shot Pure-State Distillation in General Resource Theories

We present bounds for distilling many copies of a pure state from an arbitrary initial state in a general quantum resource theory. Our bounds apply to operations that are able to generate no more than a $δ$ amount of resource, where $δ\geq 0$ is a given parameter. To maximize applicability of our upper bound, we assume little structure on the set of free states under consideration besides a weak form of superadditivity of the function $G_{min}(ρ)$, which measures the overlap between $ρ$ and the set of free states. Our bounds are given in terms of this function and the robustness of resource. Known results in coherence and entanglement theory are reproduced in this more general framework.

quant-ph↗

arXiv2020

Entanglement-breaking superchannels

In this paper we initiate the study of entanglement-breaking (EB) superchannels. These are processes that always yield separable maps when acting on one side of a bipartite completely positive (CP) map. EB superchannels are a generalization of the well-known EB channels. We give several equivalent characterizations of EB supermaps and superchannels. Unlike its channel counterpart, we find that not every EB superchannel can be implemented as a measure-and-prepare superchannel. We also demonstrate that many EB superchannels can be superactivated, in the sense that they can output non-separable channels when wired in series. We then introduce the notions of CPTP- and CP-complete images of a superchannel, which capture deterministic and probabilistic channel convertibility, respectively. This allows us to characterize the power of EB superchannels for generating CP maps in different scenarios, and it reveals some fundamental differences between channels and superchannels. Finally, we relax the definition of separable channels to include (p,q)-non-entangling channels, which are bipartite channels that cannot generate entanglement using p- and q-dimensional ancillary systems. By introducing and investigating k-EB maps, we construct examples of (p,q)-EB superchannels that are not fully entanglement breaking. Partial results on the characterization of (p,q)-EB superchannels are also provided.

quant-ph↗

arXiv2020

Non-signaling Approximations of Stochastic Team Problems

In this paper, we consider non-signaling approximation of finite stochastic teams. We first introduce a hierarchy of team decision rules that can be classified in an increasing order as randomized policies, quantum-correlated policies, and non-signaling policies. Then, we establish an approximation of team-optimal policies for sequential teams via extendible non-signaling policies. We prove that the distance between extendible non-signaling policies and decentralized policies is small if the extension is sufficiently large. Using this result, we establish a linear programming (LP) approximation of sequential teams. Finally, we state an open problem regarding computation of optimal value of quantum-correlated policies.

eess.SY↗