Paper Citation Record · LEDGER

On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels

As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:0709.2090.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
0709.2090 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T18:12:12.555647Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

4
pith, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation ef5d907b-6cbf-4588-9f2b-35faf58a8ce3 · inbound

Riemannian Optimization for Holevo Capacity cites this paper.

Riemannian Optimization for Holevo Capacity On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-10T18:12:12.555647Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 661e0c3b-0dd9-431c-90ce-4d68ce35206b · inbound

Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete cites this paper.

Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-05T20:25:29.324897Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7e28546-a162-4f40-bd2b-99bce8cad15f · inbound

Sufficient conditions for additivity of the zero-error classical capacity of quantum channels cites this paper.

Sufficient conditions for additivity of the zero-error classical capacity of quantum channels On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T08:15:27.095700Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cebb634b-eac6-4288-bf0d-bf6cf1bab930 · inbound

The Shape of Information: Global Information Geometric Limits in Multi-task Quantum Systems cites this paper.

The Shape of Information: Global Information Geometric Limits in Multi-task Quantum Systems On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels

Reference 24

Resolution: verified exact; local_arxiv, observed 2026-08-03T16:38:30.535324Z

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.