Source author record

Guanyu Zhu

Guanyu Zhu 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

19works
17topics
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

19 published item(s)

preprint2026arXiv

HiDrive: A Closed-Loop Benchmark for High-Level Autonomous Driving

End-to-end autonomous driving has witnessed rapid progress, yet existing benchmarks are increasingly saturated, with state-of-the-art models achieving near-perfect scores on widely used open-loop and closed-loop benchmarks. This saturation does not mean that the problem has been solved; instead, it reveals that current benchmarks remain limited in scenario diversity, object variety, and the breadth of driving capabilities they evaluate. In particular, they lack sufficient long-tail scenarios involving rare but safety-critical objects and fail to assess advanced decision-making such as legal compliance, ethical reasoning, and emergency response. To address these gaps, we propose HiDrive, a new closed-loop benchmark for end-to-end autonomous driving that emphasizes long-tail scenarios and a richer evaluation of driving capabilities. HiDrive introduces a diverse set of rare objects and uncommon traffic situations, and expands evaluation from basic driving skills to more advanced capabilities, including rule compliance, moral reasoning, and context-dependent emergency maneuvers. Correspondingly, we extend previous collision-avoidance-centered metrics into a comprehensive evaluation system that encompasses collision and braking, traffic-rule compliance, and moral-reasoning indicators. Built on a more advanced physics engine, HiDrive provides physically realistic lighting and high-fidelity visual rendering, offering a more challenging and realistic testbed for assessing whether autonomous driving systems can handle the complexity of real-world deployment. The HiDrive software, source code, digital assets, and documentation are available at https://github.com/VDIGPKU/HiDrive.

preprint2026arXiv

Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes

A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical non-Clifford gates, one needs to resort to 3D product-code constructions. In this work, we extend Kitaev's framework of non-Abelian topological codes on manifolds to non-Abelian qLDPC codes (realized as Clifford-stabilizer codes) and the corresponding combinatorial topological quantum field theories (TQFT) defined on Poincaré CW complexes and certain types of general chain complexes. We also construct the spacetime path integrals as topological invariants on these complexes. Remarkably, we show that native non-Clifford logical gates can be realized using constant-rate 2D hypergraph-product codes and their Clifford-stabilizer variants. This is achieved by a spacetime path integral effectively implementing the addressable gauging measurement of a new type of 0-form subcomplex symmetries, which correspond to addressable transversal Clifford gates and become higher-form symmetries when lifted to higher-dimensional CW complexes or manifolds. Building on this structure, we apply the gauging protocol to the magic state fountain scheme for parallel preparation of $O(\sqrt{n})$ disjoint CZ magic states with code distance of $O(\sqrt{n})$, using a total number of $n$ qubits.

preprint2026arXiv

On the Role of Language Representations in Auto-Bidding: Findings and Implications

Auto-bidding is a crucial task in real-time advertising markets, where policies must optimize long-horizon value under delivery constraints (e.g., budget and CPA). Existing methods for auto-bidding rely on compact numerical state representations: while they can implicitly capture delivery dynamics, they offer limited support for explicitly representing and controlling high-level intent, evolving feedback, and operator-style strategic guidance in real campaigns. Meanwhile, Large Language Models (LLMs) offer a powerful method for encoding semantic information, it remains unclear when LLMs help and how to integrate them without sacrificing numerical precision. Through systematic preliminary studies, we find that (1) LLM embeddings contain bidding-relevant cues yet cannot replace numerical features, and (2) gains emerge only with careful semantic--numeric integration rather than naive concatenation. Motivated by these findings, we propose \textit{SemBid}, a novel auto-bidding framework that injects LLM-encoded semantics into offline bidding trajectories at the token level. SemBid introduces three semantic inputs: \textit{Task}, \textit{History}, and \textit{Strategy}. It injects these semantics as tokens alongside numerical trajectory tokens and uses self-attention to integrate them, improving controllability and generalization across objectives. Across diverse scenarios and budget regimes, SemBid outperforms competitive baselines from offline RL and generative sequence modeling, with more consistent gains in overall performance, constraint satisfaction, and robustness. Our code is available at: \href{https://github.com/AlanYu04/SemBid-KDD2026}{\textcolor{blue}{here}}.

preprint2022arXiv

Deconfinement and Error Thresholds in Holography

We study the error threshold properties of holographic quantum error-correcting codes. We demonstrate that holographic CFTs admit an algebraic threshold, which is related to the confinement-deconfinement phase transition. We then apply geometric intuition from holography and the Hawking-Page phase transition to motivate the CFT result, and comment on potential extensions to other confining theories.

preprint2022arXiv

Fault-tolerant error correction for a universal non-Abelian topological quantum computer at finite temperature

We study fault-tolerant error correction in a quantum memory constructed as a two-dimensional model of Fibonacci anyons on a torus, in the presence of thermal noise represented by pair-creation processes and measurement errors. The correction procedure is based on the cellular automaton decoders originating in the works of Gács and Harrington. Through numerical simulations, we observe that this code behaves fault-tolerantly and that threshold behavior is likely present. Hence, we provide strong evidence for the existence of a fault-tolerant universal non-Abelian topological quantum computer.

preprint2021arXiv

Many-body Chern number from statistical correlations of randomized measurements

One of the main topological invariants that characterizes several topologically-ordered phases is the many-body Chern number (MBCN). Paradigmatic examples include several fractional quantum Hall phases, which are expected to be realized in different atomic and photonic quantum platforms in the near future. Experimental measurement and numerical computation of this invariant is conventionally based on the linear-response techniques which require having access to a family of states, as a function of an external parameter, which is not suitable for many quantum simulators. Here, we propose an ancilla-free experimental scheme for the measurement of this invariant, without requiring any knowledge of the Hamiltonian. Specifically, we use the statistical correlations of randomized measurements to infer the MBCN of a wavefunction. Remarkably, our results apply to disk-like geometries that are more amenable to current quantum simulator architectures.

preprint2020arXiv

Quasi-exact quantum computation

We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding exact codes, serving as its fixed points. The computation with a quasi-exact code cannot realize any logical gate to arbitrary accuracy. To overcome this, the notion of quasi-exact universality is proposed, which makes quasi-exact quantum computation a feasible model especially for executing moderate-size algorithms. We find that the incompatibility between universality and transversality of the set of logical gates does not persist in the quasi-exact scenario. A class of covariant quasi-exact codes is defined which proves to support transversal and quasi-exact universal set of logical gates for $SU(d)$. This work opens the possibility of quantum computation with quasi-exact universality, transversality, and fault tolerance.

preprint2020arXiv

Triangular color codes on trivalent graphs with flag qubits

The color code is a topological quantum error-correcting code supporting a variety of valuable fault-tolerant logical gates. Its two-dimensional version, the triangular color code, may soon be realized with currently available superconducting hardware despite constrained qubit connectivity. To guide this experimental effort, we study the storage threshold of the triangular color code against circuit-level depolarizing noise. First, we adapt the Restriction Decoder to the setting of the triangular color code and to phenomenological noise. Then, we propose a fault-tolerant implementation of the stabilizer measurement circuits, which incorporates flag qubits. We show how information from flag qubits can be used with the Restriction Decoder to maintain the effective distance of the code. We numerically estimate the threshold of the triangular color code to be 0.2%, which is competitive with the thresholds of other topological quantum codes. We also prove that 1-flag stabilizer measurement circuits are sufficient to preserve the full code distance, which may be used to find simpler syndrome extraction circuits of the color code.

preprint2020arXiv

Universal Logical Gates on Topologically Encoded Qubits via Constant-Depth Unitary Circuits

A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order the code distance, and thus braided, by a constant depth local unitary quantum circuit followed by a permutation of qubits. Our gates are protected in the sense that the length of error strings do not grow by more than a constant factor. When applied to the Fibonacci code, our results demonstrate that a universal logical gate set can be implemented on encoded qubits through a constant depth unitary quantum circuit, and without increasing the asymptotic scaling of the space overhead. These results also apply directly to braiding of topological defects in surface codes. Our results reformulate the notion of braiding in general as an effectively instantaneous process, rather than as an adiabatic, slow process.

preprint2019arXiv

Instantaneous braids and Dehn twists in topologically ordered states

A defining feature of topologically ordered states of matter is the existence of locally indistinguishable states on spaces with non-trivial topology. These degenerate states form a representation of the mapping class group (MCG) of the space, which is generated by braids of defects or anyons, and by Dehn twists along non-contractible cycles. These operations can be viewed as fault-tolerant logical gates in the context of topological quantum error correcting codes and topological quantum computation. Here we show that braids and Dehn twists can in general be implemented by a constant depth quantum circuit, with a depth that is independent of code distance $d$ and system size. The circuit consists of a constant depth local quantum circuit (LQC) implementing a local geometry deformation of the quantum state, followed by a permutation on (relabelling of) the qubits. The permutation requires permuting qubits that are separated by a distance of order $d$; it can be implemented by collective classical motion of mobile qubits or as a constant depth circuit using long-range SWAP operations (with a range set by $d$) on immobile qubits. Applying these results to certain non-Abelian quantum error correcting codes demonstrates how universal logical gate sets can be implemented on encoded qubits using only constant depth unitary circuits.

preprint2019arXiv

Many-body topological invariants from randomized measurements

The classification of symmetry-protected topological (SPT) phases in one dimension has been recently achieved, and had a fundamental impact in our understanding of quantum phases in condensed matter physics. In this framework, SPT phases can be identified by many-body topological invariants, which are quantized non-local correlators for the many-body wavefunction. While SPT phases can now be realized in interacting synthethic quantum systems, the direct measurement of quantized many-body topological invariants has remained so far elusive. Here, we propose measurement protocols for many-body topological invariants for all types of protecting symmetries of one-dimensional interacting bosonic systems. Our approach relies on randomized measurements implemented with local random unitaries, and can be applied to any spin system with single-site addressability and readout. Our scheme thus provides a versatile toolbox to experimentally classify interacting SPT phases.

preprint2019arXiv

Quantum Origami: Transversal Gates for Quantum Computation and Measurement of Topological Order

In topology, a torus remains invariant under certain non-trivial transformations known as modular transformations. In the context of topologically ordered quantum states of matter, these transformations encode the braiding statistics and fusion rules of emergent anyonic excitations and thus serve as a diagnostic of topological order. Moreover, modular transformations of higher genus surfaces, e.g. a torus with multiple handles, can enhance the computational power of a topological state, in many cases providing a universal fault-tolerant set of gates for quantum computation. However, due to the intrusive nature of modular transformations, which abstractly involve global operations and manifold surgery, physical implementations of them in local systems have remained elusive. Here, we show that by folding manifolds, modular transformations can be applied in a single shot by independent local unitaries, providing a novel class of transversal logic gates for fault-tolerant quantum computation. Specifically, we demonstrate that multi-layer topological states with appropriate boundary conditions and twist defects allow modular transformations to be effectively implemented by a finite sequence of local SWAP gates between the layers. We further provide methods to directly measure the modular matrices, and thus the fractional statistics of anyonic excitations, providing a novel way to directly measure topological order.

preprint2019arXiv

Topological and subsystem codes on low-degree graphs with flag qubits

In this work we introduce two code families, which we call the heavy hexagon code and heavy square code. Both code families are implemented by assigning physical data and ancilla qubits to both vertices and edges of low degree graphs. Such a layout is particularly suitable for superconducting qubit architectures to minimize frequency collisions and crosstalk. In some cases, frequency collisions can be reduced by several orders of magnitude. The heavy hexagon code is a hybrid surface/Bacon-Shor code mapped onto a (heavy) hexagonal lattice whereas the heavy square code is the surface code mapped onto a (heavy) square lattice. In both cases, the lattice includes all the ancilla qubits required for fault-tolerant error-correction. Naively, the limited qubit connectivity might be thought to limit the error-correcting capability of the code to less than its full distance. Therefore, essential to our construction is the use of flag qubits. We modify minimum weight perfect matching decoding to efficiently and scalably incorporate information from measurements of the flag qubits and correct up to the full code distance while respecting the limited connectivity. Simulations show that high threshold values for both codes can be obtained using our decoding protocol. Further, our decoding scheme can be adapted to other topological code families.

preprint2016arXiv

Measurement of many-body chaos using a quantum clock

There has been recent progress in understanding chaotic features in many-body quantum systems. Motivated by the scrambling of information in black holes, it has been suggested that the time dependence of out-of-time-ordered (OTO) correlation functions such as $\langle O_2(t) O_1(0) O_2(t) O_1(0) \rangle $ is a faithful measure of quantum chaos. Experimentally, these correlators are challenging to access since they apparently require access to both forward and backward time evolution with the system Hamiltonian. Here, we propose a protocol to measure such OTO correlators using an ancilla which controls the direction of time. Specifically, by coupling the state of ancilla to the system Hamiltonian of interest, we can emulate the forward and backward time propagation, where the ancilla plays the role of a 'quantum clock'. Within this scheme, the continuous evolution of the entire system (the system of interest and the ancilla) is governed by a time-independent Hamiltonian. Our protocol is immune to errors that could occur when the direction of time evolution is externally controlled by a classical switch.

preprint2016arXiv

Measurement Protocol for the Entanglement Spectrum of Cold Atoms

Entanglement, and, in particular the entanglement spectrum, plays a major role in characterizing many-body quantum systems. While there has been a surge of theoretical works on the subject, no experimental measurement has been performed to date because of the lack of an implementable measurement scheme. Here, we propose a measurement protocol to access the entanglement spectrum of many-body states in experiments with cold atoms in optical lattices. Our scheme effectively performs a Ramsey spectroscopy of the entanglement Hamiltonian and is based on the ability to produce several copies of the state under investigation together with the possibility to perform a global swap gate between two copies conditioned on the state of an auxiliary qubit. We show how the required conditional swap gate can be implemented with cold atoms, either by using Rydberg interactions or coupling the atoms to a cavity mode. We illustrate these ideas on a simple (extended) Bose-Hubbard model where such a measurement protocol reveals topological features of the Haldane phase.

preprint2016arXiv

Nematic quantum liquid crystals of bosons in frustrated lattices

The problem of interacting bosons in frustrated lattices is an intricate one due to the absence of a unique minimum in the single-particle dispersion where macroscopic number of bosons can condense. Here we consider a family of tight-binding models with macroscopically degenerate lowest energy band, separated from other bands by a gap. We predict the formation of exotic states that spontaneously break rotational symmetry at relatively low filling. These states belong to three nematic phases: Wigner crystal, supersolid, and superfluid. The Wigner crystal phase is established exactly at low filling. Supersolid and superfluid phases, at larger filling, are obtained by making use of a projection onto the flat band, construction of an appropriate Wannier basis, and subsequent mean-field treatment. The nematic superfluid that we predict is uniform in real space but has an anisotropic momentum distribution, providing a novel scenario for Bose condensation with an additional nematic order. Our findings open up a promising direction of studying microscopic quantum liquid crystalline phases of bosons.

preprint2013arXiv

Asymptotic Expressions for Charge Matrix Elements of the Fluxonium Circuit

In charge-coupled circuit QED systems, transition amplitudes and dispersive shifts are governed by the matrix elements of the charge operator. For the fluxonium circuit, these matrix elements are not limited to nearest-neighbor energy levels and are conveniently tunable by magnetic flux. Previously, their values were largely obtained numerically. Here, we present analytical expressions for the fluxonium charge matrix elements. We show that new selection rules emerge in the asymptotic limit of large Josephson energy and small inductive energy. We illustrate the usefulness of our expressions for the qualitative understanding of charge matrix elements in the parameter regime probed by previous experiments.

preprint2013arXiv

Dispersive regime of the Jaynes-Cummings and Rabi lattice

Photon-based strongly-correlated lattice models like the Jaynes-Cummings and Rabi lattices differ from their more conventional relatives like the Bose-Hubbard model by the presence of an additional tunable parameter: the frequency detuning between the pseudo-spin degree of freedom and the harmonic mode frequency on each site. Whenever this detuning is large compared to relevant coupling strengths, the system is said to be in the dispersive regime. The physics of this regime is well-understood at the level of a single Jaynes-Cummings or Rabi site. Here, we extend the theoretical description of the dispersive regime to lattices with many sites, for both strong and ultra-strong coupling. We discuss the nature and spatial range of the resulting qubit-qubit and photon-photon coupling, demonstrate the emergence of photon- pairing and squeezing, and illustrate our results by exact diagonalization of the Rabi dimer.

preprint2012arXiv

Circuit QED with fluxonium qubits: theory of the dispersive regime

In circuit QED, protocols for quantum gates and readout of superconducting qubits often rely on the dispersive regime, reached when the qubit-photon detuning Δ is large compared to their mutual coupling strength. For qubits including the Cooper-pair box and transmon, selection rules dramatically restrict the contributions to dispersive level shifts χ. By contrast, without selection rules many virtual transitions contribute to χ and can produce sizable dispersive shifts even at large detuning. We present theory for a generic multi-level qudit capacitively coupled to one or multiple harmonic modes, and give general expressions for the effective Hamiltonian in second and fourth order perturbation theory. Applying our results to the fluxonium system, we show that the absence of strong selection rules explains the surprisingly large dispersive shifts observed in experiments and also leads to the prediction of a two-photon vacuum Rabi splitting. Quantitative predictions from our theory are in good agreement with experimental data over a wide range of magnetic flux and reveal that fourth-order resonances are important for the phase modulation observed in fluxonium spectroscopy.