参考文献/References:
[1] Beckmann B, Kriegel H P, Schneider R, et al. The R*-tree: an efficient and robust access method[C]//9th ACM SIGMOD International Conference on Management of Data. Atlantic City, NY,USA, 1990: 322-331.
[2] White D A, Jain R. Similarity indexing with the SS-tree[C]//Proceedings of the Twelfth International Conference on Data Engineering. New Orleans, LA, USA, 1996: 516-523.
[3] Katayama N, Satoh S. The SR-tree: an index structure for high-dimensional nearest neighbor queries[J]. SIGMOD Record, 1997, 26(2): 369-380.
[4] Goodsell G. On finding p-th nearest neighbours of scattered points in two dimensions for small p[J]. Computer Aided Geometric Design, 2000, 17(4): 387-392.
[5] Piegl L A, Tiller W. Algorithm for finding all k nearest neighbors[J]. Computer-Aided Design, 2002, 34(2): 167-172.
[6] Han K H, Kim J H. Genetic quantum algorithm and its application to combinatorial optimization problem[C]//Proceedings of the 2000 Congress on Evolutionary Computation. San Diego, CA, USA, 2000, 2: 1354-1360.
[7] Lloyd S, Mohseni M, Rebentrost P. Quantum principal component analysis[J]. Nature Physics, 2014, 10(9): 631-633.
[8] Lloyd S, Mohseni M, Rebentrost P. Quantum algorithms for supervised and unsupervised machine learning[J/OL]. Eprint arXiv, 2013.http://arxiv.org/pdf/1307.0411v2.pdf.
[9] Aïmeur E, Brassard G, Gambs S. Quantum speed-up for unsupervised learning[J]. Machine Learning, 2013, 90(2): 261-287.
[10] Wiebe N, Kapoor A, Svore K. Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning[J/OL]. Eprint arXiv, 2014.http://arxiv.org/pdf/1401.2142v2.pdf.
[11] Bennett C H. Logical reversibility of computation[J]. IBM Journal of Research and Development, 1973, 17(6): 525-532.
[12] Buhrman H, Cleve R, Watrous J, et al. Quantum fingerprinting[J]. Physical Review Letters, 2001, 87(16): 167902-01-167902-04.
[13] Brassard G, Høyer P, Mosca M, et al. Quantum amplitude amplification and estimation[J]. Quantum Computation & Information, 2000:53-74.
[14] Dürr C, Heiligman M, Høyer P, et al. Quantum query complexity of some graph problems[M]//Automata, Languages and Programming. Berlin: Springer, 2004: 481-493.
[15] Dürr C, Høyer P. A quantum algorithm for finding the minimum[J/OL]. LANL e-print, 1996.http://arxiv.org/pdf/quant-ph/9607014.pdf.
[16] Boyer M, Brassard G, Høyer P, et al. Tight bounds on quantum searching[J/OL]. arXiv Preprint, 1996.http://arxiv.org/pdf/quant-ph/9605034v1.pdf.
[17] Arya S, Mount D M, Netanyahu N S, et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions[J]. Journal of the ACM, 1998, 45(6): 891-923.
[18] 李强,蒋静坪.量子K最近邻算法[J].系统工程与电子技术,2008,30(5):940-943.
Li Qiang, Jiang Jingping. Quantum k nearest neighbor algorithm[J]. Systems Engineering and Electronics, 2008, 30(5): 940-943.(in Chinese)