Sciweavers

50 search results - page 4 / 10
» Classical Simulation Complexity of Quantum Branching Program...
Sort
View
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
14 years 7 months ago
Interaction in quantum communication and the complexity of set disjointness
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David...
TEC
2008
135views more  TEC 2008»
13 years 7 months ago
Quantum Genetic Optimization
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
Andrea Malossini, Enrico Blanzieri, T. Calarco
CSR
2009
Springer
14 years 1 months ago
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
Maurice J. Jansen, B. V. Raghavendra Rao
ICALP
2001
Springer
13 years 11 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
CASES
2006
ACM
13 years 10 months ago
Power efficient branch prediction through early identification of branch addresses
Ever increasing performance requirements have elevated deeply pipelined architectures to a standard even in the embedded processor domain, requiring the incorporation of dynamic b...
Chengmo Yang, Alex Orailoglu