Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

DETERMINISTIC COMPUTATIONAL COMPLEXITY OF THE QUANTUM SEPARABILITY PROBLEM

Lawrence M. Ioannou

Published Mar 22, 2006• 4 citations
OpenAlex

Abstract

Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is the quantum separability problem. In Section 1, I begin with a brief introduction to separability and entanglement, and a basic formal definition of the quantum separability problem. I conclude with a summary of one-sided tests for separability, including those involving semidefinite programming. In Section 2, 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 problem. In Section 3, I give a comprehensive survey of deterministic algorithmic solutions to the (approximate) quantum separability problem. Finally, Section 4 contains a comparison of the complexities of the algorithms surveyed in Section 3. I have attempted to give a comprehensive treatment of the deterministic quantum separability problem from a computational perspective and identify relevant open problems. Features and new results include:

Related papers

Computational complexity of the quantum separability problem

Lawrence M. Ioannou

Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or \emph{separable}, state. This paper gives the first systematic and comprehensive treatment of this (bipartite) quantum separability problem, focusing on its deterministic (as opposed to randomized) computational complexity. First, I review the one-sided tests for separability, paying particular attention to the semidefinite programming methods. Then, I discuss various ways of formulating the quantum separability problem, from exact to approximate formulations, the latter of which are the paper's main focus. I then give a thorough treatment of the problem's relationship with NP, NP-completeness, and co-NP. I also discuss extensions of Gurvits' NP-hardness result to strong NP-hardness of certain related problems. A major open question is whether the NP-contained formulation (QSEP) of the quantum separability problem is Karp-NP-complete; QSEP may be the first natural example of a problem that is Turing-NP-complete but not Karp-NP-complete. Finally, I survey all the proposed (deterministic) algorithms for the quantum separability problem, including the bounded search for symmetric extensions (via semidefinite programming), based on the recent quantum de Finetti theorem \cite{DPS02,DPS04,qphCKMR06}; and the entanglement-witness search (via interior-point algorithms and global optimization) \cite{ITCE04,IT06}. These two algorithms have the lowest complexity, with the latter being the best under advice of asymptotically optimal point-coverings of the sphere.

arXiv:quant-ph/0603199•Quantum Information and Computation•May 1, 2007•111 citations

Computing finite-dimensional bipartite quantum separability

Lawrence M. Ioannou

Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is the quantum separability problem. Chapters 1 to 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 witness 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 decide 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.

arXiv:cs/0504110•Apr 29, 2005•6 citations

Quantum interactive proofs and the complexity of separability testing

Gus Gutoski, Patrick M. Hayden, Kevin Milner +1 more

We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof complexity class (including $\mathsf{BQP}$, $\mathsf{QMA}$, $\mathsf{QMA}(2)$, and $\mathsf{QSZK}$), there corresponds a natural separability testing problem that is complete for that class. Of particular interest is the fact that the problem of determining whether an isometry can be made to produce a separable state is either $\mathsf{QMA}$-complete or $\mathsf{QMA}(2)$-complete, depending upon whether the distance between quantum states is measured by the one-way LOCC norm or the trace norm. We obtain strong hardness results by employing prior work on entanglement purification protocols to prove that for each $n$-qubit maximally entangled state there exists a fixed one-way LOCC measurement that distinguishes it from any separable state with error probability that decays exponentially in $n$.

arXiv:1308.5788•Theory of Computing•Jan 1, 2015•43 citations

Entanglement and the shareability of quantum states

Andrew C. Doherty

This brief review discusses the problem of determining whether a given quantum state is separable or entangled. I describe an established approach to this problem that is based on the monogamy of entanglement, which is the observation that a pair of quantum systems that are strongly entangled must be uncorrelated with the rest of the world. Unentangled states on the other hand involve correlations that can be shared with many other parties. Checking whether a given quantum state is shareable involves constructing certain symmetric quantum state extensions and I discuss how to do this using a class of optimizations known as semidefinite programs. An attractive feature of this approach is that it generates explicit entanglement witnesses that can be measured to demonstrate the entanglement experimentally. In recent years analysis of this approach has greatly increased our understanding of the complexity of determining whether a given quantum state is entangled and this review aims to give a unified discussion of these developments. Specifically, I describe how to use finite quantum de Finetti theorems to prove that highly shareable states are nearly separable and use these results to understand the computational complexity of the problem. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.

Journal of Physics A Mathematical and Theoretical•Oct 9, 2014•23 citations

A probabilistic approach to detecting quantum entanglement

A. H. McDonald

A key concept in quantum information theory is the notion of separable states; states for which there is no quantum entanglement.Determining if a given state is entangled has been shown to be NP-hard, and so no deterministic and efficient algorithm will likely be created for this purpose.Current tests are either computationally intensive , return false positives or worsen as the dimension of the problem grows larger.These large dimensions arise naturally in quantum computing.It is therefore necessary to develop a reliable test that is naturally scalable to higher dimensions if one wishes to create efficient quantum computers.Using random matrix theory, a new algorithm has been developed that, with high probability, can determine if a quantum state is separable or entangled.The purpose of this research is to implement this algorithm, checking its efficiency through numerical tests, as well as testing the limitations of the theory behind it.

•Apr 14, 2014•0 citations

Quantum computing and entanglement

Dagmar Bruß, Chiara Macchiavello

This chapter contains an introduction to the main concepts in quantum computation and entanglement. It starts with a brief introduction to computational complexity and then introduces quantum gates and quantum networks, discussing the universality issue in quantum computation. A review on the main known quantum algorithms follows, including Deutsch's, Deutsch-Jozsa's, Grover's and Shor's algorithms. The basic concepts in the theory of quantum error correction are then reviewed. The second part of the chapter is devoted to entanglement. It starts by reminding the basic definitions of entanglement and entanglement criteria for bipartite and multipartite systems, and then discusses the role that entanglement plays in the quantum algorithms described before. The chapter ends with short descriptions of NMR quantum computing, the computational model DQC1, and one-way quantum computing.

Oxford University Press eBooks•May 5, 2011•1 citation
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is the quantum separability problem. In Section 1, I begin with a brief introduction to separability and entanglement, and a basic formal definition of the quantum separability problem. I conclude with a summary of one-sided tests for separability, including those involving semidefinite programming. In Section 2, 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 problem. In Section 3, I give a comprehensive survey of deterministic algorithmic solutions to the (approximate) quantum separability problem. Finally, Section 4 contains a comparison of the complexities of the algorithms surveyed in Section 3. I have attempted to give a comprehensive treatment of the deterministic quantum separability problem from a computational perspective and identify relevant open problems. Features and new results include:
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or \emph{separable}, state. This paper gives the first systematic and comprehensive treatment of this (bipartite) quantum separability problem, focusing on its deterministic (as opposed to randomized) computational complexity. First, I review the one-sided tests for separability, paying particular attention to the semidefinite programming methods. Then, I discuss various ways of formulating the quantum separability problem, from exact to approximate formulations, the latter of which are the paper's main focus. I then give a thorough treatment of the problem's relationship with NP, NP-completeness, and co-NP. I also discuss extensions of Gurvits' NP-hardness result to strong NP-hardness of certain related problems. A major open question is whether the NP-contained formulation (QSEP) of the quantum separability problem is Karp-NP-complete; QSEP may be the first natural example of a problem that is Turing-NP-complete but not Karp-NP-complete. Finally, I survey all the proposed (deterministic) algorithms for the quantum separability problem, including the bounded search for symmetric extensions (via semidefinite programming), based on the recent quantum de Finetti theorem \cite{DPS02,DPS04,qphCKMR06}; and the entanglement-witness search (via interior-point algorithms and global optimization) \cite{ITCE04,IT06}. These two algorithms have the lowest complexity, with the latter being the best under advice of asymptotically optimal point-coverings of the sphere.
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is the quantum separability problem. Chapters 1 to 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 witness 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 decide 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.
We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof complexity class (including BQP\mathsf{BQP}BQP, QMA\mathsf{QMA}QMA, QMA(2)\mathsf{QMA}(2)QMA(2), and QSZK\mathsf{QSZK}QSZK), there corresponds a natural separability testing problem that is complete for that class. Of particular interest is the fact that the problem of determining whether an isometry can be made to produce a separable state is either QMA\mathsf{QMA}QMA-complete or QMA(2)\mathsf{QMA}(2)QMA(2)-complete, depending upon whether the distance between quantum states is measured by the one-way LOCC norm or the trace norm. We obtain strong hardness results by employing prior work on entanglement purification protocols to prove that for each nnn-qubit maximally entangled state there exists a fixed one-way LOCC measurement that distinguishes it from any separable state with error probability that decays exponentially in nnn.
This brief review discusses the problem of determining whether a given quantum state is separable or entangled. I describe an established approach to this problem that is based on the monogamy of entanglement, which is the observation that a pair of quantum systems that are strongly entangled must be uncorrelated with the rest of the world. Unentangled states on the other hand involve correlations that can be shared with many other parties. Checking whether a given quantum state is shareable involves constructing certain symmetric quantum state extensions and I discuss how to do this using a class of optimizations known as semidefinite programs. An attractive feature of this approach is that it generates explicit entanglement witnesses that can be measured to demonstrate the entanglement experimentally. In recent years analysis of this approach has greatly increased our understanding of the complexity of determining whether a given quantum state is entangled and this review aims to give a unified discussion of these developments. Specifically, I describe how to use finite quantum de Finetti theorems to prove that highly shareable states are nearly separable and use these results to understand the computational complexity of the problem. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.
A key concept in quantum information theory is the notion of separable states; states for which there is no quantum entanglement.Determining if a given state is entangled has been shown to be NP-hard, and so no deterministic and efficient algorithm will likely be created for this purpose.Current tests are either computationally intensive , return false positives or worsen as the dimension of the problem grows larger.These large dimensions arise naturally in quantum computing.It is therefore necessary to develop a reliable test that is naturally scalable to higher dimensions if one wishes to create efficient quantum computers.Using random matrix theory, a new algorithm has been developed that, with high probability, can determine if a quantum state is separable or entangled.The purpose of this research is to implement this algorithm, checking its efficiency through numerical tests, as well as testing the limitations of the theory behind it.
This chapter contains an introduction to the main concepts in quantum computation and entanglement. It starts with a brief introduction to computational complexity and then introduces quantum gates and quantum networks, discussing the universality issue in quantum computation. A review on the main known quantum algorithms follows, including Deutsch's, Deutsch-Jozsa's, Grover's and Shor's algorithms. The basic concepts in the theory of quantum error correction are then reviewed. The second part of the chapter is devoted to entanglement. It starts by reminding the basic definitions of entanglement and entanglement criteria for bipartite and multipartite systems, and then discusses the role that entanglement plays in the quantum algorithms described before. The chapter ends with short descriptions of NMR quantum computing, the computational model DQC1, and one-way quantum computing.