Kian Hwee Lim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kian Hwee Lim has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Davit Aghamalyan
Institute of High Performance Computing
2 shared publications- Jia-Bin You
Institute of High Performance Computing, Agency for Science, Technology, and Research (A*STAR), 1 Fusionopolis Way, #16-16 Connexis, Singapore 138632, Singapore
2 shared publications - Jian Feng Kong
Institute of High Performance Computing
2 shared publications - Jonathan Wei Zhong Lau
National University of Singapore
2 shared publications - Kishor Bharti
Agency for Science Technology and Research 138632 Singapore
2 shared publications Leong-Chuan Kwek
Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543
2 shared publications
Latest Publications
- Open Access
- 10 March 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (1)
Generation and optimization of entanglement between atoms chirally coupled to spin cavities
We explore the generation and optimization of entanglement between atoms chirally coupled to finite one-dimensional spin chains, functioning as spin cavities. By diagonalizing the spin cavity Hamiltonian, we identify a parity effect that influences entanglement, with small even-sized cavities chirally coupled to atoms expediting entanglement generation by approximately 50 % faster than nonchiral coupling. Applying a classical driving field to the atoms reveals oscillations in concurrence, with resonant dips at specific driving strengths due to the resonances between the driven atom and the spin cavity. Extending our study to systems with energetic disorder, we find that high concurrence can be achieved regardless of disorder strength when the inverse participation ratio of the resulting eigenstates is favorable. Finally, we demonstrate that controlled disorder within the cavity significantly enhances and expedites entanglement generation, achieving higher concurrences up to four times faster than those attained in ordered systems.
- 10 March 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (1)
Open AccessGeneration and optimization of entanglement between atoms chirally coupled to spin cavities
We explore the generation and optimization of entanglement between atoms chirally coupled to finite one-dimensional spin chains, functioning as spin cavities. By diagonalizing the spin cavity Hamiltonian, we identify a parity effect that influences entanglement, with small even-sized cavities chirally coupled to atoms expediting entanglement generation by approximately 50 % faster than nonchiral coupling. Applying a classical driving field to the atoms reveals oscillations in concurrence, with resonant dips at specific driving strengths due to the resonances between the driven atom and the spin cavity. Extending our study to systems with energetic disorder, we find that high concurrence can be achieved regardless of disorder strength when the inverse participation ratio of the resulting eigenstates is favorable. Finally, we demonstrate that controlled disorder within the cavity significantly enhances and expedites entanglement generation, achieving higher concurrences up to four times faster than those attained in ordered systems.
- Open Access
- 29 August 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , L032047
Exponentially faster preparation of quantum dimers via driven-dissipative stabilization
We propose a rapid, high-fidelity, and noise-resistant scheme to generate many-body entanglement between multiple qubits stabilized by dissipation into a 1D bath. Using a carefully designed time-dependent drive, our scheme achieves a provably exponential speedup over state-of-the-art dissipative stabilization schemes in baths, which require a timescale that diverges as the target fidelity approaches unity and scales exponentially with the number of qubits. To prepare quantum dimer pairs, our scheme only requires local 2-qubit control Hamiltonians, with a protocol time that is independent of system size. This provides a scalable and robust protocol for generating a large number of entangled dimer pairs on-demand, serving as a fundamental resource for many quantum metrology and quantum information processing tasks.- 29 August 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , L032047
Open AccessExponentially faster preparation of quantum dimers via driven-dissipative stabilization
We propose a rapid, high-fidelity, and noise-resistant scheme to generate many-body entanglement between multiple qubits stabilized by dissipation into a 1D bath. Using a carefully designed time-dependent drive, our scheme achieves a provably exponential speedup over state-of-the-art dissipative stabilization schemes in baths, which require a timescale that diverges as the target fidelity approaches unity and scales exponentially with the number of qubits. To prepare quantum dimer pairs, our scheme only requires local 2-qubit control Hamiltonians, with a protocol time that is independent of system size. This provides a scalable and robust protocol for generating a large number of entangled dimer pairs on-demand, serving as a fundamental resource for many quantum metrology and quantum information processing tasks. - 12 June 2023
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 130 (24) , 240601
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.
- 12 June 2023
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 130 (24) , 240601
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.
- Top Cited Papers
- 17 February 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 107 (2) , 023716
Oscillating bound states in non-Markovian photonic lattices
It is known that the superposition of two bound states in the continuum (BICs) leads to the phenomenon of an oscillating bound state, where excitations mediated by the continuum modes oscillate persistently. We perform exact calculations for the oscillating BICs in a one-dimensional photonic lattice coupled to a “giant atom” at multiple points. Our work is significantly distinct from previous proposals of oscillating BICs in continuous waveguide systems due to the presence of a finite energy band contributing band-edge effects. In particular, we show that the bound states outside the energy band are detrimental to the oscillating BIC phenomenon, and can be suppressed by increasing either the number of coupling points or the separation between each coupling point. Crucially, non-Markovianity is necessary for the existence of oscillating BICs, and the oscillation amplitude increases with the characteristic delay time of the giant atom interactions. We also propose an initialization scheme in the BIC subspace. Our work be experimentally implemented on current photonic waveguide array platforms and opens up prospects in utilizing reservoir engineering for the storage of quantum information in photonic lattices.
- 17 February 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 107 (2) , 023716
Top Cited PapersOscillating bound states in non-Markovian photonic lattices
It is known that the superposition of two bound states in the continuum (BICs) leads to the phenomenon of an oscillating bound state, where excitations mediated by the continuum modes oscillate persistently. We perform exact calculations for the oscillating BICs in a one-dimensional photonic lattice coupled to a “giant atom” at multiple points. Our work is significantly distinct from previous proposals of oscillating BICs in continuous waveguide systems due to the presence of a finite energy band contributing band-edge effects. In particular, we show that the bound states outside the energy band are detrimental to the oscillating BIC phenomenon, and can be suppressed by increasing either the number of coupling points or the separation between each coupling point. Crucially, non-Markovianity is necessary for the existence of oscillating BICs, and the oscillation amplitude increases with the characteristic delay time of the giant atom interactions. We also propose an initialization scheme in the BIC subspace. Our work be experimentally implemented on current photonic waveguide array platforms and opens up prospects in utilizing reservoir engineering for the storage of quantum information in photonic lattices.
- Top Cited PapersOpen Access
- 27 September 2022
- Published by Springer Nature in AAPPS Bulletin
- Vol. 32 (1) , 1-30
NISQ computing: where are we and where do we go?
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.
- 27 September 2022
- Published by Springer Nature in AAPPS Bulletin
- Vol. 32 (1) , 1-30
Top Cited PapersOpen AccessNISQ computing: where are we and where do we go?
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.
- 28 October 2021
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (1) , 015001
Fast-forwarding with NISQ processors without feedback loop
Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for quantum simulation. Hybrid classical quantum algorithms such as the variational quantum algorithms have been proposed to effectively use current term quantum devices. One promising approach to quantum simulation in the noisy intermediate-scale quantum (NISQ) era is the diagonalisation based approach, with some of the promising examples being the subspace variational quantum simulator (SVQS), variational fast forwarding (VFF), fixed-state variational fast forwarding (fs-VFF), and the variational Hamiltonian diagonalisation (VHD) algorithms. However, these algorithms require a feedback loop between the classical and quantum computers, which can be a crucial bottleneck in practical application. Here, we present the classical quantum fast forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF shares some similarities with SVQS, VFF, fs-VFF and VHD but removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. The CQFF algorithm does not suffer from the barren plateau problem and the accuracy can be systematically increased. Furthermore, if the Hamiltonian to be simulated is expressed as a linear combination of tensored-Pauli matrices, the CQFF algorithm reduces to the task of sampling some many-body quantum state in a set of Pauli-rotated bases, which is easy to do in the NISQ era. We run the CQFF algorithm on existing quantum processors and demonstrate the promise of the CQFF algorithm for current-term quantum hardware. We compare CQFF with Trotterization for a XY spin chain model Hamiltonian and find that the CQFF algorithm can simulate the dynamics more than 10 5 times longer than Trotterization on current-term quantum hardware. This provides a 10 4 times improvement over the previous record.
- 28 October 2021
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (1) , 015001
Fast-forwarding with NISQ processors without feedback loop
Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for quantum simulation. Hybrid classical quantum algorithms such as the variational quantum algorithms have been proposed to effectively use current term quantum devices. One promising approach to quantum simulation in the noisy intermediate-scale quantum (NISQ) era is the diagonalisation based approach, with some of the promising examples being the subspace variational quantum simulator (SVQS), variational fast forwarding (VFF), fixed-state variational fast forwarding (fs-VFF), and the variational Hamiltonian diagonalisation (VHD) algorithms. However, these algorithms require a feedback loop between the classical and quantum computers, which can be a crucial bottleneck in practical application. Here, we present the classical quantum fast forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF shares some similarities with SVQS, VFF, fs-VFF and VHD but removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. The CQFF algorithm does not suffer from the barren plateau problem and the accuracy can be systematically increased. Furthermore, if the Hamiltonian to be simulated is expressed as a linear combination of tensored-Pauli matrices, the CQFF algorithm reduces to the task of sampling some many-body quantum state in a set of Pauli-rotated bases, which is easy to do in the NISQ era. We run the CQFF algorithm on existing quantum processors and demonstrate the promise of the CQFF algorithm for current-term quantum hardware. We compare CQFF with Trotterization for a XY spin chain model Hamiltonian and find that the CQFF algorithm can simulate the dynamics more than 10 5 times longer than Trotterization on current-term quantum hardware. This provides a 10 4 times improvement over the previous record.
- Open Access
- 21 August 2020
- Published by EDP Sciences in EPJ Web of Conferences
- Vol. 240, 07006
Transverse Energy Density in High Energy Heavy Ion Collisions
A phenomenological model describing the transverse energy distribution (ET) of nuclear collisions is first studied in detail by fitting it on ET data for O-Pb collisions at √sNN = 200 GeV per nucleon obtained from the NA35 collaboration. Next, the model is used to fit the ET data for Pb-Pb collisions at LHC energies of √sNN = 2.76 TeV per nucleon obtained from the ATLAS collaboration. From the fits, we determine an upper bound for the energy density for Pb-Pb collisions at LHC energies of √sNN = 2.76 TeV per nucleon.
- 21 August 2020
- Published by EDP Sciences in EPJ Web of Conferences
- Vol. 240, 07006
Open AccessTransverse Energy Density in High Energy Heavy Ion Collisions
A phenomenological model describing the transverse energy distribution (ET) of nuclear collisions is first studied in detail by fitting it on ET data for O-Pb collisions at √sNN = 200 GeV per nucleon obtained from the NA35 collaboration. Next, the model is used to fit the ET data for Pb-Pb collisions at LHC energies of √sNN = 2.76 TeV per nucleon obtained from the ATLAS collaboration. From the fits, we determine an upper bound for the energy density for Pb-Pb collisions at LHC energies of √sNN = 2.76 TeV per nucleon.