Paper Citation Record · LEDGER

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits

As of 10 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2502.08853.

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

pith.paper-citation-record.v1
2502.08853 v4

Coverage vector

measured 56 of 56 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T23:38:11.700215Z

measured 57 of 57 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-04T00:13:34.880808Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

56 of 56 outbound references displayed

verified exact4
verified fuzzy25
unresolved25
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6e962f92-c1dd-487b-b268-643755f73077 · outbound

This paper cites It is clear that a quantum state encoding a feasible solution should rep- resent a N -cycle as an element of N -order permutation group.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits It is clear that a quantum state encoding a feasible solution should rep- resent a N -cycle as an element of N -order permutation group

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.944859Z

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 802ce70d-16a5-44eb-af0d-1dc706b525bf · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-07T23:38:12.927826Z

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 f93e06a0-e9a4-4ab1-acdd-921d465b539a · outbound

This paper cites Label the states whose total weights are less than threshold CT.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Label the states whose total weights are less than threshold CT

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.903377Z

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 dc67ae4a-c841-4cce-a4ff-c9d3a96616ef · outbound

This paper cites indexing unitary.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits indexing unitary

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.886420Z

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 f459b776-2132-4a9d-baea-dc54aa516019 · outbound

This paper cites The above enumeration process has a terrible time complexity of O((N − 1)!), which makes it a NP-hard problem to find all valid HCs [38].

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits The above enumeration process has a terrible time complexity of O((N − 1)!), which makes it a NP-hard problem to find all valid HCs [38]

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.869434Z

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 85dfa6a7-9d44-49ac-af88-85b520b3fba9 · outbound

This paper cites , N− 1} and a new permutation eσ = (k − 1, σ).

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits , N− 1} and a new permutation eσ = (k − 1, σ)

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.851844Z

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 a9532159-07e0-460e-a111-67eb7c805f96 · outbound

This paper cites By performing the above steps for each HC of length N − k, we obtain (N − k − 1)! × (N − k) = (N − k)! new HCs, that is, all ( N − k + 1)-length HCs.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits By performing the above steps for each HC of length N − k, we obtain (N − k − 1)! × (N − k) = (N − k)! new HCs, that is, all ( N − k + 1)-length HCs

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.836102Z

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 56a98171-3977-41b0-adb1-28670399aa7b · outbound

This paper cites The function is to match the second and third sets of registers.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits The function is to match the second and third sets of registers

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.820792Z

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 4236f5d4-77cc-402d-87bb-be1ed3db3f95 · outbound

This paper cites The function is to set the third set of registers to |0⟩ by performing XOR operation on the second and third sets of registers when the first set of registers is in state |111⟩.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits The function is to set the third set of registers to |0⟩ by performing XOR operation on the second and third sets of registers when the first set of registers is in state |111⟩

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.803760Z

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 c540e35e-595a-4a59-af70-41a94560b40c · outbound

This paper cites The function is to free up the first set of registers.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits The function is to free up the first set of registers

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.788531Z

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 53dc8987-b10c-4b16-9a6d-3b0ba6d733db · outbound

This paper cites Discussion.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Discussion

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.772020Z

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 faa2398e-6f13-4c9b-a596-93c0db316ec6 · outbound

This paper cites Ising formulations of many np problems.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Ising formulations of many np problems

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.549233Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2382fa72-b228-4bec-9967-301783222cfe · outbound

This paper cites frame- work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits frame- work

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.738594Z

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 b62efc1f-f29a-46a9-aa37-de77dc812d69 · outbound

This paper cites Initialize l = 1 and set λ = 6 /5.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Initialize l = 1 and set λ = 6 /5

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.722086Z

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 a36ec7e3-fe78-438e-b56f-d124415eb06c · outbound

This paper cites (Grover’s searching module can be seen in Fig.2.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits (Grover’s searching module can be seen in Fig.2

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.706371Z

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 a7899c8c-91d2-4727-a812-7b388b0b2a03 · outbound

This paper cites The probability finding the optimal solution for the above quantum algorithm is at least 1 /2 by computing the expected running time to find the minimum value, given by [33, 34].

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits The probability finding the optimal solution for the above quantum algorithm is at least 1 /2 by computing the expected running time to find the minimum value, given by [33, 34]

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.690681Z

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 060685f0-f93f-4d6a-9787-b317f709b7b4 · outbound

This paper cites Quantum algorithms: an overview.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Quantum algorithms: an overview

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.672850Z

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 dfa208a3-138d-4e9c-af9c-b1ee90e3c2f9 · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.502229Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2154225-d7a6-432c-a889-c16b90e7f3ed · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 19

Resolution: unresolved; raw_fallback, observed 2026-08-07T23:38:12.645033Z

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 a4886102-dbd2-4fb1-854e-0a615578ed2f · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 20

Resolution: unresolved; raw_fallback, observed 2026-08-07T23:38:12.629724Z

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 5dd8ff9c-1c02-4e28-9234-e8ea9b8ed169 · outbound

This paper cites & Tapp, A.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Tapp, A

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.608887Z

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 55a8ed2b-7a4a-4265-b4f7-c2793bb6c29a · outbound

This paper cites W., Hassidim, A.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits W., Hassidim, A

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.520568Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 28119032-16d4-4c8c-bd92-69544dac8830 · outbound

This paper cites & Sipser, M.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Sipser, M

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.526052Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fc8458c-0f03-43b2-ad4c-fa31d013847f · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 24

Resolution: unresolved; raw_fallback, observed 2026-08-07T23:38:12.594961Z

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 1bd2ac59-76b9-40a3-a10b-5ba1d1a352d0 · outbound

This paper cites & Gutmann, S.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Gutmann, S

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.581773Z

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 4bd73933-205b-4f4d-8864-77fb3260be29 · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.540058Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 753fe980-8b25-4b15-8847-30460d6f4bac · outbound

This paper cites & Chakrabarti, B.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Chakrabarti, B

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.544755Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4996638-71dd-4dd2-ad55-c23b5c856ed6 · outbound

This paper cites A., Schmelcher, P.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits A., Schmelcher, P

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.644620Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a5342aac-5c1a-44f8-8eb1-849cdd047fc7 · outbound

This paper cites 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.

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 338ee0d0-3afb-494e-a8c1-7503989d4149 · outbound

This paper cites The traveling salesman problem: An overview of exact and approximate algorithms.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits The traveling salesman problem: An overview of exact and approximate algorithms

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.563785Z

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 bb1f9cd0-f6e1-44f4-9269-7287d4f738a5 · outbound

This paper cites This idea can be ex- tended to our problem.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits This idea can be ex- tended to our problem

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.755400Z

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 b4bc9236-7053-4b9b-8809-2c2d01517f25 · outbound

This paper cites & Pathak, K.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Pathak, K

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.545085Z

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 dd2fa735-be53-40be-873b-4c0a1da82381 · outbound

This paper cites Worst-case analysis of a new heuristic for the travelling salesman problem.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Worst-case analysis of a new heuristic for the travelling salesman problem

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.528605Z

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 f98cea0c-c777-4ec7-8783-991e3ec5d570 · outbound

This paper cites An effective implementation of the Lin– Kernighan traveling salesman heuristic.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits An effective implementation of the Lin– Kernighan traveling salesman heuristic

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.512438Z

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 74503cf4-cbd5-4f3f-bbd2-60a188a827f5 · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 35

Resolution: unresolved; raw_fallback, observed 2026-08-07T23:38:12.495615Z

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 a8171aca-acd6-4940-b820-d796a46abb44 · outbound

This paper cites & Prouvost, A.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Prouvost, A

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.479546Z

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 95d9f4ec-4db7-451f-aae5-6de4c322e0a8 · outbound

This paper cites Boosting Combinatorial Problem Modeling with Machine Learning.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Boosting Combinatorial Problem Modeling with Machine Learning

Reference 37

Resolution: verified exact; local_arxiv, observed 2026-08-07T23:38:12.216643Z

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 dd8288a2-3479-4826-8686-90161883e0c5 · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.609333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3c31dbd-b271-4df5-9cbe-32a7f515ee51 · outbound

This paper cites & Gonz´ alez, F.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Gonz´ alez, F

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.614050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 054ec5a6-f701-4b7b-99b1-5e0f05f8a4e7 · outbound

This paper cites Quantum Annealing and GNN for Solv- ing TSP with QUBO, 134–145 (Springer Nature Sin- gapore, 2024).

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Quantum Annealing and GNN for Solv- ing TSP with QUBO, 134–145 (Springer Nature Sin- gapore, 2024)

Reference 40

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T23:38:12.461581Z

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 2c2c6a7f-9474-4f45-b6f6-c1ed46617ee7 · outbound

This paper cites A., Willsch, D., Maldonado-Romo, A.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits A., Willsch, D., Maldonado-Romo, A

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.624866Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a40372b0-b284-463e-a779-8b4827fb332e · outbound

This paper cites Beyond QUBO and HOBO formulations, solving the Travelling Salesman Problem on a quantum boson sampler.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Beyond QUBO and HOBO formulations, solving the Travelling Salesman Problem on a quantum boson sampler

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.629515Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0efa410-dd75-4760-892c-3aa74895e30b · outbound

This paper cites Tensor-Network Formulation of the Traveling Salesman Problem and Variants.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Tensor-Network Formulation of the Traveling Salesman Problem and Variants

Reference 43

Resolution: verified exact; local_arxiv, observed 2026-08-07T23:38:12.179145Z

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 7dcd2bee-d8dd-448d-8214-58858279fed7 · outbound

This paper cites Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.639995Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 830852d5-116a-4638-9ed6-cd0c6a346a25 · outbound

This paper cites A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.649359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e469cc10-f2ad-4119-8713-ece07c7cc0d0 · outbound

This paper cites Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems

Reference 46

Resolution: verified exact; local_arxiv, observed 2026-08-07T23:38:12.025196Z

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 a2e3cde8-64aa-431f-84e2-9aa12f1c6483 · outbound

This paper cites & Gonciulea, C.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Gonciulea, C

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.659139Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6eacb007-de3c-4c11-ae83-e0c6a4f12fc8 · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 48

Resolution: unresolved; raw_fallback, observed 2026-08-07T23:38:12.445759Z

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 8caedc47-16b4-4d9c-a6ee-43c38f2403c7 · outbound

This paper cites A Quantum Algorithm for Finding the Minimum.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits A Quantum Algorithm for Finding the Minimum

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.667732Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21d11c33-678d-4014-80fb-dd60e0ba9282 · outbound

This paper cites & Tapp, A.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Tapp, A

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.672121Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63290a0f-ef8a-4a9e-9295-f3e9dda4e00e · outbound

This paper cites & Ruskey, F.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Ruskey, F

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.430622Z

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 1e005d77-b567-4983-addf-c3fe4eea43fd · outbound

This paper cites & Wang, J.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Wang, J

Reference 52

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T23:38:12.415045Z

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 fb736e81-6913-4810-8ba6-d77dd9ff65ae · outbound

This paper cites Graph comparison via nonlinear quantum search.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Graph comparison via nonlinear quantum search

Reference 53

Resolution: verified exact; local_arxiv, observed 2026-08-07T23:38:11.984423Z

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 4cabdf1b-f91d-4485-9dc5-f78d0a7825ff · outbound

This paper cites & Saito, N.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Saito, N

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T23:38:12.399052Z

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 a5a31dd6-c7e3-45e5-bd9b-f6eb62c6b82d · outbound

This paper cites & Tapp, A.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits & Tapp, A

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.695699Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9e6c253-8bd2-42c9-b8cd-433b92087251 · outbound

This paper cites an unresolved cited work.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Unresolved cited work

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-07T23:38:11.700215Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 8f7694b6-49a4-4dd4-a36a-ec8e17740fb1 · 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 A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-04T00:13:34.880808Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.