Zero bias conductance peak in Majorana wires made of semiconductor-superconductor hybrid structures

Motivated by a recent experimental report[1] claiming the likely observation of the Majorana mode in a semiconductor-superconductor hybrid structure[2,3,4,5], we study theoretically the dependence of the zero bias conductance peak associated with the zero-energy Majorana mode in the topological superconducting phase as a function of temperature, tunnel barrier potential, and a magnetic field tilted from the direction of the wire for realistic wires of finite lengths. We find that higher temperatures and tunnel barriers as well as a large magnetic field in the direction transverse to the wire length could very strongly suppress the zero-bias conductance peak as observed in Ref.[1]. We also show that a strong magnetic field along the wire could eventually lead to the splitting of the zero bias peak into a doublet with the doublet energy splitting oscillating as a function of increasing magnetic field. Our results based on the standard theory of topological superconductivity in a semiconductor hybrid structure in the presence of proximity-induced superconductivity, spin-orbit coupling, and Zeeman splitting show that the recently reported experimental data are generally consistent with the existing theory that led to the predictions for the existence of the Majorana modes in the semiconductor hybrid structures in spite of some apparent anomalies in the experimental observations at first sight. We also make several concrete new predictions for future observations regarding Majorana splitting in finite wires used in the experiments.Comment: 5 pages, 6 figures: revised submitted versio

Mechanistic investigations of bipyrimidine-promoted palladium-catalyzed allylic acetoxylation of olefins

Several pyridine-like ligands were found to improve Pd(OAc)2-catalyzed allylic oxidation of allylbenzene to cinnamyl acetate by p-benzoquinone in acetic acid. The best ligand examined, bipyrimidine, was used to identify the catalyst precursor for this system, (bipyrimidine)Pd(OAc)2, which was fully characterized. Mechanistic studies suggest the reaction takes place through disproportionation of (bipyrimidine)Pd(OAc)2 to form a bipyrimidine-bridged dimer, which reacts with olefin to form a Pd^II-olefin adduct, followed by allylic C–H activation to produce (η^3-allyl)Pd^II species. The (η^3-allyl)Pd^II intermediate undergoes a reversible acetate attack to generate a Pd^0-(allyl acetate) adduct, which subsequently reacts with p-benzoquinone to release allyl acetate and regenerate (bipyrimidine)Pd(OAc)2. No KIE is observed for the competition experiment between allylbenzene-d0 and allylbenzene-d5 (CD2=CDCD2C6H5), suggesting that allylic C–H activation is not rate-determining. Catalytic allylic acetoxylations of other terminal olefins as well as cyclohexene were also effected by (bipyrimidine)Pd(OAc)2

Majorana resonances and how to avoid them in periodic topological superconductor-nanowire structures

Semiconducting nanowires in proximity to superconductors are promising experimental systems for Majorana fermions which may ultimately be used as building blocks for topological quantum computers. A serious challenge in the experimental realization of the Majorana fermion in these semiconductor-superconductor nanowire structures is tuning the semiconductor chemical potential in close proximity to the metallic superconductor. We show that, presently realizable structures in experiments with tunable chemical potential lead to Majorana resonances, which are interesting in their own right, but do not manifest non-Abelian statistics. This poses a central challenge to the field. We show how to overcome this challenge, thus resolving a crucial barrier to the solid state realization of a topological system containing the Majorana fermion. We propose a new topological superconducting array structure where introducing the superconducting proximity effect from adjacent nanowires generates Majorana fermions with non-Abelian statistics.Comment: 4.5 pages, 3 Figure

Scheduling real-time, periodic jobs using imprecise results

A process is called a monotone process if the accuracy of its intermediate results is non-decreasing as more time is spent to obtain the result. The result produced by a monotone process upon its normal termination is the desired result; the error in this result is zero. External events such as timeouts or crashes may cause the process to terminate prematurely. If the intermediate result produced by the process upon its premature termination is saved and made available, the application may still find the result unusable and, hence, acceptable; such a result is said to be an imprecise one. The error in an imprecise result is nonzero. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. This problem differs from the traditional scheduling problems since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result. Consequently, the amounts of processor time assigned to tasks in a valid schedule can be less than the amounts of time required to complete the tasks. A meaningful formulation of this problem taking into account the quality of the overall result is discussed. Three algorithms for scheduling jobs for which the effects of errors in results produced in different periods are not cumulative are described, and their relative merits are evaluated

Scheduling periodic jobs using imprecise results

One approach to avoid timing faults in hard, real-time systems is to make available intermediate, imprecise results produced by real-time processes. When a result of the desired quality cannot be produced in time, an imprecise result of acceptable quality produced before the deadline can be used. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. Since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result, the amount of processor time assigned to any task in a valid schedule can be less than the amount of time required to complete the task. A meaningful formulation of the scheduling problem must take into account the overall quality of the results. Depending on the different types of undesirable effects caused by errors, jobs are classified as type N or type C. For type N jobs, the effects of errors in results produced in different periods are not cumulative. A reasonable performance measure is the average error over all jobs. Three heuristic algorithms that lead to feasible schedules with small average errors are described. For type C jobs, the undesirable effects of errors produced in different periods are cumulative. Schedulability criteria of type C jobs are discussed