Intra-body communication will facilitate next-generation personalized medicine by enabling interconnection among implanted devices. To this purpose, energy-efficient communication technologies are required such as galvanic coupling (GC). Although some GC testbeds have been developed to implement the entire communication chain, synchronization problems have not yet been tackled exhaustively. While some papers simply assume a-priori perfect synchronization between GC transmitter and receiver, other studies developed solutions that often are time-consuming. In this paper, an energy-efficient and fast maximum-log-likelihood (ML) synchronization method is proposed, that can operate in real time and follow channel variations. Experiments reveal that the proposed ML synchronization scheme is very effective for short-range GC communication up to 4 cm, with performance similar to the current State-of-the-Art. It shows slightly lower performance levels for higher distances, still it offers the benefit of lower computational requirements than the reference method.
{"title":"An Energy-Efficient Carrier Synchronization Method for Galvanic Coupling Intra-Body Communication","authors":"Farzana Kulsoom;Hassan Nazeer Chaudhry;Pietro Savazzi;Fabio Dell’Acqua;Anna Vizziello","doi":"10.1109/JSAC.2024.3399256","DOIUrl":"10.1109/JSAC.2024.3399256","url":null,"abstract":"Intra-body communication will facilitate next-generation personalized medicine by enabling interconnection among implanted devices. To this purpose, energy-efficient communication technologies are required such as galvanic coupling (GC). Although some GC testbeds have been developed to implement the entire communication chain, synchronization problems have not yet been tackled exhaustively. While some papers simply assume a-priori perfect synchronization between GC transmitter and receiver, other studies developed solutions that often are time-consuming. In this paper, an energy-efficient and fast maximum-log-likelihood (ML) synchronization method is proposed, that can operate in real time and follow channel variations. Experiments reveal that the proposed ML synchronization scheme is very effective for short-range GC communication up to 4 cm, with performance similar to the current State-of-the-Art. It shows slightly lower performance levels for higher distances, still it offers the benefit of lower computational requirements than the reference method.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10540659","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141177260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-29DOI: 10.1109/JSAC.2024.3402900
{"title":"IEEE Open Access Publishing","authors":"","doi":"10.1109/JSAC.2024.3402900","DOIUrl":"10.1109/JSAC.2024.3402900","url":null,"abstract":"","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10541319","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141177268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-29DOI: 10.1109/JSAC.2024.3383168
Kumar Vijay Mishra;Rodrigo C. de Lamare;Michail Matthaiou;Gerhard Kramer;Edward Knightly;Daniel Mittleman
To accommodate extremely high data rates, provide high reliability, improve coverage, and meet traffic demands in future wireless communication networks, novel technologies have emerged that exploit electromagnetic waves, large multiple-antenna systems, intelligent reflective surfaces, hardware innovations, new network architectures, and higher frequency bands. Considering advances in information theory and devices, fundamental questions arise for system designers on how to develop synergies between theory and practice. Current design and analysis methods are predominantly based on scalar-quantity, far-field, planar-wavefront, monochromatic, and other non-physically consistent assumptions, which can lead to significant mismatches with systems designed based on realistic propagation models.
{"title":"Guest Editorial: Introduction to the Special Issue on Electromagnetic Signal and Information Theory for Communications","authors":"Kumar Vijay Mishra;Rodrigo C. de Lamare;Michail Matthaiou;Gerhard Kramer;Edward Knightly;Daniel Mittleman","doi":"10.1109/JSAC.2024.3383168","DOIUrl":"10.1109/JSAC.2024.3383168","url":null,"abstract":"To accommodate extremely high data rates, provide high reliability, improve coverage, and meet traffic demands in future wireless communication networks, novel technologies have emerged that exploit electromagnetic waves, large multiple-antenna systems, intelligent reflective surfaces, hardware innovations, new network architectures, and higher frequency bands. Considering advances in information theory and devices, fundamental questions arise for system designers on how to develop synergies between theory and practice. Current design and analysis methods are predominantly based on scalar-quantity, far-field, planar-wavefront, monochromatic, and other non-physically consistent assumptions, which can lead to significant mismatches with systems designed based on realistic propagation models.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10541322","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141177595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-29DOI: 10.1109/JSAC.2024.3380082
Kaushik Senthoor;Pradeep Kiran Sarvepalli
Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the communication cost during secret recovery. In this paper, we introduce a general class of communication efficient quantum secret sharing schemes (CE-QSS) which include both threshold and non-threshold schemes. We propose a framework for constructing CE-QSS schemes to generalize the earlier construction of CE-QTS schemes which was based on the staircase codes. The main component in this framework is a class of quantum codes which we call the extended Calderbank-Shor-Steane codes. These extended CSS codes could have other applications. We derive a bound on communication cost for CE-QSS schemes. Finally, we provide a construction of CE-QSS schemes meeting this bound using the proposed framework.
{"title":"Communication Efficient Quantum Secret Sharing via Extended CSS Codes","authors":"Kaushik Senthoor;Pradeep Kiran Sarvepalli","doi":"10.1109/JSAC.2024.3380082","DOIUrl":"10.1109/JSAC.2024.3380082","url":null,"abstract":"Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the communication cost during secret recovery. In this paper, we introduce a general class of communication efficient quantum secret sharing schemes (CE-QSS) which include both threshold and non-threshold schemes. We propose a framework for constructing CE-QSS schemes to generalize the earlier construction of CE-QTS schemes which was based on the staircase codes. The main component in this framework is a class of quantum codes which we call the extended Calderbank-Shor-Steane codes. These extended CSS codes could have other applications. We derive a bound on communication cost for CE-QSS schemes. Finally, we provide a construction of CE-QSS schemes meeting this bound using the proposed framework.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140329155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-29DOI: 10.1109/JSAC.2024.3402896
{"title":"TechRxiv: Share Your Preprint Research With the World!","authors":"","doi":"10.1109/JSAC.2024.3402896","DOIUrl":"10.1109/JSAC.2024.3402896","url":null,"abstract":"","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10541320","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141177599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Precision medicine applications supported by nanotechnologies enforce designing a communication interface between in-body nanosensors and external gateways. Such a communication interface will enable both a data and a control channel between nanodevices operating within the human body and external control units. In this direction, recent literature focuses on deriving analytic channel models for intra-body links through the human tissues, including the analysis of achievable communication capacities in the terahertz band. A yet missing component, however, is a synchronization module to implement communication schemes in the intra-body link. Such synchronization module will ultimately bound the communication performance regarding the perceived signal to noise ratio (SNR) and bit error rate (BER), for instance. This paper contributes to the state of the art in two directions: (a) evaluating the bounds on the communication performance with the Cramer-Rao lower bound (CRLB) for the synchronization symbol timing offset (STO) and (b) designing a low-complex mechanism to synchronize communication. This analysis considers a communication link between external gateways located on the skin and nanosensor devices flowing in the human vessels. Using envelope and slope detectors, we devise a low-complex solution that relies on the received signal strength (RSS) metric to trigger data emissions. The method estimates the peak of the received RSS metric to ignite communication in the most favorable location, i.e., when the nanosensor is located at the shortest distance in the communication range with external gateways. Our findings illustrate the feasibility of such a low-complex synchronization method. Performance illustrates a BER less than $1times 10^{-5}$ for those nanosensors traveling close to the upper vessel wall.
{"title":"Low-Complex Synchronization Method for Intra-Body Links in the Terahertz Band","authors":"Jorge Torres Gómez;Jennifer Simonjan;Falko Dressler","doi":"10.1109/JSAC.2024.3399255","DOIUrl":"10.1109/JSAC.2024.3399255","url":null,"abstract":"Precision medicine applications supported by nanotechnologies enforce designing a communication interface between in-body nanosensors and external gateways. Such a communication interface will enable both a data and a control channel between nanodevices operating within the human body and external control units. In this direction, recent literature focuses on deriving analytic channel models for intra-body links through the human tissues, including the analysis of achievable communication capacities in the terahertz band. A yet missing component, however, is a synchronization module to implement communication schemes in the intra-body link. Such synchronization module will ultimately bound the communication performance regarding the perceived signal to noise ratio (SNR) and bit error rate (BER), for instance. This paper contributes to the state of the art in two directions: (a) evaluating the bounds on the communication performance with the Cramer-Rao lower bound (CRLB) for the synchronization symbol timing offset (STO) and (b) designing a low-complex mechanism to synchronize communication. This analysis considers a communication link between external gateways located on the skin and nanosensor devices flowing in the human vessels. Using envelope and slope detectors, we devise a low-complex solution that relies on the received signal strength (RSS) metric to trigger data emissions. The method estimates the peak of the received RSS metric to ignite communication in the most favorable location, i.e., when the nanosensor is located at the shortest distance in the communication range with external gateways. Our findings illustrate the feasibility of such a low-complex synchronization method. Performance illustrates a BER less than \u0000<inline-formula> <tex-math>$1times 10^{-5}$ </tex-math></inline-formula>\u0000 for those nanosensors traveling close to the upper vessel wall.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141159506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-27DOI: 10.1109/JSAC.2024.3380096
Wojciech Kozlowski;Fernando A. Kuipers;Rob Smets;Belma Turkovic
Quantum entanglement is so fundamentally different from a network packet that several quantum network stacks have been proposed; one of which has even been experimentally demonstrated. Several simulators have also been developed to make up for limited hardware availability, and which facilitate the design and evaluation of quantum network protocols. However, the lack of shared tooling and community-agreed node architectures has resulted in protocol implementations that are tightly coupled to their simulators. Besides limiting their reusability between different simulators, it also makes building upon prior results and simulations difficult. To address this problem, we have developed QuIP: a P4-based Quantum Internet Protocol prototyping framework for quantum network protocol design. QuIP is a framework for designing and implementing quantum network protocols in a platform-agnostic fashion. It achieves this by providing the means to flexibly, but rigorously, define device architectures against which quantum network protocols can be implemented in the network programming language $text{P}4_{16}$ . QuIP also comes with the necessary tooling to enable their execution in existing quantum network simulators. We demonstrate its use by showcasing V1Quantum, a completely new device architecture, implementing a link- and network-layer protocol, and simulating it in the existing simulator NetSquid.
{"title":"QuIP: A P4 Quantum Internet Protocol Prototyping Framework","authors":"Wojciech Kozlowski;Fernando A. Kuipers;Rob Smets;Belma Turkovic","doi":"10.1109/JSAC.2024.3380096","DOIUrl":"10.1109/JSAC.2024.3380096","url":null,"abstract":"Quantum entanglement is so fundamentally different from a network packet that several quantum network stacks have been proposed; one of which has even been experimentally demonstrated. Several simulators have also been developed to make up for limited hardware availability, and which facilitate the design and evaluation of quantum network protocols. However, the lack of shared tooling and community-agreed node architectures has resulted in protocol implementations that are tightly coupled to their simulators. Besides limiting their reusability between different simulators, it also makes building upon prior results and simulations difficult. To address this problem, we have developed QuIP: a P4-based Quantum Internet Protocol prototyping framework for quantum network protocol design. QuIP is a framework for designing and implementing quantum network protocols in a platform-agnostic fashion. It achieves this by providing the means to flexibly, but rigorously, define device architectures against which quantum network protocols can be implemented in the network programming language \u0000<inline-formula> <tex-math>$text{P}4_{16}$ </tex-math></inline-formula>\u0000. QuIP also comes with the necessary tooling to enable their execution in existing quantum network simulators. We demonstrate its use by showcasing V1Quantum, a completely new device architecture, implementing a link- and network-layer protocol, and simulating it in the existing simulator NetSquid.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10482892","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140310533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-26DOI: 10.1109/JSAC.2024.3380094
Kenneth Goodenough;Sébastian de Bone;Vaishnavi Addala;Stefan Krastanov;Sarah Jansen;Dion Gijswijt;David Elkouss
Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increased overhead. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs using bilocal Clifford operations, a single round of communication and a possible final local operation depending on the observed measurement outcomes. In the case of permutationally invariant depolarizing noise on the input states, we find a correspondence between these distillation protocols and graph codes. We leverage this correspondence to find provably optimal distillation protocols in this class for several tasks important for the quantum internet. This correspondence allows us to investigate use cases for so-called non-trivial measurement syndromes. Furthermore, we detail a recipe to construct the circuit used for the distillation protocol given a graph code. We use this to find circuits of short depth and small number of two-qubit gates. Additionally, we develop a black-box circuit optimization algorithm, and find that both approaches yield comparable circuits. Finally, we investigate the teleportation of encoded states and find protocols which jointly improve the rate and fidelities with respect to prior art.
{"title":"Near-Term n to k Distillation Protocols Using Graph Codes","authors":"Kenneth Goodenough;Sébastian de Bone;Vaishnavi Addala;Stefan Krastanov;Sarah Jansen;Dion Gijswijt;David Elkouss","doi":"10.1109/JSAC.2024.3380094","DOIUrl":"10.1109/JSAC.2024.3380094","url":null,"abstract":"Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increased overhead. We consider here an experimentally relevant class of distillation protocols, which distill \u0000<inline-formula> <tex-math>$n$ </tex-math></inline-formula>\u0000 to \u0000<inline-formula> <tex-math>$k$ </tex-math></inline-formula>\u0000 end-to-end entangled pairs using bilocal Clifford operations, a single round of communication and a possible final local operation depending on the observed measurement outcomes. In the case of permutationally invariant depolarizing noise on the input states, we find a correspondence between these distillation protocols and graph codes. We leverage this correspondence to find provably optimal distillation protocols in this class for several tasks important for the quantum internet. This correspondence allows us to investigate use cases for so-called non-trivial measurement syndromes. Furthermore, we detail a recipe to construct the circuit used for the distillation protocol given a graph code. We use this to find circuits of short depth and small number of two-qubit gates. Additionally, we develop a black-box circuit optimization algorithm, and find that both approaches yield comparable circuits. Finally, we investigate the teleportation of encoded states and find protocols which jointly improve the rate and fidelities with respect to prior art.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10479665","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140303452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-25DOI: 10.1109/JSAC.2024.3380089
Maria Flors Mor-Ruiz;Wolfgang Dür
We consider entanglement-based quantum networks, where multipartite entangled resource states are distributed and stored among the nodes and locally manipulated upon request to establish the desired target configuration. Separating the generation process from the requests enables a pre-preparation of resources, hence a reduced network latency. It also allows for an optimization of the entanglement topology, which is independent of the underlying network geometry. We concentrate on establishing Bell pairs or tripartite GHZ states between arbitrary parties. We study the influence of noise in this process, where we consider imperfections in state preparation, memories, and measurements - all of which can be modeled by local depolarizing noise. We compare different resource states corresponding to linear chains, trees, or multi-dimensional rectangular clusters, as well as centralized topologies using bipartite or tripartite entangled states. We compute the fidelity of the target states using a recently established efficient method, the noisy stabilizer formalism, and identify the best resource states within these classes. This allows us to treat networks of large size containing millions of nodes. We find that in large networks, high-dimensional cluster states are favorable and lead to a significantly higher target state fidelity.
{"title":"Influence of Noise in Entanglement-Based Quantum Networks","authors":"Maria Flors Mor-Ruiz;Wolfgang Dür","doi":"10.1109/JSAC.2024.3380089","DOIUrl":"10.1109/JSAC.2024.3380089","url":null,"abstract":"We consider entanglement-based quantum networks, where multipartite entangled resource states are distributed and stored among the nodes and locally manipulated upon request to establish the desired target configuration. Separating the generation process from the requests enables a pre-preparation of resources, hence a reduced network latency. It also allows for an optimization of the entanglement topology, which is independent of the underlying network geometry. We concentrate on establishing Bell pairs or tripartite GHZ states between arbitrary parties. We study the influence of noise in this process, where we consider imperfections in state preparation, memories, and measurements - all of which can be modeled by local depolarizing noise. We compare different resource states corresponding to linear chains, trees, or multi-dimensional rectangular clusters, as well as centralized topologies using bipartite or tripartite entangled states. We compute the fidelity of the target states using a recently established efficient method, the noisy stabilizer formalism, and identify the best resource states within these classes. This allows us to treat networks of large size containing millions of nodes. We find that in large networks, high-dimensional cluster states are favorable and lead to a significantly higher target state fidelity.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10479180","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140291561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We study the problem of operating a quantum switch with memory constraints. In particular, the switch has to allocate quantum memories to clients to generate link-level entanglements (LLEs), and then use these to serve end-to-end entanglements requests. The paper’s main contributions are (i) to characterize the switch’s capacity region and study how it scales with respect to the number of quantum memories and probability of successful LLEs and (ii) to propose a memory allocation policy that is throughput optimal. In addition, when the requests are bipartite and the LLE attempts are always successful, we show that the proposed policy has polynomial time complexity. We evaluate the proposed policy numerically and illustrate its performance depending on the requests arrivals characteristics and the time available to obtain a memory allocation.
我们研究了在内存受限的情况下运行量子交换机的问题。特别是，交换机必须为客户端分配量子存储器以生成链路层纠缠（LLE），然后利用这些存储器为端到端纠缠请求提供服务。本文的主要贡献在于：(i) 描述了交换机的容量区域，并研究了它如何随量子存储器的数量和 LLE 成功概率而扩展；(ii) 提出了一种吞吐量最优的存储器分配策略。此外，当请求是双向的且 LLE 尝试总是成功时，我们证明所提出的策略具有多项式时间复杂性。我们对提出的策略进行了数值评估，并根据请求到达特征和获得内存分配的可用时间说明了该策略的性能。
{"title":"Maximizing Entanglement Rates via Efficient Memory Management in Flexible Quantum Switches","authors":"Panagiotis Promponas;Víctor Valls;Saikat Guha;Leandros Tassiulas","doi":"10.1109/JSAC.2024.3380097","DOIUrl":"10.1109/JSAC.2024.3380097","url":null,"abstract":"We study the problem of operating a quantum switch with memory constraints. In particular, the switch has to allocate quantum memories to clients to generate link-level entanglements (LLEs), and then use these to serve end-to-end entanglements requests. The paper’s main contributions are (i) to characterize the switch’s capacity region and study how it scales with respect to the number of quantum memories and probability of successful LLEs and (ii) to propose a memory allocation policy that is throughput optimal. In addition, when the requests are bipartite and the LLE attempts are always successful, we show that the proposed policy has polynomial time complexity. We evaluate the proposed policy numerically and illustrate its performance depending on the requests arrivals characteristics and the time available to obtain a memory allocation.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140192532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：