Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Separability problem"”.
-
On the Hardness of the Quantum Separability Problem and the Global Power of Locally Invariant Unitary Operations
… density matrix ρ of a quantum state, the Quantum Separability problem (QUSEP) asks — is ρ entangled, or separable? In this thesis, we first strengthen Gurvits’ 2003 NP-hardness result for QUSEP by showing that the Weak Membership problem over the set of separable bipartite quantum states is …
-
Non-negative Polynomials, Sums of Squares & The Moment Problem
… studies polynomial optimization, that is, the problem of minimizing the value of a polynomial over a semi-algebraic set. Such polynomial optimization problems arise in a wide variety of contexts, both in mathematics, and more generally in science and engineering. In the first part of this …
-
A STUDY ON QUANTUM ENTANGLEMENT
In this thesis, we focus on the problems of quantum entanglement, which is one of the most important phenomena in quantum physics. In particular, we study the quantum entanglement problem and the quantum distillation problem. Although the quantum entanglement problem is regarded as an NP-hard …
-
Development of new tools to detect, characterize and quantify quantum entanglement in multipartite systems
… concept of generalized concurrences to solve the separability problem for pure states. We then reformulate the separability question of mixed states into a matrix analysis problem, from which we obtain general separability criteria for multipartite states of ranks two and three. We also briefly …
-
Techniques For Computing and Approximating Large Optimization Problems in Quantum Information
Many fundamental problems in quantum information theory can be formulated as optimization tasks over quantum states and measurements. While the convex structure of quantum theory often enables powerful semidefinite programming formulations, a major challenge persists: the exponential growth of …
-
On Algorithms, Separability and Cellular Automata in Quantum Computing
… systems. In Part II, we explore the quantum separability problem, where we are given a density matrix for a state over two quantum systems, and we are to determine whether the state is separable with respect to these systems. We also look at the converse problem of finding an entanglement …