Quantum algorithms for grid-based variational time evolution

Abstract

The simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual reduction in circuit depth conferred by variational approaches, this algorithm also enjoys several advantages compared to previously proposed ones. For instance, variational approaches suffer from the need for a large number of measurements. However, the grid encoding of first quantized Hamiltonians only requires measuring in position and momentum bases, irrespective of the system size. Their combination with variational approaches is therefore particularly attractive. Moreover, heuristic variational forms can be employed to overcome the limitation of the hard decomposition of Trotterized first quantized Hamiltonians into quantum gates. We apply this quantum algorithm to the dynamics of several systems in one and two dimensions. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches. We show how they can be significantly attenuated through subspace diagonalization at a cost of an additional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mrow class="MJX-TeXAtom-ORD"><mml:mi class="MJX-tex-caligraphic" mathvariant="script">O</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>M</mml:mi><mml:msup><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math> 2-qubit gates where <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>M</mml:mi></mml:math> is the number of dimensions and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msup><mml:mi>N</mml:mi><mml:mi>M</mml:mi></mml:msup></mml:math> is the total number of grid points.