Paper Citation Record · LEDGER

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

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

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

pith.paper-citation-record.v1
quant-ph/9508027 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 14 of 14 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 14 of 14 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:19:13.893889Z

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

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

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 1f99519e-3d12-426c-a6b5-253d8a1e08ce · inbound

Mid-circuit measurement as an algorithmic primitive cites this paper.

Mid-circuit measurement as an algorithmic primitive Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T12:19:13.893889Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d220264-50f1-4f48-8914-45ba809e2144 · inbound

An Improved Quantum Algorithm for 3-Tuple Lattice Sieving cites this paper.

An Improved Quantum Algorithm for 3-Tuple Lattice Sieving Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T10:51:44.386026Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab7f2b8e-9198-4146-a50b-6a646566508b · inbound

Towards Continuous-variable Quantum Neural Networks for Biomedical Imaging cites this paper.

Towards Continuous-variable Quantum Neural Networks for Biomedical Imaging Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T00:22:10.180111Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 83e81a24-faf5-4a2f-99e6-306481cdd98c · inbound

Local Equivalences of Graph States cites this paper.

Local Equivalences of Graph States Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T20:00:06.639734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ff50aa2-3894-4808-b79b-3b0062fb7699 · inbound

Experimental characterization of the hierarchy of quantum correlations in top quark pairs cites this paper.

Experimental characterization of the hierarchy of quantum correlations in top quark pairs Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-02T23:04:25.819394Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc635f61-a812-4504-9d91-130d244eaf44 · inbound

Answer Partitions and Oracle Access Determine Quantum Query Complexity cites this paper.

Answer Partitions and Oracle Access Determine Quantum Query Complexity Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-05-14T20:12:54.600494Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 948b5ecf-9179-45fa-84c8-8b4a846f6917 · inbound

Answer Partitions and Oracle Access Determine Quantum Query Complexity cites this paper.

Answer Partitions and Oracle Access Determine Quantum Query Complexity Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-05-20T22:03:47.293337Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 16809a20-4fa0-41f4-8564-8921a3a75699 · inbound

Answer Partitions and Oracle Access Determine Quantum Query Complexity cites this paper.

Answer Partitions and Oracle Access Determine Quantum Query Complexity Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 4

Resolution: metadata mismatch; local_arxiv, observed 2026-07-01T14:15:47.271826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation a3657022-cee5-458a-aab2-fe887b8ecaef · inbound

Answer Partitions and Oracle Access Determine Quantum Query Complexity cites this paper.

Answer Partitions and Oracle Access Determine Quantum Query Complexity Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 1994

Resolution: unresolved; no resolver link, observed 2026-08-02T14:15:21.080225Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f0da9c3-2fd5-435a-b05a-b227ba640064 · inbound

Architecting Hybrid Quantum-Classical Software Systems: Exploration of the Design Trade-off Space with Quantitative Guarantees cites this paper.

Architecting Hybrid Quantum-Classical Software Systems: Exploration of the Design Trade-off Space with Quantitative Guarantees Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 47

Resolution: verified exact; local_arxiv, observed 2026-06-25T23:18:40.826586Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c9307936-8db9-47c6-bbb0-4a87895007da · inbound

Production of Magic States via $Z$ Bosons and Dark Photons cites this paper.

Production of Magic States via $Z$ Bosons and Dark Photons Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 10

Resolution: verified exact; local_arxiv, observed 2026-07-02T18:37:16.376348Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 89402e33-e707-4b45-9d47-fe92c8b73ceb · inbound

Feynman's clock and hierarchy-informed sampling for quantum error mitigation cites this paper.

Feynman's clock and hierarchy-informed sampling for quantum error mitigation Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 53

Resolution: verified exact; local_arxiv, observed 2026-07-10T22:07:37.359507Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 9b26991d-0de4-46cd-aea7-0f410da9b209 · inbound

Universal Quantum Computation with Multi-Mode Schr\"odinger Cat States Stabilized by Non-Local Dissipation Engineering cites this paper.

Universal Quantum Computation with Multi-Mode Schr\"odinger Cat States Stabilized by Non-Local Dissipation Engineering Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:16.523680Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80b9f7b3-2443-4f1d-b234-75531c9e8b7e · inbound

The Heisenberg Representation of Quantum Computers cites this paper.

The Heisenberg Representation of Quantum Computers Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Reference 1

Resolution: verified exact; arxiv_id, observed 2026-05-13T00:42:51.941007Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.