arXiv subjects

Jiaxuan Zhang

Publications and source records attributed to Jiaxuan Zhang.

At least 19 recordsLinked to original sources

arXiv2026

TraceFlow: Guiding Frozen Flow-Matching Robot Policies with Success and Failure Traces

A vision-language-action (VLA) policy with a flow-matching action expert generates each action chunk (a short command sequence) by integrating a learned velocity field; once its weights are fixed, the success or failure of an earlier rollout cannot change the chunk generated now. Concurrent test-time methods give a frozen policy such an input from retrieved successes, a learned critic, a verifier, or a dynamics model, but none uses the robot's own failed rollouts as negative evidence with nothing but a terminal outcome bit. We introduce TraceFlow, a progress-aligned guidance field that turns the action densities of retrieved successful and failed rollouts into a bounded correction to a frozen flow-matching action expert, using one terminal outcome bit per rollout and no other label. Its TraceBank stores traces, time-ordered state-action records with a terminal label, starts from the target-task training traces, and later admits the deployed robot's own rollouts. On an ordered real-robot packing task the base completes 21 of 50 trials in order, TraceFlow 39, and one stacking round without any weight update 47, with wrong-sequence episodes falling from 20 to 0. In simulation the gain is selective: with per-suite selected settings, TraceFlow raises RoboMemArena Sequence from 78.92\% to 91.50\% task success and Transferring from 54.41\% to 62.00\% at stacking round 2, leaves the 26-task aggregate unchanged, lowers Counting and Occlusion by 1.12 and 1.42 points, and changes LIBERO-Plus (Long) by +1.27 points (p = 0.0733). Stacking gains are finite, every branch peaking before round ten, and the bank's success-to-failure ratio predicts no retrieval allocation. Project page: https://zhangjiaxuan-xuan.github.io/TraceFlow/

cs.RO↗

arXiv2026

Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity

Quantum low-density parity-check (qLDPC) codes are promising candidates for realizing large-scale fault-tolerant quantum computing. Although many codes with favorable theoretical parameters have been developed, their practical adoption must take hardware implementability into account. For mainstream quantum platforms such as superconductors and neutral atoms, the connectivity, the length of non-local couplings, and the complexity of wiring or atom rearrangement are key factors that dictate the difficulty of hardware realization. Here, we propose a new family of qLDPC codes, termed routing codes. Within this family, we find explicit instances whose encoding rates are competitive to those of bivariate bicycle (BB) codes, while systematically reducing qubit connectivity, shortening the length of non-local couplings, and, crucially, making all non-local couplings mutually parallel. This parallelism translates into quantifiable benefits, substantially reducing wiring crossings in superconducting multi-layer architectures and simplifying the scheduling of atom movement in neutral-atom arrays. The weight-7 routing codes maintain a high threshold of 0.7\% and reduce the physical qubit overhead by approximately a factor of 8, compared to surface codes achieving a same logical error rate. Further increasing the weight to 11 yields a [[200, 24, 14]] and [[200, 16, 17]] codes with an encoding rate over 23 times that of the surface code, at the cost of a higher logical error rate. These results establish routing codes as a hardware-centric qLDPC family that bridges the gap between theoretical optimality and near-term physical feasibility.

quant-ph↗

arXiv2026

Summing to Uncertainty: On the Necessity of Additivity in Deriving the Born Rule

The emergence of intrinsic probability has long been one of the most important and puzzling problems in quantum mechanics, and the law most directly related to this problem is the Born rule. For a century, there have been many attempts to derive the Born rule as a theorem rather than postulating it. However, existing derivations of the Born rule are each based on different frameworks and have attracted different criticisms. The assumptions from which they start are also highly divergent, and the connections between them have not been sufficiently studied. These possible connections are very likely to be the key to answering questions about the origin of probability in quantum mechanics. This paper focuses on proving the necessity and indispensability of the additivity assumption in the derivation of the Born rule. This supports the view that the Born rule cannot be derived solely from other non-probabilistic quantum or additional postulates. We first prove that additivity cannot be derived from two other commonly used non-probabilistic additional assumptions, non-contextuality and normalization. Then we analyze the crucial role of the additivity assumption in five important existing derivations of the Born rule. These include Gleason's Theorem, Busch's extension of Gleason's Theorem, the Deutsch-Wallace Theorem, Zurek's envariance proof, and the Finkelstein-Hartle Theorem. We show that these derivations either depend heavily on the additivity assumption or lead to obvious loopholes due to the lack of additivity. We also point out some problems arised from the lack of a non-contextuality assumption. Our results provide a novel insight into the important role of additivity assumption in quantum measurement, as well as into the origin of probability in quantum mechanics.

quant-ph↗

arXiv2026

Sleeping Beauty in One or Many Worlds: A Defense of the Halfer Position

The Sleeping Beauty Problem (SBP) is a long-standing puzzle in classical probability theory and has been used to challenge the Many-Worlds Interpretation (MWI) of quantum mechanics, since both involve objective determinacy combined with subjective uncertainty about certain events. A common concern is that MWI yields a different answer to the quantum version of SBP than the widely supported Thirder position in the classical case. We argue that this concern is unwarranted. We show that in both the quantum and classical versions of SBP, the correct credence is given by the Halfer position. In the quantum (MWI) SBP, we show that if no unjustified renormalization is introduced, the correct credence is 1/2. We then extend this result to the classical SBP by refuting four major arguments for 1/3. First, we reject the Proportion Argument by distinguishing event weight from probability. Second, we rebut Elga's Variant Argument by extending an earlier critique that identifies the implicit introduction of additional information; we further clarify this point by constructing a new variant and explaining why the Principle of Indifference is inapplicable, drawing an analogy with a mistake by d'Alembert in the history of probability theory. Third, we identify a flaw in the Technicolor Beauty Variant Argument, which arises from treating overlapping events as disjoint. Finally, we argue that causal decision theory is inappropriate for SBP, rendering the Thirders vulnerable to a Dutch Book. Our results support the consistency of MWI under the challenge posed by SBP and suggest that the dominant position on SBP needs careful reconsideration.

quant-ph↗

arXiv2026

AM-FM: A Foundation Model for Ambient Intelligence Through WiFi

Ambient intelligence, continuously understanding human presence, activity, and physiology in physical spaces, is fundamental to smart environments, health monitoring, and human-computer interaction. WiFi infrastructure provides a ubiquitous, always-on, privacy-preserving substrate for this capability across billions of IoT devices. Yet this potential remains largely untapped, as wireless sensing has typically relied on task-specific models that require substantial labeled data and limit practical deployment. We present AM-FM, the first foundation model for ambient intelligence and sensing through WiFi. AM-FM is pre-trained on 9.2 million unlabeled Channel State Information (CSI) samples collected over 439 days from 20 commercial device types deployed worldwide, learning general-purpose representations via contrastive learning, masked reconstruction, and physics-informed objectives tailored to wireless signals. Evaluated on public benchmarks spanning nine downstream tasks, AM-FM shows strong cross-task performance with improved data efficiency, demonstrating that foundation models can enable scalable ambient intelligence using existing wireless infrastructure.

cs.LG↗

arXiv2025

PITE: Multi-Prototype Alignment for Individual Treatment Effect Estimation

Estimating Individual Treatment Effects (ITE) from observational data is challenging due to confounding bias. Most studies tackle this bias by balancing distributions globally, but ignore individual heterogeneity and fail to capture the local structure that represents the natural clustering among individuals, which ultimately compromises ITE estimation. While instance-level alignment methods consider heterogeneity, they similarly overlook the local structure information. To address these issues, we propose an end-to-end Multi-\textbf{P}rototype alignment method for \textbf{ITE} estimation (\textbf{PITE}). PITE effectively captures local structure within groups and enforces cross-group alignment, thereby achieving robust ITE estimation. Specifically, we first define prototypes as cluster centroids based on similar individuals under the same treatment. To identify local similarity and the distribution consistency, we perform instance-to-prototype matching to assign individuals to the nearest prototype within groups, and design a multi-prototype alignment strategy to encourage the matched prototypes to be close across treatment arms in the latent space. PITE not only reduces distribution shift through fine-grained, prototype-level alignment, but also preserves the local structures of treated and control groups, which provides meaningful constraints for ITE estimation. Extensive evaluations on benchmark datasets demonstrate that PITE outperforms 13 state-of-the-art methods, achieving more accurate and robust ITE estimation.

cs.LG↗

arXiv2025

Feature Matching-Based Gait Phase Prediction for Obstacle Crossing Control of Powered Transfemoral Prosthesis

For amputees with powered transfemoral prosthetics, navigating obstacles or complex terrain remains challenging. This study addresses this issue by using an inertial sensor on the sound ankle to guide obstacle-crossing movements. A genetic algorithm computes the optimal neural network structure to predict the required angles of the thigh and knee joints. A gait progression prediction algorithm determines the actuation angle index for the prosthetic knee motor, ultimately defining the necessary thigh and knee angles and gait progression. Results show that when the standard deviation of Gaussian noise added to the thigh angle data is less than 1, the method can effectively eliminate noise interference, achieving 100\% accuracy in gait phase estimation under 150 Hz, with thigh angle prediction error being 8.71\% and knee angle prediction error being 6.78\%. These findings demonstrate the method's ability to accurately predict gait progression and joint angles, offering significant practical value for obstacle negotiation in powered transfemoral prosthetics.

cs.RO↗

arXiv2025

Cost of Simulating Entanglement in Steering Scenario

Quantum entanglement is a fundamental feature of quantum mechanics, yet certain entangled states that are unsteerable can be classically simulated in steering scenarios, making them unable to exhibit quantum steering. Despite their significance, a systematic comparison of such entangled states has not been explored. In this work, we quantify the resource content of unsteerable quantum states in terms of the amount of shared randomness required to simulate the assemblages they generate in the steering scenario. We rigorously demonstrate that the simulation cost is unbounded even for certain unsteerable two-qubit states. Moreover, the simulation cost of entangled two-qubit states is always strictly larger than that for any separable state. A significant portion of our results rests on the relationship between the simulation cost of two-qubit Werner states and that of noisy spin measurements. Using noisy spin measurements as our central example, we also investigate the minimum number of outcomes a parent measurement requires to simulate a given set of compatible measurements. Although certain continuous measurement families admit a finite-outcome parent measurement, we identify scenarios where the simulation cost is unbounded. Our results establish previously unknown lower bounds and upper bounds on the shared randomness simulation cost, supported by connections between the simulation cost of noisy spin measurements and various geometric inequalities, including ones from the zonotope approximation problem in Banach space theory.

quant-ph↗

arXiv2025

VLA^2: Empowering Vision-Language-Action Models with an Agentic Framework for Unseen Concept Manipulation

Current vision-language-action (VLA) models, pre-trained on large-scale robotic data, exhibit strong multi-task capabilities and generalize well to variations in visual and language instructions for manipulation. However, their success rate drops significantly when faced with object concepts outside the training data, such as unseen object descriptions and textures in the dataset. To address this, we propose a novel agentic framework, VLA^2, which leverages OpenVLA as the execution backbone and effectively leverages external modules such as web retrieval and object detection to provide visual and textual knowledge about target objects to the VLA. This approach mitigates generalization failure when handling out-of-distribution objects. Based on the LIBERO simulation environment, we introduced novel objects and object descriptions to construct a new evaluation benchmark with three difficulty levels to test the effectiveness of our method. Our framework successfully outperformed the current state-of-the-art models on our designed hard-level generalization benchmark. Compared to the standalone OpenVLA baseline, VLA^2 achieves a 44.2% improvement in the success rate in the hard-level benchmark and an average improvement of 20.2% in all customized environments without any performance degradation on in-domain tasks. Project website: https://vla-2.github.io.

cs.RO↗

arXiv2025

Low-Overhead and High-Fidelity Preparation of Logical Non-Clifford States with Multi-Level Transversal Injection

Rotation gates are widely used in various quantum algorithms. To implement fault-tolerant rotation gates, state distillation or gate synthesis is typically employed. However, the overhead of these schemes scales rapidly with increasing Clifford hierarchy levels and required fidelity, limiting their use in large-scale quantum algorithms. In this letter, we propose a method termed multi-level transversal injection (MLTI) for preparing rotation states at arbitrary Clifford hierarchy levels, which achieves high fidelity while significantly reducing overhead compared to previous methods. Unlike the linear cost scaling of state distillation, the overhead of MLTI drops with Clifford hierarchy levels and then plateaus at higher levels, slashing the required space-time volume by up to several orders of magnitude. Additionally, we introduce a method for eliminating the off-diagonal terms of rotation states without extra overhead, unifying the metrics of infidelity and trace distance. These results render the overhead for high-precision rotation gates no longer prohibitive, and thus bring the broad adoption of large-scale quantum algorithms a critical step closer to reality.

quant-ph↗

arXiv2025

A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations

The advent of fault-tolerant quantum computing (FTQC) promises to tackle classically intractable problems. A key milestone is solving the Navier-Stokes equations (NSE), which has remained formidable for quantum algorithms due to their high input-output overhead and nonlinearity. Here, we establish a full-stack framework that charts a practical pathway to a quantum advantage for large-scale NSE simulation. Our approach integrates a spectral-based input/output algorithm, an explicit and synthesized quantum circuit, and a refined error-correction protocol. The algorithm achieves an end-to-end exponential speedup in asymptotic complexity, meeting the lower bound for general quantum linear system solvers. Through symmetry-based circuit synthesis and optimized error correction, we reduce the required logical and physical resources by two orders of magnitude. Our concrete resource analysis demonstrates that solving NSE on a $2^{80}$-grid is feasible with 8.71 million physical qubits (at an error rate of $5 \times 10^{-4}$) in 42.6 days -- outperforming a state-of-the-art supercomputer, which would require over a century. This work bridges the gap between theoretical quantum speedup and the practical deployment of high-performance scientific computing.

quant-ph↗

arXiv2025

Isogeometric contact analysis in subsea umbilical and power cables

Subsea umbilical and power cables contain a large number of contact interfaces between different geometries and materials. These complex interactions rise significant challenges for accurately considering contact surface properties by using traditional analytical solutions or finite element methods. These properties have been identified as the most sensitive parameters when performing the numerical simulation for stress analysis. Therefore, it is essential to apply a novel approach for contact analysis which improves the accuracy and efficiency for predicting contact properties. This paper presents an isogeometric analysis (IGA) approach addressing contact problems in dynamic umbilicals and power cables. Firstly, this isogeometric contact algorithm is formulated in MATLAB as a tool including the geometry description, contact detection and penalty function. Secondly, the contact interface between a steel tube and an outer sheath in an dynamic umbilical is established by this IGA contact algorithm and validated against that in ABAQUS for proving the accuracy and efficiency of IGA. Finally, the effects of element refinement, geometrical description, penalty factor on the accuracy, efficiency and stability of IGA are discussed.

math.NA↗

arXiv2025

Accelerating Fermionic System Simulation on Quantum Computers

A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in the second quantization representation, the number of terms in many fermion-system Hamiltonians, such as molecular Hamiltonians, is substantial, approximately $\mathcal{O}(N^4)$, where $N$ is the number of molecular orbitals. Due to this, the computational resources required for Hamiltonian evolution and expectation value measurements could be excessively large. To address this, we introduce a grouping strategy that partitions these $\mathcal{O}(N^4)$ Hamiltonian terms into $\mathcal{O}(N^2)$ groups, with the terms in each group mutually commuting. Based on this grouping method, we propose a parallel Hamiltonian evolution scheme that reduces the circuit depth of Hamiltonian evolution by a factor of $N$. Moreover, our grouping measurement strategy reduces the number of measurements needed to $\mathcal{O}(N^2)$, whereas the current best grouping measurement schemes require $\mathcal{O}(N^3)$ measurements. Additionally, we find that measuring the expectation value of a group of Hamiltonian terms requires fewer repetitions than measuring a single term individually, thereby reducing the number of quantum circuit executions. Our approach saves a factor of $N^3$ in the overall time for Hamiltonian evolution and measurements, significantly decreasing the time required for quantum computers to simulate fermionic systems.

quant-ph↗

arXiv2025

Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding

Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed correlated decoding and ``algorithmic fault tolerance" to achieve constant-time logical gates that enables universal quantum computation. However, for circuits involving mid-circuit measurements and feedback, the previous scheme for constant-time logical gates is incompatible with window-based decoding, which is a scalable approach for handling large-scale circuits. In this work, we propose an architecture that employs delayed fixup circuits and window-based correlated decoding, realizing scalable constant-time logical gates. This design significantly reduces both the frequency and duration of decoding, while maintaining support for constant-time and universal logical gates across a broad class of quantum codes. More importantly, by spatial parallelism of windows, this architecture well adapts to time-optimal FTQC, making it particularly useful for large-scale quantum computation. Using Shor's algorithm as an example, we explore the application of our architecture and reveals the promising potential of using constant-time logical gates to perform large-scale quantum computation with acceptable overhead on physical systems like ion traps.

quant-ph↗

arXiv2024

Demonstrating a universal logical gate set in error-detecting surface codes on a superconducting quantum processor

Fault-tolerant quantum computing (FTQC) is essential for achieving large-scale practical quantum computation. Implementing arbitrary FTQC requires the execution of a universal gate set on logical qubits, which is highly challenging. Particularly, in the superconducting system, two-qubit gates on surface code logical qubits have not been realized. Here, we experimentally implement a logical CNOT gate along with arbitrary single-qubit rotation gates on distance-2 surface codes using the superconducting quantum processor \textit{Wukong}, thereby demonstrating a universal logical gate set. In the experiment, we demonstrate the transversal CNOT gate on a two-dimensional topological processor based on a tailored encoding circuit, at the cost of removing the ancilla qubits required for stabilizer measurements. Furthermore, we fault-tolerantly prepare logical Bell states and observe a violation of CHSH inequality, confirming the entanglement between logical qubits. Using the logical CNOT gate and an ancilla logical state, arbitrary single-qubit rotation gates are realized through gate teleportation. All logical gates are characterized on a complete state set and their fidelities are evaluated by logical Pauli transfer matrices. The demonstration of a universal logical gate set and the entangled logical states highlights significant aspects of FTQC on superconducting quantum processors.

quant-ph↗

arXiv2024

Facilitating Practical Fault-tolerant Quantum Computing Based on Color Codes

Color code is a promising topological code for fault-tolerant quantum computing. Insufficient research on the color code has delayed its practical application. In this work, we address several key issues to facilitate practical fault-tolerant quantum computing based on color codes. First, by introducing decoding graphs with error-rate-related weights, we obtained the threshold of $0.47\%$ of the 6,6,6 triangular color code under the standard circuit-level noise model, narrowing the gap to that of the surface code. Second, our work firstly investigates the circuit-level decoding of color code lattice surgery, and gives an efficient decoding algorithm, which is crucial for performing logical operations in a quantum computer with two-dimensional architectures. Lastly, a new state injection protocol of the triangular color code is proposed, reducing the output magic state error rate in one round of 15 to 1 distillation by two orders of magnitude compared to a previous rough protocol. We have also proven that our protocol offers the lowest logical error rates for state injection among all possible CSS codes.

quant-ph↗

arXiv2024

Bose-Einstein condensation of an optical thermodynamic system into a solitonic state

Recent years have seen a resurgence of interest in multimode fibers due to their intriguing physics and applications, with spatial beam self-cleaning (BSC) having received special attention. In BSC light condenses into the fundamental fiber mode at elevated intensities. Despite extensive efforts utilizing optical thermodynamics to explain such counterintuitive beam reshaping process, several challenges still remain in fully understanding underlying physics. Here we provide compelling experimental evidence that BSC in a dissipative dual-core fiber can be understood in full analogy to Bose-Einstein condensation (BEC) in dilute gases. Being ruled by the identical Gross-Pitaevskii Equation, both systems feature a Townes soliton solution, for which we find further evidence by modal decomposition of our experimental data. Specifically, we observe that efficient BSC only sets in after an initial thermalization phase, causing converge towards a Townes beam profile once a threshold intensity has been surpassed. This process is akin to a transition from classical to quantum-mechanical thermodynamics in BEC. Furthermore, our analysis also identifies dissipative processes as a crucial, yet previously unidentified component for efficient BSC in multimode fiber. This discovery paves the way for unprecedented applications of multimode-fiber based systems in ultrafast lasers, communications, and fiber-based delivery of high-power laser beams.

physics.optics↗

arXiv2023

Hybrid Design of Multiplicative Watermarking for Defense Against Malicious Parameter Identification

Watermarking is a promising active diagnosis technique for detection of highly sophisticated attacks, but is vulnerable to malicious agents that use eavesdropped data to identify and then remove or replicate the watermark. In this work, we propose a hybrid multiplicative watermarking (HMWM) scheme, where the watermark parameters are periodically updated, following the dynamics of the unobservable states of specifically designed piecewise affine (PWA) hybrid systems. We provide a theoretical analysis of the effects of this scheme on the closed-loop performance, and prove that stability properties are preserved. Additionally, we show that the proposed approach makes it difficult for an eavesdropper to reconstruct the watermarking parameters, both in terms of the associated computational complexity and from a systems theoretic perspective.

eess.SY↗