YouTube video by Wajahat Ali

YouTube video by Wajahat Ali

YouTube video by Wajahat Ali

YouTube video by Wajahat Ali

YouTube video by Wajahat Ali

YouTube video by Wajahat Ali

YouTube video by Revolution Now!

AbstractIsothiocyanates (ITCs) are bioactive hydrolysis products of glucosinolates in Brassicaceae plants with diverse health-promoting properties. However, comprehensive profiling of ITCs remains challenging due to the limited availability of authentic standards, the underexplored structural diversity of naturally occurring ITCs, and poor mass spectrometry (MS) detection sensitivity. Here, we established a N,N-dimethylethylenediamine (DMEDA) derivatization strategy and constructed an in silico MS/MS library for systematic ITC annotation. DMEDA derivatization markedly improved LC–MS detection sensitivity, enabling the reliable detection of low-abundance ITCs with limits of detection at the nanomolar level. Detailed characterization of the MS/MS fragmentation behaviors of derivatized ITC standards revealed subclass-dependent fragmentation patterns, which were subsequently translated into spectral prediction rules for the generation of an in silico mass spectral library with 2209 simulated ITC structures. Application of the developed workflow to Brassicaceae plant samples enabled the annotation of 50 endogenous ITCs, including 4 low-abundance compounds that were previously not reported. Our work provides a valuable resource for the systematic exploration of ITC structural diversity and facilitates functional studies of glucosinolate-derived bioactive metabolites.

We study interactive proofs when the prover and the verifier access the same underlying data through independent noisy views. The noise is \emph{persistent} for each party: each location is corrupted once, and repeated queries to the same location return the same corrupted value. We introduce two models in this setting: \emph{noisy interactive proofs of proximity} (noisy IPPs), and \emph{noisy PAC verification}, a noisy analogue of the PAC verification framework of Goldwasser et al.\ [ITCS 2021]. These are the first interactive-proof models in which the prover and verifier access the same data through separate noisy views, possibly with different noise rates, rather than sharing a common view of the input. For noisy IPPs, we give a complete characterization of the four natural regimes determined by whether the honest prover is clean or noisy and whether the exact noise rates are known or only upper bounds are known. We show that the clean-prover, known-rate setting admits noisy IPPs for every language in $NC$, whereas, under a standard cryptographic assumption, in each of the other three regimes there is a language in $NC^1$ for which noisy IPPs are impossible. The positive result is obtained through a connection to \emph{robust} IPPs: even subconstant robustness suffices to tolerate constant random noise. We also show that constant robustness is impossible in general, establishing a separation between random noise and worst-case local corruptions. Beyond these general results, we construct noisy IPPs for natural languages, and we give a noisy PAC-verification protocol for the heavy Fourier coefficients of a Boolean function. These positive results are efficient for both the verifier and the prover, and hold in the general setting where the parties know only an upper bound on the noise rate and may experience different noise rates.

**Authors:** William Gay, Fernando Granha Jeronimo, Lenny Liu, Itai Leigh, Pei Wu, Haochen Xu Pure-state consistency problems naturally lead to quantum proof systems in which a single pure witness must satisfy many acceptance constraints. The corresponding class $\mathsf{PureSuperQMA}$ was previously known to lie between $\mathsf{QMA}$ and $\mathsf{QMA}(2)$, and Kamminga and Rudolph (ITCS'26) conjectured that both containments are strict. In this paper, we prove the following surprising complexity collapses $$ \mathsf{QMA} = \mathsf{PureSuperQMA} = \mathsf{PureSuperQMA}(\text{exp}) = \mathsf{BellPureSymQMA}(\text{poly}) $$ Here $\mathsf{PureSuperQMA}(\text{exp})$ allows exponentially many checks which are uniformly indexed and efficiently generated, while requiring an inverse-polynomial violation margin and an inverse-polynomial fraction of violated checks for the NO cases. $\mathsf{BellPureSymQMA}(\text{poly})$ is a related model that requires the prover to give the verifier polynomially many copies of a pure state, which the verifier measures separately with logarithmic output length for each local measurement, before processing the outcomes jointly. The main technical ingredient is a dimension-free stability bound for symmetric tensor states. Our simulations use polynomially many witness registers and combine a random-pair SWAP test with a permutation-invariant lift of the original verification procedure. The key step is to show that, on the symmetric subspace, the extremal verification value is close to that of some tensor-power witness with dimension-independent error. Applying this argument to the two verification models yields both simulations. As a consequence, exact $k$-local pure-state consistency is $\mathsf{QMA}$-complete for every fixed $k\ge2$, and so are the corresponding exact bosonic and fermionic pure $N$-representability problems.