#### Filter Results:

#### Publication Year

2004

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

An XOR function is a function of the form g(x, y) = f (x ⊕ y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise one-way communication complexity for all f. We also show that, when f is monotone, g's quantum and classical… (More)

In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f 2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including quantum property testing; a quantum version of the Goldreich-Levin algorithm for finding the large Fourier coefficients… (More)

- James William Harrington, John Preskill, Isaac Chenchiah, Keng-Hwee Chiam, Richard Cleve, John Cortese +58 others
- 2004

In this paper we study the problem of calculating the convex hull of certain affine algebraic varieties. As we explain, the motivation for considering this problem is that certain pure-state measures of quantum entanglement, which we call polynomial entanglement measures, can be represented as affine algebraic varieties. We consider the evaluation of… (More)

- ‹
- 1
- ›