<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T23:41:43Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3991" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3991</identifier><datestamp>2017-03-21T16:14:01Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="aff60bb5-988e-46a2-8033-3107756451d9" confidence="600">Gharibian, Sevag</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-09-18T14:54:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-09-18T14:54:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-09-18T14:54:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3991</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Given a bipartite density matrix ρ of a quantum state, the Quantum Separability&#xd;
problem (QUSEP) asks — is ρ entangled, or separable? In this thesis, we first&#xd;
strengthen Gurvits’ 2003 NP-hardness result for QUSEP by showing that the Weak&#xd;
Membership problem over the set of separable bipartite quantum states is strongly&#xd;
NP-hard, meaning it is NP-hard even when the error margin is as large as inverse&#xd;
polynomial in the dimension, i.e. is “moderately large”. Previously, this NP-hardness was known only to hold in the case of inverse exponential error. We observe&#xd;
the immediate implication of NP-hardness of the Weak Membership problem over the set of entanglement-breaking maps, as well as lower bounds on the maximum (Euclidean) distance possible between a bound entangled state and the separable set of quantum states (assuming P ≠ NP).&#xd;
&#xd;
We next investigate the entanglement-detecting capabilities of locally invariant&#xd;
unitary operations, as proposed by Fu in 2006. Denoting the subsystems of ρ as&#xd;
A and B, such that ρ_B = Tr_A(ρ), a locally invariant unitary operation U^B is one&#xd;
with the property U^B ρ_B (U^B)^† = ρ_B. We investigate the maximum shift (in Euclidean&#xd;
distance) inducible in ρ by applying I⊗U^B, over all locally invariant choices of U^B.&#xd;
We derive closed formulae for this quantity for three cases of interest: (pseudo)pure&#xd;
quantum states of arbitrary dimension, Werner states of arbitrary dimension, and&#xd;
two-qubit states. Surprisingly, similar to recent anomalies detected for non-locality&#xd;
measures, the first of these formulae demonstrates the existence of non-maximally&#xd;
entangled states attaining shifts as large as maximally entangled ones. Using the latter of these formulae, we demonstrate for certain classes of two-qubit states an equivalence between the Fu criterion and the CHSH inequality. Among other results, we investigate the ability of locally invariant unitary operations to detect bound entanglement.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">quantum information</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">quantum computing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">quantum separability problem</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cyclic unitary operations</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">On the Hardness of the Quantum Separability Problem and the Global Power of Locally Invariant Unitary Operations</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>