Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2603.28869

Quantum Suicide in Many-Worlds Implies P=NP

Veronika Baumann, Alberto Rolandi

quant-phSubmitted Mar 30, 2026• Announced Apr 1, 2026• 0 citations
arXivHTMLPDF

Abstract

In this paper we propose a totally serious algorithm to solve NP problems in polynomial time provided one is willing to wager the fate of all observers in the universe on the many-world interpretation of quantum theory being correct.
Comments
extremely serious paper

Related papers

QFT + NP = P Quantum Field Theory (QFT): A Possible Way of Solving NP-Complete Problems in Polynomial Time

Владик Крейнович, Luc Longpré, Adriana Espino Beltrán

Studies in big data•Oct 13, 2017•0 citations

Many-Worlds Interpretations Can Not Imply 'Quantum Immortality'

Jacques Mallah

The fallacy that the many worlds intepretation (MWI) of quantum mechanics implies certain survival in quantum Russian roulette-like situations (the 'Quantum Suicide' (QS) thought experiment) has become common enough that it is now necessary to publicly debunk this belief despite the risk of further publicizing it. 'Quantum Immortality' is an extension of the QS Fallacy (QSF) with some additional unlikely assumptions. The QS/QI ideas are examined here and shown to be false.

arXiv:0902.0187•Feb 2, 2009•2 citations

A Quantum NP Solver: NP in QP

Clarke, Thomas L.

A attempt at a quantum algorithm for solving NP problems is presented. Now withdrawn because some crucial operators were not unitary.

arXiv:quant-ph/9908080•Aug 27, 1999•0 citations

Solving in the quantum computer every classical NP problem in polynomial time

Fernando Maroto

This paper has been withdrawn by the author due to a crucial error in eq.59. I apologize for the inconveniences.

arXiv:quant-ph/9801036•Jan 16, 1998•0 citations

On Probabilities in the Many Worlds Interpretation of Quantum Mechanics

Florian J. Boge

Quantum Mechanics notoriously faces a measurement problem, the problem that the unitary time evolution, encoded in its dynamical equations, together with the kinematical structure of the theory generally implies the non-existence \nof definite measurement outcomes. There have been multiple suggestions to solve this problem, among them the so called many worlds interpretation that originated with the work of Hugh Everett III. According to it, the quantum state and time evolution fully and accurately describe nature as it is, implying that under certain conditions multiple measurement outcomes that are seemingly mutually exclusive can be realized at the same time – but as different 'worlds' contained in a global, quantum mechanical structure, sometimes referred to as 'the multiverse'. The many worlds interpretation has, however, been confronted with serious difficulties over the course of its development, some of which were solved by the advent of decoherence theory. The present thesis critically investi- \ngates the state of play on a key remaining problem of the many worlds interpretation, the problem of the meaning and quantification of probabilities in a quantum multiverse. Recent attempts of deriving the pivotal statistical ingredient of quantum mechanics, Born’s rule, from either principles of decision theory or from quantum mechanics alone, supplemented with a few general premises about \nprobability are analyzed and their premises are scrutinized. It will be argued that, though both approaches yield promising results, they both ultimately fail \nto clearly establish the validity of Born’s rule in the context of the many worlds interpretation. It is hence suggested that further research on this problem is indicated.

•Apr 4, 2016•2 citations

Quantum Pessiland

Boyang Chen, Tomoyuki Morimae, Takashi Yamakawa

Pessiland is a world where NP is hard on average but one-way functions (OWFs) do not exist [Impagliazzo 1995]. Because almost all classical cryptographic primitives imply OWFs [Impagliazzo and Luby 1989], there is almost no classical cryptography in Pessiland. On the other hand, quantum cryptography can exist even when OWFs do not [Kretschmer 2021; Morimae and Yamakawa 2022; Ananth, Qian and Yuen 2022]. Is there a quantum analogue of Pessiland where NP is hard on average but even quantum cryptography does not exist? In this paper, we show that such a miserable world, Quantum Pessiland, exists: there is a quantum oracle relative to which $UP\cap coUP$ is hard on average against quantum polynomial-time algorithms with quantum advice, yet auxiliary-input EFI pairs do not exist. We also show that there is a classical oracle relative to which $UP\cap coUP$ is hard on average against quantum polynomial-time algorithms with quantum advice, yet classically-secure auxiliary-input one-way puzzles (OWPuzzs) do not exist. Almost all quantum cryptographic primitives imply EFI pairs or OWPuzzs, and therefore these results mean that there is almost no quantum cryptography relative to these oracles. We further show that relative to the classical oracle, SampBQP = SampBPP, and therefore there is no sampling-based quantum advantage in Quantum Pessiland. Finally, because our average-case hardness of $UP\cap coUP$ implies $P^{\#P}\not\subseteq i.o.BQP/qpoly$, our result also implies that a non-relativizing proof technique is necessary to construct OWPuzzs solely from $P^{\#P}\not\subseteq i.o.BQP/qpoly$, which gives a partial negative answer to the open problem of [Khurana and Tomer 2025].

quant-pharXiv:2608.29493•Sep 1, 2026•0 citations
Quantum Mechanics notoriously faces a measurement problem, the problem that the unitary time evolution, encoded in its dynamical equations, together with the kinematical structure of the theory generally implies the non-existence \nof definite measurement outcomes. There have been multiple suggestions to solve this problem, among them the so called many worlds interpretation that originated with the work of Hugh Everett III. According to it, the quantum state and time evolution fully and accurately describe nature as it is, implying that under certain conditions multiple measurement outcomes that are seemingly mutually exclusive can be realized at the same time – but as different 'worlds' contained in a global, quantum mechanical structure, sometimes referred to as 'the multiverse'. The many worlds interpretation has, however, been confronted with serious difficulties over the course of its development, some of which were solved by the advent of decoherence theory. The present thesis critically investi- \ngates the state of play on a key remaining problem of the many worlds interpretation, the problem of the meaning and quantification of probabilities in a quantum multiverse. Recent attempts of deriving the pivotal statistical ingredient of quantum mechanics, Born’s rule, from either principles of decision theory or from quantum mechanics alone, supplemented with a few general premises about \nprobability are analyzed and their premises are scrutinized. It will be argued that, though both approaches yield promising results, they both ultimately fail \nto clearly establish the validity of Born’s rule in the context of the many worlds interpretation. It is hence suggested that further research on this problem is indicated.
Pessiland is a world where NP is hard on average but one-way functions (OWFs) do not exist [Impagliazzo 1995]. Because almost all classical cryptographic primitives imply OWFs [Impagliazzo and Luby 1989], there is almost no classical cryptography in Pessiland. On the other hand, quantum cryptography can exist even when OWFs do not [Kretschmer 2021; Morimae and Yamakawa 2022; Ananth, Qian and Yuen 2022]. Is there a quantum analogue of Pessiland where NP is hard on average but even quantum cryptography does not exist? In this paper, we show that such a miserable world, Quantum Pessiland, exists: there is a quantum oracle relative to which UP∩coUPUP\cap coUPUP∩coUP is hard on average against quantum polynomial-time algorithms with quantum advice, yet auxiliary-input EFI pairs do not exist. We also show that there is a classical oracle relative to which UP∩coUPUP\cap coUPUP∩coUP is hard on average against quantum polynomial-time algorithms with quantum advice, yet classically-secure auxiliary-input one-way puzzles (OWPuzzs) do not exist. Almost all quantum cryptographic primitives imply EFI pairs or OWPuzzs, and therefore these results mean that there is almost no quantum cryptography relative to these oracles. We further show that relative to the classical oracle, SampBQP = SampBPP, and therefore there is no sampling-based quantum advantage in Quantum Pessiland. Finally, because our average-case hardness of UP∩coUPUP\cap coUPUP∩coUP implies P#P⊈i.o.BQP/qpolyP^{\#P}\not\subseteq i.o.BQP/qpolyP#P⊆i.o.BQP/qpoly, our result also implies that a non-relativizing proof technique is necessary to construct OWPuzzs solely from P#P⊈i.o.BQP/qpolyP^{\#P}\not\subseteq i.o.BQP/qpolyP#P⊆i.o.BQP/qpoly, which gives a partial negative answer to the open problem of [Khurana and Tomer 2025].