Computing quantum discord is NP-complete

Y. Huang

DOI:10.1088/1367-2630/16/3/033027

Corpus ID: 118556793

Computing quantum discord is NP-complete

@article{Huang2014ComputingQD,
  title={Computing quantum discord is NP-complete},
  author={Y. Huang},
  journal={New Journal of Physics},
  year={2014},
  volume={16},
  pages={033027}
}

Y. Huang

Published 2014

Physics, Computer Science

New Journal of Physics

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 believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some… CONTINUE READING

View PDF on ArXiv