SearcharxivSearch

arXiv subjects

Erik Hostens

Publications and source records attributed to Erik Hostens.

6 recordsLinked to original sources

Neural Network Augmented Physics Models for Systems with Partially Unknown Dynamics: Application to Slider-Crank Mechanism

Dynamic models of mechatronic systems are abundantly used in the context of motion control and design of complex servo applications. In practice, these systems are often plagued by unknown interactions, which make the physics-based relations of the system dynamics only partially known. This paper presents a neural network augmented physics (NNAP) model as a combination of physics-inspired and neural layers. The neural layers are inserted in the model to compensate for the unmodeled interactions, without requiring direct measurements of these unknown phenomena. In contrast to traditional approaches, both the neural network and physical parameters are simultaneously optimized, solely by using state and control input measurements. The methodology is applied on experimental data of a slider-crank setup for which the state dependent load interactions are unknown. The NNAP model proves to be a stable and accurate modeling formalism for dynamic systems that ab initio can only be partially described by physical laws. Moreover, the results show that a recurrent implementation of the NNAP model enables improved robustness and accuracy of the system state predictions, compared to its feedforward counterpart. Besides capturing the system dynamics, the NNAP model provides a means to gain new insights by extracting the neural network from the converged NNAP model. In this way, we discovered accurate representations of the unknown spring force interaction and friction phenomena acting on the slider mechanism.

eess.SY

Stabilizer state breeding

We present a breeding protocol that distills pure copies of any stabilizer state from noisy copies and a pool of predistilled pure copies of the same state, by means of local Clifford operations, Pauli measurements and classical communication.

quant-ph

Asymptotic adaptive bipartite entanglement distillation protocol

We present a new asymptotic bipartite entanglement distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like breeding, the protocol starts with an infinite number of copies of a Bell-diagonal mixed state. Breeding can be carried out as successive stages of partial information extraction, yielding the same result: one bit of information is gained at the cost (measurement) of one pure Bell state pair (ebit). The basic principle of our protocol is at every stage to replace measurements on ebits by measurements on a finite number of copies, whenever there are two equiprobable outcomes. In that case, the entropy of the global state is reduced by more than one bit. Therefore, every such replacement results in an improvement of the protocol. We explain how our protocol is organized as to have as many replacements as possible. The yield is then calculated for Werner states.

quant-ph

Hashing protocol for distilling multipartite CSS states

We present a hashing protocol for distilling multipartite CSS states by means of local Clifford operations, Pauli measurements and classical communication. It is shown that this hashing protocol outperforms previous versions by exploiting information theory to a full extent an not only applying CNOTs as local Clifford operations. Using the information-theoretical notion of a strongly typical set, we calculate the asymptotic yield of the protocol as the solution of a linear programming problem.

quant-ph

Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic

We describe generalizations of the Pauli group, the Clifford group and stabilizer states for qudits in a Hilbert space of arbitrary dimension d. We examine a link with modular arithmetic, which yields an efficient way of representing the Pauli group and the Clifford group with matrices over the integers modulo d. We further show how a Clifford operation can be efficiently decomposed into one and two-qudit operations. We also focus in detail on standard basis expansions of stabilizer states.

quant-ph