2
collaborators
1998–2013
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
7 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Extractors against classical and quantum adversaries (part 2) | QCRYPT 2013 | tutorial ▸ presenter | — |
| Limits of privacy amplification against non-signalling memory attacks | QCRYPT 2013 | regular | ▸Rotem Arnon-Friedman |
| Extractors against classical and quantum adversaries (part 1) | QCRYPT 2013 | tutorial ▸ presenter | — |
| Approximate quantum error correction for correlated noise | QIP 2009 | regular | ▸Avraham Ben-Aroya |
| Short seed extractors against quantum storage | QIP 2009 | regular ▸ presenter | — |
| Quantum communication complexity of sampling | QIP 1999 | invited | — |
Alice and Bob want to play cards over the phone. To start the game each of them should choose a set of ten random cards, and of course the two sets have to be disjoint. How much communication between Alice and Bob is needed to achieve this task? In the talk I will define the sampling communication complexity model, which generalizes the above example. |
|||
| How much information can one touch in k qbits | QIP 1998 | regular ▸ presenter | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Avraham Ben-Aroya | 1 |
| Rotem Arnon-Friedman | 1 |