Sequences of binary irreducible polynomials

In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial f_0 \in \F_2 [x]. If $f_0$ is of degree $n = 2^l \cdot m$, where $m$ is odd and $l$ is a non-negative integer, after an initial finite sequence of polynomials $f_0, f_1, ..., f_{s}$ with $s \leq l+3$, the degree of $f_{i+1}$ is twice the degree of $f_i$ for any $i \geq s$.Comment: 7 pages, minor adjustment

Non-Existence of Stabilizing Policies for the Critical Push-Pull Network and Generalizations

The push-pull queueing network is a simple example in which servers either serve jobs or generate new arrivals. It was previously conjectured that there is no policy that makes the network positive recurrent (stable) in the critical case. We settle this conjecture and devise a general sufficient condition for non-stabilizability of queueing networks which is based on a linear martingale and further applies to generalizations of the push-pull network.Comment: 14 pages, 3 figure

Markov Chain Monte Carlo Method without Detailed Balance

We present a specific algorithm that generally satisfies the balance condition without imposing the detailed balance in the Markov chain Monte Carlo. In our algorithm, the average rejection rate is minimized, and even reduced to zero in many relevant cases. The absence of the detailed balance also introduces a net stochastic flow in a configuration space, which further boosts up the convergence. We demonstrate that the autocorrelation time of the Potts model becomes more than 6 times shorter than that by the conventional Metropolis algorithm. Based on the same concept, a bounce-free worm algorithm for generic quantum spin models is formulated as well.Comment: 5 pages, 5 figure

The ensemble of random Markov matrices

The ensemble of random Markov matrices is introduced as a set of Markov or stochastic matrices with the maximal Shannon entropy. The statistical properties of the stationary distribution pi, the average entropy growth rate $h$ and the second largest eigenvalue nu across the ensemble are studied. It is shown and heuristically proven that the entropy growth-rate and second largest eigenvalue of Markov matrices scale in average with dimension of matrices d as h ~ log(O(d)) and nu ~ d^(-1/2), respectively, yielding the asymptotic relation h tau_c ~ 1/2 between entropy h and correlation decay time tau_c = -1/log|nu| . Additionally, the correlation between h and and tau_c is analysed and is decreasing with increasing dimension d.Comment: 12 pages, 6 figur

Asymptotic entanglement in 1D quantum walks with a time-dependent coined

Discrete-time quantum walk evolve by a unitary operator which involves two operators a conditional shift in position space and a coin operator. This operator entangles the coin and position degrees of freedom of the walker. In this paper, we investigate the asymptotic behavior of the coin position entanglement (CPE) for an inhomogeneous quantum walk which determined by two orthogonal matrices in one-dimensional lattice. Free parameters of coin operator together provide many conditions under which a measurement perform on the coin state yield the value of entanglement on the resulting position quantum state. We study the problem analytically for all values that two free parameters of coin operator can take and the conditions under which entanglement becomes maximal are sought.Comment: 23 pages, 4 figures, accepted for publication in IJMPB. arXiv admin note: text overlap with arXiv:1001.5326 by other author

Distributed Quantum Computation Based-on Small Quantum Registers

We describe and analyze an efficient register-based hybrid quantum computation scheme. Our scheme is based on probabilistic, heralded optical connection among local five-qubit quantum registers. We assume high fidelity local unitary operations within each register, but the error probability for initialization, measurement, and entanglement generation can be very high (~5%). We demonstrate that with a reasonable time overhead our scheme can achieve deterministic non-local coupling gates between arbitrary two registers with very high fidelity, limited only by the imperfections from the local unitary operation. We estimate the clock cycle and the effective error probability for implementation of quantum registers with ion-traps or nitrogen-vacancy (NV) centers. Our new scheme capitalizes on a new efficient two-level pumping scheme that in principle can create Bell pairs with arbitrarily high fidelity. We introduce a Markov chain model to study the stochastic process of entanglement pumping and map it to a deterministic process. Finally we discuss requirements for achieving fault-tolerant operation with our register-based hybrid scheme, and also present an alternative approach to fault-tolerant preparation of GHZ states.Comment: 22 Pages, 23 Figures and 1 Table (updated references

Lewis Research Center spin rig and its use in vibration analysis of rotating systems

The Lewis Research Center spin rig was constructed to provide experimental evaluation of analysis methods developed under the NASA Engine Structural Dynamics Program. Rotors up to 51 cm (20 in.) in diameter can be spun to 16,000 rpm in vacuum by an air motor. Vibration forcing functions are provided by shakers that apply oscillatory axial forces or transverse moments to the shaft, by a natural whirling of the shaft, and by an air jet. Blade vibration is detected by strain gages and optical blade-tip motion sensors. A variety of analogy and digital processing equipment is used to display and analyze the signals. Results obtained from two rotors are discussed. A 56-blade compressor disk was used to check proper operation of the entire spin rig system. A special two-blade rotor was designed and used to hold flat and twisted plates at various setting and sweep angles. Accurate Southwell coefficients have been obtained for several modes of a flat plate oriented parallel to the plane of rotation