We introduce the concepts of unitary, almost unitary and strongly almost unitary subset of an ordered semigroup. For the notions of almost unitary and strongly almost unitary subset of an ordered semigroup, we use the...We introduce the concepts of unitary, almost unitary and strongly almost unitary subset of an ordered semigroup. For the notions of almost unitary and strongly almost unitary subset of an ordered semigroup, we use the notion of translational hull of an ordered semigroup. If (S,⋅,≤) is an ordered semigroup having an element e such that e ≤ e<sup>2</sup> and U is a nonempty subset of S such that u ≤ eu, u ≤ ue for all u ∈ U, we show that U is almost unitary in S if and only if U is unitary in . Also if (S,⋅,≤) is an ordered semigroup, e ∉ S, U is a nonempty subset of S, S<sup>e</sup>:= S ∪ {e} and U<sup>e</sup>:= U ∪ {e}, we give conditions that an (“extension” of S) ordered semigroup and the subset U<sup>e</sup> of S<sup>e</sup> must satisfy in order for U to be almost unitary or strongly almost unitary in S (in case U is strongly almost unitary in S, then the given conditions are equivalent).展开更多
Complex networks have been a prominent topic of research for several years,spanning a wide range of fields from mathematics to computer science and also to social and biological sciences.The eigenvalues of the Seidel ...Complex networks have been a prominent topic of research for several years,spanning a wide range of fields from mathematics to computer science and also to social and biological sciences.The eigenvalues of the Seidel matrix,Seidel Signless Laplacian matrix,Seidel energy,Seidel Signless Laplacian energy,Maximum and Minimum energy,Degree Sum energy and Distance Degree energy of the Unitary Cayley graphs[UCG]have been calculated.Low-power devices must be able to transfer data across long distances with low delay and reliability.To overcome this drawback a small-world network depending on the unitary Cayley graph is proposed to decrease the delay and increase the reliability and is also used to create and analyze network communication.Small-world networks based on the Cayley graph have a basic construction and are highly adaptable.The simulation result shows that the small-world network based on unitary Cayley graphs has a shorter delay and is more reliable.Furthermore,the maximum delay is lowered by 40%.展开更多
In quantum optics, unitary transformations of arbitrary states are evaluated by using the Taylor series expansion. However, this traditional approach can become cumbersome for the transformations involving non-commuti...In quantum optics, unitary transformations of arbitrary states are evaluated by using the Taylor series expansion. However, this traditional approach can become cumbersome for the transformations involving non-commuting operators. Addressing this issue, a nonstandard unitary transformation technique is highlighted here with new perspective. In a spirit of “quantum” series expansions, the transition probabilities between initial and final states, such as displaced, squeezed and other nonlinearly transformed coherent states are obtained both numerically and analytically. This paper concludes that, although this technique is novel, its implementations for more extended systems are needed.展开更多
In the domain of quantum cryptography,the implementation of quantum secret sharing stands as a pivotal element.In this paper,we propose a novel verifiable quantum secret sharing protocol using the d-dimensional produc...In the domain of quantum cryptography,the implementation of quantum secret sharing stands as a pivotal element.In this paper,we propose a novel verifiable quantum secret sharing protocol using the d-dimensional product state and Lagrange interpolation techniques.This protocol is initiated by the dealer Alice,who initially prepares a quantum product state,selected from a predefined set of orthogonal product states within the C~d■C~d framework.Subsequently,the participants execute unitary operations on this product state to recover the underlying secret.Furthermore,we subject the protocol to a rigorous security analysis,considering both eavesdropping attacks and potential dishonesty from the participants.Finally,we conduct a comparative analysis of our protocol against existing schemes.Our scheme exhibits economies of scale by exclusively employing quantum product states,thereby realizing significant cost-efficiency advantages.In terms of access structure,we adopt a(t, n)-threshold architecture,a strategic choice that augments the protocol's practicality and suitability for diverse applications.Furthermore,our protocol includes a rigorous integrity verification mechanism to ensure the honesty and reliability of the participants throughout the execution of the protocol.展开更多
为了提高重构相干信号测向算法的估计性能,降低算法运算量,提出了一种基于矩阵重构和酉变换方法的酉矩阵重构算法。该算法首先通过酉变换将阵列接收数据从复值计算转换为实值计算,使计算量大大降低;然后计算阵列协方差矩阵并进行特征值...为了提高重构相干信号测向算法的估计性能,降低算法运算量,提出了一种基于矩阵重构和酉变换方法的酉矩阵重构算法。该算法首先通过酉变换将阵列接收数据从复值计算转换为实值计算,使计算量大大降低;然后计算阵列协方差矩阵并进行特征值分解得到信号子空间,再将信号子空间重构为Toeplitz矩阵实现解相干并再次进行酉变换;最后通过特征值分解得到信号子空间并使用最小二乘法实现波达方向(direction of arrival,DOA)估计。相比于改进的旋转不变性的信号参数(estimation of signal parameters via rotational invariance techniques-like,ESPRIT-Like)算法和空间平滑处理算法,由于消除了噪声影响、构造了Toeplitz矩阵以及充分利用了数据的共轭信息,该算法的估计精度更高、具有更高的运算效率且在ESPRIT-Like算法失效的条件下新算法仍能有效估计DOA。本文算法的运行时间是ESPRIT-Like算法的71.2%,实验结果证明了该方法的有效性和真实性。展开更多
文摘We introduce the concepts of unitary, almost unitary and strongly almost unitary subset of an ordered semigroup. For the notions of almost unitary and strongly almost unitary subset of an ordered semigroup, we use the notion of translational hull of an ordered semigroup. If (S,⋅,≤) is an ordered semigroup having an element e such that e ≤ e<sup>2</sup> and U is a nonempty subset of S such that u ≤ eu, u ≤ ue for all u ∈ U, we show that U is almost unitary in S if and only if U is unitary in . Also if (S,⋅,≤) is an ordered semigroup, e ∉ S, U is a nonempty subset of S, S<sup>e</sup>:= S ∪ {e} and U<sup>e</sup>:= U ∪ {e}, we give conditions that an (“extension” of S) ordered semigroup and the subset U<sup>e</sup> of S<sup>e</sup> must satisfy in order for U to be almost unitary or strongly almost unitary in S (in case U is strongly almost unitary in S, then the given conditions are equivalent).
文摘Complex networks have been a prominent topic of research for several years,spanning a wide range of fields from mathematics to computer science and also to social and biological sciences.The eigenvalues of the Seidel matrix,Seidel Signless Laplacian matrix,Seidel energy,Seidel Signless Laplacian energy,Maximum and Minimum energy,Degree Sum energy and Distance Degree energy of the Unitary Cayley graphs[UCG]have been calculated.Low-power devices must be able to transfer data across long distances with low delay and reliability.To overcome this drawback a small-world network depending on the unitary Cayley graph is proposed to decrease the delay and increase the reliability and is also used to create and analyze network communication.Small-world networks based on the Cayley graph have a basic construction and are highly adaptable.The simulation result shows that the small-world network based on unitary Cayley graphs has a shorter delay and is more reliable.Furthermore,the maximum delay is lowered by 40%.
文摘In quantum optics, unitary transformations of arbitrary states are evaluated by using the Taylor series expansion. However, this traditional approach can become cumbersome for the transformations involving non-commuting operators. Addressing this issue, a nonstandard unitary transformation technique is highlighted here with new perspective. In a spirit of “quantum” series expansions, the transition probabilities between initial and final states, such as displaced, squeezed and other nonlinearly transformed coherent states are obtained both numerically and analytically. This paper concludes that, although this technique is novel, its implementations for more extended systems are needed.
基金supported by the National Natural Science Foundation of China(Grant No.12301590)the Natural Science Foundation of Hebei Province(Grant No.A2022210002)。
文摘In the domain of quantum cryptography,the implementation of quantum secret sharing stands as a pivotal element.In this paper,we propose a novel verifiable quantum secret sharing protocol using the d-dimensional product state and Lagrange interpolation techniques.This protocol is initiated by the dealer Alice,who initially prepares a quantum product state,selected from a predefined set of orthogonal product states within the C~d■C~d framework.Subsequently,the participants execute unitary operations on this product state to recover the underlying secret.Furthermore,we subject the protocol to a rigorous security analysis,considering both eavesdropping attacks and potential dishonesty from the participants.Finally,we conduct a comparative analysis of our protocol against existing schemes.Our scheme exhibits economies of scale by exclusively employing quantum product states,thereby realizing significant cost-efficiency advantages.In terms of access structure,we adopt a(t, n)-threshold architecture,a strategic choice that augments the protocol's practicality and suitability for diverse applications.Furthermore,our protocol includes a rigorous integrity verification mechanism to ensure the honesty and reliability of the participants throughout the execution of the protocol.
文摘为了提高重构相干信号测向算法的估计性能,降低算法运算量,提出了一种基于矩阵重构和酉变换方法的酉矩阵重构算法。该算法首先通过酉变换将阵列接收数据从复值计算转换为实值计算,使计算量大大降低;然后计算阵列协方差矩阵并进行特征值分解得到信号子空间,再将信号子空间重构为Toeplitz矩阵实现解相干并再次进行酉变换;最后通过特征值分解得到信号子空间并使用最小二乘法实现波达方向(direction of arrival,DOA)估计。相比于改进的旋转不变性的信号参数(estimation of signal parameters via rotational invariance techniques-like,ESPRIT-Like)算法和空间平滑处理算法,由于消除了噪声影响、构造了Toeplitz矩阵以及充分利用了数据的共轭信息,该算法的估计精度更高、具有更高的运算效率且在ESPRIT-Like算法失效的条件下新算法仍能有效估计DOA。本文算法的运行时间是ESPRIT-Like算法的71.2%,实验结果证明了该方法的有效性和真实性。
