Paper Citation Record · LEDGER

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound

As of 21 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 5 inbound Pith citation observations for arXiv:2601.19190.

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

pith.paper-citation-record.v1
2601.19190 v1

Coverage vector

measured 31 of 31 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T07:52:54.830473Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T15:54:36.166197Z

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

31 of 31 outbound references displayed

verified exact0
verified fuzzy0
unresolved30
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

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

Outbound references

Observation 213b80b7-43e7-43c4-aea7-9d08b51696f6 · outbound

This paper cites an unresolved cited work.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.644160Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37e18119-f335-4511-bac4-b0dc58ff44ff · outbound

This paper cites That is, ( An)yx ∈ {0, 1, −1}.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound That is, ( An)yx ∈ {0, 1, −1}

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.648873Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc5973fc-2605-43dd-a901-57f7a8b50725 · outbound

This paper cites an unresolved cited work.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.652359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ad37622-431b-41fd-b159-0bf489d482dc · outbound

This paper cites V alues: • Case y1 = x1: ( An)yx = ±(An−1)y′x′.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound V alues: • Case y1 = x1: ( An)yx = ±(An−1)y′x′

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.655784Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97cfd0d6-d9de-4104-bf49-2b1762fbccbc · outbound

This paper cites Therefore, the properties hold for any n.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Therefore, the properties hold for any n

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.659410Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d9e7e8a-303b-4d4e-abd6-2e0b9464b093 · outbound

This paper cites (B3), we have (λ − 1)2 =µ =⇒ λ = 1 ± √ µ.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound (B3), we have (λ − 1)2 =µ =⇒ λ = 1 ± √ µ

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.662646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd8ee918-3e1e-418a-af16-eb79267144f2 · outbound

This paper cites Since Q is a projection opera- tor, it follows that λ ∈ {0, 1}.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Since Q is a projection opera- tor, it follows that λ ∈ {0, 1}

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.666137Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79ea0bce-88e3-44d5-9260-edc4344766dd · outbound

This paper cites In this subsection, we show that the matrix An possesses speciﬁc covariance proper- ties under the action of the Pauli group.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound In this subsection, we show that the matrix An possesses speciﬁc covariance proper- ties under the action of the Pauli group

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.669752Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 408af734-ad5a-4c04-b136-5a032474eb2c · outbound

This paper cites all 16 upper bits q1,...,q k−1 are |0⟩.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound all 16 upper bits q1,...,q k−1 are |0⟩

Reference 9

Resolution: malformed identifier; no resolver link, observed 2026-08-03T07:52:54.672750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60ffb188-8dde-48cb-894e-b510fd384789 · outbound

This paper cites an unresolved cited work.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.675714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a450fd53-1c83-4aaf-8d37-7dc287dcbab7 · outbound

This paper cites For the generation of the reference state, it is known from previous studies that Ck−1Ry(θk) can be implemented with a depth of O(k) even on a 1D chain architecture [20].

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound For the generation of the reference state, it is known from previous studies that Ck−1Ry(θk) can be implemented with a depth of O(k) even on a 1D chain architecture [20]

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.678681Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ebf7f4b-c67b-49b2-b1f3-91fba6212e14 · outbound

This paper cites an unresolved cited work.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.681637Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d4cc8c6-7fc0-4427-99ed-b753650afcbf · outbound

This paper cites Ambainis, A.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Ambainis, A

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.684990Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40020289-a04f-46d6-b217-9285dda36518 · outbound

This paper cites Ambainis, A.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Ambainis, A

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.688114Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59794d8a-29a8-4d8e-9042-10a11cdf89d0 · outbound

This paper cites Klauck, On quantum and probabilistic communica- tion: Las Vegas and one-way protocols, in Proceedings of the 32nd Annual ACM Symposium on Theory of Com- puting (ACM, 2000) pp.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Klauck, On quantum and probabilistic communica- tion: Las Vegas and one-way protocols, in Proceedings of the 32nd Annual ACM Symposium on Theory of Com- puting (ACM, 2000) pp

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.691165Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5f31011-ebd8-43c9-b729-da5d9906eb2e · outbound

This paper cites Aaronson, Limitations of quantum advice and one-way communication, in Proceedings of the 19th IEEE Annual Conference on Computational Complexity (IEEE, 2004) pp.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Aaronson, Limitations of quantum advice and one-way communication, in Proceedings of the 19th IEEE Annual Conference on Computational Complexity (IEEE, 2004) pp

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.694223Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30c3d303-128c-4031-af00-b47480c955aa · outbound

This paper cites Kerenidis and R.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Kerenidis and R

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.698068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e592967-8918-4049-aa83-5e74f3081910 · outbound

This paper cites Paw/suppress lowski and N.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Paw/suppress lowski and N

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.703011Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f67f985-1724-4374-a48e-0a415fd88680 · outbound

This paper cites Li, Z.-Q.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Li, Z.-Q

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.709333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 05844ef6-b6f6-440c-ac36-00f9fe106211 · outbound

This paper cites Brunner, M.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Brunner, M

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.717652Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1f6f3e4-db95-4d69-91ca-0ae025ed2887 · outbound

This paper cites Tavakoli, J.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Tavakoli, J

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.726170Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2283f946-89aa-4589-8d15-82029e30391b · outbound

This paper cites Farkas and J.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Farkas and J

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.735932Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00f93e4d-a62c-4461-8bae-26544ac1e3ff · outbound

This paper cites Miao, Z.-D.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Miao, Z.-D

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.746646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8dd6b92d-30eb-485f-ae3c-8ca548722cb6 · outbound

This paper cites Nayak, Optimal lower bounds for quantum automata and random access codes, in Proceedings of the 40th An- nual Symposium on Foundations of Computer Science (IEEE, 1999) pp.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Nayak, Optimal lower bounds for quantum automata and random access codes, in Proceedings of the 40th An- nual Symposium on Foundations of Computer Science (IEEE, 1999) pp

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.757484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99d341f5-94f5-44a1-8f1c-4fa895ee92ab · outbound

This paper cites Farkas, N.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Farkas, N

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.766900Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4cee3849-0da8-4ffc-9223-f488baf8fec8 · outbound

This paper cites Tavakoli, A.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Tavakoli, A

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.774606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 182370fb-0ea0-47b1-a610-2d71810ca45e · outbound

This paper cites Navascu´ es, A.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Navascu´ es, A

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.782748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e49df4ce-2776-433e-96ec-f5cbeb8872fa · outbound

This paper cites Imamichi and R.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Imamichi and R

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.793158Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b96810e-d737-4123-b383-c34a6c883941 · outbound

This paper cites Manˇ cinska and S.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Manˇ cinska and S

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.805918Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe32b1aa-1f7f-430a-99ff-02b4c50e99a2 · outbound

This paper cites Kondo, Y.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Kondo, Y

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.818269Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c46163fc-dd40-4388-bf24-8e12a8cca121 · outbound

This paper cites Multi-Controlled Quantum Gates in Linear Nearest Neighbor.

Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound Multi-Controlled Quantum Gates in Linear Nearest Neighbor

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-03T07:52:54.830473Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 0754b5bc-507f-4d4a-91c6-7defc5895078 · inbound

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps cites this paper.

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound

Reference 23

Resolution: verified exact; arxiv_id, observed 2026-06-26T02:16:20.321747Z

Source-reported events for the cited work

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

Observation 4b3c1c40-10bb-46ed-b25b-4dcf60ed75f1 · inbound

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps cites this paper.

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound

Reference 23

Resolution: verified exact; arxiv_id, observed 2026-06-26T02:16:20.321747Z

Source-reported events for the cited work

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

Observation 65b2745c-3aae-4468-84ea-1140ac85e636 · inbound

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps cites this paper.

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T15:54:36.166197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa350d8d-9f1b-490d-8d4b-3338bb14272c · inbound

Decoder-Consistent Hamiltonians for POVM-Based Quantum Relaxations cites this paper.

Decoder-Consistent Hamiltonians for POVM-Based Quantum Relaxations Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-07-02T13:06:58.941561Z

Source-reported events for the cited work

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

Observation 2cdf8320-a37b-4cba-9d5d-4e75b58fe5cd · inbound

Optimal Average Success Probabilities of Binary $(n,n-1)$ and $(n,n-2)$ Quantum Random Access Codes via a Proof of the Corresponding Conjectured Bound cites this paper.

Optimal Average Success Probabilities of Binary $(n,n-1)$ and $(n,n-2)$ Quantum Random Access Codes via a Proof of the Corresponding Conjectured Bound Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-14T11:55:56.894226Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.