Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
A Quasipolynomial-Time Algorithm for the Quantum Separability Problem
Fernando G. S. L. Brandao,
Matthias Christandl
, Jon Yard
32
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A Quasipolynomial-Time Algorithm for the Quantum Separability Problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Local Operation
100%
Classical Communication
100%
Quasi-polynomial Time Algorithms
100%
Separable States
66%
Density Matrix
66%
Euclidean Norm
66%
Prover
66%
Semidefinite Programming
33%
Improved Algorithm
33%
Communication Norms
33%
Quantum Conditional mutual Information
33%
Verification Method
33%
Mean Field
33%
Entanglement Measure
33%
Doherty
33%
Symmetric Extension
33%
New Lower Bound
33%
Two-party
33%
Squashed Entanglement
33%
Quantum Merlin-Arthur
33%
Quantum Analogue
33%
Membership Problem
33%
Ground State Energy
33%
Quantum State
33%
New Characterization
33%
Complexity Classes
33%
Verifier
33%
Communication Protocol
33%
Theory of Computing
33%
Mathematics
Density Matrix
100%
Quantum Analog
50%
Quantum State
50%
Probability Theory
50%
Ground State
50%
Mutual Information
50%
State Energy
50%
Exp
50%
De Finetti
50%
Conditionals
50%
Physics
Quantum Entanglement
100%
Ground State
100%
Computer Science
Euclidean Norm
100%
doherty
50%
Local Dimension
50%