相关论文: Bernstein's socks and polynomial-time provable coh…
The balance held by Brownian motion between temporal regularity and randomness is embodied in a remarkable way by Levy's forgery of continuous functions. Here we describe how this property can be extended to forge arbitrary dependences…
We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within…
Quantum theory in a global space-time gives rise to non-local correlations, which cannot be explained causally in a satisfactory way; this motivates the study of theories with reduced global assumptions. Oreshkov, Costa, and Brukner (2012)…
We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as…
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-type proof. Specifically, we consider quantum…
It is shown that 'non-quantum systems', with anomalous statistical properties, would carry a distinctive experimental signature. Such systems can exist in deterministic hidden-variables theories (such as the pilot-wave theory of de Broglie…
This work introduces a probabilistic-based model for binary CSP that provides a fine grained analysis of its internal structure. Assuming that a domain modification could occur in the CSP, it shows how to express, in a predictive way, the…
We performed an experimental test of the Kochen-Specker theorem based on an inequality derived from the Peres-Mermin proof, using spin-path (momentum) entanglement in a single neutron system. Following the strategy proposed by Cabello et…
Two results are proved at the quantal level in Sorkin's hierarchy of measure theories. One is a strengthening of an existing bound on the correlations in the EPR-Bohm setup under the assumption that the probabilities admit a strongly…
Expanding the ideas of the author's paper 'Nonexpansive maps and option pricing theory' (Kibernetica 34:6 (1998), 713-724) we develop a pure game-theoretic approach to option pricing, by-passing stochastic modeling. Risk neutral…
A theory is universal contextual if its prediction cannot be reproduced by an ontological model satisfying both preparation and measurement noncontextuality assumptions. In this report, we first generalize the logical proofs of quantum…
We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n bits of true randomness from a seed of O(log n) uniform bits. The bits generated are certifiably random based only on a simple statistical…
Selection of input features such as relevant pieces of text has become a common technique of highlighting how complex neural predictors operate. The selection can be optimized post-hoc for trained models or incorporated directly into the…
A method of calculating probability values from a system of marginal constraints is presented. Previous systems for finding the probability of a single attribute have either made an independence assumption concerning the evidence or have…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…
A sequence of spin-1/2 particles polarised in one of two possible directions is presented to an experimenter, who can wager in a double-or-nothing game on the outcomes of measurements in freely chosen polarisation directions. Wealth is…
We study how meaningful physical predictions can arise in nonperturbative quantum gravity in a closed Lorentzian universe. In such settings, recent developments suggest that the quantum gravitational Hilbert space is one-dimensional and…
We consider linear recurrences with polynomial coefficients of Poincar\'e type and with a unique simple dominant eigenvalue. We give an algorithm that proves or disproves positivity of solutions provided the initial conditions satisfy a…
In order to verify Percival's conjecture [J. Phys. B 6,L229 (1973)] we study a planar billiard in its classical and quantum versions. We provide an evaluation of the nearest-neighbor level-spacing distribution for the Cassini oval billiard,…
A system of quantum reasoning for a closed system is developed by treating non-relativistic quantum mechanics as a stochastic theory. The sample space corresponds to a decomposition, as a sum of orthogonal projectors, of the identity…