with cryptographic applications Mark Adcock Richard Cleve Department of...  Home/Search
Context
Related
| pages.cpsc.ucalgar...reich_levin_qph.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pages.cpsc.ucalgary.ca/~cleve/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the Goldreich-Levin Theorem in the context of quantum information. This result is a reduction from the computational problem of inverting a one-way function to the problem of predicting a particular bit associated with that function. We show that the quantum version of the reduction|between quantum one-way functions and quantum hard-predicates|is quantitatively more ecient than the known classical version. Roughly speaking, if the one-way function acts on n-bit strings then... (Update)
Similar documents (at the sentence level):
5.1%: A Quantum Goldreich-Levin Theorem with Cryptographic Applications - Adcock, Cleve (2001) (Correct)
Active bibliography (related documents): More All
0.3: Multi-party Quantum Computation - Smith (2001) (Correct)
0.2: Quantum Algorithms for Element Distinctness - Buhrman, Dürr, Heiligman.. (2000) (Correct)
0.2: Quantum and Classical Strong Direct Product Theorems and.. - Klauck, Spalek, de Wolf (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ applications-quantum,
author = "With Cryptographic Applications",
title = "A quantum Goldreich-Levin theorem",
url = "citeseer.ist.psu.edu/763457.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
2319 Elements of Information Theory (context) - Cover, Thomas - 1991
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
210 A fast quantum mechanical algorithm for database search - Grover - 1996
173 Quantum complexity theory - Bernstein, Vazirani - 1997
164 Polynomial-time algorithms for prime factorization and discr.. - Shor - 1997
60 Hard-core predicates for any one-way function (context) - Goldreich, Levin - 1989
58 Lower bounds by probabilistic arguments (context) - Yao - 1983
46 An exact quantum polynomial-time algorithm for Simon's probl.. - Brassard, yer - 1997
43 Probabilistic Proofs and Pseudo-Randomness (context) - Goldreich, Cryptography - 1999
36 Quantum entanglement and the communication complexity of the.. - Cleve, van Dam et al. - 1999
17 Is quantum bit commitment really possible - Lo, Chau - 1997
14 Perfectly concealing quantum bit commitment from any one-way.. - Dumais, Mayers et al. - 2000
7 Single quantum querying of a database (context) - Terhal, Smolin - 1998
7 One way functions in reversible computations (context) - Chau, Lo - 1997
5 Quantum amplitude ampli cation and estimation (context) - Brassard, yer et al. - 2000
4 How to convert the avor of a quantum bit commitment (context) - Cr, egar et al. - 2001
3 on Foundations of Computer Science (context) - Ambainis, Mosca et al. - 2000
3 The Goldreich-Levin Theorem (context) - Bellare - 1999
3 Unconditionally secure bit commitment is impossible (context) - Mayers - 1997
Documents on the same site (http://pages.cpsc.ucalgary.ca/~cleve/pubs/): More
The query complexity of order-finding - Richard Cleve Department (Correct)
quant-ph/9802049 - Sep Quantum Lower (Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC