arXiv subjects

Qiang Miao

Publications and source records attributed to Qiang Miao.

14 recordsLinked to original sources

arXiv2026

CruiseBench: A Real-Flight-Aligned N-CMAPSS Benchmark for Engine RUL Prediction

Remaining useful life (RUL) prediction estimates how long an engine can continue safe operation and is central to maintenance planning. N-CMAPSS extends C-MAPSS by simulating run-to-failure aero-engine trajectories using recorded real-flight profiles and retaining complete within-flight time series rather than cycle-level snapshots. However, this added realism reduces evaluation control because full-flight records increase data volume and entangle degradation cues with operating-regime variation, complicating preprocessing choices and direct comparisons of RUL modeling performance. To mitigate this issue, this paper proposes CruiseBench, a cruise-stage RUL benchmark derived from N-CMAPSS. It introduces CPM-N-CMAPSS (Cruising-Period Mask for N-CMAPSS), a mask artifact that stores cycle-local cruising intervals identified by the common-altitude method for the nine accessible subdatasets. CruiseBench applies a fixed protocol to the masked rows, using scenario descriptors and measured sensors as inputs while excluding virtual sensors, health parameters, and auxiliary metadata from the feature tensor, preserving native-resolution windows, and applying dataset-wise RUL caps. Experiments with LSTM, GRU, TCN, and TSMixer provide baseline results for this setting. Under CruiseBench-eta5-W256-S10, TSMixer obtains the lowest average RMSE, $3.4\pm1.71$, and Saxena score, $(2.50\pm2.99)\times 10^{4}$. Ablation studies show that flight-stage selection, temporal downscaling method, and RUL-cap threshold affect reported results. With its fixed cruise-stage protocol, CruiseBench provides a reproducible sub-benchmark for controlled RUL model comparison and CPM-N-CMAPSS provides a stage-specific data foundation for future transfer-learning and domain-adaptation studies.

cs.LG↗

arXiv2026

Observing conformal Floquet dynamics on a digital quantum processor

Quantum simulations are traditionally confined to exploring dynamics starting from unentangled or low-entanglement states due to severe bottlenecks in protocol design, hardware performance, and classical verification. Here, we report the first experimental observation of non-equilibrium dynamics initiated directly from a many-body critical state. Using a fully-connected trapped-ion processor, we prepare the critical ground state of a transverse-field Ising model via a hardware-tailored, logarithmic-depth quantum circuit based on multi-scale entanglement renormalization. Following this initialization, we apply a deep Floquet drive that maintains emergent conformal symmetry, enabling us to benchmark the lattice dynamics against analytical results from continuum theory. In the resulting conformal heating phase, we extract a central charge consistent with the Ising universality class ($c=1/2$) from the universal decay of the Loschmidt echo and observe spatial energy localization predicted by field theory. Conversely, the non-heating phase exhibits global finite-time revivals. This work establishes a scalable and versatile framework for exploring critical quantum dynamics.

quant-ph↗

arXiv2025

Quantum Machine Learning via Contrastive Training

Quantum machine learning (QML) has attracted growing interest with the rapid parallel advances in large-scale classical machine learning and quantum technologies. Similar to classical machine learning, QML models also face challenges arising from the scarcity of labeled data, particularly as their scale and complexity increase. Here, we introduce self-supervised pretraining of quantum representations that reduces reliance on labeled data by learning invariances from unlabeled examples. We implement this paradigm on a programmable trapped-ion quantum computer, encoding images as quantum states. In situ contrastive pretraining on hardware yields a representation that, when fine-tuned, classifies image families with higher mean test accuracy and lower run-to-run variability than models trained from random initialization. Performance improvement is especially significant in regimes with limited labeled training data. We show that the learned invariances generalize beyond the pretraining image samples. Unlike prior work, our pipeline derives similarity from measured quantum overlaps and executes all training and classification stages on hardware. These results establish a label-efficient route to quantum representation learning, with direct relevance to quantum-native datasets and a clear path to larger classical inputs.

cs.LG↗

arXiv2025

Absence of barren plateaus and scaling of gradients in the energy optimization of isometric tensor network states

Vanishing gradients can pose substantial obstacles for high-dimensional optimization problems. Here we consider energy minimization problems for quantum many-body systems with extensive Hamiltonians and finite-range interactions, which can be studied on classical computers or in the form of variational quantum eigensolvers on quantum computers. Barren plateaus correspond to scenarios where the average amplitude of the energy gradient decreases exponentially with increasing system size. This occurs, for example, for quantum neural networks and for brickwall quantum circuits when the depth increases polynomially in the system size. Here we prove that the variational optimization problems for matrix product states, tree tensor networks, and the multiscale entanglement renormalization ansatz are free of barren plateaus. The derived scaling properties for the gradient variance provide an analytical guarantee for the trainability of randomly initialized tensor network states (TNS) and motivate certain initialization schemes. In a suitable representation, unitary tensors that parametrize the TNS are sampled according to the uniform Haar measure. We employ a Riemannian formulation of the gradient based optimizations which simplifies the analytical evaluation.

quant-ph↗

arXiv2025

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

quant-ph↗

arXiv2025

Scaling of contraction costs for entanglement renormalization algorithms including tensor Trotterization and variational Monte Carlo

The multi-scale entanglement renormalization ansatz (MERA) is a hierarchical class of tensor network states motivated by the real-space renormalization group. It is used to simulate strongly correlated quantum many-body systems. For prominent MERA structures in one and two spatial dimensions and different optimization strategies, we determine the optimal scaling of contraction costs as well as corresponding contraction sequences and algorithmic phase diagrams. This is motivated by recent efforts to employ MERA in hybrid quantum-classical algorithms, where the MERA tensors are Trotterized, i.e., chosen as circuits of quantum gates, and observables as well as energy gradients are evaluated by sampling causal-cone states. We investigate whether tensor Trotterization and/or variational Monte Carlo (VMC) sampling can lead to quantum-inspired classical MERA algorithms that perform better than the traditional optimization of full MERA based on the exact evaluation of energy gradients. Algorithmic phase diagrams indicate the best MERA method depending on the scaling of the energy accuracy and the optimal number of Trotter steps with the bond dimension. The results suggest substantial gains due to VMC for two-dimensional systems.

cond-mat.str-el↗

arXiv2024

Probing entanglement scaling across a quantum phase transition on a quantum computer

The investigation of strongly-correlated quantum matter is difficult due to the curse of dimensionality and intricate entanglement structures. These challenges are particularly pronounced in the vicinity of continuous quantum phase transitions, where quantum fluctuations manifest across all length scales. While quantum simulators give controlled access to a number of strongly correlated systems, the study of critical phenomena has been hampered by finite-size effects arising from diverging correlation lengths. Moreover, the experimental investigation of entanglement in many-body systems has been hindered by limitations in measurement protocols. To address these challenges, we employ the multiscale entanglement renormalization ansatz (MERA) and implement a holographic scheme for subsystem tomography on a fully-connected trapped-ion quantum computer. Our method accurately represents infinite systems and long-range correlations with few qubits, facilitating the efficient extraction of observables and entanglement properties, even at criticality. We observe a quantum phase transition with spontaneous symmetry breaking and reveal the evolution of entanglement properties across the critical point. For the first time, we demonstrate log-law scaling of subsystem entanglement entropies at criticality on a digital quantum computer. This achievement highlights the potential of MERA for the investigation of strongly-correlated many-body systems on quantum computers.

quant-ph↗

arXiv2024

Equivalence of cost concentration and gradient vanishing for quantum circuits: An elementary proof in the Riemannian formulation

The optimization of quantum circuits can be hampered by a decay of average gradient amplitudes with increasing system size. When the decay is exponential, this is called the barren plateau problem. Considering explicit circuit parametrizations (in terms of rotation angles), it has been shown in Arrasmith et al., Quantum Sci. Technol. 7, 045015 (2022) that barren plateaus are equivalent to an exponential decay of the variance of cost-function differences. We show that the issue is particularly simple in the (parametrization-free) Riemannian formulation of such optimization problems and obtain a tighter bound for the cost-function variance. An elementary derivation shows that the single-gate variance of the cost function is strictly equal to half the variance of the Riemannian single-gate gradient, where we sample variable gates according to the uniform Haar measure. The total variances of the cost function and its gradient are then both bounded from above by the sum of single-gate variances and, conversely, bound single-gate variances from above. So, decays of gradients and cost-function variations go hand in hand, and barren plateau problems cannot be resolved by avoiding gradient-based in favor of gradient-free optimization methods.

quant-ph↗

arXiv2024

Demonstration of a CAFQA-bootstrapped Variational Quantum Eigensolver on a Trapped-Ion Quantum Computer

To enhance the variational quantum eigensolver (VQE), the CAFQA method can utilize classical computational capabilities to identify a better initial state than the Hartree-Fock method. Previous research has demonstrated that the initial state provided by CAFQA recovers more correlation energy than that of the Hartree-Fock method and results in faster convergence. In the present study, we advance the investigation of CAFQA by demonstrating its advantages on a high-fidelity trapped-ion quantum computer located at the Duke Quantum Center -- this is the first experimental demonstration of CAFQA-bootstrapped VQE on a TI device and on any academic quantum device. In our VQE experiment, we use LiH and BeH$_2$ as test cases to show that CAFQA achieves faster convergence and obtains lower energy values within the specified computational budget limits. To ensure the seamless execution of VQE on this academic device, we develop a novel hardware-software interface framework that supports independent software environments for both the circuit and hardware end. This mechanism facilitates the automation of VQE-type job executions as well as mitigates the impact of random hardware interruptions. This framework is versatile and can be applied to a variety of academic quantum devices beyond the trapped-ion quantum computer platform, with support for integration with customized packages.

quant-ph↗

arXiv2024

Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus

We explain why and numerically confirm that there are no barren plateaus in the energy optimization of isometric tensor network states (TNS) for extensive Hamiltonians with finite-range interactions which are, for example, typical in condensed matter physics. Specifically, we consider matrix product states (MPS) with open boundary conditions, tree tensor network states (TTNS), and the multiscale entanglement renormalization ansatz (MERA). MERA are isometric by construction and, for the MPS and TTNS, the tensor network gauge freedom allows us to choose all tensors as partial isometries. The variance of the energy gradient, evaluated by taking the Haar average over the TNS tensors, has a leading system-size independent term and decreases according to a power law in the bond dimension. For a hierarchical TNS (TTNS and MERA) with branching ratio $b$, the variance of the gradient with respect to a tensor in layer $τ$ scales as $(bη)^τ$, where $η$ is the second largest eigenvalue of a Haar-average doubled layer-transition channel and decreases algebraically with increasing bond dimension. The absence of barren plateaus substantiates that isometric TNS are a promising route for an efficient quantum-computation-based investigation of strongly-correlated quantum matter. The observed scaling properties of the gradient amplitudes bear implications for efficient TNS initialization procedures.

quant-ph↗

arXiv2023

Quantum-classical eigensolver using multiscale entanglement renormalization

We propose a variational quantum eigensolver (VQE) for the simulation of strongly-correlated quantum matter based on a multi-scale entanglement renormalization ansatz (MERA) and gradient-based optimization. This MERA quantum eigensolver can have substantially lower computation costs than corresponding classical algorithms. Due to its narrow causal cone, the algorithm can be implemented on noisy intermediate-scale quantum (NISQ) devices and still describe large systems. It is particularly attractive for ion-trap devices with ion-shuttling capabilities. The number of required qubits is system-size independent, and increases only to a logarithmic scaling when using quantum amplitude estimation to speed up gradient evaluations. Translation invariance can be used to make computation costs square-logarithmic in the system size and describe the thermodynamic limit. We demonstrate the approach numerically for a MERA with Trotterized disentanglers and isometries. With a few Trotter steps, one recovers the accuracy of the full MERA.

quant-ph↗

arXiv2022

Eigenstate entanglement scaling for critical interacting spin chains

With increasing subsystem size and energy, bipartite entanglement entropies of energy eigenstates cross over from the groundstate scaling to a volume law. In previous work, we pointed out that, when strong or weak eigenstate thermalization (ETH) applies, the entanglement entropies of all or, respectively, almost all eigenstates follow a single crossover function. The crossover functions are determined by the subsystem entropy of thermal states and assume universal scaling forms in quantum-critical regimes. This was demonstrated by field-theoretical arguments and the analysis of large systems of non-interacting fermions and bosons. Here, we substantiate such scaling properties for integrable and non-integrable interacting spin-1/2 chains at criticality using exact diagonalization. In particular, we analyze XXZ and transverse-field Ising models with and without next-nearest-neighbor interactions. Indeed, the crossover of thermal subsystem entropies can be described by a universal scaling function following from conformal field theory. Furthermore, we analyze the validity of ETH for entanglement in these models. Even for the relatively small system sizes that can be simulated, the distributions of eigenstate entanglement entropies are sharply peaked around the subsystem entropies of the corresponding thermal ensembles.

cond-mat.stat-mech↗

arXiv2021

Scaling functions for eigenstate entanglement crossovers in harmonic lattices

For quantum matter, eigenstate entanglement entropies obey an area law or log-area law at low energies and small subsystem sizes and cross over to volume laws for high energies and large subsystems. This transition is captured by crossover functions, which assume a universal scaling form in quantum critical regimes. We demonstrate this for the harmonic lattice model, which describes quantized lattice vibrations and is a regularization for free scalar field theories, modeling, e.g., spin-0 bosonic particles. In one dimension, the groundstate entanglement obeys a log-area law. For dimensions $d\geq 2$, it displays area laws, even at criticality. The distribution of excited-state entanglement entropies is found to be sharply peaked around subsystem entropies of corresponding thermodynamic ensembles in accordance with the eigenstate thermalization hypothesis. Numerically, we determine crossover scaling functions for the quantum critical regime of the model and do a large-deviation analysis. We show how infrared singularities of the system can be handled and how to access the thermodynamic limit using a perturbative trick for the covariance matrix. Eigenstates for quasi-free bosonic systems are not Gaussian. We resolve this problem by considering appropriate squeezed states instead. For these, entanglement entropies can be evaluated efficiently.

cond-mat.stat-mech↗

arXiv2021

Eigenstate entanglement: Crossover from the ground state to volume laws

For the typical quantum many-body systems that obey the eigenstate thermalization hypothesis (ETH), we argue that the entanglement entropy of (almost) all energy eigenstates is described by a single crossover function. The ETH implies that the crossover functions can be deduced from subsystem entropies of thermal ensembles and have universal properties. These functions capture the full crossover from the groundstate entanglement regime at low energies and small subsystem size (area or log-area law) to the extensive volume-law regime at high energies or large subsystem size. For critical one-dimensional systems, a universal scaling function follows from conformal field theory (CFT) and can be adapted for nonlinear dispersions. We use it to also deduce the crossover scaling function for Fermi liquids in $d>1$ dimensions. The analytical results are complemented by numerics for large non-interacting systems of fermions in $d=1$, $2$, and $3$ dimensions and have also been confirmed for bosonic systems and non-integrable spin chains. Furthermore, one can deduce the distribution function for eigenstate entanglement.

cond-mat.stat-mech↗