2479 search results - page 32 / 496 » Quantum complexity theory |
ICTCS
2005
Springer
14 years 3 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
COCO
2008
Springer
13 years 12 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
APN
2007
Springer
14 years 4 months ago
2007
Springer
We shall describe connections between Petri nets, quantum physics and category theory. The view of Net theory as a kind of discrete physics has been consistently emphasized by Carl...
AUTOMATICA
2007
13 years 10 months ago
2007
— A pair of spins is the most simple quantum system that can possess entanglement, a non-classical property playing an essential role in quantum information technologies. In this...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are q...