Detecting mixed-unitary quantum channels is NP-hard.
Colin Do-Yan LeeJohn WatrousPublished in: Quantum (2020)
Keyphrases
- np hard
- scheduling problem
- computational complexity
- linear programming
- np complete
- integer programming
- neural network
- machine learning
- minimum cost
- automatic detection
- branch and bound algorithm
- decision problems
- quantum computation
- np hardness
- communication channels
- approximation algorithms
- worst case
- lower bound
- database
- multi channel
- artificial neural networks
- quantum mechanics
- series expansion
- genetic algorithm
- remains np hard