Zobrazeno 1 - 10
of 1 717
pro vyhledávání: '"Farràs A"'
Autor:
Muhammad Rahadian Abdurrahman, Halim Al Aziz, Farras Adhani Zayn, Muhammad Agus Purnomo, Heru Agus Santoso
Publikováno v:
Journal of Informatics and Web Engineering, Vol 3, Iss 3, Pp 164-175 (2024)
Stunting prevalence in Indonesia persists as a significant challenge necessitating concerted efforts from all stakeholders. We developed robot for stunting analysis using deep learning algorithm. It aligns with the Sustainable Development Goal (SDG)
Externí odkaz:
https://doaj.org/article/f3b7dd48d2234e7da86ee282db6c650b
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
Autor:
Bamiloshin, Michael, Farràs, Oriol
In this work, we revisit some combinatorial and information-theoretic extension techniques for detecting non-algebraic matroids. These are the Dress-Lov\'asz and Ahlswede-K\"orner extension properties. We provide optimizations of these techniques to
Externí odkaz:
http://arxiv.org/abs/2406.18359
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:
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
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
We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic representations. Iteratio
Externí odkaz:
http://arxiv.org/abs/2306.15085
Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers
Protocols for quantum position verification (QPV) which combine classical and quantum information are insecure in the presence of loss. We study the exact loss-tolerance of the most popular protocol for QPV, which is based on BB84 states, and general
Externí odkaz:
http://arxiv.org/abs/2212.03674
Local simultaneous state discrimination (LSSD) is a recently introduced problem in quantum information processing. Its classical version is a non-local game played by non-communicating players against a referee. Based on a known probability distribut
Externí odkaz:
http://arxiv.org/abs/2211.06456