249 search results - page 6 / 50 » One Complexity Theorist's View of Quantum Computing |
STOC
2007
ACM
15 years 9 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
UIST
2006
ACM
15 years 3 months ago
2006
ACM
We present a computer vision technique to detect when the user brings their thumb and forefinger together (a pinch gesture) for close-range and relatively controlled viewing circu...
100
click to vote
ICTCS
2005
Springer
15 years 2 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...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...