Searcharxiv⌕ Search

arXiv subjects

Junxiang Huang

Publications and source records attributed to Junxiang Huang.

At least 19 recordsLinked to original sources

Lang-SVG: Hierarchical Image Vectorization with Language Priors

Image vectorization reconstructs raster images as compact scalable vector graph- ics (SVG), providing a structured and editable code representation of images. However, most existing vectorization methods optimize for pixel-level render- ing fidelity, often producing SVGs that lack alignment with human-perceived object-part hierarchies, making them difficult to manipulate. To address this, we propose Lang-SVG, which introduces an explicit tree structure to organize SVG primitives with semantic labels and parent-child relationships. Lang-SVG incorporates granularity-controllable and open-vocabulary segmentation priors to initialize object-part hierarchies and leverages multimodal large language models (MLLMs) with SVG tree context to assign semantic labels to unlabeled nodes. To reduce redundancy, we introduce depth-adaptive simplification to reduce shape complexity and Tree-Guided Pruning and Merging to eliminate redundant SVG nodes. L1-SAM-Prompting further recovers missing regions to improve recon- struction fidelity and structural completeness. Beyond reconstruction fidelity, we introduce a new evaluation protocol that measures structural quality and semantic part alignment. Experiments demonstrate that Lang-SVG achieves state-of-the-art performance in both rendering fidelity and structural quality. Project website: https://xiliu8006.github.io/Lang-SVG/.

cs.CV↗

Low-cost algorithm-to-execution framework for surface-code quantum computing

Fault-tolerant quantum computing is progressing from demonstrations of individual logical components toward the execution of useful quantum algorithms on large-scale error-corrected processors. Realizing this transition requires co-design across algorithms, fault-tolerant implementations, and hardware resources. Here we develop an algorithm-to-execution framework for low-cost surface-code quantum computing that carries the structure of a computation from hierarchical logical descriptions to circuit-specific spatial organization, non-Clifford resource planning, and physical resource evaluation. We apply the framework to twenty benchmark circuits spanning seven algorithm families and to a hierarchically reconstructed application-scale elliptic-curve discrete-logarithm workload. Under the stated error and resource-supply models, combining circuit-specific layouts with hybrid non-Clifford implementation reduces space--time volume by up to 12.70x relative to an all-synthesis Litinski fast-block baseline. Circuit-specific layouts reduce both modeled runtime and space--time volume in eighteen benchmarks, while the remaining two retain the fast layout. These results show that the physical cost of fault-tolerant computation emerges from the interaction between algorithm structure, error-corrected implementation, and hardware organization rather than from aggregate logical resource counts alone.

quant-ph↗

Streaming the partial-transpose moment hierarchy with order-independent quantum memory

Partial transposition reveals mixed-state entanglement through the spectrum of $ρ_{AB}^{T_B}$, but this operator is not generally a physical state. Its power moments are accessible through collective permutations, whose coherent width grows with moment order. Here we introduce a streaming protocol that processes fresh copies sequentially while retaining one copy and a reusable ancilla. By realizing opposite cyclic permutations on the two subsystems, each measurement record yields unbiased estimators of all moments $p_2,\ldots,p_K$ through successive outcome products. For an $n$-qubit state, the protocol uses $2n+1$ active qubits independent of $K$ and $O(K\log K/ε_{\rm mom}^2)$ copies, matching $Ω(K/ε_{\rm mom}^2)$ lower bounds up to a logarithmic factor, including a PT-specific isospectral construction. Higher-order moments strengthen thermal-state entanglement certification toward the exact PPT threshold. Simulations cover pure and mixed states, and a cloud quantum processor implements a three-qubit instance.

quant-ph↗

Breaking the Multiplicative Overhead in Quantum Entropy Estimation

The von Neumann, Tsallis, and Rényi entropies are fundamental measures of quantum information. A common estimation strategy multiplies the worst-case costs of spectral transformation and statistical readout, leaving gaps to query lower bounds. We reduce this overhead with multi-level algorithms that use local normalization and precision allocation, while variable-time estimation accounts for the probability of reaching expensive spectral tests. With controlled purified access and its inverse, we obtain bounds for additive error $\varepsilon$, rank upper bound $R$, and fixed order $α$. Tsallis entropy estimation has near-optimal rank-independent query complexity $\widetilde O(\varepsilon^{-1/(α-1)})$ for $1<α<2$, when the allowed dimension and rank accommodate the lower-bound instances, and $\widetilde O(1/\varepsilon)$ for $α\ge2$, where $\widetilde O$ suppresses logarithmic factors. The first saves a factor $1/\varepsilon$; the second extends known integer-order scaling to noninteger orders. We also improve the von Neumann entropy bound from $\widetilde O(R/\varepsilon^2)$ to $\widetilde O(R/\varepsilon)$ and obtain $\widetilde O(R/\varepsilon)$ for noninteger Rényi orders $1<α<3$, with further bounds at other orders. Our functional-estimation theorem replaces the global product by a sum of local costs weighted by function magnitudes and spectral masses. We further estimate fixed logarithmic moments and entropy variance using $\widetilde O(R/\varepsilon)$ queries, providing efficient access to fluctuation parameters that enter finite-blocklength quantum compression and pure-state entanglement conversion. More broadly, our framework extends beyond entropy to a broad class of density-matrix functionals, offering a systematic approach toward optimal query complexity in quantum spectral estimation.

quant-ph↗

Modelling opinion dynamics during crises as complex contagion with feedback

Crises and population responses can form coupled dynamical systems, with crisis conditions shaping protective behaviours and collective responses altering the crisis trajectory. Existing models rarely capture both evolving crisis conditions and the reinforcement-dependent spread of competing behaviours. We propose a complex contagion with feedback (CCF) model that couples competing complex contagion with crisis dynamics through bidirectional feedback. Agents stochastically switch between competing states according to social reinforcement and adoption complexity, which is influenced by crisis conditions and information campaigns, while population-level behavioural change feeds back into the crisis. We formulate and analyse the model for a well-mixed population, characterising its equilibria and associated stability conditions. As a case study for model validation, we integrate CCF model with a census-calibrated agent-based model of COVID-19 transmission in Australia to represent social distancing adoption and discontinuation. We compare the CCF model with an existing opinion dynamics model and find that, despite using fewer parameters, it achieves comparable performance in reproducing recurrent infection waves. The resulting framework is parsimonious, analytically tractable, and can be adapted to different types of crises.

physics.soc-ph↗

One- and two-dimensional cluster states for topological phase simulation and measurement-based quantum computation

Quantum entanglement is a fundamental resource for quantum information processing and serves as a critical benchmark for quantum hardware performance. Cluster states are a special class of entangled states that serve as universal resources for measurement-based quantum computation and possess an intrinsic symmetry-protected topological order, which confers robustness against symmetry-respecting noise. Here we report the scalable preparation and verification of genuine multipartite cluster states on the 105-qubit Zuchongzhi 3.1 superconducting processor. We achieve one-dimensional cluster states of up to 95 qubits and two-dimensional cluster states of up to 72 qubits. The symmetry-protected topological cluster states exhibit input-state-dependent robustness under symmetry-breaking perturbations due to an operational parity structure that enhances the performance of measurement-based quantum computation. Furthermore, we use our two-dimensional cluster states to implement the Deutsch-Jozsa algorithm within the measurement-based quantum computation framework, achieving higher output-state fidelity compared with traditional circuit-based models and a query efficiency advantage over classical approaches. Our work establishes a scalable platform that combines large-scale entanglement generation, symmetry-protected topological order and practical quantum algorithms to enable robust, fault-tolerant measurement-based quantum computation.

quant-ph↗

Generalized Mermin Inequalities for Benchmarking Large-Scale GHZ States

Multipartite Bell tests provide a correlation-only route to benchmarking quantum processors, but their application at large scales is hindered by the rapid decay of many-body correlators under noise and exponentially many terms in conventional Bell expressions. Here we address these scalability obstacles by introducing a finite-setting generalized Mermin family of state-tailored Bell inequalities with analytic certification bounds, in which the measurement-setting number $m$ provides an additional certification dimension complementary to the system size $n$. We show that, for the powers-of-two setting choices considered here, increasing $m$ leaves the ideal normalized multipartite quantum value unchanged while lowering the relevant classical bounds, thereby strengthening the Bell-violation ratios and yielding an improved noise-robustness scaling compared to the standard Mermin inequality. We test this construction experimentally on a programmable superconducting processor by preparing Greenberger-Horne-Zeilinger (GHZ) states of up to 80 qubits. Using randomized sampling for direct Bell-operator estimation, we observe Bell ratios that grow exponentially with system size, certify a nonlocality depth of 14, and show that increasing $m$ strengthens both the Bell ratio and depth certification. All results are obtained solely from measured correlators and analytical bounds, without readout correction, tomography, or model-based mitigation. Generalized Mermin inequalities therefore provide a sharper Bell benchmark for noisy large-scale GHZ states.

quant-ph↗

Quantum-classical crossover in fault-tolerant quantum dynamics simulation

While quantum computers promise to solve classically intractable problems, identifying the point at which fault-tolerant quantum computation outperforms the best classical algorithms for practical applications remains an outstanding challenge. Here we establish a concrete quantum-classical crossover for quantum many-body dynamics under realistic hardware conditions. We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations, suppressing the residual logical errors that limit existing partially fault-tolerant approaches. A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics at modest system sizes. For a physical error rate of $p=10^{-3}$, fault-tolerant simulation requires approximately 2 hours and $3.7 \times 10^5$ physical qubits for a 100-site 1D system, whereas tensor network approaches would require about 100 years. For 2D models, where rapid entanglement growth limits the classical evolution time, we project quantum runtimes within minutes. A physical error rate of $p=10^{-4}$ leads to at least an order of magnitude reduction in qubit count ($3.1 \times 10^4$ physical qubits) and runtime (minutes for 1D and seconds for 2D). The reduction in quantum runtime arises from our improved rotation-state injection and co-design of quantum error correction and observable-estimation protocols, which jointly suppress logical-error accumulation and reduce sampling overhead. Our results establish a scalable route towards practical quantum advantage and identify quantitative engineering targets for future fault-tolerant architectures.

quant-ph↗

A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing

Variational quantum algorithms (VQAs) have established themselves as a central computational paradigm in the Noisy Intermediate-Scale Quantum (NISQ) era. By coupling parameterized quantum circuits (PQCs) with classical optimization, they operate effectively under strict hardware limitations. However, as quantum architectures transition toward early fault-tolerant (EFT) and ultimate fault-tolerant (FT) regimes, the foundational principles and long-term viability of VQAs require systematic reassessment. This review offers an insightful analysis of VQAs and their progression toward the fault-tolerant regime. We deconstruct the core algorithmic framework by examining ansatz design and classical optimization strategies, including cost function formulation, gradient computation, and optimizer selection. Concurrently, we evaluate critical training bottlenecks, notably barren plateaus (BPs), alongside established mitigation strategies. The discussion then explores the EFT phase, detailing how the integration of quantum error mitigation and partial error correction can sustain algorithmic performance. Addressing the FT phase, we analyze the inherent challenges confronting current hybrid VQA models. Furthermore, we synthesize recent VQA applications across diverse domains, including many-body physics, quantum chemistry, machine learning, and mathematical optimization. Ultimately, this review outlines a theoretical roadmap for adapting quantum algorithms to future hardware generations, elucidating how variational principles can be systematically refined to maintain their relevance and efficiency within an error-corrected computational environment.

quant-ph↗

Estimating Local Observables via Cluster-Level Light-Cone Decomposition

Simulating large quantum circuits on hardware with limited qubit counts is often attempted through methods like circuit knitting, which typically incur sample costs that grow exponentially with the number of connections cut. In this work, we introduce a framework based on Cluster-level Light-cone analysis that leverages the natural locality of quantum workloads. We propose two complementary algorithms: the Causal Decoupling Algorithm, which exploits geometric disconnections in the light cone for sampling efficiency, and the Algebraic Decomposition Algorithm, which utilizes algebraic expansion to minimize hardware requirements. These methods allow simulation costs to depend on circuit depth and connectivity rather than system size. Together, our results generalize Lieb-Robinson-inspired locality to modular architectures and establish a quantitative framework for probing local physics on near-term quantum devices by decoupling the simulation cost from the global system size.

quant-ph↗

Obtaining Accurate Ground-State Properties on Near-term Quantum Devices

Accurate ground-state calculations on noisy quantum computers are fundamentally limited by restricted ansatz expressivity and unavoidable hardware errors. We introduce a hybrid-quantum classical framework that simultaneously addresses these challenges. Our method systematically purifies noisy two electron reduced density matrices from quantum devices by enforcing N-representability conditions through efficient semidefinite programming, guided by a norm-based distance constraint to the experimental data. To implement this constraint, we develop a hardware efficient calibration protocol based on Clifford circuits. We demonstrate near full configuration interaction accuracy for ground-state energies of H2, LiH, and H4, and compute precise scattering intensities for C6H8 on noisy hardware. This approach surpasses conventional methods by simultaneously overcoming both ansatz limitations and hardware noise, establishing a scalable route to quantum advantage and marking a critical step toward reliable simulations of complex molecularnsystems on noisy devices.

quant-ph↗

Numerical studies of (in)stabilities of shocks in perturbed advective flows around black holes

Using two-dimensional hydrodynamic simulations, we investigate the stability of shocked accretion flows around black holes under non-axisymmetric perturbations. By systematically exploring the parameter space of specific energy and angular momentum that permits shock formation in advective accretion flows, we demonstrate that quasi-periodic oscillations (QPOs) naturally emerge in perturbed systems. Our spectral analysis reveals characteristic QPO frequencies spanning 0.44-146.57 Hz, effectively bridging the observed low-frequency (LFQPOs) and high-frequency QPOs (HFQPOs) in black hole X-ray binaries. The quality factors of these oscillations range from 1.66 to 203.58, with multiple Lorentzian components indicating distinct oscillation modes. Through wavelet analysis and cross-validation with recent observations (e.g., Swift J1727.8-1613 and GX 339-4), we establish that shock instabilities driven by acoustic wave interactions between the non-axisymmetric perturbation and the shock location can quantitatively explain the temporal features observed in accreting black hole systems. Furthermore, we characterize the adiabatic index dependence of shock morphology, showing that increasing the adiabatic index from 4/3 to 1.4 changes shock positions outward while maintaining oscillation coherence.

astro-ph.HE↗

Whispers of Data: Unveiling Label Distributions in Federated Learning Through Virtual Client Simulation

Federated Learning enables collaborative training of a global model across multiple geographically dispersed clients without the need for data sharing. However, it is susceptible to inference attacks, particularly label inference attacks. Existing studies on label distribution inference exhibits sensitive to the specific settings of the victim client and typically underperforms under defensive strategies. In this study, we propose a novel label distribution inference attack that is stable and adaptable to various scenarios. Specifically, we estimate the size of the victim client's dataset and construct several virtual clients tailored to the victim client. We then quantify the temporal generalization of each class label for the virtual clients and utilize the variation in temporal generalization to train an inference model that predicts the label distribution proportions of the victim client. We validate our approach on multiple datasets, including MNIST, Fashion-MNIST, FER2013, and AG-News. The results demonstrate the superiority of our method compared to state-of-the-art techniques. Furthermore, our attack remains effective even under differential privacy defense mechanisms, underscoring its potential for real-world applications.

cs.LG↗

Origin of yield stress and mechanical plasticity in model biological tissues

During development and under normal physiological conditions, biological tissues are continuously subjected to substantial mechanical stresses. In response to large deformations cells in a tissue must undergo multicellular rearrangements in order to maintain integrity and robustness. However, how these events are connected in time and space remains unknown. Here, using computational and theoretical modeling, we studied the mechanical plasticity of epithelial monolayers under large deformations. Our results demonstrate that the jamming-unjamming (solid-fluid) transition in tissues can vary significantly depending on the degree of deformation, implying that tissues are highly unconventional materials. Using analytical modeling, we elucidate the origins of this behavior. We also demonstrate how a tissue accommodates large deformations through a collective series of rearrangements, which behave similarly to avalanches in non-living materials. We find that these tissue avalanches are governed by stress redistribution and the spatial distribution of vulnerable spots. Finally, we propose a simple and experimentally accessible framework to predict avalanches and infer tissue mechanical stress based on static images.

physics.bio-ph↗

Spatial Confinement Affects the Heterogeneity and Interactions Between Shoaling Fish

Living objects are able to consume chemical energy and process information independently from others. However, living objects can coordinate to form ordered groups such as schools of fish. This work considers these complex groups as living materials and presents imaging-based experiments of laboratory schools of fish to understand how this non-equilibrium activity affects the mechanical properties of a group. We use spatial confinement to control the motion and structure of fish within quasi-2D shoals of fish. Using image analysis techniques, we make quantitative observations of the structures, their spatial heterogeneity, and their temporal fluctuations. Furthermore, we utilize Monte Carlo simulations to replicate the experimentally observed area distribution patterns which provide insight into the effective interactions between fish and confirm the presence of a confinement-based behavioral preference transition. In addition, unlike in short-range interacting systems, here structural heterogeneity and dynamic activities are positively correlated as a result of complex interplay between spatial arrangement and behavioral dynamics in fish collectives.

cond-mat.soft↗

Tensor-network-assisted variational quantum algorithm

Near-term quantum devices generally suffer from shallow circuit depth and hence limited expressivity due to noise and decoherence. To address this, we propose tensor-network-assisted parametrized quantum circuits, which concatenate a classical tensor-network operator with a quantum circuit to effectively increase the circuit's expressivity without requiring a physically deeper circuit. We present a framework for tensor-network-assisted variational quantum algorithms that can solve quantum many-body problems using shallower quantum circuits. We demonstrate the efficiency of this approach by considering two examples of unitary matrix-product operators and unitary tree tensor networks, showing that they can both be implemented efficiently. Through numerical simulations, we show that the expressivity of these circuits is greatly enhanced with the assistance of tensor networks. We apply our method to two-dimensional Ising models and one-dimensional time-crystal Hamiltonian models with up to 16 qubits and demonstrate that our approach consistently outperforms conventional methods using shallow quantum circuits.

quant-ph↗

Bridging the Gap Between Collective Motility and Epithelial-Mesenchymal Transitions through the Active Finite Voronoi Model

We introduce an active version of the recently proposed finite Voronoi model of epithelial tissue. The resultant Active Finite Voronoi (AFV) model enables the study of both confluent and non-confluent geometries and transitions between them, in the presence of active cells. Our study identifies six distinct phases, characterized by aggregation-segregation, dynamical jamming-unjamming, and epithelial-mesenchymal transitions (EMT), thereby extending the behavior beyond that observed in previously studied vertex-based models. The AFV model with rich phase diagram provides a cohesive framework that unifies the well-observed progression to collective motility via unjamming with the intricate dynamics enabled by EMT. This approach should prove useful for challenges in developmental biology systems as well as the complex context of cancer metastasis. The simulation code is also provided at https://github.com/jxhuangphys/Active_Finite_Voronoi_simulation.

cond-mat.soft↗

Constitutive model for the rheology of biological tissue

The rheology of biological tissue is key to processes such as embryo development, wound healing and cancer metastasis. Vertex models of confluent tissue monolayers have uncovered a spontaneous liquid-solid transition tuned by cell shape; and a shear-induced solidification transition of an initially liquid-like tissue. Alongside this jamming/unjamming behaviour, biological tissue also displays an inherent viscoelasticity, with a slow time and rate dependent mechanics. With this motivation, we combine simulations and continuum theory to examine the rheology of the vertex model in nonlinear shear across a full range of shear rates from quastistatic to fast, elucidating its nonlinear stress-strain curves after the inception of shear of finite rate, and its steady state flow curves of stress as a function of strain rate. We formulate a rheological constitutive model that couples cell shape to flow and captures both the tissue solid-liquid transition and its rich linear and nonlinear rheology.

cond-mat.soft↗