JLJonathan Wei Zhong Lau

Jonathan Wei Zhong Lau

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jonathan Wei Zhong Lau has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Quantifying the effects of noise in a quantum convolutional neural network

    by Zeyu Fan, Jonathan Wei Zhong Lau, Leong-Chuan Kwek

    This study quantifies the effects of quantum noise on the performance of a quantum convolutional neural network (QCNN), building on parallels with classical convolutional neural networks (CNNs), where added Gaussian noise can improve training speed, accuracy, and generalizability. While such benefits are established for classical CNNs, the influence of noise on quantum counterparts remains insufficiently characterized. We specifically examine three types of quantum noise: decoherence, Gaussian noise arising from imperfect quantum gates and experimental error, and systematic noise introduced during input state preparation. Our analysis provides a detailed assessment of how these distinct noise sources affect QCNN operation and outlines considerations for mitigating their impact. Though a QCNN is used as an example in this work, the methods used here can be applied to other quantum machine learning models as well.


  • Open Access

    A passive atomtronics filter for Fermi gases

    by Jun Hao Hue, Martin-Isbjörn Trappe, Piotr T. Grochowski, Jonathan Lau, Leong-Chuan Kwek

    We design an atomtronic filter device that spatially separates the components of a two-component Fermi gas with repulsive contact interactions in a two-dimensional geometry. With the aid of density--potential functional theory (DPFT), which can accurately simulate Fermi gases in realistic settings, we propose and characterize a barbell-shaped trapping potential, where a bridge-shaped potential connects two ring-shaped potentials. In the strongly repulsive regime, each of the ring traps eventually stores one of the fermion species. Our simulations are a guide to designing component filters for initially mixed, weakly repulsive spin components. We demonstrate that the functioning of this barbell design is robust against variations in experimental settings, for example, across particle numbers, for small deformations of the trap geometry, or if interatomic interactions differ from the bare contact repulsion. Our investigation marks the first step in establishing DPFT as a comprehensive simulation framework for fermionic atomtronics.

  • Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor

    by Jonathan Wei Zhong Lau, Kian Hwee Lim, Kishor Bharti, Leong-Chuan Kwek, Sai Vinjanampathy

    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.


  • Top Cited Papers
    Open Access

    NISQ computing: where are we and where do we go?

    by Jonathan Wei Zhong Lau, Kian Hwee Lim, Harshank Shrotriya, Leong Chuan Kwek

    In this short review article, we aim to provide physicists not working within the quantum computing community a hopefully easy-to-read introduction to the state of the art in the field, with minimal mathematics involved. In particular, we focus on what is termed theNoisy Intermediate Scale Quantumera of quantum computing. We describe how this is increasingly seen to be a distinct phase in the development of quantum computers, heralding an era where we have quantum computers that are capable of doing certain quantum computations in a limited fashion, and subject to certain constraints and noise. We further discuss the prominent algorithms that are believed to hold the most potential for this era, and also describe the competing physical platforms on which to build a quantum computer that have seen the most success so far. We then talk about the applications that are most feasible in the near-term, and finish off with a short discussion on the state of the field. We hope that as non-experts read this article, it will give context to the recent developments in quantum computers that have garnered much popular press, and help the community understand how to place such developments in the timeline of quantum computing.


  • Open Access

    NISQ Algorithm for Hamiltonian simulation via truncated Taylor series

    by Jonathan Wei Zhong Lau, Tobias Haug, Leong-Chuan Kwek, Kishor Bharti

    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 (TQS), 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.