arXiv subjects

Andrew Huang

Publications and source records attributed to Andrew Huang.

11 recordsLinked to original sources

arXiv2026

A quantum oracle separation between QMA(2) and QMA

We find a quantum oracle relative to which $\mathsf{QMA} \neq \mathsf{QMA}(2)$. As a consequence, we resolve the no-disentanglers conjecture of Watrous: for every $\epsilon+\delta<1$, any $(\epsilon,\delta)$-disentangler requires input size exponential in the number of output qubits. Our proof combines the unitarily invariant polynomial method of She and Yuen (ITCS '23) with a new construction based on the symmetric and antisymmetric subspace projectors, reducing the $\mathsf{QMA}$ lower bound to the approximate degree of $\mathrm{OR}$.

quant-ph↗

arXiv2026

Variable-Path-Length FTIR of E. coli in Aqueous Media

Transmission infrared spectroscopy has been widely used for chemical analysis of biological samples in aqueous environments. However, its scope of applications has been limited by the path length, which is either too large or fixed, posing challenges for analyzing highly absorbing or heterogeneous samples. In this work, a mid-infrared (mid-IR) optical fiber probe was used for Fourier transform infrared (FTIR) micro-spectroscopy of aqueous Escherichia coli (E. coli) samples, providing continuous tuning of optical path length and sampling of near-surface and bulk regions. The mid-IR absorbance of the protein signal at 1548 cm-1 increased linearly with path length, consistent with the Beer-Lambert law. Path-length dependent spectra were used to calculate the spatially heterogeneous absorption coefficient of E. coli suspensions in aqueous media. The results demonstrate the ability of our fiber-based technique to resolve signals originating from different depths into the biological solution.

physics.ins-det↗

arXiv2026

Separating Quantum and Classical Advice with Good Codes

We show an unconditional classical oracle separation between the class of languages that can be verified using a quantum proof ($\mathsf{QMA}$) and the class of languages that can be verified with a classical proof ($\mathsf{QCMA}$). Compared to the recent work of Bostanci, Haferkamp, Nirkhe, and Zhandry (STOC 2026), our proof is conceptually and technically simpler, and readily extends to other oracle separations. In particular, our techniques yield the first unconditional classical oracle separation between the class of languages that can be decided with quantum advice ($\mathsf{BQP}/\mathsf{qpoly}$) and the class of languages that can be decided with classical advice ($\mathsf{BQP}/\mathsf{poly}$), improving on the quantum oracle separation of Aaronson and Kuperberg (CCC 2007) and the classically-accessible classical oracle separation of Li, Liu, Pelecanos and Yamakawa (ITCS 2024). Our oracles are based on the code intersection problem introduced by Yamakawa and Zhandry (FOCS 2022), combined with codes that have extremely good list-recovery properties.

quant-ph↗

arXiv2025

SAM 3: Segment Anything with Concepts

We present Segment Anything Model (SAM) 3, a unified model that detects, segments, and tracks objects in images and videos based on concept prompts, which we define as either short noun phrases (e.g., "yellow school bus"), image exemplars, or a combination of both. Promptable Concept Segmentation (PCS) takes such prompts and returns segmentation masks and unique identities for all matching object instances. To advance PCS, we build a scalable data engine that produces a high-quality dataset with 4M unique concept labels, including hard negatives, across images and videos. Our model consists of an image-level detector and a memory-based video tracker that share a single backbone. Recognition and localization are decoupled with a presence head, which boosts detection accuracy. SAM 3 doubles the accuracy of existing systems in both image and video PCS, and improves previous SAM capabilities on visual segmentation tasks. We open source SAM 3 along with our new Segment Anything with Concepts (SA-Co) benchmark for promptable concept segmentation.

cs.CV↗

arXiv2025

A Simple and Efficient One-Shot Signature Scheme

One-shot signatures (OSS) are a powerful and uniquely quantum cryptographic primitive which allows anyone, given common reference string, to come up with a public verification key $\mathsf{pk}$ and a secret signing state $|\mathsf{sk}\rangle$. With the secret signing state, one can produce the signature of any one message, but no more. In a recent breakthrough work, Shmueli and Zhandry (CRYPTO 2025) constructed one-shot signatures, either unconditionally in a classical oracle model or assuming post-quantum indistinguishability obfuscation and the hardness of Learning with Errors (LWE) in the plain model. In this work, we address the inefficiency of the Shmueli-Zhandry construction which signs messages bit-by-bit, resulting in signing keys of $\Theta(\lambda^4)$ qubits and signatures of size $\Theta(\lambda^3)$ bits for polynomially long messages, where $\lambda$ is the security parameter. We construct a new, simple, direct, and efficient one-shot signature scheme which can sign messages of any polynomial length using signing keys of $\Theta(\lambda^2)$ qubits and signatures of size $\Theta(\lambda^2)$ bits. We achieve corresponding savings in runtimes, in both the oracle model and the plain model. In addition, unlike the Shmueli-Zhandry construction, our scheme achieves perfect correctness. Our scheme also achieves strong signature incompressibility, which implies a public-key quantum fire scheme with perfect correctness among other applications, correcting an error in a recent work of \c{C}akan, Goyal and Shmueli (QCrypt 2025) and recovering their applications.

quant-ph↗

arXiv2025

Compiling Any $\mathsf{MIP}^{*}$ into a (Succinct) Classical Interactive Argument

We present a generic compiler that converts any $\mathsf{MIP}^{*}$ protocol into a succinct interactive argument where the communication and the verifier are classical, and where post-quantum soundness relies on the post-quantum sub-exponential hardness of the Learning with Errors ($\mathsf{LWE}$) problem. Prior to this work, such a compiler for $\mathsf{MIP}^{*}$ was given by Kalai, Lombardi, Vaikuntanathan and Yang (STOC 2022), but the post-quantum soundness of this compiler is still under investigation. More generally, our compiler can be applied to any $\mathsf{QIP}$ protocol which is sound only against semi-malicious provers that follow the prescribed protocol, but with possibly malicious initial state. Our compiler consists of two steps. We first show that if a language $\mathcal{L}$ has a $\mathsf{QIP}$ with semi-malicious soundness, where the prover runs in time $T$, then $\mathcal{L} \in \mathsf{QMATIME}(T)$. Then we construct a succinct classical argument for any such language, where the communication complexity grows polylogarithmically with $T$, under the post-quantum sub-exponential hardness of $\mathsf{LWE}$. Note: After this work was finished, an independent and concurrent work (Baroni et al. 2025) resolved the question of quantum soundness of the KLVY compiler.

quant-ph↗

arXiv2025

Parallel Repetition for Post-Quantum Arguments

In this work, we show that parallel repetition of public-coin interactive arguments reduces the soundness error at an exponential rate even in the post-quantum setting. Moreover, we generalize this result to hold for threshold verifiers, where the parallel repeated verifier accepts if and only if at least $t$ of the executions are accepted (for some threshold $t$). Prior to this work, these results were known only when the cheating prover was assumed to be classical. We also prove a similar result for three-message private-coin arguments. Previously, Bostanci, Qian, Spooner, and Yuen (STOC 2024) proved such a parallel repetition result in the more general setting of quantum protocols, where the verifier and communication may be quantum. We consider only protocols where the verifier is classical, but obtain a simplified analysis, and for the more general setting of threshold verifiers.

quant-ph↗

arXiv2021

Product Expansions of q-Character Polynomials

The ring of q-character polynomials is a q-analog of the classical ring of character polynomials for the symmetric groups. This ring consists of certain class functions defined simultaneously on the groups $Gl_n(F_q)$ for all n, which we also interpret as statistics on matrices. Here we evaluate these statistics on all matrices and work towards computing the structure constants of the product in this ring. We show that the statistics are periodically polynomial in q, and governed by universal polynomials $P_{λ,μ}(q)$ which we compute explicitly, indexed by pairs of integer partitions. The product structure is similarly polynomial in q in many cases, governed by polynomials $R_{λ,μ}^ν(q)$ indexed by triples of partitions, which we compute in some cases. Our calculations seem to exhibit several unexpected patterns. Mainly, we conjecture that certain indecomposable statistics generate the whole ring, and indeed prove this for statistics associated with matrices consisting of up to 2 Jordan blocks. Furthermore, the coefficients we compute exhibit surprising stability phenomena, which in turn reflect stabilizations of joint moments as well as multiplicities in the irreducible decomposition of tensor products of representations of $Gl_n(F_q)$ for $n\gg 1$. We use this stabilization to compute the correlation of the number of unipotent Jordan blocks of two sizes.

math.CO↗

arXiv2019

Human Vocal Sentiment Analysis

In this paper, we use several techniques with conventional vocal feature extraction (MFCC, STFT), along with deep-learning approaches such as CNN, and also context-level analysis, by providing the textual data, and combining different approaches for improved emotion-level classification. We explore models that have not been tested to gauge the difference in performance and accuracy. We apply hyperparameter sweeps and data augmentation to improve performance. Finally, we see if a real-time approach is feasible, and can be readily integrated into existing systems.

eess.AS↗

arXiv2017

Tensor-Based Backpropagation in Neural Networks with Non-Sequential Input

Neural networks have been able to achieve groundbreaking accuracy at tasks conventionally considered only doable by humans. Using stochastic gradient descent, optimization in many dimensions is made possible, albeit at a relatively high computational cost. By splitting training data into batches, networks can be distributed and trained vastly more efficiently and with minimal accuracy loss. We have explored the mathematics behind efficiently implementing tensor-based batch backpropagation algorithms. A common approach to batch training is iterating over batch items individually. Explicitly using tensor operations to backpropagate allows training to be performed non-linearly, increasing computational efficiency.

cs.LG↗

arXiv2017

A Novel Delay-time Enlarged 3-D Gravitational Wave Detection System

A novel delay-time enlarged 3-dimensional gravitational wave (GW) detection system is presented. The operation principle is described. The basic specification requirements for all the critical components are analyzed. The whole system consists of three optical fibers along three axes, a narrow linewidth ultra-stable laser, an ultra-stable radio frequency (RF) source, three recirculating optical fiber loops, three phase monitoring/stabilizing units, three phase detectors, and a computer based data analysis unit. With the given specifications of the critical components, the whole system may achieve 10-22 phase sensitivity, and therefore can be used for the GW detection. This is the first time, to the best of our knowledge, one has implemented an optical fiber as the delay-time enlarged transmission medium for a self-delayed interferometer and the first 3-dimensional self-delayed interferometer. Since optical fiber is used as the transmission medium and the recirculating optical fiber loop for increasing the phase sensitivity, the whole system can be built both compactly and cost efficiently, allowing a 3-dimensional self-delayed interferometer for GW detection to be created.

astro-ph.IM↗