Izbrane teme sodobne fizike in matematike

Entanglement cooling algorithm

This paper studies entanglement dynamics in small N-qubit systems by combining theoretical analysis with numerical simulations of stochastic quantum circuits. Using the Schmidt decomposition and the Rényi entropy framework, bipartite entanglement is quantified. An entanglement "heating" procedure is implemented with random quantum gates, along with a Monte Carlo based "cooling" algorithm with Metropolis–Hastings acceptance criteria to reverse it. For systems with 2 ≤ N ≤ 6, it is found that reversibility depends critically on the gate set: the Clifford generators {CNOT, NOT, H} and {CNOT, H, S} enable complete entropy reduction, while universal sets do not. This indicates effective irreversibility despite underlying unitary dynamics of quantum circuits.

Algoritem za hlajenje prepletenih sistemov

V prispevku je preučevana dinamika kvantne prepletenosti v majhnih sistemih z N kubiti. S pomočjo Schmidtovega razcepa in Rényijevih entropij je kvantificirana prepletenost dveh podsistemov. S pomočjo stohastičnih kvantnih vezij je implementiran postopek "gretja" (višanja entropije) prepletenega sistema. Obratni proces je realiziran z algoritmom, ki implementira Metropolis–Hastingsov kriterij, in je zaradi zmožnosti zmanjšanja entropije imenovan "hlajenje". Za sisteme z 2 ≤ N ≤ 6 je pokazano, da je reverzibilnost odvisna od nabora kvantnih vrat: Cliffordovi generatorji {CNOT, NOT, H} in {CNOT, H, S} omogočajo popolno zmanjšanje entropije, medtem ko univerzalne množice tega ne omogočajo. Rezultati nakazujejo pojav efektivne ireverzibilnosti kljub unitarni dinamiki kvantnih vezij.