Mini

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 · Quantum Physics Computational Complexity
Irreversible operations could make a quantum computer all-powerful, but their ease contradicts the laws of nature.
Links in the knowledge graph 1

In the quantum world, not all operations can be undone. Scientists have found that if irreversible steps were easy, a computer would gain the power to instantly crack any encryption. But nature imposes a hard barrier, so there are no simple loopholes.

🎯 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.

Scientists
Stephen HawkingJacob BekensteinAlbert EinsteinFritz ZwickyVera RubinEmmy Noether
Tags
entropy Standard Model black hole
Laws
second law of thermodynamicsHawking radiationgravitational lensingNoether's theoremBekenstein-Hawking entropyEinstein field equations
Original: arXiv:2506.03435v2 · CC BY 4.0 · bridge42worlds