Efficient Circuits for Quantum Walks

We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently integrable probability distributions. This method is intended for use in quantum walk algorithms with polynomial speedups, whose complexity is usually measured in terms of how many times we have to apply a step of a quantum walk, compared to the number of necessary classical Markov chain steps. We consider a finer notion of complexity including the number of elementary gates it takes to implement each step of the quantum walk with some desired accuracy. The difference in complexity for various implementation approaches is that our method scales linearly in the sparsity parameter and poly-logarithmically with the inverse of the desired precision. The best previously known general methods either scale quadratically in the sparsity parameter, or polynomially in the inverse precision. Our approach is especially relevant for implementing quantum walks corresponding to classical random walks like those used in the classical algorithms for approximating permanents and sampling from binary contingency tables. In those algorithms, the sparsity parameter grows with the problem size, while maintaining high precision is required.Comment: Modified abstract, clarified conclusion, added application section in appendix and updated reference

Generic singularities of nilpotent orbit closures

According to a well-known theorem of Brieskorn and Slodowy, the intersection of the nilpotent cone of a simple Lie algebra with a transverse slice to the subregular nilpotent orbit is a simple surface singularity. At the opposite extremity of the nilpotent cone, the closure of the minimal nilpotent orbit is also an isolated symplectic singularity, called a minimal singularity. For classical Lie algebras, Kraft and Procesi showed that these two types of singularities suffice to describe all generic singularities of nilpotent orbit closures: specifically, any such singularity is either a simple surface singularity, a minimal singularity, or a union of two simple surface singularities of type $A_{2k-1}$. In the present paper, we complete the picture by determining the generic singularities of all nilpotent orbit closures in exceptional Lie algebras (up to normalization in a few cases). We summarize the results in some graphs at the end of the paper. In most cases, we also obtain simple surface singularities or minimal singularities, though often with more complicated branching than occurs in the classical types. There are, however, six singularities which do not occur in the classical types. Three of these are unibranch non-normal singularities: an $SL_2(\mathbb C)$-variety whose normalization is ${\mathbb A}^2$, an $Sp_4(\mathbb C)$-variety whose normalization is ${\mathbb A}^4$, and a two-dimensional variety whose normalization is the simple surface singularity $A_3$. In addition, there are three 4-dimensional isolated singularities each appearing once. We also study an intrinsic symmetry action on the singularities, in analogy with Slodowy's work for the regular nilpotent orbit.Comment: 56 pages (5 figures). Minor corrections. Accepted in Advances in Mat

A hybrid M-algorithm/sequential decoder for convolutional and trellis codes

The Viterbi Algorithm (VA) is optimum in the sense of being maximum likelihood for decoding codes with a trellis structure. However, since the VA is in fact an exhaustive search of the code trellis, the complexity of the VA grows exponentially with the constraint length upsilon. This limits its application to codes with small values of upsilon and relatively modest coding gains. The M-Algorithm (MA) is a limited search scheme which carries forward M paths in the trellis, all of the same length. All successors of the M paths are extended at the next trellis depth, and all but the best M of these are dropped. Since a limited search convolutional decoder will flounder indefinitely if one of the paths in storage is not the correct one, the data are usually transmitted in blocks. It has been shown that the performance of the MA approaches the VA at high signal to noise ratios (SNR's) with an M which is far less than the 2 sup upsilon states in the full trellis. Thus the MA can be used with larger values of upsilon, making larger coding gains possible at high SNR's. However, it still requires a relatively large fixed computational effort to achieve good performance

Evolving into a Regional Innovation System: How Governance impact on Innovation in Shenzhen and Dongguan, China?

Governance constitutes elementary supportive infrastructure for regional innovation systems. This paper extends the evolutionary lens of governance into initial industrialization phase and examines the impact of their evolution into regional innovation systems on fostering innovation activities. Drawing on the empirical substances in Shenzhen and Dongguan, China, a path-dependent nature of institutional design on supporting innovation has been discovered. The paper shows that the dirigiste globalized production system in Shenzhen in 1980s has gradually evolved to a higher level of interactive regional innovation system than the grassroots globalized production system in Dongguan, where innovation is still passively managed by global players. Finally, policy implication is discussed for the construction of regional innovation systems under different governance modalities in the initial industrialization phase.ego-networks, geographical proximity, innovation performance, knowledge networks, technological relatedness

Bandwidth efficient CCSDS coding standard proposals

The basic concatenated coding system for the space telemetry channel consists of a Reed-Solomon (RS) outer code, a symbol interleaver/deinterleaver, and a bandwidth efficient trellis inner code. A block diagram of this configuration is shown. The system may operate with or without the outer code and interleaver. In this recommendation, the outer code remains the (255,223) RS code over GF(2 exp 8) with an error correcting capability of t = 16 eight bit symbols. This code's excellent performance and the existence of fast, cost effective, decoders justify its continued use. The purpose of the interleaver/deinterleaver is to distribute burst errors out of the inner decoder over multiple codewords of the outer code. This utilizes the error correcting capability of the outer code more efficiently and reduces the probability of an RS decoder failure. Since the space telemetry channel is not considered bursty, the required interleaving depth is primarily a function of the inner decoding method. A diagram of an interleaver with depth 4 that is compatible with the (255,223) RS code is shown. Specific interleaver requirements are discussed after the inner code recommendations