Survey of control performance in quantum information processing

There is a rich variety of physics underlying the fundamental gating operations for quantum information processing (QIP). A key aspect of a QIP system is how noise may enter during quantum operations and how suppressing or correcting its effects can best be addressed. Quantum control techniques have been developed to specifically address this effort, although a detailed classification of the compatibility of controls schemes with noise sources found in common quantum systems has not yet been performed. This work numerically examines the performance of modern control methods for suppressing decoherence in the presence of noise forms found in viable quantum systems. The noise-averaged process matrix for controlled one-qubit and two-qubit operations are calculated across noise found in systems driven by Markovian open quantum dynamics. Rather than aiming to describe the absolute best control scheme for a given physical circumstance, this work serves instead to classify quantum control behavior across a large class of noise forms so that opportunities for improving QIP performance may be identified.     

Quantum state transfer between an optomechanical cavity and a diamond nuclear spin ensemble

We explore an efficient scheme for transferring quantum state between an optomechanical cavity and nuclear spins of nitrogen-vacancy centers in diamond, where quantum information can be efficiently stored (retrieved) into (from) the nuclear spin ensemble assisted by a mechanical resonator in a dispersive regime. Our scheme works for a broad range of cavity frequencies and might have potential applications in employing the nuclear spin ensemble as a memory in quantum information processing. The feasibility of our protocol is analyzed using currently available parameters.     

A modular designed bolt tightening shaft based on adaptive fuzzy backstepping control

This paper presents a modular designed autonomous bolt tightening shaft system with an adaptive fuzzy backstepping control approach developed for it. The bolt tightening shaft is designed for the autonomous bolt tightening operation, which has huge potential for industry application. Due to the inherent nonlinear and uncertain properties, the bolt tightening shaft and the bolt tightening process are mathematically modeled as an uncertain strict feedback system. With the adaptive backstepping and approximation property of fuzzy logic system, the controller is recursively designed. Based on the Lyapunov stability theorem, all signals in the closed-loop system are proved to be uniformly ultimately bounded and the torque tracking error exponentially converges to a small residue. And the effectiveness and performance of the proposed autonomous system are verified by the simulation and experiment results on the bolt tightening shaft system.     

Positive <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>-gain filter design for positive continuous-time Markovian jump systems with partly known transition rates

The paper is concerned with the problem of positive L ₁-gain filter design for positive continuous-time Markovian jump systems with partly known transition rates. Our aim is to design a positive full-order filter such that the corresponding filtering error system is positive and stochastically stable with L ₁-gain performance. By applying a linear co-positive Lyapunov function and free-connection weighting vectors, the desired positive L ₁-gain filter is provided. The obtained theoretical results are demonstrated by numerical examples.     

Automatisches Sicherheitstesten

Moderne Testgeneratoren finden Schwachstellen in Eingabeschnittstellen von Programmen, indem sie in Sekunden tausende Eingaben zufällig erzeugen. Die Werkzeuge lassen sich leicht von jedermann einsetzen–zum Angriff oder zur Verteidigung.     

Secure three-party computational protocols for triangle area

In this work, we have put forth two different protocols to address a concrete secure multi-party computational (MPC) problem related to a triangle, of which the coordinates of the three vertices are confidentially kept by the three participants, respectively. The three parties wish to collaboratively compute the area of this triangle while preserving their own coordinate privacy. As one of the merits, our protocols employ weaker assumptions of the existence of pseudorandom generators. In particular, unlike massive secure MPC protocols that rely a lot on oblivious transfer, ours utilize a new computing idea called “pseudorandom-then-rounding” method to avoid this burdensome obstacle. The two protocols are based on different theorems, while they both make use of the same underlying idea. At last, we provide a detailed proof for the first protocol by a series of security reductions of our newly defined games, which seems somewhat stronger than the previous simulation-based proofs and a proof sketch for the second one. Analysis and discussion about the reasons are provided as well to round off our work.     

Practical chosen-ciphertext secure Hierarchical Identity-Based Broadcast Encryption

We focus on practical Hierarchical Identity-Based Broadcast Encryption (HIBBE) with semantic security against adaptively chosen-ciphertext attacks (CCA2) in the standard model. We achieve this goal in two steps. First, we propose a new HIBBE scheme that is secure against chosen-plaintext attacks (CPA). Compared with the existing HIBBE scheme that is built from composite-order bilinear groups, our construction is based on prime-order bilinear groups. The much better efficiency of group operations in prime-order bilinear groups makes our proposed HIBBE scheme more practical. Then, we convert it into a CCA2-secure scheme at the cost of a one-time signature. Instead of extending one user hierarchy in the Canetti–Halevi–Katz approach from CPA-secure (\(l+1\))-Hierarchical Identity-Based Encryption [(\(l+1\))-HIBE] to CCA2-secure \(l\)-HIBE, our construction merely adds one on-the-fly dummy user in the basic scheme. We formally prove the security of these two schemes in the standard model. Comprehensive theoretical analyses and experimental results demonstrate that the proposed HIBBE schemes achieve desirable performance.     

Contract-based verification of discrete-time multi-rate Simulink models

This paper presents an approach to modular contract-based verification of discrete-time multi-rate Simulink models. The verification approach uses a translation of Simulink models to sequential programs that can then be verified using traditional software verification techniques. Automatic generation of the proof obligations needed for verification of correctness with respect to contracts, and automatic proofs are also discussed. Furthermore, the paper provides detailed discussions about the correctness of each step in the verification process. The verification approach is demonstrated on a case study involving control software for prevention of pressure peaks in hydraulics systems.     

Mesh-free canonical tensor products for six-dimensional density matrix: computation of kinetic energy

The computation of a six-dimensional density matrix is the crucial step for the evaluation of kinetic energy in electronic structure calculations. For molecules with heavy nuclei, one has to consider a very refined mesh in order to deal with the nuclear cusps. This leads to high computational time and needs huge memory for the computation of the density matrix. To reduce the computational complexity and avoid discretization errors in the approximation, we use mesh-free canonical tensor products in electronic structure calculations. In this paper, we approximate the six-dimensional density matrix in an efficient way and then compute the kinetic energy. Accuracy is examined by comparing our computed kinetic energy with the exact computation of the kinetic energy.