Computational complexity of the quantum separability problem.
Lawrence M. IoannouPublished in: Quantum Inf. Comput. (2007)
Keyphrases
- computational complexity
- np complete
- special case
- quantum computation
- quantum computing
- high computational complexity
- low complexity
- np hard
- computationally efficient
- decision problems
- dimensionality reduction
- worst case
- real time
- bit rate
- storage requirements
- particle swarm optimization
- probability ranking principle
- memory requirements
- motion estimation
- computational cost
- feature space
- genetic algorithm
- data sets