515 search results - page 33 / 103 » Classically-controlled Quantum Computation |
IACR
2011
12 years 9 months ago
2011
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
PROCEDIA
2010
13 years 8 months ago
2010
Modern physical theory and modern computational techniques are used to provide conjecture on how nature computes. I utilize time-domain simulation of physical phenomena and build ...
CPHYSICS
2006
13 years 9 months ago
2006
Studies on the entanglement of n-qubit quantum systems have attracted a lot of interest during recent years. Despite the central role of entanglement in quantum information theory...
IACR
2011
12 years 9 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...