Skip to main content

Algebraic Characterizations of Unitary Linear Quantum Cellular Automata

  • Conference paper

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

Abstract

We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do not change the quantum cellular automata’s computational power. The configurations we consider have finite but unbounded size.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amoroso, S., Pratt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tesselations structures. J. Comp. Syst. Sci. 6, 448–464 (1972)

    Article  MATH  Google Scholar 

  2. Arrighi, P.: Algebraic characterizations of unitary linear quantum cellular automata, arXiv:quant-ph/0512040

    Google Scholar 

  3. Boykett, T.: Efficient exhaustive enumeration of reversible one dimensional cellular automata. Theoretical Computer Science (2004)

    Google Scholar 

  4. Dürr, C., LêThanh, H., Santha, M.: A decision procedure for well formed quantum cellular automata. Random Structures and Algorithms 11, 381–394 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dürr, C., Santha, M.: A decision procedure for unitary quantum linear cellular automata. SIAM J. of Computing 31(4), 1076–1089 (2002)

    Article  MATH  Google Scholar 

  6. Feynman, R.P.: Quantum mechanical computers. Found. Phys. 16, 507–531 (1986)

    Article  MathSciNet  Google Scholar 

  7. Hoyer, P.: Note on linear quantum cellular automata (manuscript)

    Google Scholar 

  8. Ibarra, O.H., Jiang, T.: On the computing power of one-way cellular arrays. In: ICALP, pp. 550–562 (1987)

    Google Scholar 

  9. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(183) (1961)

    Google Scholar 

  10. Meyer, D.A.: Unitarity in one dimensional nonlinear quantum cellular automata, arXiv:quant-ph/9604011

    Google Scholar 

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

    MATH  Google Scholar 

  12. Pedersen, J.: Cellular automata as algebraic systems. Complex Systems 6, 237–250 (1992)

    MATH  MathSciNet  Google Scholar 

  13. Schumacher, B., Werner, R.F.: Reversible quantum cellular automata, arXiv:quant-ph/0405174

    Google Scholar 

  14. Van Dam, W.: Quantum Cellular Automata, Master thesis, Department of Mathematics and Computer Science, University of Nijmegen, The Netherlands (1996)

    Google Scholar 

  15. Watrous, J.: On one dimensional quantum cellular automata. Complex Systems 5(1), 19–30 (1991)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arrighi, P. (2006). Algebraic Characterizations of Unitary Linear Quantum Cellular Automata. In: Královič, R., Urzyczyn, P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821069_11

Download citation

  • DOI: https://doi.org/10.1007/11821069_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37791-7

  • Online ISBN: 978-3-540-37793-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics