Search arXiv⌕ Search

arXiv subjects

Junde Wu

Publications and source records attributed to Junde Wu.

At least 19 recordsLinked to original sources

Magic Can Superactivate Quantum Capacity

Environmental magic can enable two channels with zero quantum capacity to transmit quantum information jointly. We establish this superactivation within a family of discrete quantum convolution channels with fixed Clifford interactions. For the couplings considered, stabilizer-mixture environments induce entanglement-breaking channels. We construct a mixed magic environment whose induced channel has positive private capacity and a Choi state with positive partial transpose, hence zero quantum capacity. A half-erasure auxiliary activates this channel through the Smith--Yard mechanism. Finite-block encoding and decoding over a self-complementary convolution auxiliary then realize a higher-dimensional erasure channel that still permits activation. We also bound the activated capacity by the modified relative entropy of magic of the main environment. Replacing either environment of the convolution pair by any stabilizer mixture makes the joint quantum capacity vanish, identifying environmental magic as a necessary resource on both sides for this realization.

quant-ph↗

Attainable Boundaries versus Operational Equivalence: Dual Benchmarks for the Hierarchical Assessment of Quantum Resources

Conventional resource theories quantify utility against an idealized free set $\mathcal{F}$. In practice, however, realizable states are confined to a specific supply environment $\mathcal{E}$ shaped by experimental and noise constraints. We propose a framework that evaluates the relative utility of arbitrary states with respect to $\mathcal{E}$, using two reference representations: the set of states reachable by free operations (defining the attainable boundary) and the set obtained via numerical optimization (defining operational equivalence). Two complementary methodologies are established. First, by assessing each state under its individually optimized strategy, we provide a strategy-dependent benchmark that quantifies achievable performance. Second, by deriving the optimal strategy for each state separately, we obtain a computable lower bound, yielding a strategy-independent measure of relative superiority that is independent of specific setups. To realize these methodologies numerically, we introduce relative measures based on the generalized robustness and the relative entropy. We then establish, theoretically, a quantitative hierarchical relation between the strategy-dependent benchmark and the strategy-independent lower bound. In a thermodynamic setting, the minimum work cost for synthesizing a target state is lower-bounded by the free-energy difference, which reflects only absolute utility. Applying our framework, we identify this bound as a strategy-independent quantification. Through two scenarios based respectively on information-theoretic distance and thermodynamic distance, we derive upper bounds on the minimum work cost for recovering entanglement in a noisy environment. We show that, at moderate and low temperatures in the low-noise regime, the thermodynamic-distance-based upper bound is tighter than the information-theoretic one.

quant-ph↗

Scalable next-scale autoregression for medical image generation across anatomical regions

Autoregressive pretraining has been key to the scalability of large language models, yet medical generative foundation models remain predominantly based on diffusion. Here we introduce MedVAR, the first foundation model for all-round medical image generation through autoregressive training, and find it offers improved generation quality and efficiency, stronger scalability, and broader adaptability to downstream clinical tasks than diffusion-based models. A tokenizer trained on medical images and separate semantic and structural controls enable generation across six anatomical regions in computed tomography and magnetic resonance imaging. Trained on 438,905 slices from 40 datasets, including seven internal clinical centres, MedVAR generates images 12-19 times faster than 100-step diffusion baselines. Generation quality improves with model size. Pretraining on generated images improves seven-centre hepatocellular carcinoma segmentation Dice from 0.615 to 0.632, while reconstruction using MedVAR images approaches the volumetric segmentation performance of fully sampled volumes. Membership inference reaches 3.54% sensitivity at a 1% false-positive rate, while copy detection performs near chance. These findings establish next-scale autoregression as a scalable and versatile approach to medical image generation and downstream analysis.

cs.CV↗

Quantum Defect Analysis and Target-Orbit-Directed Correction via the Purpose-Oriented Framework: Applications to Entanglement Repairability and Teleportation Activation

Quantum resource theories quantify advantages but suffer from ambiguous free sets, limiting target-oriented missions. We improve upon this by introducing a purpose-oriented framework, shifting reference from ``free'' to ``maximally efficient.'' Its deficiency measure quantifies loss, classifies mixed states, estimates noise, and signals quantum-error-correction thresholds and Hadamard gate performance. We define repair capacity to show the measure metrics mission success under free-set ambiguity. This capacity equals a one-sided spectral separation of pulled-back effects, exposing the mixed-unitary boundary. We derive affine Bloch translation for qubits and odd-even separation for Werner-Holevo channels. For one-sided qubit generalized amplitude damping, optimizing below the classical teleportation limit yields finite-temperature onset $z_β=1/\sqrt{2}$ and optimal interaction time. Thus, establishing the purpose-oriented framework is not merely a mathematical alternative but systematically integrates non-random-unitary dynamics, algorithmic calibration, and dissipative task activation, advancing practical quantum resource utilization.

quant-ph↗

LabFactory: Building and Evaluating Executable AI Labs

Scientific tasks specify a desired capability, but realizing it often requires building a computational system tailored to the task---acquiring data, designing representations, training models, implementing tools, and deciding how they are used at inference. We present, a framework in which an AI builder turns a scientific brief into an executable AI lab: a task-specific solver that integrates models, knowledge resources, tools, and a controller behind a fixed interface. The builder develops and packages the lab in a metered workspace; a separate host then executes the delivered artifact on held-out inputs, with reference labels kept outside the solver's input interface, and scores its outputs under the task's protocol. This makes the delivered system, rather than the builder's account of its progress, the object of evaluation. We document 10 selected constructions across six scientific task categories---from molecular and genomic prediction to medical imaging, clinical decision support, and biomedical text---whose delivered labs exceeded their configured reference values on all 12 subtests under host-side execution. Four contain predictive models fitted during construction; the others assemble executable analysis environments, knowledge resources, and tool-driven workflows around a fixed platform LLM. Together they show that an AI agent can carry a scientific brief all the way to a working lab that can still be invoked, inspected, and checked after construction ends.

cs.LG↗

MedRSI: Recursive Self-Improvement for Medical Agents via Clinically Aligned Self-Evolution

Medical agents increasingly combine general reasoning models with specialized clinical tools, yet their capabilities remain largely fixed by what clinicians and engineers design before deployment. Recursive self-improvement (RSI) offers a different paradigm in which agents learn from their own failures and autonomously expand their capabilities, but directly applying RSI to medicine introduces fundamental safety challenges. We introduce MedRSI, the first recursive self-improvement framework for medicine, which continuously transforms diagnostic failures into new clinical capabilities through tool composition and task-specific model training. Inspired by clinical practice, MedRSI introduces two mechanisms for clinically aligned self-evolution. Clinical-cost-aware failure prioritization directs improvement toward errors according to their potential clinical consequences rather than frequency alone. Fast discovery with slow registration separates rapid capability invention from conservative adoption, allowing new tools to enter the persistent agent only after demonstrating sustained benefit across subsequent patient cohorts. Across public glaucoma and heart disease benchmarks and two private clinical tasks, MedRSI progressively develops segmentation, measurement, prediction, multimodal reasoning, and generative capabilities, surpasses manually engineered medical agents, and autonomously discovers solutions to clinical problems not anticipated by its original designers. Our results show that medical agents need not remain constrained by capabilities specified before deployment: with clinically grounded mechanisms governing what to improve and what to retain, they can continuously construct, validate, and accumulate new capabilities from diagnostic experience. Code is available at https://github.com/ImprintLab/MedRSI.

cs.AI↗

Quantum Probability Current Guided Reduction of Coupling Control Degrees of Freedom for Excitation Transport

Time-dependent coherent control can enhance excitation transport in open quantum networks, but independently controlling every inter-site coupling creates a control space of high dimension and leads to difficult optimization problems. We introduce an edge-ranking strategy based on the control-induced change in the gradient component of the time-integrated quantum probability current, which is obtained via a graph Hodge decomposition. When our strategy is applied to the seven-site Fenna-Matthews-Olson (FMO) model, the six-edge set retains $99.83\%$ of the enhancement achieved by full control, and the four-edge set retains $97.60\%$ while reducing the pulse fluence---used here as a proxy for control effort---by $41.55\%$ relative to full control. Dephasing scans and comparisons with random edge sets and random networks provide numerical support for the relevance and potential broader utility of the ranking. These results show that edge selection guided by the quantum probability current can substantially reduce the control space while preserving high transport performance with lower control effort.

quant-ph↗

Efficient quantum compression for identically prepared states with arbitrary dimensio

Identical preparation creates permutation symmetry that can be used for lossless quantum compression. For $n$ copies of an unknown $d$-dimensional pure state, the tensor-power input lies in the fully symmetric subspace, whose dimension is polynomial in $n$ for fixed local dimension. Schur--Weyl duality isolates this subspace coherently, allowing the fixed representation labels to be discarded while retaining all information needed for recovery. The resulting encoder and decoder are exact on the input family. Because tensor-power states span the symmetric subspace, the achieved memory dimension is also necessary for reversible coherent compression, so the scheme is space-optimal. The encoder is implemented recursively with Clebsch--Gordan transforms, and only the branches reached by symmetric inputs need to be reproduced. Standard efficient synthesis of these transforms yields polynomial-size circuits for fixed local dimension and arbitrary target accuracy. Thus identically prepared pure states in arbitrary dimension admit lossless, space-optimal compression with an efficient circuit implementation.

quant-ph↗

AI Can Be Easily Persuaded in Clinical Decision Making

As AI becomes increasingly integrated into clinical practice, it is playing a growing role in medical decision making. Medicine, however, is a high stakes and evidence based field, where decisions can directly affect patients' lives. It is therefore important to understand whether AI can maintain objective judgment when others try to persuade it. In this paper, we study how easily AI can be persuaded through controlled experiments. We find that professional authority, national background, institutional affiliation, claimed past performance, multiple physicians, supported clinician views, and repeated pressure can all affect AI decisions. Surprisingly, the same persuasive input changes about 10% more cases when it comes from a senior clinician than from a medical student. Simply claiming a better performance history consistently makes the physician more persuasive. More strikingly, a plausible clinician view can persuade AI away from a correct decision even when it is fabricated to support an incorrect answer. This indicates that AI can be strongly influenced by convincing support without reliably determining whether this view from the clinician is correct. Together, these findings suggest that AI can be easily persuaded by what people say, who says it, and how the opinion is presented. Therefore, it is essential for AI to maintain sound judgment under persuasion, enabling its safe and reliable use in high stakes medical decision making.

cs.CL↗

The State Cost of Classical Simulation of One-Way General Quantum Finite Automata

Under strict cutpoints, probabilistic finite automata (PFAs) and one-way general quantum finite automata (1gQFAs) recognize the same stochastic languages, shifting the theoretical focus to the state cost required for a classical PFA to simulate a 1gQFA. For an $n$-state ($n\geq 2$) 1gQFA, the state cost upper bound of classical simulation was previously known to be $n^2+3$, while the lower bound remained an open problem widely conjectured to be quadratic. After establishing a well-defined notion of classical simulation, we improve the existing state cost upper bound from $n^2+3$ to $n^2+1$. Subsequently, we introduce the concepts of shattering and dynamic shattering, which are used to determine the memory required for a PFA to recognize a language. Using these techniques, we prove that the state cost lower bound of the simulation reaches $n^2+1$ over a four-letter alphabet. With the upper and lower bounds thus matching, the problem is fully resolved.

cs.FL↗

Git Context Controller: Manage the Context of LLM-based Agents like Git

Large language model (LLM) agents have demonstrated strong capabilities in long-horizon tasks by interleaving reasoning with tool use. However, as these agents scale to complex workflows such as software engineering and open-ended research, context management becomes a fundamental bottleneck: interaction histories grow unbounded, become costly to maintain, and are difficult to reuse across sessions and agents. We introduce \textbf{Git-Context-Controller (GCC)}, a structured context management framework inspired by software version control systems. GCC elevates agent context from a transient token stream to a persistent, navigable memory workspace with explicit operations -- \texttt{COMMIT}, \texttt{BRANCH}, \texttt{MERGE}, and \texttt{CONTEXT}, that enable milestone-based checkpointing, isolated exploration of alternative reasoning paths, and hierarchical retrieval of historical context. By organizing agent memory as a versioned file system, GCC allows agents to manage long-term goals, recover and transfer reasoning across sessions, and coordinate multi-trajectory problem solving in a principled manner. Empirically, agents equipped with GCC achieve state-of-the-art performance on both SWE-Bench and BrowseComp benchmarks. On SWE-Bench Verified, GCC improves task resolution by over 13\% relative to strong long-context baselines and outperforms 26 existing open and commercial systems, reaching over 80\% success rate. The project will be open-sourced for the research community. https://github.com/ImprintLab/git-context-controller

cs.SE↗

J-CoT: Chain-of-Thought in J-Space

Chain-of-thought prompting improves language-model reasoning by carrying intermediate states across successive computation steps. However, relying on natural language as the only recurrent interface is overly restrictive, since many transient computations do not need to be fully verbalized. Existing latent-reasoning methods remove this constraint by recurrently propagating continuous hidden states. However, these methods pass a dense hidden vector as a whole, without an explicit mechanism for selecting and organizing the information needed by the next reasoning step. This motivates an intermediate interface that remains linguistically grounded without requiring a decoded sentence. We introduce \textbf{J-CoT}, a recurrent reasoning framework built on \emph{J-space}, a vocabulary-indexed coordinate system within the model's hidden representations. Within each cycle, the model computes in its full hidden space. At the cycle boundary, J-CoT expresses the intermediate state as vocabulary-indexed coefficients, carries these coefficients forward as a \emph{J-thought}, and maps them back into the model's hidden representation for the next cycle. J-CoT therefore requires neither a fluent intermediate rationale nor recurrence over the complete hidden state. Under matched backbone and inference settings, J-CoT-Zero matches or exceeds the strongest evaluated latent-reasoning baseline on every benchmark, while J-CoT-Train obtains the highest score across the evaluated mathematical, scientific, coding, and structured path-reasoning tasks.

cs.CL↗

Mean-State Entropy Hierarchies and Classical Communication through Quantum Convolutions

Quantum convolution provides a discrete-variable analogue of classical convolution, with the mean state capturing the stabilizer structure preserved under repeated convolution. We establish a finite-step entropy hierarchy generated by compatible stabilizer dephasings. Along every compatible isotropic flag, the entropy increases toward the mean-state entropy ceiling, while the relative-entropy distance to the mean state decomposes exactly into successive coherence losses and a terminal classical nonuniformity. Optimizing over compatible subspaces yields an intrinsic entropy profile of the state. For quantum convolutional channels, Weyl covariance reduces the one-shot classical communication problem to minimal output entropy. A spectral-transfer argument shows that suitable stabilizer inputs reproduce stabilizer-measurement distributions of the environment as channel-output spectra. This gives a computable Holevo lower bound over all complete stabilizer measurements; its compatible restriction is characterized by the entropy hierarchy and refines the previous mean-state bound of Bu, Gu, and Jaffe. The bound is exact for stabilizer-diagonal environments, for which the Holevo capacity is strongly additive, and yields a single-letter formula for a nonstabilizer qutrit family. The same family also exhibits a coexistence region with simultaneously positive classical and quantum communication rates

quant-ph↗

Addressing Benchmarking Gaps in Large Language Models for Health and Medicine with Dynamic Red-Teaming

Large language models (LLMs) are increasingly used to answer health-related questions and support healthcare workflows, yet evidence for their safety still relies heavily on static benchmarks that can rapidly become obsolete or be optimized against. Here we introduce a Dynamic, Automatic, and Systematic (DAS) red-teaming audit framework that continuously stress-tests LLMs for health across four safety-critical axes: robustness, privacy, bias/fairness, and hallucination/factual inaccuracies. Validated against board-certified clinicians with high concordance, a suite of adversarial agents autonomously mutates health-related test cases to uncover vulnerabilities in real time. Applying DAS to 15 proprietary and open-source LLMs revealed a profound gap between high static benchmark performance and low dynamic reliability--the "Benchmarking Gap". Despite median MedQA accuracy exceeding 80\%, 94\% of previously correct answers failed under dynamic robustness testing. This brittleness generalized to the realistic, open-ended HealthBench dataset, where top-tier models exhibited failure rates exceeding 70\% and sharp shifts in model rankings across evaluations, suggesting that high scores on established static benchmarks may reflect superficial memorization. We observed similarly high failure rates across other domains: privacy leaks were elicited in 86\% of scenarios, cognitive-bias priming altered recommendations in 81\% of fairness tests, and hallucination rates exceeded 74\% in widely used models. By converting LLM safety evaluation for health from a static checklist into a living adversarial audit, DAS provides a scalable framework for surfacing latent risks before such systems are deployed in consumer-facing health assistants, clinician-facing tools, and broader healthcare workflows. Code is available at https://github.com/JZPeterPan/DAS-Medical-Red-Teaming-Agents.

cs.LG↗

Private Capacity of Quantum Channels Induced by Non-stabilizer Environmental States

We investigate the private capacity of quantum channels using the recently proposed quantum convolution theory for discrete-variable quantum systems. We focus on the role of the magic resource played in this framework. Firstly, for a large class of convolutional channels, we find that the private capacity is zero if the fixed environmental state is a stabilizer state. Moreover, we show that the private capacity can be nonzero for some magic environmental states. Furthermore, we show that the private capacity of a discrete beam splitter unitary is upper-bounded by the amount of magic of the environmental state. In addition, if the environmental state exhibits a certain symmetric structure, even if it is magic, the corresponding private capacity will also vanish for a class of convolution. These results emphasize the role of magic resources in quantum communication

quant-ph↗

Quantumly controlled measurement, Hermitian conjugation and normalization in matrix-manipulation algorithms

In this paper, we solve three important problems that are revealed, in particular, to matrix-manipulation algorithms. The principal novelty is introducing the concept of quantumly controlled measurement that removes the post-selection problem by solving the problem of small access probability to the desired state of ancilla and possesses several remarkable properties. We also introduce separate encoding of the real and imaginary parts of a complex matrix that allows to include the Hermitian conjugation into the list of matrix manipulations. Finally, we weaken the constraints on the { modulus} of matrix elements unavoidably imposed by the normalization condition for a pure quantum state. The quantumly controlled measurement together with both other extensions are implemented into the matrix multiplication algorithm. The appropriate circuits are presented.

quant-ph↗

BioMedArena: An Open-source Toolkit for Building and Evaluating Biomedical Deep Research Agents

Reproducing and comparing deep research agents today is hard: the same backbone evaluated on the same benchmark can report different accuracies across papers because the harness and tool registry differ, and integrating a new model into a comparable evaluation surface costs weeks of model-specific engineering. These are symptoms of a broader reproducibility problem in deep research agent research. Here, we introduce BioMedArena, an open-source toolkit that addresses this reproducibility gap and provides an arena for comparing deep research agents under a shared evaluation environment. BioMedArena decouples six layers of biomedical agent evaluation -- benchmark loading, tool exposure, tool selection, harness mode, context management, and scoring -- and exposes 166 biomedical benchmarks and 75 biomedical tools across 9 functional families. Adding a new model, benchmark, or tool can be accomplished with a few-line provider adapter. Beyond evaluation infrastructure, BioMedArena ships a library of high-quality reference components: 6 agent harnesses (including our proposed Mutual-Evolve) and 6 context-management strategies, any of which can be equipped on any backbone. Equipping these components substantially improves all 12 backbones; on each of 8 representative biomedical benchmarks, the best equipped backbone surpasses prior state-of-the-art (SOTA), by 15.01 percentage points on average. The toolkit, configurations, and per-task traces are available at https://github.com/AI-in-Health/BioMedArena.

cs.AI↗

From Failure to Feedback: Group Revision Unlocks Hard Cases in Object-Level Grounding

Finetuning Large Vision-Language Models with reinforcement learning has emerged as a promising approach to enhance their capability in object-level grounding. However, existing methods, mainly based on GRPO, assign rewards at the response level. Such sparse reward, often criterion-induced, leads to minimal learning signals when all candidate responses fail in challenging scenarios. In this work, we propose a group-revision optimisation paradigm that enhances learning on hard cases. It begins with a sampled initial response and generates a set of revised candidates to explore improved grounding outcomes. Inspired by reward shaping, we introduce a consolidation process that quantifies each candidate's improvement over the initial attempt and converts it into informative shaping signals. These signals are used to both refine the reward and modulate the advantage, amplifying the influence of high-quality revisions. Our method achieves consistent gains across referring and reasoning segmentation, REC, and counting benchmarks compared with prior GRPO-based models. Our code is available at https://github.com/yyliu01/GroupRevision.

cs.CV↗