arXiv subjects

Hans Hon Sang Chan

Publications and source records attributed to Hans Hon Sang Chan.

6 recordsLinked to original sources

arXiv2026

Improved Grid-Based Simulation of Coulombic Dynamics

Accurate time-dependent quantum dynamics of Coulombic systems on grid-based representations remains computationally demanding due to the singularity of the Coulomb potential, which necessitates extremely fine spatial grids to mitigate discretisation errors. We propose two complementary correction schemes that, under identical resource budgets, consistently outperform the uncorrected counterparts. The first scheme modifies the potential operator to incorporate grid-basis structure into its representation, while the second introduces a corrected initial wavefunction inspired by analytical solutions of softened Coulomb potentials. Applied to hydrogenic systems, these corrections deliver improved energy accuracy and time fidelity across long evolutions. Beyond classical simulations, the proposed framework aligns naturally with quantum computing architectures, where the corrected operators and states can be encoded through truncated Walsh and Fourier series expansions. A resource analysis for the representative 2D hydrogen system yields a circuit depth of $1.5\times10^{8}$ gates over 6,000 Trotter steps. This study thus establishes practical strategies toward high-accuracy Coulombic dynamics on both classical and emerging quantum platforms.

quant-ph↗

arXiv2026

Quantum Resource Assay for the Grid-Based Simulation of the Photodynamics of Pyrazine

We establish and analyse the performance and resource requirements of an end-to-end fault-tolerant quantum algorithm for computing the absorption spectrum and population dynamics of photoexcited pyrazine. The quantum circuit construction consists of initial state preparation using uniformly controlled rotations, the time-dependent Hamiltonian propagation based on the grid-based Split Operator Quantum Fourier Transform (SO-QFT) method, and cost-effective measurements including statistical and canonical phase estimation. We use classical emulations to validate the quantum resources required for the task, and propose generalised formulae for the qubit count and gate depth calculation. Simulating the vibronic dynamics of pyrazine in a low-dimensional abstraction requires 17-qubit circuits with a gate depth of $\mathcal{O}(10^5)$, whereas a full-dimensional simulation of pyrazine in 24 modes requires at least 97-qubit circuits with a gate depth of $\mathcal{O}(10^6)$. Our work provides a foundational framework for understanding high-dimensional wavepacket-based quantum simulations of photo-induced dynamics and vibronic spectra, anticipating future applications in the simulation of even larger molecular systems on fault-tolerant quantum computers.

quant-ph↗

arXiv2024

Algorithmic Shadow Spectroscopy

We present shadow spectroscopy as a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits) beyond performing time evolution and measurements. The approach builds on the fundamental feature that every observable property of a quantum system must evolve according to the same harmonic components: we can reveal them by post-processing classical shadows of time-evolved quantum states to extract a large number of time-periodic signals $N_o\propto 10^8$, whose frequencies correspond to Hamiltonian energy differences with Heisenberg-limited precision. We provide strong analytical guarantees that (a) quantum resources scale as $O(\log N_o)$, while the classical computational complexity is linear $O(N_o)$, (b) the signal-to-noise ratio increases with the number of processed signals as $\propto \sqrt{N_o}$, and (c) spectral peak positions are immune to reasonable levels of noise. We demonstrate our approach on model spin systems and the excited state conical intersection of molecular CH$_2$ and verify that our method is indeed intuitively easy to use in practice, robust against gate noise, amiable to a new type of algorithmic-error mitigation technique, and uses orders of magnitude fewer number of shots than typical near-term quantum algorithms -- as low as 10 shots per timestep is sufficient. Finally, we measured a high-quality, experimental shadow spectrum of a spin chain on readily-available IBM quantum computers, achieving the same precision as in noise-free simulations without using any advanced error mitigation, and verified scalability in tensor-network simulations of up to 100-qubit systems.

quant-ph↗

arXiv2023

Simulating non-unitary dynamics using quantum signal processing with unitary block encoding

We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using exactly emulated quantum circuits. We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states. For the task of ground state preparation, we confirm that the probability of successful post-selection is quadratic in the initial reference state overlap $γ$ as $O(γ^2)$. When applied instead to thermal state preparation, we show QET-U can directly estimate partition functions at exponential cost. Finally, we combine QET-U with Trotter product formula to perform non-normal Hamiltonian simulation in the propagation of Lindbladian open quantum system dynamics. We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.

quant-ph↗

arXiv2023

Grid-based methods for chemistry simulations on a quantum computer

First quantized, grid-based methods for chemistry modelling are a natural and elegant fit for quantum computers. However, it is infeasible to use today's quantum prototypes to explore the power of this approach, because it requires a significant number of near-perfect qubits. Here we employ exactly-emulated quantum computers with up to 36 qubits, to execute deep yet resource-frugal algorithms that model 2D and 3D atoms with single and paired particles. A range of tasks is explored, from ground state preparation and energy estimation to the dynamics of scattering and ionisation; we evaluate various methods within the split-operator QFT (SO-QFT) Hamiltonian simulation paradigm, including protocols previously-described in theoretical papers as well as our own novel techniques. While we identify certain restrictions and caveats, generally the grid-based method is found to perform very well; our results are consistent with the view that first quantized paradigms will be dominant from the early fault-tolerant quantum computing era onward.

quant-ph↗

arXiv2021

Molecular Excited State Calculations with Adaptive Wavefunctions on a Quantum Eigensolver Emulation: Reducing Circuit Depth and Separating Spin States

Ab initio electronic excited state calculations are necessary for the quantitative study of photochemical reactions, but their accurate computation on classical computers is plagued by prohibitive scaling. The Variational Quantum Deflation (VQD) is an extension of the Variational Quantum Eigensolver (VQE) for calculating electronic excited state energies, and has the potential to address some of these scaling challenges using quantum computers. However, quantum computers available in the near term can only support a limited number of circuit operations, so reducing the quantum computational cost in VQD methods is critical to their realisation. In this work, we investigate the use of adaptive quantum circuit growth (ADAPT-VQE) in excited state VQD calculations, a strategy that has been successful previously in reducing the resource for ground state energy VQE calculations. We also invoke spin restrictions to separate the recovery of eigenstates with different spin symmetry to reduce the number of calculations and accumulation of errors. We created a quantum eigensolver emulation package - Quantum Eigensolver Building on Achievements of Both quantum computing and quantum chemistry (QEBAB) - for testing the proposed adaptive procedure against two VQD methods that use fixed-length quantum circuits. For a lithium hydride test case we found that the spin-restricted adaptive growth variant of VQD uses the most compact circuits by far, consistently recovers adequate electron correlation energy for different nuclear geometries and eigenstates while isolating the singlet and triplet manifold. This work is a further step towards developing techniques which improve the efficiency of hybrid quantum algorithms for excited state quantum chemistry, opening up the possibility of exploiting real quantum computers for electronic excited state calculations sooner than previously anticipated.

quant-ph↗