Quantum property testing

@inproceedings{Buhrman2003QuantumPT,
  title={Quantum property testing},
  author={Harry Buhrman and Lance Fortnow and Ilan Newman and Hein R{\"o}hrig},
  booktitle={SODA},
  year={2003}
}
A language <i>L</i> has a property tester if there exists a probabilistic algorithm that given an input <i>x</i> only asks a small number of bits of <i>x</i> and distinguishes the cases as to whether <i>x</i> is in <i>L</i> and <i>x</i> has large Hamming distance from all <i>y</i> in <i>L</i>. We define a similar notion of quantum property testing and show that there exist languages with quantum property testers but no good classical testers. We also show there exist languages which require a… CONTINUE READING

From This Paper

Topics from this paper.
31 Citations
2 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…