arXiv subjects

Kaixuan Huang

Publications and source records attributed to Kaixuan Huang.

At least 73 records · Page 4Linked to original sources

arXiv2023

Quantum simulation of topological zero modes on a 41-qubit superconducting processor

Quantum simulation of different exotic topological phases of quantum matter on a noisy intermediate-scale quantum (NISQ) processor is attracting growing interest. Here, we develop a one-dimensional 43-qubit superconducting quantum processor, named as Chuang-tzu, to simulate and characterize emergent topological states. By engineering diagonal Aubry-Andr$\acute{\mathrm{e}}$-Harper (AAH) models, we experimentally demonstrate the Hofstadter butterfly energy spectrum. Using Floquet engineering, we verify the existence of the topological zero modes in the commensurate off-diagonal AAH models, which have never been experimentally realized before. Remarkably, the qubit number over 40 in our quantum processor is large enough to capture the substantial topological features of a quantum system from its complex band structure, including Dirac points, the energy gap's closing, the difference between even and odd number of sites, and the distinction between edge and bulk states. Our results establish a versatile hybrid quantum simulation approach to exploring quantum topological systems in the NISQ era.

quant-ph↗

arXiv2023

Reward-Directed Conditional Diffusion: Provable Distribution Estimation and Reward Improvement

We explore the methodology and theory of reward-directed generation via conditional diffusion models. Directed generation aims to generate samples with desired properties as measured by a reward function, which has broad applications in generative AI, reinforcement learning, and computational biology. We consider the common learning scenario where the data set consists of unlabeled data along with a smaller set of data with noisy reward labels. Our approach leverages a learned reward function on the smaller data set as a pseudolabeler. From a theoretical standpoint, we show that this directed generator can effectively learn and sample from the reward-conditioned data distribution. Additionally, our model is capable of recovering the latent subspace representation of data. Moreover, we establish that the model generates a new population that moves closer to a user-specified target reward value, where the optimality gap aligns with the off-policy bandit regret in the feature subspace. The improvement in rewards obtained is influenced by the interplay between the strength of the reward signal, the distribution shift, and the cost of off-support extrapolation. We provide empirical results to validate our theory and highlight the relationship between the strength of extrapolation and the quality of generated samples.

cs.LG↗

arXiv2023

Scaling In-Context Demonstrations with Structured Attention

The recent surge of large language models (LLMs) highlights their ability to perform in-context learning, i.e., "learning" to perform a task from a few demonstrations in the context without any parameter updates. However, their capabilities of in-context learning are limited by the model architecture: 1) the use of demonstrations is constrained by a maximum sentence length due to positional embeddings; 2) the quadratic complexity of attention hinders users from using more demonstrations efficiently; 3) LLMs are shown to be sensitive to the order of the demonstrations. In this work, we tackle these challenges by proposing a better architectural design for in-context learning. We propose SAICL (Structured Attention for In-Context Learning), which replaces the full-attention by a structured attention mechanism designed for in-context learning, and removes unnecessary dependencies between individual demonstrations, while making the model invariant to the permutation of demonstrations. We evaluate SAICL in a meta-training framework and show that SAICL achieves comparable or better performance than full attention while obtaining up to 3.4x inference speed-up. SAICL also consistently outperforms a strong Fusion-in-Decoder (FiD) baseline which processes each demonstration independently. Finally, thanks to its linear nature, we demonstrate that SAICL can easily scale to hundreds of demonstrations with continuous performance gains with scaling.

cs.CL↗

arXiv2023

The hadronic equation of state of HESS J1731-347 from the relativistic mean-field model with tensor coupling

A recent report has identified a central compact object (CCO) within the supernova remnant HESS J1731-347, with a mass and radius of $M=0.77^{+0.20}_{-0.17}M{\odot}$ and $R=10.4^{+0.86}_{-0.78}$ km, respectively. To investigate this light compact star, a density-dependent relativistic mean-field (DDRMF) model, specifically the DDVT model, has been employed. The DDVT model incorporates tensor couplings of vector mesons, which {can} successfully describe the properties of finite nuclei, such as charge radius, binding energy, and spin-orbit splitting. The introduction of tensor coupling reduces the influence of scalar mesons and generates a softer equation of state (EOS) in the outer core of the neutron star. Moreover, it has been found that the crust segment plays a crucial role in reproducing the mass-radius relation of HESS J1731-347, indicating a preference for a soft crust EOS. By manipulating the coupling strength of the isovector meson in the DDVT parameter set, a reasonable hadronic EOS has been obtained, satisfying the constraints from the gravitational-wave signal GW170817, the simultaneous mass-radius measurements from the NICER collaboration, and the properties of finite nuclei. Notably, the mass-radius relations derived from this hadronic EOS also accurately describe the observables of HESS J1731-347. Therefore, based on our estimation, the CCO in HESS J1731-347 may represent the lightest known neutron star.

nucl-th↗

arXiv2023

Quantum simulation of Hawking radiation and curved spacetime with a superconducting on-chip black hole

Hawking radiation is one of the quantum features of a black hole that can be understood as a quantum tunneling across the event horizon of the black hole, but it is quite difficult to directly observe the Hawking radiation of an astrophysical black hole. Here, we report a fermionic lattice-model-type realization of an analogue black hole by using a chain of 10 superconducting transmon qubits with interactions mediated by 9 transmon-type tunable couplers. The quantum walks of quasi-particle in the curved spacetime reflect the gravitational effect near the black hole, resulting in the behaviour of stimulated Hawking radiation, which is verified by the state tomography measurement of all 7 qubits outside the horizon. In addition, the dynamics of entanglement in the curved spacetime is directly measured. Our results would stimulate more interests to explore the related features of black holes using the programmable superconducting processor with tunable couplers.

quant-ph↗

arXiv2023

Relativistic approach for the determination of nuclear and neutron star properties in consideration of PREX-II results

The bulk properties of nuclear matter and neutron stars with the newly generated relativistic interaction DBHP are investigated which provides an opportunity to modify the coupling parameters keeping in view the finite nuclei, nuclear matter, PREX-II data for neutron skin thickness in $^{208}$Pb and astrophysical constraints. The relativistic interaction has been generated by including all possible self and mixed interactions between $σ$, $ω$, and $ρ$-meson up to the quartic order satisfying the naturalness behavior of parameters. A covariance analysis is performed to assess the statistical uncertainties on the model parameters and observables of interest along with correlations amongst them. We obtained a value of neutron skin thickness for $^{208}$Pb nucleus $Δr_{np}$ = 0.24 $\pm$ 0.02 fm. The maximum gravitational mass of neutron star and radius corresponding to the canonical mass ($R_{1.4}$) come out to be 2.03 $\pm$ 0.04 M$\odot$ and 13.39 $\pm$ 0.41 km respectively. The dimensionless tidal deformability, $Λ$ for a neutron star is also analyzed.

nucl-th↗

arXiv2023

Deep Reinforcement Learning for Cost-Effective Medical Diagnosis

Dynamic diagnosis is desirable when medical tests are costly or time-consuming. In this work, we use reinforcement learning (RL) to find a dynamic policy that selects lab test panels sequentially based on previous observations, ensuring accurate testing at a low cost. Clinical diagnostic data are often highly imbalanced; therefore, we aim to maximize the $F_1$ score instead of the error rate. However, optimizing the non-concave $F_1$ score is not a classic RL problem, thus invalidates standard RL methods. To remedy this issue, we develop a reward shaping approach, leveraging properties of the $F_1$ score and duality of policy optimization, to provably find the set of all Pareto-optimal policies for budget-constrained $F_1$ score maximization. To handle the combinatorially complex state space, we propose a Semi-Model-based Deep Diagnosis Policy Optimization (SM-DDPO) framework that is compatible with end-to-end training and online learning. SM-DDPO is tested on diverse clinical tasks: ferritin abnormality detection, sepsis mortality prediction, and acute kidney injury diagnosis. Experiments with real-world data validate that SM-DDPO trains efficiently and identifies all Pareto-front solutions. Across all tasks, SM-DDPO is able to achieve state-of-the-art diagnosis accuracy (in some cases higher than conventional methods) with up to $85\%$ reduction in testing cost. The code is available at [https://github.com/Zheng321/Deep-Reinforcement-Learning-for-Cost-Effective-Medical-Diagnosis].

cs.LG↗

arXiv2023

Score Approximation, Estimation and Distribution Recovery of Diffusion Models on Low-Dimensional Data

Diffusion models achieve state-of-the-art performance in various generation tasks. However, their theoretical foundations fall far behind. This paper studies score approximation, estimation, and distribution recovery of diffusion models, when data are supported on an unknown low-dimensional linear subspace. Our result provides sample complexity bounds for distribution estimation using diffusion models. We show that with a properly chosen neural network architecture, the score function can be both accurately approximated and efficiently estimated. Furthermore, the generated distribution based on the estimated score function captures the data geometric structures and converges to a close vicinity of the data distribution. The convergence rate depends on the subspace dimension, indicating that diffusion models can circumvent the curse of data ambient dimensionality.

cs.LG↗

arXiv2022

Variational Quantum Computation of Molecular Linear Response Properties on a Superconducting Quantum Processor

Simulating response properties of molecules is crucial for interpreting experimental spectroscopies and accelerating materials design. However, it remains a long-standing computational challenge for electronic structure methods on classical computers. While quantum computers hold the promise to solve this problem more efficiently in the long run, existing quantum algorithms requiring deep quantum circuits are infeasible for near-term noisy quantum processors. Here, we introduce a pragmatic variational quantum response (VQR) algorithm for response properties, which circumvents the need for deep quantum circuits. Using this algorithm, we report the first simulation of linear response properties of molecules including dynamic polarizabilities and absorption spectra on a superconducting quantum processor. Our results indicate that a large class of important dynamical properties such as Green's functions are within the reach of near-term quantum hardware using this algorithm in combination with suitable error mitigation techniques.

quant-ph↗

arXiv2022

Observation of entanglement negativity transition of pseudo-random mixed states

Multipartite entanglement is a key resource for quantum computation. It is expected theoretically that entanglement transition may happen for multipartite random quantum states, however, which is still absent experimentally. Here, we report the observation of entanglement transition quantified by negativity using a fully connected 20-qubit superconducting processor. We implement multi-layer pseudo-random circuits to generate pseudo-random pure states of 7 to 15 qubits. Then, we investigate negativity spectra of reduced density matrices obtained by quantum state tomography for 6 qubits.Three different phases can be identified by calculating logarithmic negativities based on the negativity spectra. We observe the phase transitions by changing the sizes of environment and subsystems. The randomness of our circuits can be also characterized by quantifying the distance between the distribution of output bit-string probabilities and Porter-Thomas distribution. Our simulator provides a powerful tool to generate random states and understand the entanglement structure for multipartite quantum systems.

quant-ph↗

arXiv2022

Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization

Online influence maximization aims to maximize the influence spread of a content in a social network with unknown network model by selecting a few seed nodes. Recent studies followed a non-adaptive setting, where the seed nodes are selected before the start of the diffusion process and network parameters are updated when the diffusion stops. We consider an adaptive version of content-dependent online influence maximization problem where the seed nodes are sequentially activated based on real-time feedback. In this paper, we formulate the problem as an infinite-horizon discounted MDP under a linear diffusion process and present a model-based reinforcement learning solution. Our algorithm maintains a network model estimate and selects seed users adaptively, exploring the social network while improving the optimal policy optimistically. We establish $\widetilde O(\sqrt{T})$ regret bound for our algorithm. Empirical evaluations on synthetic network demonstrate the efficiency of our algorithm.

cs.LG↗

arXiv2022

Observation of critical phase transition in a generalized Aubry-André-Harper model on a superconducting quantum processor with tunable couplers

Quantum simulation enables study of many-body systems in non-equilibrium by mapping to a controllable quantum system, providing a new tool for computational intractable problems. Here, using a programmable quantum processor with a chain of 10 superconducting qubits interacted through tunable couplers, we simulate the one-dimensional generalized Aubry-André-Harper model for three different phases, i.e., extended, localized and critical phases. The properties of phase transitions and many-body dynamics are studied in the presence of quasi-periodic modulations for both off-diagonal hopping coefficients and on-site potentials of the model controlled respectively by adjusting strength of couplings and qubit frequencies. We observe the spin transport for initial single- and multi-excitation states in different phases, and characterize phase transitions by experimentally measuring dynamics of participation entropies. Our experimental results demonstrate that the newly developed tunable coupling architecture of superconducting processor extends greatly the simulation realms for a wide variety of Hamiltonians, and may trigger further investigations on various quantum and topological phenomena.

quant-ph↗

arXiv2022

The Hadron-Quark Crossover in Neutron Star within Gaussian Process Regression Method

The equations of state of the neutron star at the hadron-quark crossover region are interpolated with the Gaussian process regression (GPR) method, which can reduce the randomness of present interpolation schemes. The relativistic mean-field (RMF) model and Nambu-Jona-Lasinio (NJL) model are employed to describe the hadronic phase and quark phase, respectively. In the RMF model, the coupling term between $ω$ and $ρ$ mesons is considered to control the density-dependent behaviors of symmetry energy, i.e. the slope of symmetry energy, $L$. Furthermore, the vector interaction between quarks is included in the NJL model to obtain the additional repulsive contributions. Their coupling strengths and the crossover windows are discussed in the present framework under the constraints on the neutron star from gravitational wave detections, massive neutron star measurements, mass-radius simultaneous observation of NICER collaboration, and the neutron skin thickness of $^{208}$Pb from PREX-II. It is found that the slope of symmetry energy, $L$ should be around $50-90$ MeV and the crossover window is $(0.3,~0.6)~\rm fm^{-3}$ with these observables. Furthermore, the uncertainties of neutron star masses and radii in the hadron-quark crossover regions are also predicted by the GPR method.

nucl-th↗

arXiv2022

The hyperonic star in relativistic mean-field model

The neutron star as a supernova remnant is attracting high attention recently due to the gravitation wave detection and precise measurements about its mass and radius. In the inner core region of the neutron star, the strangeness degrees of freedom, such as the hyperons, can be present, which is also named as a hyperonic star. In this work, the neutron star consisting of nucleons and leptons, and the hyperonic star including the hyperons will be reviewed in the framework of the relativistic mean-field (RMF) model. The popular non-linear and density-dependent RMF parametrizations in the market will be adopted to investigate the role of strangeness baryons in a hyperonic star on its mass, radius, tidal deformability, and other properties. Finally, the magnitudes of the coupling strengths between mesons and hyperons also will be discussed, which can generate the massive hyperonic star with present RMF parameter sets, when the vector coupling constants are strong.

nucl-th↗

arXiv2021

Going Beyond Linear RL: Sample Efficient Neural Function Approximation

Deep Reinforcement Learning (RL) powered by neural net approximation of the Q function has had enormous empirical success. While the theory of RL has traditionally focused on linear function approximation (or eluder dimension) approaches, little is known about nonlinear RL with neural net approximations of the Q functions. This is the focus of this work, where we study function approximation with two-layer neural networks (considering both ReLU and polynomial activation functions). Our first result is a computationally and statistically efficient algorithm in the generative model setting under completeness for two-layer neural networks. Our second result considers this setting but under only realizability of the neural net function class. Here, assuming deterministic dynamics, the sample complexity scales linearly in the algebraic dimension. In all cases, our results significantly improve upon what can be attained with linear (or eluder dimension) methods.

cs.LG↗

arXiv2021

High Precision Indoor Localization with Dummy Antennas -- An Experimental Study

With the rising demand for indoor localization, high precision technique-based fingerprints became increasingly important nowadays. The newest advanced localization system makes effort to improve localization accuracy in the time or frequency domain, for example, the UWB localization technique can achieve centimeter-level accuracy but have a high cost. Therefore, we present a spatial domain extension-based scheme with low cost and verify the effectiveness of antennas extension in localization accuracy. In this paper, we achieve sub-meter level localization accuracy using a single AP by extending three radio links of the modified laptops to more antennas. Moreover, the experimental results show that the localization performance is superior as the number of antennas increases with the help of spatial domain extension and angular domain assisted.

eess.SP↗

arXiv2021

Optimal Gradient-based Algorithms for Non-concave Bandit Optimization

Bandit problems with linear or concave reward have been extensively studied, but relatively few works have studied bandits with non-concave reward. This work considers a large family of bandit problems where the unknown underlying reward function is non-concave, including the low-rank generalized linear bandit problems and two-layer neural network with polynomial activation bandit problem. For the low-rank generalized linear bandit problem, we provide a minimax-optimal algorithm in the dimension, refuting both conjectures in [LMT21, JWWN19]. Our algorithms are based on a unified zeroth-order optimization paradigm that applies in great generality and attains optimal rates in several structured polynomial settings (in the dimension). We further demonstrate the applicability of our algorithms in RL in the generative model setting, resulting in improved sample complexity over prior approaches. Finally, we show that the standard optimistic algorithms (e.g., UCB) are sub-optimal by dimension factors. In the neural net setting (with polynomial activation functions) with noiseless reward, we provide a bandit algorithm with sample complexity equal to the intrinsic algebraic dimension. Again, we show that optimistic approaches have worse sample complexity, polynomial in the extrinsic dimension (which could be exponentially worse in the polynomial degree).

cs.LG↗

arXiv2021

A Short Note on the Relationship of Information Gain and Eluder Dimension

Eluder dimension and information gain are two widely used methods of complexity measures in bandit and reinforcement learning. Eluder dimension was originally proposed as a general complexity measure of function classes, but the common examples of where it is known to be small are function spaces (vector spaces). In these cases, the primary tool to upper bound the eluder dimension is the elliptic potential lemma. Interestingly, the elliptic potential lemma also features prominently in the analysis of linear bandits/reinforcement learning and their nonparametric generalization, the information gain. We show that this is not a coincidence -- eluder dimension and information gain are equivalent in a precise sense for reproducing kernel Hilbert spaces.

cs.LG↗