SearcharxivSearch

arXiv subjects

Hao-Yu Guan

Publications and source records attributed to Hao-Yu Guan.

3 recordsLinked to original sources

Optimal Effective Hamiltonian for Quantum Computing and Simulation

The effective Hamiltonian serves as the conceptual pivot of quantum engineering, transforming physical complexity into programmable logic; yet, its construction remains compromised by the mathematical non-uniqueness of block diagonalization, which introduces an intrinsic "gauge freedom" that standard methods fail to resolve. We address this by establishing the Least Action Unitary Transformation (LAUT) as the fundamental principle for effective models. By minimizing geometric action, LAUT guarantees dynamical fidelity and inherently enforces the preservation of symmetries--properties frequently violated by conventional Schrieffer-Wolff and Givens rotation techniques. We identify the Bloch-Brandow formalism as the natural perturbative counterpart to this principle, yielding analytic expansions that preserve symmetries to high order. We validate this framework against experimental data from superconducting quantum processors, demonstrating that LAUT quantitatively reproduces interaction rates in driven entangling gates where standard approximations diverge. Furthermore, in tunable coupler architectures, we demonstrate that the LAUT approach captures essential non-rotating-wave contributions that standard models neglect; this inclusion is critical for quantitatively reproducing interaction rates and revealing physical multi-body interactions such as $XZX+YZY$, which are verified to be physical rather than gauge artifacts. By reconciling variational optimality with analytical tractability, this work provides a systematic, experimentally validated route for high-precision system learning and Hamiltonian engineering.

quant-ph

Photon-Number Conserved Universal Quantum Logic Employing Continuous-Time Quantum Walk on Dual-Rail Qubit Arrays

We demonstrate a synergy between dual-rail qubit encoding and continuous-time quantum walks (CTQW) to realize universal quantum logic in superconducting circuits. Utilizing the photon-number-conserving dynamics of CTQW on dual-rail transmons, which systematically transform leakage and relaxation into erasure events, our architecture facilitates the suppression of population leakage and the implementation of high-fidelity quantum gates. We construct single-, two-, and three-qubit operations that preserve dual-rail encoding, facilitated by tunable coupler strengths compatible with current superconducting qubit platforms. Numerical simulations confirm robust behavior against dephasing, relaxation, and imperfections in coupling, underscoring the erasure-friendly nature of the system. This hardware-efficient scheme thus provides a practical pathway to early fault-tolerant quantum computation.

quant-ph

Weaving Complex Graph on simple low-dimensional qubit lattices

In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from simple qubit arrays, specifically grid lattices. The first approach utilizes a subset of qubits as tunable couplers, effectively yielding a range of non-trivial graph-based Hamiltonians. The second approach employs dynamic graph engineering by periodically activating and deactivating couplers, enabling the creation of effective quantum walks with longer-range couplings. Numerical simulations verify the effective dynamics of these approaches. In terms of these two approaches, we explore implementing various graphs, including cubes and fullerenes, etc, on two-dimensional lattices. These techniques facilitate the realization of analog quantum simulation, particularly continuous-time quantum walks discussed in detail in this manuscript, for different computational tasks on superconducting quantum chips despite their inherent low dimensional simple architecture.

quant-ph