Multi-query Quantum Sums

@inproceedings{Meyer2011MultiqueryQS,
  title={Multi-query Quantum Sums},
  author={David A. Meyer and James Pommersheim},
  booktitle={TQC},
  year={2011}
}
PARITY is the problem of determining the parity of a string f of n bits given access to an oracle that responds to a query x ∈ {0, 1, . . . , n − 1} with the x bit of the string, f(x). Classically, n queries are required to succeed with probability greater than 1/2 (assuming equal prior probabilities for all length n bitstrings), but only ⌈n/2⌉ quantum queries suffice to determine the parity with probability 1. We consider a generalization to strings f of n elements of Zk and the problem of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Optimal Success Bounds for Single

Alexander Valtchev
2015
View 9 Excerpts
Highly Influenced

An improved query for the hidden subbroup problem

Quantum Information & Computation • 2014
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Similar Papers

Loading similar papers…