相关论文: Unambiguous discrimination among oracle operators
We address the problem of unambiguous discrimination and identification among quantum observables. We set a general framework and investigate in details the case of qubit observables. In particular, we show that perfect discrimination with…
When allocating indivisible objects via lottery, planners often use ordinal mechanisms, which elicit agents' rankings of objects rather than their full preferences over lotteries. In such an ordinal informational environment, planners…
We propose a general solution approach for min-max-robust counterparts of combinatorial optimization problems with uncertain linear objectives. We focus on the discrete scenario case, but our approach can be extended to other types of…
It is well understood that classification algorithms, for example, for deciding on loan applications, cannot be evaluated for fairness without taking context into account. We examine what can be learned from a fairness oracle equipped with…
A foundational question in quantum computational complexity asks how much more useful a quantum state can be in a given task than a comparable, classical string. Aaronson and Kuperberg showed such a separation in the presence of a quantum…
The notion of antidistinguishability captures the possibility of ruling out certain alternatives in a quantum experiment without identifying the actual outcome. Although extensively studied for quantum states, the antidistinguishability of…
We study a specific family of symmetric norms on the algebra $\mathcal B(\mathcal H)$ of operators on a separable infinite-dimensional Hilbert space. With respect to each symmetric norm in this family the identity operator fails to attain…
In the problem of fully allocating an infinitely divisible commodity among agents whose preferences are single-peaked, we show that the uniform rule is the only allocation rule that satisfies efficiency, the equal division guarantee,…
In the present paper I formulate a framework that accommodates many unambiguous discrimination problems. I show that the prior information about any type of constituent (state, channel, or observable) allows us to reformulate the…
We study minimum-error identification of an unknown single-bit Boolean function given black-box (oracle) access with one allowed query. Rather than stopping at an abstract optimal measurement, we give a fully constructive solution: an…
An operational probabilistic theory where all systems are classical, and all pure states of composite systems are entangled, is constructed. The theory is endowed with a rule for composing an arbitrary number of systems, and with a…
A non-deterministic automaton running on infinite trees is unambiguous if it has at most one accepting run on every tree. The class of languages recognisable by unambiguous tree automata is still not well-understood. In particular,…
We compare the multipartite entangling and disentangling powers of unitary operators by assessing their ability to generate or eliminate genuine multipartite entanglement. Our findings reveal that while diagonal unitary operators can…
We introduce a new perturbation for the operator curl related to connections with nonabelian gauge groups. We also prove that the perturbed operator is unitary equivalent to the operator curl if the corresponding connection is close enough…
Entanglement can be distributed using a carrier which is always separable from the rest of the systems involved. Up to now, this effect has predominantly been analyzed in the case where the carrier-system interactions take the form of ideal…
We define a class of discrete operators acting on infinite, finite or periodic sequences mimicking the standard properties of pseudo-differential operators. In particular we can define the notion of order and regularity, and we recover the…
While it is well known that finding approximate optima of non-convex functions is computationally intractable, we show that the problem is, in fact, uncomputable in the oracle model. Specifically, we prove that no algorithm with access only…
Differential operators usually result in derivatives expressed as a ratio of differentials. For all but the simplest derivatives, these ratios are typically not algebraically manipulable, but must be held together as a unit in order to…
We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretely selected from a set of known quantum operations can be identified perfectly within a finite number of queries, and…
An operator system $\cl S$ with unit $e$, can be viewed as an Archimedean order unit space $(\cl S,\cl S^+,e)$. Using this Archimedean order unit space, for a fixed $k\in \bb N$ we construct a super k-minimal operator system OMIN$_k(\cl S)$…