Integrated sensing and communication(ISAC)is one of the main usage scenarios for 6G wireless networks.To most efficiently utilize the limited wireless resources,integrated super-resolution sensing and communication(IS...Integrated sensing and communication(ISAC)is one of the main usage scenarios for 6G wireless networks.To most efficiently utilize the limited wireless resources,integrated super-resolution sensing and communication(ISSAC)has been recently proposed to significantly improve sensing performance with super-resolution algorithms for ISAC systems,such as the Multiple Signal Classification(MUSIC)algorithm.However,traditional super-resolution sensing algorithms suffer from prohibitive computational complexity of orthogonal-frequency division multiplexing(OFDM)systems due to the large dimensions of the signals in the subcarrier and symbol domains.To address such issues,we propose a novel two-stage approach to reduce the computational complexity for super-resolution range estimation significantly.The key idea of the proposed scheme is to first uniformly decimate signals in the subcarrier domain so that the computational complexity is significantly reduced without missing any target in the range domain.However,the decimation operation may result in range ambiguity due to pseudo peaks,which is addressed by the second stage where the total collocated subcarrier data are used to verify the detected peaks.Compared with traditional MUSIC algorithms,the proposed scheme reduces computational complexity by two orders of magnitude,while maintaining the range resolution and unambiguity.Simulation results verify the effectiveness of the proposed scheme.展开更多
Due to the unavoidable interaction between the quantum channel and its ambient environment,it is difficult to generate and maintain the maximally entanglement.Thus,the research on multiparty information transmission v...Due to the unavoidable interaction between the quantum channel and its ambient environment,it is difficult to generate and maintain the maximally entanglement.Thus,the research on multiparty information transmission via non-maximally entangled channels is of academic value and general application.Here,we utilize the non-maximally entangled channels to implement two multiparty remote state preparation schemes for transmitting different quantum information from one sender to two receivers synchronously.The first scheme is adopted to transmit two different four-qubit cluster-type entangled states to two receivers with a certain probability.In order to improve success probabilities of such multicast remote state preparation using non-maximally entangled channels,we put forward the second scheme,which deals with the situation that is a synchronous transfer of an arbitrary single-qubit state and an arbitrary two-qubit state from one sender to two receivers.In particular,its success probability can reach 100%in principle,and independent of the entanglement degree of the shared non-maximally entangled channel.Notably,in the second scheme,the auxiliary particle is not required.展开更多
We present a scheme for probabilistically teleporting an arbitrary unknown two-qubit state through a quantum channel made up of two nonidentical non-maximally entangled states. In this scheme, the probabilistic telepo...We present a scheme for probabilistically teleporting an arbitrary unknown two-qubit state through a quantum channel made up of two nonidentical non-maximally entangled states. In this scheme, the probabilistic teleportation is realized by using a proper positive operator-valued measure instead of usual projective measurement.展开更多
In many earlier works,perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states.However,in actual quantum networks...In many earlier works,perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states.However,in actual quantum networks,a maximally entangled state as auxiliary resource is hard to be obtained or easily turned into a non-maximally entangled state subject to all kinds of environmental noises.Therefore,we propose a more practical quantum network coding scheme with the assist of non-maximally entangled states.In this paper,a practical quantum network coding protocol over grail network is proposed,in which the non-maximally entangled resource is assisted and even the desired quantum state can be perfectly transmitted.The achievable rate region,security and practicability of the proposed protocol are discussed and analyzed.This practical quantum network coding protocol proposed over the grail network can be regarded as a useful attempt to help move the theory of quantum network coding towards practicability.展开更多
This paper introduces decimated filter banks for the one-dimensional empirical mode decomposition （1D-EMD）. These filter banks can provide perfect reconstruction and allow for an arbitrary tree structure. Since the ...This paper introduces decimated filter banks for the one-dimensional empirical mode decomposition （1D-EMD）. These filter banks can provide perfect reconstruction and allow for an arbitrary tree structure. Since the EMD is a data driven decomposition, it is a very useful analysis instrument for non-stationary and non-linear signals. However, the traditional 1D-EMD has the disadvantage of expanding the data. Large data sets can be generated as the amount of data to be stored increases with every decomposition level. The 1D-EMD can be thought as having the structure of a single dyadic filter. However, a methodology to incorporate the decomposition into any arbitrary tree structure has not been reported yet in the literature. This paper shows how to extend the 1D-EMD into any arbitrary tree structure while maintaining the perfect reconstruction property. Furthermore, the technique allows for downsampling the decomposed signals. This paper, thus, presents a method to minimize the data-expansion drawback of the 1D-EMD by using decimation and merging the EMD coefficients. The proposed algorithm is applicable for any arbitrary tree structure including a full binary tree structure.展开更多
With the emergence of classical communication security problems,quantum communication has been studied more extensively.In this paper,a novel probabilistic hierarchical quantum information splitting protocol is design...With the emergence of classical communication security problems,quantum communication has been studied more extensively.In this paper,a novel probabilistic hierarchical quantum information splitting protocol is designed by using a non-maximally entangled four-qubit cluster state.Firstly,the sender Alice splits and teleports an arbitrary one-qubit secret state invisibly to three remote agents Bob,Charlie,and David.One agent David is in high grade,the other two agents Bob and Charlie are in low grade.Secondly,the receiver in high grade needs the assistance of one agent in low grade,while the receiver in low grade needs the aid of all agents.While introducing an ancillary qubit,the receiver’s state can be inferred from the POVM measurement result of the ancillary qubit.Finally,with the help of other agents,the receiver can recover the secret state probabilistically by performing certain unitary operation on his own qubit.In addition,the security of the protocol under eavesdropping attacks is analyzed.In this proposed protocol,the agents need only single-qubit measurements to achieve probabilistic hierarchical quantum information splitting,which has appealing advantages in actual experiments.Such a probabilistic hierarchical quantum information splitting protocol hierarchical is expected to be more practical in multipartite quantum cryptography.展开更多
The infinite time-evolving block decimation algorithm(i TEBD)provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit.In this paper we suggest an o...The infinite time-evolving block decimation algorithm(i TEBD)provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit.In this paper we suggest an optimized way to take the i TEBD calculation,which takes advantage of additional reduced decompositions to speed up the calculation.The numerical calculations show that for a comparable computation time our method provides more accurate results than the traditional i TEBD,especially for lattice systems with large on-site degrees of freedom.展开更多
This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularl...This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularly multiplication and division. The operations of multiplication and division are represented by algebraic formulas. An advantage of the method is that the cumulative process can be performed on decimal numbers. The present paper aims to establish a basic and useful formula valid for the two fundamental arithmetic operations of multiplication and division. The new cumulative method proved to be more flexible and made it possible to extend the multiplication and division based on repeated addition/subtraction to decimal numbers.展开更多
Accurate frequency estimation in a wideband digital receiver using the FFT algorithm encounters challenges, such as spectral leakage resulting from the FFT’s assumption of signal periodicity. High-resolution FFTs pos...Accurate frequency estimation in a wideband digital receiver using the FFT algorithm encounters challenges, such as spectral leakage resulting from the FFT’s assumption of signal periodicity. High-resolution FFTs pose computational demands, and estimating non-integer multiples of frequency resolution proves exceptionally challenging. This paper introduces two novel methods for enhanced frequency precision: polynomial interpolation and array indexing, comparing their results with super-resolution and scalloping loss. Simulation results demonstrate the effectiveness of the proposed methods in contemporary radar systems, with array indexing providing the best frequency estimation despite utilizing maximum hardware resources. The paper demonstrates a trade-off between accurate frequency estimation and hardware resources when comparing polynomial interpolation and array indexing.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.62071114.
文摘Integrated sensing and communication(ISAC)is one of the main usage scenarios for 6G wireless networks.To most efficiently utilize the limited wireless resources,integrated super-resolution sensing and communication(ISSAC)has been recently proposed to significantly improve sensing performance with super-resolution algorithms for ISAC systems,such as the Multiple Signal Classification(MUSIC)algorithm.However,traditional super-resolution sensing algorithms suffer from prohibitive computational complexity of orthogonal-frequency division multiplexing(OFDM)systems due to the large dimensions of the signals in the subcarrier and symbol domains.To address such issues,we propose a novel two-stage approach to reduce the computational complexity for super-resolution range estimation significantly.The key idea of the proposed scheme is to first uniformly decimate signals in the subcarrier domain so that the computational complexity is significantly reduced without missing any target in the range domain.However,the decimation operation may result in range ambiguity due to pseudo peaks,which is addressed by the second stage where the total collocated subcarrier data are used to verify the detected peaks.Compared with traditional MUSIC algorithms,the proposed scheme reduces computational complexity by two orders of magnitude,while maintaining the range resolution and unambiguity.Simulation results verify the effectiveness of the proposed scheme.
基金Project supported by the Key Industry Projects in Shaanxi Province,China(Grant Nos.2019ZDLGY09-03 and 2020ZDLGY15-09)the National Natural Science Foundation of China(Grant Nos.61771296,61372076,and 61301171)+1 种基金the Natural Science Foundation of Shaanxi Province,China(Grant Nos.2018JM60-53 and 2018JZ60-06)the 111 Project(Grant B08038).
文摘Due to the unavoidable interaction between the quantum channel and its ambient environment,it is difficult to generate and maintain the maximally entanglement.Thus,the research on multiparty information transmission via non-maximally entangled channels is of academic value and general application.Here,we utilize the non-maximally entangled channels to implement two multiparty remote state preparation schemes for transmitting different quantum information from one sender to two receivers synchronously.The first scheme is adopted to transmit two different four-qubit cluster-type entangled states to two receivers with a certain probability.In order to improve success probabilities of such multicast remote state preparation using non-maximally entangled channels,we put forward the second scheme,which deals with the situation that is a synchronous transfer of an arbitrary single-qubit state and an arbitrary two-qubit state from one sender to two receivers.In particular,its success probability can reach 100%in principle,and independent of the entanglement degree of the shared non-maximally entangled channel.Notably,in the second scheme,the auxiliary particle is not required.
基金The project supported by National Natural Science Foundation of China under Grant No. 10304022,the Science-Technology Fund of Anhui Province for 0utstanding Youth under Grant No. 06042087, the General Fund of the Educational Committee of Anhui Province under Grant No. 2006KJ260B, the Key Fund of the Ministry of Education of China under Grant No. 206063. We are very grateful to Prof. Zhan-Jun Zhang for his detailed instructions and helps.
文摘We present a scheme for probabilistically teleporting an arbitrary unknown two-qubit state through a quantum channel made up of two nonidentical non-maximally entangled states. In this scheme, the probabilistic teleportation is realized by using a proper positive operator-valued measure instead of usual projective measurement.
基金supported by the National Natural Science Foundation of China(Grant Nos.61671087,92046001,61962009,61003287,61370188,61373131)the Scientific Research Common Program of Beijing Municipal Commission of Education(KM202010015009,KM201610015002)+6 种基金the Joint Funding Project of Beijing Municipal Commission of Education and Beijing Natural Science Fund Committee(KZ201710015010)the Initial Funding for the Doctoral Program of BIGC(27170120003/020)the Fok Ying Tung Education Foundation(Grant No.131067)the Fundamental Research Funds for the Central Universities(Grant No.2019XD-A02)the Fundamental Research Funds in Heilongjiang Provincial Universities(135509116)the Major Scientific and Technological Special Project of Guizhou Province(20183001)Huawei Technologies Co.Ltd.(No.YBN2020085019),PAPD and CICAEET funds.
文摘In many earlier works,perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states.However,in actual quantum networks,a maximally entangled state as auxiliary resource is hard to be obtained or easily turned into a non-maximally entangled state subject to all kinds of environmental noises.Therefore,we propose a more practical quantum network coding scheme with the assist of non-maximally entangled states.In this paper,a practical quantum network coding protocol over grail network is proposed,in which the non-maximally entangled resource is assisted and even the desired quantum state can be perfectly transmitted.The achievable rate region,security and practicability of the proposed protocol are discussed and analyzed.This practical quantum network coding protocol proposed over the grail network can be regarded as a useful attempt to help move the theory of quantum network coding towards practicability.
基金supported in part by an internal grant of Eastern Washington University
文摘This paper introduces decimated filter banks for the one-dimensional empirical mode decomposition （1D-EMD）. These filter banks can provide perfect reconstruction and allow for an arbitrary tree structure. Since the EMD is a data driven decomposition, it is a very useful analysis instrument for non-stationary and non-linear signals. However, the traditional 1D-EMD has the disadvantage of expanding the data. Large data sets can be generated as the amount of data to be stored increases with every decomposition level. The 1D-EMD can be thought as having the structure of a single dyadic filter. However, a methodology to incorporate the decomposition into any arbitrary tree structure has not been reported yet in the literature. This paper shows how to extend the 1D-EMD into any arbitrary tree structure while maintaining the perfect reconstruction property. Furthermore, the technique allows for downsampling the decomposed signals. This paper, thus, presents a method to minimize the data-expansion drawback of the 1D-EMD by using decimation and merging the EMD coefficients. The proposed algorithm is applicable for any arbitrary tree structure including a full binary tree structure.
基金This work is supported by the NSFC(Grant Nos.92046001,61571024,61671087,61962009,61971021)the Open Foundation of Guizhou Provincial Key Laboratory of Public Big Data(Grant Nos.2018BDKFJJ018,2019BDKFJJ010,2019BDKFJJ014)+5 种基金the Open Research Project of the State Key Laboratory of Media Convergence and Communication,Communication University of China,China(Grant No.SKLMCC2020KF006)the High-quality and Cutting-edge Disciplines Construction Project for Universities in Beijing(Internet Information,Communication University of China)the Fundamental Research Funds for the Central Universities(Grant No.2019XD-A02)the Scientific Research Foundation of North China University of Technologythe Fundamental Research Funds for the Beijing Municipal Education CommissionJSPS KAKENHI Grant Number JP20F20080.
文摘With the emergence of classical communication security problems,quantum communication has been studied more extensively.In this paper,a novel probabilistic hierarchical quantum information splitting protocol is designed by using a non-maximally entangled four-qubit cluster state.Firstly,the sender Alice splits and teleports an arbitrary one-qubit secret state invisibly to three remote agents Bob,Charlie,and David.One agent David is in high grade,the other two agents Bob and Charlie are in low grade.Secondly,the receiver in high grade needs the assistance of one agent in low grade,while the receiver in low grade needs the aid of all agents.While introducing an ancillary qubit,the receiver’s state can be inferred from the POVM measurement result of the ancillary qubit.Finally,with the help of other agents,the receiver can recover the secret state probabilistically by performing certain unitary operation on his own qubit.In addition,the security of the protocol under eavesdropping attacks is analyzed.In this proposed protocol,the agents need only single-qubit measurements to achieve probabilistic hierarchical quantum information splitting,which has appealing advantages in actual experiments.Such a probabilistic hierarchical quantum information splitting protocol hierarchical is expected to be more practical in multipartite quantum cryptography.
基金Project supported by Fundamental Research Funds for the Central Universities(Grant No.FRF-TP-19-013A3)。
文摘The infinite time-evolving block decimation algorithm(i TEBD)provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit.In this paper we suggest an optimized way to take the i TEBD calculation,which takes advantage of additional reduced decompositions to speed up the calculation.The numerical calculations show that for a comparable computation time our method provides more accurate results than the traditional i TEBD,especially for lattice systems with large on-site degrees of freedom.
文摘This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularly multiplication and division. The operations of multiplication and division are represented by algebraic formulas. An advantage of the method is that the cumulative process can be performed on decimal numbers. The present paper aims to establish a basic and useful formula valid for the two fundamental arithmetic operations of multiplication and division. The new cumulative method proved to be more flexible and made it possible to extend the multiplication and division based on repeated addition/subtraction to decimal numbers.
文摘Accurate frequency estimation in a wideband digital receiver using the FFT algorithm encounters challenges, such as spectral leakage resulting from the FFT’s assumption of signal periodicity. High-resolution FFTs pose computational demands, and estimating non-integer multiples of frequency resolution proves exceptionally challenging. This paper introduces two novel methods for enhanced frequency precision: polynomial interpolation and array indexing, comparing their results with super-resolution and scalloping loss. Simulation results demonstrate the effectiveness of the proposed methods in contemporary radar systems, with array indexing providing the best frequency estimation despite utilizing maximum hardware resources. The paper demonstrates a trade-off between accurate frequency estimation and hardware resources when comparing polynomial interpolation and array indexing.
