Paper Citation Record · LEDGER

Unitary Complexity and the Uhlmann Transformation Problem

As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2306.13073.

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

pith.paper-citation-record.v1
2306.13073 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 8 of 8 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 8 of 8 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-14T04:19:01.111617Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-19T08:52:13.182209Z

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 c21a7308-2b31-494c-89ab-4a4812c77382 · inbound

A complexity theory for non-local quantum computation cites this paper.

A complexity theory for non-local quantum computation Unitary Complexity and the Uhlmann Transformation Problem

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-07T12:56:28.365360Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dbf9aec3-542e-4f5f-8924-0390a7f45b98 · inbound

Fully Quantum Computational Entropies cites this paper.

Fully Quantum Computational Entropies Unitary Complexity and the Uhlmann Transformation Problem

Reference 14

Resolution: verified exact; arxiv_id, observed 2026-05-19T08:52:13.185996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 28ce2888-28bc-45e7-9cb4-a06916c6c36c · inbound

Local transformations of bipartite entanglement are rigid cites this paper.

Local transformations of bipartite entanglement are rigid Unitary Complexity and the Uhlmann Transformation Problem

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-05T05:36:41.111599Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation efd4c647-22dc-448e-b60b-cb02b21da252 · inbound

A slightly improved upper bound for quantum statistical zero-knowledge cites this paper.

A slightly improved upper bound for quantum statistical zero-knowledge Unitary Complexity and the Uhlmann Transformation Problem

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T17:02:21.821195Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 672ec303-692d-4534-bcc0-360b54ece781 · inbound

Accessible Quantum Correlations Under Complexity Constraints cites this paper.

Accessible Quantum Correlations Under Complexity Constraints Unitary Complexity and the Uhlmann Transformation Problem

Reference 47

Resolution: verified exact; arxiv_id, observed 2026-05-10T10:39:38.702552Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation bb943ca2-2dd0-459b-8e8a-11a98dc102c7 · inbound

The Keyl-Werner algorithm is not optimal for spectrum estimation cites this paper.

The Keyl-Werner algorithm is not optimal for spectrum estimation Unitary Complexity and the Uhlmann Transformation Problem

Reference 226

Resolution: unresolved; no resolver link, observed 2026-07-30T13:06:21.104067Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ec4417a-979f-447c-afd8-76a3870057ea · inbound

TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability cites this paper.

TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability Unitary Complexity and the Uhlmann Transformation Problem

Reference 162

Resolution: unresolved; no resolver link, observed 2026-08-14T04:19:01.111617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc8030da-af6c-467a-a3ed-13f6c1fe0287 · inbound

Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform cites this paper.

Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform Unitary Complexity and the Uhlmann Transformation Problem

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-12T19:50:03.081601Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.