Physics – Quantum Physics
Scientific paper
2000-08-11
Algorithmica, Volume 34, No. 4, pages 413-428 (2002)
Physics
Quantum Physics
18 pages, no figures, LaTeX2e, uses packages {amssymb,amsmath}; classical upper bounds added, presentation improved
Scientific paper
10.1007/s00453-002-0975-4
In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to device new quantum algorithms. We show how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is ignificantly lower than the classical one. It is pointed out that this scheme captures both Bernstein & Vazirani's inner-product protocol, as well as Grover's search algorithm. In the second part of the article we consider Paley's construction of Hadamard matrices, which relies on the properties of quadratic characters over finite fields. We design a query problem that uses the Legendre symbol chi (which indicates if an element of a finite field F_q is a quadratic residue or not). It is shown how for a shifted Legendre function f_s(i)=chi(i+s), the unknown s in F_q can be obtained exactly with only two quantum calls to f_s. This is in sharp contrast with the observation that any classical, probabilistic procedure requires more than log(q) + log((1-e)/2) queries to solve the same problem.
No associations
LandOfFree
Quantum Algorithms for Weighing Matrices and Quadratic Residues does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quantum Algorithms for Weighing Matrices and Quadratic Residues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Algorithms for Weighing Matrices and Quadratic Residues will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-417342