578 research outputs found

    Unambiguous determination of spin dephasing times in ZnO

    Full text link
    Time-resolved magneto-optics is a well-established optical pump probe technique to generate and to probe spin coherence in semiconductors. By this method, spin dephasing times T_2^* can easily be determined if their values are comparable to the available pump-probe-delays. If T_2^* exceeds the laser repetition time, however, resonant spin amplification (RSA) can equally be used to extract T_2^*. We demonstrate that in ZnO these techniques have several tripping hazards resulting in deceptive values for T_2^* and show how to avoid them. We show that the temperature dependence of the amplitude ratio of two separate spin species can easily be misinterpreted as a strongly temperature dependent T_2^* of a single spin ensemble, while the two spin species have T_2^* values which are nearly independent of temperature. Additionally, consecutive pump pulses can significantly diminish the spin polarization, which remains from previous pump pulses. While this barely affects T_2^* values extracted from delay line scans, it results in seemingly shorter T_2^* values in RSA.Comment: 11 pages, 10 figure

    Monte-Carlo simulation of supercooled liquids using a self-consistent local temperature

    Full text link
    We combine Creutz energy conservation with Kawasaki spin exchange to simulate the microcanonical dynamics of a system of interacting particles. Relaxation occurs via Glauber spin-flip activation using a self-consistent temperature. Heterogeneity in the dynamics comes from finite-size constraints on the spin exchange that yield a distribution of correlated regions. The simulation produces a high-frequency response that can be identified with the boson peak, and a lower-frequency peak that contains non-Debye relaxation and non-Arrhenius activation, similar to the primary response of supercooled liquids.Comment: 16 pages, 4 figure

    Minimal resources for linear optical one-way computing

    Full text link
    We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies, and present rigorous statements on the ultimate maximal and minimal use of resources of the globally optimal strategy. We find that this strategy - being also the most robust with respect to decoherence - gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of L=40, compared to other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling. This analysis shows that the choice of appropriate classical control leads to a very significant reduction in resource consumption.Comment: 5 pages, 2 figures, title changed, presentation improved, bounds improved, minor errors corrected, references update

    Pairing correlations and transitions in nuclear systems

    Full text link
    We discuss several pairing-related phenomena in nuclear systems, ranging from superfluidity in neutron stars to the gradual breaking of pairs in finite nuclei. We describe recent experimental evidence that points to a relation between pairing and phase transitions (or transformations) in finite nuclear systems. A simple pairing interaction model is used in order to study and classify an eventual pairing phase transition in finite fermionic systems such as nuclei. We show that systems with as few as 10-16 fermions can exhibit clear features reminiscent of a phase transition.Comment: Proceedings of COMEX1, Sorbonne, Paris, june 10-13 2003. To appear in Nuclear Physics

    Age regression from soft aligned face images using low computational resources

    Get PDF
    The initial step in most facial age estimation systems consists of accurately aligning a model to the output of a face detector (e.g. an Active Appearance Model). This fitting process is very expensive in terms of computational resources and prone to get stuck in local minima. This makes it impractical for analysing faces in resource limited computing devices. In this paper we build a face age regressor that is able to work directly on faces cropped using a state-of-the-art face detector. Our procedure uses K nearest neighbours (K-NN) regression with a metric based on a properly tuned Fisher Linear Discriminant Analysis (LDA) projection matrix. On FG-NET we achieve a state-of-the-art Mean Absolute Error (MAE) of 5.72 years with manually aligned faces. Using face images cropped by a face detector we get a MAE of 6.87 years in the same database. Moreover, most of the algorithms presented in the literature have been evaluated on single database experiments and therefore, they report optimistically biased results. In our cross-database experiments we get a MAE of roughly 12 years, which would be the expected performance in a real world application

    Experimental measurement-based quantum computing beyond the cluster-state model

    Full text link
    The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled universal resource state. For years, clusters states have been the only known universal resources. Surprisingly, a novel framework namely quantum computation in correlation space has opened new routes to implement measurement-based quantum computation based on quantum states possessing entanglement properties different from cluster states. Here we report an experimental demonstration of every building block of such a model. With a four-qubit and a six-qubit state as distinct from cluster states, we have realized a universal set of single-qubit rotations, two-qubit entangling gates and further Deutsch's algorithm. Besides being of fundamental interest, our experiment proves in-principle the feasibility of universal measurement-based quantum computation without using cluster states, which represents a new approach towards the realization of a quantum computer.Comment: 26 pages, final version, comments welcom
    • …
    corecore