arXiv subjects

Ruidong Li

Publications and source records attributed to Ruidong Li.

At least 37 records · Page 2Linked to original sources

arXiv2024

Selective-Area-Grown PbTe-Pb Planar Josephson Junctions for Quantum Devices

Planar Josephson junctions are predicted to host Majorana zero modes. The material platforms in previous studies are two dimensional electron gases (InAs, InSb, InAsSb and HgTe) coupled to a superconductor such as Al or Nb. Here, we introduce a new material platform for planar JJs, the PbTe-Pb hybrid. The semiconductor, PbTe, was grown as a thin film via selective area epitaxy. The Josephson junction was defined by a shadow wall during the deposition of the superconductor Pb. Scanning transmission electron microscopy reveals a sharp semiconductor-superconductor interface. Gate-tunable supercurrent and multiple Andreev reflections are observed. A perpendicular magnetic field causes interference patterns of the switching current, exhibiting Fraunhofer-like and SQUID-like behaviors. We further demonstrate a prototype device for Majorana detection, wherein phase bias and tunneling spectroscopy are applicable.

cond-mat.supr-con↗

arXiv2024

Social-Aware Clustered Federated Learning with Customized Privacy Preservation

A key feature of federated learning (FL) is to preserve the data privacy of end users. However, there still exist potential privacy leakage in exchanging gradients under FL. As a result, recent research often explores the differential privacy (DP) approaches to add noises to the computing results to address privacy concerns with low overheads, which however degrade the model performance. In this paper, we strike the balance of data privacy and efficiency by utilizing the pervasive social connections between users. Specifically, we propose SCFL, a novel Social-aware Clustered Federated Learning scheme, where mutually trusted individuals can freely form a social cluster and aggregate their raw model updates (e.g., gradients) inside each cluster before uploading to the cloud for global aggregation. By mixing model updates in a social group, adversaries can only eavesdrop the social-layer combined results, but not the privacy of individuals. We unfold the design of SCFL in three steps.i) Stable social cluster formation. Considering users' heterogeneous training samples and data distributions, we formulate the optimal social cluster formation problem as a federation game and devise a fair revenue allocation mechanism to resist free-riders. ii) Differentiated trust-privacy mapping}. For the clusters with low mutual trust, we design a customizable privacy preservation mechanism to adaptively sanitize participants' model updates depending on social trust degrees. iii) Distributed convergence}. A distributed two-sided matching algorithm is devised to attain an optimized disjoint partition with Nash-stable convergence. Experiments on Facebook network and MNIST/CIFAR-10 datasets validate that our SCFL can effectively enhance learning utility, improve user payoff, and enforce customizable privacy protection.

cs.CR↗

arXiv2024

Modern Computing: Vision and Challenges

Over the past six decades, the computing systems field has experienced significant transformations, profoundly impacting society with transformational developments, such as the Internet and the commodification of computing. Underpinned by technological advancements, computer systems, far from being static, have been continuously evolving and adapting to cover multifaceted societal niches. This has led to new paradigms such as cloud, fog, edge computing, and the Internet of Things (IoT), which offer fresh economic and creative opportunities. Nevertheless, this rapid change poses complex research challenges, especially in maximizing potential and enhancing functionality. As such, to maintain an economical level of performance that meets ever-tighter requirements, one must understand the drivers of new model emergence and expansion, and how contemporary challenges differ from past ones. To that end, this article investigates and assesses the factors influencing the evolution of computing systems, covering established systems and architectures as well as newer developments, such as serverless computing, quantum computing, and on-device AI on edge devices. Trends emerge when one traces technological trajectory, which includes the rapid obsolescence of frameworks due to business and technical constraints, a move towards specialized systems and models, and varying approaches to centralized and decentralized control. This comprehensive review of modern computing systems looks ahead to the future of research in the field, highlighting key challenges and emerging trends, and underscoring their importance in cost-effectively driving technological progress.

cs.DC↗

arXiv2023

Ballistic PbTe Nanowire Devices

Disorder is the primary obstacle in current Majorana nanowire experiments. Reducing disorder or achieving ballistic transport is thus of paramount importance. In clean and ballistic nanowire devices, quantized conductance is expected with plateau quality serving as a benchmark for disorder assessment. Here, we introduce ballistic PbTe nanowire devices grown using the selective-area-growth (SAG) technique. Quantized conductance plateaus in units of $2e^2/h$ are observed at zero magnetic field. This observation represents an advancement in diminishing disorder within SAG nanowires, as none of the previously studied SAG nanowires (InSb or InAs) exhibit zero-field ballistic transport. Notably, the plateau values indicate that the ubiquitous valley degeneracy in PbTe is lifted in nanowire devices. This degeneracy lifting addresses an additional concern in the pursuit of Majorana realization. Moreover, these ballistic PbTe nanowires may enable the search for clean signatures of the spin-orbit helical gap in future devices.

cond-mat.mes-hall↗

arXiv2023

Hard superconducting gap in PbTe nanowires

Semiconductor nanowires coupled to a superconductor provide a powerful testbed for quantum device physics such as Majorana zero modes and gate-tunable hybrid qubits. The performance of these quantum devices heavily relies on the quality of the induced superconducting gap. A hard gap, evident as vanishing subgap conductance in tunneling spectroscopy, is both necessary and desired. Previously, a hard gap has been achieved and extensively studied in III-V semiconductor nanowires (InAs and InSb). In this study, we present the observation of a hard superconducting gap in PbTe nanowires coupled to a superconductor Pb. The gap size ($Δ$) is $\sim$ 1 meV (maximally 1.3 meV in one device). Additionally, subgap Andreev bound states can also be created and controlled through gate tuning. Tuning a device into the open regime can reveal Andreev enhancement of the subgap conductance, suggesting a remarkable transparent superconductor-semiconductor interface, with a transparency of $\sim$ 0.96. These results pave the way for diverse superconducting quantum devices based on PbTe nanowires.

cond-mat.mes-hall↗

arXiv2023

Collaborative Honeypot Defense in UAV Networks: A Learning-Based Game Approach

The proliferation of unmanned aerial vehicles (UAVs) opens up new opportunities for on-demand service provisioning anywhere and anytime, but also exposes UAVs to a variety of cyber threats. Low/medium interaction honeypots offer a promising lightweight defense for actively protecting mobile Internet of things, particularly UAV networks. While previous research has primarily focused on honeypot system design and attack pattern recognition, the incentive issue for motivating UAV's participation (e.g., sharing trapped attack data in honeypots) to collaboratively resist distributed and sophisticated attacks remains unexplored. This paper proposes a novel game-theoretical collaborative defense approach to address optimal, fair, and feasible incentive design, in the presence of network dynamics and UAVs' multi-dimensional private information (e.g., valid defense data (VDD) volume, communication delay, and UAV cost). Specifically, we first develop a honeypot game between UAVs and the network operator under both partial and complete information asymmetry scenarios. The optimal VDD-reward contract design problem with partial information asymmetry is then solved using a contract-theoretic approach that ensures budget feasibility, truthfulness, fairness, and computational efficiency. In addition, under complete information asymmetry, we devise a distributed reinforcement learning algorithm to dynamically design optimal contracts for distinct types of UAVs in the time-varying UAV network. Extensive simulations demonstrate that the proposed scheme can motivate UAV's cooperation in VDD sharing and improve defensive effectiveness, compared with conventional schemes.

eess.SY↗

arXiv2023

Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions

Over the past few decades, significant progress has been made in quantum information technology, from theoretical studies to experimental demonstrations. Revolutionary quantum applications are now in the limelight, showcasing the advantages of quantum information technology and becoming a research hotspot in academia and industry. To enable quantum applications to have a more profound impact and wider application, the interconnection of multiple quantum nodes through quantum channels becomes essential. Building an entanglement-assisted quantum network, capable of realizing quantum information transmission between these quantum nodes, is the primary goal. However, entanglement-assisted quantum networks are governed by the unique laws of quantum mechanics, such as the superposition principle, the no-cloning theorem, and quantum entanglement, setting them apart from classical networks. Consequently, fundamental efforts are required to establish entanglement-assisted quantum networks. While some insightful surveys have paved the way for entanglement-assisted quantum networks, most of these studies focus on enabling technologies and quantum applications, neglecting critical network issues. In response, this paper presents a comprehensive survey of entanglement-assisted quantum networks. Alongside reviewing fundamental mechanics and enabling technologies, the paper provides a detailed overview of the network structure, working principles, and development stages, highlighting the differences from classical networks. Additionally, the challenges of building wide-area entanglement-assisted quantum networks are addressed. Furthermore, the paper emphasizes open research directions, including architecture design, entanglement-based network issues, and standardization, to facilitate the implementation of future entanglement-assisted quantum networks.

quant-ph↗

arXiv2023

Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing

Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources, such as quantum computers, to perform resource-intensive tasks. Like traditional cloud computing platforms, QCC providers can offer both reservation and on-demand plans for quantum resource provisioning to satisfy users' requirements. However, the fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. Furthermore, in distributed QCC, entanglement routing is a critical component of quantum networks that enables remote entanglement communication between users and QCC providers. Further, maintaining entanglement fidelity in quantum networks is challenging due to the requirement for high-quality entanglement routing, especially when accessing the providers over long distances. To address these challenges, we propose a resource allocation model to provision quantum computing and networking resources. In particular, entangled pairs, entanglement routing, qubit resources, and circuits' waiting time are jointly optimized to achieve minimum total costs. We formulate the proposed model based on the two-stage stochastic programming, which takes into account the uncertainties of fidelity and qubit requirements, and quantum circuits' waiting time. Furthermore, we apply the Benders decomposition algorithm to divide the proposed model into sub-models to be solved simultaneously. Experimental results demonstrate that our model can achieve the optimal total costs and reduce total costs at most 49.43\% in comparison to the baseline model.

quant-ph↗

arXiv2023

SEAL: A Strategy-Proof and Privacy-Preserving UAV Computation Offloading Framework

Due to the limited battery and computing resource, offloading unmanned aerial vehicles (UAVs)' computation tasks to ground infrastructure, e.g., vehicles, is a fundamental framework. Under such an open and untrusted environment, vehicles are reluctant to share their computing resource unless provisioning strong incentives, privacy protection, and fairness guarantee. Precisely, without strategy-proofness guarantee, the strategic vehicles can overclaim participation costs so as to conduct market manipulation. Without the fairness provision, vehicles can deliberately abort the assigned tasks without any punishments, and UAVs can refuse to pay by the end, causing an exchange dilemma. Lastly, the strategy-proofness and fairness provision typically require transparent payment/task results exchange under public audit, which may disclose sensitive information of vehicles and make the privacy preservation a foremost issue. To achieve the three design goals, we propose SEAL, an integrated framework to address strategy-proof, fair, and privacy-preserving UAV computation offloading. SEAL deploys a strategy-proof reverse combinatorial auction mechanism to optimize UAVs' task offloading under practical constraints while ensuring economic-robustness and polynomial-time efficiency. Based on smart contracts and hashchain micropayment, SEAL implements a fair on-chain exchange protocol to realize the atomic completion of batch payments and computing results in multi-round auctions. In addition, a privacy-preserving off-chain auction protocol is devised with the assistance of the trusted processor to efficiently protect vehicles' bid privacy. Using rigorous theoretical analysis and extensive simulations, we validate that SEAL can effectively prevent vehicles from manipulating, ensure privacy protection and fairness, improve the offloading efficiency.

cs.GT↗

arXiv2023

Conductance Quantization in PbTe Nanowires

PbTe nanowires coupled to a superconductor have recently been proposed as a potential Majorana platform. The hallmark of the one-dimensional nature of ballistic nanowires is their quantized conductance. Here, we report the observation of conductance plateaus at multiples of the quantized value $2e^2/h$ in PbTe nanowires at finite magnetic fields. The quantized plateaus, as a function of source-drain bias and magnetic field, allow for the extraction of the Landé $g$-factor, sub-band spacing and effective mass. The coefficient of 2 in the plateau conductance indicates the presence of valley degeneracy arising from the crystal orientation of the nanowires, which are grown on a (001) substrate. Occasionally, this degeneracy can be lifted by a gate voltage that breaks the mirror symmetry. Our results demonstrate the one-dimensionality of PbTe nanowires and fulfill one of the necessary conditions for the realization of Majorana zero modes.

cond-mat.mes-hall↗

arXiv2023

Trade Privacy for Utility: A Learning-Based Privacy Pricing Game in Federated Learning

To prevent implicit privacy disclosure in sharing gradients among data owners (DOs) under federated learning (FL), differential privacy (DP) and its variants have become a common practice to offer formal privacy guarantees with low overheads. However, individual DOs generally tend to inject larger DP noises for stronger privacy provisions (which entails severe degradation of model utility), while the curator (i.e., aggregation server) aims to minimize the overall effect of added random noises for satisfactory model performance. To address this conflicting goal, we propose a novel dynamic privacy pricing (DyPP) game which allows DOs to sell individual privacy (by lowering the scale of locally added DP noise) for differentiated economic compensations (offered by the curator), thereby enhancing FL model utility. Considering multi-dimensional information asymmetry among players (e.g., DO's data distribution and privacy preference, and curator's maximum affordable payment) as well as their varying private information in distinct FL tasks, it is hard to directly attain the Nash equilibrium of the mixed-strategy DyPP game. Alternatively, we devise a fast reinforcement learning algorithm with two layers to quickly learn the optimal mixed noise-saving strategy of DOs and the optimal mixed pricing strategy of the curator without prior knowledge of players' private information. Experiments on real datasets validate the feasibility and effectiveness of the proposed scheme in terms of faster convergence speed and enhanced FL model utility with lower payment costs.

cs.GT↗

arXiv2022

Proximity effect in PbTe-Pb hybrid nanowire Josephson junctions

Semiconductor-superconductor hybrid nanowires are a leading material platform for the realization of Majorana zero modes. The semiconductors in previous studies are dominantly InAs or InSb. In this work, we show the induced superconductivity in a PbTe nanowire epitaxially coupled to a superconductor Pb. The Josephson junction device based on this hybrid reveals a gate-tunable supercurrent in the open regime and a hard superconducting gap in the tunneling regime. By demonstrating the superconducting proximity effect, our result can enable Majorana searches and other applications like gate-tunable qubits in a new semiconductor system.

cond-mat.mes-hall↗

arXiv2022

A Secure and Intelligent Data Sharing Scheme for UAV-Assisted Disaster Rescue

Unmanned aerial vehicles (UAVs) have the potential to establish flexible and reliable emergency networks in disaster sites when terrestrial communication infrastructures go down. Nevertheless, potential security threats may occur on UAVs during data transmissions due to the untrusted environment and open-access UAV networks. Moreover, UAVs typically have limited battery and computation capacity, making them unaffordable for heavy security provisioning operations when performing complicated rescue tasks. In this paper, we develop RescueChain, a secure and efficient information sharing scheme for UAV-assisted disaster rescue. Specifically, we first implement a lightweight blockchain-based framework to safeguard data sharing under disasters and immutably trace misbehaving entities. A reputation-based consensus protocol is devised to adapt the weakly connected environment with improved consensus efficiency and promoted UAVs' honest behaviors. Furthermore, we introduce a novel vehicular fog computing (VFC)-based off-chain mechanism by leveraging ground vehicles as moving fog nodes to offload UAVs' heavy data processing and storage tasks. To offload computational tasks from the UAVs to ground vehicles having idle computing resources, an optimal allocation strategy is developed by choosing payoffs that achieve equilibrium in a Stackelberg game formulation of the allocation problem. For lack of sufficient knowledge on network model parameters and users' private cost parameters in practical environment, we also design a two-tier deep reinforcement learning-based algorithm to seek the optimal payment and resource strategies of UAVs and vehicles with improved learning efficiency. Simulation results show that RescueChain can effectively accelerate consensus process, improve offloading efficiency, reduce energy consumption, and enhance user payoffs.

cs.MA↗

arXiv2022

Plateau regions for zero-bias peaks within 5% of the quantized conductance value $2e^2/h$

Probing an isolated Majorana zero mode is predicted to reveal a tunneling conductance quantized at $2e^2/h$ at zero temperature. Experimentally, a zero-bias peak (ZBP) is expected and its height should remain robust against relevant parameter tuning, forming a quantized plateau. Here, we report the observation of large ZBPs in a thin InAs-Al hybrid nanowire device. The ZBP height can stick close to $2e^2/h$, mostly within $5\%$ tolerance, by sweeping gate voltages and magnetic field. We further map out the phase diagram and identify two plateau regions in the phase space. Despite the presence of disorder and quantum dots, our result constitutes a step forward towards establishing Majorana zero modes.

cond-mat.mes-hall↗

arXiv2022

A Learning-based Honeypot Game for Collaborative Defense in UAV Networks

The proliferation of unmanned aerial vehicles (UAVs) opens up new opportunities for on-demand service provisioning anywhere and anytime, but it also exposes UAVs to various cyber threats. Low/medium-interaction honeypot is regarded as a promising lightweight defense to actively protect mobile Internet of things, especially UAV networks. Existing works primarily focused on honeypot design and attack pattern recognition, the incentive issue for motivating UAVs' participation (e.g., sharing trapped attack data in honeypots) to collaboratively resist distributed and sophisticated attacks is still under-explored. This paper proposes a novel game-based collaborative defense approach to address optimal, fair, and feasible incentive mechanism design, in the presence of network dynamics and UAVs' multi-dimensional private information (e.g., valid defense data (VDD) volume, communication delay, and UAV cost). Specifically, we first develop a honeypot game between UAVs under both partial and complete information asymmetry scenarios. We then devise a contract-theoretic method to solve the optimal VDD-reward contract design problem with partial information asymmetry, while ensuring truthfulness, fairness, and computational efficiency. Furthermore, under complete information asymmetry, we devise a reinforcement learning based distributed method to dynamically design optimal contracts for distinct types of UAVs in the fast-changing network. Experimental simulations show that the proposed scheme can motivate UAV's collaboration in VDD sharing and enhance defensive effectiveness, compared with existing solutions.

cs.GT↗

arXiv2022

Mobile Wireless Rechargeable UAV Networks: Challenges and Solutions

Unmanned aerial vehicles (UAVs) can help facilitate cost-effective and flexible service provisioning in future smart cities. Nevertheless, UAV applications generally suffer severe flight time limitations due to constrained onboard battery capacity, causing a necessity of frequent battery recharging or replacement when performing persistent missions. Utilizing wireless mobile chargers, such as vehicles with wireless charging equipment for on-demand self-recharging has been envisioned as a promising solution to address this issue. In this article, we present a comprehensive study of \underline{v}ehicle-assisted \underline{w}ireless rechargeable \underline{U}AV \underline{n}etworks (VWUNs) to promote on-demand, secure, and efficient UAV recharging services. Specifically, we first discuss the opportunities and challenges of deploying VWUNs and review state-of-the-art solutions in this field. We then propose a secure and privacy-preserving VWUN framework for UAVs and ground vehicles based on differential privacy (DP). Within this framework, an online double auction mechanism is developed for optimal charging scheduling, and a two-phase DP algorithm is devised to preserve the sensitive bidding and energy trading information of participants. Experimental results demonstrate that the proposed framework can effectively enhance charging efficiency and security. Finally, we outline promising directions for future research in this emerging field.

eess.SP↗

arXiv2021

Observation of Aharonov-Bohm effect in PbTe nanowire networks

We report phase coherent electron transport in PbTe nanowire networks with a loop geometry. Magneto-conductance shows Aharonov-Bohm (AB) oscillations with periods of $h/e$ and $h/2e$ in flux. The amplitude of $h/2e$ oscillations is enhanced near zero magnetic field, possibly due to interference between time-reversal paths. Temperature dependence of the AB amplitudes suggests a phase coherence length $\sim$ 8 - 12 $μ$m at 50 mK. This length scale is larger than the typical geometry of PbTe-based hybrid semiconductor-superconductor nanowire devices.

cond-mat.mes-hall↗

arXiv2021

Selective area epitaxy of PbTe-Pb hybrid nanowires on a lattice-matched substrate

Topological quantum computing is based on braiding of Majorana zero modes encoding topological qubits. A promising candidate platform for Majorana zero modes is semiconductor-superconductor hybrid nanowires. The realization of topological qubits and braiding operations requires scalable and disorder-free nanowire networks. Selective area growth of in-plane InAs and InSb nanowires, together with shadow-wall growth of superconductor structures, have demonstrated this scalability by achieving various network structures. However, the noticeable lattice mismatch at the nanowire-substrate interface, acting as a disorder source, imposes a serious obstacle along with this roadmap. Here, combining selective area and shadow-wall growth, we demonstrate the fabrication of PbTe-Pb hybrid nanowires - another potentially promising Majorana system - on a nearly perfectly lattice-matched substrate CdTe, all done in one molecular beam epitaxy chamber. Transmission electron microscopy shows the single-crystal nature of the PbTe nanowire and its atomically sharp and clean interfaces to the CdTe substrate and the Pb overlayer, without noticeable inter-diffusion or strain. The nearly ideal interface condition, together with the strong screening of charge impurities due to the large dielectric constant of PbTe, hold promise towards a clean nanowire system to study Majorana zero modes and topological quantum computing.

cond-mat.mes-hall↗