Sciweavers

515 search results - page 11 / 103
» Classically-controlled Quantum Computation
Sort
View
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 3 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ENGL
2008
170views more  ENGL 2008»
13 years 9 months ago
Design of Reversible/Quantum Ternary Comparator Circuits
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since the multiple-valued quantum system is more compact than the corresponding bina...
Mozammel H. A. Khan
MSCS
2007
71views more  MSCS 2007»
13 years 9 months ago
Discrete-continuous and classical-quantum
A discussion concerning the opposition between discretness and continuum in quantum mechanics is presented. In particular this duality is shown to be present not only in the early...
Thierry Paul
EUROCRYPT
2011
Springer
13 years 1 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
MICRO
2005
IEEE
117views Hardware» more  MICRO 2005»
14 years 3 months ago
A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
Recent experimental advances have demonstrated technologies capable of supporting scalable quantum computation. A critical next step is how to put those technologies together into...
Tzvetan S. Metodi, Darshan D. Thaker, Andrew W. Cr...