Results 11 to 20 of about 11,415 (199)
Single-shot fault-tolerant quantum error correction [PDF]
, 2015 Conventional quantum error correcting codes require multiple rounds of measurements to detect errors with enough confidence in fault-tolerant scenarios. Here I show that for suitable topological codes a single round of local measurements is enough.
Bombin, H.
core +9 more sources
Fault-Tolerant Partition Resolvability of Cyclic Networks
Journal 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 Metric Dimension (FTMD) of M-polynomial of Zigzag Edge Coronoid Fused by Starphene
, 2023 Abstract The application of graph invariants serves as a valuable tool for analyzing the complex structures of molecular graphs, attracting researchers across various fields. Graph theory has played a pivotal role in explaining chemical structures and finding practical applications.
Umar Farooq +3 more
openaire +1 more source
Sequential Circuit Design for Embedded Cryptographic Applications Resilient to Adversarial Faults [PDF]
, 2007 In the relatively young field of fault-tolerant cryptography, the main research effort has focused exclusively on the protection of the data path of cryptographic circuits.
Gaubatz, Gunnar +3 more
core +4 more sources
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree [PDF]
, 2015 postprin
Chan, HTH, LI, M, NING, L
core +1 more source
On the Error Resilience of Ordered Binary Decision Diagrams [PDF]
, 2014 Ordered Binary Decision Diagrams (OBDDs) are a data structure that is used in an increasing number of fields of Computer Science (e.g., logic synthesis, program verification, data mining, bioinformatics, and data protection) for representing and ...
Bernasconi, Anna +2 more
core +3 more sources
Fault-tolerant basis and fault-tolerant edge basis of three classes of French windmill graphs
Ain Shams Engineering JournalA resolving set is a subset of vertices that uniquely identifies every vertex based on distances. A fault-tolerant resolving set maintains this condition under any single-vertex removal, and the minimum size of such a set is the fault-tolerant metric ...
S. Prabhu +3 more
doaj +1 more source
Fault-tolerant additive weighted geometric spanners
, 2019 Let S be a set of n points and let w be a function that assigns non-negative weights to points in S. The additive weighted distance d_w(p, q) between two points p,q belonging to S is defined as w(p) + d(p, q) + w(q) if p \ne q and it is zero if p = q ...
A Czumaj +7 more
core +1 more source
Maximum gradient embeddings and monotone clustering
, 2009 Let (X,d_X) be an n-point metric space. We show that there exists a distribution D over non-contractive embeddings into trees f:X-->T such that for every x in X, the expectation with respect to D of the maximum over y in X of the ratio d_T(f(x),f(y ...
A. Gupta +34 more
core +2 more sources
Kerdock Codes Determine Unitary 2-Designs [PDF]
, 2019 The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length $N = 2^m$ over $\mathbb{Z}_4$. We show that exponentiating these $\mathbb{Z}_4$-valued codewords by $\imath \triangleq \sqrt{-1}$ produces ...
Calderbank, Robert +3 more
core +2 more sources