Skip to main content

Periodicity in Quantum Cellular Automata

  • Conference paper
Cellular Automata (ACRI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7495))

Included in the following conference series:

  • 2751 Accesses

Abstract

Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures are based on the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical systems and processes. It is however known that except for the trivial case, unitary evolution of one-dimensional homogeneous quantum cellular automata with one quantum bit (qubit) per cell is not possible because of the no-go lemma. In this paper, we define quantum cellular automata that comprise two qubits per cell and study their evolution using a quantum computer simulator. The evolution is unitary and its linearity manifests itself as a periodic structure in the probability distribution patterns.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. von Neumann, J.: Theory of Self-Reproducing Automata. University of Illinois Press, Urbana IL (1966)

    Google Scholar 

  2. Karafyllidis, I., Thanailakis, A.: Ecological Modeling 99, 87 (1997)

    Google Scholar 

  3. Karafyllidis, I., Hagouel, P.I., Thanailakis, A., Neureuther, A.R.: IEEE Transactions on Semiconductor Manufacturing 13, 61 (2000)

    Google Scholar 

  4. Karafyllidis, I.: Biosystems 45, 1 (1998)

    Google Scholar 

  5. Bettelli, S., Serafini, L., Calarco, T.: arXiv:cs/0103009v3

    Google Scholar 

  6. De Raedt, H., Hams, A., Michielsen, K., Miyashita, S., Saito, K.: arXiv:quant-ph/0008015v2

    Google Scholar 

  7. Feynman, R.P.: International Journal of Physics 21, 467 (1982)

    Article  MathSciNet  Google Scholar 

  8. Ferguson, A.J., Cain, P.A., Williams, D.A., Briggs, A.D.: Physical Review A 65, 034303-1 (2002)

    Google Scholar 

  9. Twamley, J.: Physical Review A 67, 052318-1 (2003)

    Google Scholar 

  10. Grössing, G., Zeilinger, A.: Complex Systems 2, 197 (1988)

    MathSciNet  MATH  Google Scholar 

  11. Meyer, D.A.: Physical Review E 55, 5261 (1997)

    Google Scholar 

  12. Karafyllidis, I.: Physics Letters A 320, 35–38 (2003)

    Google Scholar 

  13. Karafyllidis, I.: Physical Review A 70, 044301 (2004)

    Google Scholar 

  14. Karafyllidis, I.: IEEE Transactions on Circuits and Systems I 52, 1590-1596 (2005)

    Google Scholar 

  15. Karafyllidis, I.: Quantum Information Processing 2, 271 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsormpatzoglou, G.I., Karafyllidis, I.G. (2012). Periodicity in Quantum Cellular Automata. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics