Source author record

Yu Cao

Yu Cao appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

2works
4topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

2 published item(s)

preprint2026arXiv

Bridging the Last Mile of Circuit Design: PostEDA-Bench, a Hierarchical Benchmark for PPA Convergence and DRC Fixing

LLM-based agents are increasingly applied to the "last mile" of Electronic Design Automation (EDA): repairing residual sign-off Design Rule Check (DRC) violations and converging Power-Performance-Area (PPA) targets after tool runs. Existing EDA-LLM benchmarks, however, omit DRC fixing entirely and rely on flat hierarchies tied to a single toolchain. We introduce PostEDA-Bench, a hierarchical benchmark with 145 tasks across DRC-Essential, DRC-Reasoning, PPA-Mono, and PPA-Multi, supported by EDA toolchains with machine-checkable evaluation. Across eight commercial and open-source LLMs under multiple agent scaffolds, we find that agents handle synthetic DRC-Essential and single-objective PPA-Mono reasonably well but degrade sharply on the more practical DRC-Reasoning, where the best success rate is 36.66%, and PPA-Multi, where the best success rate is 20.00%; vision augmentation consistently enhances DRC-Bench; and trade-off reasoning, rather than knob knowledge, is the dominant PPA-Multi bottleneck.

preprint2026arXiv

Quantum Neural Ordinary and Partial Differential Equations

We introduce a unified framework -- Quantum Neural Ordinary and Partial Differential Equations (QNODEs and QNPDEs) -- which extends the continuous-time formalism of classical neural ordinary and partial differential equations into quantum machine learning and quantum control. QNODEs denote the evolution of finite-dimensional quantum systems, whereas QNPDEs denote their infinite-dimensional (continuous-variable) counterparts; both are governed by generalised Schrödinger-type Hamiltonian dynamics, coupled with a corresponding loss function. This formalism permits gradient estimation via an adjoint-state method, facilitating efficient learning of quantum dynamics, and other dynamics that can be mapped (relatively easily) to quantum dynamics. Using this method, we present quantum algorithms for computing gradients with and without time discretisation, achieving efficient gradient computation that would otherwise be intractable on classical devices. We provide detailed resource estimates for these algorithms and investigate the local energy landscape for training. The formalism subsumes a wide array of applications, including quantum state preparation, Hamiltonian learning, learning dynamics in open systems, and the learning of both autonomous and non-autonomous classical ODEs and PDEs. In many cases of interest, the Hamiltonian is composed of a relatively small number of local operators, yet the corresponding classical simulation remains inefficient, making quantum approaches advantageous for gradient estimation. This continuous-time perspective can also serve as a blueprint for designing novel quantum neural network architectures, generalising discrete-layered models into continuous-depth models.