SearcharxivSearch

arXiv subjects

Matthew R. McKay

Publications and source records attributed to Matthew R. McKay.

At least 19 recordsLinked to original sources

Optimizing Global Genomic Surveillance for Early Detection of Emerging SARS-CoV-2 Variants

Background: Global viral threats underscore the need for effective genomic surveillance, but high costs and uneven resource distribution hamper its implementation. Targeting surveillance to international travelers in major travel hubs may offer a more efficient strategy for the early detection of SARS-CoV-2 variants. Methods: We developed and calibrated a multiple-strain metapopulation model of global SARS-CoV-2 transmission using extensive epidemiological, phylogenetic, and high-resolution air travel data. We then compared baseline surveillance with various resource-allocation approaches that prioritize travelers, focusing on Omicron BA.1/BA.2 retrospectively and on hypothetical future variants under different emergence, transmission and vaccine effectiveness scenarios. Findings: Focusing existing surveillance resources on travelers at key global hubs significantly shortened detection delays without increasing total surveillance efforts. In retrospective analyses of Omicron BA.1/BA.2, traveler-targeted approaches consistently outperformed baseline strategies, even when overall resources were reduced. Simulations indicate that focusing surveillance on key travel hubs outperform baseline practices in detecting future variants, across different possible origins, even with reduced resources. This approach also remains effective in future pandemic scenarios with varying reproductive numbers and vaccine effectiveness. Interpretation: These findings provide a quantitative, cost-effective framework for strengthening global genomic surveillance. By reallocating resources toward international travelers in select travel hubs, early detection of emerging variants can be enhanced, informing rapid public health interventions and bolstering preparedness for future pandemics.

q-bio.PE

Error-Mitigated Quantum Random Access Memory

As an alternative to quantum error correction, quantum error mitigation methods, including Zero-Noise Extrapolation (ZNE), have been proposed to alleviate run-time errors in current noisy quantum devices. In this work, we propose a modified version of ZNE that provides for a significant performance enhancement on current noisy devices. Our modified ZNE method extrapolates to zero-noise data by evaluating groups of noisy data obtained from noise-scaled circuits and selecting extrapolation functions for each group with the assistance of estimated noisy simulation results. To quantify enhancement in a real-world quantum application, we embed our modified ZNE in Quantum Random Access Memory (QRAM) - a memory system important for future quantum networks and computers. Our new ZNE-enhanced QRAM designs are experimentally implemented on a 27-qubit noisy superconducting quantum device, the results of which demonstrate QRAM fidelity can be improved significantly relative to traditional ZNE usage. Our results demonstrate the critical role the extrapolation function plays in ZNE - judicious choice of that function on a per-measurement basis can make the difference between a quantum application being functional or non-functional.

quant-ph

Hypothesis Test Procedures for Detecting Leakage Signals in Water Pipeline Channels

We design statistical hypothesis tests for performing leak detection in water pipeline channels. By applying an appropriate model for signal propagation, we show that the detection problem becomes one of distinguishing signal from noise, with the noise being described by a multivariate Gaussian distribution with unknown covariance matrix. We first design a test procedure based on the generalized likelihood ratio test, which we show through simulations to offer appreciable leak detection performance gain over conventional approaches designed in an analogous context (for radar detection). Our proposed method requires estimation of the noise covariance matrix, which can become inaccurate under high-dimensional settings, and when the measurement data is scarce. To deal with this, we present a second leak detection method, which employs a regularized covariance matrix estimate. The regularization parameter is optimized for the leak detection application by applying results from large dimensional random matrix theory. This second proposed approach is shown to yield improved performance in leak detection compared with the first approach, at the expense of requiring higher computational complexity.

eess.SP

Optimal Grouping Strategy for Reconfigurable Intelligent Surface Assisted Wireless Communications

The channel estimation overhead of reconfigurable intelligent surface (RIS) assisted communication systems can be prohibitive. Prior works have demonstrated via simulations that grouping neighbouring RIS elements can help to reduce the pilot overhead and improve achievable rate. In this paper, we present an analytical study of RIS element grouping. We derive a tight closed-form upper bound for the achievable rate and then maximize it with respect to the group size. Our analysis reveals that more coarse-grained grouping is important-when the channel coherence time is low (high mobility scenarios) or the transmit power is large. We also demonstrate that optimal grouping can yield significant performance improvements over simple `On-Off' RIS element switching schemes that have been recently considered.

cs.IT

Channel Estimation and Secret Key Rate Analysis of MIMO Terahertz Quantum Key Distribution

We study the secret key rate (SKR) of a multiple-input multiple-output (MIMO) continuous variable quantum key distribution (CVQKD) system operating at terahertz (THz) frequencies, accounting for the effects of channel estimation. We propose a practical channel estimation scheme for the THz MIMO CVQKD system which is necessary to realize transmit-receive beamforming between Alice and Bob. We characterize the input-output relation between Alice and Bob during the key generation phase, by incorporating the effects of additional noise terms arising due to the channel estimation error and detector noise. Furthermore, we analyze the SKR of the system and study the effect of channel estimation error and overhead. Our simulation results reveal that the SKR may degrade significantly as compared to the SKR upper bound that assumes perfect channel state information, particularly at large transmission distances.

quant-ph

Large Intelligent Surfaces with Channel Estimation Overhead: Achievable Rate and Optimal Configuration

Large intelligent surfaces (LIS) present a promising new technology for enhancing the performance of wireless communication systems. Realizing the gains of LIS requires accurate channel knowledge, and in practice the channel estimation overhead can be large due to the passive nature of LIS. Here, we study the achievable rate of a LIS-assisted single-input single-output communication system, accounting for the pilot overhead of a least-squares channel estimator. We demonstrate that there exists an optimal $K^{*}$, which maximizes achievable rate by balancing the power gains offered by LIS and the channel estimation overhead. We present analytical approximations for $K^{*}$, based on maximizing an analytical upper bound on average achievable rate that we derive, and study the dependencies of $K^*$ on statistical channel and system parameters.

eess.SP

Machine Learning Based Parameter Estimation of Gaussian Quantum States

We propose a machine learning framework for parameter estimation of single mode Gaussian quantum states. Under a Bayesian framework, our approach estimates parameters of suitable prior distributions from measured data. For phase-space displacement and squeezing parameter estimation, this is achieved by introducing Expectation-Maximization (EM) based algorithms, while for phase parameter estimation an empirical Bayes method is applied. The estimated prior distribution parameters along with the observed data are used for finding the optimal Bayesian estimate of the unknown displacement, squeezing and phase parameters. Our simulation results show that the proposed algorithms have estimation performance that is very close to that of Genie Aided Bayesian estimators, that assume perfect knowledge of the prior parameters. Our proposed methods can be utilized by experimentalists to find the optimum Bayesian estimate of parameters of Gaussian quantum states by using only the observed measurements without requiring any knowledge about the prior distribution parameters.

quant-ph

MIMO Terahertz Quantum Key Distribution

We propose a multiple-input multiple-output (MIMO) quantum key distribution (QKD) scheme for terahertz (THz) frequency applications operating at room temperature. Motivated by classical MIMO communications, a transmit-receive beamforming scheme is proposed that converts the rank-$r$ MIMO channel between Alice and Bob into $r$ parallel lossy quantum channels. Compared with existing single-antenna QKD schemes, we demonstrate that the MIMO QKD scheme leads to performance improvements by increasing the secret key rate and extending the transmission distance. Our simulation results show that multiple antennas are necessary to overcome the high free-space path loss at THz frequencies. We demonstrate a non-monotonic relation between performance and frequency, and reveal that positive key rates are achievable in the $10-30$ THz frequency range. The proposed scheme can be used for both indoor and outdoor QKD applications for beyond fifth-generation ultra-secure wireless communications systems.

cs.IT

Channel Estimation for Large Intelligent Surface Aided MISO Communications: From LMMSE to Deep Learning Solutions

We consider multi-antenna wireless systems aided by large intelligent surfaces (LIS). LIS presents a new physical layer technology for improving coverage and energy efficiency by intelligently controlling the propagation environment. In practice however, achieving the anticipated gains of LIS requires accurate channel estimation. Recent attempts to solve this problem have considered the least-squares (LS) approach, which is simple but also sub-optimal. The optimal channel estimator, based on the minimum mean-squared-error (MMSE) criterion, is challenging to obtain and is non-linear due to the non-Gaussianity of the effective channel seen at the receiver. Here we present approaches to approximate the optimal MMSE channel estimator. As a first approach, we analytically develop the best linear estimator, the LMMSE, together with a corresponding majorization-minimization based algorithm designed to optimize the LIS phase shift matrix during the training phase. This estimator is shown to yield improved accuracy over the LS approach by exploiting second-order statistical properties of the wireless channel and the noise. To further improve performance and better approximate the globally-optimal MMSE channel estimator, we propose data-driven non-linear solutions based on deep learning. Specifically, by posing the MMSE channel estimation problem as an image denoising problem, we propose two convolutional neural network (CNN) based methods to perform the denoising and approximate the optimal MMSE channel estimation solution. Our numerical results show that these CNN-based estimators give superior performance compared with linear estimation approaches. They also have low computational complexity requirements, thereby motivating their potential use in future LIS-aided wireless communication systems.

eess.SP

RIS-Assisted MISO Communication: Optimal Beamformers and Performance Analysis

We study a multiple-input single-output (MISO) communication system assisted by a reconfigurable intelligent surface (RIS). A base station (BS) having multiple antennas is assumed to be communicating to a single-antenna user equipment (UE), with the help of a RIS. We assume that the system operates in an environment with line-of-sight (LoS) between the BS and RIS, whereas the RIS-UE link experiences Rayleigh fading. We present a closed form expression for the optimal active and passive beamforming vectors at the BS and RIS respectively. Then, by characterizing the statistical properties of the received SNR at the UE, we apply them to derive analytical approximations for different system performance measures, including the outage probability, average achievable rate and average symbol error probability (SEP). Our results, in general, demonstrate that the gain due to RIS can be substantial, and can be significantly greater than the gains reaped by using multiple BS antennas.

eess.SP

Extreme Eigenvalue Distributions of Jacobi Ensembles: New Exact Representations, Asymptotics and Finite Size Corrections

Let $\mathbf{W}_1$ and $\mathbf{W}_2$ be independent $n\times n$ complex central Wishart matrices with $m_1$ and $m_2$ degrees of freedom respectively. This paper is concerned with the extreme eigenvalue distributions of double-Wishart matrices $(\mathbf{W}_1+\mathbf{W}_2)^{-1}\mathbf{W}_1$, which are analogous to those of F matrices ${\bf W}_1 {\bf W}_2^{-1}$ and those of the Jacobi unitary ensemble (JUE). Defining $α_1=m_1-n$ and $α_2=m_2-n$, we derive new exact distribution formulas in terms of $(α_1+α_2)$-dimensional matrix determinants, with elements involving derivatives of Legendre polynomials. This provides a convenient exact representation, while facilitating a direct large-$n$ analysis with $α_1$ and $α_2$ fixed (i.e., under the so-called "hard-edge" scaling limit); the analysis is based on new asymptotic properties of Legendre polynomials and their relation with Bessel functions that are here established. Specifically, we present limiting formulas for the smallest and largest eigenvalue distributions as $n \to \infty$ in terms of $α_1$- and $α_2$-dimensional determinants respectively, which agrees with expectations from known universality results involving the JUE and the Laguerre unitary ensemble (LUE). We also derive finite-$n$ corrections for the asymptotic extreme eigenvalue distributions under hard-edge scaling, giving new insights on universality by comparing with corresponding correction terms derived recently for the LUE. Our derivations are based on elementary algebraic manipulations, differing from existing results on double-Wishart and related models which often involve Fredholm determinants, Painlevé differential equations, or hypergeometric functions of matrix arguments.

math-ph

Asymptotics of eigenstructure of sample correlation matrices for high-dimensional spiked models

Sample correlation matrices are employed ubiquitously in statistics. However, quite surprisingly, little is known about their asymptotic spectral properties for high-dimensional data, particularly beyond the case of "null models" for which the data is assumed independent. Here, considering the popular class of spiked models, we apply random matrix theory to derive asymptotic first-order and distributional results for both the leading eigenvalues and eigenvectors of sample correlation matrices. These results are obtained under high-dimensional settings for which the number of samples n and variables p approach infinity, with p/n tending to a constant. To first order, the spectral properties of sample correlation matrices are seen to coincide with those of sample covariance matrices; however their asymptotic distributions can differ significantly, with fluctuations of both the sample eigenvalues and eigenvectors often being remarkably smaller than those of their sample covariance counterparts.

math.ST

Large-dimensional behavior of regularized Maronna's M-estimators of covariance matrices

Robust estimators of large covariance matrices are considered, comprising regularized (linear shrinkage) modifications of Maronna's classical M-estimators. These estimators provide robustness to outliers, while simultaneously being well-defined when the number of samples does not exceed the number of variables. By applying tools from random matrix theory, we characterize the asymptotic performance of such estimators when the numbers of samples and variables grow large together. In particular, our results show that, when outliers are absent, many estimators of the regularized-Maronna type share the same asymptotic performance, and for these estimators we present a data-driven method for choosing the asymptotically optimal regularization parameter with respect to a quadratic loss. Robustness in the presence of outliers is then studied: in the non-regularized case, a large-dimensional robustness metric is proposed, and explicitly computed for two particular types of estimators, exhibiting interesting differences depending on the underlying contamination model. The impact of outliers in regularized estimators is then studied, with interesting differences with respect to the non-regularized case, leading to new practical insights on the choice of particular estimators.

math.ST

Analysis and Design of Multiple-Antenna Cognitive Radios with Multiple Primary User Signals

We consider multiple-antenna signal detection of primary user transmission signals by a secondary user receiver in cognitive radio networks. The optimal detector is analyzed for the scenario where the number of primary user signals is no less than the number of receive antennas at the secondary user. We first derive exact expressions for the moments of the generalized likelihood ratio test (GLRT) statistic, yielding approximations for the false alarm and detection probabilities. We then show that the normalized GLRT statistic converges in distribution to a Gaussian random variable when the number of antennas and observations grow large at the same rate. Further, using results from large random matrix theory, we derive expressions to compute the detection probability without explicit knowledge of the channel, and then particularize these expressions for two scenarios of practical interest: 1) a single primary user sending spatially multiplexed signals, and 2) multiple spatially distributed primary users. Our analytical results are finally used to obtain simple design rules for the signal detection threshold.

math.ST

A Robust Statistics Approach to Minimum Variance Portfolio Optimization

We study the design of portfolios under a minimum risk criterion. The performance of the optimized portfolio relies on the accuracy of the estimated covariance matrix of the portfolio asset returns. For large portfolios, the number of available market returns is often of similar order to the number of assets, so that the sample covariance matrix performs poorly as a covariance estimator. Additionally, financial market data often contain outliers which, if not correctly handled, may further corrupt the covariance estimation. We address these shortcomings by studying the performance of a hybrid covariance matrix estimator based on Tyler's robust M-estimator and on Ledoit-Wolf's shrinkage estimator while assuming samples with heavy-tailed distribution. Employing recent results from random matrix theory, we develop a consistent estimator of (a scaled version of) the realized portfolio risk, which is minimized by optimizing online the shrinkage intensity. Our portfolio optimization method is shown via simulations to outperform existing methods both for synthetic and real market data.

q-fin.PM

Large Dimensional Analysis of Robust M-Estimators of Covariance with Outliers

A large dimensional characterization of robust M-estimators of covariance (or scatter) is provided under the assumption that the dataset comprises independent (essentially Gaussian) legitimate samples as well as arbitrary deterministic samples, referred to as outliers. Building upon recent random matrix advances in the area of robust statistics, we specifically show that the so-called Maronna M-estimator of scatter asymptotically behaves similar to well-known random matrices when the population and sample sizes grow together to infinity. The introduction of outliers leads the robust estimator to behave asymptotically as the weighted sum of the sample outer products, with a constant weight for all legitimate samples and different weights for the outliers. A fine analysis of this structure reveals importantly that the propensity of the M-estimator to attenuate (or enhance) the impact of outliers is mostly dictated by the alignment of the outliers with the inverse population covariance matrix of the legitimate samples. Thus, robust M-estimators can bring substantial benefits over more simplistic estimators such as the per-sample normalized version of the sample covariance matrix, which is not capable of differentiating the outlying samples. The analysis shows that, within the class of Maronna's estimators of scatter, the Huber estimator is most favorable for rejecting outliers. On the contrary, estimators more similar to Tyler's scale invariant estimator (often preferred in the literature) run the risk of inadvertently enhancing some outliers.

math.ST

On the Equivalence between Interference and Eavesdropping in Wireless Communications

We show that the problem of analyzing the outage probability in cellular systems affected by co-channel interference and background noise is mathematically equivalent to the problem of analyzing the wireless information-theoretic security in terms of the maximum secrecy rate in fading channels. Hence, these both apparently unrelated problems can be addressed by using a common approach. We illustrate the applicability of the connection unveiled herein to provide new results for the secrecy outage probability in different scenarios.

cs.IT

Artificial-Noise-Aided Secure Multi-Antenna Transmission with Limited Feedback

We present an optimized secure multi-antenna transmission approach based on artificial-noise-aided beamforming, with limited feedback from a desired single-antenna receiver. To deal with beamformer quantization errors as well as unknown eavesdropper channel characteristics, our approach is aimed at maximizing throughput under dual performance constraints - a connection outage constraint on the desired communication channel and a secrecy outage constraint to guard against eavesdropping. We propose an adaptive transmission strategy that judiciously selects the wiretap coding parameters, as well as the power allocation between the artificial noise and the information signal. This optimized solution reveals several important differences with respect to solutions designed previously under the assumption of perfect feedback. We also investigate the problem of how to most efficiently utilize the feedback bits. The simulation results indicate that a good design strategy is to use approximately 20% of these bits to quantize the channel gain information, with the remainder to quantize the channel direction, and this allocation is largely insensitive to the secrecy outage constraint imposed. In addition, we find that 8 feedback bits per transmit antenna is sufficient to achieve approximately 90% of the throughput attainable with perfect feedback.

cs.IT