Approximation, Proof Systems, and Correlations in a Quantum World
Gharibian, Sevag
This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems.
In the first area, we demonstrate a polynomial-time (classical) approximation algorithm for dense instances of the canonical QMA-complete quantum constraint satisfaction problem, the local Hamiltonian problem. In the opposite direction, we next introduce a quantum generalization of the polynomial-time hierarchy, and define problems which we prove are not only complete for the second level of this hierarchy, but are in fact hard to approximate.
In the second area, we study variants of the interesting and stubbornly open question of whether a quantum proof system with multiple unentangled quantum provers is equal in expressive power to a proof system with a single quantum prover. Our results concern classes such as BellQMA(poly), and include a novel proof of perfect parallel repetition for SepQMA(m) based on cone programming duality.
In the third area, we study non-classical quantum correlations beyond entanglement, often dubbed "non-classicality". Among our results are two novel schemes for quantifying non-classicality: The first proposes the new paradigm of exploiting local unitary operations to study non-classical correlations, and the second introduces a protocol through which non-classical correlations in a starting system can be "activated" into distillable entanglement with an ancilla system.
An introduction to all required linear algebra and quantum mechanics is included.
2013
info:eu-repo/semantics/doctoralThesis
doc-type:doctoralThesis
text
http://purl.org/coar/resource_type/c_46ec
https://ris.uni-paderborn.de/record/8425
Gharibian S. <i>Approximation, Proof Systems, and Correlations in a Quantum World</i>.; 2013.
eng
info:eu-repo/semantics/altIdentifier/arxiv/1301.2632
info:eu-repo/semantics/openAccess