Sciweavers

1352 search results - page 186 / 271
» Fault-Tolerant Quantum Computation
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madr...
EUROCRYPT
2011
Springer
12 years 11 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
DCC
2008
IEEE
14 years 7 months ago
From graph states to two-graph states
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
Constanza Riera, Stéphane Jacob, Matthew G. Parke...
CORR
1998
Springer
106views Education» more  CORR 1998»
13 years 7 months ago
Lower Bounds for Quantum Search and Derandomization
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
Harry Buhrman, Ronald de Wolf
CPHYSICS
2006
46views more  CPHYSICS 2006»
13 years 8 months ago
A second-order finite volume scheme for three dimensional truncated pyramidal quantum dot
Three dimensional truncated pyramidal quantum dots are simulated numerically to compute the energy states and the wave functions. The simulation of the heterostructures is realize...
Weichung Wang, Tsung-Min Hwang, Jia-Chuan Jang