SearcharxivSearch

arXiv subjects

Leonhard Richter

Publications and source records attributed to Leonhard Richter.

3 recordsLinked to original sources

The Floquet-Magnus expansion of unbounded operators

The Floquet-Magnus expansion is a widely used tool to derive effective descriptions of time-periodic quantum systems by approximating their dynamics with a time-independent Hamiltonian. However, its standard formulation is, strictly speaking, restricted to bounded Hamiltonians. In this work, we extend its definition and analysis to a broad class of time-periodic unbounded Hamiltonians. Our approach is based on an a priori distinct nonperturbative framework for the construction of effective Hamiltonians, which we show to reproduce the Floquet-Magnus expansion. A particular strength of our framework is that it allows us to prove that the resulting effective dynamics approximates the original time evolution propagators to arbitrary order in the high-frequency limit without requiring convergence of the Floquet-Magnus expansion, a condition that is already highly restrictive even in the bounded setting. We illustrate the scope of the method on representative models: the quantum Rabi Hamiltonian in the interaction picture, and the periodically driven quantum harmonic oscillator.

math-ph

Quantifying the rotating-wave approximation of the Dicke model

We analytically find quantitative, non-perturbative bounds to the validity of the rotating-wave approximation (RWA) for the multi-atom generalization of the quantum Rabi model: the Dicke model. Precisely, we bound the norm of the difference between the evolutions of states generated by the Dicke model and its rotating-wave approximated counterpart, that is, the Tavis-Cummings model. The intricate role of the parameters of the model in determining the bounds is discussed and compared with numerical results. Our bounds are intrinsically state-dependent and, in particular, capture a nontrivial dependence on the total angular momentum of the initial state; this behaviour also seems to be confirmed by accompanying numerical results.

quant-ph

Graph-controlled Permutation Mixers in QAOA for the Flexible Job-Shop Problem

One of the most promising attempts towards solving optimization problems with quantum computers in the noisy intermediate scale era of quantum computing are variational quantum algorithms. The Quantum Alternating Operator Ansatz provides an algorithmic framework for constrained, combinatorial optimization problems. As opposed to the better known standard QAOA protocol, the constraints of the optimization problem are built into the mixing layers of the ansatz circuit, thereby limiting the search to the much smaller Hilbert space of feasible solutions. In this work we develop mixing operators for a wide range of scheduling problems including the flexible job shop problem. These mixing operators are based on a special control scheme defined by a constraint graph model. After describing an explicit construction of those mixing operators, they are proven to be feasibility preserving, as well as exploring the feasible subspace.

quant-ph