206 search results - page 11 / 42 » On the Complexity of Quantum ACC |
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
ITNG
2007
IEEE
14 years 1 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
ANSS
2005
IEEE
14 years 1 months ago
2005
IEEE
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...