Production of photonic universal quantum gates enhanced by machine learning
Bibliographic record
Abstract
We introduce photonic architectures for universal quantum computation. The first step is to produce a resource state which is a superposition of the first four Fock states with a probability greater than or equal to ${10}^{\ensuremath{-}2}$, an increase by a factor of ${10}^{4}$ over standard sequential photon-subtraction techniques. The resource state is produced with near-perfect fidelity from a quantum gadget that uses displaced squeezed vacuum states, interferometers, and photon-number-resolving detectors. The parameters of this gadget are trained using machine learning algorithms for variational circuits. We discuss in detail various aspects of the non-Gaussian state preparation resulting from the numerical experiments. We then propose a notion of resource farms where these gadgets are stacked in parallel, to increase the success probability further. We find a trade-off between the success probability of the farm, the error tolerance, and the number of gadgets. Using the resource states in conventional gate teleportation techniques, we can then implement weak tunable cubic phase gates. The numerical tools that have been developed could potentially be useful for other applications in photonics as well.
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.001 | 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.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".