Related papers: Thinned Quantile Shares are Universally Feasible
In this paper we propose a unified statistics of Bose-Einstein and Fermi-Dirac statistics by suggesting that every particle can be associated with matter or fundamental forces with certain probability. The main Justification for this…
Constrained quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with a finite number of supporting points lying on a specific set. The specific set is known as the…
We study when partial Boolean functions can (and cannot) exhibit superpolynomial quantum query speedups, and develop a general framework for ruling out such speedups via two complementary lenses: promise-aware complexity measures and…
In this work, we investigate what kinds of quantum states are feasible to perform perfectly secure secret sharing, and present its necessary and sufficient conditions. We also show that the states are bipartite distillable for all bipartite…
We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary $(n=2^m-3, 2^{n-m-1}, 4)$ code $C$, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of…
We prove a Painlev\'e theorem for bounded quasiregular curves in Euclidean spaces extending removability results for quasiregular mappings due to Iwaniec and Martin. The theorem is proved by extending a fundamental inequality for volume…
Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby…
It is standard to assume that the Wigner distribution of a mixed quantum state consisting of square-integrable functions is a quasi-probability distribution, that is that its integral is one and that the marginal properties are satisfied.…
Quantum theory provides a comprehensive framework for quantifying uncertainty, often applied in quantum finance to explore the stochastic nature of asset returns. This perspective likens returns to microscopic particle motion, governed by…
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A $k$-assignment, $L$, for a graph $G$ assigns a list, $L(v)$, of $k$ available colors to each $v \in V(G)$, and an…
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints C on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and…
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…
A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred…
A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…
A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…
In several articles, this author has advocated an alternative approach towards quantum foundation based upon a set of postulates, and based upon the notions of theoretical variables and of accessible theoretical variables. It is shown in…
In this work, we extend the classical framework of quantization for Borel probability measures defined on normed spaces $\mathbb{R}^k$ by introducing and analyzing the notions of the $n$th constrained quantization error, constrained…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
Various inequalities (Boole inequality, Chung-Erd\"os inequality, Frechet inequality) for Kolmogorov (classical) probabilities are considered. Quantum counterparts of these inequalities are introduced, which have an extra `quantum…
It has been widely claimed and believed that many protocols in quantum key distribution, especially the single-photon BB84 protocol, have been proved unconditionally secure at least in principle, for both asymptotic and finite protocols…