Computational complexity of quantum correlation: quantum discord is NP-complete
Yichen HuangPublished in: CoRR (2013)
Keyphrases
- np complete
- computational complexity
- np hard
- quantum computation
- quantum inspired
- satisfiability problem
- randomly generated
- quantum computing
- quantum mechanics
- constraint satisfaction problems
- conjunctive queries
- channel capacity
- low complexity
- bounded treewidth
- computational cost
- polynomial time complexity
- database
- probability ranking principle
- conp complete
- logic circuits
- pspace complete
- phase transition
- special case
- artificial intelligence