Sciweavers

20831 search results - page 50 / 4167
» Quantum Computation and Information
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 1 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
DCC
2008
IEEE
14 years 8 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 8 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
CORR
2004
Springer
97views Education» more  CORR 2004»
13 years 8 months ago
Quantum typing
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
Benoît Valiron