587 search results - page 8 / 118 » Quantum computation and quantum information |
COCO
2001
Springer
14 years 2 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
ISMVL
2002
IEEE
14 years 2 months ago
2002
IEEE
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
ECCC
2010
13 years 10 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
DSN
2004
IEEE
14 years 1 months ago
2004
IEEE
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual com...
ITNG
2007
IEEE
14 years 4 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...