Related papers: Thinned Quantile Shares are Universally Feasible

We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…

In this paper, an intuitive approach is employed to generalize the full separability criterion of tripartite quantum states of qubits to the higher-dimensional systems (Phys. Rev. A \textbf{72}, 022333 (2005)). A distinct characteristic of…

Little effort has been devoted to studying generalised notions or models of (un)predictability, yet is an important concept throughout physics and plays a central role in quantum information theory, where key results rely on the supposed…

A different approach towards quantum theory is proposed in this paper. The basis is taken to be conceptual variables, physical variables that may be accessible or inaccessible, i.e., it may be possible or impossible to assign numerical…

We derive by lattice theory a universal quantum certainty relation for arbitrary $M$ observables in $N$-dimensional system, which provides a state-independent maximum lower bound on the direct-sum of the probability vectors in terms of…

In this paper, we present a quantum version of some portions of Mathematical Finance, including theory of arbitrage, asset pricing, and optional decomposition in financial markets based on finite dimensional quantum probability spaces. As…

We introduce and formalize the notion of resource augmentation for maximin share (MMS) fairness for the allocation of indivisible goods. Given an instance with $n$ agents and $m$ goods, we ask how many copies of the goods should be added in…

We show that the maximum quantum violation of the Klyachko-Can-Binicioglu-Shumovsky (KCBS) inequality is exactly the maximum value satisfying the following principle: The sum of probabilities of pairwise exclusive events cannot exceed 1. We…

The final version of a new approach to quantum theory is formulated in this paper. The basis is taken to be theoretical variables, variables that may be accessible or inaccessible, i.e., it may be possible or impossible for an observer to…

In TCSS (Threshold Changeable Secret Sharing) scheme, the threshold can be changed to deal with share leakage in the long term. But in classical TCSS, there is no guarantee that old shares are deleted even if the participated parties are…

We introduce a general methodology for quantitative model checking and control synthesis with supermartingale certificates. We show that every specification that is invariant to time shifts admits a stochastic invariant that bounds its…

As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…

We define \emph{engineered simultaneity}: the construction of a system that requires temporal comparison of events at spacelike-separated locations, implements this comparison via an implicit simultaneity convention, and represents the…

We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…

Equitable $k$-choosability is a list analogue of equitable $k$-coloring that was introduced by Kostochka, Pelsmajer, and West in 2003. It is known that if vertex disjoint graphs $G_1$ and $G_2$ are equitably $k$-choosable, the disjoint…

Choquet capacities and integrals are central concepts in decision making under ambiguity or model uncertainty, pioneered by Schmeidler. Motivated by risk optimization problems for quantiles under ambiguity, we study the subclass of Choquet…

We consider allocating indivisible goods with provable fairness guarantees that are satisfied regardless of which bundle of items each agent receives. Symmetrical allocations of this type are known to exist for divisible resources, such as…

We consider symmetric and Hermitian random matrices whose entries are independent and symmetric random variables with an arbitrary variance pattern. Under a novel Short-to-Long Mixing condition, which is sharp in the sense that it precludes…

We study fair machine learning (ML) under predictive uncertainty to enable reliable and trustworthy decision-making. The seminal work of ``equalized coverage'' proposed an uncertainty-aware fairness notion. However, it does not guarantee…

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it.…