Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2211.12519.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-06T12:07:50.639287Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T03:55:56.705644Z
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 7fefb97d-0f64-4c2d-a242-cafb2c561e9a · inbound
A comprehensive benchmark of an Ising machine on the Max-Cut problem cites this paper.
A comprehensive benchmark of an Ising machine on the Max-Cut problem Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate
Reference 2023
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T12:07:50.639287Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 28cf4fab-13f1-4818-820c-1dc0fe4f9cca · inbound
A Unified Local Light-shifts Encoding For Solving Optimization Problems on a Rydberg Annealer cites this paper.
A Unified Local Light-shifts Encoding For Solving Optimization Problems on a Rydberg Annealer Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate
Reference 46
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T03:55:56.707287Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.