What If You Could Solve the Hardest Problem in Mathematics by Playing the Piano?
A theoretical framework combining qutrit quantum computing, Euler's Tonnetz, and the P vs. NP problem into one impossible instrument.
The P versus NP problem has been open since 1971. It sits at the foundation of theoretical computer science, carries a one-million-dollar Millennium Prize, and remains one of the most consequential unsolved questions in mathematics.
The question is deceptively simple: if a solution to a problem can be quickly verified, can it also be quickly found?
Nobody knows. And the gap between those two things, between finding and checking, is where one of the most counterintuitive machines imaginable becomes worth thinking about.
Three fields that have never spoken to each other
The Harmonic Qutrit is a theoretical supercomputer shaped like a piano.
It draws from three separate scientific domains that have never been formally connected: qutrit quantum computing, the Subset Sum Problem in computational complexity theory, and neo-Riemannian music theory, specifically the harmonic lattice known as the Tonnetz.
Each of these is real. The connection between them is the invention.
Qutrits: beyond the binary
Classical computers operate in binary. Every piece of information is a 0 or a 1. Quantum computers introduced the qubit, which exploits superposition to exist as both states simultaneously.
Qutrits extend this to three states: 0, 1, and 2.
The state designated as 2 is structurally distinct from the others. It does not sit on the same logical line as 0 and 1. When a qutrit enters state 2, its underlying binary value becomes open rather than false.
The computation can re-evolve from that point without retracing already-rejected branches. A ten-qutrit register represents 59,049 simultaneous states. Ten qubits manage 1,024.
Researchers at Berkeley and the University of Innsbruck have already built working qutrit processors using superconducting circuits.
The theoretical efficiency advantage of base-3 over base-2 logic is grounded in the mathematical constant e, which makes the integer 3 the most storage-efficient integer base for information representation.
The Subset Sum Problem
The Subset Sum Problem asks a question that sounds straightforward: given a set of integers, does any subset of them add to a specific target value? For small sets this is trivial.
For large sets the number of possible subsets grows at an exponential rate that makes exhaustive search computationally intractable on any classical machine.
This is what makes it NP-complete. Verifying a correct answer takes polynomial time. Finding one, without already knowing it, may take exponential time.
The Subset Sum Problem is one of the central examples in the P vs. NP question. If a machine could solve it efficiently, it would collapse the distinction between the two complexity classes and resolve the Millennium Problem.
Euler's Tonnetz and the geometry of consonance
In 1739, Leonhard Euler published a harmonic lattice he called the Tonnetz, German for tone network.
It maps all twelve pitch classes of the chromatic scale onto a two-dimensional plane, with movement along its axes corresponding to perfect fifths and major and minor thirds.
Under the 12-tone equal temperament system that has governed Western music for three centuries, this plane wraps onto a torus.
The critical property of the Tonnetz, formalized by music theorist Richard Cohn in the 1990s, is that consonant chords form closed geometric shapes on this surface.
A major triad is a closed triangle. A dissonant chord has an open extension, an unresolved geometric tail. Consonance is not a subjective preference.
It is a topological property of the surface on which the pitch classes live.
Peter Schat's Tone Clock maps the same geometry onto a 12-point circular face, treating each semitone as a 30-degree rotation and each triad as a measurable angular configuration.
Both frameworks express the same underlying mathematics from different vantage points.
How the machine works
The Supercomputer Piano assigns each integer in the problem set to a qutrit and to a corresponding pitch class on the Tonnetz.
The full register is initialised in the qutrit state 2, the open state, representing a fully undecided subset.
As the operator plays the keyboard, specific qutrits collapse from state 2 into state 0 (excluded) or state 1 (included). Each active combination of included elements generates a chord composed of those elements’ pitch classes.
The machine plays that chord through the Tonnetz geometry.
When the chord forms a closed shape on the Tonnetz, that is, when it sounds harmonically resolved to a trained or even an untrained ear, the harmonic oracle activates.
The included elements are verified as a valid subset. The mathematical problem is confirmed by the music.
The feedback loop runs in the opposite direction too. A dissonant result, an open shape on the Tonnetz, signals that the current subset is not a solution.
The Value 2 layer of the qutrit register resets those states to open and the operator continues navigating.
The search space is explored not by enumeration but by play.
Homometric sets and the Z-relation
The music theory concept underlying the verification layer is called the Z-relation, also known as homometry.
Two chords are homometric if they share the same distribution of intervals between their elements, even if they contain different notes and produce different textures.
The human auditory system processes this interval structure with what researchers describe as minimal entropy, which is the basis of the claim that a valid subset will always feel resolved when expressed as a chord.
This is the invented bridge. The connection between interval conservation in music theory and subset validity in computational complexity theory is the leap the machine takes.
It is the part that does not exist yet and may never exist. Everything surrounding it is real.
Why this matters even if it never gets built
The Harmonic Qutrit is not a practical proposal. It is a thought experiment built from accurate science, pushed to the boundary of what the science allows and one step beyond. That step is clearly marked.
What the thought experiment demonstrates is that three fields, quantum computing, computational complexity theory, and music theory, share a geometric substrate they have never been introduced to.
The Tonnetz and the qutrit state space are both toroidal structures. The Subset Sum Problem and the question of harmonic closure are both asking whether a set is complete.
These are not loose analogies. They are structural correspondences that nobody has formally mapped.
Whether a machine that exploits these correspondences could ever be built is a separate question. The correspondences themselves are worth knowing about.