Integration of microcombs with PCMs: Strategies, architectures, and performance
Bibliographic record
Abstract
With the advent of the AI big data era, traditional memory–compute separation architectures face critical energy efficiency bottlenecks. As a promising pathway for next-generation storage–compute integrated photonic systems, the combination of microcombs and phase-change materials (PCMs) offers a compelling solution to these challenges. Microcombs are distinguished by their compact footprint, high integration potential, low power consumption, and wide spectral range, while PCMs feature rapid switching speeds, excellent nonvolatility, low energy requirements, and high-density multilevel storage capability. This review differs from previous work by not only discussing PCMs-based photonic memory and neuromorphic computing or focusing on specific material systems, but by systematically integrating the perspectives of both microcomb generation and PCMs optimization, highlighting their synergy in photonic computing architectures. Moreover, the development of silicon photonics integration technology enables the seamless combination of microcombs and PCMs. This review summarizes the current optimization strategies for microcavity frequency combs and PCMs, outlining methods to achieve more stable frequency comb generation and approaches to enhance the switching performance of PCMs. The integration of microcombs’ stability and PCMs switching characteristics is a key focus of this review — an aspect rarely addressed in earlier literature. Furthermore, it explores the potential advantages in computational performance offered by integrating microcavity combs with PCMs in photonic devices. Finally, the review discusses the current challenges and explores potential future development directions for these technologies, offering guidance for applications in the field of photonic computing and directions for device optimization.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".