Quantum simulation of topological Majorana bound states and their universal quantum operations using charge-qubit arrays

Majorana bound states have been a focus of condensed matter research for their potential applications in topological quantum computation. Here we utilize two charge-qubit arrays to explicitly simulate a DIII class one-dimensional superconductor model where Majorana end states can appear. Combined with one braiding operation, universal single-qubit operations on a Majorana-based qubit can be implemented by a controllable inductive coupling between two charge qubits at the ends of the arrays. We further show that in a similar way, a controlled-NOT gate for two topological qubits can be simulated in four charge-qubit arrays. Although the current scheme may not truly realize topological quantum operations, we elaborate that the operations in charge-qubit arrays are indeed robust against certain local perturbations.Comment: 5 pages, 3 figure

Evolutionary approach to overcome initialization parameters in classification problems

Proceeding of: 7th International Work-Conference on Artificial and Natural Neural Networks, IWANN 2003 Maó, Menorca, Spain, June 3–6, 2003.The design of nearest neighbour classifiers is very dependent from some crucial parameters involved in learning, like the number of prototypes to use, the initial localization of these prototypes, and a smoothing parameter. These parameters have to be found by a trial and error process or by some automatic methods. In this work, an evolutionary approach based on Nearest Neighbour Classifier (ENNC), is described. Main property of this algorithm is that it does not require any of the above mentioned parameters. The algorithm is based on the evolution of a set of prototypes that can execute several operators in order to increase their quality in a local sense, and emerging a high classification accuracy for the whole classifier

A Burgess-like subconvex bound for twisted L-functions

Let g be a cuspidal newform (holomorphic or Maass) of arbitrary level and nebentypus, X a primitive character of conductor q, and s a point on the critical line Rs = 1/2. It is proved that L(g circle times chi, s) 0 is arbitrary and theta = 7/64 is the current known approximation towards the RamannJan-Petersson conjecture (which would allow theta = 0); moreover, the dependence on s and all the parameters of g is polynomial. This result is an analog of Burgess' classical subconvex bound for Dirichlet L-functions. In Appendix 2 the above result is combined with a theorem of Waldspurger and the adelic calculations of Baruch-Mao to yield an improved uniform upper bound for the Fourier coefficients of holomorphic half-integral weight cusp forms

Delay-dependent robust stability of stochastic delay systems with Markovian switching

In recent years, stability of hybrid stochastic delay systems, one of the important issues in the study of stochastic systems, has received considerable attention. However, the existing results do not deal with the structure of the diffusion but estimate its upper bound, which induces conservatism. This paper studies delay-dependent robust stability of hybrid stochastic delay systems. A delay-dependent criterion for robust exponential stability of hybrid stochastic delay systems is presented in terms of linear matrix inequalities (LMIs), which exploits the structure of the diffusion. Numerical examples are given to verify the effectiveness and less conservativeness of the proposed method

A Mutual Information Based Sequence Distance For Vertebrate Phylogeny Using Complete Mitochondrial Genomes

Traditional sequence distances require alignment. A new mutual information based sequence distance without alignment is defined in this paper. This distance is based on compositional vectors of DNA sequences or protein sequences from complete genomes. First we establish the mathematical foundation of this distance. Then this distance is applied to analyze the phylogenetic relationship of 64 vertebrates using complete mitochondrial genomes. The phylogenetic tree shows that the mitochondrial genomes are separated into three major groups. One group corresponds to mammals; one group corresponds to fish; and the last one is Archosauria (including birds and reptiles). The structure of the tree based on our new distance is roughly in agreement in topology with the current known phylogenies of vertebrates