skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: The cost of embedding

Abstract

This report describes the cost of embedding and its implication for quantum computing.

Authors:
 [1]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1364582
Report Number(s):
LA-UR-17-24974
DOE Contract Number:
AC52-06NA25396
Resource Type:
Technical Report
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; Computer Science; Mathematics

Citation Formats

Lemons, Nathan Wishard. The cost of embedding. United States: N. p., 2017. Web. doi:10.2172/1364582.
Lemons, Nathan Wishard. The cost of embedding. United States. doi:10.2172/1364582.
Lemons, Nathan Wishard. Tue . "The cost of embedding". United States. doi:10.2172/1364582. https://www.osti.gov/servlets/purl/1364582.
@article{osti_1364582,
title = {The cost of embedding},
author = {Lemons, Nathan Wishard},
abstractNote = {This report describes the cost of embedding and its implication for quantum computing.},
doi = {10.2172/1364582},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Jun 20 00:00:00 EDT 2017},
month = {Tue Jun 20 00:00:00 EDT 2017}
}

Technical Report:

Save / Share:
  • Parallel computations often yield computation structures which are trees; the shape of such a tree evolves over time as the computation progresses. However, parallel computers are usually designed as networks of processors with fixed connections; it is therefore important to embed the dynamic structure of a computation efficiently in a fixed network. The authors consider the problem of dynamically embedding an evolving binary tree with, at most, N nodes in an N-node hypercube. They present a simple randomized algorithm which uses only local control and guarantees constant dilation, while maintaining constant load with high probability; this is the first load-balancingmore » algorithm that achieves constant dilation. They also prove that random solutions to this problem are highly desirable, by demonstrating that any deterministic embedding algorithm which maintains constant load must have omega (square root of log N) dilation.« less
  • A new methodology for the identification of unknown sources of ground-water pollution is developed. The new methodology is based on the concept of statistical pattern recognition. The statistical pattern-recognition algorithm uses Bayes' Optimal Decision Rule. The function of the pattern-recognition system is to match statistically an observed set of concentrations in the field with a comparable set obtained by simulating ground-water transport for various disposal conditions. In order to make the application of the methodology easier, an Expert System was developed. The Expert System uses the results obtained by applying the pattern-recognition algorithm to select a particular set of pollution-sourcemore » locations and magnitudes. The Expert System also has the capability of adding measures of confidence to alternative selections of sources made by the pattern-recognition system, such that these solutions can be ranked according to the subjective confidences supplied by the users. The performance of the pattern-recognition system and the Expert System was evaluated for a selected study area.« less