Quantum Strategies and Local Operations

Abstract

This thesis is divided into two parts. In Part I we introduce a new formalism for quantum strategies, which specify the actions of one party in any multi-party interaction involving the exchange of multiple quantum messages among the parties. This formalism associates with each strategy a single positive semidefinite operator acting only upon the tensor product of the input and output message spaces for the strategy. We establish three fundamental properties of this new representation for quantum strategies and we list several applications, including a quantum version of von Neumann's celebrated 1928 Min-Max Theorem for zero-sum games and an efficient algorithm for computing the value of such a game. In Part II we establish several properties of a class of quantum operations that can be implemented locally with shared quantum entanglement or classical randomness. In particular, we establish the existence of a ball of local operations with shared randomness lying within the space spanned by the no-signaling operations and centred at the completely noisy channel. The existence of this ball is employed to prove that the weak membership problem for local operations with shared entanglement is strongly NP-hard. We also provide characterizations of local operations in terms of linear functionals that are positive and "completely" positive on a certain cone of Hermitian operators, under a natural notion of complete positivity appropriate to that cone. We end the thesis with a discussion of the properties of no-signaling quantum operations.

PhD thesis, 150 pages. Chapter 5 is new. Part I (except Chapter 5) is an expanded and revised version of arXiv:quant-ph/0611234. Chapter 5 (with corrections) was later published as arXiv:1008.4636. Part II is nearly identical to arXiv:0805.2209. v2: added errata for Chapter 5

References in corpus (15)

• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Theoretical framework for quantum networks
• Quantum Circuits Architecture
• Transforming quantum operations: quantum supermaps
• Optimal cloning of unitary transformations
• Optimal quantum tomography for states, measurements, and transformations
• Semidefinite programs for completely bounded norms
• A short impossibility proof of Quantum Bit Commitment
• Strong Parallel Repetition Theorem for Quantum XOR Proof Systems
• Entanglement in Interactive Proof Systems with Binary Answers
• Entangled states close to the maximally mixed state
• Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems
• The Complexity of the Consistency and N-representability Problems for Quantum States
• Entangled games are hard to approximate
• Optimal quantum strong coin flipping

Cited by in corpus (8)

• All Entangled Quantum States Are Nonlocal
• Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
• Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
• Evaluating the Advantage of Adaptive Strategies for Quantum Channel Distinguishability
• Rank-one Quantum Games
• Parallel Repetition of Prover-Verifier Quantum Interactions
• Unconditionally-secure and reusable public-key authentication
• Time-reversal of rank-one quantum strategy functions