Search for dissertations about: "Approximate Computing"

Showing result 1 - 5 of 63 swedish dissertations containing the words Approximate Computing.

  2. 1. Reducing Memory Traffic with Approximate Compression

    Author : Albin Eldstål-Ahrens; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Memory Compression; Memory Systems; Compression; Computer Architecture; Lossy Compression; Approximate Computing;

    Abstract : Memory bandwidth is a critical resource in modern systems and has an increasing demand. The large number of on-chip cores and specialized accelerators improves the potential processing throughput but also calls for higher data rates. In addition, new emerging data-intensive applications further increase memory traffic. READ MORE

  4. 2. Large-scale simulation-based experiments with stochastic models using machine learning-assisted approaches : Applications in systems biology using Markov jump processes

    Author : Fredrik Wrede; Andreas Hellander; Ramon Grima; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; bioinformatics; systems biology; stochastic simulation; model exploration; approximate parameter inference; machine learning; distributed computing; Beräkningsvetenskap; Scientific Computing;

    Abstract : Discrete and stochastic models in systems biology, such as biochemical reaction networks, can be modeled as Markov jump processes. The chemical master equation describes how the probability distribution of a biochemical system's states evolves. Unfortunately, solutions to the chemical master equation only exist for trivial problems. READ MORE

  5. 3. The quantum approximate optimization algorithm: optimization problems and implementations

    Author : Pontus Vikstål; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Quantum approximate optimization algorithm; quantum computing; error mitigation; cat qubits;

    Abstract : This thesis explores the Quantum Approximate Optimization Algorithm (QAOA), a hybrid classical-quantum algorithm designed to solve combinatorial optimization problems. The goal of this algorithm is to iteratively optimize a variational state to approximate the ground state of a cost Hamiltonian that encodes a combinatorial optimization problem. READ MORE

  6. 4. Applying quantum approximate optimization to the heterogeneous vehicle routing problem

    Author : David Fitzek; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; combinatorial optimization; variational quantum algorithm; Quantum computing; quantum approximate optimization algorithm; vehicle routing;

    Abstract : Quantum computing offers new heuristics for combinatorial problems. With small- and intermediate-scale quantum devices becoming available, it is possible to implement and test these heuristics on small-size problems. READ MORE

  7. 5. Application of the quantum approximate optimization algorithm to combinatorial optimization problems

    Author : Pontus Vikstål; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; combinatorial optimization; quantum computing; Quantum approximate optimization algorithm;

    Abstract : This licentiate thesis is an extended introduction to the accompanying papers, which encompass a study of the quantum approximate optimization algorithm (QAOA). It is a hybrid quantum-classical algorithm for solving combinatorial optimization problems and is a promising algorithm to run on near term quantum devices. READ MORE