Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Block weighing matrices

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

We define a special type of weighing matrix called block weighing matrices. Motivated by questions arising in the context of optical quantum computing, we prove that infinite families of anticirculant block weighing matrices can be obtained from generic weighing matrices. The classification problem is left open.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Briegel, H.J., Raussendorf, R.: Persistent entanglement in arrays of interacting particles. Phys. Rev. Lett. 86, 910 (2001)

    Article  Google Scholar 

  2. Flammia, S.T., Severini, S.: Weighing matrices and optical quantum computing. J. Phys. A: Math. Theory 42, 065302 (2009)

    Article  MathSciNet  Google Scholar 

  3. Geramita, A.V., Seberry, J.: Orthogonal Designs: Quadratic Forms and Hadamard Matrices. Marcel Decker, New York-Basel (1979)

    MATH  Google Scholar 

  4. Menicucci, N.C., Flammia, S.T., Pfister, O.: One-way quantum computing in the optical frequency comb. Phys. Rev. Lett. 101, 130501 (2008)

    Article  Google Scholar 

  5. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  6. Raussendorf, R., Briegel, H.J.: A one-way quantum computer. Phys. Rev. Lett. 86, 5188 (2001)

    Article  Google Scholar 

Download references

Acknowledgements

The authors are very grateful to Steve Flammia for proposing the topic of this note. This work has been carried out in the context of Edmund’s undergraduate research project.

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Wright State University, Dayton, OH, 45435, USA

    K. T. Arasu & Edmund Velten

  2. Department of Physics and Astronomy, Department of Computer Science, University College London, Gower St., WC1E 6BT, London, UK

    Simone Severini

Authors
  1. K. T. Arasu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simone Severini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Edmund Velten
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. T. Arasu.

Additional information

K.T. Arasu’s research was partially supported by grants from the AFSOR and NSF.

E. Velten’s research was supported in part by NSF-REU grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arasu, K.T., Severini, S. & Velten, E. Block weighing matrices. Cryptogr. Commun. 5, 201–207 (2013). https://doi.org/10.1007/s12095-013-0083-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-013-0083-0

Keywords

Mathematics Subject Classifications (2010)

Search

Navigation