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 20 of 43 for “"Quantum Codes"”.

  1. Quantum Codes From Symmetry

    … theorem shows that the transversal gates of a quantum code, whichare naturally fault-tolerant, form a finite group G. We show that G is an invariant of equivalent quantum codes and thus can be considered as a well defined symmetry. This thesis studies how the symmetry G dictates the existence …

    maryland Repository record for Quantum Codes From Symmetry (opens in a new tab)

  2. Hypermap-Homology Quantum Codes

    We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the possibility of developing fast decoders for them. Codes …

    arizona-thes Repository record for Hypermap-Homology Quantum Codes (opens in a new tab)

  3. Hybrid and Nonadditive Quantum Codes

    Quantum error-correcting codes play a vital role in protecting quantum information from external noise and internal decoherence, and will be a critical tool in the construction of a universal fault-tolerant quantum computer. Most known quantum error-correcting codes belong to the well-studied class …

    tamu Repository record for Hybrid and Nonadditive Quantum Codes (opens in a new tab)

  4. Quantum codes, phases and magic

    In the last twenty years, the understanding of quantum phases of matter has been deeply changing due to the influx of ideas stemming from quantum information and computation. In this thesis, we introduce applications of the study of quantum errorcorrecting codes to the classification and …

    brazil-ufrn Repository record for Quantum codes, phases and magic (opens in a new tab)

  5. Quantum codes over Finite Frobenius Rings

    It is believed that quantum computers would be able to solve complex problems more quickly than any other deterministic or probabilistic computer. Quantum computers basically exploit the rules of quantum mechanics for speeding up computations. However, building a quantum computer remains a daunting …

    tamu Repository record for Quantum codes over Finite Frobenius Rings (opens in a new tab)

  6. Quantum Codes, Transversal Gates, and Representation Theory

    … void by constructing a family of distance d = 3 codes that all implement 2I transversally [39, 42]. To do this, we introduce twisted unitary t-groups, a generalization of unitary t-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the …

    maryland Repository record for Quantum Codes, Transversal Gates, and Representation Theory (opens in a new tab)

  7. Quantum codes from two-point Hermitian codes

    We explore the background on error-correcting codes, including linear codes and quantum codes from curves. Then we consider the parameters of quantum codes constructed from two-point Hermitian codes.

    clemson Repository record for Quantum codes from two-point Hermitian codes (opens in a new tab)

  8. Calculation of thermodynamic and kinetic properties using semi- empirical quantum codes

    Although semi-empirical quantum codes have existed for several years now, the computational chemistry has, by and large, remained the subject of major interest for organic chemists and quantum chemists. In this thesis numerous exercises are designed in order to explore various areas of chemical …

    vt Repository record for Calculation of thermodynamic and kinetic properties using semi- empirical quantum codes (opens in a new tab)

  9. Good additive cyclic quantum error-correcting codes

    This thesis is about the quantum error-correcting codes. Although there are many methods to construct them, finding a good quantum code is still a complicated and difficult task, for we do not know which methods to use. To solve this problem, we did a thorough research on a special class of quantum …

    concordia Download PDF for Good additive cyclic quantum error-correcting codes (opens in a new tab)

  10. Quantum stabilizer codes and beyond

    The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. Despite the large body of literature in quantum coding theory, many important questions, especially those centering on the issue of "good codes" are unresolved. In this …

    tamu Repository record for Quantum stabilizer codes and beyond (opens in a new tab)

  11. Non-Markovianity in Logical Fidelity Estimation

    As quantum devices are progressively scaled and refined, quantum codes will become indispensable to guarantee reliable computation in the presence of noise. Due to the difficulties of characterizing physical noise, direct measures of logical performance will be of paramount use to tune quantum …

    waterloo Repository record for Non-Markovianity in Logical Fidelity Estimation (opens in a new tab)

  12. Quantum error control codes

    It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. For instance, Shor's algorithm is able to factor large integers in polynomial time on a quantum computer. A quantum computer exploits the rules of quantum …

    tamu Repository record for Quantum error control codes (opens in a new tab)

  13. Quantum Error-Correcting Hybrid Codes

    Remarkable contributions made in the field of quantum algorithms and theory since 1994 have paved the way for quantum information and quantum computing. Their substantial speed-up over classical algorithms encouraged further developments in quantum information theory that enable information …

    tamu Repository record for Quantum Error-Correcting Hybrid Codes (opens in a new tab)

  14. Quantum Error Correcting Codes and Fault-Tolerant Quantum Computation over Nice Rings

    Quantum error correcting codes play an essential role in protecting quantum information from the noise and the decoherence. Most quantum codes have been constructed based on the Pauli basis indexed by a finite field. With a newly introduced algebraic class called a nice ring, it is possible to …

    tamu Repository record for Quantum Error Correcting Codes and Fault-Tolerant Quantum Computation over Nice Rings (opens in a new tab)

  15. Threshold analysis with fault-tolerant operations for nonbinary quantum error correcting codes

    Quantum error correcting codes have been introduced to encode the data bits in extra redundant bits in order to accommodate errors and correct them. However, due to the delicate nature of the quantum states or faulty gate operations, there is a possibility of catastrophic spread of errors which …

    tamu Repository record for Threshold analysis with fault-tolerant operations for nonbinary quantum error correcting codes (opens in a new tab)

  16. Transmitting Quantum Information Reliably across Various Quantum Channels

    Transmitting quantum information across quantum channels is an important task. However quantum information is delicate, and is easily corrupted. We address the task of protecting quantum information from an information theoretic perspective -- we encode some message qudits into a quantum code, send …

    waterloo Repository record for Transmitting Quantum Information Reliably across Various Quantum Channels (opens in a new tab)

  17. Theoretical and Numerical Studies of Phase Transitions and Error Thresholds in Topological Quantum Memories

    … progressive research on the topic of topological quantum computation and information with the focus on the error threshold of the well-known models such as the unpaired Majorana, the toric code, and the planar code. We study the basics of quantum computation and quantum information, and in …

    ucf Repository record for Theoretical and Numerical Studies of Phase Transitions and Error Thresholds in Topological Quantum Memories (opens in a new tab)

  18. New Directions From Old Codes

    Reed-Muller (RM) codes form a classic family studied for its interesting algebraic and combinatorial properties as well as from the perspective of information transmission. They achieve Shannon capacity of the basic binary channel models such as channels with independent erasures or flip errors. …

    maryland Repository record for New Directions From Old Codes (opens in a new tab)

  19. Optimal Quaternary Hermitian Linear Complementary Dual Codes for Entanglement-Assisted Quantum Error Correction

    … suboptimal and optimal parameters from classical codes and import them into entanglement-assisted quantum codes. The thesis begins by introducing classical error correction, followed by a detailed introduction to quantum computing. Topics that are discussed in the introduction include qubits, …

    brock Repository record for Optimal Quaternary Hermitian Linear Complementary Dual Codes for Entanglement-Assisted Quantum Error Correction (opens in a new tab)

  20. Practical design and demonstration of algorithms for quantum devices

    The emergence of noisy intermediate-scale quantum (NISQ) devices represents a significant milestone in the journey towards the development of large-scale fault tolerant quantum computers. These devices have not only opened avenues for demonstrating a quantum advantage but have also advanced the …

    waterloo Repository record for Practical design and demonstration of algorithms for quantum devices (opens in a new tab)

Page 1 of 3