Zobrazeno 1 - 10
of 3 682
pro vyhledávání: '"Rapaport P"'
Autor:
Ordan, Yoad, Bloom, Yuval, Levin, Tamar, Sulimany, Kfir, Hollingsworth, Jennifer A., Rapaport, Ronen
The original proposal of quantum key distribution (QKD) was based on ideal single photon sources, which 40 years later, are still challenging to develop. Therefore, the development of decoy state protocols using weak coherent states (WCS) from lasers
Externí odkaz:
http://arxiv.org/abs/2409.07939
In this note, we propose a novel approach for a class of autonomous dynamical systems that allows, given some observations of the solutions, to identify its parameters and reconstruct the state vector. This approach relies on proving the linear indep
Externí odkaz:
http://arxiv.org/abs/2408.11482
Autor:
Rapaport, Ariel, Ren, Haojie
For $(\lambda_{1},...,\lambda_{d})=\lambda\in(0,1)^{d}$ with $\lambda_{1}>...>\lambda_{d}$, denote by $\mu_{\lambda}$ the Bernoulli convolution associated to $\lambda$. That is, $\mu_{\lambda}$ is the distribution of the random vector $\sum_{n\ge0}\p
Externí odkaz:
http://arxiv.org/abs/2406.05495
Autor:
Halevi, Dotan, Lubotzky, Boaz, Sulimany, Kfir, Bowes, Eric G., Hollingsworth, Jennifer A., Bromberg, Yaron, Rapaport, Ronen
High-dimensional quantum key distribution (HDQKD) is a promising avenue to address the inherent limitations of basic QKD protocols. However, experimental realizations of HDQKD to date have relied on indeterministic photon sources that limit the achie
Externí odkaz:
http://arxiv.org/abs/2405.03377
We establish that every monadic second-order logic (MSO) formula on graphs with bounded treedepth is decidable in a constant number of rounds within the CONGEST model. To our knowledge, this marks the first meta-theorem regarding distributed model-ch
Externí odkaz:
http://arxiv.org/abs/2405.03321
Autor:
Sayers, Jack, Avestruz, Camille, Thakur, Ritoban Basu, Battistelli, Elia Stefano, Bulbul, Esra, Caccioti, Federico, Columbro, Fabio, Coppolecchia, Alessandro, Cray, Scott, D'Alessandro, Giuseppe, de Bernardis, Paolo, de Petris, Marco, Hanany, Shaul, Lamagna, Luca, Lau, Erwin, Masi, Silvia, Paiella, Allesandro, Pettinari, Giorgio, Piacentini, Francesco, Rapaport, Eitan, Rudnick, Larry, Zhuravleva, Irina, ZuHuone, John
OLIMPO is a proposed Antarctic balloon-borne Sunyaev-Zel'dovich effect (SZE) imager to study gas dynamics associated with structure formation along with the properties of the warm-hot intergalactic medium (WHIM) residing in the connective filaments.
Externí odkaz:
http://arxiv.org/abs/2404.04414
Autor:
Nazarov, Alexander, Bloom, Yuval, Lubotzky, Boaz, Abudayyeh, Hamza, Mildner, Annika, Baldessarini, Lorenzo, Shemla, Yuval, Bowes, Eric G., Fleischer, Monika, Hollingsworth, Jennifer A., Rapaport, Ronen
To harness the potential of radially polarized single photons in applications such as high-dimensional quantum key distribution (HD-QKD) and quantum communication, we demonstrate an on-chip, room-temperature device, which generates highly directional
Externí odkaz:
http://arxiv.org/abs/2403.06523
We prove the following type of discrete entropy monotonicity for sums of isotropic, log-concave, independent and identically distributed random vectors $X_1,\dots,X_{n+1}$ on $\mathbb{Z}^d$: $$ H(X_1+\cdots+X_{n+1}) \geq H(X_1+\cdots+X_{n}) + \frac{d
Externí odkaz:
http://arxiv.org/abs/2401.15462
Augustine et al. [DISC 2022] initiated the study of distributed graph algorithms in the presence of Byzantine nodes in the congested clique model. In this model, there is a set $B$ of Byzantine nodes, where $|B|$ is less than a third of the total num
Externí odkaz:
http://arxiv.org/abs/2312.07747
In the Minimum Clique Routing Problem on Cycles \textsc{MCRPC} we are given a cycle together with a set of demands (weighted origin-destination pairs) and the goal is to route all the pairs minimizing the maximum weighted clique of the intersection g
Externí odkaz:
http://arxiv.org/abs/2311.10055