16,523 research outputs found
Learning with Errors is easy with quantum samples
Learning with Errors is one of the fundamental problems in computational
learning theory and has in the last years become the cornerstone of
post-quantum cryptography. In this work, we study the quantum sample complexity
of Learning with Errors and show that there exists an efficient quantum
learning algorithm (with polynomial sample and time complexity) for the
Learning with Errors problem where the error distribution is the one used in
cryptography. While our quantum learning algorithm does not break the LWE-based
encryption schemes proposed in the cryptography literature, it does have some
interesting implications for cryptography: first, when building an LWE-based
scheme, one needs to be careful about the access to the public-key generation
algorithm that is given to the adversary; second, our algorithm shows a
possible way for attacking LWE-based encryption by using classical samples to
approximate the quantum sample state, since then using our quantum learning
algorithm would solve LWE
Quantum Associative Memory
This paper combines quantum computation with classical neural network theory
to produce a quantum computational learning algorithm. Quantum computation uses
microscopic quantum level effects to perform computational tasks and has
produced results that in some cases are exponentially faster than their
classical counterparts. The unique characteristics of quantum theory may also
be used to create a quantum associative memory with a capacity exponential in
the number of neurons. This paper combines two quantum computational algorithms
to produce such a quantum associative memory. The result is an exponential
increase in the capacity of the memory when compared to traditional associative
memories such as the Hopfield network. The paper covers necessary high-level
quantum mechanical and quantum computational ideas and introduces a quantum
associative memory. Theoretical analysis proves the utility of the memory, and
it is noted that a small version should be physically realizable in the near
future
- …