Related papers: Quantum Suicide in Many-Worlds Implies P=NP
It is shown that probabilistic treatment of quantum mechanics can be coordinated with causality of all physical processes. The physical interpretation of quantum-mechanical phenomena such as process of measurement and collapse of quantum…
Two works related to the concept of probability in the framework of the many-worlds interpretation are presented. The first deals with recent controversy in classical probability theory. Elga and D. Lewis argues that Sleeping Beauty should…
We show how a number of NP-complete as well as NP-hard problems can be reduced to the Sturm-Liouville eigenvalue problem in the quantum setting with queries. We consider power queries which are derived from the propagator of a system…
In this paper we attempt to analyze the concept of quantum probability within quantum computation and quantum computational logic. While the subjectivist interpretation of quantum probability explains it as a reliable predictive tool for an…
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…
We present a game-theoretic perspective on the problems of quantum state estimation and quantum cloning. This enables us to show why the focus on universal machines and the different measures of success, as employed in previous works, are…
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
In this paper we address the problem of using one probability space for estimating parameters and predicting future data when the observed data come from multiple contexts and thus from distinct spaces. We explain that a set-based…
We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a…
Bayes' rule $\mathbb{P}(B|A)\mathbb{P}(A)=\mathbb{P}(A|B)\mathbb{P}(B)$ is one of the simplest yet most profound, ubiquitous, and far-reaching results of classical probability theory, with applications in any field utilizing statistical…
This paper can be seen as an exercise in how to adapt quantum mechanics from a strict relativistic perspective while being respectful and critical towards the experimental achievements of the contemporary theory. The result is a fully…
Due to the absence of an external, classical time variable, the probabilistic predictions of covariant quantum theory are ambiguous when multiple measurements are considered. Here, we introduce an information theoretic framework to the…
The paper considers scheduling on parallel machines under the constraint that some pairs of jobs cannot be processed concurrently. Each job has an associated weight, and all jobs have the same deadline. The objective is to maximise the…
In this work, we introduce a novel variant of the multivariate quadratic problem, which is at the core of one of the most promising post-quantum alternatives: multivariate cryptography. In this variant, the solution of a given multivariate…
Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the…
In this paper, we present a polynomial-sized linear programming formulation of the Quadratic Assignment Problem (QAP). The proposed linear program is a network flow-based model. Hence, it provides for the solution of the QAP in polynomial…
In this paper, we present a polynomial-time algorithm for the maximum clique problem, which implies P = NP. Our algorithm is based on a continuous game-theoretic representation of this problem and at its heart lies a discrete-time dynamical…
This paper has been withdrawn by the author. In this short paper I introduce a concept of possibility in order to vindicate Everett's Theory of many worlds. The main idea is that there is only one world: the real. After the wave-collapse,…
Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many…