Quantum state processing through controllable synthetic temporal photonic lattices
Bibliographic record
Abstract
Quantum walks on photonic platforms represent a physics-rich framework for quantum measurements, simulations and universal computing. Dynamic reconfigurability of photonic circuitry is key to controlling the walk and retrieving its full operation potential. Universal quantum processing schemes based on time-bin encoding in gated fibre loops have been proposed but not demonstrated yet, mainly due to gate inefficiencies. Here we present a scalable quantum processor based on the discrete-time quantum walk of time-bin-entangled photon pairs on synthetic temporal photonic lattices implemented on a coupled fibre-loop system. We utilize this scheme to path-optimize quantum state operations, including the generation of two- and four-level time-bin entanglement and the respective two-photon interference. The design of the programmable temporal photonic lattice enabled us to control the dynamic of the walk, leading to an increase in the coincidence counts and quantum interference measurements without recurring to post-selection. Our results show how temporal synthetic dimensions can pave the way towards efficient quantum information processing, including quantum phase estimation, Boson sampling and the realization of topological phases of matter for high-dimensional quantum systems in a cost-effective, scalable and robust fibre-based setup.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".