Results 31 to 40 of about 15,978 (240)

Computation of Edge Resolvability of Benzenoid Tripod Structure

open access: yesJournal of Mathematics, 2021
In chemistry, graphs are commonly used to show the structure of chemical compounds, with nodes and edges representing the atom and bond types, respectively.
Ali Ahmad   +4 more
doaj   +1 more source

Universal Fault-Tolerant Computation on Decoherence-Free Subspaces [PDF]

open access: yes, 2000
A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs with the ...
A. M. Steane   +27 more
core   +2 more sources

Model Prediction-Based Approach to Fault Tolerant Control with Applications [PDF]

open access: yes, 2013
— 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

Enhanced fault-tolerant quantum computing in $d$-level systems [PDF]

open access: yes, 2014
Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford gate.
Campbell, Earl T.
core   +2 more sources

Fault-Tolerant Partition Resolvability of Cyclic Networks

open access: yesJournal of Mathematics, 2021
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

open access: yesIEEE Access, 2022
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

Fault-Tolerant Metric Dimension of Cube of Paths

open access: yesJournal of Physics: Conference Series, 2021
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

Optimal Multi-Level Fault-Tolerant Resolving Sets of Circulant Graph C(n : 1, 2)

open access: yesMathematics, 2023
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

Good Quantum Convolutional Error Correction Codes And Their Decoding Algorithm Exist [PDF]

open access: yes, 1998
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

Fault-Tolerant Resolvability of Swapped Optical Transpose Interconnection System

open access: yesJournal of Mathematics, 2022
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

Home - About - Disclaimer - Privacy