Quantum Pattern Matching Fast on Average
暂无分享,去创建一个
[1] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[2] David A. Meyer,et al. Towards quantum template matching , 2004, SPIE Optics + Photonics.
[3] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.
[4] Andrew M. Childs,et al. Quantum algorithm for a generalized hidden shift problem , 2005, SODA '07.
[5] Sean Hallgren,et al. Quantum algorithms for some hidden shift problems , 2003, SODA '03.
[6] Uzi Vishkin,et al. Deterministic sampling—a new technique for fast pattern matching , 1990, STOC '90.
[7] Ramesh Hariharan,et al. String matching in Õ(sqrt(n)+sqrt(m)) quantum time , 2003, J. Discrete Algorithms.
[8] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..
[9] Greg Kuperberg,et al. Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem , 2011, TQC.
[10] Martin Rötteler,et al. Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm , 2009, MFCS.
[11] O. Regev. A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space , 2004, quant-ph/0406151.
[12] Maxime Crochemore,et al. Algorithms on strings , 2007 .
[13] Martin Rötteler,et al. Quantum algorithms for highly non-linear Boolean functions , 2008, SODA '10.
[14] Martin Rötteler,et al. Quantum algorithm for the Boolean hidden shift problem , 2011, COCOON.
[15] Eugene L. Lawler,et al. Sublinear approximate string matching and biological applications , 1994, Algorithmica.
[16] Maris Ozols,et al. Easy and hard functions for the Boolean hidden shift problem , 2013, TQC.
[17] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[18] Alexander Russell,et al. The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts , 2007, SIAM J. Comput..
[19] Frédéric Magniez,et al. Hidden translation and orbit coset in quantum computing , 2002, STOC '03.
[20] Gonzalo Navarro,et al. A guided tour to approximate string matching , 2001, CSUR.
[21] NavarroGonzalo. A guided tour to approximate string matching , 2001 .
[22] J. Twamley. A hidden shift quantum algorithm , 2000 .
[23] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.
[24] Alexandr Andoni,et al. Shift Finding in Sub-Linear Time , 2013, SODA.
[25] Andris Ambainis,et al. Quantum lower bounds by quantum arguments , 2000, STOC '00.
[26] Juha Kärkkäinen,et al. Two and higher dimensional pattern matching in optimal expected time , 1994, SODA '94.
[27] Ronitt Rubinfeld,et al. A sublinear algorithm for weakly approximating edit distance , 2003, STOC '03.
[28] M. Crochemore,et al. Algorithms on Strings: Tools , 2007 .
[29] L. Fortnow,et al. Quantum property testing , 2002, SODA '03.
[30] Maris Ozols,et al. Quantum rejection sampling , 2011, ITCS '12.
[31] Ronald de Wolf,et al. A Survey of Quantum Property Testing , 2013, Theory Comput..
[32] Greg Kuperberg. A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem , 2005, SIAM J. Comput..
[33] Mirmojtaba Gharibi,et al. Reduction from non-injective hidden shift problem to injective hidden shift problem , 2012, Quantum Inf. Comput..
[34] Emanuel Knill,et al. The quantum query complexity of the hidden subgroup problem is polynomial , 2004, Inf. Process. Lett..
[35] Seth Lloyd,et al. Quantum random access memory. , 2007, Physical review letters.
[36] Andrew Chi-Chih Yao,et al. The Complexity of Pattern Matching for a Random String , 1977, SIAM J. Comput..
[37] Ronald de Wolf,et al. Quantum Search on Bounded-Error Inputs , 2003, ICALP.