Sciweavers

342 search results - page 27 / 69
» Quantum Algorithms
Sort
View
WDAG
1998
Springer
87views Algorithms» more  WDAG 1998»
14 years 26 days ago
Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems
d Abstract) James H. Anderson, Rohit Jain, and David Ott Department of Computer Science University of North Carolina at Chapel Hill We consider wait-free synchronization in multipr...
James H. Anderson, Rohit Jain, David Ott
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 1 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
TOC
2010
155views Management» more  TOC 2010»
13 years 3 months ago
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
Andris Ambainis
TEC
2002
101views more  TEC 2002»
13 years 8 months ago
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
Kuk-Hyun Han, Jong-Hwan Kim
ICANNGA
2007
Springer
184views Algorithms» more  ICANNGA 2007»
14 years 15 days ago
Automatic Synthesis for Quantum Circuits Using Genetic Algorithms
Abstract. This paper proposes an automated quantum circuit synthesis approach, using a genetic algorithm. We consider the circuit as a successive rippling of the so-called gate sec...
Cristian Ruican, Mihai Udrescu, Lucian Prodan, Mir...