Fields: space, quantum, biotech, agritech, IoT and robotics: research

Journal articles, academic blogs, think-tank reports and papers in this section, newest first. Back to the news.

arXiv (research papers) Giovanni M. Strampelli Space

The JWST Sub-Jupiters Survey: Observed Sensitivities to the Wide-Separation, Cold, Sub-Jupiter Exoplanet Population

We present a sensitivity analysis of three recent JWST direct imaging programs (GO-4050, GO-5835, and SURVEY-6005) designed to build a demographic study of sub-Jupiter mass ($0.1 - 1$ M$_{\mathrm{J}}$) exoplanets in nearby young associations and moving groups. We find that these programs are sensitive to sub-Saturn to Jupiter mass exoplanets with effective temperature (T$_\mathrm{eff}$) as low as $\lesssim 250$ K, already at $\sim 2$ arcsec. A comparison with the SHINE…

Read at arXiv (research papers)

arXiv (research papers) Vinh San Dinh

Experimental simulation of a Hilbert-space inner-product change

We simulate an effective change in a single qubit's inner product (IP) by implementing the channel $\mathcal{F}^η$ on a superconducting quantum processor. Whereas previous experiments simulated parity-time (PT)-symmetric dynamics with a fixed IP, this experiment implements the IP-change channel itself for metrics associated with PT-symmetric systems. Building on an earlier adversarial verification approach, we derive a process-fidelity threshold that rules out mixtures of…

Read at arXiv (research papers)

arXiv (research papers) Adán Cabello

Plenitude of ideal correlations explains quantum theory

We show that the Hilbert-space formalism and the Born rule of quantum theory are singled out by the following principle: every correlation that is possible in a theory in which every observable admits an ideal measurement is physically realizable. An ideal measurement is one that yields the same outcome when repeated and does not disturb any compatible observable.

Read at arXiv (research papers)

arXiv (research papers) Bernhard Jobst

Localization transition in a spin chain with an exact Fock-space tree

Many-body localization is often pictured as Anderson localization on the graph of many-body configurations. Strongly correlated disorder and a dense net of loops, however, make this graph hard to analyze. We introduce a local disordered spin-1 chain in which a single domain wall explores an exact binary tree of configurations. Random fields create strongly correlated disorder on this tree, as in generic interacting systems, while the absence of loops keeps the problem…

Read at arXiv (research papers)

arXiv (research papers) Alexandra Rochon Space

A First Look at Astrometric Outer Companions to Super-Earths and Sub-Neptunes using Gaia DR2 and DR3

Massive outer companions (OCs) are believed to promote, inhibit, or otherwise regulate the formation and composition of inner small planets (ISPs) both in the solar system and in exoplanetary systems. To assess how, we leverage calibrated absolute astrometry from Gaia DR2-DR3 of 7,321 FGKM dwarfs and present measurements of the relative occurrence rate of OCs in systems hosting known ISPs (i.e. P(OC$|$ISP)/P(OC)), including systems with inner super-Earths only, inner…

Read at arXiv (research papers)

arXiv (research papers) Alejandro Corichi

Geometry of squeezed states. The phase-space metric, relative vacua and cosmology

Geometry enters quantum theory in two places. The space of quantum states carries a symplectic form, which generates unitary evolution, and a metric, which governs uncertainties and transition probabilities. The classical phase space acquires a metric of its own when a vacuum is chosen: quantizing a linear system amounts to choosing a compatible complex structure, equivalently a compatible metric $g$. We take this second metric as the primary object and show that it plays…

Read at arXiv (research papers)

arXiv (research papers) Philipp Kleinpaß

Rethinking Entropic Uncertainty: How measuring without a trace leads to longer keys

In recent years, the entropic uncertainty relation (EUR) has been one of the most prominent tools to obtain tight key rates secure against general coherent attacks for a broad class of quantum key distribution (QKD) protocols. Despite its success, the fundamental question of how to incorporate the statistics of more than two mutually unbiased bases (MUBs) directly into the EUR is yet to be answered. Here, we introduce a simple yet powerful shift of perspective: Instead of…

Read at arXiv (research papers)

arXiv (research papers) Andrés Agustí Casado

Reinforcement Learning designs Quantum Repeater Protocols on Networks beyond the Chain Scenario

Small-scale quantum repeater protocols have been shown to distribute entanglement over existing telecommunication infrastructure by means of short range quantum communications and long range classical messages. For larger networks, there are a number of theoretical proposals about how to operate the network to achieve a good performance under varying metrics. Moreover, since the dimension of the space of possible protocols grows exponentially with network size, plenty of…

Read at arXiv (research papers)

arXiv (research papers) Lijun Wang

Sharp $L_p$-Regularity for Quantum Markov Semigroups

We determine the sharp universal constants in positive-input $L_p$-regularity for finite-dimensional quantum Markov semigroups with a faithful invariant state. For $1<p<\infty$, they are $p\sin(π/p)/(2(p-1))$ under KMS symmetry and $\frac{p}{2(p-1)}\tan(\fracπ{2}\min\{1/p,1-1/p\})$ without a symmetry assumption, with the endpoint values at $p=1$ given by $π/2$ and $π/4$, respectively.

Read at arXiv (research papers)

arXiv (research papers) Asen L. Georgiev

Quantitative measurement of microwave power at millikelvin temperatures: Comparison between dispersively and directly coupled superconducting qubits

The Rabi frequency of a two-level system is directly proportional to the electric field amplitude being incident on this system. Taking advantage of this relationship, it is possible to use two-level systems as quantitative sensors of electric fields. Here, we apply this concept to superconducting qubits and use them for quantitative measurement of microwave power at millikelvin temperatures. Our superconducting circuit design includes three transmon qubits directly coupled…

Read at arXiv (research papers)

arXiv (research papers) Kenta Kasai

Vanishing Relative Distance of Uniformly Random CSS LDPC Codes Built from Permutation Matrices

Classical random regular low-density parity-check codes can have minimum distance growing linearly with block length. We study CSS check matrices formed as full $J\times L$ arrays of arbitrary $P\times P$ permutation matrices, sampled uniformly subject to commutation. For fixed column weight $J\ge3$ and fixed even row weight $L>2J$, we prove that the relative minimum distance converges to zero in probability as $P\to\infty$, with block length $n=LP$. We analyze the weight…

Read at arXiv (research papers)

arXiv (research papers) Julius Beerwerth

Data-Driven Predictive Control for Autonomous Vehicle Racing under Varying Friction

Data-driven predictive control (DPC) predicts future outputs by combining recorded input-output trajectory data such that the combined trajectory approximately matches a measured initial trajectory and tracks a provided reference. This paper investigates to what extent and under which conditions DPC using data pooled across operating conditions retains the prediction accuracy of DPC using data from the current operating condition. In autonomous vehicle racing, the tire-road…

Read at arXiv (research papers)

arXiv (research papers) Anubhav Chaturvedi

Information Causality Defeats Every Finite NPA Level

For every finite level of the Navascués-Pironio-Acín (NPA) hierarchy, we construct correlations that satisfy all its constraints but violate information causality. At each fixed level, one use of a binary-outcome correlation and one classical bit suffice for a violation that grows without bound as the number of measurement settings increases. Information causality bounds the information gained about independent database bits, summed over possible requests, by the length of…

Read at arXiv (research papers)

arXiv (research papers) Yasir Mehmood

Sequential strategy for depolarizing strength estimation

We study the advantages of applying a sequential strategy for enhancing the precision in estimating the strength $p$ of a depolarizing channel, using qudit and two-qubit probes. The sequential strategy requires that the same depolarizing channel is repeatedly applied $M$ times to the quantum probe. From the analysis of the probe's output state, both the quantum Fisher information (QFI) and its regularization RQFI, given from multiplication by $p$, are analyzed. We determine…

Read at arXiv (research papers)

arXiv (research papers) Vito Viesti

Catalytic compression of classical communication in exact entanglement transformations

Entanglement catalysis is usually associated with making otherwise impossible transformations possible. Here we show that it can also change how much classical communication a transformation requires. A catalyst, returned exactly and uncorrelated with the output, can reduce the message alphabet size required for exact transformations of bipartite pure states by a factor that grows without bound as the Schmidt rank increases. In the asymptotic many-copy regime, however, this…

Read at arXiv (research papers)

arXiv (research papers) Rui Lin

Quantum adiabatic and diabatic optimization: A Hilbert space engineering strategy with Rydberg arrays

Neutral-atom arrays provide a versatile platform for encoding combinatorial optimization problems with arbitrary graph connectivity [Nguyen et al., PRX Quantum 4, 010316 (2023)]. Although the dynamics of individual encoding gadgets has been studied [Bombieri et al., PRX Quantum 6, 020306 (2025)], understanding annealing bottlenecks in larger networks remains challenging. We investigate how engineering the Hilbert-space geometry controls quantum annealing in a family of…

Read at arXiv (research papers)

arXiv (research papers) Pascal Descamps Space

Why Cassini's Oval Could Not Replace Kepler's Ellipse?

In the later seventeenth century, Kepler's ellipse was not yet accepted. Ward claimed that Boulliau's conic hypothesis amounted to a Ptolemaic equant at the ellipse's empty focus, and built his own model on it. Around 1675--1680, Giovanni Domenico Cassini proposed another curve, the ``oval'', a genus-1 quartic with no closed-form Kepler equation; yet its eccentric anomaly shares exactly the leading coefficient of Kepler's, and its empty focus is, for the Sun, 38 times closer…

Read at arXiv (research papers)

arXiv (research papers) Rahul Ghosh

Experimentally relevant witness for non-Markovianity in discrete time crystals

Discrete time crystals (DTCs) are almost always analyzed under the Born-Markov approximation, in which the environment is memoryless. We show that a reservoir with a finite correlation time $τ_m$ leaves an exact and strikingly simple imprint on the stroboscopic dynamics of DTCs, which can be used as an experimentally relevant witness for non-Markovianity. By analyzing a post-Markovian master equation we prove that the Floquet spectrum splits into the ordinary Markovian…

Read at arXiv (research papers)

arXiv (research papers) Ben Howe

TCBP-JOBS: GPU-Accelerated Quantum Error Correction Decoding and Noise Learning with Near-Optimal Accuracy

Achieving near-optimal quantum error correction (QEC) decoding accuracy often requires computationally expensive searches that limit both large-scale simulation and real-time operation. We introduce trajectory-calibrated belief propagation (TCBP), which learns calibrated fault probabilities from BP trajectories, and jittered OSD beam search (JOBS), which uses these probabilities to guide parallel GPU searches. Across surface, color and bivariate-bicycle code memory and…

Read at arXiv (research papers)

arXiv (research papers) Amir Hossein Barjini

Safe Physical Interaction of All-Electric Heavy-Duty Robotic Manipulators via Control Barrier Functions and Variable Impedance Control

All-electric heavy-duty robotic manipulators are increasingly expected to operate close to tunnel walls, equipment, and other structures while retaining the force capability required for large-payload tasks. Accurate motion control alone does not address the resulting safety and interaction requirements. This paper develops a safety-aware physical-interaction architecture that combines variable impedance control (VIC) with control barrier functions (CBFs) on top of an…

Read at arXiv (research papers)

arXiv (research papers) Arda Cinar Demirtas

Déjà-Events: Multi-view 3D Geometry with Event Cameras via Sparsity-Aware Adaptive Gating

Event cameras keep capturing structure where conventional cameras blur or saturate, which makes them attractive for 3D perception in fast or poorly lit scenes. Event datasets with dense 3D ground truth, however, are far smaller and less diverse than the image collections behind feed-forward 3D reconstruction models. We present Déjà-Events, an event-only model that predicts depth, camera pose and pointmaps from multiple views in a single forward pass. Rather than relying on…

Read at arXiv (research papers)

arXiv (research papers) Bolin Zhang

SCOPE: A Physical Execution Latency-Guided Quantum Circuit Compilation Framework

Quantum computing requires compilers to translate algorithms represented in the quantum circuit model into unitary operations supported by physical devices. Limited coherence time makes physical execution latency an important compilation objective. Gate fusion can shorten pulses, but gate count and depth do not capture fused targets' control demands. Evaluating every candidate with quantum optimal control (QOC) would embed pulse optimization in structural search. We present…

Read at arXiv (research papers)

arXiv (research papers) Zhonggang Li

Hybrid Optimization-Generative Motion Planning for Multiagent Affine Formations

Formation maneuver control enables a multiagent system to cooperatively navigate through constrained environments in collective motion. While various formation controllers exist, they rely heavily on high-quality and dynamically feasible reference trajectories provided a priori, making formation motion planning (FMP) essential. To address the computational challenges for high-dimensional joint trajectories faced by conventional constrained optimization-based solutions, this…

Read at arXiv (research papers)

arXiv (research papers) Haoyun Tang

ThinkWAM: Rethinking Latent Futures for Action Refinement

World-action models (WAMs) couple action generation with predictions of future states. An initial action chunk may be flawed. A future prediction that is not conditioned on the chunk may fail to reflect the changes that the proposed actions would induce in visual representations, limiting its usefulness for refinement before execution. We introduce ThinkWAM, a latent WAM that establishes bidirectional feedback before execution through a proposal-rethink-refine loop: the…

Read at arXiv (research papers)

arXiv (research papers) Lucas Schulze

BoBDeLaN: Bounded-Bandwidth Context Adaptation for Deep Lagrangian Robot Control

Learned physics-based models provide structure for robot control, but uncertain payloads and unmodeled dynamics limit their predictive accuracy. Context-aware Deep Lagrangian Networks enable adaptation through a latent context inferred from measurement histories while retaining Lagrangian structure for each fixed context. However, this structure alone does not constrain sensitivity to measurement disturbances. We introduce BoBDeLaN, which combines a contracting, gain-bounded…

Read at arXiv (research papers)

arXiv (research papers) Rahul Security

PQC Migration: End-to-End Performance Profiling of Post Quantum Cryptographic Algorithms in mTLS

Emerging quantum computers threaten to break the classical key exchange algorithms. To safeguard against these threats, migration to new quantum-safe algorithms is underway and expected to be expedited. Though resistant to attacks, the quantum safe algorithms may impact the real-world performance due to their large key lengths. In this work, we analyze the end-to-end performance of the Transport Layer Security (TLS) protocol with the post-quantum (PQ) and hybrid…

Read at arXiv (research papers)

arXiv (research papers) Saray Bakker

Cooperative Mobile Manipulation using Learned Dynamical Systems

Cooperative mobile manipulation requires robots to coordinate their motions while ensuring whole-body collision avoidance and preserving task-relevant behaviors. We propose CALDS (Cooperative Adaptation of Learned Dynamical Systems), a framework that enables mobile manipulators to adapt learned single-agent behaviors for coordinated execution. Building on individual dynamical systems (DSs) learned from demonstrations, CALDS enables cooperative adaptation through two key…

Read at arXiv (research papers)

arXiv (research papers) Petar Lukovic

Polygraph: Large-Scale Multi-Session Trajectory Optimization using Pose Graphs

Robots, vehicles, and wearable devices often traverse the same environment many times. Each pass produces its own trajectory from onboard visual or visual-inertial odometry. These trajectories are locally accurate but drift over time and live in unrelated coordinate frames. Turning many such independent trajectories into one globally consistent set is the large-scale multi-session trajectory optimization problem. Existing solutions largely work offline. All sessions must be…

Read at arXiv (research papers)

arXiv (research papers) Hongyu Ma

WinDEX: Metric 3D Hand Motion Reconstruction in the Wild for Dexterous Teleoperation and Policy Learning

Human manipulation data are widely used to train robots for human-like dexterity. However, low-cost, large-scale collection in the wild remains challenging. Existing methods remain limited in geometrically grounded metric-scale reconstruction, real-world generalization and inference speed. We present WinDEX, integrating (1) geometric-temporal optimization for metric 3D hand annotation from in-the-wild egocentric stereo videos, combined with visual-inertial SLAM for…

Read at arXiv (research papers)

arXiv (research papers) Hua Zhang

Linglong Agent Service: A Runtime for Centralized Agent Reasoning and Distributed Execution

LLM agents can use remote tools and cloud sandboxes, but integrating reasoning, session state, and heterogeneous execution sites remains a runtime design problem. We present Linglong Agent Service (agentsvc), a self-hosted HTTP service and embeddable Python runtime that treats execution site as a configurable dimension alongside model, tools, and context. A parent service retains inference orchestration, tool descriptions, and conversation history; each inference request…

Read at arXiv (research papers)

Older stories