相关论文: Generalized Measures of Fault Tolerance in Exchang…
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…
In [4] Camps-Moreno et al. treated (relative) generalized Hamming weights of codes from extended norm-trace curves and they gave examples of resulting good asymmetric quantum error-correcting codes employing information on the relative…
Density functionals with a range-separated treatment of the exchange energy are known to improve upon their semilocal forerunners and fixed-fraction hybrids. The conversion of a given semilocal functional into its short-range analog is not…
The connectivity is an important parameter to evaluate the robustness of a network. As a generalization, structure connectivity and substructure connectivity of graphs were proposed. For connected graphs $G$ and $H$, the $H$-structure…
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…
Zhu et al. [Theoret. Comput. Sci. 758 (2019) 1--8] introduced the $h$-edge tolerable diagnosability to measure the fault diagnosis capability of a multiprocessor system with faulty links. This kind of diagnosability is a generalization of…
Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$. We say that $G$ is an $f$-fault-tolerant $t$-spanner for $H$, if the following is true for any subset $F$ of at most $f$ edges of $G$: For any two vertices $p$ and $q$,…
The generalized conductance $\phi(G,H)$ between two graphs $G$ and $H$ on the same vertex set $V$ is defined as the ratio $$ \phi(G,H) = \min_{S\subseteq V} \frac{cap_G(S,\bar{S})}{ cap_H(S,\bar{S})}, $$ where $cap_G(S,\bar{S})$ is the…
We propose a family of surface codes with general lattice structures, where the error-tolerances against bit and phase errors can be controlled asymmetrically by changing the underlying lattice geometries. The surface codes on various…
A natural requirement of many distributed structures is fault-tolerance: after some failures, whatever remains from the structure should still be effective for whatever remains from the network. In this paper we examine spanners of general…
We study a new and stronger notion of fault-tolerant graph structures whose size bounds depend on the degree of the failing edge set, rather than the total number of faults. For a subset of faulty edges $F \subseteq G$, the faulty-degree…
We give some existence/nonexistence statements on universal graphs, which under GCH give a necessary and sufficient condition for the existence of a universal graph of size lambda with no K(kappa), namely, if either kappa is finite or…
Reliability evaluation and fault tolerance of an interconnection network of some parallel and distributed systems are discussed separately under various link-faulty hypotheses in terms of different $\mathcal{P}$-conditional…
Hypercube is one of the most important networks to interconnect processors in multiprocessor computer systems. Different kinds of connectivities are important parameters to measure the fault tolerability of networks. Lin et…
For an interconnection network $G$, the {\it $\omega$-wide diameter} $d_\omega(G)$ is the least $\ell$ such that any two vertices are joined by $\omega$ internally-disjoint paths of length at most $\ell$, and the {\it $(\omega-1)$-fault…
We study one-loop quantum corrections to gauge couplings in heterotic vacua with spontaneous supersymmetry breaking. Although in non-supersymmetric constructions these corrections are not protected and are typically model dependent, we show…
The exchange algorithm is one of the most popular extensions of the Metropolis--Hastings algorithm to sample from doubly-intractable distributions. However, the theoretical exploration of the exchange algorithm is very limited. For example,…
The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. R.X. Hao et al. $(2014)$ \cite{R.X.Hao} showed that there exists a fault-free Hamiltonian path between any two adjacent vertices in $BH_n$ with $(2n-2)$ faulty edges. D.Q.…
A two-party quantum private comparison scheme using GHZ states and error-correcting code (ECC) was introduced in Li et al.'s paper [Int. J. Theor. Phys. 52: 2818-2815, 2013], which holds the capability of fault-tolerate and could be…
As a generalization of the traditional connectivity, the g-component edge connectivity c{\lambda}g(G) of a non-complete graph G is the minimum number of edges to be deleted from the graph G such that the resulting graph has at least g…