Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A quantum compiler design method by using linear combinations of permutations
As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2404.18226.
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-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-11T13:53:03.730516Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-02T23:37:27.170033Z
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 c3e6d6a7-a0d5-4dad-a112-029919a88ca5 · inbound
Error analysis of quantum operators written as a linear combination of permutations cites this paper.
Error analysis of quantum operators written as a linear combination of permutations A quantum compiler design method by using linear combinations of permutations
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T13:53:03.730516Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f780fb60-481c-45d5-8625-d1d3162be337 · inbound
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions cites this paper.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions A quantum compiler design method by using linear combinations of permutations
Reference 6
- Resolution
- verified exact
- arxiv_id, observed 2026-05-09T06:45:40.817849Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 3d43e977-e1c7-494d-b592-f358021e1641 · inbound
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions cites this paper.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions A quantum compiler design method by using linear combinations of permutations
Reference 6
- Resolution
- verified exact
- arxiv_id, observed 2026-05-14T22:03:02.799090Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation a9af1bfd-f54f-48c8-beb4-cdda616ae3fa · inbound
Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition cites this paper.
Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition A quantum compiler design method by using linear combinations of permutations
Reference 19
- Resolution
- verified exact
- arxiv_id, observed 2026-06-30T16:35:12.694376Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 5947d560-6b99-4dd3-b4d6-51294be5d7fc · inbound
Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition cites this paper.
Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition A quantum compiler design method by using linear combinations of permutations
Reference 19
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T23:37:27.171742Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.