Author:
Radhakrishnan Jaikumar,Rötteler Martin,Sen Pranab
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Alon, N., Spencer, J.: The probabilistic method. John Wiley and Sons, Chichester (2000)
2. Bacon, D., Childs, A., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. ArXiv preprint quant–ph/0504083 (2005)
3. Curtis, W.C., Reiner, I.: Representation Theory of Finite Groups and Algebras. Wiley and Sons, Chichester (1962)
4. Ettinger, M., Høyer, P., Knill, E.: The quantum query complexity of the hidden subgroup problem is polynomial. Information Processing Letters 91(1), 43–48 (2004); See also ArXiv preprint quant–ph/0401083
5. Emerson, J.: Random quantum circuits and pseudo-random operators: theory and applications. ArXiv preprint quant–ph/0410087 (2004)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献