We prove a Egorov theorem, or quantum-classical correspondence, for the quantised baker’s map, valid up to the Ehrenfest time. This yields a logarithmic upper bound for the decay of the quantum variance, and, as a corollary, a quantum ergodic theorem for this map.

We prove a powerful theorem for tripartite remote entanglement distribution protocols that establishes an upper bound on the amount of entanglement of formation that can be created between two single-qubit nodes of a quantum network. Our theorem also provides an operational interpretation of concurrence as a type of entanglement capacity.

In this paper, an upper bound approach is used to analyze the extrusion process of bimetallic rods through arbitrarily curved dies. Based on a spherical velocity field, internal, shearing and frictional power terms are calculated. The developed upper bound solution is used for calculating the extrusion force for two types of die shapes: a conical die as a linear die profile and a streamlined di...

For a fixed number field K, we consider the mean square error in estimating the number of primes with norm congruent to a modulo q by the Chebotarëv Density Theorem when averaging over all q ≤ Q and all appropriate a. Using a large sieve inequality, we obtain an upper bound similar to the Barban-Davenport-Halberstam Theorem.

Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discretetime model of quantum computation, it also holds for continuous-time (or Hamiltonianbased) quantum computation, due to a known equivalence between these two query complexity models. In this work, we revisit this result by providing a direct pr...

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...

A theorem of Hegerfeldt shows that if the spectrum of the Hamiltonian is bounded from below, then the propagation speed of certain probabilities does not have an upper bound. We prove a theorem analogous to Hegerfeldt’s that appertains to asymmetric time evolutions given by a semigroup of operators. As an application, we consider a characterization of relativistic quasistable states by irreduci...

Brègman [2], gave a best possible upper bound for the number of perfect matchings in a balanced bipartite graph in terms of its degree sequence. Recently Kahn and Lovász [8] extended Brègman’s theorem to general graphs. In this paper, we use entropy methods to give a new proof of the Kahn-Lovász theorem. Our methods build on Radhakrishnan’s [9] use of entropy to prove Brègman’s theorem.

although some 3d slope stability algorithms have been proposed in recent three decades, still role of pore pressures in three dimensional slope stability analyses and considering the effects of pore water pressure in 3d slope stability studies needs to be investigated. in this paper, a limit analysis formulation for investigation of role of the pore water pressure in three dimensional slope sta...

We find an upper bound for the entropy of a systolically extremal surface, in terms of its systole. We combine the upper bound with A. Katok’s lower bound in terms of the volume, to obtain a simpler alternative proof of M. Gromov’s asymptotic estimate for the optimal systolic ratio of surfaces of large genus. Furthermore, we improve the multiplicative constant in Gromov’s theorem. We show that ...