There Are No Easy Paths in Quantum Computing ✛

Original: "Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics"
· Brian Barch, Daniel Lidar
arXiv:2506.03435v2 · 2025-06-03 · CC BY 4.0 · 1 min
Irreversible operations could make a quantum computer all-powerful, but their ease contradicts the laws of nature.

Quantum computers dance a reversible waltz: step forward — step back, and the system returns to its starting point. But in some processes, the dancer vanishes into darkness, never to return. Such irreversible steps add entropy to the system — a measure of irreversible disorder. If a quantum computer could easily perform such tricks, it would solve problems that would take ordinary machines an eternity. This would violate all known rules of computational complexity. Yet the same logic suggests: there are no easy paths. Strikingly, a similar irreversible loss of information occurs with black holes, and this puzzle forced Hawking to reconsider his own views. Nature abhors a free lunch — even in the quantum world.

Reversibility in quantum computing isn't a whim; it follows from energy conservation — a principle that has held true from steam engines to modern times.

H = i\sigma_z
Non-Hermitian Hamiltonian that suppresses the |1⟩ component as e^{-2t} over time t.
Scientists
Ludwig BoltzmannRudolf ClausiusJacob BekensteinStephen HawkingJames Clerk MaxwellDavid Deutsch
Concepts
complexity quantum calculation hybrid algorithm ibm quantum processor memory computational cost single qubit operation computational power hybrid approach numerical simulation hamiltonian gpu scaling classical limit Hilbert space computer simulation superconducting qubit quantum computation scalable quantum computer supercomputer