Exactness of the Original Grover Search Algorithm

It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.Comment: 8 pages, 2 figure

Visual illusions of movement

Visual illusions related to involuntary eye movemen

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.Comment: 28 pages, LaTeX. This is an expanded version of a paper that appeared in the Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20--22, 1994. Minor revisions made January, 199

Global periodicity conditions for maps and recurrences via Normal Forms

We face the problem of characterizing the periodic cases in parametric families of (real or complex) rational diffeomorphisms having a fixed point. Our approach relies on the Normal Form Theory, to obtain necessary conditions for the existence of a formal linearization of the map, and on the introduction of a suitable rational parametrization of the parameters of the family. Using these tools we can find a finite set of values p for which the map can be p-periodic, reducing the problem of finding the parameters for which the periodic cases appear to simple computations. We apply our results to several two and three dimensional classes of polynomial or rational maps. In particular we find the global periodic cases for several Lyness type recurrences.Comment: 25 page

Electron-electron interaction corrections to the thermal conductivity in disordered conductors

We evaluate the electron-electron interaction corrections to the electronic thermal conductivity in a disordered conductor in the diffusive regime. We use a diagrammatic many-body method analogous to that of Altshuler and Aronov for the electrical conductivity. We derive results in one, two and three dimensions for both the singlet and triplet channels, and in all cases find that the Wiedemann-Franz law is violated.Comment: 8 pages, 2 figures Typos corrected in formulas (15) and (A.4) and Table 1; discussion of previous work in introduction extended; reference clarifying different definitions of parameter F adde

Occupational class differences in suicide: evidence of changes over time and during the global financial crisis in Australia

BACKGROUND: Previous research showed an increase in Australian suicide rates during the Global Financial Crisis (GFC). There has been no research investigating whether suicide rates by occupational class changed during the GFC. The aim of this study was to investigate whether the GFC-associated increase in suicide rates in employed Australians may have masked changes by occupational class. METHODS: Negative binomial regression models were used to investigate Rate Ratios (RRs) in suicide by occupational class. Years of the GFC (2007, 2008, 2009) were compared to the baseline years 2001-2006. RESULTS: There were widening disparities between a number of the lower class occupations and the highest class occupations during the years 2007, 2008, and 2009 for males, but less evidence of differences for females. CONCLUSIONS: Occupational disparities in suicide rates widened over the GFC period. There is a need for programs to be responsive to economic downturns, and to prioritise the occupational groups most affected

Thermal transport in granular metals

We study the electron thermal transport in granular metals at large tunnel conductance between the grains, $g_T \gg 1$ and not too low a temperature $T > g_T\delta$, where $\delta$ is the mean energy level spacing for a single grain. Taking into account the electron-electron interaction effects we calculate the thermal conductivity and show that the Wiedemann-Franz law is violated for granular metals. We find that interaction effects suppress the thermal conductivity less than the electrical conductivity.Comment: Replaced with published versio

Consequences of converting graded to action potentials upon neural information coding and energy efficiency

Information is encoded in neural circuits using both graded and action potentials, converting between them within single neurons and successive processing layers. This conversion is accompanied by information loss and a drop in energy efficiency. We investigate the biophysical causes of this loss of information and efficiency by comparing spiking neuron models, containing stochastic voltage-gated Na+ and K+ channels, with generator potential and graded potential models lacking voltage-gated Na+ channels. We identify three causes of information loss in the generator potential that are the by-product of action potential generation: (1) the voltage-gated Na+ channels necessary for action potential generation increase intrinsic noise and (2) introduce non-linearities, and (3) the finite duration of the action potential creates a ‘footprint’ in the generator potential that obscures incoming signals. These three processes reduce information rates by ~50% in generator potentials, to ~3 times that of spike trains. Both generator potentials and graded potentials consume almost an order of magnitude less energy per second than spike trains. Because of the lower information rates of generator potentials they are substantially less energy efficient than graded potentials. However, both are an order of magnitude more efficient than spike trains due to the higher energy costs and low information content of spikes, emphasizing that there is a two-fold cost of converting analogue to digital; information loss and cost inflation

Congruence modularity implies cyclic terms for finite algebras

An n-ary operation f : A(n) -> A is called cyclic if it is idempotent and f(a(1), a(2), a(3), ... , a(n)) = f(a(2), a(3), ... , a(n), a(1)) for every a(1), ... , a(n) is an element of A. We prove that every finite algebra A in a congruence modular variety has a p-ary cyclic term operation for any prime p greater than vertical bar A vertical bar