Use this URL to cite or link to this record in EThOS:
Title: Computing finite-dimensional bipartite quantum separability
Author: Ioannou, L. M.
Awarding Body: University of Cambridge
Current Institution: University of Cambridge
Date of Award: 2006
Availability of Full Text:
Full text unavailable from EThOS. Please contact the current institution’s library for further details.
In Chapter 2, I apply polyhedral theory to prove easily that the set of separable states is not a polytope; for the sake of completeness, I then review the role of polytopes in nonlocality. Next, I give a novel treatment of entanglement witnesses and define a new class of entanglement witnesses, which may prove to be useful beyond the examples given. In the last section, I briefly review the five basic convex body problems given in [1] (Groetschel et al., 1988), and their application to the quantum separability problem. In Chapter 3, I treat the separability problem as a computational decision problem and motivate its approximate formulations. After a review of basic complexity-theoretic notions, I discuss the computational complexity of the separability problems: I discuss the issue of NP-completeness, giving an alternative definition of the separability problem as an NP-hard problem in NP. I finish the chapter with a comprehensive survey of deterministic algorithm solutions to the separability problem, including one that follows from a second NP formulation. Chapters 1 and 3 motivate a new interior-point algorithm which, given the expected values of a subset of an orthogonal basis of observables of an otherwise unknown quantum state, searches for an entanglement witnesses in the span of the subset of observables. When all the expected values are known, the algorithm solves the separability problem. In Chapter 4, I give the motivation for the algorithm and show how it can be used in a particular physical scenario to detect entanglement (or decade separability) of an unknown quantum state using as few quantum resources as possible. I then explain the intuitive idea behind the algorithm and relate it to the standard algorithms of its kind. I end the chapter with a comparison of the complexities of the algorithms surveyed in Chapter 3. Finally, in Chapter 5, I present the details of the algorithm and discuss its performance relative to standard methods.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available