Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Graph state"”.

  1. Benchmarking measurement-based quantum computation on graph states

    … computing that operates on a prepared entangled graph state, typically a cluster state. In this dissertation, we will detail the creation of graph states across various physical platforms using different entangling gates. We will then benchmark the quality of graph states created with error-prone …

    vt Repository record for Benchmarking measurement-based quantum computation on graph states (opens in a new tab)

  2. Zorro: zero-cost reactive failure recovery in distributed graph processing

    Distributed graph processing frameworks have become increasingly popular for processing large graphs. However, existing frameworks either lack the ability to recovery from failures or support proactive recovery methods. Proactive recovery methods like checkpointing incur high overheads during …

    uiuc Repository record for Zorro: zero-cost reactive failure recovery in distributed graph processing (opens in a new tab)

  3. Graph Representation of Topological Stabilizer States

    Topological quantum states, especially these in topological stabilizer quantum error correction codes, are currently the focus of intense activity because of their potential for fault-tolerant operations. While every stabilizer state maps to a graph state under local Clifford operations, the graphs …

    calgary Repository record for Graph Representation of Topological Stabilizer States (opens in a new tab)

  4. Approximate failure recovery in distributed graph processing systems

    Distributed graph processing systems are an emerging area of big data systems. As graphs continue to grow in size and prevalence, these systems must become faster and more scalable. However, after failures, distributed graph processing systems either largely rely on proactive fault tolerance …

    uiuc Repository record for Approximate failure recovery in distributed graph processing systems (opens in a new tab)