Paper Citation Record · LEDGER

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier

As of 4 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2606.07322.

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

pith.paper-citation-record.v1
2606.07322 v2

Coverage vector

measured 41 of 41 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-12T14:53:14.813854Z

measured 41 of 41 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-04T06:34:03.388597+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

41 of 41 outbound references displayed

verified exact0
verified fuzzy0
unresolved41
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9a29a0a1-dd7e-4ca6-abff-15a5e22fd36e · outbound

This paper cites Fork >2, letα 1 < 1 2, thenf(α 1) is monotonically increasing.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Fork >2, letα 1 < 1 2, thenf(α 1) is monotonically increasing

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a16c997-4b2e-454e-a516-4c56e9538498 · outbound

This paper cites Finally, we calculate the optimal query complexity.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Finally, we calculate the optimal query complexity

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 970a5510-2e06-458b-8b7e-98446aa400ab · outbound

This paper cites atα 1 =α 2 = 1 3, which is below the mini- mum value off, i.e.,f( 1.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier atα 1 =α 2 = 1 3, which is below the mini- mum value off, i.e.,f( 1

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0b4ebfa-910d-42b4-badc-a87da88f77f8 · outbound

This paper cites The corresponding query complexity isO ∗(20.918295...n) = O∗(1.889881.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier The corresponding query complexity isO ∗(20.918295...n) = O∗(1.889881

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb07ccac-7807-4f99-9974-bdaf914c8e02 · outbound

This paper cites qubits” denotes the required number of qubits, “num.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier qubits” denotes the required number of qubits, “num

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f49cfe3b-c13a-4cfc-9e5c-70604318cf50 · outbound

This paper cites Quantum speedups for exponential-time dynamic programming algorithms.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Quantum speedups for exponential-time dynamic programming algorithms

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ef19d81-320e-440f-a06e-1e2eb6551db8 · outbound

This paper cites Weakly measured while loops: peeking at quantum states.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Weakly measured while loops: peeking at quantum states

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8466c4d3-b64a-4751-a346-30ed71126983 · outbound

This paper cites A quantum speedup algorithm for tsp based on quantum dynamic pro- gramming with very few qubits.Theoretical Computer Science, page 115423, 2025.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A quantum speedup algorithm for tsp based on quantum dynamic pro- gramming with very few qubits.Theoretical Computer Science, page 115423, 2025

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4497a1c2-bd83-40e7-a59e-9482c63bc6e4 · outbound

This paper cites Deterministic preparation of dicke states.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Deterministic preparation of dicke states

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7e5ddc2-d908-4476-8828-6318b5b2095a · outbound

This paper cites Grover mixers for qaoa: Shifting complexity from mixer design to state preparation.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Grover mixers for qaoa: Shifting complexity from mixer design to state preparation

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b2d1ec7-1f64-4827-9393-014aea80f0cc · outbound

This paper cites Dynamic programming treatment of the travelling salesman problem.Journal of the ACM (JACM), 9(1):61–63, 1962.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Dynamic programming treatment of the travelling salesman problem.Journal of the ACM (JACM), 9(1):61–63, 1962

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa4c96c5-50ff-474e-8175-9662b9e37114 · outbound

This paper cites Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d9a4238-d47f-480e-ac41-883c8fc05bea · outbound

This paper cites Tight bounds on quantum searching.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Tight bounds on quantum searching

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ebcfc12e-6127-4ef0-9585-cea48635320f · outbound

This paper cites Quantum Amplitude Amplification and Estimation.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Quantum Amplitude Amplification and Estimation

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e62edd0-c31c-427a-8752-087f592b2531 · outbound

This paper cites Deterministic Quantum Search via Recursive Oracle Expansion.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Deterministic Quantum Search via Recursive Oracle Expansion

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d91ef21-0efa-428c-bac1-73050c32d964 · outbound

This paper cites Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2633826-c06f-4407-9b73-6c0e6ad7839e · outbound

This paper cites Survey of methods of solving tsp along with its implementation using dynamic programming approach.International journal of computer applications, 52(4), 2012.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Survey of methods of solving tsp along with its implementation using dynamic programming approach.International journal of computer applications, 52(4), 2012

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f45f429-5e2c-400a-886a-c29e576996b4 · outbound

This paper cites Graph comparison via nonlinear quantum search.Quantum Information Processing, 18(10):302, 2019.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Graph comparison via nonlinear quantum search.Quantum Information Processing, 18(10):302, 2019

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bb9ab91-fafc-4dda-a1d9-e13ba8ac713c · outbound

This paper cites Coherence in spontaneous radiation processes.Physical review, 93(1):99, 1954.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Coherence in spontaneous radiation processes.Physical review, 93(1):99, 1954

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e5dfd550-c005-4859-ae51-cf3a5db6bf8d · outbound

This paper cites A Quantum Algorithm for Finding the Minimum.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A Quantum Algorithm for Finding the Minimum

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 514755e7-4949-450a-8bee-065879ca0f37 · outbound

This paper cites Statistical tables for biological, agricultural and medical research.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Statistical tables for biological, agricultural and medical research

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa76e08e-d6ce-4842-98b8-f7428bcb6ec4 · outbound

This paper cites Constructing large controlled nots.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Constructing large controlled nots

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f54aa27b-678d-4c17-b08d-fd29218818f2 · outbound

This paper cites Grover adaptive search for constrained polynomial binary optimization.Quantum, 5:428, 2021.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Grover adaptive search for constrained polynomial binary optimization.Quantum, 5:428, 2021

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e864231-e3d6-42c0-bff2-777dfe5b469a · outbound

This paper cites Quantum random access memory.Physical review letters, 100(16):160501, 2008.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Quantum random access memory.Physical review letters, 100(16):160501, 2008

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3bc0de6e-8814-4742-b48a-f7d702200d61 · outbound

This paper cites A fast quantum mechanical algorithm for database search.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A fast quantum mechanical algorithm for database search

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1dc9d39-3f2a-4911-af6a-3df3b7ecbf3a · outbound

This paper cites Resilience of quantum random access memory to generic noise.Prx Quantum, 2(2):020311, 2021.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Resilience of quantum random access memory to generic noise.Prx Quantum, 2(2):020311, 2021

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d1cc674d-b74c-41d3-bb94-6b5946186d6a · outbound

This paper cites Hardware-efficient quantum random access memory with hybrid quantum acoustic systems.Physical review letters, 123(25):250501, 2019.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Hardware-efficient quantum random access memory with hybrid quantum acoustic systems.Physical review letters, 123(25):250501, 2019

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b3e5a4d-cd0e-4378-a566-2882e871c876 · outbound

This paper cites A dynamic programming approach to sequencing problems.Journal of the Society for Industrial and Applied mathematics, 10(1):196–210, 1962.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A dynamic programming approach to sequencing problems.Journal of the Society for Industrial and Applied mathematics, 10(1):196–210, 1962

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2edc8ee4-aecd-4523-bb72-7ebc61c9b564 · outbound

This paper cites Dicke state quantum search for solving the vertex cover problem.Mathematics, 30 13(18):3005, 2025.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Dicke state quantum search for solving the vertex cover problem.Mathematics, 30 13(18):3005, 2025

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a0e7d76-9e12-4a74-b69f-6196e38d4d71 · outbound

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

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier The traveling salesman problem: An overview of exact and approximate algorithms

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f0ff8be-ae5c-4350-90f8-3f79f5882e27 · outbound

This paper cites Generalised phase kick-back: the structure of computational algorithms from physical principles.New Journal of Physics, 18(3):033023, 2016.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Generalised phase kick-back: the structure of computational algorithms from physical principles.New Journal of Physics, 18(3):033023, 2016

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4de585ba-84b4-477e-b84a-f5b1270821fc · outbound

This paper cites Grover algorithm with zero theoretical failure rate.Physical Review A, 64(2):022307, 2001.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Grover algorithm with zero theoretical failure rate.Physical Review A, 64(2):022307, 2001

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd950778-0ef4-4afe-b621-9345ef208484 · outbound

This paper cites Combinatorial optimization via highly efficient quantum walks.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Combinatorial optimization via highly efficient quantum walks

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94cf56a2-4902-4235-aee5-696287b47f36 · outbound

This paper cites Quantum classification and search algorithms using spinorial representations.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Quantum classification and search algorithms using spinorial representations

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 557af5db-3455-4ab6-bfc0-8f43b8579798 · outbound

This paper cites A generalisation of the phase kick- back.Quantum Information Processing, 22(3):143, 2023.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A generalisation of the phase kick- back.Quantum Information Processing, 22(3):143, 2023

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2793bbf-5934-4ff7-92c6-e10cdff15ac1 · outbound

This paper cites Robust quantum minimum finding with an application to hypothesis selection.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Robust quantum minimum finding with an application to hypothesis selection

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c6aa1183-2b33-4386-b199-7eb3675dbad6 · outbound

This paper cites An algorithm to generate a random cyclic permutation.Information processing letters, 22(6):315–317, 1986.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier An algorithm to generate a random cyclic permutation.Information processing letters, 22(6):315–317, 1986

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bfa95c8-c5bb-4271-a3d6-e68efd374c20 · outbound

This paper cites A bucket-brigade quantum random access memory.Nature Physics, pages 1–6, 2026.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A bucket-brigade quantum random access memory.Nature Physics, pages 1–6, 2026

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 410f5e5a-b274-4bf4-8ec5-d3fc4c59f1bd · outbound

This paper cites Overview of sattolo’s algorithm.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Overview of sattolo’s algorithm

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32fd375b-24df-4cc6-9d4d-4afc1b2182ae · outbound

This paper cites Quantum state preparation with optimal circuit depth: Implementations and applications.Physical Review Letters, 129(23):230504, 2022.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier Quantum state preparation with optimal circuit depth: Implementations and applications.Physical Review Letters, 129(23):230504, 2022

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 61457928-0d45-43fe-b883-cd425b2d67ef · outbound

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

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.