Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Reducing the Number of Qubits from $n^2$ to $n\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2402.18530.
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-09T06:31:02.800959+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T23:38:11.553982Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-16T17:48:11.564560Z
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 a5342aac-5c1a-44f8-8eb1-849cdd047fc7 · inbound
A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits cites this paper.
A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Reducing the Number of Qubits from $n^2$ to $n\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T23:38:11.553982Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 77ff2133-f960-46b2-9a81-515cb919913f · inbound
Resource-efficient variational quantum solver for the travelling salesman problem and its silicon photonics implementation cites this paper.
Resource-efficient variational quantum solver for the travelling salesman problem and its silicon photonics implementation Reducing the Number of Qubits from $n^2$ to $n\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
Reference 64
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:13:33.138621Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 481e80f2-329c-48db-a126-284f44a6ee5a · inbound
Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem cites this paper.
Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Reducing the Number of Qubits from $n^2$ to $n\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T18:59:10.995591Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2060e0f0-eac7-4feb-8601-e3fd5afc0c19 · inbound
Constraint-Aware Quantum Optimization via Hamming Weight Operators cites this paper.
Constraint-Aware Quantum Optimization via Hamming Weight Operators Reducing the Number of Qubits from $n^2$ to $n\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
Reference 63
- Resolution
- verified exact
- arxiv_id, observed 2026-05-16T17:48:11.566186Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation f2976a68-75e4-4596-b8cd-e4c5a84e6e95 · inbound
A Resource-Efficient Variational Quantum Framework for the Traveling Salesman Problem cites this paper.
A Resource-Efficient Variational Quantum Framework for the Traveling Salesman Problem Reducing the Number of Qubits from $n^2$ to $n\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
Reference 12
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T15:31:10.585264Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.