Zobrazeno 1 - 10
of 1 598
pro vyhledávání: '"Speelman P"'
We introduce a quantum cloning game in which $k$ separate collaborative parties receive a classical input, determining which of them has to share a maximally entangled state with an additional party (referee). We provide the optimal winning probabili
Externí odkaz:
http://arxiv.org/abs/2410.22157
A catalytic machine is a model of computation where a traditional space-bounded machine is augmented with an additional, significantly larger, "catalytic" tape, which, while being available as a work tape, has the caveat of being initialized with an
Externí odkaz:
http://arxiv.org/abs/2409.05046
This paper tackles the multi-vehicle Coverage Path Planning (CPP) problem, crucial for applications like search and rescue or environmental monitoring. Due to its NP-hard nature, finding optimal solutions becomes infeasible with larger problem sizes.
Externí odkaz:
http://arxiv.org/abs/2407.08767
Extended non-local games are a generalization of monogamy-of-entanglement games, played by two quantum parties and a quantum referee that performs a measurement on their local quantum system. Along the lines of the NPA hierarchy, the optimal winning
Externí odkaz:
http://arxiv.org/abs/2405.13717
Autor:
Allerstorfer, Rene, Escolà-Farràs, Llorenç, Ray, Arpan Akash, Skoric, Boris, Speelman, Florian
Motivated by the fact that coherent states may offer practical advantages it was recently shown that a continuous-variable (CV) quantum position verification (QPV) protocol using coherent states could be securely implemented if and only if attackers
Externí odkaz:
http://arxiv.org/abs/2404.14261
Autor:
Muguruza, Garazi, Speelman, Florian
We introduce Port-Based State Preparation (PBSP), a teleportation task where Alice holds a complete classical description of the target state and Bob's correction operations are restricted to only tracing out registers. We show a protocol that implem
Externí odkaz:
http://arxiv.org/abs/2402.18356
Autor:
Allerstorfer, Rene, Bluhm, Andreas, Buhrman, Harry, Christandl, Matthias, Escolà-Farràs, Llorenç, Speelman, Florian, Lunel, Philip Verduyn
Signal loss poses a significant threat to the security of quantum cryptography when the chosen protocol lacks loss-tolerance. In quantum position verification (QPV) protocols, even relatively small loss rates can compromise security. The goal is thus
Externí odkaz:
http://arxiv.org/abs/2312.12614
While seemingly undesirable, it is not a surprising fact that there are certain problems for which quantum computers offer no computational advantage over their respective classical counterparts. Moreover, there are problems for which there is no `us
Externí odkaz:
http://arxiv.org/abs/2309.16431
Autor:
Allerstorfer, Rene, Escolà-Farràs, Llorenç, Ray, Arpan Akash, Škorić, Boris, Speelman, Florian, Lunel, Philip Verduyn
In this work we study quantum position verification with continuous-variable quantum states. In contrast to existing discrete protocols, we present and analyze a protocol that utilizes coherent states and its properties. Compared to discrete-variable
Externí odkaz:
http://arxiv.org/abs/2308.04166
Publikováno v:
Quantum 8, 1387 (2024)
Non-local quantum computation (NLQC) is a cheating strategy for position-verification schemes, and has appeared in the context of the AdS/CFT correspondence. Here, we connect NLQC to the wider context of information theoretic cryptography by relating
Externí odkaz:
http://arxiv.org/abs/2306.16462