Searcharxiv⌕ Search

arXiv subjects

Yu-Hao Chen

Publications and source records attributed to Yu-Hao Chen.

4 recordsLinked to original sources

Pool-free, residual-triggered ansatz growth for variational imaginary-time evolution: when a fixed operator order beats adaptive screening

Adaptive variational algorithms such as ADAPT-VQE and AVQITE screen an operator pool at every growth step, and ADAPT-VQE also re-optimizes all parameters. We study a pool-free alternative for variational imaginary-time evolution (VITE). The layers are fixed in advance by nested commutators of the Hamiltonian, grouped by symmetry and particle number, and the next layer is appended when the relative McLachlan residual exceeds a threshold. On five non-integrable systems (the mixed-field Ising chain and tori, and stretched H$_4$), this dynamic VITE reaches a relative error of $10^{-4}$ with 1.6-5.4 times fewer circuits than the cheapest of six to eight adaptive variants, including single-Pauli-string and qubit-excitation pools and batched ADAPT-VQE. On the chain the advantage persists from 8 to 16 sites. Screening and re-optimization account for most of the adaptive methods' cost. On the spin models, a longitudinal-field scan shows that the advantage requires broken integrability, which makes adaptive screening expensive. The advantage is lost on transverse-field Ising models, at tight targets (relative error $10^{-6}$) and where the schedule front-loads weak layers.

quant-ph↗

Quantum circuit synthesis for fermionic excitations in coupled cluster theory

This work provides a step-by-step quantum computing derivation of the unitary coupled cluster singles and doubles ansatz. We show how the structure of the ansatz emerges from fermionic algebra under unitary constraints. By explicitly connecting second quantization, Jordan-Wigner mapping, and quantum circuit synthesis, we clarify conceptual gaps between quantum physics and quantum computing implementations, particularly regarding operator locality, commutation structure, and hardware realization. We exemplify the procedure on the singles and doubles coupled cluster ansatz for the hydrogen molecule.

quant-ph↗

Making the zeroth-order process fidelity independent of state preparation and measurement errors

In this work, we demonstrate that the zero-fidelity, an approximation to the process fidelity, when combined with randomized benchmarking, becomes robust to state preparation and measurement (SPAM) errors. However, as randomized benchmarking requires randomly choosing an increasingly large number of Clifford elements from the Clifford group when the qubit number increases, this combination is also limited to quantum systems with up to three qubits. To make the zero-fidelity independent of SPAM errors and, at the same time, applicable to multi-qubit systems, we employ a channel noise scaling method similar to the method of global unitary folding, or identity scaling, used for quantum error mitigation.

quant-ph↗

Quantum Speedup for the Maximum Cut Problem

Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of the $n$ vertices into disjoint subsets $V_1$ and $V_2$ such that the number of edges between them is as large as possible. Classically, it is an NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning and network science to clustering. In this paper, we propose a quantum algorithm to solve the maximum cut problem for any graph $G$ with a quadratic speedup over its classical counterparts, where the temporal and spatial complexities are reduced to, respectively, $O(\sqrt{2^n/r})$ and $O(m^2)$. With respect to oracle-related quantum algorithms for NP-complete problems, we identify our algorithm as optimal. Furthermore, to justify the feasibility of the proposed algorithm, we successfully solve a typical maximum cut problem for a graph with three vertices and two edges by carrying out experiments on IBM's quantum computer.

quant-ph↗