There Are No Easy Paths in Quantum Computing ⚡ экспресс
Non-Hermitian quantum systems, where states lose their normalization, have been studied for potential computational advantages. It turned out that with polynomial resources, they can perform postselection—picking out extremely unlikely outcomes, equivalent to the complexity class PP, which is considered infeasible. It’s like an ordinary compass suddenly pointing to buried treasure. This makes real-world scalable advantages doubtful. Moreover, it’s been shown that if the ‘purified’ model belongs to an efficiently simulable class (say, Clifford circuits), tossing in non-Hermiticity offers no computational benefit.
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.