Quantum Query Complexity of Multilinear Identity Testing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Quantum Query Complexity of Multilinear Identity Testing

V. Arvind
  • Function : Author
  • PersonId : 857934
Partha Mukhopadhyay
  • Function : Author
  • PersonId : 857935


Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an additive generating set and a multilinear polynomial over t hat ring, also accessed as a black-box function (we allow the indeterminates of the polynomial to be commuting or noncommuting), we study the problem of testing if the polynomial is an identity for the given ring. We give a quantum algorithm with query complexity sub-linear in the number of generators for the ring, when the number of indeterminates of the input polynomial is small (ideally a constant). Towards a lower bound, we also show a reduction from a version of the collision problem (which is well studied in quantum computation) to a variant of this problem.
Fichier principal
Vignette du fichier
arvind_new.pdf (184.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00359727 , version 1 (10-02-2009)


  • HAL Id : inria-00359727 , version 1
  • ARXIV : 0807.1412


V. Arvind, Partha Mukhopadhyay. Quantum Query Complexity of Multilinear Identity Testing. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.87-98. ⟨inria-00359727⟩


30 View
127 Download



Gmail Facebook Twitter LinkedIn More