← Latest papers
⚛️ quantum physics

Comment on Temperature change can solve the Deutsch-Jozsa problem: An exploration of thermodynamic query complexity

This paper refutes the claim that a single thermal query followed by multiple probe samples can solve the Deutsch-Jozsa problem, demonstrating that the proposed readout mechanism fails to generate independent samples due to perfect correlations and that the cited sample lower bound is mathematically invalid.

Original authors: Ridha Horchani

Published 2026-07-15
📖 4 min read🧠 Deep dive

Original authors: Ridha Horchani

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

Imagine you're trying to solve a tricky logic puzzle called the Deutsch–Jozsa problem. In a recent study, researchers proposed a clever way to solve it using a "thermal machine"—basically, a tiny heat engine that acts like a magical oracle. The idea was that you could ask this machine one single question (a "thermal query"), get a result, and then copy that result over and over again to get a huge pile of data without asking the machine any more questions. They claimed this would let you solve the puzzle with just one heat exchange and a bunch of extra samples, needing about 116 measurements to be sure.

But a new paper by Ridha Horchani says, "Hold on a minute! That math doesn't quite add up."

Here's the scoop on what went wrong, explained with a few fun analogies.

The "Magic Copy Machine" That Wasn't

The original plan relied on a trick called a "CNOT fanout." Think of the probe qubit (the tiny particle that talks to the heat machine) as a single, magical coin that lands on Heads or Tails. The researchers thought they could use a special gate (a CNOT) to copy this coin's result onto 100 other empty coins (ancillas) instantly. They believed that once copied, they could measure all 100 coins independently to get 100 separate pieces of data.

Horchani points out that this is like trying to photocopy a secret message by shining a light on it. When you shine the light, the original and the copy are perfectly linked. If the original coin is Heads, every single copy is Heads. If the original is Tails, every single copy is Tails.

You don't get 100 independent guesses; you get one single guess that has been shouted 100 times. It's like having one person whisper a secret to a room of 100 people, and then asking everyone what they heard. If the first person heard "Yes," everyone says "Yes." If they heard "No," everyone says "No." You haven't gathered 100 new opinions; you've just confirmed the one original opinion 100 times. Because of this, the "trace distance" and "relative entropy" (which are fancy math ways of measuring how different two possibilities are) don't get any bigger just because you made copies. You still only have one piece of information.

The "Reset and Repeat" Trap

So, how do you get real, independent data? The paper suggests you'd have to reset the whole machine, cool it down, and ask the heat oracle a new question. But here's the catch: the original paper defined a "query" as the act of exchanging heat with the machine.

If you want 100 independent samples, you can't just copy the first one. You have to go back to the machine and exchange heat 100 more times. That means you've actually performed 100 queries, not one. The "one query, many samples" dream is busted because getting independent data requires repeated visits to the heat machine, which counts as repeated queries.

The Math Mix-Up

There's a second issue with the numbers. The original paper claimed that to be 90% sure (with an error rate of 0.1), you'd need at least 116 samples. They tried to prove this using a famous math rule called Pinsker's inequality.

Horchani shows that they used the inequality backward. It's like trying to prove you need at least 50 dollars to buy a toy by saying, "The toy costs at most 50 dollars." That doesn't prove you need a minimum of 50; it just sets a ceiling. The math in the original paper actually suggests the opposite of what they claimed. The number 116 isn't a hard lower limit derived from that inequality; it's an unsupported guess based on a misapplied formula.

The Bottom Line

Does this mean the whole idea of using heat to solve logic puzzles is dead? Not at all! The paper admits that the "thermal kickback" mechanism might still work to encode the answer in the temperature of the probe. The physics of the heat exchange itself seems fine.

However, the specific claim that you can solve the problem with one thermal query followed by many useful samples is incorrect. You can't get more information out of a single heat exchange than what that one exchange gives you. To get the data you need, you have to keep asking the machine questions, which means the "resource accounting" (counting how many queries you used) needs to be corrected. The magic "one-and-done" shortcut doesn't exist, and the specific number of 116 samples isn't the rock-solid limit the original authors thought it was.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →