arXiv subjects

Changhao Li

Publications and source records attributed to Changhao Li.

At least 55 records · Page 3Linked to original sources

arXiv2024

QC-Forest: a Classical-Quantum Algorithm to Provably Speedup Retraining of Random Forest

Random Forest (RF) is a popular tree-ensemble method for supervised learning, prized for its ease of use and flexibility. Online RF models require to account for new training data to maintain model accuracy. This is particularly important in applications where data is periodically and sequentially generated over time in data streams, such as auto-driving systems, and credit card payments. In this setting, performing periodic model retraining with the old and new data accumulated is beneficial as it fully captures possible drifts in the data distribution over time. However, this is unpractical with state-of-the-art classical algorithms for RF as they scale linearly with the accumulated number of samples. We propose QC-Forest, a classical-quantum algorithm designed to time-efficiently retrain RF models in the streaming setting for multi-class classification and regression, achieving a runtime poly-logarithmic in the total number of accumulated samples. QC-Forest leverages Des-q, a quantum algorithm for single tree construction and retraining proposed by Kumar et al. by expanding to multi-class classification, as the original proposal was limited to binary classes, and introducing an exact classical method to replace an underlying quantum subroutine incurring a finite error, while maintaining the same poly-logarithmic dependence. Finally, we showcase that QC-Forest achieves competitive accuracy in comparison to state-of-the-art RF methods on widely used benchmark datasets with up to 80,000 samples, while significantly speeding up the model retrain.

quant-ph↗

arXiv2024

CoNav: A Benchmark for Human-Centered Collaborative Navigation

Human-robot collaboration, in which the robot intelligently assists the human with the upcoming task, is an appealing objective. To achieve this goal, the agent needs to be equipped with a fundamental collaborative navigation ability, where the agent should reason human intention by observing human activities and then navigate to the human's intended destination in advance of the human. However, this vital ability has not been well studied in previous literature. To fill this gap, we propose a collaborative navigation (CoNav) benchmark. Our CoNav tackles the critical challenge of constructing a 3D navigation environment with realistic and diverse human activities. To achieve this, we design a novel LLM-based humanoid animation generation framework, which is conditioned on both text descriptions and environmental context. The generated humanoid trajectory obeys the environmental context and can be easily integrated into popular simulators. We empirically find that the existing navigation methods struggle in CoNav task since they neglect the perception of human intention. To solve this problem, we propose an intention-aware agent for reasoning both long-term and short-term human intention. The agent predicts navigation action based on the predicted intention and panoramic observation. The emergent agent behavior including observing humans, avoiding human collision, and navigation reveals the efficiency of the proposed datasets and agents.

cs.CV↗

arXiv2024

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

quant-ph↗

arXiv2024

Comprehensive Analysis of Network Robustness Evaluation Based on Convolutional Neural Networks with Spatial Pyramid Pooling

Connectivity robustness, a crucial aspect for understanding, optimizing, and repairing complex networks, has traditionally been evaluated through time-consuming and often impractical simulations. Fortunately, machine learning provides a new avenue for addressing this challenge. However, several key issues remain unresolved, including the performance in more general edge removal scenarios, capturing robustness through attack curves instead of directly training for robustness, scalability of predictive tasks, and transferability of predictive capabilities. In this paper, we address these challenges by designing a convolutional neural networks (CNN) model with spatial pyramid pooling networks (SPP-net), adapting existing evaluation metrics, redesigning the attack modes, introducing appropriate filtering rules, and incorporating the value of robustness as training data. The results demonstrate the thoroughness of the proposed CNN framework in addressing the challenges of high computational time across various network types, failure component types and failure scenarios. However, the performance of the proposed CNN model varies: for evaluation tasks that are consistent with the trained network type, the proposed CNN model consistently achieves accurate evaluations of both attack curves and robustness values across all removal scenarios. When the predicted network type differs from the trained network, the CNN model still demonstrates favorable performance in the scenario of random node failure, showcasing its scalability and performance transferability. Nevertheless, the performance falls short of expectations in other removal scenarios. This observed scenario-sensitivity in the evaluation of network features has been overlooked in previous studies and necessitates further attention and optimization. Lastly, we discuss important unresolved questions and further investigation.

cs.CV↗

arXiv2024

A geometric perspective: experimental evaluation of the quantum Cramer-Rao bound

The power of quantum sensing rests on its ultimate precision limit, quantified by the quantum Cramer-Rao bound (QCRB), which can surpass classical bounds. In multi-parameter estimation, the QCRB is not always saturated as the quantum nature of associated observables may lead to their incompatibility. Here we explore the precision limits of multi-parameter estimation through the lens of quantum geometry, enabling us to experimentally evaluate the QCRB via quantum geometry measurements. Focusing on two- and three-parameter estimation, we elucidate how fundamental quantum uncertainty principles prevent the saturation of the bound. By linking a metric of "quantumness" to the system geometric properties, we investigate and experimentally extract the attainable QCRB for three-parameter estimations.

quant-ph↗

arXiv2024

Prospects of Privacy Advantage in Quantum Machine Learning

Ensuring data privacy in machine learning models is critical, particularly in distributed settings where model gradients are typically shared among multiple parties to allow collaborative learning. Motivated by the increasing success of recovering input data from the gradients of classical models, this study addresses a central question: How hard is it to recover the input data from the gradients of quantum machine learning models? Focusing on variational quantum circuits (VQC) as learning models, we uncover the crucial role played by the dynamical Lie algebra (DLA) of the VQC ansatz in determining privacy vulnerabilities. While the DLA has previously been linked to the classical simulatability and trainability of VQC models, this work, for the first time, establishes its connection to the privacy of VQC models. In particular, we show that properties conducive to the trainability of VQCs, such as a polynomial-sized DLA, also facilitate the extraction of detailed snapshots of the input. We term this a weak privacy breach, as the snapshots enable training VQC models for distinct learning tasks without direct access to the original input. Further, we investigate the conditions for a strong privacy breach where the original input data can be recovered from these snapshots by classical or quantum-assisted polynomial time methods. We establish conditions on the encoding map such as classical simulatability, overlap with DLA basis, and its Fourier frequency characteristics that enable such a privacy breach of VQC models. Our findings thus play a crucial role in detailing the prospects of quantum privacy advantage by guiding the requirements for designing quantum machine learning models that balance trainability with robust privacy protection.

quant-ph↗

arXiv2024

Global self$-$similarity of dense granular flow in hopper: the role of hopper width

The influence of hopper width on dense granular flow in a two$-$dimensional hopper is investigated through experiments and simulations. Though the flow rate remains stable for larger hopper widths, a slight reduction in hopper width results in a significant increase in flow rate for smaller hopper widths. Both Beverloo$'$s and Janda$'$s formula accurately capture the relationship between the flow rate and outlet size. Flow characteristics in the regions near the outlet exhibit local self$-$similarity, supporting Beverloo and Janda's principles. Moreover, global self$-$similarity is analysed, indicated by the transition in flow state from mass flow in regions far from the outlet to funnel flow near the outlet. The earlier occurrence of this transition favors to enhance the grain velocity and consequently increases the dense flow rate. An exponential scaling law is proposed to describe the dependencies of flow rate, grain velocity, and transition height between the mass flow pattern and the funnel flow pattern on silo width.

cond-mat.soft↗

arXiv2024

Global regularity of 2D Rayleigh-Bénard equations with logarithmic supercritical dissipation

In this paper, we study the global regularity problem for the 2D Rayleigh-Bénard equations with logarithmic supercritical dissipation. By exploiting a combined quantity of the system, the technique of Littlewood-Paley decomposition and Besov spaces, and some commutator estimates, we establish the global regularity of a strong solution to this equations in the Sobolev space $H^{s}(\mathbb{R}^{2})$ for $s \ge2$.

math.AP↗

arXiv2024

Exponentially Enhanced non-Hermitian Cooling

Certain non-Hermitian systems exhibit the skin effect, whereby the wavefunctions become exponentially localized at one edge of the system. Such exponential amplification of wavefunction has received significant attention due to its potential applications in e.g., classical and quantum sensing. However, the opposite edge of the system, featured by the exponentially suppressed wavefunctions, remains largely unexplored. Leveraging this phenomenon, we introduce a non-Hermitian cooling mechanism, which is fundamentally distinct from traditional refrigeration or laser cooling techniques. Notably, non-Hermiticity will not amplify thermal excitations, but rather redistribute them. Hence, thermal excitations can be cooled down at one edge of the system, and the cooling effect can be exponentially enhanced by the number of auxiliary modes, albeit with a lower bound that depends on the dissipative interaction with the environment. Non-Hermitian cooling does not rely on intricate properties such as exceptional points or non-trivial topology, and it can apply to a wide range of Bosonic modes such as photons, phonons, magnons, etc.

quant-ph↗

arXiv2024

Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization

Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm, which it can approximate with sufficient depth. However, it is unclear to what extent the lessons from the adiabatic regime apply to QAOA as executed in practice with small to moderate depth. In this paper, we demonstrate that the intuition from the adiabatic algorithm applies to the task of choosing the QAOA initial state. Specifically, we observe that the best performance is obtained when the initial state of QAOA is set to be the ground state of the mixing Hamiltonian, as required by the adiabatic algorithm. We provide numerical evidence using the examples of constrained portfolio optimization problems with both low ($p\leq 3$) and high ($p = 100$) QAOA depth. Additionally, we successfully apply QAOA with XY mixer to portfolio optimization on a trapped-ion quantum processor using 32 qubits and discuss our findings in near-term experiments.

quant-ph↗

arXiv2023

Privacy-preserving quantum federated learning via gradient hiding

Distributed quantum computing, particularly distributed quantum machine learning, has gained substantial prominence for its capacity to harness the collective power of distributed quantum resources, transcending the limitations of individual quantum nodes. Meanwhile, the critical concern of privacy within distributed computing protocols remains a significant challenge, particularly in standard classical federated learning (FL) scenarios where data of participating clients is susceptible to leakage via gradient inversion attacks by the server. This paper presents innovative quantum protocols with quantum communication designed to address the FL problem, strengthen privacy measures, and optimize communication efficiency. In contrast to previous works that leverage expressive variational quantum circuits or differential privacy techniques, we consider gradient information concealment using quantum states and propose two distinct FL protocols, one based on private inner-product estimation and the other on incremental learning. These protocols offer substantial advancements in privacy preservation with low communication resources, forging a path toward efficient quantum communication-assisted FL protocols and contributing to the development of secure distributed quantum machine learning, thus addressing critical privacy concerns in the quantum computing era.

quant-ph↗

arXiv2023

Individual-atom control in array through phase modulation

Performing parallel gate operations while retaining low crosstalk is an essential step in transforming neutral atom arrays into powerful quantum computers and simulators. Tightly focusing control beams in small areas for crosstalk suppression is typically challenging and can lead to imperfect polarization for certain transitions. We tackle such a problem by introducing a method to engineer single qubit gates through phase-modulated continuous driving. Distinct qubits can be individually addressed to high accuracy by simply tuning the modulation parameters, which significantly suppresses crosstalk effects. When arranged in a lattice structure, individual control with optimal crosstalk suppression is achieved. With the assistance of additional addressing light or multiple modulation frequencies, we develop two efficient implementations of parallel-gate operations. Our results pave the way to scaling up atom-array platforms with low-error parallel-gate operations, without requiring complicated wavefront design or high-power laser beams.

quant-ph↗

arXiv2023

Blind quantum machine learning with quantum bipartite correlator

Distributed quantum computing is a promising computational paradigm for performing computations that are beyond the reach of individual quantum devices. Privacy in distributed quantum computing is critical for maintaining confidentiality and protecting the data in the presence of untrusted computing nodes. In this work, we introduce novel blind quantum machine learning protocols based on the quantum bipartite correlator algorithm. Our protocols have reduced communication overhead while preserving the privacy of data from untrusted parties. We introduce robust algorithm-specific privacy-preserving mechanisms with low computational overhead that do not require complex cryptographic techniques. We then validate the effectiveness of the proposed protocols through complexity and privacy analysis. Our findings pave the way for advancements in distributed quantum computing, opening up new possibilities for privacy-aware machine learning applications in the era of quantum technologies.

quant-ph↗

arXiv2023

Expressive variational quantum circuits provide inherent privacy in federated learning

Federated learning has emerged as a viable distributed solution to train machine learning models without the actual need to share data with the central aggregator. However, standard neural network-based federated learning models have been shown to be susceptible to data leakage from the gradients shared with the server. In this work, we introduce federated learning with variational quantum circuit model built using expressive encoding maps coupled with overparameterized ansätze. We show that expressive maps lead to inherent privacy against gradient inversion attacks, while overparameterization ensures model trainability. Our privacy framework centers on the complexity of solving the system of high-degree multivariate Chebyshev polynomials generated by the gradients of quantum circuit. We present compelling arguments highlighting the inherent difficulty in solving these equations, both in exact and approximate scenarios. Additionally, we delve into machine learning-based attack strategies and establish a direct connection between overparameterization in the original federated learning model and underparameterization in the attack model. Furthermore, we provide numerical scaling arguments showcasing that underparameterization of the expressive map in the attack model leads to the loss landscape being swamped with exponentially many spurious local minima points, thus making it extremely hard to realize a successful attack. This provides a strong claim, for the first time, that the nature of quantum machine learning models inherently helps prevent data leakage in federated learning.

quant-ph↗

arXiv2023

Solid-State $\rm ^{229}Th$ Nuclear Laser with Two-Photon Pumping

The radiative excitation of the 8.3 eV isomeric state of thorium-229 is an outstanding challenge due to the lack of tunable far-ultraviolet (F-UV) sources. In this work, we propose an efficient two-photon pumping scheme for thorium-229 using the optonuclear quadrupolar effect, which only requires a 300 nm UV-B pumping laser. We further demonstrate that population inversion between the nuclear isomeric and ground states can be achieved at room temperature using a two-step pumping process. The nuclear laser, which has been pursued for decades, may be realized using a Watt-level UV-B pumping laser and ultrawide bandgap thorium compounds (e.g., $\rm ThF_4$, $\rm Na_2ThF_6$, or $\rm K_2ThF_6$) as the gain medium.

nucl-th↗

arXiv2023

Global regularity for the 2D micropolar Rayleigh-Bénard convection system with velocity zero dissipation and temperature critical dissipation

This paper studies the global regularity problem for the 2D micropolar Rayleigh-Bénard convection system with velocity zero dissipation, micro-rotation velocity Laplace dissipation and temperature critical dissipation. By introducing a combined quantity and using the technique of Littlewood-Paley decomposition, we establish the global regularity result of solutions to this system.

math.AP↗

arXiv2023

Training Transformers with 4-bit Integers

Quantizing the activation, weight, and gradient to 4-bit is promising to accelerate neural network training. However, existing 4-bit training methods require custom numerical formats which are not supported by contemporary hardware. In this work, we propose a training method for transformers with all matrix multiplications implemented with the INT4 arithmetic. Training with an ultra-low INT4 precision is challenging. To achieve this, we carefully analyze the specific structures of activation and gradients in transformers to propose dedicated quantizers for them. For forward propagation, we identify the challenge of outliers and propose a Hadamard quantizer to suppress the outliers. For backpropagation, we leverage the structural sparsity of gradients by proposing bit splitting and leverage score sampling techniques to quantize gradients accurately. Our algorithm achieves competitive accuracy on a wide range of tasks including natural language understanding, machine translation, and image classification. Unlike previous 4-bit training methods, our algorithm can be implemented on the current generation of GPUs. Our prototypical linear operator implementation is up to 2.2 times faster than the FP16 counterparts and speeds up the training by up to 35.1%.

cs.LG↗

arXiv2023

Machine learning traction force maps of cell monolayers

Cellular force transmission across a hierarchy of molecular switchers is central to mechanobiological responses. However, current cellular force microscopies suffer from low throughput and resolution. Here we introduce and train a generative adversarial network (GAN) to paint out traction force maps of cell monolayers with high fidelity to the experimental traction force microscopy (TFM). The GAN analyzes traction force maps as an image-to-image translation problem, where its generative and discriminative neural networks are simultaneously cross-trained by hybrid experimental and numerical datasets. In addition to capturing the colony-size and substrate-stiffness dependent traction force maps, the trained GAN predicts asymmetric traction force patterns for multicellular monolayers seeding on substrates with stiffness gradient, implicating collective durotaxis. Further, the neural network can extract experimentally inaccessible, the hidden relationship between substrate stiffness and cell contractility, which underlies cellular mechanotransduction. Trained solely on datasets for epithelial cells, the GAN can be extrapolated to other contractile cell types using only a single scaling factor. The digital TFM serves as a high-throughput tool for mapping out cellular forces of cell monolayers and paves the way toward data-driven discoveries in cell mechanobiology.

physics.bio-ph↗