An Application of the Deutsch-Jozsa Algorithm to Formal Languages and the Word Problem in Groups

  • Michael Batty
  • Andrea Casaccino
  • Andrew J. Duncan
  • Sarah Rees
  • Simone Severini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5106)

Abstract

We adapt the Deutsch-Jozsa algorithm to the context of formal language theory. Specifically, we use the algorithm to distinguish between trivial and nontrivial words in groups given by finite presentations, under the promise that a word is of a certain type. This is done by extending the original algorithm to functions of arbitrary length binary output, with the introduction of a more general concept of parity. We provide examples in which properties of the algorithm allow to reduce the number of oracle queries with respect to the deterministic classical case. This has some consequences for the word problem in groups with a particular kind of presentation.

Keywords

Word Problem Free Product Binary String Auxiliary Input Hadamard Gate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lyndon, R.C., Schupp, P.E.: Combinatorial group theory. Classics in Mathematics. Springer, Heidelberg (2001) (reprint of the 1977 edition)Google Scholar
  2. 2.
    Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge University Press, Cambridge (2000)MATHGoogle Scholar
  3. 3.
    Deutsch, D., Jozsa, R.: Rapid Solution of Problems by Quantum Computation. Proc. R. Soc. of London A 439, 553–558 (1992)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Limit on the speed of quantum computation on determining parity. Phys. Rev. Lett. 81, 5552–5554 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Michael Batty
    • 1
  • Andrea Casaccino
    • 2
  • Andrew J. Duncan
    • 1
  • Sarah Rees
    • 1
  • Simone Severini
    • 3
  1. 1.Department of MathematicsUniversity of Newcastle upon TyneUnited Kingdom
  2. 2.Information Engineering DepartmentUniversity of SienaItaly
  3. 3.Institute for Quantum Computing and Department of Combinatorics and OptimizationUniversity of WaterlooCanada

Personalised recommendations