Pith. sign in

Paper Citation Record · LEDGER

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks

As of 14 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2607.27915.

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

pith.paper-citation-record.v1
2607.27915 v1

Coverage vector

measured 47 of 47 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-31T23:12:45.195313Z

measured 47 of 47 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+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

47 of 47 outbound references displayed

  • verified exact2
  • verified fuzzy0
  • unresolved45
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3f8a77e3-bd1f-4bac-95f0-6f5653c740d6 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 1

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:39.137580Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:39.137580Z digest=sha256:fd95f5e3986ca634f89ec0d231b4e8ec9f27d162cfa5688b53ddfa2bb4dcd1ad

Observation 635668df-5bd1-42ea-8104-3b030c6317df · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:39.289107Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:39.289107Z digest=sha256:50558f7be9d9dbad030646b6a6f63fb63ef8e75c1a32ef9296aaf48b3895461d

Observation f0bdcf27-85c9-4ebc-b26a-460f81506f73 · outbound

This paper cites Khot, On the power of unique 2-prover 1-round games, inProceedings of the thiry-fourth annual ACM sympo- sium on Theory of computing(2002) pp.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Khot, On the power of unique 2-prover 1-round games, inProceedings of the thiry-fourth annual ACM sympo- sium on Theory of computing(2002) pp

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:39.494564Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:39.494564Z digest=sha256:57bb111d337b5932d6c77ed76c42e48750ab81c883bd9baaf4a0bd340689c98b

Observation 9e5a21f9-7ec6-4116-9e3e-91c06810c1d8 · outbound

This paper cites Halld´ orsson and J.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Halld´ orsson and J

Reference 4

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:39.693368Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:39.693368Z digest=sha256:6c98279c1051a3b0cc487a3610f1933604b8b4b653c4061795e36556dff755e0

Observation ee986671-4c58-490c-97a7-af9d4d24d1e0 · outbound

This paper cites Krysta, M.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Krysta, M

Reference 5

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:39.902194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:39.902194Z digest=sha256:9ed4e7e12ba9bee8e61200659b6f8302390dda524aba2df5ff14fde3896a054a

Observation ea1f4b82-ab28-42d9-9a3e-ac9e044cd101 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 6

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:40.156230Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:40.156230Z digest=sha256:abfb5d7eab462ac71c81df29240f2fd56298c1ddd1f2f44c5632877c9fb1290d

Observation e2566ec5-ffe5-4473-8af2-676b5e225b9b · outbound

This paper cites Bang-Jensen, G.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Bang-Jensen, G

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:40.408155Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:40.408155Z digest=sha256:73b9e1540acc81349c68c921ce25c8eeeff6504f9473ffc772e10f751934a0ab

Observation ae396c29-4c5c-4e42-8a93-0090aff3c86b · outbound

This paper cites Lucas, Ising formulations of many np problems, Fron- tiers in Physics2, 5 (2014).

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Lucas, Ising formulations of many np problems, Fron- tiers in Physics2, 5 (2014)

Reference 8

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:40.528357Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:40.528357Z digest=sha256:55dff051140ef3775f7adfe89f145cd6b3a6fb932aed5289c99ba5cf17c1fa37

Observation ff3f85ef-aec4-4060-9aaa-63dc084eeb31 · outbound

This paper cites Solving large Minimum Vertex Cover problems on a quantum annealer.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Solving large Minimum Vertex Cover problems on a quantum annealer

Reference 9

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:40.621721Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:40.621721Z digest=sha256:e6494802a0f80cafaf8b465a313f8619b2b28652c4ee0cb2a8348528283561ef

Observation 1e382892-0d36-4188-a9a3-6fe418c590d6 · outbound

This paper cites A Quantum Approximate Optimization Algorithm.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks A Quantum Approximate Optimization Algorithm

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:40.774898Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:40.774898Z digest=sha256:4c9e9fed4421e038943d959d5297093338f18b1d08edece1abe526d5e23c3b81

Observation a546ac90-b95c-4962-8f75-3d9bcbc0582f · outbound

This paper cites Peruzzo, J.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Peruzzo, J

Reference 11

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:40.909074Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:40.909074Z digest=sha256:7cd5f0ea3b5e51c8a524dd28100b7b66be3e119398e4b126f2ec22292c3d5457

Observation fbe2373e-37a4-4725-b154-23abe4e1a977 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:40.983608Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:40.983608Z digest=sha256:fcab677ea6b3513c75d833818c60f4d6d8531124c5ac6f5003344993ad0db06d

Observation f4425f2f-4f17-4c9b-b5a2-cf1409380fb6 · outbound

This paper cites Herman, R.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Herman, R

Reference 13

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.100588Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.100588Z digest=sha256:13b2e1c0a0d743d28b898ff2a5fba04ea879c886f847fb325b376cbfdf106875

Observation 210b8db4-d2fc-4c6f-a53c-ffb88c876fcb · outbound

This paper cites Hadfield, Z.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Hadfield, Z

Reference 14

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.190845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.190845Z digest=sha256:b25699374331ff54577ae1238f8877eaf8cffcd58955e73d7258aa3d149b80b0

Observation 95d4a07a-f4a8-42bc-a7b8-c683f881308d · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 15

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.277040Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.277040Z digest=sha256:7b52380d0d7dc6ce9c9df52aa93eadc159f2277ea0bb0b1f951e5d0bbbe26dc1

Observation d51906eb-e3c8-447c-a505-e4acafa5cce2 · outbound

This paper cites Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation

Reference 16

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.345862Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.345862Z digest=sha256:56ce1803190ab599f142dd95f0c467bf2fb223941423793d45eb22cd83a2ed02

Observation d7c86ae4-7863-4c9c-ab16-9bc675701fd6 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.420642Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.420642Z digest=sha256:13e9c83ce3b60deb549f16fbf6ab0c2fab808691773d221ad264c7f84b3dd92d

Observation 25f12b41-92ef-47c0-878f-4e79ff6241b8 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 18

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.502120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.502120Z digest=sha256:ccf448879bef61bd76a83d1f2dfa8677e518d9b6823742bcf04a284c7a405d58

Observation 92900795-e819-4d8a-b239-f3a4d13c127e · outbound

This paper cites Bucher, J.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Bucher, J

Reference 19

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.622713Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.622713Z digest=sha256:b96e6867d512ab479e872689370ca4d1739fda19aee958bef2d990e2b875c9c0

Observation eaaba28a-aef7-46c7-9d05-facde4aae593 · outbound

This paper cites Montanaro, Quantum speedup of branch-and-bound algorithms, Physical Review Research2, 013056 (2020).

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Montanaro, Quantum speedup of branch-and-bound algorithms, Physical Review Research2, 013056 (2020)

Reference 20

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.689671Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.689671Z digest=sha256:873450d93fffac9b36bd5c83cfe9440bb5b46247016ccf57d6e6f598038d256a

Observation c771dc67-9ccd-4d97-8388-1374b410a4b2 · outbound

This paper cites Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms

Reference 21

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.774715Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.774715Z digest=sha256:52520230d63ed416b16381c584d6e0ad42eb7a7377c5e263c71d5657694c9db7

Observation 7fe91d6d-1836-4469-a210-6cfd239d1f73 · outbound

This paper cites Wilkening, A.-I.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Wilkening, A.-I

Reference 22

Resolution
verified exact
doi, observed 2026-07-31T23:15:54.629022Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-07-31T23:12:41.848026Z digest=sha256:507333ffe0ec51d7fe66838c5231c39ae62d00195d031248d9f4e1e9b1d390d4

Observation b944450e-f645-4b08-8948-7f061f2509ca · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 23

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:41.929052Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:41.929052Z digest=sha256:cd161cdfdfac86411e34877ad82570e3062bb0bcca4383aafc976bb1ad33f4e3

Observation 37f8a1be-2d58-41c3-acf9-f8bf172c80f6 · outbound

This paper cites Bravyi, A.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Bravyi, A

Reference 24

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.049967Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.049967Z digest=sha256:61885127921155f33eb0b5a22449a31b39bed65264a4bdf9b518c0b8fb9c83de

Observation fd600999-03dc-46ee-bf3b-8bcb9940f421 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 25

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.133030Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.133030Z digest=sha256:b9805295fd6bbe8a4da9e3769d2d86f60567aa84874c2a07a7f77a2485386aac

Observation c46a8f7e-1208-49fb-925f-32dbaea66f4e · outbound

This paper cites Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem

Reference 26

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.250918Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.250918Z digest=sha256:be7173d52a518be42844fb299e6ecf803c07fef7973979f52a7454ffc698d2ac

Observation 2b677fb5-7014-4207-93ce-1c6f29076878 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 27

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.377223Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.377223Z digest=sha256:bf7234b9cb8b3d7fd781542658ce5a4c4eba5e10231ef8b3c9bb15618b8a7598

Observation 423aa2f2-0580-4e8d-9bb3-3083bed88a58 · outbound

This paper cites Dupont, B.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Dupont, B

Reference 28

Resolution
verified exact
doi, observed 2026-07-31T23:15:54.476586Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-07-31T23:12:42.460060Z digest=sha256:af33e29e7ee08732434cdf13edb5696b7f8aeac81e4f830a1ea855e5b490bc7d

Observation ac9f777f-f700-4255-8013-eb2db4ba3481 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 29

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.564021Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.564021Z digest=sha256:122b326fe282d24697aebd0c82ab14f30e8f7a96717c4168119db675f266c619

Observation f87ecf6c-4c23-4311-8531-3e6a2b476c42 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 30

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.626488Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.626488Z digest=sha256:c93ffbb0a9e4c6f2974bff68e50b6a98b599cbbd0d52a658868eab08fc13bb14

Observation a2cf7dc9-ad96-4814-8d3b-2ca72b065796 · outbound

This paper cites Barenco, C.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Barenco, C

Reference 31

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.727033Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.727033Z digest=sha256:6206c12652a57409d0c3c4bbedf3d00d24f581fc65181a0c5dd39e2cde8cf523

Observation a3c04181-8a18-45a2-9ed2-291216c918d4 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 32

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.814735Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.814735Z digest=sha256:59636e7317589349eefbc80cf48c846e56bd31191b6757bb9b4c808c1056fd97

Observation cd3d2e17-25f1-4658-b6d0-519651f4b4f0 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 33

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.874764Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.874764Z digest=sha256:aea16972a3115b61c1172a8ed1636b8552246edbece25dcffffc0603f996a8ba

Observation 2b9cb814-19d6-4348-88ac-818187d80af0 · outbound

This paper cites Claudon, J.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Claudon, J

Reference 34

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:42.968311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:42.968311Z digest=sha256:a3bcaa57efacf96a92f977ac5575a9ef5777dd8f493244527e6885b1786585ad

Observation 3759833b-5356-4938-91bf-efac58bdd890 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 35

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:43.156109Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:43.156109Z digest=sha256:b5e9719a0c6eb139bfe79126994f20b04bc2f07ca8e8162f02a8db3c52bda868

Observation 4c7c0bb0-f9eb-44e1-a193-98e520005de3 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 36

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:43.288570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:43.288570Z digest=sha256:68c9d586079634855831aa26c6c8f0eea0782a956694a1db304c7ff2a9056fe4

Observation e58869f9-9478-48c6-9896-5638afaa93c8 · outbound

This paper cites Wilkening, Constraint-oriented biased quantum search for general constrained combinatorial optimization prob- lems (2025), arXiv:2512.08384 [quant-ph].

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Wilkening, Constraint-oriented biased quantum search for general constrained combinatorial optimization prob- lems (2025), arXiv:2512.08384 [quant-ph]

Reference 37

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:43.448588Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:43.448588Z digest=sha256:15287c90be4a8c8556b35e5e780009caea92e27ec3be88ff6146bcfd04f039fb

Observation b3e233d9-4038-409b-a059-39d49227f180 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 38

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:43.642888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:43.642888Z digest=sha256:7a522abcfacb864705d37a68d04fd6b64d2c70b31926f93a87b1e60d7f30a20a

Observation 5e4ef7d1-9dbc-4498-ae1b-b720306b63c3 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 39

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:43.829861Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:43.829861Z digest=sha256:ec0f938a6c27cc05ecd22bdc2c879340d6c2a005971b746141ba5ea833c9ce6a

Observation b30b9559-a128-4aef-93b2-02f5cfd71fdb · outbound

This paper cites A transpose-symmetry argument eliminates all odd-order contributions.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks A transpose-symmetry argument eliminates all odd-order contributions

Reference 40

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:44.013125Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:44.013125Z digest=sha256:ab4e959be8aaa5f0ce74acf50ded097f0dabacbbd90c7b9764d6583089d48434

Observation 52ac6752-535e-4d55-98e7-605ceec84f3f · outbound

This paper cites A single Trotter step of the walk unitary is Ustep(τ) = Y i∈V eiτΠ N(i) Xi = Y i∈V CN(i) RXi (τ), τ= t p .(C1) The full state-preparation circuit is Up(t) =U step(τ) p.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks A single Trotter step of the walk unitary is Ustep(τ) = Y i∈V eiτΠ N(i) Xi = Y i∈V CN(i) RXi (τ), τ= t p .(C1) The full state-preparation circuit is Up(t) =U step(τ) p

Reference 41

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:44.211384Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:44.211384Z digest=sha256:2620fda5aa220954582d9e5819ef037f7a9517e1aaef86914382f4574353bc81

Observation 9613cb29-9af4-45b8-a23d-0a955513de98 · outbound

This paper cites The exact continuous-time evolution is U(t) =e itHMVC.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks The exact continuous-time evolution is U(t) =e itHMVC

Reference 42

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:44.402767Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:44.402767Z digest=sha256:96185fa02a082461dfad8882fafd8c7d4ae362da098ee46d3fa2fc01111f8eda

Observation 201c7bad-41df-4bd8-ab4d-160f197a10d7 · outbound

This paper cites Over the tested system sizes, the approximately linear growth of the maximum block entropy withnis consistent with volume-law entanglement.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Over the tested system sizes, the approximately linear growth of the maximum block entropy withnis consistent with volume-law entanglement

Reference 43

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:44.571366Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:44.571366Z digest=sha256:9e7b3a10f32600af2fe45bc512f397b7f85d4baa5cfe70a1fdc9f3e75898ab91

Observation 595811a0-491f-4e52-90ce-d7db93f4534d · outbound

This paper cites The final quantum state can be written as |ψ(t)⟩= Y i∈V CN(i) RXi(t)|Ω⟩, where the ordering of vertices induces a sequential structure in the circuit.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks The final quantum state can be written as |ψ(t)⟩= Y i∈V CN(i) RXi(t)|Ω⟩, where the ordering of vertices induces a sequential structure in the circuit

Reference 44

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:44.707490Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:44.707490Z digest=sha256:e0fe6d6a074da7c63a319e3cae18847c483258a75019e0e74e1dd6f76bb80790

Observation 0a12b1b7-043b-4e14-9e33-e42a1051c160 · outbound

This paper cites Introducing the change of variablesx:= cos 2(t), x∈[0,1], the expectation value can be expressed as a relaxed pseudo-Boolean function.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Introducing the change of variablesx:= cos 2(t), x∈[0,1], the expectation value can be expressed as a relaxed pseudo-Boolean function

Reference 45

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:44.857717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:44.857717Z digest=sha256:3d1ba7c8e7d152705780f577297e69f559286bf2c9c623b8f54eaa646dc03cee

Observation b797cd06-ac48-43b4-ba81-8ab687673a05 · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 46

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:45.042465Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:45.042465Z digest=sha256:02310819c4ccf5ccc767753fcab66470fe35d22e399d7d014c0c0a275018bad2

Observation 2addc057-66dd-43a7-9a94-32423c0d243d · outbound

This paper cites an unresolved cited work.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Unresolved cited work

Reference 47

Resolution
unresolved
no resolver link, observed 2026-07-31T23:12:45.195313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:12:45.195313Z digest=sha256:e10ef756e867cefc48559d0bf0a4f6d057c223b556f32819b285106267a34846

Pith citing papers

No inbound Pith citation observations are available.