5,018 research outputs found
Tensor hypercontraction: A universal technique for the resolution of matrix elements of local, finite-range -body potentials in many-body quantum problems
Configuration-space matrix elements of N-body potentials arise naturally and
ubiquitously in the Ritz-Galerkin solution of many-body quantum problems. For
the common specialization of local, finite-range potentials, we develop the
eXact Tensor HyperContraction (X-THC) method, which provides a quantized
renormalization of the coordinate-space form of the N-body potential, allowing
for a highly separable tensor factorization of the configuration-space matrix
elements. This representation allows for substantial computational savings in
chemical, atomic, and nuclear physics simulations, particularly with respect to
difficult "exchange-like" contractions.Comment: Third version of the manuscript after referee's comments. In press in
PRL. Main text: 4 pages, 2 figures, 1 table; Supplemental material (also
included): 14 pages, 2 figures, 2 table
Performance Guarantees of Local Search for Multiprocessor Scheduling
Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvement over the jump, swap, multi-exchange, and the newly defined push neighborhoods. Finally, for the jump neighborhood we provide bounds on the number of local search steps required to find a local optimum.operations research and management science;
Effective Pure States for Bulk Quantum Computation
In bulk quantum computation one can manipulate a large number of
indistinguishable quantum computers by parallel unitary operations and measure
expectation values of certain observables with limited sensitivity. The initial
state of each computer in the ensemble is known but not pure. Methods for
obtaining effective pure input states by a series of manipulations have been
described by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial
averaging) for the case of quantum computation with nuclear magnetic resonance.
We give a different technique called temporal averaging. This method is based
on classical randomization, requires no ancilla qubits and can be implemented
in nuclear magnetic resonance without using gradient fields. We introduce
several temporal averaging algorithms suitable for both high temperature and
low temperature bulk quantum computing and analyze the signal to noise behavior
of each.Comment: 24 pages in LaTex, 14 figures, the paper is also avalaible at
http://qso.lanl.gov/qc
- …