Sciweavers

2479 search results - page 24 / 496
» Quantum complexity theory
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 2 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
ICALP
2001
Springer
14 years 1 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
FOCS
2009
IEEE
14 years 3 months ago
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Daniel Gottesman, Sandy Irani
SLOGICA
2008
101views more  SLOGICA 2008»
13 years 8 months ago
A Dynamic-Logical Perspective on Quantum Behavior
In this paper we show how recent concepts from Dynamic Logic, and in particular from Dynamic Epistemic logic, can be used to model and interpret quantum behavior. Our main thesis ...
Alexandru Baltag, Sonja Smets
QCQC
1998
Springer
104views Communications» more  QCQC 1998»
14 years 1 months ago
Trapped Ion Quantum Computer Research at Los Alamos
Abstract. We briefly review the development and theory of an experiment to investigate quantum computation with trapped calcium ions. The ion trap, laser and ion requirements are d...
D. F. V. James, M. S. Gulley, M. H. Holzscheiter, ...