Skip to main content
Log in

Construction of a class of quantum Boolean functions based on the Hadamard matrix

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

In this study, a new methodology based on the Hadamard matrix is proposed to construct quantum Boolean functions f such that \(f = {I_{{2^n}}} - 2{P_{{2^n}}}\), where \({I_{{2^n}}}\) is an identity matrix of order 2n and \({P_{{2^n}}}\) is a projective matrix with the same order as \({I_{{2^n}}}\). The enumeration of this class of quantum Boolean functions is also presented.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ashley, Montanaro, Tobias J.O. Quantum Boolean functions. Chicago Journal of Theoretical Computer Science, 2010: 1–45(2010), DOI: 10.4086/cjtcs.2010.001, http://cjtcs.cs.uchicago.edu

  2. Cusick, T.W., Stanica, P. Cryptographic Boolean Functions and Applications, the First Edition. Academic Press, San Diego, 2009

    Google Scholar 

  3. MacWilliams, F.J., Sloane, N.J.A. The theory of Error-Correcting Codes. North-Holland, Amsterdam, New York, Oxford, 1978

    Google Scholar 

  4. Menezes, A.J., Oorschot, P.C., Vanstone, S.A. Handbook of applied cryptography, CRC Press, Boca Raton, Florida, 1996

    Book  Google Scholar 

  5. Michael A. N., Chuang, I.L. Quantum computation and quantum information. Cambridge University Press, Cambridge, 2000. MR,1, 796–805

    MATH  Google Scholar 

  6. Pang, S.Q., Zhang, Y.S., Liu, S.Y. Further results on the orthogonal arrays obtained by generalized Hadamard product. Statistics Probability Letters, 68: 17–25 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Reichardt, B.W. Span programs and quantum query complexity: The general adversary bound is nearly tight for every Boolean function. proceedings of 50th Annual IEEE Symposium on Foundations of Computer Science: 544–551, 2009

    Google Scholar 

  8. Wen Q.Y., Niu, X.X., Yang, Y.X. The Boolean Functions in Modern cryptology. Science Press, Beijing, 2000 (in Chinese)

    Google Scholar 

  9. Zhang J., Wen, Q.Y. Construction of quantum Boolean functions. The 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010, Chengdu, China: 1–3

  10. Zhang, X.D. Matrix analysis and applications, the First Edition. Tsinghua University Press, Beijing, 2004 (in Chinese)

    Google Scholar 

  11. Zhang, Y.S., Li, W.G., Mao, S.S., Zheng, Z.G. A simple method for constructing orthogonal arrays by the kronecker sum. Journal of System Science and Complexity, 19: 266–273 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiao Du.

Additional information

Supported by the National Natural Science Foundation of China (Nos. 11171093, U1404601, 11471104, 61402154, 61170270, 11501181, 11571094, 61572081); Program for Innovative Research Team (in Science and Technology) in University of Henan Province (No.14IRTSTHN023), Ph.D research startup foundation of Henan Normal University (Grant No. 5101019170133). The basic and Cutting-edge Technology Research projects of Science and Technology Department of Henan Province(No.132300410430).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Du, J., Pang, Sq., Wen, Qy. et al. Construction of a class of quantum Boolean functions based on the Hadamard matrix. Acta Math. Appl. Sin. Engl. Ser. 31, 1013–1020 (2015). https://doi.org/10.1007/s10255-015-0523-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-015-0523-z

Keywords

2000 MR Subject Classification

Navigation