UNIVERSITY OF CALGARY Toward Practical Solid-State Based Quantum Memories
Bibliographic record
Abstract
Quantum information processing promises to have transformative impacts on information and communication science and technology. Photonic implementation of quantum information pro-cessing is among successful candidates for implementation of quantum computation and is an essential part of quantum communication. Linear optical quantum computation, specifically the KLM scheme [1], and quantum repeaters [2, 3] are prominent candidates for practical photonic quantum computation and long-distance quantum communication. Quantum memories for photons are key elements for any practical implementation of these schemes. Practical quantum memories require theoretical and experimental investigations into quantum memory protocols and physical systems for implementations. The present thesis is focused on studying new approaches toward practical solid-state based quantum memories. First, I present a proposal for a new quantum memory protocol called the controllable-dipole quantum memory [4]. It represents a protocol, in a two-level system, without any optical control that is shown to be equivalent to the Raman type-quantum memory. Then I include our studies on the quantum memory based on the refractive index modulation of the host medium [5]. It is shown that it can resemble the gradient echo quantum memory without a spatial gradient in the external field. These two protocols can be implemented in rare-earth doped crystals. With regards to using new physical systems, I present a proposal based on nitrogen vacancy centers [6]. This may pave the way toward micron-scale on-chip quantum memories that may contribute to the implementation of integrated quantum photonics. Finally, I studied the precision requirements for the spin echo technique [7]. This technique is necessary to extend the storage time in solid-state quantum memories, in which the coherence times are limited by spin inhomogeneous broadening. i List of published papers and papers to be submitted
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.004 | 0.002 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.003 | 0.005 |
| Insufficient payload (model declined to judge) | 0.043 | 0.009 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".