期刊文献+
共找到15篇文章
< 1 >
每页显示 20 50 100
Exact Decoding Probability of Random Linear Network Coding for Combinatorial Networks
1
作者 LI Fang 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2015年第5期391-396,共6页
Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in ... Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a (all) sink(s) represents the impact of major parameters, i.e., the size of field, the number of relays (and sinks) and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers' capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. 展开更多
关键词 random linear network coding successful probability combinatorial networks
原文传递
Decoding Quantum Search Advantage:The Critical Role of State Properties in Random Walks
2
作者 Si-Qi Zhou Jin-Min Liang +3 位作者 Zi-Heng Ding Zhi-Hua Chen Shao-Ming Fei Zhi-Hao Ma 《Chinese Physics Letters》 2025年第9期88-101,共14页
Quantum algorithms have demonstrated provable speedups over classical counterparts,yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge.In this work,we de... Quantum algorithms have demonstrated provable speedups over classical counterparts,yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge.In this work,we decode the quantum search advantage by investigating the critical role of quantum state properties in random-walk-based algorithms.We propose three distinct variants of quantum random-walk search algorithms and derive exact analytical expressions for their success probabilities.These probabilities are fundamentally determined by specific initial state properties:the coherence fraction governs the first algorithm’s performance,while entanglement and coherence dominate the outcomes of the second and third algorithms,respectively.We show that increased coherence fraction enhances success probability,but greater entanglement and coherence reduce it in the latter two cases.These findings reveal fundamental insights into harnessing quantum properties for advantage and guide algorithm design.Our searches achieve Grover-like speedups and show significant potential for quantum-enhanced machine learning. 展开更多
关键词 derive exact analytical expressions quantum search establishing comprehensive theoretical framework understand quantum advantage quantum random walk ENTANGLEMENT success probability decode quantum search advantage COHERENCE
原文传递
Preamble slice orderly queue access scheme in cell-free dense communication systems
3
作者 Jun Sun Mengzhu Guo Jian Liu 《Digital Communications and Networks》 2025年第1期126-135,共10页
High reliability applications in dense access scenarios have become one of the main goals of 6G environments.To solve the access collision of dense Machine Type Communication(MTC)devices in cell-free communication sys... High reliability applications in dense access scenarios have become one of the main goals of 6G environments.To solve the access collision of dense Machine Type Communication(MTC)devices in cell-free communication systems,an intelligent cooperative secure access scheme based on multi-agent reinforcement learning and federated learning is proposed,that is,the Preamble Slice Orderly Queue Access(PSOQA)scheme.In this scheme,the preamble arrangement is combined with the access control.The preamble arrangement is realized by preamble slices which is from the virtual preamble pool.The access devices learn to queue orderly by deep reinforcement learning.The orderly queue weakens the random and avoids collision.A preamble slice is assigned to an orderly access queue at each access time.The orderly queue is determined by interaction information among multiple agents.With the federated reinforcement learning framework,the PSOQA scheme is implemented to guarantee the privacy and security of agents.Finally,the access performance of PSOQA is compared with other random contention schemes in different load scenarios.Simulation results show that PSOQA can not only improve the access success rate but also guarantee low-latency tolerant performances. 展开更多
关键词 Machine type communication Random access Reinforcement learning Access success probability Federated learning
在线阅读 下载PDF
Increasing Success Probability of a Probabilistic Quantum Teleportation
4
作者 徐纯洁 刘益民 +1 位作者 章文 张战军 《Communications in Theoretical Physics》 SCIE CAS CSCD 2010年第12期1015-1018,共4页
The probabilistic quantum teleportation scheme [Phys. Lett. A 305 (2002) 12] is improved via two seemingly different methods (i.e., the usual aneilla method and the so-called Kraus method), respectively. The essen... The probabilistic quantum teleportation scheme [Phys. Lett. A 305 (2002) 12] is improved via two seemingly different methods (i.e., the usual aneilla method and the so-called Kraus method), respectively. The essence of the improvements is to fetch a part from the residues so that the success probability is accordingly increased. The two improved versions and a similar protocol proposed by Li et al. [Phys. Rev. A 61 (2000) 034301] are compared mutually and discussed. It is found that they are equally efficient and can reach the success probability threshold determined by the inherent entanglement of the quantum channel. 展开更多
关键词 probabilistic quantum teleportation success probability ancilla Kraus measurement
在线阅读 下载PDF
Load Statistics Priority Random Access Technology Based on Air-Space-Ground Integrated Network
5
作者 Enze Li Hao Huan +1 位作者 Jingyu Wang Kunshan Yang 《Journal of Beijing Institute of Technology》 EI CAS 2024年第6期493-506,共14页
In today's world where everything is interconnected, air-space-ground integrated networks have become a current research hotspot due to their characteristics of high, long and wide area coverage. Given the constan... In today's world where everything is interconnected, air-space-ground integrated networks have become a current research hotspot due to their characteristics of high, long and wide area coverage. Given the constantly changing and dynamic characteristics of air and space networks, along with the sheer number and complexity of access nodes involved, the process of rapid networking presents substantial challenges. In order to achieve rapid and dynamic networking of air-space-ground integrated networks, this paper focuses on the study of methods for large-scale nodes to randomly access satellites. This paper utilizes a cross-layer design methodology to enhance the access success probability by jointly optimizing the physical layer and medium access control(MAC) layer aspects. Load statistics priority random access(LSPRA) technology is proposed.Experiments show that when the number of nodes is greater than 1 000, this method can also ensure stable access performance, providing ideas for the design of air-space-ground integrated network access systems. 展开更多
关键词 air-space-ground integrated network random access satellite-to-ground statistics priority access success probability
在线阅读 下载PDF
Probabilistic Teleportation of an Arbitrary Two-Qubit State via Positive Operator-Valued Measurement with Multi Parties
6
作者 石磊 魏家华 +3 位作者 李云霞 马丽华 薛阳 罗均文 《Communications in Theoretical Physics》 SCIE CAS CSCD 2017年第4期377-382,共6页
We propose a novel scheme to probabilistically transmit an arbitrary unknown two-qubit quantum state via Positive Operator-Valued Measurement with the help of two partially entangled states. In this scheme, the telepo... We propose a novel scheme to probabilistically transmit an arbitrary unknown two-qubit quantum state via Positive Operator-Valued Measurement with the help of two partially entangled states. In this scheme, the teleportation with two senders and two receives can be realized when the information of non-maximally entangled states is only available for the senders. Furthermore, the concrete implementation processes of this proposal are presented, meanwhile the classical communication cost and the successful probability of our scheme are calculated. 展开更多
关键词 probabilistic teleportation positive operator-valued measurement successful probability classical communication cost
原文传递
Probabilistically implementing nonlocal operations between two distant qutrits
7
作者 单永光 聂建军 曾浩生 《Chinese Physics B》 SCIE EI CAS CSCD 2006年第6期1177-1183,共7页
We propose a method to probabilistically implement a nonlocal operation, exp[iζUAUB], between two distant qutrits A and B, where ζ∈ C [0,2π] and UA, UB are local unitary and Hermitian operations for qutrits A and ... We propose a method to probabilistically implement a nonlocal operation, exp[iζUAUB], between two distant qutrits A and B, where ζ∈ C [0,2π] and UA, UB are local unitary and Hermitian operations for qutrits A and B respectively. The consumptions of resource for one performance of the method are a single non-maximally entangled qutrit state and 1-trit classical communication. For a given ζ, the successful probability of the method depends on the forms of both entanglement resource and Bob's partial-measurement basis. We systematically discuss the optimal successful probabilities and their corresponding conditions for three cases: adjustable entanglement resource, adjustable partial-measurement basis, adjustable entanglement resource and partial-measurement basis. It is straightforward to generalize the method for producing nonlocal unitary operations between any two N-level systems. 展开更多
关键词 nonlocal operation QUTRIT optimal successful probability
原文传递
Probabilistic resumable quantum teleportation in high dimensions
8
作者 Xiang Chen Jin-Hua Zhang Fu-Lin Zhang 《Chinese Physics B》 SCIE EI CAS CSCD 2022年第3期165-169,共5页
Teleportation is a quantum information process without classical counterparts, in which the sender can disembodiedly transfer unknown quantum states to the receiver. In probabilistic teleportation through a partial en... Teleportation is a quantum information process without classical counterparts, in which the sender can disembodiedly transfer unknown quantum states to the receiver. In probabilistic teleportation through a partial entangled quantum channel,the transmission is exact(with fidelity 1), but may fail in a probability and the initial state is destroyed simultaneously.We propose a scheme for nondestructive probabilistic teleportation of high-dimensional quantum states. With the aid of an ancilla in the hands of the sender, the initial quantum information can be recovered when teleportation fails. The ancilla acts as a quantum apparatus to measure the sender’s subsystem. Erasing the information recorded in it can resume the initial state. 展开更多
关键词 probabilistic teleportation ENTANGLEMENT successful probability
原文传递
Probabilistically Controlled Teleportation of an Arbitrary Two-Qubit State via Positive Operator-Valued Measure 被引量:2
9
作者 许海峰 韩莲芳 《Communications in Theoretical Physics》 SCIE CAS CSCD 2013年第5期554-558,共5页
We propose a tripartite scheme for probabilistically teleporting an arbitrary two-qubit state with a fourqubit cluster-class state and a Bell-class state as the quantum channels. In the scheme, the sender and the cont... We propose a tripartite scheme for probabilistically teleporting an arbitrary two-qubit state with a fourqubit cluster-class state and a Bell-class state as the quantum channels. In the scheme, the sender and the controller make Bell-state measurements (BSMs) on their respective qubit pairs. With their measurement results, the receiver can reconstruct the original state probabilistically by introducing two auxiliary particles and making appropriate unitary operations and positive operator-valued measure (POVM) instead of usual projective measurement. Moreover, the total success probability and classical communication cost of the present protocol are also worked out. 展开更多
关键词 controlled teleportation pure entangled quantum channels positive operator-valued measure success probability classical communication cost
原文传递
Controllable all-optical stochastic logic gates and their delay storages based on the cascaded VCSELs with optical-injection 被引量:6
10
作者 钟东洲 罗伟 许葛亮 《Chinese Physics B》 SCIE EI CAS CSCD 2016年第9期342-354,共13页
Using the dynamical properties of the polarization bistability that depends on the detuning of the injected light,we propose a novel approach to implement reliable all-optical stochastic logic gates in the cascaded ve... Using the dynamical properties of the polarization bistability that depends on the detuning of the injected light,we propose a novel approach to implement reliable all-optical stochastic logic gates in the cascaded vertical cavity surface emitting lasers(VCSELs) with optical-injection.Here,two logic inputs are encoded in the detuning of the injected light from a tunable CW laser.The logic outputs are decoded from the two orthogonal polarization lights emitted from the optically injected VCSELs.For the same logic inputs,under electro-optic modulation,we perform various digital signal processing(NOT,AND,NAND,XOR,XNOR,OR,NOR) in the all-optical domain by controlling the logic operation of the applied electric field.Also we explore their delay storages by using the mechanism of the generalized chaotic synchronization.To quantify the reliabilities of these logic gates,we further demonstrate their success probabilities. 展开更多
关键词 all-optical stochastic logic gates delay storage polarization bistable success probability
原文传递
Teleportation of unknown states of a qubit and a single-mode field in strong coupling regime without Bell-state measurement 被引量:1
11
作者 F Jahanbakhsh M K Tavassoly 《Communications in Theoretical Physics》 SCIE CAS CSCD 2023年第2期73-79,共7页
In this paper,we develop the teleportation scheme in[Zheng in Phys Rev A 69,064302,2004],in the sense that,we work in the strong atom-field coupling regime wherein the rotating wave approximation(RWA)is no longer vali... In this paper,we develop the teleportation scheme in[Zheng in Phys Rev A 69,064302,2004],in the sense that,we work in the strong atom-field coupling regime wherein the rotating wave approximation(RWA)is no longer valid.To achieve the purpose,a scheme consisting of a qubit interacting with a single-mode quantized field is described via the Rabi model(counter rotation terms are taken into account).Our first aim is to teleport an unknown atomic state of a qubit(which interacts with the quantized field in a cavity)to a second qubit(exists in another distant cavity field),beyond the RWA and without the Bell-state measurement method.In the continuation,in a similar way,we teleport an unknown state of a single-mode field too.In fact,it is shown that,in this regime,after applying some particular conditions,containing the interaction time of atom-field in the cavities,adjusting the involved frequencies,as well as the atom-field coupling in the model,if a proper measurement is performed on the state of the first qubit(the related field in the cavity),the unknown states of the qubit(field)can be teleported from the first qubit(cavity field)to the second qubit(cavity field),appropriately.We show that in both considered cases,the teleportation protocol is successfully performed with the maximum possible fidelity,1,and the acceptable success probability,0.25. 展开更多
关键词 strong atom-field coupling Rabi model quantum teleportation success probability FIDELITY
原文传递
Effects of initial states on the quantum correlations in the generalized Grover search algorithm 被引量:1
12
作者 Zhen-Yu Chen Tian-HuiQiu +1 位作者 Wen-Bin Zhang Hong-Yang Ma 《Chinese Physics B》 SCIE EI CAS CSCD 2021年第8期145-151,共7页
We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation.Using a set of suitable bases,we construct the reduced density matrix and give th... We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation.Using a set of suitable bases,we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations.For different initial states,we obtain the concurrence and quantum discord compared with the success probability in the algorithm.The results show that the initial states affect the correlations and the limit point of the correlations in the searching process.However,the initial states do not influence the whole cyclical trend. 展开更多
关键词 Grover search algorithm quantum correlations initial states the success probability
原文传递
Deterministic Joint Remote Preparation of an Arbitrary Two-Qubit State Using the Cluster State 被引量:1
13
作者 王明明 陈秀波 杨义先 《Communications in Theoretical Physics》 SCIE CAS CSCD 2013年第5期568-572,共5页
Recently, deterministic joint remote state preparation (JRSP) schemes have been proposed to achieve 100% success probability. In this paper, we propose a new version of deterministic JRSP scheme of an arbitrary two-qu... Recently, deterministic joint remote state preparation (JRSP) schemes have been proposed to achieve 100% success probability. In this paper, we propose a new version of deterministic JRSP scheme of an arbitrary two-qubit state by using the six-qubit cluster state as shared quantum resource. Compared with previous schemes, our scheme has high efficiency since less quantum resource is required, some additional unitary operations and measurements are unnecessary. We point out that the existing two types of deterministic JRSP schemes based on GHZ states and EPR pairs are equivalent. 展开更多
关键词 joint remote state preparation cluster state unit success probability
原文传递
On the System Performance of Mobile Edge Computing in an Uplink NOMA WSN With a Multiantenna Access Point Over Nakagami-m Fading 被引量:1
14
作者 Van-Truong Truong Van Nhan Vo +1 位作者 Dac-Binh Ha Chakchai So-In 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2022年第4期668-685,共18页
In this paper,we study the system performance of mobile edge computing(MEC)wireless sensor networks(WSNs)using a multiantenna access point(AP)and two sensor clusters based on uplink nonorthogonal multiple access(NOMA)... In this paper,we study the system performance of mobile edge computing(MEC)wireless sensor networks(WSNs)using a multiantenna access point(AP)and two sensor clusters based on uplink nonorthogonal multiple access(NOMA).Due to limited computation and energy resources,the cluster heads(CHs)offload their tasks to a multiantenna AP over Nakagami-m fading.We proposed a combination protocol for NOMA-MEC-WSNs in which the AP selects either selection combining(SC)or maximal ratio combining(MRC)and each cluster selects a CH to participate in the communication process by employing the sensor node(SN)selection.We derive the closed-form exact expressions of the successful computation probability(SCP)to evaluate the system performance with the latency and energy consumption constraints of the considered WSN.Numerical results are provided to gain insight into the system performance in terms of the SCP based on system parameters such as the number of AP antennas,number of SNs in each cluster,task length,working frequency,offloading ratio,and transmit power allocation.Furthermore,to determine the optimal resource parameters,i.e.,the offloading ratio,power allocation of the two CHs,and MEC AP resources,we proposed two algorithms to achieve the best system performance.Our approach reveals that the optimal parameters with different schemes significantly improve SCP compared to other similar studies.We use Monte Carlo simulations to confirm the validity of our analysis. 展开更多
关键词 Mobile edge computing(MEC) Nakagami-m fading OFFLOADING selection combining(SC)/maximal ratio combining(MRC) successful computation probability(SCP) uplink nonortho-gonal multiple access(NOMA) wireless sensor networks(WSNs)
在线阅读 下载PDF
Optimizing scheme for probabilistic remote preparation of a two-qubit state
15
作者 XIA Jia-fan ZHA Xin-wei 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2013年第6期109-116,共8页
Remote state preparation is increasingly becoming attractive in recent years, people have already started theoretical and experimental research, and have made valuable research results. Recently, a scheme for probabil... Remote state preparation is increasingly becoming attractive in recent years, people have already started theoretical and experimental research, and have made valuable research results. Recently, a scheme for probabilistic remote preparation of a general two-qubit state was proposed (Wang Z Y in Quantum Inf Process. 11:1585, 2012)). In this paper, we present a modified scheme for probabilistic remote preparation of a general two-qubit state. To complete the scheme, the new and feasible complete orthogonal basis vectors have been introduced. Compared with the previous schemes, the advantage of our schemes is that the total success probability of remote state preparation will be greatly improved. The probability of success regarding this scheme is calculated in both general and particular cases. The results show that the success probability of remote state preparation can be improved a little. However, in certain special cases, the success probability of preparation can be greatly improved. In special cases, the success probability of preparation can be improved to 1. The security analysis of the scheme is provided in details. 展开更多
关键词 remote state preparation w-type state orthogonal basis vector success probability of preparation
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部