QCFD Publications – Page 3

QCFD Publications January 5, 2023

Variational Quantum Algorithms for Computational Fluid Dynamics

Dieter Jaksch, Peyman Givi, Andrew J. Daley, Thomas Rung. Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required hardware, but also in identifying the most promising application areas and developing the corresponding quantum algorithms. The availability…

QCFD Publications January 1, 2023

Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning

Francesco Preti, Michael Schilling, Sofiene Jerbi, Lea M. Trenkwalder, Hendrik Poulsen Nautrup, Felix Motzoi, Hans J. Briegel. Shortening quantum circuits is crucial to reducing the destructive effect of environmental decoherence and enabling useful algorithms. Here, we demonstrate an improvement in such compilation tasks via a combination of using hybrid discrete-continuous optimization across a continuous gate set, and architecture-tailored implementation. The…

QCFD Publications January 1, 2023

Tensor network reduced order models for wall-bounded flows

Martin Kiffner, Dieter Jaksch. We introduce a widely applicable tensor network-based framework for developing reduced order models describing wall-bounded fluid flows. As a paradigmatic example, we consider the incompressible Navier-Stokes equations and the lid-driven cavity in two spatial dimensions. We benchmark our solution against published reference data for low Reynolds numbers and find excellent agreement. In addition, we investigate the…

QCFD Publications January 1, 2023

Gaining confidence on the correct realization of arbitrary quantum computations

Jose Carrasco, Marc Langer, Antoine Neven, Barbara Kraus. We present verification protocols to gain confidence in the correct performance of the realization of an arbitrary universal quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized…