Sciweavers

1391 search results - page 3 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ENTCS
2007
108views more  ENTCS 2007»
14 years 9 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
ICALP
2005
Springer
15 years 3 months ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
14 years 9 months ago
A Decision Procedure for Unitary Linear Quantum Cellular Automata
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
Christoph Dürr, Miklos Santha
BIOSYSTEMS
2007
95views more  BIOSYSTEMS 2007»
14 years 9 months ago
Physical limits of computation and emergence of life
The computational process is based on the activity linking mathematical equations to a materialized physical world. It consumes energy which lower limit is defined by the set of ...
Abir U. Igamberdiev
75
Voted
DAGSTUHL
2006
14 years 11 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum