Thi Ha Kyaw
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Thi Ha Kyaw has a total of 81 co-authors. Here are the top co-authors by number of shared publications:
- Alán Aspuru-Guzik
Department of Chemistry, University of Toronto, Toronto, Canada
9 shared publications - Leong Chuang Kwek
National University of Singapore
8 shared publications - Gaurav Saxena
LG Electronics Toronto AI Lab
7 shared publications - Guillermo Romero
Universidad de Santiago de Chile (USACH)
5 shared publications - Jack S. Baker
Toronto AI Lab, LG Electronics
5 shared publications Abhinav Anand
Department of Chemistry, University of Toronto, Toronto, Ontario M5G 1Z8, Canada
3 shared publications
Latest Publications
- Open Access
- 5 October 2026
- Published by IOP Publishing in Quantum Science and Technology
Measurement circuit ansatz: Naimark versus quantum neural-network measurements
In this work, we present constructions of quantum circuits to implement general measurements on quantum hardware. Firstly, we investigate a quantum circuit ansatz by following the Naimark extension with a universal set of gates, such as controlled-NOT and single-qubit gates; we call it a {\it Naimark measurement}. We present a circuit ansatz framed by the Naimark extension, leaving single-qubit gates with parameters, and apply a classical optimizer to determine their parameters to approximate a desired quantum measurement. Secondly, we relax the Naimark measurement with quantum neural-network (QNN) circuits, employing parameterized quantum circuits. We present hybrid Naimark-QNN measurements by incorporating QNN circuits into Naimark measurements. Thirdly, we also consider fully QNN measurements with shallow parameterized circuits. Then, we compare the constructed measurement circuits, Naimark, hybrid Naimark-QNN, and fully QNN measurements, for strategies of state discrimination, such as minimum-error and maximum-confidence measurements. We demonstrate that QNN circuits can efficiently and effectively achieve near-optimal quantum measurements with fewer training iterations.
- 5 October 2026
- Published by IOP Publishing in Quantum Science and Technology
Open AccessMeasurement circuit ansatz: Naimark versus quantum neural-network measurements
In this work, we present constructions of quantum circuits to implement general measurements on quantum hardware. Firstly, we investigate a quantum circuit ansatz by following the Naimark extension with a universal set of gates, such as controlled-NOT and single-qubit gates; we call it a {\it Naimark measurement}. We present a circuit ansatz framed by the Naimark extension, leaving single-qubit gates with parameters, and apply a classical optimizer to determine their parameters to approximate a desired quantum measurement. Secondly, we relax the Naimark measurement with quantum neural-network (QNN) circuits, employing parameterized quantum circuits. We present hybrid Naimark-QNN measurements by incorporating QNN circuits into Naimark measurements. Thirdly, we also consider fully QNN measurements with shallow parameterized circuits. Then, we compare the constructed measurement circuits, Naimark, hybrid Naimark-QNN, and fully QNN measurements, for strategies of state discrimination, such as minimum-error and maximum-confidence measurements. We demonstrate that QNN circuits can efficiently and effectively achieve near-optimal quantum measurements with fewer training iterations.
- 29 July 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (3) , 035054
Designing quantum technologies with a quantum computer
Interacting spin systems in solids underpin a wide range of quantum technologies, from quantum sensors and single-photon sources to spin-defect-based quantum registers and processors. We develop a quantum-computer-aided framework for simulating such devices using a general many-body electron-spin-resonance Hamiltonian that incorporates zero-field splitting, the Zeeman effect, hyperfine interactions, dipole–dipole spin–spin interactions, and electron-phonon decoherence. Within this framework, we combine gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding (sQKFF) hybrid algorithm, aiming to access extended-time dynamics within the constraints of Noisy Intermediate-Scale Quantum and early fault-tolerant hardware. Numerical simulations demonstrate the computation of operationally useful quantities including autocorrelation functions up to ∼ 100 ns, together with microwave absorption spectra and the ℓ 1 -norm of coherence, achieving 18 % –30 % reductions in gate counts and circuit depth for Trotterized time-evolution circuits compared to unoptimized implementations. Using the nitrogen vacancy center in diamond as a testbed, we benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost. This methodology provides a flexible blueprint for using quantum computers to design, compare, and optimize solid-state spin-qubit technologies under experimentally realistic conditions.
- 29 July 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (3) , 035054
Designing quantum technologies with a quantum computer
Interacting spin systems in solids underpin a wide range of quantum technologies, from quantum sensors and single-photon sources to spin-defect-based quantum registers and processors. We develop a quantum-computer-aided framework for simulating such devices using a general many-body electron-spin-resonance Hamiltonian that incorporates zero-field splitting, the Zeeman effect, hyperfine interactions, dipole–dipole spin–spin interactions, and electron-phonon decoherence. Within this framework, we combine gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding (sQKFF) hybrid algorithm, aiming to access extended-time dynamics within the constraints of Noisy Intermediate-Scale Quantum and early fault-tolerant hardware. Numerical simulations demonstrate the computation of operationally useful quantities including autocorrelation functions up to ∼ 100 ns, together with microwave absorption spectra and the ℓ 1 -norm of coherence, achieving 18 % –30 % reductions in gate counts and circuit depth for Trotterized time-evolution circuits compared to unoptimized implementations. Using the nitrogen vacancy center in diamond as a testbed, we benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost. This methodology provides a flexible blueprint for using quantum computers to design, compare, and optimize solid-state spin-qubit technologies under experimentally realistic conditions.
- 31 March 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (2) , 025032
Physics-inspired extrapolation for efficient error mitigation and hardware certification
Quantum error mitigation (QEM) is essential for the noisy intermediate-scale quantum era, and will remain relevant for early fault-tolerant (EFT) quantum computers, where logical error rates are still significant. However, most QEM methods incur an exponential sampling overhead to achieve unbiased estimates, limiting their practical applicability. Recently, error mitigation by restricted evolution (EMRE) was shown to estimate expectation values with constant sampling overhead, albeit with a small bias that grows with circuit size and noise level. Building upon the EMRE framework, here, we propose physics-inspired extrapolation (PIE), a linear circuit runtime protocol that achieves enhanced accuracy without incurring substantial overhead. Unlike traditional heuristic zero-noise extrapolation methods, PIE provides a theoretical foundation for the operational interpretation of its fitting parameters and demonstrates convergence to unbiased estimates as noise decreases. Distinctively, the slope of the extrapolation fit corresponds to the max-relative entropy between the ideal and noisy circuits, enabling quantitative hardware certification alongside error mitigation, with no additional computational overhead. We also demonstrate the efficacy of this method on IBMQ hardware and apply it to simulate 84-qubit quantum dynamics efficiently. Our results show that PIE yields accurate, low-variance error mitigated estimates, establishing it as a practical and scalable strategy for both error mitigation and hardware certification for near-term and EFT quantum computers.
- 31 March 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (2) , 025032
Physics-inspired extrapolation for efficient error mitigation and hardware certification
Quantum error mitigation (QEM) is essential for the noisy intermediate-scale quantum era, and will remain relevant for early fault-tolerant (EFT) quantum computers, where logical error rates are still significant. However, most QEM methods incur an exponential sampling overhead to achieve unbiased estimates, limiting their practical applicability. Recently, error mitigation by restricted evolution (EMRE) was shown to estimate expectation values with constant sampling overhead, albeit with a small bias that grows with circuit size and noise level. Building upon the EMRE framework, here, we propose physics-inspired extrapolation (PIE), a linear circuit runtime protocol that achieves enhanced accuracy without incurring substantial overhead. Unlike traditional heuristic zero-noise extrapolation methods, PIE provides a theoretical foundation for the operational interpretation of its fitting parameters and demonstrates convergence to unbiased estimates as noise decreases. Distinctively, the slope of the extrapolation fit corresponds to the max-relative entropy between the ideal and noisy circuits, enabling quantitative hardware certification alongside error mitigation, with no additional computational overhead. We also demonstrate the efficacy of this method on IBMQ hardware and apply it to simulate 84-qubit quantum dynamics efficiently. Our results show that PIE yields accurate, low-variance error mitigated estimates, establishing it as a practical and scalable strategy for both error mitigation and hardware certification for near-term and EFT quantum computers.
- 10 February 2026
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 22 (4) , 1760-1769
Error-Mitigation Enabled Multicomponent Quantum Simulations beyond the Born–Oppenheimer Approximation
We introduce a multicomponent unitary coupled cluster (mcUCC) framework for quantum simulations of molecular systems that incorporate both electronic and nuclear quantum effects beyond the Born-Oppenheimer approximation. Using the nuclear-electronic orbital formalism, we construct mcUCC ansätze for positronium hydride and molecular hydrogen with a quantum proton, and analyze hardware requirements for different excitation truncations. To further reduce resource costs effectively, we employ the local unitary cluster Jastrow ansatz and implement it experimentally on IBM Q's Heron superconducting hardware. With the Physics-Inspired Extrapolation error mitigation protocol, the computed ground-state energies remain within chemical accuracy, consistent with the stated uncertainty level. These results provide the first demonstration of error-mitigated multicomponent correlated simulations on quantum hardware and outline a path toward scalable algorithms unifying electronic and nuclear degrees of freedom.
- 10 February 2026
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 22 (4) , 1760-1769
Error-Mitigation Enabled Multicomponent Quantum Simulations beyond the Born–Oppenheimer Approximation
We introduce a multicomponent unitary coupled cluster (mcUCC) framework for quantum simulations of molecular systems that incorporate both electronic and nuclear quantum effects beyond the Born-Oppenheimer approximation. Using the nuclear-electronic orbital formalism, we construct mcUCC ansätze for positronium hydride and molecular hydrogen with a quantum proton, and analyze hardware requirements for different excitation truncations. To further reduce resource costs effectively, we employ the local unitary cluster Jastrow ansatz and implement it experimentally on IBM Q's Heron superconducting hardware. With the Physics-Inspired Extrapolation error mitigation protocol, the computed ground-state energies remain within chemical accuracy, consistent with the stated uncertainty level. These results provide the first demonstration of error-mitigated multicomponent correlated simulations on quantum hardware and outline a path toward scalable algorithms unifying electronic and nuclear degrees of freedom.
- Open Access
Designing quantum technologies with a quantum computer
Interacting spin systems in solids underpin a wide range of quantum technologies, from quantum sensors and single-photon sources to spin-defect-based quantum registers and processors. We develop a quantum-computer-aided framework for simulating such devices using a general electron spin resonance Hamiltonian incorporating zero-field splitting, the Zeeman effect, hyperfine interactions, dipole-dipole spin-spin terms, and electron-phonon decoherence. Within this model, we combine Gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding (sQKFF) hybrid algorithm to access long-time dynamics while remaining compatible with NISQ and early fault-tolerant hardware constraints. Numerical simulations demonstrate the computation of autocorrelation functions up to $\sim100$ ns, together with microwave absorption spectra and the $\ell_1$-norm of coherence, achieving 18-30$\%$ reductions in gate counts and circuit depth for Trotterized time-evolution circuits compared to unoptimized implementations. Using the nitrogen vacancy center in diamond as a testbed, we benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost. This methodology provides a flexible blueprint for using quantum computers to design, compare, and optimize solid-state spin-qubit technologies under experimentally realistic conditions.Open AccessDesigning quantum technologies with a quantum computer
Interacting spin systems in solids underpin a wide range of quantum technologies, from quantum sensors and single-photon sources to spin-defect-based quantum registers and processors. We develop a quantum-computer-aided framework for simulating such devices using a general electron spin resonance Hamiltonian incorporating zero-field splitting, the Zeeman effect, hyperfine interactions, dipole-dipole spin-spin terms, and electron-phonon decoherence. Within this model, we combine Gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding (sQKFF) hybrid algorithm to access long-time dynamics while remaining compatible with NISQ and early fault-tolerant hardware constraints. Numerical simulations demonstrate the computation of autocorrelation functions up to $\sim100$ ns, together with microwave absorption spectra and the $\ell_1$-norm of coherence, achieving 18-30$\%$ reductions in gate counts and circuit depth for Trotterized time-evolution circuits compared to unoptimized implementations. Using the nitrogen vacancy center in diamond as a testbed, we benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost. This methodology provides a flexible blueprint for using quantum computers to design, compare, and optimize solid-state spin-qubit technologies under experimentally realistic conditions. - Open Access
Error-Mitigation Enabled Multicomponent Quantum Simulations Beyond the Born-Oppenheimer Approximation
We introduce a multicomponent unitary coupled cluster framework for quantum simulations of molecular systems that incorporate both electronic and nuclear quantum effects beyond the Born-Oppenheimer approximation. Using the nuclear-electronic orbital formalism, we construct mcUCC ansätze for positronium hydride and molecular hydrogen with a quantum proton, and analyze hardware requirements for different excitation truncations. To further reduce resource costs effectively, we employ the local unitary cluster Jastrow ansatz and implement it experimentally on IBM Q's Heron superconducting hardware. With the Physics-Inspired Extrapolation error mitigation protocol, the computed ground-state energies remain within chemical accuracy, consistent with the stated uncertainty level. These results provide the first demonstration of error-mitigated multicomponent correlated simulations on quantum hardware and outline a path toward scalable algorithms unifying electronic and nuclear degrees of freedom.
Open AccessError-Mitigation Enabled Multicomponent Quantum Simulations Beyond the Born-Oppenheimer Approximation
We introduce a multicomponent unitary coupled cluster framework for quantum simulations of molecular systems that incorporate both electronic and nuclear quantum effects beyond the Born-Oppenheimer approximation. Using the nuclear-electronic orbital formalism, we construct mcUCC ansätze for positronium hydride and molecular hydrogen with a quantum proton, and analyze hardware requirements for different excitation truncations. To further reduce resource costs effectively, we employ the local unitary cluster Jastrow ansatz and implement it experimentally on IBM Q's Heron superconducting hardware. With the Physics-Inspired Extrapolation error mitigation protocol, the computed ground-state energies remain within chemical accuracy, consistent with the stated uncertainty level. These results provide the first demonstration of error-mitigated multicomponent correlated simulations on quantum hardware and outline a path toward scalable algorithms unifying electronic and nuclear degrees of freedom.
- Open Access
Quenching, Fast and Slow: Breaking Kibble-Zurek Universal Scaling by Jumping along Geodesics
A major drawback of adiabatic quantum computing (AQC) is fulfilling the energy gap constraint, which requires the total evolution time to scale inversely with the square of the minimum energy gap. Failure to satisfy this condition violates the adiabatic approximation, potentially undermining computational accuracy. Recently, several approaches have been proposed to circumvent this constraint. One promising approach is to use the family of adiabatic shortcut procedures to fast-forward AQC. One caveat, however, is that it requires an additional Hamiltonian that is very challenging to implement experimentally. Here, we investigate an alternate pathway that avoids any extra Hamiltonian in the evolution to fast-forward the adiabatic dynamics by traversing geodesics of a quantum system. We find that jumping along geodesics offers a striking mechanism to highly suppress the density of excitations in many-body systems. Particularly, for the spin-$1/2$ XY model, we analytically prove and numerically demonstrate a rate-independent defect plateau, which contrasts with well-established results for the Kibble-Zurek and anti-Kibble-Zurek mechanisms.
Open AccessQuenching, Fast and Slow: Breaking Kibble-Zurek Universal Scaling by Jumping along Geodesics
A major drawback of adiabatic quantum computing (AQC) is fulfilling the energy gap constraint, which requires the total evolution time to scale inversely with the square of the minimum energy gap. Failure to satisfy this condition violates the adiabatic approximation, potentially undermining computational accuracy. Recently, several approaches have been proposed to circumvent this constraint. One promising approach is to use the family of adiabatic shortcut procedures to fast-forward AQC. One caveat, however, is that it requires an additional Hamiltonian that is very challenging to implement experimentally. Here, we investigate an alternate pathway that avoids any extra Hamiltonian in the evolution to fast-forward the adiabatic dynamics by traversing geodesics of a quantum system. We find that jumping along geodesics offers a striking mechanism to highly suppress the density of excitations in many-body systems. Particularly, for the spin-$1/2$ XY model, we analytically prove and numerically demonstrate a rate-independent defect plateau, which contrasts with well-established results for the Kibble-Zurek and anti-Kibble-Zurek mechanisms.
- Open Access
Universal initial state preparation for first quantized quantum simulations
Preparing symmetry-adapted initial states is a principal bottleneck in first-quantized quantum simulation. We present a universal approach that efficiently maps any polynomial-size superposition of occupation-number configurations to the first-quantized representation on a digital quantum computer. The method exploits the Jordan--Schwinger Lie algebra homomorphism, which identifies number-conserving second-quantized operators with their first-quantized action and induces an equivariant bijection between Fock occupations and $\mathfrak{su}(d)$ weight states within the Schur--Weyl decomposition. Operationally, we prepare an encoded superposition of Schur labels via a block-encoded linear combination of unitaries and then apply the inverse quantum Schur transform. The algorithm runs in time $\text{poly}(L, N, d, \log ε^{-1})$ for $L$ configurations of $N$ particles over $d$ modes to accuracy $ε$, and applies universally to fermions, bosons, and Green's paraparticles in arbitrary single-particle bases. Resource estimates indicate practicality within leading first-quantized pipelines; statistics-aware or faster quantum Schur transforms promise further reductions.Open AccessUniversal initial state preparation for first quantized quantum simulations
Preparing symmetry-adapted initial states is a principal bottleneck in first-quantized quantum simulation. We present a universal approach that efficiently maps any polynomial-size superposition of occupation-number configurations to the first-quantized representation on a digital quantum computer. The method exploits the Jordan--Schwinger Lie algebra homomorphism, which identifies number-conserving second-quantized operators with their first-quantized action and induces an equivariant bijection between Fock occupations and $\mathfrak{su}(d)$ weight states within the Schur--Weyl decomposition. Operationally, we prepare an encoded superposition of Schur labels via a block-encoded linear combination of unitaries and then apply the inverse quantum Schur transform. The algorithm runs in time $\text{poly}(L, N, d, \log ε^{-1})$ for $L$ configurations of $N$ particles over $d$ modes to accuracy $ε$, and applies universally to fermions, bosons, and Green's paraparticles in arbitrary single-particle bases. Resource estimates indicate practicality within leading first-quantized pipelines; statistics-aware or faster quantum Schur transforms promise further reductions. - Open Access
Quantum Resilience: Canadian Innovations in Quantum Error Correction and Quantum Error Mitigation
In celebration of the 2025 International Year of Quantum Science and Technology, this article highlights the pioneering achievements and ongoing innovations in quantum error correction and quantum error mitigation by Canadian institutions, academia and industry alike. Emphasizing Canada's central role in advancing these two related areas, we summarize landmark theoretical breakthroughs, cutting-edge experiments, and emerging techniques aimed at reducing and/or eliminating errors incurred when using a quantum computer. This community-focused overview underscores Canada's leadership in addressing the critical challenge of noise in quantum information science.
Open AccessQuantum Resilience: Canadian Innovations in Quantum Error Correction and Quantum Error Mitigation
In celebration of the 2025 International Year of Quantum Science and Technology, this article highlights the pioneering achievements and ongoing innovations in quantum error correction and quantum error mitigation by Canadian institutions, academia and industry alike. Emphasizing Canada's central role in advancing these two related areas, we summarize landmark theoretical breakthroughs, cutting-edge experiments, and emerging techniques aimed at reducing and/or eliminating errors incurred when using a quantum computer. This community-focused overview underscores Canada's leadership in addressing the critical challenge of noise in quantum information science.
- Open Access
Error Mitigation by Restricted Evolution
Error mitigation techniques, while instrumental in extending the capabilities of near-term quantum computers, often suffer from exponential resource scaling with noise levels. To address this limitation, we introduce a novel approach, constant runtime Error Mitigation by Restricted Evolution (EMRE). Through numerical simulations, we demonstrate that EMRE surpasses the performance of Probabilistic Error Cancellation (PEC) while maintaining constant sample complexity. Moreover, we uncover a continuous family of error mitigation protocols, Hybrid EMREs (HEMREs), encompassing PEC and EMRE as special cases. HEMREs offer a tunable bias parameter, allowing for a trade-off between sample complexity and error reduction. Thus, our error mitigation protocols provide flexibility in balancing error mitigation with computational overhead, catering to practical application requirements of near-term and early-fault tolerant quantum devices.
Open AccessError Mitigation by Restricted Evolution
Error mitigation techniques, while instrumental in extending the capabilities of near-term quantum computers, often suffer from exponential resource scaling with noise levels. To address this limitation, we introduce a novel approach, constant runtime Error Mitigation by Restricted Evolution (EMRE). Through numerical simulations, we demonstrate that EMRE surpasses the performance of Probabilistic Error Cancellation (PEC) while maintaining constant sample complexity. Moreover, we uncover a continuous family of error mitigation protocols, Hybrid EMREs (HEMREs), encompassing PEC and EMRE as special cases. HEMREs offer a tunable bias parameter, allowing for a trade-off between sample complexity and error reduction. Thus, our error mitigation protocols provide flexibility in balancing error mitigation with computational overhead, catering to practical application requirements of near-term and early-fault tolerant quantum devices.