Hamiltonian and Liouvillian learning in weakly-dissipative quantum many-body systems

Tobias Olsacher, Tristan Kraft, Christian Kokail, Barbara Kraus, Peter Zoller. We discuss Hamiltonian and Liouvillian learning for analog quantum simulation from non-equilibrium quench dynamics in the limit of weakly dissipative many-body systems. We present various strategies to learn the operator content of the Hamiltonian and the Lindblad operators of the Liouvillian. We compare different ansätze based on an experimentally accessible…

Unsupervised learning of quantum many-body scars using intrinsic dimension

Harvey Cao, Dimitris G. Angelakis, Daniel Leykam. Quantum many-body scarred systems contain both thermal and non-thermal scar eigenstates in their spectra. When these systems are quenched from special initial states which share high overlap with scar eigenstates, the system undergoes dynamics with atypically slow relaxation and periodic revival. This scarring phenomenon poses a potential avenue for circumventing decoherence in various…

Landscape approximation of low energy solutions to binary optimization problems

Benjamin Y.L. Tan, Beng Yee Gan, Daniel Leykam, and Dimitris G. Angelakis. We show how the localization landscape, originally introduced to bound low energy eigenstates of disordered wave media and many-body quantum systems, can form the basis for hardware efficient quantum algorithms for solving binary optimization problems. Many binary optimization problems can be cast as finding low-energy eigenstates of Ising…

Nonlinear Quantum Dynamics in Superconducting NISQ Processors

Muhammad Umer, Eleftherios Mastorakis, Sofia Evangelou, Dimitris G. Angelakis. A recently proposed variational quantum algorithm has expanded the horizon of variational quantum computing to nonlinear physics and fluid dynamics. In this work, we employ this algorithm to find the ground state of the nonlinear Schrödinger equation with a quadratic potential and implement it on the cloud superconducting quantum processors. We…

Partitioned Quantum Subspace Expansion

Tom O'Leary, Lewis W. Anderson, Dieter Jaksch, Martin Kiffner. We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We…

Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers

Paul Over, Sergio Bengoechea, Thomas Rung, Francesco Clerici, Leonardo Scandurra, Eugene de Villiers, Dieter Jaksch. The paper presents a variational quantum algorithm to solve initial-boundary value problems described by second-order partial differential equations. The approach uses hybrid classical/quantum hardware that is well suited for quantum computers of the current noisy intermediate-scale quantum era. The partial differential equation is initially translated into an optimal control problem with…

Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer

Chong Hian Chee, Daniel Leykam, Adrian M. Mak, and Dimitris G. Angelakis. Fermionic Ansatz state preparation is a critical subroutine in many quantum algorithms such as the variational quantum eigensolver for quantum chemistry and condensed-matter applications. The shallowest circuit depth needed to prepare Slater determinants and correlated states to date scales at least linearly with respect to the system size \(N\). Inspired by…

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…

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…
AncoraThemes © 2024. All Rights Reserved.

QCFD © 2024. All Rights Reserved. PRIVACY POLICY

European Union Flag

The QCFD (Quantum Computational Fluid Dynamics) project is funded under the European Union’s Horizon Programme (HORIZON-CL4-2021-DIGITAL-EMERGING-02-10), Grant Agreement 101080085 QCFD.