arXiv subjects

Yu-Hao Chen

Publications and source records attributed to Yu-Hao Chen.

3 recordsLinked to original sources

arXiv2026

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↗

arXiv2026

Quantum circuit synthesis for fermionic excitations in coupled cluster theory using the Jordan-Wigner mapping

This work provides a quantum-computing-first derivation of the Unitary Coupled Cluster ansatz, showing that its structure emerges naturally from fermionic algebra under unitary constraints. By explicitly connecting second quantization, Jordan-Wigner mapping, and circuit synthesis, we clarify conceptual gaps between quantum chemistry and quantum computing implementations, particularly regarding operator locality, commutation structure, and hardware realization.

quant-ph↗

arXiv2023

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↗