skip to main content


Title: Sharp complexity asymptotics and topological trivialization for the ( p , k ) spiked tensor model
Using precise random matrix theory tools and the Kac–Rice formula, we provide sharp O(1) asymptotics for the average number of deep minima of the ( p, k) spiked tensor model. These sharp estimates allow us to prove that, when the signal-to-noise ratio is large enough, the expected number of deep minima is asymptotically finite as N tends to infinity and to establish the occurrence of topological trivialization by showing that this number vanishes when the strength of the signal-to-noise ratio diverges. We also derive an explicit formula for the value of the absolute minimum (the limiting ground state energy) on the N-dimensional sphere, similar to the recent work of Jagannath, Lopatto, and Miolane [Ann. Appl. Probab. 4, 1910–1933 (2020)].  more » « less
Award ID(s):
1653552
NSF-PAR ID:
10401348
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Journal of Mathematical Physics
Volume:
63
Issue:
4
ISSN:
0022-2488
Page Range / eLocation ID:
043303
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Deep neural networks have been shown to be effective adaptive beamformers for ultrasound imaging. However, when training with traditional L p norm loss functions, model selection is difficult because lower loss values are not always associated with higher image quality. This ultimately limits the maximum achievable image quality with this approach and raises concerns about the optimization objective. In an effort to align the optimization objective with the image quality metrics of interest, we implemented a novel ultrasound-specific loss function based on the spatial lag-one coherence and signal-to-noise ratio of the delayed channel data in the short-time Fourier domain. We employed the R-Adam optimizer with look ahead and cyclical learning rate to make the training more robust to initialization and local minima, leading to better model performance and more reliable convergence. With our custom loss function and optimization scheme, we achieved higher contrast-to-noise-ratio, higher speckle signal-to-noise-ratio, and more accurate contrast ratio reconstruction than with previous deep learning and delay-and-sum beamforming approaches. 
    more » « less
  2. Abstract

    We study the distribution over measurement outcomes of noisy random quantum circuits in the regime of low fidelity, which corresponds to the setting where the computation experiences at least one gate-level error with probability close to one. We model noise by adding a pair of weak, unital, single-qubit noise channels after each two-qubit gate, and we show that for typical random circuit instances, correlations between the noisy output distribution$$p_{\text {noisy}}$$pnoisyand the corresponding noiseless output distribution$$p_{\text {ideal}}$$pidealshrink exponentially with the expected number of gate-level errors. Specifically, the linear cross-entropy benchmarkFthat measures this correlation behaves as$$F=\text {exp}(-2s\epsilon \pm O(s\epsilon ^2))$$F=exp(-2sϵ±O(sϵ2)), where$$\epsilon $$ϵis the probability of error per circuit location andsis the number of two-qubit gates. Furthermore, if the noise is incoherent—for example, depolarizing or dephasing noise—the total variation distance between the noisy output distribution$$p_{\text {noisy}}$$pnoisyand the uniform distribution$$p_{\text {unif}}$$punifdecays at precisely the same rate. Consequently, the noisy output distribution can be approximated as$$p_{\text {noisy}}\approx Fp_{\text {ideal}}+ (1-F)p_{\text {unif}}$$pnoisyFpideal+(1-F)punif. In other words, although at least one local error occurs with probability$$1-F$$1-F, the errors are scrambled by the random quantum circuit and can be treated as global white noise, contributing completely uniform output. Importantly, we upper bound the average total variation error in this approximation by$$O(F\epsilon \sqrt{s})$$O(Fϵs). Thus, the “white-noise approximation” is meaningful when$$\epsilon \sqrt{s} \ll 1$$ϵs1, a quadratically weaker condition than the$$\epsilon s\ll 1$$ϵs1requirement to maintain high fidelity. The bound applies if the circuit size satisfies$$s \ge \Omega (n\log (n))$$sΩ(nlog(n)), which corresponds to onlylogarithmic depthcircuits, and if, additionally, the inverse error rate satisfies$$\epsilon ^{-1} \ge {\tilde{\Omega }}(n)$$ϵ-1Ω~(n), which is needed to ensure errors are scrambled faster thanFdecays. The white-noise approximation is useful for salvaging the signal from a noisy quantum computation; for example, it was an underlying assumption in complexity-theoretic arguments that noisy random quantum circuits cannot be efficiently sampled classically, even when the fidelity is low. Our method is based on a map from second-moment quantities in random quantum circuits to expectation values of certain stochastic processes for which we compute upper and lower bounds.

     
    more » « less
  3. Efficient resource allocation and management can enhance the capacity of an optical backbone network. In this context, spectrum retuning via hitless defragmentation has been presented for elastic optical networks to enhance efficient spectrum accommodation while reducing the unused fragmented spaces in the spectrum. However, the quality of service committed in a service level agreement may be affected due to spectrum retuning. In particular, for transmission beyond the conventional C band, the presence of inter-channel stimulated Raman scattering can severely degrade the quality of the signal during defragmentation. To conquer this problem, this paper proposes, for the first time to our knowledge, a signal-quality-aware proactive defragmentation scheme for theC+Lband system. The proposed scheme prioritizes the minimization of the fragmentation index and quality of transmission (QoT) maintenance for two different defragmentation algorithms, namely, nonlinear-impairment (NLI)-aware defragmentation (NAD) and NLI-unaware defragmentation (NUD). We leverage machine learning techniques for QoT estimation of ongoing lightpaths during spectrum retuning. The optical signal-to-noise ratio of a lightpath is predicted for each choice of spectrum retuning, which helps to monitor the effect of defragmentation on the quality of ongoing lightpaths (in terms of assigned modulation format). Numerical results show that, compared to a baseline algorithm (NUD), the proposed NAD algorithm provides up to 15% capacity increment for smaller networks such as BT-UK, while for larger networks such as the 24-node USA network, a capacity benefit of 23% is achieved in terms of the number of served demands at 1% blocking.

     
    more » « less
  4. Abstract

    We study Langevin dynamics for recovering the planted signal in the spiked matrix model. We provide a ‘path-wise’ characterization of the overlap between the output of the Langevin algorithm and the planted signal. This overlap is characterized in terms of a self-consistent system of integro-differential equations, usually referred to as the Crisanti–Horner–Sommers–Cugliandolo–Kurchan equations in the spin glass literature. As a second contribution, we derive an explicit formula for the limiting overlap in terms of the signal-to-noise ratio and the injected noise in the diffusion. This uncovers a sharp phase transition—in one regime, the limiting overlap is strictly positive, while in the other, the injected noise overcomes the signal, and the limiting overlap is zero.

     
    more » « less
  5. With increasing needs of fast and reliable commu- nication between devices, wireless communication techniques are rapidly evolving to meet such needs. Multiple input and output (MIMO) systems are one of the key techniques that utilize multiple antennas for high-throughput and reliable communication. However, increasing the number of antennas in communication also adds to the complexity of channel esti- mation, which is essential to accurately decode the transmitted data. Therefore, development of accurate and efficient channel estimation methods is necessary. We report the performance of machine learning-based channel estimation approaches to enhance channel estimation performance in high-noise envi- ronments. More specifically, bit error rate (BER) performance of 2 × 2 and 4 × 4 MIMO communication systems with space- time block coding model (STBC) and two neural network-based channel estimation algorithms is analyzed. Most significantly, the results demonstrate that a generalized regression neural network (GRNN) model matches BER results of a known-channel communication for 4 × 4 MIMO with 8-bit pilots, when trained in a specific signal to noise ratio (SNR) regime. Moreover, up to 9dB improvement in signal-to-noise ratio (SNR) for a target BER is observed, compared to least square (LS) channel estimation, especially when the model is trained in the low SNR regime. A deep artificial neural network (Deep ANN) model shows worse BER performance compared to LS in all tested environments. These preliminary results present an opportunity for achieving better performance in channel estimation through GRNN and highlight further research topics for deployment in the wild. 
    more » « less