Peer Revenue Publish or profit

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Computer Science Emerging Technologies

cs.ET Watch Emerging Technologies

Thursday 17 September

Emerging Technologies · Cross-listed from physics.med-ph

Retention-Constrained Post-Training Quantization of Cellpose-SAM for Stem Cell Microscopy

Sebastián A. Cruz Romero

Induced pluripotent stem cell (iPSC) culture increasingly relies on segmentation foundation models, yet deployment on laboratory CPUs and edge hardware requires compression schemes that are both efficient and auditable. We present a deployment-oriented evaluation of compressed Cellpose-SAM using a pre-specified retention criterion: the 95% cluster-bootstrap interval of mean change from FP32 must remain above a fixed -0.02 margin for every imaging modality. On a stratified 176-field panel spanning BBBC038 nuclei, BBBC039 U2OS fluorescence, and NIST iPSC images across density regimes, weight-only W8A16 preserves instance F1 across all modalities. A sensitivity-guided mixed W4/W8 scheme, using four INT8 exceptions, achieves a 6.76x reduction in weight storage with no observed catastrophic failures (0/176 fields), matching W8A16 at this sample size. In contrast, ternary weight-only quantization achieves 12.08x compression but fails catastrophically on 169/176 fields. These results demonstrate that compression should be evaluated by modality-stratified downstream retention rather than single-number accuracy, and establish a reproducible protocol for auditing compressed foundation models in regulated stem-cell imaging.
Read the full abstract

Emerging Technologies · Cross-listed from quant-ph

Efficient Non-Uniform Quantum Hermite Transform through Adaptive Sampling

Nitay Mayo and Aryeh Lev Zabokritskiy

On the span of the first $N$ oscillator modes, Gauss–Hermite quadrature gives an exact change of basis between mode coefficients and $N$ weighted position space samples. We implement this transform with $O(N\operatorname{polylog}(N,1/\varepsilon))$ logical gates and polylogarithmic quantum width. The operator-error bound $\varepsilon$ holds on arbitrary superpositions and includes all auxiliary registers. The construction uses signed averages on adaptive windows to convert uniform-grid samples into weighted Hermite-root samples. Their varying widths control the amplification cost, giving the near-linear bound.
Read the full abstract

Emerging Technologies · Cross-listed from quant-ph

VQE Validation on the Mononuclear T1 (Blue-Copper) Site: A Stepping Stone to the Multi-Copper Laccase Cluster

Lucia Malickova

Validating variational quantum eigensolver (VQE) pipelines on realistic chemical systems is a critical stepping stone toward tackling classically intractable molecules. In this work, we report emulator-based validation of the VQE workflow proposed for the copper active site, executed on the LRZ Eviden Qaptiva emulator. A problem-tailored ADAPT-VQE with a full singles-doubles-triples (S+D+T) pool removes over 99% of the correlation error, reaching a stable plateau at 4.03 mEh relative to exact diagonalisation (148 selected operators). This establishes a >40x improvement over the hardware-efficient ansatz (HEA). Finally, we frame these emulator results as a robust baseline for upcoming physical quantum hardware runs on Euro-Q-Exa.
Read the full abstract

Emerging Technologies

A Closed-Form Molecule-Release Rule for Diffusion-Based Molecular Communications with Ligand Receptors

Eren Kural and Murat Kuscu

The number of molecules released per bit is a fundamental design variable of diffusion-based molecular communication (MC), and ligand-receptor reception breaks the more-is-better intuition. Too few molecules leave the bound-receptor observations buried in binding noise, while too many amplify the accumulated intersymbol interference and saturate the finite receptor population, again making the observations indistinguishable. Reliability therefore peaks in an interior operating region whose location seems to require an exhaustive search over the channel dynamics. In this paper, we show that this search can be obviated for a biologically plausible receiver that compares consecutive bound-receptor counts without channel state information or a decision threshold. We derive a closed-form transmission rule, which sets the number of molecules released per bit such that the receptor dissociation constant equals the geometric mean of the two bit-conditioned received concentration levels, prove that it exactly minimizes the bit error probability of a memoryless binomial receptor model, and express it in the physical channel parameters through an Euler–Maclaurin evaluation of the interference. Time-domain Monte Carlo sweeps of the channel and receptor parameters, corroborated by particle-based simulations, show that the empirically optimal release count coincides with the prediction or lies above it by a small factor.
Read the full abstract

Wednesday 16 September

Emerging Technologies · Cross-listed from cs.LG

Radio-Frequency Convolutional Neural Networks

Zhihui Gao, Shi-Yuan Ma, Yiran Chen et al. (+2 more)

Running artificial intelligence (AI) models directly on edge devices such as smartphones, wearables, and drones offers low latency, pervasive scalability, and data privacy, but these devices rarely carry the computing capability that modern neural networks demand. Edge accelerators have been developed in response, yet each adds computing hardware to devices already constrained in size, weight, power, and cost (SWaP-C). An alternative lies in what these devices already carry: the frequency mixer in every wireless radio multiplies signals in time, natively performing convolution in the frequency domain. Here we introduce radio-frequency convolutional neural networks (RF-CNNs), which repurpose existing communication hardware for CNN inference. Multi-channel convolutions are mapped onto frequency tones for a passive mixer to execute in a single pass. We experimentally demonstrate that RF-CNN runs deep CNNs up to 26.4 million parameters and nine layers from classification of wireless signals and images to controllable image generation, close to full-precision performance. Because the weights arrive over the air and the analog hardware is shared with communication, the edge device spends energy only on data preparation and readout-down to 0.72 femtojoules per multiply-accumulate, two orders of magnitude less than it would cost on an added digital processor. These results suggest that deployed wireless infrastructure can bring efficient, state-of-the-art AI inference to the billions of devices it already connects.
Read the full abstract

All authors Zhihui Gao, Shi-Yuan Ma, Yiran Chen, Dirk Englund, Tingjun Chen

Emerging Technologies · Cross-listed from cs.AI

The Uneven Impact of Generative AI on Student Learning: Examining the Roles of Reliance, Evaluation Literacy, and Course Policy in AI-related Courses

Lydia Manikonda, Mei Si, Sirajam Munira et al. (+2 more)

Generative artificial intelligence (GenAI) is changing how students learn, yet the roles of course context, cognitive reliance, evaluation literacy, and early reliance remain underexplored. Using survey responses from 118 students across 12 AI-related courses at our institution, we examined differences in GenAI use and perceived learning experiences. We identified four user clusters: high-use students reporting many benefits, light users reporting less reliance and fewer benefits, and two moderate-use groups reporting different levels of benefit. We also found significant differences between free- and premium-version users, single- and multiple-tool users, and students experiencing different instructor policies. In multivariable regression models, academic benefit was associated with early reliance and academic task support; positive impact was associated with cognitive reliance, academic task support, confidence in GenAI reliability, and instructor policy; and negative impact was associated with early reliance and attitudinal change. The association between early reliance and negative impact became stronger as evaluation literacy increased. Finally, perceptions of GenAI-enhanced learning appear to reflect cognitive, performance, and self-efficacy benefits, while concerns about stress and diminished critical thinking are associated with lower perceived learning benefits. These findings suggest that institutions need better policies to address such inequities so that institutions can enable students to benefit from increasingly capable AI systems.
Read the full abstract

All authors Lydia Manikonda, Mei Si, Sirajam Munira, Oshani Seneviratne, Kristin Bennett

Emerging Technologies · Cross-listed from cs.AI

Risk-Aware World Modeling with Flow-Guided Occupancy Evolution for Selective Trajectory Planning in Automated Driving

Rongxiang Zeng, Linsen Cai, Jiafu Zhang et al. (+7 more)

Safe motion planning in automated driving requires anticipating evolving traffic risks and deciding when to revise the current planned trajectory. We introduce RiskWorld, a risk-aware world modeling framework for shared occupancy forecasting and selective trajectory replacement. Spatial risk fields and temporal actor context are fused with visual bird's-eye-view features. Flow-guided evolution transports occupancy and scene features, while signed residuals correct occupancy after transport. One forecast is generated per planning step and reused across candidates. Each candidate is compared with a current-state persistence reference, yielding a nonnegative collision-score correction. The trajectory selected by current-world evaluation serves as the planning anchor and is replaced only when additional predicted risk triggers intervention and an alternative satisfies component-wise constraints on predicted risk and trajectory error. Candidate geometries remain unchanged. We evaluate RiskWorld for open-loop planning on nuScenes using camera features, annotation-derived current and historical actor states, and dataset-provided map context. RiskWorld achieves the lowest collision rate at a long evaluation horizon of 3 s, and the second-best average L2 error among various state-of-the-art baselines, while running at 11.5 FPS on a single NVIDIA RTX 4090 with 90.81 M parameters. Within-setting ablations show that RiskWorld achieves lower collision rates than the current-state rescoring baseline, while forecast reuse enables additional candidates to be evaluated at low marginal computational cost.
Read the full abstract

All authors Rongxiang Zeng, Linsen Cai, Jiafu Zhang, Yijie Zhong, Yide Tao, Shuai Wang, Nan Zheng, Hai L. Vu, Alvaro Garcia Hernandez, Yongqi Dong

Emerging Technologies · Cross-listed from cs.AI

Who Audits Whom, on What Substrate, with What Evidence? An Independence-Graded Audit Protocol for Agentic AI

Mohamed Chahine Ghanem

Agentic AI systems plan, invoke tools and act with limited supervision; they are now both the subject of audits and, increasingly, the auditor. Independence, the foundation of assurance,is still applied to them as a binary. We argue that it must be graded along three orthogonal axes: principal independence (who controls the auditor), substrate independence (an auditor sharing the auditee's foundation-model family, toolchain or guardrails fails with it) and evidence independence (whether evidence is attestable rather than self-reported). Each axis has precedent; the contribution is to grade all three on a single audit, aggregate them by the weakest link, and apply the same rubric when the auditor is itself an agent. We give the model a formal basis by transplanting the beta-factor model of common-cause failure from reliability engineering, a seven-step protocol whose outputs a third party can verify, a structural detectability analysis of a procurement-controls agent audited at three grades, and a Monte Carlo study of the model in which a conventional internal audit of an agent-a real audit team, a second agent, provider logsp-surfaces 5.9% of the faults it could in principle see and none at all in half the fault classes. We map the triple to the EU AI Act as amended, ISO/IEC 42006, UK public-sector risk-management guidance and audit-regulator practice.
Read the full abstract

Emerging Technologies · Cross-listed from quant-ph

New directions in dynamical expectation estimation

Panjin Kim, Kyung Chul Jeong and Yun-Tak Oh

Computing dynamical expectation values typically relies on approximations optimized for the state or observable separately, without accounting for how their errors combine in the final expression. This work explores an alternative approach in which each approximation is guided by both the state and the observable, accounting for how they jointly determine the target expectation value. This idea is implemented through a sweep algorithm with coupled loss functions for forward state and backward observable updates. Exact error relations provide an analytical rationale for how the proposed losses can improve the accuracy. Numerical tests on 30-qubit random circuits show errors two to three orders of magnitude smaller than those of variational state compression at equal bond dimensions. These results motivate further exploration of joint state and observable approximation for dynamical expectation value estimation.
Read the full abstract

Emerging Technologies · Cross-listed from cs.LG

APGEM: Adaptive Policy-Guided Error Mitigation for Quantum Reinforcement Learning on a Real-World CVRP Case Study

Shabir Ahmad Sofi, Bisma Majid and Mir Mohammad Yousuf

Quantum Reinforcement Learning (QRL) represents policies as variational quantum circuits (VQCs), making it attractive for combinatorial optimization such as the Capacitated Vehicle Routing Problem (CVRP). On noisy intermediate-scale quantum (NISQ) hardware, however, decoherence degrades fidelity and destabilizes learning, and conventional error mitigation is applied statically without regard to the learning context. We introduce Adaptive Policy-Guided Error Mitigation (APGEM), a controller that selects among Zero-Noise Extrapolation (ZNE), Probabilistic Error Cancellation (PEC), Clifford Data Regression (CDR), and Readout Error Mitigation (REM) online, driven by a fidelity, entropy, and cost aware utility function and an epsilon-greedy rule over temporal-difference Q-scores. We evaluate on a realistic urban-logistics testbed, a Delhi-based CVRP over real landmarks with geodesic inter-node costs, exercised across five noise families and four severity levels. On this instance, the QRL agent outperforms constructive heuristics and approaches metaheuristics, while mitigation restores approximation ratios from 0.84-0.87 to 0.92-0.94 under high noise. The controller shifts from a CDR-dominated regime under short training horizons to a balanced deployment across all four techniques under longer horizons, indicating genuine regime-dependent selection. These preliminary results position adaptive, learning-aware mitigation as a practical route to noise-resilient QRL.
Read the full abstract

Tuesday 15 September

Emerging Technologies

Quantum Approximate Multi-Objective Optimization in Routing Problems

Eduardo Willwock Lussi, Alisson dos Passos Fumaco, Marcos Vinicius Reballo et al. (+3 more)

Multi-objective optimization (MOO) problems are common in logistics, where routing decisions must balance conflicting objectives such as travel distance, delivery time, and operational risk. A recently proposed Quantum Approximate Optimization Algorithm (QAOA) parameter-transfer strategy solves multi-objective MAX-CUT problems by reusing parameters trained on smaller instances, avoiding costly reoptimization for each scalarized problem. However, its effectiveness has only been demonstrated on proof-of-concept instances tailored to quantum hardware connectivity. In this work, we evaluate the applicability of this strategy to realistic routing problems. We formulate the Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) as Quadratic Unconstrained Binary Optimization (QUBO) models, reduce them to MAX-CUT, and assess the parameter-transfer framework under conditions matching the original study. Validation is performed through classical simulations and experiments on IBM quantum hardware. The resulting Pareto fronts are compared with those obtained using an adapted classical {\epsilon}-constraint method, using hypervolume as the primary quality metric. Results indicate that parameter transfer remains effective, frequently achieving higher hypervolume and often finding competitive solutions earlier. However, performance depends on problem structure. The approach is consistently effective for TSP instances but less stable for the more constrained VRP, suggesting that QAOA parameter transferability decreases as the optimization landscape becomes more complex. These results provide the first comprehensive evaluation of QAOA parameter transfer on realistic multi-objective routing problems and demonstrate its potential beyond proof-of-concept MAX-CUT benchmarks.
Read the full abstract

All authors Eduardo Willwock Lussi, Alisson dos Passos Fumaco, Marcos Vinicius Reballo, José Carlos Libois Neto, Fernando Augusto Caletti de Barros, Eduardo Inacio Duzzioni

Emerging Technologies

Co-occurrence-Aware Quadratic Assignment for Local Feature Matching in Simultaneous Localization and Mapping

Yutaka Yamada, Yohei Hamakawa, Yutaro Ishigaki et al. (+2 more)

Local feature matching, which associates keypoints in two images as keypoint pairs, is fundamental to Visual Simultaneous Localization and Mapping (Visual SLAM). Nearest Neighbor (NN) search is commonly used for keypoint matching, but it has difficulty selecting correct keypoint pairs when multiple candidates have similar costs. To improve matching accuracy, this paper proposes a keypoint matching method that considers the pairwise co-occurrence of two keypoint pairs. The keypoint matching is formulated as a quadratic assignment problem, which is an NP-hard combinatorial optimization problem, making it difficult to solve quickly on conventional computers. Recently, Ising machines have been developed as computing devices capable of solving hard combinatorial optimization problems. Using a simulated bifurcation based Ising machine, the proposed method improved matching accuracy by approximately 8 percentage points over a conventional method on the HPatches dataset. Furthermore, we integrated the proposed method into ORB-SLAM3, a representative academic Visual SLAM system, and achieved a 3.78-fold improvement in absolute pose error (APE) and a 2.85-fold improvement in relative pose error (RPE) on the KITTI dataset scenes where multiple same shape objects are repeatedly arranged, which are challenging for accurate self-pose estimation by the original ORB-SLAM3.
Read the full abstract

All authors Yutaka Yamada, Yohei Hamakawa, Yutaro Ishigaki, Masaya Yamasaki, Kosuke Tatsumura

Emerging Technologies

Composability rather than computation sets the cost of an analog EML hardware fabric

C. Teuscher

The operator eml(x, y) = exp(x) - ln(y) with the constant 1 generates the elementary functions, a continuous counterpart to NAND. Whether it yields a useful fabric had not been asked of hardware. We ask in network models, circuit simulation and SkyWater 130 nm layout. Four bipolar junctions evaluate the operator for 13 fJ, beating a width-matched digital datapath by 4-134x. The fabric assembled from them is not cheap: it loses to resource-matched baselines, and over the reals its grammar excludes trigonometry. Amplifiers holding those junctions' operating points take 74.5% of a cell's current, so a cell costs 3000 times what they spend. Extracted non-idealities cost 2.6x when a cell must hold a value and nothing when it need only be repeatable. Sharing them across cells recovers two of the three orders. The premise was that a universal primitive licenses a uniform machine. It survives in the primitive and fails in the machine.
Read the full abstract

Emerging Technologies · Cross-listed from q-bio.MN

Local energetic coupling enhances the expressivity of chemical computation

Marco Tuccio, Jason W. Rocks and Joshua E. Goldford

Living systems compute with chemistry by mapping environmental signals onto specific internal chemical states. Despite recent advances in molecular programming, it remains unclear which physicochemical features control the computational expressivity of chemical systems. Here we inverse-design thermodynamically consistent chemical reaction networks whose steady-state response to an environmental input computes a target nonlinear function. Using implicit differentiation we train the free-energy landscape directly: standard chemical potentials, transition-state energies and thermodynamic drives. Increasingly large networks generated by elementary ligation and cleavage steps fit increasingly complex nonmonotonic polynomial functions, with expressivity scaling logarithmically with network size, predicted primarily by the number of reactions. Training individual energetic parameter classes reveals that internal thermodynamic drives, capable of breaking detailed balance, dominate trainability, with comparable performances achieved only by pairs of parameter classes. These results identify nonequilibrium drive as the most effective single resource for steady-state computational expressivity in chemical reaction networks.
Read the full abstract

Monday 14 September

Emerging Technologies · Cross-listed from cs.NE

Scaled Hippocampus-inspired Neural Networks on Neuromorphic Memristive Hardware

Joseph A. Kilgore, Jeffrey D. Kopsick, Zahin Ahmed et al. (+2 more)

The hippocampus, a key brain region for learning and memory, exhibits rich structural diversity, sparse communication, and robust dynamics with incredible energy efficiency. It offers promising insights for novel computing capabilities, particularly when co-designed with emerging hardware technologies. In this work, we draw inspiration from the rodent CA3 hippocampal subregion to develop the first spiking neural network with neuronal diversity and biologically-realistic resting state dynamics demonstrated on memristor hardware. We propose a network downscaling methodology utilizing a 4-prong objective function and demonstrate a small-scale CA3-inspired network with 179 Izhikevich-modeled neurons, 3 neuronal types and 17,996 synapses with similar resting-state dynamics as the orders-of-magnitude larger full-scale network. The small-scale network is mapped to an FPGA/memristor platform using a greedy algorithm and 18,316 memristors. Benefiting from memristor noise, the hardware implementation shows continuous periodic behavior, outperforming simulated hardware. This work showcases the potential of biologically-realistic algorithms on emerging hardware for neuromorphic computing.
Read the full abstract

All authors Joseph A. Kilgore, Jeffrey D. Kopsick, Zahin Ahmed, Giorgio A. Ascoli, Gina C. Adam

Emerging Technologies · Cross-listed from cs.NI

Proportional-Fair Resource Allocation and Dual-Threshold Early-Exit Inference for Secure Cooperative Multi-Layer Edge Intelligence

Thai T. Vu, John Le, Tu N. Nguyen et al. (+3 more)

This paper proposes FREDI (Fair Resource Allocation for Edge Dual-Threshold Inference), a secure wireless edge-intelligence framework for event-triggered inference in a cooperative user equipment (UE)–edge server (ES)–cloud system. Each UE performs early-exit convolutional neural network (CNN) screening using dual confidence thresholds, while critical events are securely offloaded to an edge server for detailed classification. We formulate a proportionally-fair utility maximization problem that jointly optimizes UE–ES association, wireless and processing resources, and confidence thresholds. FREDI decomposes the problem into proportional-fair resource allocation and dual-threshold inference optimization. We prove that the detected-critical event set is set-monotone non-increasing in both thresholds, and exploit the finite empirical confidence domain for exact threshold optimization. An empirical resource–utility response envelope yields a computable global suboptimality bound and a sufficient condition for global optimality. By pre-eliminating infeasible UE–ES pairs and exactly projecting out bandwidth and transmit-power variables, the resource-allocation subproblem is reduced to a mixed-integer exponential-cone program solvable to the certified global optimality within a prescribed gap. Numerical results with early-exit MobileNetV2 and ShuffleNetV2 demonstrate near-perfect UE fairness with aggregate utility close to a Sum-Utility benchmark, reveal security-induced resource fragmentation, and demonstrate the Stage-A scalability from 6 to 144 UEs with median solving time below 0.1~s in the tested configurations.
Read the full abstract

All authors Thai T. Vu, John Le, Tu N. Nguyen, Jun Shen, Quang Vinh Duong, Ha Nguyen

Emerging Technologies

A Hybrid Quantum-Classical Coordination Architecture for Portfolio Optimization via Global Context Injection

Xiaoguang Yang, Menghan Dou and Guoping Guo

Near-term quantum and quantum-inspired solvers for portfolio optimization rely on local subproblem execution under severe size constraints, but this locality can omit cross-cluster covariance essential for global risk coordination. We propose Context-Aware Folding (CAF), a lightweight hybrid quantum-classical coordination layer between one-shot static decomposition and full-matrix optimization. CAF injects a compressed global risk state into each local subproblem via a state-dependent linear bias, decouples local candidate generation from global commitment, and retains a sequential acceptance rule with a monotonic non-divergence guarantee. On a 2016 Russell 3000 subset (N=484) with Simulated Annealing (SA), CAF improves the scalarized mean-variance objective by 6.59% over a static baseline (20/20 wins), and by 0.2579% on an additional 2018 panel (N=1397, 17/20 wins). We further report matched folded N=40 compatibility studies with the Quantum Approximate Optimization Algorithm (QAOA) and simulated quantum annealing (SQA) as local solvers, together with a frozen hardware-in-the-loop run on Origin Quantum's Wukong 180 (WK\_C180) for one warm-started QAOA subproblem at n=5. These results support CAF as a coordination architecture with strong classical large-scale evidence, cross-backend compatibility, and local executability on real quantum hardware in the noisy intermediate-scale quantum (NISQ) era.
Read the full abstract

Emerging Technologies · Cross-listed from cs.HC

More Than Just Access: Generative AI as Communication Intermediary for Blind and Low-Vision Users

Protik Dey, Mohd Saifuzzaman and Taslima Akter

Generative AI (GenAI) tools are increasingly woven into how blind and low-vision (BLV) people communicate, not only with digital information, but with the physical world and with other people. Tools such as ChatGPT, Google Gemini, Be My AI, and Seeing AI translate visual and textual content into accessible form, and are beginning to substitute for interpersonal requests for help, such as asking a family member to read a label or describe a scene. Drawing on semi-structured interviews with 19 BLV participants, we examine GenAI as a communication intermediary and how it succeeds and fails as an alternative for reading, describing, and even asking another person for help. We also investigated what BLV users gain and risk when these tools take over that role. We conclude with design and policy implications for GenAI systems that communicate uncertainty honestly, protect information, and support BLV users' independence rather than substitute for it unsafely.
Read the full abstract

Emerging Technologies

A Game-Theoretic Framework for Incentive-Compatible AI training Under Renewable-Energy Constraints

Konstantinos Varsos, Ramin Khalili, Adamantia Stamou et al. (+2 more)

As artificial intelligence systems increasingly rely on distributed and collaborative training, the energy footprint of these processes becomes a shared responsibility. Modern AI training often unfolds across heterogeneous compute nodes-ranging from cloud clusters to edge devices-whose energy availability is spatially and temporally variable. At the same time, renewable energy grids experience growing levels of excess generation, creating opportunities to align computational workloads with low-carbon energy supply. In this work, we develop a game-theoretic model of carbon-aware AI training in which autonomous agents strategically choose whether to participate and how intensively to train under limited renewable energy availability. Each agent balances diminishing learning returns, rewards for remaining within green-energy budgets, and penalties for grid consumption. While our framework applies broadly to distributed AI training, we examine Federated Learning as a representative case study due to its decentralized structure and flexible scheduling. We analyze equilibrium existence, efficiency, and adaptive dynamics, and provide simulation evidence that appropriately designed incentives can eliminate grid-based energy usage while preserving model performance. Our findings demonstrate how incentive-compatible training mechanisms can enhance energy efficiency and sharply reduce carbon emissions under renewable-energy constraints.
Read the full abstract

All authors Konstantinos Varsos, Ramin Khalili, Adamantia Stamou, George D. Stamoulis, Vasillios A. Siris

Emerging Technologies · Cross-listed from cs.NE

A Memristive Synapse for Online STDP Learning and Inference in SNNs

Elia Mateu-Barriendos, Álvaro Gómez-Pau, Daniel Arumí et al. (+2 more)

This work presents a fully analog memristive synaptic circuit for online spike-timing-dependent plasticity (STDP) learning in spiking neural networks (SNNs). The proposed synapse integrates a local STDP circuit generating gradual timing-dependent conductance updates directly from pre- and post-synaptic spikes. Learning occurs during normal network operation without requiring external digital control or explicit STDP waveform synthesis. Post-layout simulations of the memristive synapse implemented in a 130 nm CMOS technology show spike-timing-dependent conductance adaptation during SNN operation. A 2x2 SNN simulation further illustrates online neuron specialization through unsupervised learning.
Read the full abstract

All authors Elia Mateu-Barriendos, Álvaro Gómez-Pau, Daniel Arumí, Rosa Rodríguez-Montañés, Salvador Manich

Emerging Technologies

System-Technology Co-Evaluation of A7 CFET and A10 NSFET Technologies from Cell Parasitics to Chip Reliability

Mahdi Benkhelifa, Leon Mayr, Hadi Nour Eddine et al. (+3 more)

Complementary FETs (CFETs) extend nanosheet FET (NSFET) scaling by vertically stacking n- and p-type gate-all-around (GAA) devices, thereby shrinking standard-cell area. The performance gain, however, cannot be assessed from device metrics alone, as CFET layouts also introduce larger cell-level parasitic resistance and capacitance (RC). In this work, we present a physics-based thermal- and aging-aware system-technology co-evaluation (STCO) flow to assess parasitic RCs in A7 CFET and A10 NSFET technology nodes. Our flow links calibrated device models, optimized standard-cell generation, automated GDS-to-TCAD conversion enabling accurate 3D parasitic RC extraction, full RTL-to-GDS implementation for an AI accelerator, multiphysics thermal analysis, and physics-based bias temperature instability (BTI) aging evaluation. Using the same device model for both technologies, we can isolate the impact of parasitic RCs and design at different levels of the design flow. The results of the AI accelerator design demonstrate that the A7 CFET reduces the chip area by 24.7% and the total wire length by 12%, improving the area efficiency TOPS/mm^2 by 74% relative to the baseline of the A10 NSFET. Under iso-frequency operation, results reveal that CFET voltage scaling reduces power by 68% and lowers power density from 148 W/cm^2 to 55 W/cm^2, which reduces the chip's temperature from 125 degrees C down to merely 62 degrees C. The resulting reduction in stress temperature suppresses 10-year BTI-induced degradation by 39%, reducing the required aging timing guardband by 53%.
Read the full abstract

All authors Mahdi Benkhelifa, Leon Mayr, Hadi Nour Eddine, Andrea Padovani, Luca Larcher, Hussam Amrouch

Sunday 13 September

Emerging Technologies · Cross-listed from cs.DC

TriCalRAG: A Three-Strategy, Retrieval-Augmented Benchmark for On-Premise LLM-Based Root Cause Analysis in AIOps

Rohit Patel, Susil Kumar Mohanty and Jeenal Chaudhary

Operational logs create a need for private, resource-efficient incident analysis, but aggregate detection scores can conceal severe prediction bias. We present TriCalRAG, a reproducible benchmark for log-anomaly detection with generated root-cause and remediation outputs across BGL, HDFS, Thunderbird, and OpenStack. The primary evaluation compares Qwen2.5-14B and Mistral-Small-22B, served through vLLM on one NVIDIA RTX PRO 6000 GPU (96 GB), under zero-shot, few-shot, and retrieval-augmented generation (RAG) prompting across three data-sampling seeds. We report F1, bootstrap confidence intervals, predicted-positive rates, throughput, and memory use, with DeepLog as a held-out classical baseline. Mistral-Small attains a higher macro-averaged F1 than Qwen2.5-14B (0.644 versus 0.560), whereas Qwen provides approximately twice the throughput. A separate log-probability evaluation compares raw decisions with Contextual Calibration (CC) and Batch Calibration (BC): neither correction consistently improves prediction-balance diagnostics across prompting strategies. Supplementary single-run comparisons extend evaluation to 4-bit Llama-3.1-70B via local Ollama and Claude Haiku 4.5 via Anthropic's cloud API; RAG improves F1 on all four datasets for both models. Claude's reported aggregate F1 increases from 0.566 to 0.695, while the estimated API cost rises from \$0.94 to \$2.15 per 1,000 incidents. Local deployment ablations show approximately 41-fold throughput scaling with batching and 20% lower latency with 4-bit quantization on the tested workload. These findings support retrieval as useful context for anomaly decisions, while the supplementary protocols, unvalidated explanation quality, and prediction-balance diagnostics limit broader claims about RCA accuracy and probabilistic calibration.
Read the full abstract

Saturday 12 September

Emerging Technologies · Cross-listed from cs.CR

Transparent Identity Verification Approach Using MPC and Efficient Credential Status Handling

Istiaque Ahmed, Shoji Kasahara, Kentaroh Toyoda et al. (+2 more)

A secure and privacy-preserving identity verification process is essential for digital ecosys- tems. Current eKYC frameworks that rely on Zero-Knowledge Proofs (ZKPs) face high computational cost, rigid circuit design, complex integration, and expensive on-chain verification. The W3C 2021 BitString- based credential status mechanism also suffers from inefficient updates and poor scalability in large- scale deployments. We propose a transparent and cost-effective identity verification framework based on Multi-Party Computation (MPC). It enables private off-chain code execution and produces runtime proofs anchored to a blockchain. The framework introduces a multidimensional bit-matrix model with efficient compression. Using ZSTD, the credential data is reduced to 76 bytes compared to 140 bytes with GZIP, cutting storage and bandwidth costs. The system also supports fine-grained status updates and Layer-2 blockchain anchoring for tamper-evident, low-cost verification. The system employs reusable verifiable presentations (VPs) with unique access tokens, enabling cost-free verification and stronger access control. Selective disclosure preserves user control and strengthens privacy. Finally, the system integrates SHA3 hashing and Falcon post-quantum signatures. This guarantees robustness against quantum attacks, transparency, and scalability. It is a future-proof solution for national-scale identity verification, as demonstrated by experimental findings and security studies that validate its robustness and applicability.
Read the full abstract

All authors Istiaque Ahmed, Shoji Kasahara, Kentaroh Toyoda, Tadashi Nakano, Thi Hong Tran

Friday 11 September

Emerging Technologies · Cross-listed from quant-ph

Practical Considerations for Processing Massive Classical Data via Quantum Oracle Sketching

Stefano Markidis

Classical-to-quantum I/O is a critical bottleneck for data-intensive quantum workloads. Quantum Oracle Sketching (QOS) has been proposed to address this problem. We identify its practical requirements, including the representation of data as a probability distribution over oracle addresses, the relation between sample count, approximation error, and update cost, and the coherence and runtime support required for online execution. To study QOS on current quantum computing devices, we develop an offline realization that compiles sample blocks into empirical phase oracles and evaluate it using DNA fingerprinting. The application converges with relatively few samples, while exact phase fusion combines repeated updates to the same address. However, the compiled circuits remain too deep for current quantum computing devices. Practical QOS therefore requires lower depth oracle synthesis and interactive quantum runtimes.
Read the full abstract

Emerging Technologies · Cross-listed from quant-ph

Handling Imperfections in Subcircuit Compilation for Linear Optical Quantum Computing

Tobias Forster, Yannick Stade, Andreas Fyrillas et al. (+3 more)

Linear Optical Quantum Computing (LOQC) is emerging as a promising technology in large-scale quantum computing. Corresponding devices, including linear optical circuits, are rapidly growing in size and fabrication precision. However, even with improved quality, the circuits still exhibit imperfections leading to photon loss or phase noise that vary across the circuit. Already small deficiencies can have a vast impact on both accuracy and efficiency. For computations that do not require the entire linear optical circuit, so-called subcircuits, one can choose where to perform the computation, opening optimization opportunities that are addressed by subcircuit compilation. Current compilers spread the subcircuit's computation across the entire circuit, connecting the same input and output ports, thereby failing to fully exploit the optimization opportunities. However, given the subcircuit's reduced size compared to the entire circuit, one can keep its implementation localized and intentionally route photons to connect good input and output ports. This, however, is a highly non-trivial task, as numerous options must be weighed against one another, and the quality of the solution is influenced by a wide range of hardware parameters. In particular, the reflectivities of imperfect beam splitters can lead to photon losses during routing, which must be traded off against losses at the input and output ports due to imperfect transmission rates. Since current compilers do not account for these effects, we propose the first efficient subcircuit compilation method that optimizes for the coincidence rate, the probability of successfully measuring all desired photons, by handling hardware imperfections. Our evaluations demonstrate significant improvement over existing methods in robustness against phase noise and significantly increased coincidence rates across all benchmarks of up to plus 33.2%.
Read the full abstract

All authors Tobias Forster, Yannick Stade, Andreas Fyrillas, Jean Senellart, Lukas Burgholzer, Robert Wille

Emerging Technologies · Cross-listed from cs.IT

Error-Rate Reduction in LDPC Decoding via Bit-Aligned Temporal Reinforcement in Parallel Probabilistic-Bit Dynamics

Naoya Onizawa and Takahiro Hanyu

Probabilistic bits (p-bits) provide a physical and algorithmic primitive for stochastic inference, but highly parallel updates can alter their collective dynamics. We study the decoding of random-regular (3, 6) low-density parity-check (LDPC) codes using Jacobi-type p-bit annealing with stochastic partial activation. An additive response-path rule stores each bit's saturated response and reuses it before stochastic readout. High-statistics simulations with independent parameter optimization for each method show pooled bit-error-rate reductions of 33.5%, 74.8%, and 81.8% relative to memoryless probabilistic simulated annealing (pSA) for representative codes of block lengths 96, 192, and 288, respectively. Static gain, normalized averaging, response shuffling, and same-bit binary-state feedback with only its coefficient tuned under the same nonmemory parameters do not reproduce the full saturated-response benefit. Trajectory analysis links the improvement to acquisition of the channel-consistent valid-codeword basin and enhanced post-acquisition stability; the acquisition advantage persists from random and channel-hard-decision starts under the tested conditions. Across all 30 independent code realizations, fixed additive parameter-and-readout packages achieve lower bit- and frame-error rates than separately optimized pSA-specific packages, with neither package retuned for individual codes. These results show that the computational effect of temporal state depends on the retained quantity and its reinjection into stochastic dynamics.
Read the full abstract

Thursday 10 September

Emerging Technologies

Movable-Element STAR-RIS for Integrated Sensing and Communication: Architectures, Opportunities, and Practical Challenges

Wali Ullah Khan and Muhammad Adil

Simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) extend conventional reflecting-only surfaces by enabling controllable full-space propagation. Yet, once deployed, the physical locations of their elements remain fixed, leaving the surface geometry unable to adapt to users, sensing targets, blockage, or near-field focusing conditions. This article develops a system-level perspective on movable-element STAR-RIS (ME–STAR–RIS) for integrated sensing and communication (ISAC), where the surface jointly reconfigures its electromagnetic response and the physical positions of its elements. We explain how geometric reconfiguration can reshape the effective aperture, spatial correlation, interference nulls, and sensing illumination while preserving STAR-RIS full-space operation. A two-timescale control architecture separates relatively slow element motion from fast beamforming and transmission/reflection control. A 100-realization illustrative case study compares ME–STAR–RIS with an otherwise identical fixed STAR-RIS under a passive coupled transmission/reflection response. The results show a substantially improved sampled communication–sensing tradeoff and, importantly, a rapid saturation of the rate gain with modest element travel. We conclude with representative use cases, implementation constraints, and a research roadmap covering mobility overhead, channel acquisition, mutual coupling, near-field operation, hardware impairments, and learning-assisted predictive control.
Read the full abstract

Emerging Technologies

Feasibility and Memory Mechanisms of Chern-Simons Context Reservoir Computation

Jyotiranjan Beuria and Venkatesh H. Chembrolu

We investigate whether a Chern-Simons (CS) context reservoir is a viable computational substrate and whether evolving its gauge connection provides a benefit beyond simpler mechanisms. The reservoir state is a density fluctuation on a two-dimensional context manifold, whose drift is generated by a density-sourced connection. To separate generic reservoir behavior from gauge-specific effects, we compare four matched models: reciprocal transport, instantaneous transverse reconstruction, local nonlinear feedback, and fully coupled conserved-current CS dynamics. Across ten random seeds, the fully coupled CS dynamics propagates Gauss law to numerical precision, converges under spatial and temporal refinement, remains stable under constraint-compatible noise, and satisfies the spatial CS equation more accurately than the instantaneous controls. All four models exhibit fading scalar memory and distinguish matched pulse-order histories in density, with no resolved general advantage for coupled CS. The distinction appears in the flow geometry: coupled evolution supports circulating and longitudinal history channels simultaneously, retains them briefly after input removal, and yields a combined-feature pulse-order accuracy of \(0.879\pm0.035\), compared with \(0.679\pm0.065\) for the instantaneous-transverse control. The evolved connection also cannot be reconstructed from an instantaneous density snapshot or replaced by a fitted local multiplier. We therefore find a task-specific advantage for geometry- and order-sensitive processing, rather than generic reservoir superiority. Here “topological” refers to the gauge organization of the state; the reported memory and cyclic-lag measures are not topological invariants.
Read the full abstract

Emerging Technologies · Cross-listed from quant-ph

Benchmarking the computational power of quantum computers

Timothy Proctor, Oliver Hart, Oliver Widzowski Maupin et al. (+27 more)

Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs. Many teams are pursuing distinct and difficult-to-compare routes to this goal, using different qubit technologies and logical architectures. Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems and enable fair comparison across disparate platforms. Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them. We apply this quantum universal operation performance system (QUOPS) experimentally to leading processors from Quantinuum, Google, and IBM, computing directly on physical qubits. Translating state-of-the-art resource requirements for recognized challenge problems that represent useful quantum computation into effective QUOPS circuit sizes shows that computational capability must grow by 5 orders of magnitude, motivating fault-tolerant approaches. We use the same benchmark to assess the performance of a simple fault-tolerant logical-qubit processor implemented on up to eight [[7,1,3]]-encoded logical qubits using Quantinuum Helios-1, and project the growth of capability across successive generations of fault-tolerant quantum computers to show how QUOPS can track progress toward quantum scientific utility.
Read the full abstract

All authors Timothy Proctor, Oliver Hart, Oliver Widzowski Maupin, Matthew Girling, Daniel Hothem, Daniel Mills, Jordan Hines, Karl Mayer, Jacob S. Nelson, Tyler LeBlond, Zohim Chandani, Diego Forlivesi, Piper C. Wysocki, Boldizsár Poór, Joan M. Dreiling, Annie Park, Adam P. Reed, Brian Estey, Cameron Foltz, Akhil Isanaka, M. S. Allman, Michael Mills, Maxwell D. Urmey, Peter E. Siegfried, Audrey Faricy, Jin-Sung Kim, Cristina Cîrstoiu, Andrew D. Baczewski, Charles H. Baldwin, Robin Blume-Kohout

Emerging Technologies

A Time-Based Readout for Vector-Matrix Multiplication in Fully Analog Memristive SNNs

Elia Mateu-Barriendos, Álvaro Gómez-Pau, Josep Rius et al. (+3 more)

Artificial neural networks rely on vector-matrix multiplications (VMMs), whose implementation in von Neumann architectures is dominated by costly data movement between memory and processing units. Spiking neural networks (SNNs) mitigate this bottleneck by performing in-memory, analog VMMs using memristive crossbar arrays. However, conventional current-mode readout circuits incur significant area and power overhead. This work proposes a fully analog readout architecture based on voltage-to-time conversion of the VMM output. By sensing the column voltage, the proposed approach avoids current-mode summing and scaling circuitry, improving area and energy efficiency. Post-layout simulations of a 10x1 SNN implemented in a 130 nm CMOS technology validate the proposed architecture, while application to a trained 64x10 SNN for digit classification further demonstrates its feasibility for SNN inference.
Read the full abstract

All authors Elia Mateu-Barriendos, Álvaro Gómez-Pau, Josep Rius, Daniel Arumí, Rosa Rodríguez-Montañés, Salvador Manich