Simulating nonlinear classical dynamics on a quantum computer is an inherently challenging task due to the linear operator formulation of quantum mechanics. In this work, we provide a systematic approach to alleviate this difficulty by developing an explicit quantum algorithm that implements the time evolution of a second-order time-discretized version of the Lorenz model. The Lorenz model is a celebrated system of nonlinear ordinary differential equations that has been extensively studied in the contexts of climate science, fluid dynamics, and chaos theory. Our algorithm possesses a recursive structure and requires only a linear number of copies of the initial state with respect to the number of integration time-steps. This provides a significant improvement over previous approaches, while preserving the characteristic quantum speed-up in terms of the dimensionality of the underlying differential equations system, which similar time-marching quantum algorithms have previously demonstrated. Notably, by classically implementing the proposed algorithm, we showcase that it accurately captures the structural characteristics of the Lorenz system, reproducing both regular attractors–limit cycles–and the chaotic attractor within the chosen parameter regime.
Qubit lattice algorithm (QLA) simulations are performed for a two-dimensional spatially bounded pulse propagating onto a plane interface between two dielectric slabs. QLA is an initial value scheme that consists of a sequence of unitary collision and streaming operators, with appropriate potential operators, that recover Maxwell equations in inhomogeneous dielectric media to the second order in the lattice discreteness. For the case of total internal reflection, there is transient energy transfer into the second medium due to the evanescent fields as the Poynting unit vector of the pulse is rotated from its incident to reflected direction. Because of the finite spatial extent of the pulse, a self-consistent Goos–Hanchen-type displacement along the interface is found without imposing any explicit interface boundary conditions on the fields. For normal incidence, the standard Fresnel coefficients are recovered for appropriately averaged QLA fields. Energy is conserved at all times to seven significant figures.
A quantum lattice algorithm (QLA) is developed for the solution of Maxwell equations in scalar dielectric media using the Riemann-Silberstein representation. For x-dependent and y-dependent inhomogeneities, the corresponding QLA requries 8 qubits/spatial lattice site. This is because the corresponding Pauli spin matrices have off-diagonal components which permit the collisional entanglement of two qubits. However, z-dependent inhomogeneities require a QLA with 16 qubits/lattice site since the Pauli spin matrix $\sigma_z$ is diagonal. QLA simulations are performed for the time evolution of an initial electromagnetic pulse propagating normally to a boundary layer region joining two media of different refractive index. There is excellent agreement between all three representations, as well as very good agreement with nearly all the standard plane wave boundary condition results for reflection and transmission off a dielectric discontinuity. In the QLA simulation, no boundary conditions are imposed at the continuous, but sharply increasing, boundary layer.
Simulating nonlinear classical dynamics on a quantum computer is an inherently challenging task due to the linear operator formulation of quantum mechanics. In this work, we provide a systematic approach to alleviate this difficulty by developing a quantum algorithm that implements the time evolution of a second order time-discretized version of the Lorenz model. The Lorenz model is a celebrated system of nonlinear ordinary differential equations that has been extensively studied in the contexts of climate science, fluid dynamics, and chaos theory. Our algorithm possesses a recursive structure and requires only a linear number of copies of the initial state with respect to the number of integration time-steps. This provides a significant improvement over previous approaches, while preserving the characteristic quantum speed-up in terms of the dimensionality of the underlying differential equations system, that similar time-marching quantum algorithms have previously demonstrated. Notably, by classically implementing the proposed algorithm, we showcase that it accurately captures the structural characteristics of the Lorenz system, reproducing both regular attractors--limit cycles--and the chaotic attractor within the chosen parameter regime.
1 January 2023 in Communications in Computational Physics