Sciweavers

1142 search results - page 36 / 229
» Is the Brain a Quantum Computer
Sort
View
STACS
2005
Springer
14 years 3 months ago
Robust Polynomials and Quantum Algorithms
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
Harry Buhrman, Ilan Newman, Hein Röhrig, Rona...
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
14 years 10 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma
TLCA
2005
Springer
14 years 3 months ago
A Lambda Calculus for Quantum Computation with Classical Control
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Peter Selinger, Benoît Valiron
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 10 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer
COCOON
2006
Springer
14 years 1 months ago
The Complexity of Black-Box Ring Problems
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay