Related papers: Phase transition in count approximation by Count-M…
Quantum cryptographic conferencing (QCC) holds promise for distributing information-theoretic secure keys among multiple users over long distance. Limited by the fragility of Greenberger-Horne-Zeilinger (GHZ) state, QCC networks based on…
A quick count seeks to estimate the voting trends of an election and communicate them to the population on the evening of the same day of the election. In quick counts, the sampling is based on a stratified design of polling stations.…
Quantum hardware suffers from intrinsic device heterogeneity and environmental drift, forcing practitioners to choose between suboptimal non-adaptive controllers or costly per-device recalibration. We derive a scaling law lower bound for…
This letter introduces a novel channel coding design framework for short-length codewords that permits balancing the tradeoff between the bit error rate floor and waterfall region by modifying a single real-valued parameter. The proposed…
We study the discrete-time threshold-$\theta \geq 2$ contact process on random graphs of general degrees. For random graphs with a given degree distribution $\mu$, we show that if $\mu$ is lower bounded by $\theta+2$ and has finite $k$th…
We model the performance of an ideal closed chain of L processing elements that work in parallel in an asynchronous manner. Their state updates follow a generic conservative algorithm. The conservative update rule determines the growth of a…
We show that for quantum phase transitions with a single bosonic zero mode at the critical point, like the Dicke model and the Lipkin-Meshkov-Glick model, metric quantities such as fidelity, that is, the overlap between two ground states…
Demonstrations of quantum computational advantage and benchmarks of quantum processors via quantum random circuit sampling are based on evaluating the linear cross-entropy benchmark (XEB). A key question in the theory of XEB is whether it…
We investigate the performance of several continuous-variable quantum key distribution protocols in the presence of fading channels. These are lossy channels whose transmissivity changes according to a probability distribution. This is…
Some recent work on confidence intervals for randomized quasi-Monte Carlo (RQMC) sampling found a surprising result: ordinary Student $t$ 95% confidence intervals based on a modest number of replicates were seen to be very effective and…
The matrix scaling problem, particularly the Sinkhorn-Knopp algorithm, has been studied for over 60 years. In practice, the algorithm often yields high-quality approximations within just a few iterations. Theoretically, however, the…
Researchers may perform regressions using a sketch of data of size $m$ instead of the full sample of size $n$ for a variety of reasons. This paper considers the case when the regression errors do not have constant variance and…
The phase transition between gapped topological phases represents a class of unconventional criticality beyond the Landau paradigm. However, recent research has shifted attention to topological phases without a bulk gap, where the phase…
Catastrophic regime shifts in complex natural systems may be averted through advanced detection. Recent work has provided a proof-of-principle that many systems approaching a catastrophic transition may be identified through the lens of…
Quantum key distribution (QKD) provides means for unconditional secure key transmission between two distant parties. However, in practical implementations, it suffers from quantum hacking due to device imperfections. Here we propose a…
The orthant model is a directed percolation model on $\mathbb{Z}^d$, in which all clusters are infinite. We prove a sharp threshold result for this model: if $p$ is larger than the critical value above which the cluster of $0$ is contained…
We present a scheme for implementing homomorphic encryption on coherent states encoded using phase-shift keys. The encryption operations require only rotations in phase space, which commute with computations in the codespace performed via…
Traditional approaches to Quantitative Information Flow (QIF) represent the adversary's prior knowledge of possible secret values as a single probability distribution. This representation may miss important structure. For instance,…
We study the binary $q$-voter model with generalized anticonformity on random Erd\H{o}s-R\'enyi graphs. In such a model, two types of social responses, conformity and anticonformity, occur with complementary probabilities and the size of…
Quantum key distribution -- the establishment of information-theoretically secure keys based on quantum physics -- is mainly limited by its practical performance, which is characterised by the dependence of the key rate on the channel…