⚛️ quantum physics

Quantum Suicide in Many-Worlds Implies P=NP

This paper proposes a hypothetical algorithm that claims to solve NP problems in polynomial time by leveraging the Many-Worlds Interpretation of quantum mechanics, effectively wagering the existence of all observers on the theory's validity.

Original authors: Veronika Baumann, Alberto Rolandi

Published 2026-04-01

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Veronika Baumann, Alberto Rolandi

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Idea: Solving the Unsolvable by Betting Your Life

Imagine you are trying to solve a massive, impossible puzzle. In the world of computer science, this is known as an NP problem. These are problems where checking if an answer is right is easy (like checking a math homework answer), but finding the answer from scratch is incredibly hard. It usually takes a computer billions of years to guess the right combination.

The famous question in computer science is: Can we find these answers quickly (in polynomial time), or is it just impossible? (This is the P vs. NP problem).

This paper proposes a crazy, "totally serious" (according to the authors' sarcasm) way to solve these problems instantly. But there is a catch: You have to be willing to gamble the lives of everyone in the universe.

The Setup: The "Quantum Lottery"

To understand this, we need two ingredients:

The Many-Worlds Interpretation: This is a theory in quantum physics that says every time a quantum event happens with multiple possible outcomes, the universe splits. If you flip a coin, in one universe it lands on Heads, and in another, it lands on Tails. Both universes exist simultaneously.
Quantum Suicide: This is a famous thought experiment. Imagine a gun that fires based on a quantum coin flip. If it's Heads, you die. If it's Tails, you live.
- In the "Heads" universe, you are dead and feel nothing.
- In the "Tails" universe, you are alive and feel lucky.
- The Catch: From your perspective, you can only experience the universe where you are alive. If you keep flipping the coin, you will eventually find yourself in a universe where you got "lucky" every single time, even though the odds were against you. This is called Quantum Immortality.

The Algorithm: The "Doomsday Machine"

The authors propose a machine that combines these two ideas to solve the impossible puzzle. Here is how it works, step-by-step:

1. The Random Guess
The machine generates a random guess for the solution to the NP problem. Since there are billions of possibilities, the chance of guessing right on the first try is like winning the lottery every day for a year.

2. The Verification
The machine quickly checks if the guess is correct.

If the guess is WRONG: The machine triggers a "Doomsday Channel." This is a mechanism that instantly kills every observer in the universe.
If the guess is RIGHT: The machine does nothing. Everyone stays alive.

3. The Split
Because of the Many-Worlds theory, the universe splits into two branches:

Branch A (The Wrong Guess): The guess was wrong. The machine kills everyone. In this branch, there are no observers left to see the result.
Branch B (The Right Guess): The guess was right. The machine does nothing. Everyone survives.

4. The Result
Here is the mind-bending part: You can only experience the branch where you are alive.

Even though the odds of guessing the right answer were 1 in a billion, the "Dead" branches cease to have any observers to experience them. The only branch where "someone" is left to look at the results is the one where the machine got lucky and guessed the answer correctly on the very first try.

The Conclusion: P = NP (But at a Cost)

If you run this experiment, the surviving observers will look at the machine and say, "Wow! We solved this impossible problem instantly! It must be that P = NP!"

To them, it looks like magic. They have found a shortcut to solving the hardest problems in the universe.

However, the paper points out the terrible price:

The "Cost" isn't time: Usually, we say solving these problems takes too much time.
The "Cost" is bodies: In this scenario, the "time" is saved, but the cost is shifted to the body count.
In the 99.999...% of universes where the guess was wrong, everyone died. The "efficiency" of the algorithm is achieved by deleting every universe where the answer was wrong.

The Punchline

The paper is a piece of scientific satire. The authors are using a "reductio ad absurdum" argument (proving something is false by showing how ridiculous its consequences are).

They are essentially saying: "If you believe the Many-Worlds interpretation is true, then you could technically solve any problem instantly by threatening to kill everyone in the universe if you're wrong. Since that is obviously an unacceptable price, it highlights the strange and perhaps problematic nature of applying the Many-Worlds theory to real-world decision-making."

In short: The paper argues that you could prove P=NP, but only if you are willing to bet the existence of the entire human race on a quantum coin flip. Since no one would actually do that, it remains a thought experiment rather than a real solution.

Based on the provided text, here is a detailed technical summary of the paper "Quantum Suicide in Many-Worlds Implies P=NP" by Veronika Baumann and Alberto Rolandi.

Important Context: The paper is a satirical work (indicated by the April 1st, 2026 date, the footnote stating "These authors are equally to blame," and the humorous acknowledgments). It uses a serious academic tone to explore a "thought experiment" that relies on a highly controversial interpretation of quantum mechanics to solve a major computer science problem.

1. Problem Statement

The paper addresses the P vs. NP problem, one of the most significant open questions in computer science.

The Core Question: Can every problem whose solution can be verified in polynomial time (NP) also be solved in polynomial time (P)?
Current State: It is generally believed that $P \neq NP$ . While verifying a solution to an NP problem (like integer factorization) is efficient (polynomial time), finding the solution typically requires checking an exponential number of candidates, resulting in exponential time complexity.
The Goal: The authors propose an algorithm that would solve any NP problem in polynomial time, effectively proving $P=NP$, by exploiting specific interpretations of quantum mechanics.

2. Methodology: The "Doomsday Algorithm"

The proposed methodology combines Quantum Computing, the Many-Worlds Interpretation (MWI) of quantum mechanics, and the Quantum Suicide thought experiment.

A. Theoretical Foundation

Many-Worlds Interpretation (MWI): Posits that all possible outcomes of a quantum measurement occur in separate, non-communicating branches of the universe.
Quantum Suicide/Immortality: A thought experiment where an observer is linked to a quantum event with a lethal outcome. Under MWI, the observer subjectively only experiences the branches where they survive. Even if the probability of survival is infinitesimally small, there exists a branch where the observer survives every repetition of the experiment.
Post-Selection: The algorithm relies on the subjective post-selection of the "surviving" branch of the wavefunction.

B. The Algorithm Steps

The authors define a quantum circuit involving three main components:

System ( $S$ ): Encodes all possible candidate solutions ( $2^n$ bit strings) for an NP problem.
Ancilla ( $A$ ): A qubit that acts as a flag, set to $|1\rangle$ if the candidate solution is correct, and $|0\rangle$ otherwise.
Observer State ( $\hat{\rho}$ ): The quantum state representing all observers in the universe.

The Procedure:

Superposition: The system $S$ is initialized into a uniform superposition of all possible $n$ -bit strings (all candidate solutions).
Verification Unitary ( $U$ ): A polynomial-time quantum oracle checks each candidate. It flips the ancilla $A$ $A$ to $|1\rangle$ $∣1 ⟩$ if the candidate $s$ $s$ is the correct solution ( $s^*$ $s^{*}$ ), and leaves it at $|0\rangle$ $∣0 ⟩$ otherwise.
- The state becomes a superposition of: (Correct Solution $\otimes$ $|1\rangle_A$ ) + (All Wrong Solutions $\otimes$ $|0\rangle_A$ ).
The Doomsday Channel ( $D$ ): This is the critical, lethal step.
- The channel is controlled by the ancilla $A$ .
- If $A = |0\rangle$ (wrong solution), the channel triggers a "Doomsday" event (e.g., via Maxwell's demon) that annihilates all observers in that branch of the universe.
- If $A = |1\rangle$ (correct solution), the channel does not trigger, and observers remain alive.
Post-Selection: The algorithm is analyzed from the perspective of the observers. Since the branches where observers die contain no one to observe the result, the only branch where an observer can exist to report the outcome is the one where $A=|1\rangle$ .

3. Key Contributions

Algorithmic Proposal: The paper formally defines a quantum algorithm that solves NP problems in polynomial time ( $O(n^k)$ ) by shifting the computational cost from time to "observer survival."
The "Lucky Guess" Mechanism: It reframes the "lucky guess" (finding the solution on the first try) not as a statistical anomaly, but as a deterministic outcome for any surviving observer in a Many-Worlds universe.
Inter-subjective Consensus: The authors argue that because all surviving observers in the universe would find themselves in the "correct solution" branch, they would unanimously conclude that $P=NP$. This consensus would be indistinguishable from an objective proof of $P=NP$.

4. Results

Complexity: The algorithm runs in polynomial time relative to the input size. The verification step is polynomial, and the "Doomsday" operation is assumed to be $O(1)$ .
Outcome: In the branch of the wavefunction where observers survive, the system $S$ is measured to contain the unique solution $s^*$ .
Cost: The "cost" of this efficiency is the annihilation of all observers in the $2^n - 1$ branches where the wrong solution was guessed. The exponential complexity is not eliminated but displaced from runtime to body count.

5. Significance and Conclusion

Theoretical Implication: If the Many-Worlds Interpretation is correct and "Quantum Immortality" holds, then $P=NP$ is effectively true for any conscious observer. The paper suggests that the difficulty of NP problems is an artifact of the "survivor bias" of the observer.
Ethical/Philosophical Warning: The paper concludes with a stark caveat: solving NP problems efficiently in this manner requires a willingness to "wager the fate of all observers in the universe." The algorithm is "efficient" only if one accepts the destruction of the vast majority of reality.
Satirical Nature: The paper serves as a critique of the "Many-Worlds" interpretation's implications for probability and decision theory. It highlights the absurdity of using observer survival as a computational resource. The authors explicitly state in the acknowledgments that "Only humans would be deranged enough to write what we did here," confirming the satirical intent.

Summary: The paper proposes a "Doomsday Algorithm" that uses the Many-Worlds Interpretation to post-select the branch of reality where a correct solution to an NP problem is found on the first try. While this theoretically proves $P=NP$ for surviving observers, it necessitates the extinction of observers in all other branches, effectively trading computational time for the existence of life.