Computing quantum discord is NP-complete
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is beli...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
IOP Publishing
2014-01-01
|
| Edice: | New Journal of Physics |
| Témata: | |
| On-line přístup: | https://doi.org/10.1088/1367-2630/16/3/033027 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|