Searcharxiv⌕ Search

arXiv subjects

Huan-Hai Zhou

Publications and source records attributed to Huan-Hai Zhou.

2 recordsLinked to original sources

Sampling isometric tensor network states with monitored quantum circuits

Projected entangled pair states (PEPS) provide an efficient variational ansatz for two-dimensional quantum phases, but computing observables remains challenging because PEPS contraction is generally costly. Here, we parameterize two-dimensional quantum states using variational PEPS subject to isometric constraints and map the resulting ansatz onto monitored quantum circuits, replacing tensor-network contraction with circuit sampling. For infinite cylinders, the transfer matrix defines a quantum channel on the virtual boundary. We use a fixed-point treatment and a monitored-circuit unraveling of this channel to evaluate observables efficiently. Using a constant number of variational parameters and a number of qubits that scales only with the cylinder width, our method yields a phase diagram for the $J_1$-$J_2$ model in qualitative agreement with DMRG results. Because the monitored circuits are compatible with near-term quantum hardware, this approach provides a hybrid quantum-classical framework for simulating two-dimensional quantum many-body systems.

quant-ph↗

Encoding computationally hard problems in triangular Rydberg atom arrays

Rydberg atom arrays are a promising platform for quantum optimization, encoding computationally hard problems by reducing them to independent set problems with unit-disk graph topology. In Nguyen et al., PRX Quantum 4, 010316 (2023), a systematic and efficient strategy was introduced to encode multiple problems into a special unit-disk graph: the King's subgraph. However, King's subgraphs are not the optimal choice in two dimensions. Due to the power-law decay of Rydberg interaction strengths, the approximation to unit-disk graphs in real devices is poor, necessitating post-processing that lacks physical interpretability. In this work, we develop an encoding scheme that can universally encode computationally hard problems on triangular lattices, based on our innovative automated gadget search strategy. Numerical simulations demonstrate that quantum optimization on triangular lattices reduces independence-constraint violations by approximately two orders of magnitude compared to King's subgraphs, substantially alleviating the need for post-processing in experiments.

quant-ph↗