Researcher profile

Chen-Yu Liu

Chen-Yu Liu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 15 - UnverifiedVerification L1Unclaimed author
3works
0followers
9topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states. Quantum FWPs (QFWPs) extend this idea with variational quantum circuits (VQCs), but existing implementations rely on multi-qubit architectures that are difficult to scale on noisy intermediate-scale quantum (NISQ) devices and expensive to simulate classically. We propose gated QKAN-FWP, a fast-weight framework that integrates FWP with Quantum-inspired Kolmogorov-Arnold Network (QKAN) using single-qubit data re-uploading circuits as learnable nonlinear activation, known as DatA Re-Uploading ActivatioN (DARUAN). We further introduce a scalar-gated fast-weight update rule that stabilizes parameter evolution, supported by a theoretical analysis of its adaptive memory kernel, geometric boundedness, and parallelizable gradient paths. We evaluate the framework across time-series benchmarks, MiniGrid reinforcement learning, and highlight real-world solar cycle forecasting as our main practical result. In the long-horizon setting with 528-month input window and 132-month forecast horizon, our 12.5k-parameter model achieves lower scaled Mean Square Error (MSE), peak amplitude error, and peak timing error than a suite of classical recurrent baselines with up to 13x more parameters, including Long Short-Term Memory (LSTM) networks (25.9k-89.1k parameters), WaveNet-LSTM (167k), Vanilla recurrent neural network (11.5k), and a Modified Echo State Network (132k). To validate NISQ compatibility, we further deploy the trained fast programmer on IonQ and IBM Quantum processors, recovering forecasting accuracy within 0.1% relative MSE of the noiseless simulator at 1024 shots. These results position gated QKAN-FWP as a scalable, parameter-efficient, and NISQ-compatible approach to quantum-inspired sequence modeling.

preprint2022arXiv

Electric dipole moments and the search for new physics

Static electric dipole moments of nondegenerate systems probe mass scales for physics beyond the Standard Model well beyond those reached directly at high energy colliders. Discrimination between different physics models, however, requires complementary searches in atomic-molecular-and-optical, nuclear and particle physics. In this report, we discuss the current status and prospects in the near future for a compelling suite of such experiments, along with developments needed in the encompassing theoretical framework.

preprint2022arXiv

Hybrid Gate-Based and Annealing Quantum Computing for Large-Size Ising Problems

One of the major problems of most quantum computing applications is that the required number of qubits to solve a practical problem is much larger than that of today's quantum hardware. We propose an algorithm, called large-system sampling approximation (LSSA), to solve Ising problems with sizes up to $N_{\rm{gb}}2^{N_{\rm{gb}}}$ by an $N_{\rm{gb}}$-qubit gate-based quantum computer, and with sizes up to $N_{\rm{an}}2^{N_{\rm{gb}}}$ by a hybrid computational architecture of an $N_{\rm{an}}$-qubit quantum annealer and an $N_{\rm{gb}}$-qubit gate-based quantum computer. By dividing the full-system problem into smaller subsystem problems, the LSSA algorithm then solves the subsystem problems by either gate-based quantum computers or quantum annealers, optimizes the amplitude contributions of the solutions of the different subsystems with the full-problem Hamiltonian by the variational quantum eigensolver (VQE) on a gate-based quantum computer, and determines the approximated ground-state configuration. We apply the level-1 approximation of LSSA to solving fully-connected random Ising problems up to 160 variables using a 5-qubit gate-based quantum computer, and solving portfolio optimization problems up to 4096 variables using a 100-qubit quantum annealer and a 7-qubit gate-based quantum computer. We demonstrate the use of the level-2 approximation of LSSA to solve the portfolio optimization problems up to 5120 ($N_{\rm{gb}}2^{2N_{\rm{gb}}}$) variables with pretty good performance by using just a 5-qubit ($N_{\rm{gb}}$-qubit) gate-based quantum computer. The completely new computational concept of the hybrid gate-based and annealing quantum computing architecture opens a promising possibility to investigate large-size Ising problems and combinatorial optimization problems, making practical applications by quantum computing possible in the near future.