A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace.
Wenliang JinXiangdong ChenPublished in: Quantum Inf. Process. (2011)
Keyphrases
- three dimensional
- experimental evaluation
- k means
- learning algorithm
- improved algorithm
- detection algorithm
- segmentation algorithm
- high accuracy
- computational complexity
- computationally intensive
- significant improvement
- optimal solution
- worst case
- convergence rate
- computationally efficient
- state variables
- principal components
- clustering method
- image segmentation
- theoretical analysis
- preprocessing
- particle swarm optimization
- simulated annealing
- similarity measure
- computational cost
- dynamic programming
- face recognition
- input data
- tree structure
- times faster
- recognition algorithm
- data sets
- high dimensional