Commutator Leavitt path algebras

For any field K and directed graph E, we completely describe the elements of the Leavitt path algebra L_K(E) which lie in the commutator subspace [L_K(E),L_K(E)]. We then use this result to classify all Leavitt path algebras L_K(E) that satisfy L_K(E)=[L_K(E),L_K(E)]. We also show that these Leavitt path algebras have the additional (unusual) property that all their Lie ideals are (ring-theoretic) ideals, and construct examples of such rings with various ideal structures.Comment: 24 page

Chimera States for Coupled Oscillators

Arrays of identical oscillators can display a remarkable spatiotemporal pattern in which phase-locked oscillators coexist with drifting ones. Discovered two years ago, such "chimera states" are believed to be impossible for locally or globally coupled systems; they are peculiar to the intermediate case of nonlocal coupling. Here we present an exact solution for this state, for a ring of phase oscillators coupled by a cosine kernel. We show that the stable chimera state bifurcates from a spatially modulated drift state, and dies in a saddle-node bifurcation with an unstable chimera.Comment: 4 pages, 4 figure

Quantum interferometric optical lithography:towards arbitrary two-dimensional patterns

As demonstrated by Boto et al. [Phys. Rev. Lett. 85, 2733 (2000)], quantum lithography offers an increase in resolution below the diffraction limit. Here, we generalize this procedure in order to create patterns in one and two dimensions. This renders quantum lithography a potentially useful tool in nanotechnology.Comment: 9 pages, 5 figures Revte

Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems

If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum logic gates. It is argued that virtually any deterministic nonlinear quantum theory will include such gates, and the method is explicitly demonstrated using the Weinberg model of nonlinear quantum mechanics.Comment: 10 pages, no figures, submitted to Phys. Rev. Let

Multijunction solar cell efficiencies: effect of spectral window, optical environment and radiative coupling

Solar cell efficiency is maximized through multijunction architectures that minimize carrier thermalization and increase absorption. Previous proposals suggest that the maximum efficiency for a finite number of subcells is achieved for designs that optimize for light trapping over radiative coupling. We instead show that structures with radiative coupling and back reflectors for light trapping, e.g. spectrum-splitting cells, can achieve higher conversion efficiencies. We model a compatible geometry, the polyhedral specular reflector. We analyze and experimentally verify the effects of spectral window and radiative coupling on voltage and power. Our results indicate that radiative coupling with back reflectors leads to higher efficiencies than previously studied architectures for practical multijunction architectures (i.e., ≤20 subcells)

Computational capacity of the universe

Merely by existing, all physical systems register information. And by evolving dynamically in time, they transform and process that information. The laws of physics determine the amount of information that a physical system can register (number of bits) and the number of elementary logic operations that a system can perform (number of ops). The universe is a physical system. This paper quantifies the amount of information that the universe can register and the number of elementary operations that it can have performed over its history. The universe can have performed no more than $10^{120}$ ops on $10^{90}$ bits.Comment: 17 pages, TeX. submitted to Natur

New summing algorithm using ensemble computing

We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query complexity of the algorithm depends only on the scaling of the measurement sensitivity with the number of distinct spin sub-ensembles. From a practical point of view, the proposed algorithm may result in an exponential speedup, compared to known quantum and classical summing algorithms. However in general, this advantage exists only if the total number of function samples is below a threshold value which depends on the measurement sensitivity.Comment: 13 pages, 0 figures, VIth International Conference on Quantum Communication, Measurement and Computing (Boston, 2002

Quantum Clock Synchronization Based on Shared Prior Entanglement

We demonstrate that two spatially separated parties (Alice and Bob) can utilize shared prior quantum entanglement, and classical communications, to establish a synchronized pair of atomic clocks. In contrast to classical synchronization schemes, the accuracy of our protocol is independent of Alice or Bob's knowledge of their relative locations or of the properties of the intervening medium.Comment: 4 page