30,221 research outputs found
Hyperpolarized ^1H NMR employing low γ nucleus for spin polarization storage
The PASADENA (parahydrogen and synthesis allow dramatically enhanced nuclear alignment)(1, 2) and DNP (Dynamic Nuclear Polarization)(3) methods efficiently hyperpolarize biologically relevant nuclei such as 1^H, (31)^P, (13)^C, (15)^N achieving signal enhancement by a factor of ~ 100000 on currently utilized MRI scanners. Recently, many groups have demonstrated the utility of hyperpolarized MR in biological systems using hyperpolarized (13)^C biomarkers with a relatively long spin lattice relaxation time T_1 on the order of tens of seconds.(4-7) Moreover, hyperpolarized (15)^N for biomedical MR has been proposed due to even longer spin lattice relaxations times.(8) An additional increase of up to tens of minutes in the lifetime of hyperpolarized agent in vivo could be achieved by using the singlet states of low gamma (γ) nuclei.(9) However, as NMR receptivity scales as γ^3 for spin 1/2 nuclei, direct NMR detection of low γ nuclei results in a lower signal-to-noise ratio compared to proton detection. While protons are better nuclei for detection, short spin lattice relaxation times prevent direct 1^H hyperpolarized MR in biomedical applications
Universal 2-local Hamiltonian Quantum Computing
We present a Hamiltonian quantum computation scheme universal for quantum
computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the
number of gates L in the quantum circuit) of time-independent, constant-norm,
2-local qubit-qubit interaction terms. Furthermore, each qubit in the system
interacts only with a constant number of other qubits. The computer runs in
three steps - starts in a simple initial product-state, evolves it for time of
order L^2 (up to logarithmic factors) and wraps up with a two-qubit
measurement. Our model differs from the previous universal 2-local Hamiltonian
constructions in that it does not use perturbation gadgets, does not need large
energy penalties in the Hamiltonian and does not need to run slowly to ensure
adiabatic evolution.Comment: recomputed the necessary number of interactions, new geometric
layout, added reference
Distribution-Aware Sampling and Weighted Model Counting for SAT
Given a CNF formula and a weight for each assignment of values to variables,
two natural problems are weighted model counting and distribution-aware
sampling of satisfying assignments. Both problems have a wide variety of
important applications. Due to the inherent complexity of the exact versions of
the problems, interest has focused on solving them approximately. Prior work in
this area scaled only to small problems in practice, or failed to provide
strong theoretical guarantees, or employed a computationally-expensive maximum
a posteriori probability (MAP) oracle that assumes prior knowledge of a
factored representation of the weight distribution. We present a novel approach
that works with a black-box oracle for weights of assignments and requires only
an {\NP}-oracle (in practice, a SAT-solver) to solve both the counting and
sampling problems. Our approach works under mild assumptions on the
distribution of weights of satisfying assignments, provides strong theoretical
guarantees, and scales to problems involving several thousand variables. We
also show that the assumptions can be significantly relaxed while improving
computational efficiency if a factored representation of the weights is known.Comment: This is a full version of AAAI 2014 pape
A variational analysis of Einstein-scalar field Lichnerowicz equations on compact Riemannian manifolds
We establish new existence and non-existence results for positive solutions
of the Einstein-scalar field Lichnerowicz equation on compact manifolds. This
equation arises from the Hamiltonian constraint equation for the
Einstein-scalar field system in general relativity. Our analysis introduces
variational techniques, in the form of the mountain pass lemma, to the analysis
of the Hamiltonian constraint equation, which has been previously studied by
other methods.Comment: 15 page
Stochastic embedding DFT: theory and application to p-nitroaniline
Over this past decade, we combined the idea of stochastic resolution of
identity with a variety of electronic structure methods. In our stochastic
Kohn-Sham DFT method, the density is an average over multiple stochastic
samples, with stochastic errors that decrease as the inverse square root of the
number of sampling orbitals. Here we develop a stochastic embedding density
functional theory method (se-DFT) that selectively reduces the stochastic error
(specifically on the forces) for a selected sub-system(s). The motivation,
similar to that of other quantum embedding methods, is that for many systems of
practical interest the properties are often determined by only a small
sub-system. In stochastic embedding DFT two sets of orbitals are used: a
deterministic one associated with the embedded subspace, and the rest which is
described by a stochastic set. The method is exact in the limit of large number
of stochastic samples. We apply se-DFT to study a p-nitroaniline molecule in
water, where the statistical errors in the forces on the system (the
p-nitroaniline molecule) are reduced by an order of magnitude compared with
non-embedding stochastic DFT
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
- …