Detecting mixed-unitary quantum channels is NP-hard.
Colin Do-Yan LeeJohn WatrousPublished in: CoRR (2019)
Keyphrases
- np hard
- optimal solution
- approximation algorithms
- scheduling problem
- np hardness
- special case
- np complete
- automatic detection
- closely related
- minimum cost
- integer programming
- decision problems
- linear programming
- worst case
- branch and bound algorithm
- lower bound
- computational complexity
- real world
- constraint satisfaction problems
- multi channel
- computationally challenging
- mimo systems
- quantum inspired