Algorithm of Reduction
N. K. Solovarov
Abstract
We show that the von Neumann's algorithm of reduction (i.e. the algorithm of calculating the density matrix of the observable subsystem from the density matrix of the closed quantum system) corresponds to the special approximation at which the unobservable subsystem is supposed to be in the steady state of minimum information (infinite temperature). We formulate the generalized algorithm of reduction that includes as limiting cases the von Neumann's reduction and the self-congruent correlated reduction most corresponding to the quantum nondemolition measurement. We demonstrate the correlation in dynamics of subsystems with exactly soluble models of quantum optics: 1) about the dynamics of a pair of interacting two-level atoms, and 2) about the dynamics of a two-level atom interacting with a single-mode resonant field.
Create a lesson
Related papers
Parallel quantum channel discrimination and numerical ranges in tensor product subspaces
Adam Bílek, Paulina Lewandowska, Ryszard Kukulski
Asymptotically Good Quantum Locally Testable Codes
William Gay, Fernando Granha Jeronimo
All causally separable quantum processes are quantum circuits with classical control of causal order
Julian Wechs, Alastair A. Abbott, Cyril Branciard
Analytic leakage suppression with a single control field: fast two-qubit gates with tunable couplers
Lukas Heunisch, Michael J. Hartmann, Aashish A. Clerk
Procrastinating einselection in non-Markovian quantum dynamics
Michael J. Moody, Tara Kalsi, Agung Budiyono et al.
Quantum Entropy Contraction and Factorization from Hypercontractivity
Li Gao, Lijun Wang