E-LIB Suche - Ergebnisse für: Speelman, Florian

1

Towards Complete Quantum Network Stacks, A Survey:

Zhang, Ziyan ; Papagianni, Chrysa ; Speelman, Florian.
IEEE Network. , 2024

Link: https://doi.org/10.1109/..

2

Relating non-local quantum computation to information theor..:

Allerstorfer, Rene ; Buhrman, Harry ; May, Alex..
Quantum. 8 (2024) - p. 1387 , 2024

Link: https://doi.org/10.22331..

3

Oblivious Transfer from Zero-Knowledge Proofs: Or How to Ac..:

, In: Advances in Cryptology – ASIACRYPT 2023; Lecture Notes in Computer Science,

Colisson, Léo ; Muguruza, Garazi ; Speelman, Florian - p. 3-38 , 2023

Link: https://doi.org/10.1007/..

4

Single-Qubit Loss-Tolerant Quantum Position Verification Pr..:

Escolà-Farràs, Llorenç ; Speelman, Florian
Physical Review Letters. 131 (2023) 14 - p. , 2023

Link: https://doi.org/10.1103/..

5

A single-qubit position verification protocol that is secur..:

Bluhm, Andreas ; Christandl, Matthias ; Speelman, Florian
Nature Physics. 18 (2022) 6 - p. 623-626 , 2022

Link: https://doi.org/10.1038/..

6

Solving correlation clustering with QAOA and a Rydberg qudi..:

Weggemans, Jordi R. ; Urech, Alexander ; Rausch, Alexander...
Quantum. 6 (2022) - p. 687 , 2022

Link: https://doi.org/10.22331..

7

Asymptotic Performance of Port-Based Teleportation:

Christandl, Matthias ; Leditzky, Felix ; Majenz, Christian...
Communications in Mathematical Physics. 381 (2020) 1 - p. 379-451 , 2020

Link: https://doi.org/10.1007/..

8

Catalytic Space: Non-determinism and Hierarchy:

Buhrman, Harry ; Koucký, Michal ; Loff, Bruno.
Theory of Computing Systems. 62 (2017) 1 - p. 116-135 , 2017

Link: https://doi.org/10.1007/..

9

Quantum communication complexity advantage implies violatio..:

Buhrman, Harry ; Czekaj, Łukasz ; Grudka, Andrzej...
Proceedings of the National Academy of Sciences. 113 (2016) 12 - p. 3191-3196 , 2016

Link: https://doi.org/10.1073/..

10

Towards a Reverse Newman's Theorem in Interactive Informati..:

Brody, Joshua ; Buhrman, Harry ; Koucký, Michal...
Algorithmica. 76 (2016) 3 - p. 749-781 , 2016

Link: https://doi.org/10.1007/..

11

Quantum communication complexity advantage implies violatio..:

Buhrman, Harry ; Czekaj, Łukasz ; Grudka, Andrzej...
Proceedings of the National Academy of Sciences of the United States of America. 113 (2016) 12 - p. 3191-3196 , 2016

Link: https://www.jstor.org/st..

12

Computing with a full memory : catalytic space:

, In: Proceedings of the forty-sixth annual ACM symposium on Theory of computing,

Buhrman, Harry ; Cleve, Richard ; Koucký, Michal.. - p. 857-866 , 2014

Link: https://dl.acm.org/doi/1..

13

The garden-hose model:

, In: Proceedings of the 4th conference on Innovations in Theoretical Computer Science,

Buhrman, Harry ; Fehr, Serge ; Schaffner, Christian. - p. 145-158 , 2013

Link: https://dl.acm.org/doi/1..

14

Relating non-local quantum computation to information theor..:

Allerstorfer, Rene ; Buhrman, Harry ; May, Alex..
http://arxiv.org/abs/2306.16462. , 2023

Link: http://arxiv.org/abs/230..

15

QSETH strikes again: finer quantum lower bounds for lattice..:

Chen, Yanlin ; Chen, Yilei ; Kumar, Rajendra..
http://arxiv.org/abs/2309.16431. , 2023

Link: http://arxiv.org/abs/230..