Pith. sign in

Paper Citation Record · LEDGER

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

As of 9 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-08T06:32:00.761636+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:61934e04dcfb5144ce0cf4fa90fe9080e95b45207d5eb710cb09d8549b255e67

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:1099b34c6b92248a77d84539df1d29a6d5ab76dfa4059d9f81fca7715b38d532

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:73aa4355e9dde12f34085a73a2c378146f11c440121ba9425a713c7a8d5ea5da

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:31ce85fa389f016865bffe6f1f1ce85a549b6ae37e8c1dd8a8d9a1cc92872a87

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

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

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

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

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:302f72c7883ee75195bab6fb4844ab6ac7265810e47bf6157c4622ef38267701

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:3826b7404e2b38a5223e2aba7c4b784ed648834c98f9a73c81c03fa097908a5b

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

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

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

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:144a326a68c4c791c736c1fbd9af46409c82f38c332ed7880cd85ef2195b656b

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:2ebfc5ff3ef9fe4eee9981ef70ad4e052b3ece418cb4f8dee29a464e6212bec0

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

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

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

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:0206623170f36d3b2b4c301ed574f854a10a841ef230fd5723e1981b257d7a81

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

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

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-08T06:32:00.761636+00:00.

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

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:30cc22b7db737c3b9bc1d01b981ec8b7c80bb96fab1ae053c28ca0a15c878183

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:21facf27adb182fb21daf8956a6d1ebbfc41dcbc1e5cad0ee459bf8f9ed0f7d8

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:732ea1ed77b818ef085d5c10da3052c62ab6712d8dac23d0a07609a32f81b186

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:91240ab532afe367abad8edc267e9f70f79bc5f441957a0f080efa136f8ac8ec

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:40a8c05c769a29860a8b095e9353b782996230e0076071d7895ef7c9a06d2ab4

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-08T06:32:00.761636+00:00.

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

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:69edb22514d5288fd5fc95043f1026c5e86630bb2a3ea41b766e5477d915c8a2

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

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

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

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

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

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

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

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:1456b1d7eab1680c36c8359df266c46b42a75c2f915ab8853b63042cdef90c55

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

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:508e37533bdb0dd6a209da087c5f16bdab35f65163b55ae1fb4d11dcd09cbe54

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

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:68d58369272ac90c5fff16b7422fd18f179836f49babfbd99d24257e446527ad

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:27a20639674bc810b788ae34443938787aa397442ac1df3f1f2ffbe025d921be

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

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:36e1665d7cb83008a2403c40acf1930225829bb64a655de1dce11086e01ddc8f

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

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

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

Pith citing papers

No inbound Pith citation observations are available.