Search

In the presence of system-environment coupling, classical complex systems undergo stochastic dynamics, where rich phenomena can emerge at large spatio-temporal scales. To investigate these phenomena, numerical approaches for simulating stochastic dynamics are indispensable and can be computationally expensive. In light of the recent fast development in machine learning techniques, here, we establish a generic machine learning approach to simulate the stochastic dynamics, dubbed the noise-aware neural network (NANN). One key feature of this approach is its ability to generate the long-time stochastic dynamics of complex large-scale systems by just training NANN with the one-step dynamics of smaller-scale systems, thus reducing the computational cost. Furthermore, this NANN based approach is quite generic. Case-by-case special design of the architecture of NANN is not necessary when it is employed to investigate different stochastic complex systems. Using the noisy Kuramoto model and the Vicsek model as concrete examples, we demonstrate its capability in simulating stochastic dynamics. We believe that this novel machine learning approach can be a useful tool in investigating the large spatio-temporal scaling behavior of complex systems subjected to the influences of the environmental noise., Comment: 7 pages, 3 figures

In this paper, we study the rigidity problem for compact minimal Legendrian submanifolds in the unit Euclidean spheres via eigenvalues of fundamental matrices, which measure the squared norms of the second fundamental form on all normal directions. By using Lu's inequality on the upper bound of the squared norm of Lie brackets of symmetric matrices, we establish an optimal pinching theorem for such submanifolds of all dimensions, giving a new characterization for the Calabi tori. This pinching condition can also be described by the eigenvalues of the Ricci curvature tensor. Moreover, when the third large eigenvalue of the fundamental matrix vanishes everywhere, we get an optimal rigidity theorem under a weaker pinching condition., Comment: 19 pages

Quantum entanglement is a fundamental property of quantum mechanics and plays a crucial role in quantum computation and information. We study entanglement via the lens of computational complexity by considering quantum generalizations of the class NP with multiple unentangled quantum proofs, the so-called QMA(2) and its variants. The complexity of QMA(2) is a longstanding open problem, and only the trivial bounds QMA $\subseteq$ QMA(2) $\subseteq$ NEXP are known. In this work, we study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $\text{QMA}^+(2)$. In this setting, we are able to design proof verification protocols for problems both using logarithmic size quantum proofs and having a constant probability gap in distinguishing yes from no instances. In particular, we design global protocols for small set expansion, unique games, and PCP verification. As a consequence, we obtain NP $\subseteq \text{QMA}^+_{\log}(2)$ with a constant gap. By virtue of the new constant gap, we are able to ``scale up'' this result to $\text{QMA}^+(2)$, obtaining the full characterization $\text{QMA}^+(2)$=NEXP by establishing stronger explicitness properties of the PCP for NEXP. One key novelty of these protocols is the manipulation of quantum proofs in a global and coherent way yielding constant gaps. Previous protocols (only available for general amplitudes) are either local having vanishingly small gaps or treat the quantum proofs as classical probability distributions requiring polynomially many proofs thereby not implying non-trivial bounds on QMA(2). Finally, we show that QMA(2) is equal to $\text{QMA}^+(2)$ provided the gap of the latter is a sufficiently large constant. In particular, if $\text{QMA}^+(2)$ admits gap amplification, then QMA(2)=NEXP., Comment: 64 pages

Quantum entanglement is a key enabling ingredient in diverse applications. However, the presence of unwanted adversarial entanglement also poses challenges in many applications. In this paper, we explore methods to "break" quantum entanglement. Specifically, we construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show: For every $d,\ell\ge k$, there is an efficient channel $\Lambda: \mathbb{C}^{d\ell} \otimes \mathbb{C}^{d\ell} \to \mathbb{C}^{dk}$ such that for every bipartite separable state $\rho_1\otimes \rho_2$, the output $\Lambda(\rho_1\otimes\rho_2)$ is close to a k-partite separable state. Concretely, for some distribution $\mu$ on states from $\mathbb{C}^d$, $$ \left\|\Lambda(\rho_1 \otimes \rho_2) - \int | \psi \rangle \langle \psi |^{\otimes k} d\mu(\psi)\right\|_1 \le \tilde O \left(\left(\frac{k^{3}}{\ell}\right)^{1/4}\right). $$ Moreover, $\Lambda(| \psi \rangle \langle \psi |^{\otimes \ell}\otimes | \psi \rangle \langle \psi |^{\otimes \ell}) = | \psi \rangle \langle \psi |^{\otimes k}$. Without the bipartite unentanglement assumption, the above bound is conjectured to be impossible. Leveraging our disentanglers, we show that unentangled quantum proofs of almost general real amplitudes capture NEXP, greatly relaxing the nonnegative amplitudes assumption in the recent work of QMA^+(2)=NEXP. Specifically, our findings show that to capture NEXP, it suffices to have unentangled proofs of the form $| \psi \rangle = \sqrt{a} | \psi_+ \rangle + \sqrt{1-a} | \psi_- \rangle$ where $| \psi_+ \rangle$ has non-negative amplitudes, $| \psi_- \rangle$ only has negative amplitudes and $| a-(1-a) | \ge 1/poly(n)$ with $a \in [0,1]$. Additionally, we present a protocol achieving an almost largest possible gap before obtaining QMA^R(k)=NEXP$, namely, a 1/poly(n) additive improvement to the gap results in this equality., Comment: 28 pages

In this paper, we fix the complex structure and explore the moduli space of the heterotic system by considering two different yet "dual" deformation paths starting from a K\"ahler solution. They correspond to deformation along the Bott-Chern cohomology class and the Aeppli cohomology class respectively. Using the implicit function theorem, we prove the local existence of heterotic solutions along these two paths and hence establish an initial step to construct local moduli coordinates around a K\"ahler solution., Comment: 35 pages

Pseudorandom states (PRS) are an important primitive in quantum cryptography. In this paper, we show that subset states can be used to construct PRSs. A subset state with respect to $S$, a subset of the computational basis, is \[ \frac{1}{\sqrt{|S|}}\sum_{i\in S} |i\rangle. \] As a technical centerpiece, we show that for any fixed subset size $|S|=s$ such that $s = 2^n/\omega(\mathrm{poly}(n))$ and $s=\omega(\mathrm{poly}(n))$, where $n$ is the number of qubits, a random subset state is information-theoretically indistinguishable from a Haar random state even provided with polynomially many copies. This range of parameter is tight. Our work resolves a conjecture by Ji, Liu and Song. Since subset states of small size have small entanglement across all cuts, this construction also illustrates a pseudoentanglement phenomenon., Comment: 9 pages; add a minimum background on pseudoentanglement

Spectrum sensing in cognitive radio necessitates effective monitoring of wide bandwidths, which requires high-rate sampling. Traditional spectrum sensing methods employing high-precision analog-to-digital converters (ADCs) result in increased power consumption and expensive hardware costs. In this paper, we explore blind spectrum sensing utilizing one-bit ADCs. We derive a closed-form detector based on Rao's test and demonstrate its equivalence with the second-order eigenvalue-moment-ratio test. Furthermore, a near-exact distribution based on the moment-based method, and an approximate distribution in the low signal-to-noise ratio (SNR) regime with the use of the central limit theorem, are obtained. Theoretical analysis is then performed and our results show that the performance loss of the proposed detector is approximately $2$ dB ($\pi/2$) compared to detectors employing $\infty$-bit ADCs when SNR is low. This loss can be compensated for by using approximately $2.47$ ($\pi^2/4$) times more samples. In addition, we unveil that the efficiency of incoherent accumulation in one-bit detection is the square root of that of coherent accumulation. Simulation results corroborate the correctness of our theoretical calculations.

Modern reinforcement learning (RL) often faces an enormous state-action space. Existing analytical results are typically for settings with a small number of state-actions, or simple models such as linearly modeled Q-functions. To derive statistically efficient RL policies handling large state-action spaces, with more general Q-functions, some recent works have considered nonlinear function approximation using kernel ridge regression. In this work, we derive sample complexities for kernel based Q-learning when a generative model exists. We propose a nonparametric Q-learning algorithm which finds an $\epsilon$-optimal policy in an arbitrarily large scale discounted MDP. The sample complexity of the proposed algorithm is order optimal with respect to $\epsilon$ and the complexity of the kernel (in terms of its information gain). To the best of our knowledge, this is the first result showing a finite sample complexity under such a general model.

Non-relativistic quantum chromodynamics (NRQCD) factorization formulism is an important approach to investigate the production of the heavy quarkonium. In this paper, we study the production of the $\Omega_{ccc}$ and $\Omega_{bbb}$ at the $e^+e^-$ collider, using the NRQCD factorization formulism. We calculate the total and differential cross sections exactly of the processes, $e^+e^-\rightarrow \gamma^*/Z^*\rightarrow \Omega_{ccc}\bar{c}\bar{c}\bar{c}$ and $e^+e^-\rightarrow \gamma^*/Z^*\rightarrow \Omega_{bbb}\bar{b}\bar{b}\bar{b}$, in the leading order at the $e^+e^-$ colliders with different energies. The results show that it is hard to observe them at the $e^+e^-$ collider directly.

Deep space explorations require transferring huge amounts of data quickly from very distant targets. Laser communication is a promising technology that can offer a data rate of magnitude faster than conventional microwave communication due to the fundamentally narrow divergence of light. This study demonstrated a photon-sensitive receiver prototype with over Gigabit data rate, immunity to strong background photon noise, and simultaneous tracking ability. The advantages are inherited from a joint-optimized superconducting nanowire single-photon detector (SNSPD) array, designed into a four-quadrant structure with each quadrant capable of resolving six photons. Installed in a free-space coupled and low-vibration cryostat, the system detection efficiency reached 72.7%, the detector efficiency was 97.5%, and the total photon counting rate was 1.6 Gcps. Additionally, communication performance was tested for pulse position modulation (PPM) format. A series of signal processing methods were introduced to maximize the performance of the forward error correction (FEC) code. Consequently, the receiver exhibits a faster data rate and better sensitivity by about twofold (1.76 photons/bit at 800 Mbps and 3.40 photons/bit at 1.2 Gbps) compared to previously reported results (3.18 photon/bit at 622 Mbps for the Lunar Laser Communication Demonstration). Furthermore, communications in strong background noise and with simultaneous tracking ability were demonstrated aimed at the challenges of daylight operation and accurate tracking of dim beacon light in deep space scenarios.

Inference on the minimum clinically important difference, or MCID, is an important practical problem in medicine. The basic idea is that a treatment being statistically significant may not lead to an improvement in the patients' well-being. The MCID is defined as a threshold such that, if a diagnostic measure exceeds this threshold, then the patients are more likely to notice an improvement. Typical formulations use an underspecified model, which makes a genuine Bayesian solution out of reach. Here, for a challenging personalized MCID problem, where the practically-significant threshold depends on patients' profiles, we develop a novel generalized posterior distribution, based on a working binary quantile regression model, that can be used for estimation and inference. The advantage of this formulation is two-fold: we can theoretically control the bias of the misspecified model and it has a latent variable representation which we can leverage for efficient Gibbs sampling. To ensure that the generalized Bayes inferences achieve a level of frequentist reliability, we propose a variation on the so-called generalized posterior calibration algorithm to suitably tune the spread of our proposed posterior., Comment: Feedback welcome at https://researchers.one/articles/22.08.00008

We study the probability of Boolean functions with small max influence to become constant under random restrictions. Let $f$ be a Boolean function such that the variance of $f$ is $\Omega(1)$ and all its individual influences are bounded by $\tau$. We show that when restricting all but a $\rho=\tilde{\Omega}((\log(1/\tau))^{-1})$ fraction of the coordinates, the restricted function remains nonconstant with overwhelming probability. This bound is essentially optimal, as witnessed by the tribes function $\mathrm{TRIBES}=\mathrm{AND}_{n/C\log n}\circ\mathrm{OR}_{C\log n}$. We extend it to an anti-concentration result, showing that the restricted function has nontrivial variance with probability $1-o(1)$. This gives a sharp version of the "it ain't over till it's over" theorem due to Mossel, O'Donnell, and Oleszkiewicz. Our proof is discrete, and avoids the use of the invariance principle. We also show two consequences of our above result: (i) As a corollary, we prove that for a uniformly random input $x$, the block sensitivity of $f$ at $x$ is $\tilde{\Omega}(\log(1/\tau))$ with probability $1-o(1)$. This should be compared with the implication of Kahn, Kalai, and Linial's result, which implies that the average block sensitivity of $f$ is $\Omega(\log(1/\tau))$. (ii) Combining our proof with a well-known result due to O'Donnell, Saks, Schramm, and Servedio, one can also conclude that: Restricting all but a $\rho=\tilde\Omega(1/\sqrt{\log (1/\tau) })$ fraction of the coordinates of a monotone function $f$, then the restricted function has decision tree complexity $\Omega(\tau^{-\Theta(\rho)})$ with probability $\Omega(1)$., Comment: 31 pages

We investigate the steady-state and dynamical properties of a reciprocal many-body system consisting of self-propelled active particles with local alignment interactions that exists within a fan-shaped neighborhood of each particle. We find that the nonreciprocity can emerge in this reciprocal system once the spontaneous symmetry breaking is present, and the effective description of the system assumes a non-Hermitian structure that directly originates from the emergent nonreciprocity. This emergent nonreciprocity can impose strong influences on the properties the system. In particular, it can even drive a real-space condensation of active particles. Our findings pave the way for identifying a new class of physics in reciprocal systems that is driven by the emergent nonreciprocity., Comment: 6+1 pages, 3+1 figures

Energy carrier evolution is crucial for material performance. Ultrafast microscopy has been widely applied to visualize the spatiotemporal evolution of energy carriers. However, direct imaging of small amounts of energy carriers on nanoscale remains difficult due to extremely weak transient signals. Here we present a method for ultrasensitive and high-throughput imaging of energy carrier evolution in space and time. This method combines femtosecond pump-probe techniques with interferometric scattering microscopy (iSCAT), named Femto-iSCAT. The interferometric principle and unique spatially-modulated contrast enhancement increase the transient image contrast by >2 orders of magnitude and enable the exploration of new science. We address three important and challenging problems: transport of different energy carriers at various interfaces, heterogeneous hot electron distribution and relaxation in single plasmonic resonators, and distinct structure-dependent edge state dynamics of carriers and excitons in optoelectronic semiconductors. Femto-iSCAT holds great potential as a universal tool for ultrasensitive imaging of energy carrier evolution in space and time.