English
Related papers

Related papers: Thinned Quantile Shares are Universally Feasible

200 papers

For fixed weights w_1,...,w_n, and for d>0, we let B denote a collection of d*n balls, with d balls of weight w_i for each i=1,...,n. We consider the problem of assigning the balls to n bins with capacities C_1,...,C_n, in such a way that…

Combinatorics · Mathematics 2019-09-06 Claudiu Raicu

It is well-known that an $\mathbb{R}$-valued random vector $(X_1, X_2, \cdots, X_n)$ is comonotonic if and only if $(X_1, X_2, \cdots, X_n)$ and $(Q_1(U), Q_2(U),\cdots, Q_n(U))$ coincide \emph{in distribution}, for \emph{any} random…

Portfolio Management · Quantitative Finance 2022-01-07 Zuo Quan Xu

Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…

Quantum Physics · Physics 2026-02-02 Marcello Benedetti , Harry Buhrman , Jordi Weggemans

Bucklew and Wise (1982) showed that the quantization dimension of an absolutely continuous probability measure on a given Euclidean space is constant and equals the Euclidean dimension of the space, and the quantization coefficient exists…

Probability · Mathematics 2025-07-23 Evans Nyanney , Megha Pandey , Mrinal Kanti Roychowdhury

We derive an exact expression for the quantumness of a Hilbert space (defined in quant-ph/0302092), and show that in composite Hilbert spaces the signal states must contain at least some entangled states in order to achieve such a…

Quantum Physics · Physics 2007-05-23 Christopher A. Fuchs

We study fair allocation of indivisible goods among additive agents with feasibility constraints. In these settings, every agent is restricted to get a bundle among a specified set of feasible bundles. Such scenarios have been of great…

Computer Science and Game Theory · Computer Science 2022-04-26 Amitay Dror , Michal Feldman , Erel Segal-Halevi

We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability…

Logic in Computer Science · Computer Science 2014-01-27 Yangjia Li , Mingsheng Ying

We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold. Specifically, maximin share is defined as…

Computer Science and Game Theory · Computer Science 2017-11-22 Siddharth Barman , Arpita Biswas , Sanath Kumar Krishnamurthy , Y. Narahari

We study fair division of divisible goods under generalized assignment constraints. Here, each good has an agent-specific value and size, and every agent has a budget constraint that limits the total size of the goods she can receive. Since…

Computer Science and Game Theory · Computer Science 2026-03-03 Siddharth Barman , Ioannis Caragiannis , Sudarshan Shyam

Quantum tokens envision to store unclonable quantum states in a physical device, with the goal of being used for personal authentication protocols, as required by banks. Still, the experimental realization of such devices faces many…

The existing unconditional security definitions of quantum key distribution (QKD) do not apply to joint attacks over QKD and the subsequent use of the resulting key. In this paper, we close this potential security gap by using a universal…

Quantum Physics · Physics 2007-05-23 M. Ben-Or , Michal Horodecki , D. W. Leung , D. Mayers , J. Oppenheim

Ben-Tal and Teboulle \cite{BTT86} introduce the concept of optimized certainty equivalent (OCE) of an uncertain outcome as the maximum present value of a combination of the cash to be taken out from the uncertain income at present and the…

Optimization and Control · Mathematics 2022-03-22 Qiong Wu , Huifu Xu

Non-Euclidean data become more prevalent in practice, necessitating the development of a framework for statistical inference analogous to that for Euclidean data. Quantile is one of the most important concepts in traditional statistical…

Statistics Theory · Mathematics 2024-03-20 Hang Liu , Xueqin Wang , Jin Zhu , Heping Zhang

In the $\left( {t,n} \right)$ threshold quantum secret sharing scheme, it is difficult to ensure that internal participants are honest. In this paper, a verifiable $\left( {t,n} \right)$ threshold quantum secret sharing scheme is designed…

Cryptography and Security · Computer Science 2020-08-26 Li-Juan Liu , Zhi-Hui Li , Zhao-Wei Han , Dan-Li Zhi

A universal programmable detector is a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension d for the ancilla only approximate universal…

Quantum Physics · Physics 2007-05-23 Giacomo Mauro D'Ariano , Paolo Perinotti

We study when a metric surface $X$ can be mapped quasisymmetrically onto a circle domain $D\subset\mathbb{C}$ with uniformly relatively separated boundary components. Bonk \cite{Bonk} proved that if $X\subset \hat{\mathbb{C}}$ and the…

Complex Variables · Mathematics 2025-08-26 Hrant Hakobyan , Jonathan Rehmert

This tutorial introduces a systematic approach for addressing the key question of quantum metrology: For a generic task of sensing an unknown parameter, what is the ultimate precision given a constrained set of admissible strategies. The…

Quantum Physics · Physics 2024-12-19 Qiushi Liu , Zihao Hu , Haidong Yuan , Yuxiang Yang

Quasi-Monte Carlo (QMC) methods for estimating integrals are attractive since the resulting estimators typically converge at a faster rate than pseudo-random Monte Carlo. However, they can be difficult to set up on arbitrary posterior…

Statistics Theory · Mathematics 2018-10-03 Tobias Schwedes , Ben Calderhead

In the allocation of indivisible goods, a prominent fairness notion is envy-freeness up to one good (EF1). We initiate the study of reachability problems in fair division by investigating the problem of whether one EF1 allocation can be…

Computer Science and Game Theory · Computer Science 2024-11-19 Ayumi Igarashi , Naoyuki Kamiyama , Warut Suksompong , Sheung Man Yuen

Variance is a ubiquitous quantity in quantum information theory. Given a basis, we consider the averaged variances of a fixed diagonal observable in a pure state under all possible permutations on the components of the pure state and call…

Quantum Physics · Physics 2022-07-14 Ming-Jing Zhao , Lin Zhang , Shao-Ming Fei