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 5 of 5 for “"quantum compiling"”.

  1. New methods for Quantum Compiling

    The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum computers. In my work I focus on the new methods for compiling single qubit …

    waterloo Repository record for New methods for Quantum Compiling (opens in a new tab)

  2. Quantum Compiling Methods for Fault-Tolerant Gate Sets of Dimension Greater than Two

    … form the basis of many protocols for scalable quantum computing architectures. At the beginning of the decade, number-theoretic techniques were employed to analyze circuits over these gate sets on single qubits, providing the basis for a number of state-of-the-art quantum compiling algorithms. …

    maryland Repository record for Quantum Compiling Methods for Fault-Tolerant Gate Sets of Dimension Greater than Two (opens in a new tab)

  3. Low-depth quantum architectures for factoring

    Quantum computing is a new field which combines computer science and quantum physics. Its most famous result, Shor's factoring algorithm, would enable us to one day compromise the widely-used RSA cryptosystem if we are able to design efficient quantum architectures. Studying the depth of these …

    washington Repository record for Low-depth quantum architectures for factoring (opens in a new tab)

  4. Quantum torus methods for Kauffman bracket skein modules

    … of surfaces and modules of 3-manifolds using quantum torus methods. These methods come in two flavors: embedding the skein algebra into a quantum torus related to quantum Teichmuller space, or filtering the algebra and obtaining an associated graded algebra that is a monomial subalgebra of a …

    gatech Repository record for Quantum torus methods for Kauffman bracket skein modules (opens in a new tab)

  5. Quantum Compilers for Reducing Non-Clifford Gate Counts

    Quantum computers can solve certain problems much faster than classical computers. However, in order to benefit from the speed-up granted by quantum algorithms, they must first be rendered as hardware-level instructions (i.e. quantum circuits) in a process known as quantum compiling. Any choice of …

    whiterose Download PDF for Quantum Compilers for Reducing Non-Clifford Gate Counts (opens in a new tab)