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… Expand
123 Citations
Cost of quantum entanglement simplified
  • 10
  • PDF
Geometric quantum discord under noisy environment
  • 24
Calculation of quantum discord in higher dimensions for X- and other specialized states
  • A. Rau
  • Mathematics, Physics
  • Quantum Inf. Process.
  • 2018
  • 8
  • PDF
Gaussian multipartite quantum discord from classical mutual information.
  • PDF
The Optimization Problem of Quantum Discord and Quantumness in Quantum Information Theory
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 91 REFERENCES
Quantum discord for two-qubit X states
  • 632
  • PDF
QUANTUM DISCORD AS A RESOURCE IN QUANTUM COMMUNICATION
  • 49
  • PDF
On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels
  • 66
  • PDF
Linking quantum discord to entanglement in a measurement.
  • 184
  • PDF
Faithful Squashed Entanglement
  • 120
  • PDF
Quantum discord and the power of one qubit.
  • 863
  • PDF
Distilling common randomness from bipartite quantum states
  • 61
  • PDF
“Squashed entanglement”: An additive entanglement measure
  • 277
  • Highly Influential
  • PDF
...
1
2
3
4
5
...