MétaCan
Menu
Back to cohort
Record W4400416841 · doi:10.1364/optica.510312

Photonic quantum walk with ultrafast time-bin encoding

2024· article· en· W4400416841 on OpenAlexafffund
Kate L. Fenwick, Frédéric Bouchard, Guillaume Thekkadath, Duncan England, Philip J. Bustard, Khabat Heshami, Benjamin Sussman

Bibliographic record

VenueOptica · 2024
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversity of Ottawa
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsQuantum walkUltrashort pulseScalabilityQuantumComputer scienceTestbedEncoding (memory)PhotonicsInterferometryQuantum computerPhysicsOptoelectronicsOpticsQuantum mechanicsLaserComputer network

Abstract

fetched live from OpenAlex

The quantum walk (QW) has proven to be a valuable testbed for fundamental inquiries in quantum technology applications such as quantum simulation and quantum search algorithms. Many benefits have been found by exploring implementations of QWs in various physical systems, including photonic platforms. Here, we propose a platform to perform quantum walks based on ultrafast time-bin encoding (UTBE) and all-optical Kerr gating. This platform supports the scalability of quantum walks to a large number of steps and walkers while retaining a significant degree of programmability. More importantly, ultrafast time bins are encoded at the picosecond time scale, far away from mechanical fluctuations. This enables the scalability of our platform to many modes while preserving excellent interferometric phase stability over extremely long periods of time without requiring active phase stabilization. Our 18-step QW is shown to preserve interferometric phase stability over a period of 50 h, with an overall walk fidelity maintained above 95%.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.000

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.

Opus teacher head0.006
GPT teacher head0.211
Teacher spread0.206 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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".

Quick stats

Citations15
Published2024
Admission routes2
Has abstractyes

Explore more

Same venueOpticaSame topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207