Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1812.11619.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T12:54:13.752771Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-13T04:52:17.285444Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 8e66238b-d624-4295-8fbf-255b45802f03 · inbound
Quantum computing and artificial intelligence: status and perspectives cites this paper.
Quantum computing and artificial intelligence: status and perspectives Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers
Reference 133
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T12:54:13.752771Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cc1c0b25-a36d-4807-a4f9-95629bb4ebe3 · inbound
Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings cites this paper.
Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:01:59.191610Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8dbd9247-859f-427c-938c-d343888f548c · inbound
QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning cites this paper.
QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers
Reference 20
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T23:21:02.817441Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.