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:2505.15887 · Physical Review A

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

Jake Xuereb

Published Dec 4, 2025• 0 citations
arXivHTMLPDF

Abstract

We demonstrate how a single heat exchange between a probe thermal qubit and multiqubit thermal machine encoding a Boolean function can determine whether the function is balanced or constant, thus providing a thermodynamic solution to the Deutsch-Jozsa problem. We introduce a thermodynamic model of quantum query complexity, showing how qubit thermal machines can act as oracles, queried via heat exchange with a probe. While the Deutsch-Jozsa problem requires an exponential encoding in the number of oracle bits, we also explore a restricted Bernstein-Vazirani problem, which admits a linear thermal oracle and a single thermal query solution. We establish bounds on the number of samples needed to determine the probe temperature encoding the solution for the Deutsch-Jozsa problem, showing that it remains constant with problem size. Additionally, we propose a proof-of-principle experimental implementation to solve the three-bit Bernstein-Vazirani problem via thermal kickback. This work bridges thermodynamics and complexity theory, suggesting that quantum thermodynamics could provide an unconventional route to computing beyond classical computation.

DOI
10.1103/qky6-2bfs

Related papers

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

Ridha Horchani

We show that the readout analysis in Phys. Rev. A 113, 012420 (2026) does not establish the claimed resource accounting of one thermal query followed by many statistically useful probe samples. A CNOT fanout of a diagonal post-query probe broadcasts its one-qubit marginal but produces perfectly correlated registers rather than independent copies. Consequently, neither the trace distance nor the relative entropy between the balanced and constant hypotheses increases, and repeated measurements of the ancillas provide only one Bernoulli observation. Independent samples instead require repeated preparation and heat exchange, which are repeated queries under the definition adopted in the original paper. We also show that the sample lower bound stated there does not follow from Pinsker's inequality: the inequality gives the opposite ordering for the reciprocal relative entropy. The thermal-kickback mechanism may still encode the decision in the probe temperature, but the one-query readout claim and the quoted necessity of approximately 116 samples require correction.

quant-pharXiv:2607.11911•Jul 7, 2026•0 citations

Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms

Niklas Johansson, Jan-Åke Larsson

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack efficient classical solutions. Here we present a framework that can simulate both quantum algorithms efficiently, solving the Deutsch–Jozsa problem with probability 1 using only one oracle query, and Simon’s problem using linearly many oracle queries, just as expected of an ideal quantum computer. The presented simulation framework is in turn efficiently simulatable in a classical probabilistic Turing machine. This shows that the Deutsch–Jozsa and Simon’s problem do not require any genuinely quantum resources, and that the quantum algorithms show no speed-up when compared with their corresponding classical simulation. Finally, this gives insight into what properties are needed in the two algorithms and calls for further study of oracle separation between quantum and classical computation.

arXiv:1508.05027•Quantum Information Processing•Aug 12, 2017•29 citations

Efficient algorithms for the Deutsch-Jozsa and Simon's problems that only use classical resources

Niklas Johansson, Jan-Åke Larsson

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch-Jozsa and Simon's problem, both efficiently solvable on a quantum Turing machine, and both believed to lack efficient classical solutions. Here we present a framework that can simulate both quantum algorithms efficiently, solving the Deutsch-Jozsa problem with probability 1 using only one oracle query, and Simon's problem using linearly many oracle queries, just as expected of an ideal quantum computer. The presented simulation framework is in turn efficiently simulatable in a classical probabilistic Turing machine. This shows that the Deutsch-Jozsa and Simon's problem do not require any genuinely quantum resources, and that the quantum algorithms show no speed-up when compared with their corresponding classical simulation. Finally, this gives insight into what properties are needed in the two algorithms, and calls for further study of oracle separation between quantum and classical computation.

•Aug 20, 2015•1 citation

Generalization of the Deutsch algorithm using two qudits

Jose Luis Cereceda

Deutsch's algorithm for two qubits (one control qubit plus one auxiliary qubit) is extended to two $d$-dimensional quantum systems or qudits for the case in which $d$ is equal to $2^n$, $n=1,2,...$ . This allows one to classify a certain oracle function by just one query, instead of the $2^{n-1}+1$ queries required by classical means. The given algorithm for two qudits also solves efficiently the Bernstein-Vazirani problem. Entanglement does not occur at any step of the computation.

arXiv:quant-ph/0407253•Jul 29, 2004•7 citations

Discrimination of unitary transformations in the Deutsch-Jozsa algorithm: Implications for thermal-equilibrium-ensemble implementations

David C. Collins

A general framework for regarding oracle-assisted quantum algorithms as tools for discriminating among unitary transformations is described. This framework is applied to the Deutsch-Jozsa problem and all possible quantum algorithms which solve the problem with certainty using oracle unitaries in a particular form are derived. It is also used to show that any quantum algorithm that solves the Deutsch-Jozsa problem starting with a quantum system in a particular class of initial, thermal equilibrium-based states of the type encountered in solution-state NMR can only succeed with greater probability than a classical algorithm when the problem size $n$ exceeds $~{10}^{5}.$

arXiv:1002.4227•Physical Review A•May 19, 2010•5 citations

Thermodynamic Proof of Quantumness without Structure

Florian Meier, Hayata Yamasaki

Demonstrating that a machine performs genuinely quantum operations is a central challenge in quantum information processing. Existing proofs of quantumness typically rely on computational tasks that are infeasible for classical machines under assumptions such as computational hardness, or explicit bounds on classical runtime, memory, or oracle queries. Here we introduce an alternative paradigm: a thermodynamic proof of quantumness based on energy consumption. Using the search problem of Yamakawa and Zhandry with a structureless uniformly random oracle, we show that any classical machine solving the task with constant success probability must generate entropy that grows exponentially with the security parameter. By Landauer's principle, this implies an exponential lower bound on heat dissipation and hence on the energy consumption of any cyclic classical implementation. In contrast, the corresponding quantum prover solves the task with polynomial query and gate complexity, giving polynomial energy consumption under standard assumptions for quantum implementations. Thus, in the random-oracle setting, sufficiently low energy consumption in a successful implementation certifies quantumness through a macroscopic thermodynamic observation of energy consumption.

quant-pharXiv:2609.25211•Sep 23, 2026•0 citations
We demonstrate how a single heat exchange between a probe thermal qubit and multiqubit thermal machine encoding a Boolean function can determine whether the function is balanced or constant, thus providing a thermodynamic solution to the Deutsch-Jozsa problem. We introduce a thermodynamic model of quantum query complexity, showing how qubit thermal machines can act as oracles, queried via heat exchange with a probe. While the Deutsch-Jozsa problem requires an exponential encoding in the number of oracle bits, we also explore a restricted Bernstein-Vazirani problem, which admits a linear thermal oracle and a single thermal query solution. We establish bounds on the number of samples needed to determine the probe temperature encoding the solution for the Deutsch-Jozsa problem, showing that it remains constant with problem size. Additionally, we propose a proof-of-principle experimental implementation to solve the three-bit Bernstein-Vazirani problem via thermal kickback. This work bridges thermodynamics and complexity theory, suggesting that quantum thermodynamics could provide an unconventional route to computing beyond classical computation.
We show that the readout analysis in Phys. Rev. A 113, 012420 (2026) does not establish the claimed resource accounting of one thermal query followed by many statistically useful probe samples. A CNOT fanout of a diagonal post-query probe broadcasts its one-qubit marginal but produces perfectly correlated registers rather than independent copies. Consequently, neither the trace distance nor the relative entropy between the balanced and constant hypotheses increases, and repeated measurements of the ancillas provide only one Bernoulli observation. Independent samples instead require repeated preparation and heat exchange, which are repeated queries under the definition adopted in the original paper. We also show that the sample lower bound stated there does not follow from Pinsker's inequality: the inequality gives the opposite ordering for the reciprocal relative entropy. The thermal-kickback mechanism may still encode the decision in the probe temperature, but the one-query readout claim and the quoted necessity of approximately 116 samples require correction.
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack efficient classical solutions. Here we present a framework that can simulate both quantum algorithms efficiently, solving the Deutsch–Jozsa problem with probability 1 using only one oracle query, and Simon’s problem using linearly many oracle queries, just as expected of an ideal quantum computer. The presented simulation framework is in turn efficiently simulatable in a classical probabilistic Turing machine. This shows that the Deutsch–Jozsa and Simon’s problem do not require any genuinely quantum resources, and that the quantum algorithms show no speed-up when compared with their corresponding classical simulation. Finally, this gives insight into what properties are needed in the two algorithms and calls for further study of oracle separation between quantum and classical computation.
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch-Jozsa and Simon's problem, both efficiently solvable on a quantum Turing machine, and both believed to lack efficient classical solutions. Here we present a framework that can simulate both quantum algorithms efficiently, solving the Deutsch-Jozsa problem with probability 1 using only one oracle query, and Simon's problem using linearly many oracle queries, just as expected of an ideal quantum computer. The presented simulation framework is in turn efficiently simulatable in a classical probabilistic Turing machine. This shows that the Deutsch-Jozsa and Simon's problem do not require any genuinely quantum resources, and that the quantum algorithms show no speed-up when compared with their corresponding classical simulation. Finally, this gives insight into what properties are needed in the two algorithms, and calls for further study of oracle separation between quantum and classical computation.
Deutsch's algorithm for two qubits (one control qubit plus one auxiliary qubit) is extended to two ddd-dimensional quantum systems or qudits for the case in which ddd is equal to 2n2^n2n, n=1,2,...n=1,2,...n=1,2,... . This allows one to classify a certain oracle function by just one query, instead of the 2n−1+12^{n-1}+12n−1+1 queries required by classical means. The given algorithm for two qudits also solves efficiently the Bernstein-Vazirani problem. Entanglement does not occur at any step of the computation.
A general framework for regarding oracle-assisted quantum algorithms as tools for discriminating among unitary transformations is described. This framework is applied to the Deutsch-Jozsa problem and all possible quantum algorithms which solve the problem with certainty using oracle unitaries in a particular form are derived. It is also used to show that any quantum algorithm that solves the Deutsch-Jozsa problem starting with a quantum system in a particular class of initial, thermal equilibrium-based states of the type encountered in solution-state NMR can only succeed with greater probability than a classical algorithm when the problem size nnn exceeds  105.~{10}^{5}. 105.
Demonstrating that a machine performs genuinely quantum operations is a central challenge in quantum information processing. Existing proofs of quantumness typically rely on computational tasks that are infeasible for classical machines under assumptions such as computational hardness, or explicit bounds on classical runtime, memory, or oracle queries. Here we introduce an alternative paradigm: a thermodynamic proof of quantumness based on energy consumption. Using the search problem of Yamakawa and Zhandry with a structureless uniformly random oracle, we show that any classical machine solving the task with constant success probability must generate entropy that grows exponentially with the security parameter. By Landauer's principle, this implies an exponential lower bound on heat dissipation and hence on the energy consumption of any cyclic classical implementation. In contrast, the corresponding quantum prover solves the task with polynomial query and gate complexity, giving polynomial energy consumption under standard assumptions for quantum implementations. Thus, in the random-oracle setting, sufficiently low energy consumption in a successful implementation certifies quantumness through a macroscopic thermodynamic observation of energy consumption.