Sciweavers

4895 search results - page 30 / 979
» Functional Quantum Programming
Sort
View
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
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 9 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
ISMVL
2008
IEEE
148views Hardware» more  ISMVL 2008»
14 years 3 months ago
Quantum Logic Implementation of Unary Arithmetic Operations
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...
Mitchell A. Thornton, David W. Matula, Laura Spenn...
STACS
1999
Springer
14 years 1 months ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer
JCC
2007
90views more  JCC 2007»
13 years 8 months ago
Aromaticity in linear polyacenes: Generalized population analysis and molecular quantum similarity approach
Abstract: The relative aromaticity of benzenoid rings in the linear polyacenes is investigated using two novel aromaticity approaches. According to the first, the aromaticity of i...
Patrick Bultinck, Robert Ponec, Ramon Carbó...