期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Classical Correlations vs Quantum Correlations—Similarities, Differences, Opportunities
1
作者 Gunter Meissner Sidy Danioko Pedro Villarreal 《Journal of Applied Mathematics and Physics》 2024年第9期3237-3260,共24页
Classical Correlations were founded in 1900 by Karl Pearson and have since been applied as a statistical tool in virtually all sciences. Quantum correlations go back to Albert Einstein et al. in 1935 and Erwin Schr... Classical Correlations were founded in 1900 by Karl Pearson and have since been applied as a statistical tool in virtually all sciences. Quantum correlations go back to Albert Einstein et al. in 1935 and Erwin Schrödinger’s responses shortly after. In this paper, we contrast classical with quantum correlations. We find that classical correlations are weaker than quantum correlations in the CHSH framework. With respect to correlation matrices, the trace of classical correlation matrices is dissimilar to quantum density matrices. However, the off-diagonal terms have equivalent interpretations. We contrast classical dynamic (i.e., time evolving) stochastic correlation with dynamic quantum density matrices and find that the off-diagonal elements, while different in nature, have similar interpretations. So far, due to the laws of quantum physics, no classical correlations are applied to the quantum spectrum. However, conversely, quantum correlations are applied in classical environments such as quantum computing, cryptography, metrology, teleportation, medical imaging, laser technology, the quantum Internet and more. 展开更多
关键词 Classical correlations Quantum correlations CHSH Framework correlation matrices Quantum Computing
下载PDF
The Asymptotic Distributions of the Largest Entries of Sample Correlation Matrices under an α-mixing Assumption
2
作者 Hao Zhu ZHAO Yong ZHANG 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2022年第11期2039-2056,共18页
Let{Xk,i;k≥1,i≥1}be an array of random variables,{Xk;k≥1}be a strictly stationaryα-mixing sequence,where Xk=(Xk,1,Xk,2,...).Let{pn;n≥1}be a sequence of positive integers such that c1≤p n n≤c2,where c1,c2>0.I... Let{Xk,i;k≥1,i≥1}be an array of random variables,{Xk;k≥1}be a strictly stationaryα-mixing sequence,where Xk=(Xk,1,Xk,2,...).Let{pn;n≥1}be a sequence of positive integers such that c1≤p n n≤c2,where c1,c2>0.In this paper,we obtain the asymptotic distributions of the largest entries Ln=max1≤i<j≤pn|ρ(n)ij|of the sample correlation matrices,whereρ(n)ij denotes the Pearson correlation coefficient between X(i)and X(j),X(i)=(X1,i,X2,i,...).The asymptotic distributions of Ln is derived by using the Chen–Stein Poisson approximation method. 展开更多
关键词 Sample correlation matrices α-mixing sequence Chen-Stein method
原文传递
A NOVEL APPROACH FOR DOA ESTIMATION IN UNKNOWN CORRELATED NOISE FIELDS 被引量:1
3
作者 Zhou Yi Feng Dazheng Liu Jianqiang 《Journal of Electronics(China)》 2006年第1期44-47,共4页
The key of the subspace-based Direction Of Arrival (DOA) estimation lies in the estimation of signal subspace with high quality. In the case of uncorrelated signals while the signals are temporally correlated, a novel... The key of the subspace-based Direction Of Arrival (DOA) estimation lies in the estimation of signal subspace with high quality. In the case of uncorrelated signals while the signals are temporally correlated, a novel approach for the estimation of DOA in unknown correlated noise fields is proposed in this paper. The approach is based on the biorthogonality between a matrix and its Moore-Penrose pseudo inverse, and made no assumption on the spatial covariance matrix of the noise. The approach exploits the structural information of a set of spatio-temporal correlation matrices, and it can give a robust and precise estimation of signal subspace, so a precise estimation of DOA is obtained. Its performances are confirmed by computer simulation results. 展开更多
关键词 Array signal processing Correlated noise Signal subspace Direction Of Arrival (DOA) estimation Spatio-temporal correlation matrices
下载PDF
On Finite Rank Operators in CSL Algebras Ⅱ 被引量:2
4
作者 Lu Shijie (Department of Mathematics,Zhejiang University,Hangzhou 310027,China) 《Acta Mathematica Sinica,English Series》 SCIE CSCD 1997年第3期321-326,共6页
For finite rank operators in a commutative subspace lattice algebra alg(?)we introduce the concept of correlation matrices,basing on which we prove that a finite rank operator in alg(?)can be written as a finite sum o... For finite rank operators in a commutative subspace lattice algebra alg(?)we introduce the concept of correlation matrices,basing on which we prove that a finite rank operator in alg(?)can be written as a finite sum of rank-one operators in alg(?),if it has only finitely many different correlation matrices.Thus we can recapture the results of J.R.Ringrose,A.Hopenwasser and R.Moore as corollaries of our theorems. 展开更多
关键词 CSL algebras Finite rank operators correlation matrices
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部