Sciweavers

4895 search results - page 34 / 979
» Functional Quantum Programming
Sort
View
NIPS
2001
13 years 10 months ago
The Method of Quantum Clustering
We propose a novel clustering method that is an extension of ideas inherent to scale-space clustering and support-vector clustering. Like the latter, it associates every data poin...
David Horn, Assaf Gottlieb
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 9 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
FOCS
2006
IEEE
14 years 2 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
FOSSACS
2006
Springer
14 years 13 days ago
Reversing Algebraic Process Calculi
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...
Iain C. C. Phillips, Irek Ulidowski
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 9 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro