Pith. sign in

Paper Citation Record · LEDGER

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

As of 22 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-22T06:32:14.747728+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:bc1209b461690178d6ce01e3eb7be4435b16732882667c713fe0c79443e4f83d

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:9cf67a15f4f7c39fe196f2996e144227dc2e3fbed09d921133dcc3f187b5c60d

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:6242272bc712310481a8f2816ec8959b62fa7ea92d8767ae7d8a28bd93b6ecc1

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:1543b856e865a968faa96fdcd3092ccececca9677a1d2a159ee386eacb9fd90a

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:0e8c380b1a440e0a230a79bb764720e0fd21f2ca0a54d0f191dc844e12ffbf61

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:0ff11e0d3ec27b5a4788cedab5eb6e6b6f47bca73c03ff5522c3cb5c3f92b75a

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:9626d10a492dbb485451010eb89717ec733dd67cc0d0f4a100b6d11ab7df36ac

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:6c05145930a7ef6180db642269228120cf588d8ee206d3e2115179561eca695c

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:801cfc0ea53132fdaf33c8959a723469bfc970f4d65c28111962f9eceaacc6cf

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:83f6bc4b8056135c160c7adc3723a6fc55c1357e77b6f15ccec5ad74f8aa5503

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:3bca4b033d2b899eaab7e6ec276ce1fcfbce92fc206f02a9b8f1b16d90aecfe7

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:6312e30225b4dfef533915b74565d92d60c24f6b99930b000dbc6fdcfd8acb52

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:79874bf72a171ed64eef2f9cf2b9badceac4ba18e1146711fe07f28650eecad5

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:e88cc516299d246936a7e54a8246203b85d4e88187f8c71183de385c172be24c

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:a5fa6e6427d1b634ec697fbb8f7265d43f85e2723e60b509621a8ede3ef3f112

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:ddcc540e88ab59205e7b62b951661b853b3403a2a1bff2920ab17758fc755695

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:9d4ae500c0a235996297979e338132c311d38fa6d01ffb14fdf5ad45598ec3c5

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:5d696abd851dfe6503d5251433f5a8a56bf7121da64f45cf42fec606838454e2

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:fa74d5f785b44cb4c176f7383634c47d1133831dfb7bb617cb017762b8eaadae

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:d1aa0ced0b6bb164237cf546ae78fc05c9f53123bf9bdaba439e57bc84f0edf5

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:b30af656d9a9472f8c17cf07162a54e995bc86557d0223e9aafdffdb991b44bf

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-22T06:32:14.747728+00:00.

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

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:d6a6d8636c7b71cc46b3fdc8499e6b5b897ea60cffee972286f137d61e922e2e

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:56bc9f6f6f8f7464d3fca84d4c11fa60f373be3abaaaaa3440fc923c4241b1ab

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:0ad659683a46dea586ef13768a9a5acbcbcfb299173294488b890392c7417c36

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:e12283c0dfaef10ce2fc922f843a4d5a67a6f4583a26b01a2c4946fcd38727d4

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:7057decbcec178e96f1d7712ef74eb50a167bdf7e26fae14fb6693cdc970b8e4

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-22T06:32:14.747728+00:00.

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

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:91eb8367409166bea357a336ef242f7d142ae1f7a0bec3d2b838b04fb1c15ffc

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:16903597289b9c8e8268698af91721630401c86bbe587ff751ebb284fcc93462

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:91c5af7fa555d6a49022e7e5ad91288443234a6a4fb5d20aaa414f9fce44c271

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:8b11f051557da508c56f57817718e30fdf658edcf0f2d159a44f83a690b5cf98

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:955d987e1016e4454f285ddc52098fe46f717a112ec67b796014d9107b5919dc

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:1febc540c24f83f8d7ae54ef50ca0803c8ab901404936a2404dbe4602a80dd95

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:b65c2f0d7992ca3aa56562720e536f90b59852514fcb5d31de123c6eabd81f55

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:8047f695a8faf14bd8946b92aa2651b14ccbde26217c642b196b115af6786cad

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:53134f816eba63aae559e3fc026884bea543e505cd74f09f4aa3964eec3c9713

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:406eb604dc012aed34a231b22e62b8f50318127fc712a6f30350804f67ea5fd4

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:4eb80123fd002dda41139f5d54b20d789b4d55bc638e249a55715fa0d5e0e74d

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:ee0a4373c00906a955ca97970eafb84d52d8a0b73113cf0b765e16c6067bd17b

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:868fc97dba0fa971f3c3a47e9e516f45fa662c286ee514de2392216b354b00e2

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:f6f59d11f0420e2d2360bd4f51935a6351e8234a4bd57e57da079a0bac416248

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:f8eaf7278b1db3d4f42c89703a66d430006d43dfb59450814149773f1691cfa6

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:5961c914fd3dd9d1d85be85c8e02f5d7d98e4f6d4dfdee4cbcb0a89d9a692adf

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:cfa626251027b6256a765557431898930845d97f723fef77f16c96712ce5a58d

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:fdfb89265e15744929c9482b89fd66eb59589b96f8839735a743bbd2439089bb

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:70e2fb7ecda1624c2708d4677df84b92864eda0b7508ec413692676a55d032a6

Pith citing papers

No inbound Pith citation observations are available.