Related papers: Energy, Latency, and Reliability Tradeoffs in Codi…
In this paper, we discuss coding theorems on a $(2, 2)$--threshold scheme in the presence of an opponent who impersonates one of the two shareholders in an asymptotic setup. We consider a situation where $n$ secrets $S^n$ from a memoryless…
We provide the first capacity approaching coding schemes that robustly simulate any interactive protocol over an adversarial channel that corrupts any $\epsilon$ fraction of the transmitted symbols. Our coding schemes achieve a…
This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal x in R^n (a block of n pieces of information) to a remote receiver. We ask whether it is possible to transmit this information reliably…
We present a constructive approach to obtain information about the compactness and shape of large-scale lowest excitations in disordered systems by studying order-parameter fluctuations (OPF) at low temperatures. We show that the parameter…
We propose an energy-optimized invariant energy quadratization method to solve the gradient flow models in this paper, which requires only one linear energy-optimized step to correct the auxiliary variables on each time step. In addition to…
The Shannon information-entropy uncertainty (in brief as "information uncertainty") is used to analyze the fragments in the measured 140$A$ MeV $^{40, 48}$Ca + $^{9}$Be and $^{58, 64}$Ni + $^{9}$Be reactions. A scaling phenomenon is found…
Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising due to the complete separability of the transmitted symbols…
In the paradigm of thermodynamic computing, instead of behaving deterministically, hardware undergoes a stochastic process in order to sample from a distribution of interest. While it has been hypothesized that thermodynamic computers may…
Modern computing systems based on the von Neumann architecture are built from silicon complementary metal oxide semiconductor (CMOS) transistors that need to operate under practically error free conditions with 1 error in $10^{15}$…
Precision tests of QCD perturbation theory are not readily available from experimental data. The main reasons are systematic uncertainties due to the confinement of quarks and gluons, as well as kinematical constraints which limit the…
Unequal transition probabilities between input and output symbols, input power constraints, or input symbols of unequal durations can lead to non-uniform capacity achieving input distributions for communication channels. Using uniform input…
flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exist constant-weight errors (such as half of a stabiliser)…
In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…
We present error estimates for four unconditionally energy stable numerical schemes developed for solving Allen-Cahn equations with nonlocal constraints. The schemes are linear and second order in time and space, designed based on the…
The framework of this thesis is fault-tolerant quantum algorithms. Grover's algorithm and quantum walks are described in Chapter 2. We start by highlighting the central role that rotations play in quantum algorithms, explaining Grover's,…
Decoding stabilizer codes such as the surface and toric codes involves evaluating free-energy differences in a disordered statistical mechanics model, in which the randomness comes from the observed pattern of error syndromes. We study the…
A new energy and enstrophy conserving scheme is evaluated using a suite of test cases over the global spherical domain or bounded domains. The evaluation is organized around a set of pre-defined properties: accuracy of individual opeartors,…
Coded computing has emerged as a promising framework for tackling significant challenges in large-scale distributed computing, including the presence of slow, faulty, or compromised servers. In this approach, each worker node processes a…
We present a numerical analysis of an incompressible decaying magnetohydrodynamic turbulence run on a grid of 1536^3 points. The Taylor Reynolds number at the maximum of dissipation is ~1100, and the initial condition is a superposition of…
In this work we propose a new algorithm for the computation of statistical equilibrium quantities on a cubic lattice when both an energy and a statistical temperature are involved. We demonstrate that the pivot algorithm used in situations…