Secret Addressing Scheme using Distributed Quantum Computing

Within the evolving landscape of confidential and trustworthy computing, this paper delves into the prevalent challenges such as secrecy or privacy associated with existing addressing schemes. Taking these issues into consideration, we propose a novel solution, drawing inspiration from distributed quantum computing algorithms, to generate a secret addressing scheme. The objective is to enhance the confidentiality and reliability of computing systems. This proposed solution, inspired from quantum phase estimation (QPE), assigns a unique and confidential address to each node in a network. It also dynamically adapts to changes in the network or system configurations by using the proposed QPE-inspired approach for every new incoming node in the network. We have implemented our solution on a quantum network simulator, namely NetSquid, to assess the effectiveness of our proposed solution under varying conditions, including scenarios with and without noise models. The simulation results of our proposed solution demonstrate both scalability (e.g ., it takes 34.5ns to address a single computing node with a 3-bit address and 230ns with up to 20-bit addresses) and accuracy (e.g ., success probability of intended address distribution without noises is 100% and with mild noises it is roughly 80%). Our proposed solution effectively handles the growth of the network while ensuring a consistently high level of accuracy.

Authors

Institutions

Publication Details

Published
2024-09-15
DOI
https://doi.org/10.1109/qce60285.2024.00203
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Secret Addressing Scheme using Distributed Quantum Computing

Anne Broadbent, Mbarka Soualhia, Jyoti Faujdar, Muhammad Asad Ullah
Quantum Computing Algorithms and Architecture
article

Secret Addressing Scheme using Distributed Quantum Computing

Anne Broadbent, Mbarka Soualhia, Jyoti Faujdar, Muhammad Asad Ullah
article en

Abstract

Within the evolving landscape of confidential and trustworthy computing, this paper delves into the prevalent challenges such as secrecy or privacy associated with existing addressing schemes. Taking these issues into consideration, we propose a novel solution, drawing inspiration from distributed quantum computing algorithms, to generate a secret addressing scheme. The objective is to enhance the confidentiality and reliability of computing systems. This proposed solution, inspired from quantum phase estimation (QPE), assigns a unique and confidential address to each node in a network. It also dynamically adapts to changes in the network or system configurations by using the proposed QPE-inspired approach for every new incoming node in the network. We have implemented our solution on a quantum network simulator, namely NetSquid, to assess the effectiveness of our proposed solution under varying conditions, including scenarios with and without noise models. The simulation results of our proposed solution demonstrate both scalability (e.g ., it takes 34.5ns to address a single computing node with a 3-bit address and 230ns with up to 20-bit addresses) and accuracy (e.g ., success probability of intended address distribution without noises is 100% and with mild noises it is roughly 80%). Our proposed solution effectively handles the growth of the network while ensuring a consistently high level of accuracy.

Ericsson (Sweden) (SE), University of Ottawa (CA), Ericsson (Canada) (CA)
Openalex Percentile: Top 77%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.