On the impossibility of extracting classical randomness using a quantum computer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4052 LNCS, Issue , 2006, Pages 204-215

  Dodis, Yevgeniy ^a   Renner, Renato ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS; CRYPTOGRAPHY; ERROR ANALYSIS; MATHEMATICAL MODELS; PROBABILITY;

QUANTUM COMPUTERS; SANTHA- VAZIRANI SOURCES;

QUANTUM THEORY;

EID: 33746379606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_18     Document Type: Conference Paper

References (23)

1. [AL93] Miklós Ajtai and Nathal Linial. The influence of large coalitions. Combinatorica, 13(2):129-145, 1993.
2. [B1W04] Boaz Barak, Russell Impagliazzo, and Avi Wigderson. Extracting randomness from few independent sources. In Proc. 45th FOCS, 2004.
3. [Blu86] M. Blum. Independent unbiased coin flips from a correlated biased source-a finite state Markov chain. Combinatorica, 6(2):97-108, 1986.
4. [CG88] Benny Chor and Oded Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, 1988.
5. [CGH+85] Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, and Roman Smolensky, The bit extraction problem of t-resilient functions. In Proc. 26th FOCS, pages 396-407. IEEE, 1985.
6. [Dod01] Yevgeniy Dodis. New Imperfect Random Source with Applications to Coin-Flipping. In Proc. ICALP '01, pages 297-309, 2001.
7. [DEOR04] Yevgeniy Oodis, Ariel Elbaz, Roberto Oliveira, and Ran Raz. Improved randomness extraction from two independent sources. In Proc. RANDOM '04, 2004.
8. [DO03.] Yevgeniy Dodis and Roberto Oliveira. On extracting private randomness over a public channel. In Proc. RANDOM '03, pages 252-263, 2003.
9. [DOPS04] Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, and Amit Sahai. On the (im)possibility of cryptography with imperfect randomness. In Proc. FOCS '04, pages 196-205, 2004.
10. [DSS01] Yevgeniy Dodis, Amit Sahai, and Adam Smith. On perfect and adaptive security in exposure-resilient cryptography. In Proc. EUROCRYPT '01, pages 301-324, 2001.
11. [DS02] Yevgeniy Dodis and Joel Spencer. On the (non) Universality of the One-Time Pad. In Proc. FOCS '02, pages 376-385, 2002.
12. [Eli72] Peter Elias. The efficient construction of an unbiased random sequence. Ann. Math. Staf., 43(2):865-870, 1972.
13. [KZ03] Jess Kamp and David Zuckerman. Deterministic extractors for bit-fixing sources and exposure-resilient cryptography, In Proc. 35th FOCS, pages 92-101, 2003.
14. [LLS89] D. Lichtenstein, N. Linial, and M. Saks, Some extremal problems arising from discrete control processes. Combinatorica, 9(3):269-287, 1989.
15. [MP91] J. L. Mclnnes and B. Pinkas. On the impossibility of private key cryptography with weakly random keys. In Proc. CRYPTO '90, pages 421-436, 1991.
16. [NC00] M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge University Press, 2000.
17. [NZ96] Noam Nisan and David Zuckerman. Randomness is linear in space. J. Comput. Syst. Sci., 52(1):43-52, 1996.
18. [RVW04] Omer Reingold, Salil Vadhan, and Avi Wigderson. A note on extracting randomness from Santha-Vazirani sources. Unpublished manuscript, 2004.
19. [SV86] M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. J. Comput. Syst. Sci., 33(1):75-87, 1986.
20. [TV00] Luca Trevisan and Salil Vadhan. Extracting randomness from samplable distributions. In Proc. 4 Ist FOCS, pages 32-42, 2000.
21. [Vaz87b] Umesh V. Vazirani. Efficiency considerations in using semi-random sources. In Proc. 19th STOC, pages 160-168, 1987.
22. [VV85] Umesh V. Vazirani and Vijay V. Vazirani, Random polynomial time is equal to slightly-random polynomial time. In Proc. 26th FOCS, pages 417-428, 1985.
23. [Zuc96] David Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16(4/5):367-39l, 1996.