Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement

Abstract

We prove a trade-off relation between the entanglement cost and classical communication complexity of causal order structure of a protocol in distributed quantum information processing. We consider an implementation of a class of two-qubit unitary gates by local operations and classical communication (LOCC) assisted with shared entanglement, in an information theoretical scenario of asymptotically many input pairs and vanishingly small error. We prove the trade-off relation by showing that (i) one ebit of entanglement per pair is necessary for implementing the unitary by any two-round protocol, and that (ii) the entanglement cost by a three-round protocol is strictly smaller than one ebit per pair. We also provide an example of bipartite unitary gates for which there is no such trade-off.

arXiv comment9 pages, 5 figures. Most of the results in this paper are the same as those in arXiv:1608.07461. In the current version, however, we compare two-round protocols to a three-round one, not to a four-round one as in the previous version. Presentations are improved

References in corpus (50)

• Quantum entanglement
• Quantum Cryptography
• Mixed State Entanglement and Quantum Error Correction
• Concentrating Partial Entanglement by Local Operations
• Measurement-based quantum computation with cluster states
• Experimental One-Way Quantum Computing
• Measurement-based quantum computation
• Conditions for a class of entanglement transformations
• Non-locality and Communication Complexity
• On the quantum, classical and total amount of correlations in a quantum state
• Quantum information can be negative
• Substituting Quantum Entanglement for Communication
• Optimal local implementation of non-local quantum gates
• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• Quantum state merging and negative information
• Quantum conditional mutual information and approximate Markov chains
• Violation of Bell's inequality: criterion for quantum communication complexity advantage
• All Entangled Quantum States Are Nonlocal
• Entangling operations and their implementation using a small amount of entanglement
• Quantum communication complexity protocol with two entangled qutrits
• Quantum Entanglement and Communication Complexity
• Simplified instantaneous non-local quantum computation with applications to position-based cryptography
• Multiparty Quantum Communication Complexity
• Local distinguishability with preservation of entanglement
• Nonlocality and conflicting interest games
• Quantum communication complexity advantage implies violation of a Bell inequality
• Local Transformations Requiring Infinite Rounds of Classical Communication
• Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
• High-dimensional quantum communication complexity beyond strategies based on Bell's theorem
• On the efficiency of nonlocal gates generation
• Local distinguishability of orthogonal 2\otimes3 pure states
• Lower bounds on the entanglement needed to play XOR non-local games
• Entanglement cost of implementing controlled-unitary operations
• Local implementation of nonlocal operations of block forms
• Entanglement requirements for implementing bipartite unitary operations
• Probabilistically implementing nonlocal operation using non-maximally entangled state
• Implementation of multipartite unitary operations with limited resources
• Efficient Implementation of Controlled-Rotations by Using Entanglement
• Bound entanglement helps to reduce communication complexity
• A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
• Round Complexity in the Local Transformations of Quantum and Classical States
• Higher dimensional communication complexity problems: classical protocols vs quantum ones based on Bell's Theorem or prepare-transmit-measure schemes
• Markovianizing Cost of Tripartite Quantum States
• Reducing the communication complexity with quantum entanglement
• Optimizing local protocols implementing nonlocal quantum gates
• Asymptotic local hypothesis testing between a pure bipartite state and the completely mixed state
• State exchange with quantum side information
• Local hypothesis testing between a pure bipartite state and the white noise state
• Deciding the existence of perfect entangled strategies for nonlocal games
• The Cost of Randomness for Converting a Tripartite Quantum State to be Approximately Recoverable

Cited by in corpus (10)

• Quantum Switch for the Quantum Internet: Noiseless Communications through Noisy Channels
• Entanglement of a bipartite channel
• Universal limitations on implementing resourceful unitary evolutions
• Deterministic Generation of Multipartite Entanglement via Causal Activation in the Quantum Internet
• Bounds on Instantaneous Nonlocal Quantum Computation
• The SWAP Imposter: Bidirectional Quantum Teleportation and its Performance
• Trade-off relations of l_1-norm coherence for multipartite systems
• The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation
• Necessary conditions on effective quantum entanglement catalysts
• Quantifying the performance of bidirectional quantum teleportation