More bang for your buck: super-adiabatic quantum engines.
Ontology highlight
ABSTRACT:
SUBMITTER: del Campo A
PROVIDER: S-EPMC4147366 | biostudies-literature | 2014 Aug
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:The molecular dynamics simulation package GROMACS runs efficiently on a wide variety of hardware from commodity workstations to high performance computing clusters. Hardware features are well-exploited with a combination of single instruction multiple data, multithreading, and message passing interface (MPI)-based single program multiple data/multiple program multiple data parallelism while graphics processing units (GPUs) can be used as accelerators to compute interactions off-loaded from the CPU. Here, we evaluate which hardware produces trajectories with GROMACS 4.6 or 5.0 in the most economical way. We have assembled and benchmarked compute nodes with various CPU/GPU combinations to identify optimal compositions in terms of raw trajectory production rate, performance-to-price ratio, energy efficiency, and several other criteria. Although hardware prices are naturally subject to trends and fluctuations, general tendencies are clearly visible. Adding any type of GPU significantly boosts a node's simulation performance. For inexpensive consumer-class GPUs this improvement equally reflects in the performance-to-price ratio. Although memory issues in consumer-class GPUs could pass unnoticed as these cards do not support error checking and correction memory, unreliable GPUs can be sorted out with memory checking tools. Apart from the obvious determinants for cost-efficiency like hardware expenses and raw performance, the energy consumption of a node is a major cost factor. Over the typical hardware lifetime until replacement of a few years, the costs for electrical power and cooling can become larger than the costs of the hardware itself. Taking that into account, nodes with a well-balanced ratio of CPU and consumer-class GPU resources produce the maximum amount of GROMACS trajectory over their lifetime.
| S-EPMC5042102 | biostudies-literature
Project description:Rising economic insecurity in recent decades has focused attention on the importance of social welfare programs in managing household financial stability. Some governments are more effective than others in managing this outcome, and informal social institutions help explain why. Social capital is expected to shape economic security through multiple mechanisms, but whether the effect is to magnify or mitigate volatility is an open question. Part of the answer has to do with how social capital interacts with policy implementation, and whether it conditions the effectiveness of government spending. Evidence from the U.S. states from 1986 to 2010 fails to support a benevolent social capital thesis-not only is social capital associated with greater economic insecurity, there is no evidence that it improves social welfare effectiveness. However, greater spending on some social programs can mitigate the adverse impact of social capital on economic security.
| S-EPMC6294149 | biostudies-literature
Project description:We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.
| S-EPMC4194464 | biostudies-other
Project description:All organisms use resources to grow, survive and reproduce. The supply of these resources varies widely across landscapes and time, imposing ultimate constraints on the maximal trait values for allocation-related traits. In this review, we address three key questions fundamental to our understanding of the evolution of allocation strategies and their underlying mechanisms. First, we ask: how diverse are flexible resource allocation strategies among different organisms? We find there are many, varied, examples of flexible strategies that depend on nutrition. However, this diversity is often ignored in some of the best-known cases of resource allocation shifts, such as the commonly observed pattern of lifespan extension under nutrient limitation. A greater appreciation of the wide variety of flexible allocation strategies leads directly to our second major question: what conditions select for different plastic allocation strategies? Here, we highlight the need for additional models that explicitly consider the evolution of phenotypically plastic allocation strategies and empirical tests of the predictions of those models in natural populations. Finally, we consider the question: what are the underlying mechanisms determining resource allocation strategies? Although evolutionary biologists assume differential allocation of resources is a major factor limiting trait evolution, few proximate mechanisms are known that specifically support the model. We argue that an integrated framework can reconcile evolutionary models with proximate mechanisms that appear at first glance to be in conflict with these models. Overall, we encourage future studies to: (i) mimic ecological conditions in which those patterns evolve, and (ii) take advantage of the 'omic' opportunities to produce multi-level data and analytical models that effectively integrate across physiological and evolutionary theory.
| S-EPMC5489724 | biostudies-literature
Project description:Semiconductor quantum-dot spin qubits are a promising platform for quantum computation, because they are scalable and possess long coherence times. In order to realize this full potential, however, high-fidelity information transfer mechanisms are required for quantum error correction and efficient algorithms. Here, we present evidence of adiabatic quantum-state transfer in a chain of semiconductor quantum-dot electron spins. By adiabatically modifying exchange couplings, we transfer single- and two-spin states between distant electrons in less than 127 ns. We also show that this method can be cascaded for spin-state transfer in long spin chains. Based on simulations, we estimate that the probability to correctly transfer single-spin eigenstates and two-spin singlet states can exceed 0.95 for the experimental parameters studied here. In the future, state and process tomography will be required to verify the transfer of arbitrary single qubit states with a fidelity exceeding the classical bound. Adiabatic quantum-state transfer is robust to noise and pulse-timing errors. This method will be useful for initialization, state distribution, and readout in large spin-qubit arrays for gate-based quantum computing. It also opens up the possibility of universal adiabatic quantum computing in semiconductor quantum-dot spin qubits.
| S-EPMC8042124 | biostudies-literature
Project description:The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.
| S-EPMC4761947 | biostudies-literature
Project description:Quantum adiabatic evolutions find a broad range of applications in quantum physics and quantum technologies. The traditional form of the quantum adiabatic theorem limits the speed of adiabatic evolution by the minimum energy gaps of the system Hamiltonian. Here, we experimentally show using a nitrogen-vacancy center in diamond that, even in the presence of vanishing energy gaps, quantum adiabatic evolution is possible. This verifies a recently derived necessary and sufficient quantum adiabatic theorem and offers paths to overcome the conventionally assumed constraints on adiabatic methods. By fast modulation of dynamic phases, we demonstrate near-unit-fidelity quantum adiabatic processes in finite times. These results challenge traditional views and provide deeper understanding on quantum adiabatic processes, as well as promising strategies for the control of quantum systems.
| S-EPMC6588358 | biostudies-literature
Project description:We propose an experimental method for evaluating the adiabatic condition during quantum annealing (QA), which will be essential for solving practical problems. The adiabatic condition consists of the transition matrix element and the energy gap, and our method simultaneously provides information about these components without diagonalizing the Hamiltonian. The key idea is to measure the power spectrum of a time domain signal by adding an oscillating field during QA, and we can estimate the values of the transition matrix element and energy gap from the measurement output. Our results provides a powerful experimental basis for analyzing the performance of QA.
| S-EPMC11001971 | biostudies-literature
Project description:Despite more than a decade of research on adiabatic quantum computation (AQC), its decoherence properties are still poorly understood. Many theoretical works have suggested that AQC is more robust against decoherence, but a quantitative relation between its performance and the qubits' coherence properties, such as decoherence time, is still lacking. While the thermal excitations are known to be important sources of errors, they are predominantly dependent on temperature but rather insensitive to the qubits' coherence. Less understood is the role of virtual excitations, which can also reduce the ground state probability even at zero temperature. Here, we introduce normalized ground state fidelity as a measure of the decoherence-induced deformation of the ground state due to virtual transitions. We calculate the normalized fidelity perturbatively at finite temperatures and discuss its relation to the qubits' relaxation and dephasing times, as well as its projected scaling properties.
| S-EPMC3608076 | biostudies-literature
Project description:Quantum ghost imaging offers many advantages over classical imaging, including low photon fluxes and non-degenerate object and image wavelengths for imaging light sensitive structures, but suffers from slow image reconstruction speeds. Image reconstruction times depend on the resolution of the required image which scale quadratically with the image resolution. Here, we propose a super-resolved imaging approach based on neural networks where we reconstruct a low resolution image, which we denoise and super-resolve to a high resolution image. To test the approach, we implemented both a generative adversarial network as well as a super-resolving autoencoder in conjunction with an experimental quantum ghost imaging setup, demonstrating its efficacy across a range of object and imaging projective mask types. We achieved super-resolving enhancement of [Formula: see text] the measured resolution with a fidelity close to 90[Formula: see text] at an acquisition time of N[Formula: see text] measurements, required for a complete N [Formula: see text] N pixel image solution. This significant resolution enhancement is a step closer to a common ghost imaging goal, to reconstruct images with the highest resolution and the shortest possible acquisition time.
| S-EPMC9209480 | biostudies-literature