Skip to main content
SpringerLink
Log in

The Independence of Reduced Subgroup-State

  • Published:
International Journal of Theoretical Physics Aims and scope Submit manuscript

Abstract

Quantum hidden problem being one of the most important quantum computation problems has been widely investigated. Our purpose in this paper is to prove the independent or partial independent of the reduced state derived from the quantum query with the oracle implementation. We prove that if without bias on implementation functions the subgroup state is independent of evaluation functions using the group representation. This result is also used to improve the quantum query success probability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Nielsen, M., Chuang, I.: Quantum computation and quantum information. Cambridge University Press (2000)

  2. Shor, P., Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings, 35th Annual Symposium on Fundamentals of. Comp. Sci. (FOCS), 124–134 (1994)

  3. Deutsch, D.: Quantum, theory the church-turing principle and the universal quantum computer. In: Proc. Roy. Soc. Lond. A 400, 97–117 (1985)

    ADS  MATH  MathSciNet  Google Scholar 

  4. Simon, D.: On the power of quantum computation. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (Los Alamitos, CA). Institute of Electrical and Electronic Engineers. Comput. Soc. Press, 116–123 (1994)

  5. Kitaev, A.: Quantum measurements and the Abelian stabilizer problem. Electronic Colloquium on Computational Complexity (ECCC), 3 (1996)

  6. Moore, C., Russell, A., Sniady, P.: On the impossibility of a quantum sieve algorithm for graph isomorphism. SIAM J. Comput 39(6), 2377–2396 (2010)

    MATH  MathSciNet  Google Scholar 

  7. Regev, O.: Quantum computation and lattice problems. SIAM J. Comput 33, 738–760 (2004)

    MATH  MathSciNet  Google Scholar 

  8. Holevo, A.: Statistical decision theory for quantum systems. J. Multivar. Anal 3, 337–394 (1973)

    MATH  MathSciNet  Google Scholar 

  9. Yuen, H., Kennedy, R., Lax, M.: Optimum testing of multiple hypotheses in quantum detection theory. IEEE Trans. Infor. Theory 21(2), 125–134 (1975)

    MATH  MathSciNet  Google Scholar 

  10. Kawachi, A., Koshiba, T., Nishimura, H., Yamakami, T.: Computational indistinguishability between quantum states and its cryptographic application. J. Cryptol 25, 528–555 (2012)

    MATH  MathSciNet  Google Scholar 

  11. Radhakrishnan, J., Rotteler, M., Sen, P.: Random measurement bases, quantum state distinction and applications to the hidden subgroup problem. Algorithmica 55, 490–516 (2009)

    MATH  MathSciNet  Google Scholar 

  12. Mosca, M., Eckert, A.: The hidden subgroup problem and eigenvalue estimation on a quantum computer. Quantum Comput. Quantum Commu. 1509, 174–188 (1999)

    Google Scholar 

  13. Ettinger, M., Høer, P.: On quantum algorithms for noncommutative hidden subgroups. Adv. Appl. Math 25, 239–251 (2000)

    MATH  Google Scholar 

  14. Kuperberg, G.: A subexponential-time algorithm for the dihedral hidden subgroup problem. SIAM J. Comput 35, 170–188 (2005)

    MATH  MathSciNet  Google Scholar 

  15. Regev, O.: Quantum computation and lattice problems. In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS) (2002)

  16. Chia, D.P., Kima, J.S., Leeb, S.: Quantum algorithms for the hidden subgroup problem on some semi-direct product groups. Phys. Lett. A 359, 114–116 (2006)

    ADS  Google Scholar 

  17. de Souza, D.G. G., Portugal, R., Gonclves, D.N.: Sieve algorithm for the hidden subgroup problem on Semidirect Product Groups. IV Workshop-schoolon Quantum Comput. Inf. (WECIQ), 152 (2012)

  18. Ivanyos, G.: Finding hidden Borel subgroups of the general linear group. Quantum. Infor. & Comput 12, 661–669 (2012)

    MATH  MathSciNet  Google Scholar 

  19. Goncalves, D.N., Portugal, R., Cosme, C.M.M.: Solutions to the hidden subgroup problem on some Metacyclic Groups, Theory of Quantum Computation. Commun. Cryp. LNCS 5906, 1–9 (2009)

    MathSciNet  Google Scholar 

  20. Bacon, D., Childs, A., Van Dam, V.: From optimal measurements to efficient quantum algorithms for the hidden subgroup problem over semidirect product groupsIn: 46th Annual IEEE Symposium on Foundations of Computer, pp 469–478 (2005)

  21. Bacon, D., Decker, T.: The optimal single copy measurement for the hidden subgroup problem. Phys. Rev. A 77, 032335 (2008)

    ADS  Google Scholar 

  22. Krovi, H., Röteller, M.: An efficient quantum algorithm for the hidden subgroup problem over Weyl-Heisenberg groups. LNCS 5393, 70–88 (2008)

    Google Scholar 

  23. Hayashi, M., Kawachi, A., Kobayashi, H.: Quantum measurements for hidden subgroup problems with optimal sample complexity. Quantum Inform. Comput 8, 345–358 (2008)

    MATH  MathSciNet  Google Scholar 

  24. Hausladenab, P., Woottersb, W.K.: A ‘Pretty Good’ measurement for distinguishing quantum states. J. Modern Optics 41, 2385–2390 (1994)

    ADS  Google Scholar 

  25. Bacon, D., Childs, A.M., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groupsFoundations of Computer Science, FOCS 2005, pp 469–478 (2005)

  26. Hallgren, S., Russell, A., Ta-shma, A.: Normal subgroup reconstruction and quantum computation using group representations. In: Proc. 32nd ACM Symp. on Theory of Computing, 627–635 (2000)

  27. C. Moore, D. Rockmore, A. Russell, L. Schulman: The power of strong fourier sampling: quantum Algorithms for affine groups and hidden shifts. SIAM J. Comput 37, 938–958 (2007)

    MathSciNet  Google Scholar 

  28. Goodman, R., Wallach, N.: Symmetry, representations and invariants, graduate texts in mathematics, vol. 255. Springer (2009)

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Nos.61303039) and the Fundamental Research Funds for the Central Universities (No.SWJTU11BR174).

Author information

Authors and Affiliations

  1. Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu, 610031, China

    Ming-Xing Luo

  2. State Key Laboratory of Information Security (Institute of Information Engineering, Chinese Academy of Sciences), Beijing, 100093, China

    Ming-Xing Luo

  3. Institute of Computer Science, Sichuan University of Science Engineering, Zigong, 64300, China

    Yun Deng

Authors
  1. Ming-Xing Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yun Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ming-Xing Luo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luo, MX., Deng, Y. The Independence of Reduced Subgroup-State. Int J Theor Phys 53, 3124–3134 (2014). https://doi.org/10.1007/s10773-014-2109-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10773-014-2109-6

Keywords

Search

Navigation