arXiv subjects

Hong-Ye Hu

Publications and source records attributed to Hong-Ye Hu.

At least 37 records · Page 2Linked to original sources

arXiv2024

Efficiently measuring $d$-wave pairing and beyond in quantum gas microscopes

Understanding the mechanism of high-temperature superconductivity is among the most important problems in physics, for which quantum simulation can provide new insights. However, it remains challenging to characterize superconductivity in existing cold-atom quantum simulation platforms. Here, we introduce a protocol for measuring a broad class of observables in fermionic quantum gas microscopes, including long-range superconducting pairing correlations (after a repulsive-to-attractive mapping). The protocol only requires global controls followed by site-resolved particle number measurements -- capabilities that have been already demonstrated in multiple experiments -- and is designed by analyzing the Hilbert-space structure of dimers of two sites. The protocol is sample efficient and we further optimize our pulses for robustness to experimental imperfections such as lattice inhomogeneity. Our work introduces a general tool for manipulating quantum states on optical lattices, enhancing their ability to tackle problems such as that of high-temperature superconductivity.

cond-mat.quant-gas↗

arXiv2024

Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic

We introduce a quantum information theory-inspired method to improve the characterization of many-body Hamiltonians on near-term quantum devices. We design a new class of similarity transformations that, when applied as a preprocessing step, can substantially simplify a Hamiltonian for subsequent analysis on quantum hardware. By design, these transformations can be identified and applied efficiently using purely classical resources. In practice, these transformations allow us to shorten requisite physical circuit-depths, overcoming constraints imposed by imperfect near-term hardware. Importantly, the quality of our transformations is tunable: we define a 'ladder' of transformations that yields increasingly simple Hamiltonians at the cost of more classical computation. Using quantum chemistry as a benchmark application, we demonstrate that our protocol leads to significant performance improvements for zero and finite temperature free energy calculations on both digital and analog quantum hardware. Specifically, our energy estimates not only outperform traditional Hartree-Fock solutions, but this performance gap also consistently widens as we tune up the quality of our transformations. In short, our quantum information-based approach opens promising new pathways to realizing useful and feasible quantum chemistry algorithms on near-term hardware.

quant-ph↗

arXiv2024

Large-scale quantum reservoir learning with an analog quantum computer

Quantum machine learning has gained considerable attention as quantum technology advances, presenting a promising approach for efficiently learning complex data patterns. Despite this promise, most contemporary quantum methods require significant resources for variational parameter optimization and face issues with vanishing gradients, leading to experiments that are either limited in scale or lack potential for quantum advantage. To address this, we develop a general-purpose, gradient-free, and scalable quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks, including binary and multi-class classification, as well as timeseries prediction. Effective and improving learning is observed with increasing system sizes of up to 108 qubits, demonstrating the largest quantum machine learning experiment to date. We further observe comparative quantum kernel advantage in learning tasks by constructing synthetic datasets based on the geometric differences between generated quantum and classical data kernels. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning. We expect these results to stimulate further extensions to different quantum hardware and machine learning paradigms, including early fault-tolerant hardware and generative machine learning tasks.

quant-ph↗

arXiv2024

Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics

Analog quantum simulation is an essential routine for quantum computing and plays a crucial role in studying quantum many-body physics. Typically, the quantum evolution of an analog simulator is largely determined by its physical characteristics, lacking the precise control or versatility of quantum gates. This limitation poses challenges in extracting physical properties on analog quantum simulators, an essential step of quantum simulations. To address this issue, we introduce the Hamiltonian shadow protocol, which uses a single quench Hamiltonian for estimating arbitrary state properties, eliminating the need for ancillary systems and random unitaries. Additionally, we derive the sample complexity of this protocol and show that it performs comparably to the classical shadow protocol. The Hamiltonian shadow protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators. We demonstrate its utility through numerical demonstrations with Rydberg atom arrays under realistic parameter settings. The new protocol significantly broadens the application of randomized measurements for analog quantum simulators without precise control and ancillary systems.

quant-ph↗

arXiv2023

High-order Time-Reversal Symmetry Breaking Normal State

Spontaneous time-reversal symmetry breaking plays an important role in studying strongly correlated unconventional superconductors. When two superconducting gap functions with different symmetries compete, the relative phase channel ($θ_-\equiv θ_1-θ_2$) exhibits an Ising-type $Z_2$ symmetry due to the second order Josephson coupling, where $θ_{1,2}$ are the phases of two gap functions respectively. In contrast, the $U(1)$ symmetry in the channel of $θ_+\equiv \frac{θ_1+θ_2}{2}$ is intact. The phase locking, i.e., ordering of $θ_-$, can take place in the phase fluctuation regime before the onset of superconductivity, i.e. when $θ_+$ is disordered. If $θ_-$ is pinned at $\pm\fracπ{2}$, then time-reversal symmetry is broken in the normal state, otherwise, if $θ_-=0$, or, $π$, rotational symmetry is broken, leading to a nematic normal state. In both cases, the order parameters possess a 4-fermion structure beyond the scope of mean-field theory, which can be viewed as a high order symmetry breaking. We employ an effective two-component $XY$-model assisted by a renormalization group analysis to address this problem. As a natural by-product, we also find the other interesting intermediate phase corresponds to ordering of $θ_+$ but with $θ_-$ disordered. This is the quartetting, or, charge-4e, superconductivity, which occurs above the low temperature $Z_2$-breaking charge-2e superconducting phase. Our results provide useful guidance for studying novel symmetry breaking phases in strongly correlated superconductors.

cond-mat.supr-con↗

arXiv2023

Measurement-Induced Criticality is Tomographically Optimal

We develop a classical shadow tomography protocol utilizing the randomized measurement scheme based on hybrid quantum circuits, which consist of layers of two-qubit random unitary gates mixed with single-qubit random projective measurements. Unlike conventional protocols that perform all measurements by the end of unitary evolutions, our protocol allows measurements to occur at any spacetime position throughout the quantum evolution. We provide a universal classical post-processing strategy to approximately reconstruct the original quantum state from intermittent measurement outcomes given the corresponding random circuit realizations over repeated experiments. We investigated the sample complexity for estimating different observables at different measurement rates of the hybrid quantum circuits. Our result shows that the sample complexity has an optimal scaling at the critical measurement rate when the hybrid circuit undergoes the measurement-induced transition.

quant-ph↗

arXiv2023

Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning

The recently introduced Quantum Lego framework provides a powerful method for generating complex quantum error correcting codes (QECCs) out of simple ones. We gamify this process and unlock a new avenue for code design and discovery using reinforcement learning (RL). One benefit of RL is that we can specify \textit{arbitrary} properties of the code to be optimized. We train on two such properties, maximizing the code distance, and minimizing the probability of logical error under biased Pauli noise. For the first, we show that the trained agent identifies ways to increase code distance beyond naive concatenation, saturating the linear programming bound for CSS codes on 13 qubits. With a learning objective to minimize the logical error probability under biased Pauli noise, we find the best known CSS code at this task for $\lesssim 20$ qubits. Compared to other (locally deformed) CSS codes, including Surface, XZZX, and 2D Color codes, our $[[17,1,3]]$ code construction actually has \textit{lower} adversarial distance, yet better protects the logical information, highlighting the importance of QECC desiderata. Lastly, we comment on how this RL framework can be used in conjunction with physical quantum devices to tailor a code without explicit characterization of the noise model.

quant-ph↗

arXiv2023

Scalable and Flexible Classical Shadow Tomography with Tensor Networks

Classical shadow tomography is a powerful randomized measurement protocol for predicting many properties of a quantum state with few measurements. Two classical shadow protocols have been extensively studied in the literature: the single-qubit (local) Pauli measurement, which is well suited for predicting local operators but inefficient for large operators; and the global Clifford measurement, which is efficient for low-rank operators but infeasible on near-term quantum devices due to the extensive gate overhead. In this work, we demonstrate a scalable classical shadow tomography approach for generic randomized measurements implemented with finite-depth local Clifford random unitary circuits, which interpolates between the limits of Pauli and Clifford measurements. The method combines the recently proposed locally-scrambled classical shadow tomography framework with tensor network techniques to achieve scalability for computing the classical shadow reconstruction map and evaluating various physical properties. The method enables classical shadow tomography to be performed on shallow quantum circuits with superior sample efficiency and minimal gate overhead and is friendly to noisy intermediate-scale quantum (NISQ) devices. We show that the shallow-circuit measurement protocol provides immediate, exponential advantages over the Pauli measurement protocol for predicting quasi-local operators. It also enables a more efficient fidelity estimation compared to the Pauli measurement.

quant-ph↗

arXiv2022

Classical Shadow Tomography with Locally Scrambled Quantum Dynamics

We generalize the classical shadow tomography scheme to a broad class of finite-depth or finite-time local unitary ensembles, known as locally scrambled quantum dynamics, where the unitary ensemble is invariant under local basis transformations. In this case, the reconstruction map for the classical shadow tomography depends only on the average entanglement feature of classical snapshots. We provide an unbiased estimator of the quantum state as a linear combination of reduced classical snapshots in all subsystems, where the combination coefficients are solely determined by the entanglement feature. We also bound the number of experimental measurements required for the tomography scheme, so-called sample complexity, by formulating the operator shadow norm in the entanglement feature formalism. We numerically demonstrate our approach for finite-depth local unitary circuits and finite-time local-Hamiltonian generated evolutions. The shallow-circuit measurement can achieve a lower tomography complexity compared to the existing method based on Pauli or Clifford measurements. Our approach is also applicable to approximately locally scrambled unitary ensembles with a controllable bias that vanishes quickly. Surprisingly, we find a single instance of time-dependent local Hamiltonian evolution is sufficient to perform an approximate tomography as we numerically demonstrate it using a paradigmatic spin chain Hamiltonian modeled after trapped ion or Rydberg atom quantum simulators. Our approach significantly broadens the application of classical shadow tomography on near-term quantum devices.

quant-ph↗

arXiv2022

Interpretable Quantum Advantage in Neural Sequence Learning

Quantum neural networks have been widely studied in recent years, given their potential practical utility and recent results regarding their ability to efficiently express certain classical data. However, analytic results to date rely on assumptions and arguments from complexity theory. Due to this, there is little intuition as to the source of the expressive power of quantum neural networks or for which classes of classical data any advantage can be reasonably expected to hold. Here, we study the relative expressive power between a broad class of neural network sequence models and a class of recurrent models based on Gaussian operations with non-Gaussian measurements. We explicitly show that quantum contextuality is the source of an unconditional memory separation in the expressivity of the two model classes. Additionally, as we are able to pinpoint quantum contextuality as the source of this separation, we use this intuition to study the relative performance of our introduced model on a standard translation data set exhibiting linguistic contextuality. In doing so, we demonstrate that our introduced quantum models are able to outperform state of the art classical models even in practice.

quant-ph↗

arXiv2022

RG-Flow: A hierarchical and explainable flow model based on renormalization group and sparse prior

Flow-based generative models have become an important class of unsupervised learning approaches. In this work, we incorporate the key ideas of renormalization group (RG) and sparse prior distribution to design a hierarchical flow-based generative model, RG-Flow, which can separate information at different scales of images and extract disentangled representations at each scale. We demonstrate our method on synthetic multi-scale image datasets and the CelebA dataset, showing that the disentangled representations enable semantic manipulation and style mixing of the images at different scales. To visualize the latent representations, we introduce receptive fields for flow-based models and show that the receptive fields of RG-Flow are similar to those of convolutional neural networks. In addition, we replace the widely adopted isotropic Gaussian prior distribution by the sparse Laplacian distribution to further enhance the disentanglement of representations. From a theoretical perspective, our proposed method has $O(\log L)$ complexity for inpainting of an image with edge length $L$, compared to previous generative models with $O(L^2)$ complexity.

cs.LG↗

arXiv2022

Logical shadow tomography: Efficient estimation of error-mitigated observables

We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-efficient classical reconstruction of the noisy density matrix. Using efficient classical post-processing, one can mitigate errors by projecting a general nonlinear function of the noisy density matrix into the codespace. The subspace expansion and virtual distillation can be viewed as special cases of the new framekwork. We show our method is favorable in the quantum and classical resources overhead. Relative to subspace expansion which requires $O\left(2^{N} \right)$ samples to estimate a logical Pauli observable with $[[N, k]]$ error correction code, our technique requires only $O\left(4^{k} \right)$ samples. Relative to virtual distillation, our technique can compute powers of the density matrix without additional copies of quantum states or quantum memory. We present numerical evidence using logical states encoded with up to sixty physical qubits and show fast convergence to error-free expectation values with only $10^5$ samples under 1% depolarizing noise.

quant-ph↗

arXiv2021

Differentiable Programming of Isometric Tensor Networks

Differentiable programming is a new programming paradigm which enables large scale optimization through automatic calculation of gradients also known as auto-differentiation. This concept emerges from deep learning, and has also been generalized to tensor network optimizations. Here, we extend the differentiable programming to tensor networks with isometric constraints with applications to multiscale entanglement renormalization ansatz (MERA) and tensor network renormalization (TNR). By introducing several gradient-based optimization methods for the isometric tensor network and comparing with Evenbly-Vidal method, we show that auto-differentiation has a better performance for both stability and accuracy. We numerically tested our methods on 1D critical quantum Ising spin chain and 2D classical Ising model. We calculate the ground state energy for the 1D quantum model and internal energy for the classical model, and scaling dimensions of scaling operators and find they all agree with the theory well.

quant-ph↗

arXiv2021

Hamiltonian-Driven Shadow Tomography of Quantum States

Classical shadow tomography provides an efficient method for predicting functions of an unknown quantum state from a few measurements of the state. It relies on a unitary channel that efficiently scrambles the quantum information of the state to the measurement basis. Facing the challenge of realizing deep unitary circuits on near-term quantum devices, we explore the scenario in which the unitary channel can be shallow and is generated by a quantum chaotic Hamiltonian via time evolution. We provide an unbiased estimator of the density matrix for all ranges of the evolution time. We analyze the sample complexity of the Hamiltonian-driven shadow tomography. For Pauli observables, we find that it can be more efficient than the unitary-2-design-based shadow tomography in a sequence of intermediate time windows that range from an order-1 scrambling time to a time scale of $D^{1/6}$, given the Hilbert space dimension $D$. In particular, the efficiency of predicting diagonal Pauli observables is improved by a factor of $D$ without sacrificing the efficiency of predicting off-diagonal Pauli observables.

quant-ph↗

arXiv2020

Topological and symmetry-enriched random quantum critical points

We study how symmetry can enrich strong-randomness quantum critical points and phases, and lead to robust topological edge modes coexisting with critical bulk fluctuations. These are the disordered analogues of gapless topological phases. Using real-space and density matrix renormalization group approaches, we analyze the boundary and bulk critical behavior of such symmetry-enriched random quantum spin chains. We uncover a new class of symmetry-enriched infinite randomness fixed points: while local bulk properties are indistinguishable from conventional random singlet phases, nonlocal observables and boundary critical behavior are controlled by a different renormalization group fixed point. We also illustrate how such new quantum critical points emerge naturally in Floquet systems.

cond-mat.str-el↗

arXiv2020

Neural ODE and Holographic QCD

The neural ordinary differential equation (Neural ODE) is a novel machine learning architecture whose weights are smooth functions of the continuous depth. We apply the Neural ODE to holographic QCD by regarding the weight functions as a bulk metric, and train the machine with lattice QCD data of chiral condensate at finite temperature. The machine finds consistent bulk geometry at various values of temperature and discovers the emergent black hole horizon in the holographic bulk automatically. The holographic Wilson loops calculated with the emergent machine-learned bulk spacetime have consistent temperature dependence of confinement and Debye-screening behavior. In machine learning models with physically interpretable weights, the Neural ODE frees us from discretization artifact leading to difficult ingenuity of hyperparameters, and improves numerical accuracy to make the model more trustworthy.

hep-th↗

arXiv2020

Quantum Magnetism in Wannier-Obstructed Mott Insulators

We develop a strong coupling approach towards quantum magnetism in Mott insulators for Wannier obstructed bands. Despite the lack of Wannier orbitals, electrons can still singly occupy a set of exponentially-localized but nonorthogonal orbitals to minimize the repulsive interaction energy. We develop a systematic method to establish an effective spin model from the electron Hamiltonian using a diagrammatic approach. The nonorthogonality of the Mott basis gives rise to multiple new channels of spin-exchange (or permutation) interactions beyond Hartree-Fock and superexchange terms. We apply this approach to a Kagome lattice model of interacting electrons in Wannier obstructed bands (including both Chern bands and fragile topological bands). Due to the orbital nonorthogonality, as parameterized by the nearest neighbor orbital overlap $g$, this model exhibits stable ferromagnetism up to a finite bandwidth $W\sim U g$, where $U$ is the interaction strength. This provides an explanation for the experimentally observed robust ferromagnetism in Wannier obstructed bands. The effective spin model constructed through our approach also opens up the possibility for frustrated quantum magnetism around the ferromagnet-antiferromagnet crossover in Wannier obstructed bands.

cond-mat.str-el↗

arXiv2020

Resonant Quantum Search with Monitor Qubits

We present an algorithm for the generalized search problem (searching $k$ marked items among $N$ items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity $O(\sqrt{N/k})$ as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary "monitor" qubits, can determine $k$ precisely, if it is unknown. The time complexity of our counting algorithm is $O(\sqrt{N})$, similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.

quant-ph↗