Adaptive compensation of uncertain Euler–Lagrange systems with multiple time-varying actuator faults

This work proposes the command tracking problem for uncertain Euler–Lagrange (EL) systems with multiple partial loss of effectiveness (PLOE) actuator faults. Compared to existing fault-tolerant controllers for EL systems, the proposed adaptive controller accounts for parametric uncertainties in the system and multiple time-varying actuator fault parameters. The proposed method can also handle an infinite number of fault cases. The closed-loop fault-tolerant system is treated as a switched dynamical system, and a switched system stability is established using multiple Lyapunov functions. It is shown that all signals are bounded in each sub-interval and at the switching instances, and asymptotic tracking can be obtained only for a finite number of fault occurrences, whereas tracking error is bounded for the infinite case. Finally, a simulation example on a robotic manipulator is presented to show the effectiveness of the proposed method.     

1-vertex-fault-tolerant cycles embedding on folded hypercubes

In this paper, we focus on a hypercube-like structure, the folded hypercube, which is basically a standard hypercube with some extra links between its nodes. Let f be a faulty vertex in an n-dimensional folded hypercube FQ_n. We show that FQ_n−{f} contains a fault-free cycle of every even length from 4 to 2ⁿ−2 if n≥3 and, furthermore, every odd length from n+1 to 2ⁿ−1 if n≥2 and n is even.     

Quantum computation with Turaev-Viro codes

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev’s toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.