Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Photonics in Switching

Optical buffer and memory [PDF Not Yet Available In IEEE Xplore]

H.J.S. Dorren

Published Aug 1, 2008• 0 citations
Publisher
DOI
10.1109/ps.2008.4804195

Related papers

All-optical memories and flip-flops [PDF Not Yet Available In IEEE Xplore]

Antonella Bogoni, Giancarlo Prati

International Conference on Photonics in Switching•Aug 1, 2008•0 citations

Optical interface for SFQ buffer memory

聡 品田, 弘高 寺井, 尚也 和田 +1 more

IEICE Technical Report; IEICE Tech. Rep.•Feb 21, 2011•0 citations

3-D Optical Memories

Sadik Esener

Summary not available at time of printing.

Optical Computing•Jan 1, 1993•0 citations

All-optical flip-flop exploiting nano-photonics [PDF Not Yet Available In IEEE Xplore]

Kiyoshi Asakawa

International Conference on Photonics in Switching•Aug 1, 2008•0 citations

Optical memory: What a difference

NPG Asia Materials•Mar 29, 2010•0 citations

Entanglement buffering with multiple quantum memories

Álvaro G. Iñesta, Bethany Davies, Sounak Kar +1 more

Entanglement buffers are systems that maintain high-quality entanglement, ensuring it is readily available for consumption when needed. We study the performance of a two-node buffer, where each node has one long-lived quantum memory for entanglement storage and multiple short-lived memories for generation. Freshly generated entanglement may be used to purify stored entanglement, which degrades over time. Stored entanglement may be removed due to consumption or failed purification. We derive analytical expressions for the entanglement availability and the average fidelity upon consumption. Our solutions are computationally efficient and provide fundamental bounds to the performance of purification-based entanglement buffers. We also show that purification must be performed as frequently as possible to maximise the average fidelity of entanglement upon consumption, even if this often leads to the loss of high-quality entanglement due to purification failures. Moreover, we obtain heuristics for the design of good purification policies in practical systems.

arXiv:2502.20240•npj Quantum Information•Feb 20, 2026•6 citations
Entanglement buffers are systems that maintain high-quality entanglement, ensuring it is readily available for consumption when needed. We study the performance of a two-node buffer, where each node has one long-lived quantum memory for entanglement storage and multiple short-lived memories for generation. Freshly generated entanglement may be used to purify stored entanglement, which degrades over time. Stored entanglement may be removed due to consumption or failed purification. We derive analytical expressions for the entanglement availability and the average fidelity upon consumption. Our solutions are computationally efficient and provide fundamental bounds to the performance of purification-based entanglement buffers. We also show that purification must be performed as frequently as possible to maximise the average fidelity of entanglement upon consumption, even if this often leads to the loss of high-quality entanglement due to purification failures. Moreover, we obtain heuristics for the design of good purification policies in practical systems.