Deciding whether a Quantum Channel is Markovian is NP-hard
Toby S. CubittJens EisertMichael M. WolfPublished in: CoRR (2009)
Keyphrases
- np hard
- channel capacity
- optimal solution
- scheduling problem
- np complete
- approximation algorithms
- remains np hard
- np hardness
- multi channel
- lower bound
- special case
- quantum computing
- worst case
- integer programming
- multiple access
- channel coding
- closely related
- branch and bound algorithm
- greedy heuristic
- decision problems
- quantum computation
- knapsack problem
- quantum inspired
- minimum cost
- quantum mechanics
- antenna array
- video transmission
- set cover
- constraint satisfaction problems
- markov chain
- cellular networks
- computational complexity
- communication channels
- error correction
- noisy channel
- hidden markov models
- probability ranking principle
- neural network