Results 31 to 40 of about 15,842 (155)
Fault-Tolerant Partition Resolvability of Cyclic Networks
Graph invariants provide an amazing tool to analyze the abstract structures of networks. The interaction and interconnection between devices, sensors, and service providers have opened the door for an eruption of mobile over the web applications ...
Kamran Azhar +3 more
doaj +1 more source
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
Fault-tolerance of a system measures its working capability in the presence of faulty components in the system. The fault-tolerant partition dimension of a network computes the least number of subcomponents of network required to distinctively identify ...
Kamran Azhar +4 more
doaj +1 more source
What is a quantum computer, and how do we build one? [PDF]
The DiVincenzo criteria for implementing a quantum computer have been seminal in focussing both experimental and theoretical research in quantum information processing.
Kok, Pieter, Perez-Delgado, Carlos A.
core +1 more source
The disjointness of stabilizer codes and limitations on fault-tolerant logical gates [PDF]
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for these codes, the
Jochym-O'Connor, Tomas +2 more
core +5 more sources
Fault-Tolerant Metric Dimension of Cube of Paths
Abstract For a simple connected graph G = (V (G), E(G)), a set R ⊆ V (G) is said to be a resolving set of G if every pair of vertices of G are resolved by some vertices in R i.e., every pair of vertices of G are identified uniquely by some vertex elements in F.
openaire +1 more source
Fault-tolerant edge metric dimension of certain families of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaogang Liu +3 more
openaire +3 more sources
Optimal Multi-Level Fault-Tolerant Resolving Sets of Circulant Graph C(n : 1, 2)
Let G=(V(G),E(G)) be a simple connected unweighted graph. A set R⊂V(G) is called a fault-tolerant resolving set with the tolerance level k if the cardinality of the set Sx,y={w∈R:d(w,x)≠d(w,y)} is at least k for every pair of distinct vertices x,y of G ...
Laxman Saha +4 more
doaj +1 more source
Fault-Tolerant Resolvability of Swapped Optical Transpose Interconnection System
Interconnection systems in computer science and information technology are mainly represented by graphs. One such instance is of swapped network simulated by the optical transpose interconnection system (OTIS).
Iffat Fida Hussain +4 more
doaj +1 more source
Good Quantum Convolutional Error Correction Codes And Their Decoding Algorithm Exist [PDF]
Quantum convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of quantum convolutional code, I report a way to decode certain quantum convolutional codes based on the classical ...
A. Dholakia +30 more
core +2 more sources
Model Prediction-Based Approach to Fault Tolerant Control with Applications [PDF]
— Fault-tolerant control (FTC) is an integral component in industrial processes as it enables the system to continue robust operation under some conditions.
Khalid, Dr. Haris M. +1 more
core +1 more source

