Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.00763

Reading While Writing: Baseline Information Requirements for Molecular Neural Interfaces

Hongbin Ni·Ozgur B. Akan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Molecular neural interfaces that deliver and sense the same neurotransmitter must estimate endogenous release in the presence of their own chemical input. We study two exchanging regions with shared saturable uptake and concentration change measurements. Known delivery and exchange permit identification of apparent uptake at the driven region, but an unknown resting concentration difference leaves the source region's incremental uptake uncertain. We characterize all admissible source histories consistent with both ideal records and show how delivery and baseline information affect release classification. A dopamine-inspired example produces identical ideal concentration-change records for mean release-rate changes of -8.99 and +1.31 nanomolar per second. Stronger delivery changes whether all compatible sources imply suppression, with the true source held fixed. Under a Gaussian observation model, we bound discrimination based on chemical fluctuations. A baseline reference with an assumed standard deviation of 3.3 nanomolar reduces root-mean-square error from 10.41 to 1.21 nanomolar per second compared with an incorrect fixed baseline under exact gain calibration. Classification errors remain substantial with weak excitation, gain errors or responses near the category boundaries.

Explore related subjects

cs.ETcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hongbin Ni, Ozgur B. Akan. 2026-09-30. Reading While Writing: Baseline Information Requirements for Molecular Neural Interfaces. https://arxiv.org/abs/2610.00763

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Standard Quadratic Formulations of Many NP Problems: A Simplex-Based Compilation Framework for Combinatorial Optimization

The standard quadratic program (StQP) minimizes a quadratic form over nonnegative variables that sum to one. We compose classical graph reductions with regularized Motzkin--Straus clique formulations to express discrete optimization problems in this continuous domain. The graph matrix has diagonal entries $τ$, zeros on edges, and ones on nonedges. For $0<τ<1$, its minimum is $τ/ω(G)$, where $ω(G)$ is the clique number. Its strict local minimizers are precisely the uniform distributions on maximal cliques, and its global minimizers encode maximum cliques. At $τ=1/2$, integer scaling gives coefficients in $\{0,1,2\}$ and minimum $1/ω(G)$, yielding an NP-complete StQP threshold problem with a restricted coefficient alphabet. We give explicit formulations for satisfiability, coloring, Hamiltonian cycles, independent set, vertex cover, set packing, three-dimensional matching, and graph isomorphism. A regularized weighted clique formulation combined with local-state compatibility graphs gives an exact compiler for finite-domain factor models specified by complete local tables, including QUBO, with at most four simplex coordinates per binary pair factor. The catalog covers Karp's 21 problems: twelve use direct graph formulations, and nine use factor-state formulations, including six obtained through binary-linear feasibility. For each route we record dimensions, coefficient structure, and recovery rules. We analyze interaction count, coefficient range, objective separation, perturbation tolerance, support recovery, and decoding overhead. The separation bounds quantify the effects of clique size, factor weights, and offsets. In the complete factor-state construction, every assignment, including each suboptimal assignment, is a strict local minimum.

cs.ET↗
arXiv2026

Improving Feasibility in Quantum Approximate Optimization Algorithm for Vehicle Routing via Constraint-Aware Initialization and Hybrid XY-X Mixing

The Quantum Approximate Optimization Algorithm (QAOA) is a leading framework for quantum combinatorial optimization. The Vehicle Routing Problem (VRP), a core problem in logistics and transportation, is a natural application target, but it poses a major feasibility challenge for standard QAOA because feasible solutions occupy only a tiny fraction of the search space, and the conventional Pauli-$X$ mixer can disrupt partial solution structures that satisfy key local constraints. To address this issue, we propose a constraint-aware QAOA framework with two complementary components. First, we design a lightweight initialization strategy that encodes a selected subset of simple yet informative local one-hot constraints into the initial state, thereby reducing the initial superposition space and increasing the probability mass on states with important local structure. Second, we introduce a hybrid XY-$X$ mixer that preserves the constraint structure imposed at initialization while retaining exploratory flexibility over the remaining unconstrained degrees of freedom during QAOA evolution. We evaluate the proposed framework against standard QAOA under three progressively more realistic regimes: ideal statevector simulation, finite-shot sampling, and noisy finite-shot sampling. Across all regimes, the proposed method consistently achieves lower average energy and higher feasible-solution ratios than standard QAOA, indicating more effective guidance toward structurally valid, lower-cost VRP solutions. However, the performance gap narrows in the noisy regime. Because this setting adopts a hardware-inspired error model based on near-best-reported laboratory-level qubit gate and readout fidelities, the observed attenuation suggests that the practical advantage of the more structured mixer is likely to grow as quantum hardware improves and error rates decline.

cs.ET↗
arXiv2026

Whole-Blood Boundary Analysis of BioFET-Based ctDNA Detection for Intravascular Sensing in Intrabody Nanonetworks

Liquid biopsy can detect tumor-derived biomarkers such as circulating tumor DNA (ctDNA), but ultra-low-fraction assays remain costly, slow, and difficult to scale. This motivates interest in intravascular in vivo sensing in the context of intrabody nanonetworks, where nanosensors could support local biomarker monitoring. BioFET-based nanosensors are relevant here because they are label-free, highly miniaturizable, and have shown strong ctDNA sensitivity in controlled media. We examine whether this sensitivity still yields reliable ctDNA detection in whole blood using a reduced-order stochastic simulation model that links operating-point selection, Debye-screened charge transduction, stochastic finite-capacity binding, nonspecific adsorption, background fluctuations, and intrinsic electronic noise to blank-threshold detection. Monte Carlo evaluation with physiologically grounded parameters shows that short Debye length and several-nanometer charge-to-channel separation attenuate the current shift, while low-frequency noise and background fluctuations reduce the margin between target-present and blank responses. Under the tested quasi-static charge-gating regime, the simulated current shifts do not reliably exceed the blank-derived threshold at low ctDNA concentrations. The model therefore provides a whole-blood boundary analysis that identifies which interface configurations and operating conditions most strongly limit reliable BioFET-based intravascular ctDNA detection.

cs.ET↗