SearcharxivSearch

arXiv subjects

You Quan Chong

Publications and source records attributed to You Quan Chong.

3 recordsLinked to original sources

Integrated error-suppressed pipeline for quantum optimization of nontrivial binary combinatorial optimization problems on gate-model hardware at the 156-qubit scale

We introduce a novel hybrid quantum-classical variational optimization method for unconstrained binary combinatorial optimization problems on gate-model quantum computers, integrating a custom variational ansatz, staged feedback-based dual variational parameter update strategies, efficient parametric compilation, automated error suppression during hardware execution, and scalable O($n$) classical post-processing to correct for bitflip errors. Without this integrated approach, we show that standard circuit execution at scale produces output indistinguishable from random sampling, establishing the necessity of each pipeline component. We benchmark the method on IBM superconducting quantum computers for classically nontrivial optimization problems, where the optimization is conducted on hardware with no use of classical simulation or prior knowledge of the solution. For Max-Cut on random regular graphs with topologies not matched to device connectivity, the method achieves approximation ratios of 100% for unweighted 3-regular graphs up to 156 nodes, weighted regular graphs up to 80 nodes, and weighted 7-regular graphs up 50 nodes. Applied to higher-order binary optimization, the method finds the ground state energy of 127- and 156-qubit spin-glass models matched to device topology with linear, quadratic, and cubic interaction terms, achieving approximation ratios of at least 99.5% across all instances tested. The method consistently outperforms a classical local solver across all problems. Where published results on identical problem instances are available, our method demonstrates competitive or superior performance. These results demonstrate that an appropriately engineered approach enables gate-model quantum computers to produce high-quality solutions for nontrivial binary optimization problems at the 156 qubit scale, where naive implementations are insufficient for good performance.

quant-ph

The nested Algebraic Bethe Ansatz for the supersymmetric t-J and Tensor Networks

We consider a model of strongly correlated electrons in 1D called the t-J model, which was solved by graded algebraic Bethe ansatz. We use it to design graded tensor networks which can be contracted approximately to obtain a Matrix Product State. As a proof of principle, we calculate observables of ground states and excited states of finite lattices up to $18$ lattice sites.

cond-mat.str-el

A hierarchy of self-consistent stochastic boundary conditions for Ising lattice simulations

We describe a hierarchy of stochastic boundary conditions (SBCs) that can be used to systematically eliminate finite size effects in Monte Carlo simulations of Ising lattices. For an Ising model on a $100 \times 100$ square lattice, we measured the specific heat, the magnetic susceptibility, and the spin-spin correlation using SBCs of the two lowest orders, to show that they compare favourably against periodic boundary conditions (PBC) simulations and analytical results. To demonstrate how versatile the SBCs are, we then simulated an Ising lattice with a magnetized boundary, and another with an open boundary, measuring the magnetization, magnetic susceptibility, and longitudinal and transverse spin-spin correlations as a function of distance from the boundary.

cond-mat.stat-mech