On the Impossibility of Extracting Classical Randomness Using a Quantum Computer

@inproceedings{Dodis2006OnTI,
  title={On the Impossibility of Extracting Classical Randomness Using a Quantum Computer},
  author={Yevgeniy Dodis and Renato Renner},
  booktitle={ICALP},
  year={2006}
}
  • Yevgeniy Dodis, Renato Renner
  • Published in ICALP 2006
  • Mathematics, Computer Science, Physics
  • In this work we initiate the question of whether quantum computers can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it was observed [SV86, MP91, DOPS04] that classical computers are insufficient for either one of these tasks when all they have access to is a realistic imperfect source of randomness, such as the Santha-Vazirani source We answer this question in the negative, even in… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 27 REFERENCES

    On the (im)possibility of cryptography with imperfect randomness

    On the (non)universality of the one-time pad

    Extracting randomness using few independent sources

    Random polynomial time is equal to slightly-random polynomial time