{"as_of":"2026-08-09T15:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49d83cc8301f8cb0937483887cd9821b0f27d692fba9c84ce39853675df934c3","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T10:08:39.368614Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:08:14.738163Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.11418","snapshot_observed_at":"2026-08-01T23:08:14.738163Z","title":"Simu- lating quantum walk hamiltonians without pauli decom- position.arXiv preprint arXiv:2601.11418, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.15543","last_updated":"2026-07-17T01:25:12Z","snapshot_observed_at":"2026-08-07T03:13:36.479426Z","submitted_at":"2026-07-17T01:25:12Z","title":"Benchmarking Hybrid Quantum-Classical Algorithms for Power Grid Optimization Problems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T23:08:14.738163Z"},"links":{"cited_paper":"/paper/2601.11418","citing_paper":"/paper/2607.15543"},"observation_digest":"sha256:ccc96aab33c3597e5ac4b19245dc56a52c89242c9a49278bfe0f647871a558f9","observation_id":"21b118a4-0d82-4340-98dd-6de6cd9dc4af","resolution":{"observed_at":"2026-08-01T23:08:14.738163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.11418/citation-record","integrity":"/paper/2601.11418/integrity","json":"/paper/2601.11418/citation-record.json","paper":"/paper/2601.11418"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.00675","last_updated":"2019-06-06T07:17:48Z","snapshot_observed_at":"2026-08-08T15:38:18.715792Z","submitted_at":"2018-05-02T08:45:20Z","title":"Hamiltonian Simulation in the Interaction Picture","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.00675","snapshot_observed_at":"2026-08-03T10:08:30.954372Z","title":"Hamiltonian simulation in the interaction picture.arXiv preprint arXiv:1805.00675, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:30.954372Z"},"links":{"cited_paper":"/paper/1805.00675","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:8783714c0ca2492f8123b4f4ab6c6b7499e617e50e4c173c5cc2b3e42994c554","observation_id":"8c4dcd33-268b-4363-9c54-5ae39eec0326","resolution":{"observed_at":"2026-08-03T10:08:30.954372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.029327Z","title":"Optimal hamilto- nian simulation by quantum signal processing.Physical review letters, 118(1):010501, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.029327Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:45e365b2d8b836604a0ff886b00feb5f30c269bc12b4b4f290f8caf4a2cd1cf0","observation_id":"2db337d0-a959-4891-a9d7-83b1e10cab28","resolution":{"observed_at":"2026-08-03T10:08:31.029327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0910.4157","last_updated":"2011-11-02T04:53:41Z","snapshot_observed_at":"2026-07-06T01:58:43.038763Z","submitted_at":"2009-10-22T19:55:15Z","title":"Black-box Hamiltonian simulation and unitary implementation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0910.4157","snapshot_observed_at":"2026-08-03T10:08:31.077855Z","title":"Black- box hamiltonian simulation and unitary implementation","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.077855Z"},"links":{"cited_paper":"/paper/0910.4157","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:cfa2decb07b87d97e6d49663eaa67e9cfcb2ec1693bc0e2e1482388673023442","observation_id":"221d5642-bc13-4fe2-8af9-be1455c35f00","resolution":{"observed_at":"2026-08-03T10:08:31.077855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.149370Z","title":"Shadow hamil- tonian simulation.Nature Communications, 16(1):2690, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.149370Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:be215b09203d5cdb6c0b8f4f215a9331dc1a8141f90e104ebd4f10ce84aa83d8","observation_id":"64e63c99-fdf8-4c72-8744-37347a97a029","resolution":{"observed_at":"2026-08-03T10:08:31.149370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.01973","last_updated":"2018-09-03T18:54:53Z","snapshot_observed_at":"2026-08-08T10:32:53.312678Z","submitted_at":"2018-04-05T17:51:01Z","title":"The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.01973","snapshot_observed_at":"2026-08-03T10:08:31.224376Z","title":"The power of block-encoded matrix powers: im- proved regression techniques via faster hamiltonian sim- ulation.arXiv preprint arXiv:1804.01973, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.224376Z"},"links":{"cited_paper":"/paper/1804.01973","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:53c186cd7aa59eef00753db55e6d80ee9597ff3a5d4867d52d5a73eb04545c19","observation_id":"453e3b81-4177-417f-a83c-dbd68db73baf","resolution":{"observed_at":"2026-08-03T10:08:31.224376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.324585Z","title":"Hamiltonian simulation with nearly optimal dependence on all parameters","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.324585Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:bb7847b675e438523afee5676e9530e64a15cc61e283de52dc66955997c9ae5e","observation_id":"dca4e7ea-8741-4eee-9496-fdeffc6b908b","resolution":{"observed_at":"2026-08-03T10:08:31.324585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.437194Z","title":"Efficient quantum walk on a quantum processor.Nature commu- nications, 7(1):11511, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.437194Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:7662a70a720c5df4863203058a0b76d290a87aa15fef938401957beb3766deab","observation_id":"74707974-21eb-4177-ba7f-e5d1c9fd6e4c","resolution":{"observed_at":"2026-08-03T10:08:31.437194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.515814Z","title":"Universal computation by quantum walk.Physical review letters, 102(18):180501, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.515814Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:a883351a62d39df9986a27617e0e664676008a6454142d7616cfde6270d802b7","observation_id":"ed129036-b6e4-4d35-b94b-e428a74a0fc8","resolution":{"observed_at":"2026-08-03T10:08:31.515814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.586710Z","title":"Spatial search by quantum walk.Physical Review A, 70(2):022314, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.586710Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:769bf515065257187e47e6d63c8f4e05971ba562d3b778e49f27f4d486cd97f8","observation_id":"9a20b1e8-7149-4a27-9c36-318a18e60dda","resolution":{"observed_at":"2026-08-03T10:08:31.586710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.673804Z","title":"Continuous- time quantum walks on dynamic graphs.Physical Review A, 100(1):012306, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.673804Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:bb576a8ed650a015a0548b59a09973a1036011db777a2b746fca024f75f9b323","observation_id":"3da3a55a-3cf8-4ebb-82e8-46157228a8e5","resolution":{"observed_at":"2026-08-03T10:08:31.673804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.760256Z","title":"Finding a marked node on any graph via continuous-time quantum walks.Physical Review A, 102(2):022227, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.760256Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:3309d004cd4b0f906844a592e99c94bfea200a91ab478b8111db7ca02bbb0543","observation_id":"9436c1c8-a289-4756-b55c-de57dfe4136b","resolution":{"observed_at":"2026-08-03T10:08:31.760256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.854523Z","title":"Continuous- time quantum-walk spatial search on the Bollob´ as scale- free network.Physical Review A, 101(2):022310, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.854523Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:ca4986cf6447b329f695c279acea82a3da13a9b0066ec2dbea780c46c792a19c","observation_id":"5e4d2c56-b85b-496d-b11a-69a0199de300","resolution":{"observed_at":"2026-08-03T10:08:31.854523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.936257Z","title":"Quadratic speedup for spatial search by continuous-time quantum walk.Physical re- view letters, 129(16):160502, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.936257Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:778ce24b32d1d15c93500036eab28feacc205b15fa6e3d727463554713d6a76e","observation_id":"fec692cd-9bc0-4f93-a1a5-d1e891007195","resolution":{"observed_at":"2026-08-03T10:08:31.936257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:31.987663Z","title":"Spatial search on johnson graphs by continuous- time quantum walk.Quantum Information Processing, 21(2):74, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:31.987663Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:8530723d910a0f5418408674e9da4ccc84e974e209ad8672cc65b0a1ff4e5cae","observation_id":"afce0a8a-8501-46e2-9e3b-a31466fff22f","resolution":{"observed_at":"2026-08-03T10:08:31.987663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.066029Z","title":"Link prediction with continuous-time classi- cal and quantum walks.Entropy, 25(5):730, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.066029Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:b23e63f07eebfc4dd3a1af84ae527b9ff78103409079f5c719a3448423b05fb1","observation_id":"3675e9ab-3a94-4b97-a4ce-3e55e85c829a","resolution":{"observed_at":"2026-08-03T10:08:32.066029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.145245Z","title":"Quantum link prediction in complex networks.Physical Review A, 107(3):032605, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.145245Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:6a12b2cd577e2be08a035e35857928aad2d73d93154988c7949bc472dfa16b56","observation_id":"9900e26d-8517-41f2-8da8-8d14445c9cca","resolution":{"observed_at":"2026-08-03T10:08:32.145245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.232958Z","title":"A 2d quan- tum walk simulation of two-particle dynamics.Science, 336(6077):55–58, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.232958Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:8264e74d1a122d3e2cc7cd5efe7c8f1b3dfedbc39f93539e5e67848ed53c49bb","observation_id":"509227d6-fbc6-4cfc-8f9c-8162f875df06","resolution":{"observed_at":"2026-08-03T10:08:32.232958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.347693Z","title":"Combinatorial op- timization via highly efficient quantum walks.Physical Review Research, 2(2):023302, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.347693Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:9c2ab7b3f314c5cee5b0e7f256eb0c73bd55ce088c7437563e1bd314822cfddb","observation_id":"69a54808-f671-4db6-8cf4-35e1060a4aac","resolution":{"observed_at":"2026-08-03T10:08:32.347693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.445534Z","title":"Quantum walk-based portfolio optimi- sation.Quantum, 5:513, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.445534Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:b167270e508d32d89f21f21576646b86f671db2c0809a2fa4c38caea8b470ee0","observation_id":"214712bd-c6d7-4947-acc9-6119d1be5206","resolution":{"observed_at":"2026-08-03T10:08:32.445534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11620","last_updated":"2024-06-21T13:29:54Z","snapshot_observed_at":"2026-08-06T08:10:28.418135Z","submitted_at":"2024-06-17T15:04:26Z","title":"Quantum walk informed variational algorithm design","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11620","snapshot_observed_at":"2026-08-03T10:08:32.552007Z","title":"Quantum walk informed variational algorithm design.arXiv preprint arXiv:2406.11620, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.552007Z"},"links":{"cited_paper":"/paper/2406.11620","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:6b0a9fd35f577068f936c42f9a4e1965e624ea0282202904b6279ab62170f726","observation_id":"97cb13e0-d652-4f99-9237-1e012627bfd1","resolution":{"observed_at":"2026-08-03T10:08:32.552007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.590519Z","title":"Ef- ficient sparse state preparation via quantum walks.npj Quantum Information, 11(1):143, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.590519Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:a1fc2a0d96adc9dce4241a73615fb095abe0a1a2400fdcca85d01f47a0c2ec65","observation_id":"1ac38331-9817-4d16-8ab9-b4dce3c573ae","resolution":{"observed_at":"2026-08-03T10:08:32.590519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.684719Z","title":"Protein-dna target search relies on quantum walk.Biosystems, 201:104340, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.684719Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:763eb16ca17b492d12499ece977240e317dc4613e8ef255b91425c52bf096b44","observation_id":"78e45c36-05d8-4c99-953c-56dcffcad5c7","resolution":{"observed_at":"2026-08-03T10:08:32.684719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.779166Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.779166Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:07b30565471f74e10fbfc4b1b92c6c47fe2c0ec386985d6eec2c6ac2ba3d124a","observation_id":"694baa4c-93e1-405f-bb84-6608eef0665c","resolution":{"observed_at":"2026-08-03T10:08:32.779166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:32.912491Z","title":"Experimental realization of continuous-time quantum walks on directed graphs and their application in pagerank.Optica, 7(11):1524– 1530, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:32.912491Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:d9082bacea6db20044b40ed31bfa4dab9d3206ae97fdf9ae586e11b1944201b6","observation_id":"5c126650-c0c8-4143-be14-8d5995f64b52","resolution":{"observed_at":"2026-08-03T10:08:32.912491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:33.051842Z","title":"Continuous-time quantum walk based centrality testing on weighted graphs.Scientific Reports, 12(1):6001, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:33.051842Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:d58d9dbfcd457561eba8cf0e1957aa8d6360e5ae27dbaecbc4f869a810e171e3","observation_id":"49aedc5f-3224-41ce-85b3-bb3e55de2773","resolution":{"observed_at":"2026-08-03T10:08:33.051842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:33.198312Z","title":"Transport and quantum walk of nonclassical light in cou- pled waveguides.Physical Review A—Atomic, Molecular, and Optical Physics, 78(4):042304, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:33.198312Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:161f91694caba84e95b085ec0c13b2e9501c02464b672b79694dc831cb68db9e","observation_id":"82706fa1-0dca-49ff-8be6-a22705c24a5d","resolution":{"observed_at":"2026-08-03T10:08:33.198312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:33.373785Z","title":"Re- alization of quantum walks with negligible decoher- ence in waveguide lattices.Physical review letters, 100(17):170506, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:33.373785Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:80337b8dbf3918b90dee29f7510d9ad85b4a73a480fd017f44278c95e937ef01","observation_id":"227151eb-0b29-4ba0-aea9-6a05b33eb21a","resolution":{"observed_at":"2026-08-03T10:08:33.373785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:33.498717Z","title":"Experimental perfect state transfer of an entangled photonic qubit.Na- ture communications, 7(1):11339, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:33.498717Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:4b0f93dc3d02de782bc6f7012ba7568f7b0928cd6b12ea63c597a7d19e6e3a10","observation_id":"cad2cbf6-89b6-4bea-9485-bd420db67873","resolution":{"observed_at":"2026-08-03T10:08:33.498717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:33.618626Z","title":"Experimental two- dimensional quantum walk on a photonic chip.Science advances, 4(5):eaat3174, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:33.618626Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:2c8f7ec9d872329827a31b8fc70a7963550fb8ffb5962da09e3819fa8c01fedf","observation_id":"b1367bf9-82b3-4b8a-9b62-15a58ffe6a7b","resolution":{"observed_at":"2026-08-03T10:08:33.618626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.08889","last_updated":"2022-12-17T14:59:21Z","snapshot_observed_at":"2026-08-02T00:57:19.559100Z","submitted_at":"2022-12-17T14:59:21Z","title":"Implementation of Continuous-Time Quantum Walks on Quantum Computers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.08889","snapshot_observed_at":"2026-08-03T10:08:33.750985Z","title":"Implemen- tation of continuous-time quantum walks on quantum computers.arXiv preprint arXiv:2212.08889, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:33.750985Z"},"links":{"cited_paper":"/paper/2212.08889","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:6e275116fbaddde01ec0f50495a897ea7e515dc806c8c7e947cbe9240c7242ba","observation_id":"1d785000-58e1-408a-9a11-b2ebdaf4c361","resolution":{"observed_at":"2026-08-03T10:08:33.750985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:33.860586Z","title":"Circuit design for continuous time quantum walks on cycle graph and its experimental demonstration in ibm quantum computer","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:33.860586Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:cc531b179edb590f53a62a8d46424e433f9c55e329fba40e7628610c1f15001a","observation_id":"2b5cf694-ba9d-4a09-b871-c948e013ff69","resolution":{"observed_at":"2026-08-03T10:08:33.860586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:33.988882Z","title":"Efficient quantum cir- cuits for continuous-time quantum walks on composite graphs.Journal of Physics A: Mathematical and Theo- retical, 50(5):055303, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:33.988882Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:6f5bcc0f37f0a4d304ca9c2157b0dfc4e4f2bd77a58f8b2b217ccc94be0fd524","observation_id":"744f8cc1-0622-4fe1-b4ff-fa8385aff930","resolution":{"observed_at":"2026-08-03T10:08:33.988882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:34.101034Z","title":"Deterministic search on star graphs via quantum walks.Physical review letters, 128(5):050501, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:34.101034Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:6f8dc072325c1c969e4b4c980c08371228cb715006a3c499e96fe74e5c257c07","observation_id":"e4873a4d-67e8-4438-bc47-89f32f347807","resolution":{"observed_at":"2026-08-03T10:08:34.101034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:34.219244Z","title":"Efficient quantum cir- cuit implementation of quantum walks.Physical Review A—Atomic, Molecular, and Optical Physics, 79(5):052335, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:34.219244Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:f7f60bd8c357cc2c7fa2e306a2030f37fcb59516de4232dbbbc5c8e9db36a92b","observation_id":"a555dccc-e5d5-450b-9c52-97976a8f76b9","resolution":{"observed_at":"2026-08-03T10:08:34.219244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:34.406259Z","title":"Quantum computa- tion and decision trees.Physical Review A, 58(2):915, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:34.406259Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:90ec6e561c4468c7b0a0f579a33ebb2003fb8fac5f1043e8559f22a7c0adfd9f","observation_id":"f9847c17-01fb-4134-b966-b8acb09e510f","resolution":{"observed_at":"2026-08-03T10:08:34.406259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.14905","last_updated":"2026-05-25T14:46:01Z","snapshot_observed_at":"2026-08-04T09:33:45.502910Z","submitted_at":"2025-10-16T17:24:14Z","title":"Quantum circuit model for continuous-time quantum walks on random graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.14905","snapshot_observed_at":"2026-08-03T10:08:34.541794Z","title":"Continuous-time quantum walk on a random graph using quantum cir- cuits.arXiv preprint arXiv:2510.14905, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:34.541794Z"},"links":{"cited_paper":"/paper/2510.14905","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:41b39ef722f453e8e793c4583629fd9a308b534c920cdc3f6d21947a4d94aaf9","observation_id":"606e7a65-f7c0-4c17-b17c-ad25f86e9359","resolution":{"observed_at":"2026-08-03T10:08:34.541794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:34.647404Z","title":"Isolated vertices in continuous-time quantum walks on dynamic graphs.Physical Review A, 100(6):062325, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:34.647404Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:ee90f876da913b497c6a1174f674b13a03aa89a9f55f5917c958da89fe089f13","observation_id":"36754c00-6fca-42ea-a7ab-296c099c9c95","resolution":{"observed_at":"2026-08-03T10:08:34.647404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:34.726645Z","title":"Simplify- ing continuous-time quantum walks on dynamic graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:34.726645Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:afb1473c2612613a10f39ebf2758626f4adbbe3f5ab6475ec674264e63711ec8","observation_id":"443b1247-f63d-498a-922a-e36c6be86da8","resolution":{"observed_at":"2026-08-03T10:08:34.726645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:34.869486Z","title":"Imple- menting quantum gates using length-3 dynamic quantum walks.Physical Review A, 104(4):042604, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:34.869486Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:06ded1dde660c049732d2b9eba4552ace6ebee8db1c1738fed13ade21c5d0ca6","observation_id":"e37cfbc4-250d-4861-a74e-950d2e36f998","resolution":{"observed_at":"2026-08-03T10:08:34.869486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.00415","last_updated":"2022-09-01T12:46:55Z","snapshot_observed_at":"2026-07-06T13:47:54.786907Z","submitted_at":"2022-09-01T12:46:55Z","title":"Relating the multi-angle quantum approximate optimization algorithm and continuous-time quantum walks on dynamic graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.00415","snapshot_observed_at":"2026-08-03T10:08:34.976211Z","title":"Relating the multi-angle quantum ap- proximate optimization algorithm and continuous-time quantum walks on dynamic graphs.arXiv preprint arXiv:2209.00415, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:34.976211Z"},"links":{"cited_paper":"/paper/2209.00415","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:6f69f0cd00627944721f70cafe0d330d0fcba3f75380a7ab01de06e6bbfb5249","observation_id":"9b6a4996-8dfc-40d4-8a18-1d7f3efb18e1","resolution":{"observed_at":"2026-08-03T10:08:34.976211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-03T10:08:35.122555Z","title":"A quantum approximate optimization algorithm.arXiv preprint arXiv:1411.4028, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:35.122555Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:e34ab74107104b910314996c5e32b113ff1cca9e9c617e1e05581d121a28f1d8","observation_id":"a6330b8d-c1c5-4d50-b5bf-4a2ff6dbc382","resolution":{"observed_at":"2026-08-03T10:08:35.122555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:35.245714Z","title":"Analyzing the quan- tum approximate optimization algorithm: ans¨ atze, sym- metries, and lie algebras.PRX Quantum, 6(4):040345, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:35.245714Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:810f4b7fe6c600a7f6e5b89d3dbe2e329d5d163d0b56c8e24b2b3fd274b36def","observation_id":"7e1fc1d9-a871-4db5-8099-ae29826abbf3","resolution":{"observed_at":"2026-08-03T10:08:35.245714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:35.367988Z","title":"Quantum approximate optimization algorithm with random and subgraph phase operators","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:35.367988Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:592c4d353433d4ed15c581f2d1c8151f78c92b4d9c5b686962552a165f24c0d2","observation_id":"1bb35581-9d9c-437d-acba-7f7c8613144a","resolution":{"observed_at":"2026-08-03T10:08:35.367988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:35.484147Z","title":"The symmetry-based expressive qaoa for the maxcut problem.Advanced Quantum Tech- nologies, page 2500199, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:35.484147Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:707f1ad1c8642e6de7a619321dd54e1cc048be416d37039c67915ab240dcbdc3","observation_id":"7c1b3cfc-5e18-41a1-a58a-5ad9673a3cd4","resolution":{"observed_at":"2026-08-03T10:08:35.484147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:35.609859Z","title":"Preparing angular momentum eigen- states using engineered quantum walks.Physical Review A, 110(6):062214, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:35.609859Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:0c6709d3aec260adf0bfc199fb7ff5c22810b99235ef31c4bc6e4b64daab6774","observation_id":"27aa056d-87fc-4016-9ec9-9f6bb75de787","resolution":{"observed_at":"2026-08-03T10:08:35.609859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:35.731838Z","title":"Imple- 14 mentation of a continuous-time quantum walk on a sparse graph.Physical Review A, 110(5), November 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:35.731838Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:ab92ee5f6b87dd0badb1a22833d6e55839da6868b13f582c0d295959703e84d1","observation_id":"bac03bf6-5fa4-4a56-a90a-a539ec73544e","resolution":{"observed_at":"2026-08-03T10:08:35.731838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:35.857131Z","title":"Generalized trotter’s formula and sys- tematic approximants of exponential operators and inner derivations with applications to many-body problems","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:35.857131Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:75092fe2ea457f88912cfb98543212d7377ab69000b738985ed8978581da370c","observation_id":"0732ebdc-8405-49f8-acc4-0bd5e38f28ac","resolution":{"observed_at":"2026-08-03T10:08:35.857131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:35.982199Z","title":"Quclear: Clifford extrac- tion and absorption for quantum circuit optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:35.982199Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:54fa868a52c69d56e444c3af76c34d57c996c2ed04a42a705297018c13ea6d28","observation_id":"b4bcdc7b-bded-4b85-b0f7-6fd28d8a59f8","resolution":{"observed_at":"2026-08-03T10:08:35.982199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:36.104370Z","title":"Sparsepauliop.https://docs.quantum.ibm.com/ api/qiskit/qiskit.quantum_info.SparsePauliOp","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:36.104370Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:1b9b622e575121b8cbf88e90caad035fb9c80251702cd33e7364addccd9cd9df","observation_id":"5d876210-19b6-49fc-82e6-cd9f6a86a9fe","resolution":{"observed_at":"2026-08-03T10:08:36.104370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:36.230024Z","title":"Efficient attributed graph matching and its application to image analysis","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:36.230024Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:34cb895abf496630c5b839e4467a619f938ff53799e515d1b0276e05b16a4da5","observation_id":"e62b2718-81c1-4129-ba90-eb1277a5125c","resolution":{"observed_at":"2026-08-03T10:08:36.230024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:36.340478Z","title":"Gpm: A graph pattern matching kernel with diffusion for chem- ical compound classification","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:36.340478Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:4a8aaaf8e970fd9186a7917e0ad79a49985f0062ba21cb9da95d100ce5da9d0c","observation_id":"8a30df8a-b0b8-4853-bc52-52db69f90114","resolution":{"observed_at":"2026-08-03T10:08:36.340478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:36.556768Z","title":"An optimal algorithm for on-line bipartite match- ing","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:36.556768Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:2fddfac8e3bf883ca6203427192f6bc12797fff88f2eb611c4a7b2705160f4b9","observation_id":"0cb933f2-bef8-487d-a519-fda64e63a95e","resolution":{"observed_at":"2026-08-03T10:08:36.556768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:36.751443Z","title":"Matching algorithms: Fundamentals, ap- plications and challenges.IEEE Transactions on Emerg- ing Topics in Computational Intelligence, 5(3):332–350, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:36.751443Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:50be97b2b4a8beb799674e9749d2e6cc6e709c090d4363150b1e31354dcdb591","observation_id":"5866eeb6-3a8c-43f6-9546-44135703eed8","resolution":{"observed_at":"2026-08-03T10:08:36.751443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:36.891636Z","title":"Paths, trees, and flowers.Canadian Jour- nal of mathematics, 17:449–467, 1965","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:36.891636Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:1340b5319f261f924b011e6d4467953285ab73b7d4b67fef6cb714d8d1b753c8","observation_id":"188e78a5-2532-48ac-ae39-4ecacfcf83d2","resolution":{"observed_at":"2026-08-03T10:08:36.891636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:37.113101Z","title":"An efficient implementation of ed- monds’ algorithm for maximum matching on graphs","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:37.113101Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:1fd470a20fde7895f94390bd278c1fa8a9a915ff84e7d21d8a3029fc56d269b1","observation_id":"a2ccf9de-808d-42b3-a7a0-1d3f14a465c4","resolution":{"observed_at":"2026-08-03T10:08:37.113101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:37.237240Z","title":"An nˆ5/2 algo- rithm for maximum matchings in bipartite graphs.SIAM Journal on computing, 2(4):225–231, 1973","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:37.237240Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:f559d5ebcdd9404e95559b7d28214523223bc38189e33d9c80a1606b4c3f5a6a","observation_id":"c4ebdedb-bd42-4886-8493-b95f410cda2f","resolution":{"observed_at":"2026-08-03T10:08:37.237240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:37.408931Z","title":"Ano( p |v||e|) algo- ithm for finding maximum matching in general graphs","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:37.408931Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:ba740c518567ebaffeecc38f1e2a4761b9389f6ab02a8212b9eb50d32f44a8b2","observation_id":"38987339-ea5c-4f54-9d6a-b07d04627e5c","resolution":{"observed_at":"2026-08-03T10:08:37.408931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:37.514836Z","title":"A new approach to maximum matching in general graphs","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:37.514836Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:03645af8fdea0e65ea765473ab842cff17f8888e4fd63718629be3f7e3f6d822","observation_id":"e24c1653-36fc-4b56-9ae7-2a272cd4450f","resolution":{"observed_at":"2026-08-03T10:08:37.514836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:37.744198Z","title":"Faster scaling algorithms for general graph matching problems.Journal of the ACM (JACM), 38(4):815–853, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:37.744198Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:e64fe624f25ef1ed717f82175139955ef5e62056afccff4eb220c739afda092b","observation_id":"fbe94afb-8bea-4860-8db4-2cf5581f669a","resolution":{"observed_at":"2026-08-03T10:08:37.744198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:37.919660Z","title":"Generalization of the trotter-lie for- mula.Integral Equations and Operator Theory, 4:366– 415, 1981","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:37.919660Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:7c33c2eae5ef2ea71778b0f0c4dd52b47bb8b31d022a9351c36ecb8d26bad3e9","observation_id":"5f042598-9e8f-4e96-9836-3003b51c59ca","resolution":{"observed_at":"2026-08-03T10:08:37.919660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:38.148292Z","title":"Paulievolutiongate.https://docs.quantum","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:38.148292Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:1f5c782052ec1a26955b1a0a4b7e826c80ae35a8352dd501c22619cc00976b05","observation_id":"86480468-9537-4074-b00e-fdf852cb01cf","resolution":{"observed_at":"2026-08-03T10:08:38.148292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:38.307103Z","title":"Qiskit transpiler.https://docs.quantum.ibm","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:38.307103Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:04c43d5aaf83de9cd63e4f9953d7792969ece7183f975ec36e3c238d5a45477f","observation_id":"26909497-f829-4abc-b30a-387f984c44a5","resolution":{"observed_at":"2026-08-03T10:08:38.307103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:38.474606Z","title":"net- workx.generators.random graphs.gnp random graph","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:38.474606Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:0f828064d9457ab0ef0feef576c8e2ce551fea4cf79971fe84c72cf3e93ba2f1","observation_id":"38cfe624-0eb5-432e-a225-8454c6328957","resolution":{"observed_at":"2026-08-03T10:08:38.474606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:38.622181Z","title":"Commuting decom- positions of complete graphs.Journal of Combinatorial Designs, 15(2):133–142, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:38.622181Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:e3320d1e5a3054cfdbdcece02fe7db4d393aafac367ac01bc5b61e1ca344d936","observation_id":"eed49b8f-5e0a-4cdf-85fa-6f8f359e50fc","resolution":{"observed_at":"2026-08-03T10:08:38.622181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:38.772648Z","title":"Semi-perfect 1-factorizations of the hypercube.Discrete Mathematics, 342(6):1696–1702, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:38.772648Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:4a51846681b75f68ea3942c2216b1a6f893f4b42f64663bc97a8a5db077477f9","observation_id":"f2696ace-94a6-4da6-9fa1-356d89c08400","resolution":{"observed_at":"2026-08-03T10:08:38.772648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:38.919519Z","title":"On strongly hamiltonian complete bipartite graphs.Ars Combin, 9:43–46, 1980","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:38.919519Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:0bfa3cc29f208e5e0765a475d0ac4bab2d8378d3482b236f1c3d85ef2387e544","observation_id":"a10e1046-b8d2-4d5d-b1db-e86082038af1","resolution":{"observed_at":"2026-08-03T10:08:38.919519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:39.091725Z","title":"Com- mutativity of the adjacency matrices of graphs.Discrete mathematics, 309(3):595–600, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:39.091725Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:40d52f9f2507483456992745bcaeebdcc3985606452a72ef4939e96f9d5262db","observation_id":"19a9c225-c293-4ab7-9041-8a775eea4045","resolution":{"observed_at":"2026-08-03T10:08:39.091725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:08:39.262294Z","title":"Random compiler for fast hamiltonian simulation.Physical review letters, 123(7):070503, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:39.262294Z"},"links":{"citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:369c1a454217883b9edb38bd747689b2ef904908428727d481cb46846bdb12fd","observation_id":"86f66da6-fa21-4cd5-aded-8474a9d51e13","resolution":{"observed_at":"2026-08-03T10:08:39.262294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08705","last_updated":"2025-04-11T17:15:37Z","snapshot_observed_at":"2026-08-07T16:06:26.604745Z","submitted_at":"2025-04-11T17:15:37Z","title":"Decomposition of Sparse Amplitude Permutation Gates with Application to Preparation of Sparse Clustered Quantum States","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.08705","snapshot_observed_at":"2026-08-03T10:08:39.368614Z","title":"Decomposition of sparse amplitude permutation gates with application to preparation of sparse clustered quantum states.arXiv preprint arXiv:2504.08705, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T10:08:39.368614Z"},"links":{"cited_paper":"/paper/2504.08705","citing_paper":"/paper/2601.11418"},"observation_digest":"sha256:8bfb96f788c26fef3824810ea6a5f4a1cec1683766644baea3d94bde1fa0c6c2","observation_id":"f856fcb7-425a-40dd-9a2a-1fdc21bb501c","resolution":{"observed_at":"2026-08-03T10:08:39.368614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.11418","last_updated":"2026-06-16T17:16:53Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T07:41:05.679932Z","submitted_at":"2026-01-16T16:41:31Z","title":"A matching decomposition algorithm for simulating quantum walk Hamiltonians"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":69,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":69},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 1 inbound Pith citation observation for arXiv:2601.11418."}