A new relativistic orthogonal states quantum key distribution protocol. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. We introduce a new relativistic orthogonal states quantum key distribution protocol which leverages the properties of both quantum mechanics and special relativity to securely encode multiple bits onto the ...

A new relativistic orthogonal states quantum key distribution protocol. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. We introduce a new relativistic orthogonal states quantum key distribution protocol which leverages the properties of both quantum mechanics and special relativity to securely encode multiple bits onto the ...

Orthogonal matrix has shown advantages in training Recurrent Neural Networks (RNNs), but such matrix is limited to be square for the hidden-to-hidden transformation in RNNs. In this paper, we generalize such square orthogonal matrix to orthogonal rectangular matrix and formulating this problem in feedforward Neural Networks (FNNs) as Optimization over Multiple Dependent Stiefel Manifolds (OMDSM...

Abstract. The distribution function for the first eigenvalue spacing in the Laguerre unitary ensemble of finite rank random matrices is found in terms of a Painlevé V system, and the solution of its associated linear isomonodromic system. In particular it is characterised by the polynomial solutions to the isomonodromic equations which are also orthogonal with respect to a deformation of the La...

A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function’s higher order derivatives. The class includes the size and zero bias transformations, and when specializing to weighting by polynomial functions, relates dis...

An orthogonal double cover (ODC) of the complete graph Kn by some graph G is a collection of n spanning subgraphs of Kn, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kn is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n− 1 edges. We show that for any given positive integer d, al...

This paper describes the application of a combined orthogonal array design and overlapping resolution mapping to the optimization of miceller electrokinetic chromatography for the separation of 10 substituted benzenes. The most important factors were first determined according to an OA16(2(15)) through 16 pre-designed experiments; a second set of experiments was carried out according to a trian...

Saccharomyces cerevisiae (baker’s yeast) can exhibit sustained oscillations during the operation in a continuous bioreactor that adversely affects its stability and productivity. Because of heterogeneous nature of cell populations, the cell population balance equation (PBE) can be used to capture the dynamic behavior of such cultures. In this work, an unstructured-segregated model is used f...