arXiv subjects

Jonathan Wei Zhong Lau

Publications and source records attributed to Jonathan Wei Zhong Lau.

7 recordsLinked to original sources

arXiv2023

Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semidefinite program, we bypass several well-known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

quant-ph↗

arXiv2023

Atomtronic multi-terminal Aharonov-Bohm interferometer

We study a multi-functional device for cold atoms consisting of a three-terminal ring circuit pierced by a synthetic magnetic flux, where the ring can be continuous or discretized. The flux controls the atomic current through the ring via the Aharonov-Bohm effect. Our device shows a flux-induced transition of reflections from an Andreev-like negative density to positive density. Further, the flux can direct the atomic current into specific output ports, realizing a flexible non-reciprocal switch to connect multiple atomic systems or sense rotations. By changing the flux linearly in time, we convert constant matter wave currents into an AC modulated current. This effect can be used to realize an atomic frequency generator and study fundamental problems related to the Aharonov-Bohm effect. We experimentally demonstrate Bose-Einstein condensation into the light-shaped optical potential of the three-terminal ring. Our work opens up the possibility of novel atomtronic devices for practical applications in quantum technologies.

cond-mat.quant-gas↗

arXiv2022

A photonic chip-based machine learning approach for the prediction of molecular properties

Machine learning methods have revolutionized the discovery process of new molecules and materials. However, the intensive training process of neural networks for molecules with ever-increasing complexity has resulted in exponential growth in computation cost, leading to long simulation time and high energy consumption. Photonic chip technology offers an alternative platform for implementing neural networks with faster data processing and lower energy usage compared to digital computers. Photonics technology is naturally capable of implementing complex-valued neural networks at no additional hardware cost. Here, we demonstrate the capability of photonic neural networks for predicting the quantum mechanical properties of molecules. To the best of our knowledge, this work is the first to harness photonic technology for machine learning applications in computational chemistry and molecular sciences, such as drug discovery and materials design. We further show that multiple properties can be learned simultaneously in a photonic chip via a multi-task regression learning algorithm, which is also the first of its kind as well, as most previous works focus on implementing a network in the classification task.

cs.ET↗

arXiv2021

Simulating Energy Transfer in Molecular Systems with Digital Quantum Computers

Quantum computers have the potential to simulate chemical systems beyond the capability of classical computers. Recent developments in hybrid quantum-classical approaches enable the determinations of the ground or low energy states of molecular systems. Here, we extend near-term quantum simulations of chemistry to time-dependent processes by simulating energy transfer in organic semiconducting molecules. We developed a multi-scale modeling workflow that combines conventional molecular dynamics and quantum chemistry simulations with hybrid variational quantum algorithm to compute the exciton dynamics in both the single excitation subspace (i.e. Frenkel Hamiltonian) and the full-Hilbert space (i.e. multi-exciton) regimes. Our numerical examples demonstrate the feasibility of our approach, and simulations on IBM Q devices capture the qualitative behaviors of exciton dynamics, but with considerable errors. We present an error mitigation technique that combines experimental results from the variational and Trotter algorithms, and obtain significantly improved quantum dynamics. Our approach opens up new opportunities for modeling quantum dynamics in chemical, biological and material systems with quantum computers.

quant-ph↗

arXiv2021

Noisy intermediate scale quantum simulation of time dependent Hamiltonians

Quantum computers are expected to help us to achieve accurate simulation of the dynamics of many-body quantum systems. However, the limitations of current NISQ devices prevents us from realising this goal today. Recently an algorithm for performing quantum simulations called quantum assisted simulator has been proposed that promises realization on current experimental devices. In this work, we extend the quantum assisted simulator to simulate the dynamics of a class of time-dependent Hamiltonians. We show that the quantum assisted simulator is easier to implement as well as can realize multi-qubit interactions and challenging driving protocols that are difficult with other existing methods. We demonstrate this for a time-dependent Hamiltonian on the IBM Quantum Experience cloud quantum computer by showing superior performance of the quantum assisted simulator compared to Trotterization and variational quantum simulation. Further, we demonstrate the capability to simulate the dynamics of Hamiltonians consisting of 10000 qubits. Our results indicate that quantum assisted simulator is a promising algorithm for current term quantum hardware.

quant-ph↗

arXiv2021

NISQ Algorithm for Hamiltonian Simulation via Truncated Taylor Series

Simulating the dynamics of many-body quantum systems is believed to be one of the first fields that quantum computers can show a quantum advantage over classical computers. Noisy intermediate-scale quantum (NISQ) algorithms aim at effectively using the currently available quantum hardware. For quantum simulation, various types of NISQ algorithms have been proposed with individual advantages as well as challenges. In this work, we propose a new algorithm, truncated Taylor quantum simulator (TTQS), that shares the advantages of existing algorithms and alleviates some of the shortcomings. Our algorithm does not have any classical-quantum feedback loop and bypasses the barren plateau problem by construction. The classical part in our hybrid quantum-classical algorithm corresponds to a quadratically constrained quadratic program (QCQP) with a single quadratic equality constraint, which admits a semidefinite relaxation. The QCQP based classical optimization was recently introduced as the classical step in quantum assisted eigensolver (QAE), a NISQ algorithm for the Hamiltonian ground state problem. Thus, our work provides a conceptual unification between the NISQ algorithms for the Hamiltonian ground state problem and the Hamiltonian simulation. We recover differential equation-based NISQ algorithms for Hamiltonian simulation such as quantum assisted simulator (QAS) and variational quantum simulator (VQS) as particular cases of our algorithm. We test our algorithm on some toy examples on current cloud quantum computers. We also provide a systematic approach to improve the accuracy of our algorithm.

quant-ph↗

arXiv2020

Fourth-order leapfrog algorithms for numerical time evolution of classical and quantum systems

Chau et al. [New J. Phys. 20, 073003 (2018)] presented a new and straight-forward derivation of a fourth-order approximation '$U_7$' of the time-evolution operator and hinted at its potential value as a symplectic integrator. $U_7$ is based on the Suzuki-Trotter split-operator method and leads to an algorithm for numerical time propagation that is superior to established methods. We benchmark the performance of $U_7$ and other algorithms, including a Runge-Kutta method and another recently developed Suzuki-Trotter-based scheme, that are exact up to fourth order in the evolution parameter, against various classical and quantum systems. We find $U_7$ to deliver any given target accuracy with the lowest computational cost, across all systems and algorithms tested here. This study is accompanied by open-source numerical software that we hope will prove valuable in the classroom.

physics.comp-ph↗