A matching decomposition algorithm for simulating quantum walk Hamiltonians | Paper Citation Record

Observation 8c4dcd33-268b-4363-9c54-5ae39eec0326 · outbound

This paper cites Hamiltonian Simulation in the Interaction Picture.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Hamiltonian Simulation in the Interaction Picture

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:30.954372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2db337d0-a959-4891-a9d7-83b1e10cab28 · outbound

This paper cites Optimal hamilto- nian simulation by quantum signal processing.Physical review letters, 118(1):010501, 2017.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Optimal hamilto- nian simulation by quantum signal processing.Physical review letters, 118(1):010501, 2017

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.029327Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 221d5642-bc13-4fe2-8af9-be1455c35f00 · outbound

This paper cites Black-box Hamiltonian simulation and unitary implementation.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Black-box Hamiltonian simulation and unitary implementation

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.077855Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64e63c99-fdf8-4c72-8744-37347a97a029 · outbound

This paper cites Shadow hamil- tonian simulation.Nature Communications, 16(1):2690, 2025.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Shadow hamil- tonian simulation.Nature Communications, 16(1):2690, 2025

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.149370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 453e3b81-4177-417f-a83c-dbd68db73baf · outbound

This paper cites The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation.

A matching decomposition algorithm for simulating quantum walk Hamiltonians The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.224376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dca4e7ea-8741-4eee-9496-fdeffc6b908b · outbound

This paper cites Hamiltonian simulation with nearly optimal dependence on all parameters.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Hamiltonian simulation with nearly optimal dependence on all parameters

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.324585Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74707974-21eb-4177-ba7f-e5d1c9fd6e4c · outbound

This paper cites Efficient quantum walk on a quantum processor.Nature commu- nications, 7(1):11511, 2016.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Efficient quantum walk on a quantum processor.Nature commu- nications, 7(1):11511, 2016

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.437194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed129036-b6e4-4d35-b94b-e428a74a0fc8 · outbound

This paper cites Universal computation by quantum walk.Physical review letters, 102(18):180501, 2009.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Universal computation by quantum walk.Physical review letters, 102(18):180501, 2009

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.515814Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a20b1e8-7149-4a27-9c36-318a18e60dda · outbound

This paper cites Spatial search by quantum walk.Physical Review A, 70(2):022314, 2004.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Spatial search by quantum walk.Physical Review A, 70(2):022314, 2004

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.586710Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3da3a55a-3cf8-4ebb-82e8-46157228a8e5 · outbound

This paper cites Continuous- time quantum walks on dynamic graphs.Physical Review A, 100(1):012306, 2019.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Continuous- time quantum walks on dynamic graphs.Physical Review A, 100(1):012306, 2019

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.673804Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9436c1c8-a289-4756-b55c-de57dfe4136b · outbound

This paper cites Finding a marked node on any graph via continuous-time quantum walks.Physical Review A, 102(2):022227, 2020.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Finding a marked node on any graph via continuous-time quantum walks.Physical Review A, 102(2):022227, 2020

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.760256Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e4d2c56-b85b-496d-b11a-69a0199de300 · outbound

This paper cites Continuous- time quantum-walk spatial search on the Bollob´ as scale- free network.Physical Review A, 101(2):022310, 2020.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Continuous- time quantum-walk spatial search on the Bollob´ as scale- free network.Physical Review A, 101(2):022310, 2020

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.854523Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fec692cd-9bc0-4f93-a1a5-d1e891007195 · outbound

This paper cites Quadratic speedup for spatial search by continuous-time quantum walk.Physical re- view letters, 129(16):160502, 2022.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Quadratic speedup for spatial search by continuous-time quantum walk.Physical re- view letters, 129(16):160502, 2022

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.936257Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afce0a8a-8501-46e2-9e3b-a31466fff22f · outbound

This paper cites Spatial search on johnson graphs by continuous- time quantum walk.Quantum Information Processing, 21(2):74, 2022.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Spatial search on johnson graphs by continuous- time quantum walk.Quantum Information Processing, 21(2):74, 2022

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:31.987663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3675e9ab-3a94-4b97-a4ce-3e55e85c829a · outbound

This paper cites Link prediction with continuous-time classi- cal and quantum walks.Entropy, 25(5):730, 2023.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Link prediction with continuous-time classi- cal and quantum walks.Entropy, 25(5):730, 2023

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.066029Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9900e26d-8517-41f2-8da8-8d14445c9cca · outbound

This paper cites Quantum link prediction in complex networks.Physical Review A, 107(3):032605, 2023.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Quantum link prediction in complex networks.Physical Review A, 107(3):032605, 2023

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.145245Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 509227d6-fbc6-4cfc-8f9c-8162f875df06 · outbound

This paper cites A 2d quan- tum walk simulation of two-particle dynamics.Science, 336(6077):55–58, 2012.

A matching decomposition algorithm for simulating quantum walk Hamiltonians A 2d quan- tum walk simulation of two-particle dynamics.Science, 336(6077):55–58, 2012

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.232958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69a54808-f671-4db6-8cf4-35e1060a4aac · outbound

This paper cites Combinatorial op- timization via highly efficient quantum walks.Physical Review Research, 2(2):023302, 2020.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Combinatorial op- timization via highly efficient quantum walks.Physical Review Research, 2(2):023302, 2020

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.347693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 214712bd-c6d7-4947-acc9-6119d1be5206 · outbound

This paper cites Quantum walk-based portfolio optimi- sation.Quantum, 5:513, 2021.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Quantum walk-based portfolio optimi- sation.Quantum, 5:513, 2021

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.445534Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97cb13e0-d652-4f99-9237-1e012627bfd1 · outbound

This paper cites Quantum walk informed variational algorithm design.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Quantum walk informed variational algorithm design

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.552007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ac38331-9817-4d16-8ab9-b4dce3c573ae · outbound

This paper cites Ef- ficient sparse state preparation via quantum walks.npj Quantum Information, 11(1):143, 2025.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Ef- ficient sparse state preparation via quantum walks.npj Quantum Information, 11(1):143, 2025

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.590519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78e45c36-05d8-4c99-953c-56dcffcad5c7 · outbound

This paper cites Protein-dna target search relies on quantum walk.Biosystems, 201:104340, 2021.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Protein-dna target search relies on quantum walk.Biosystems, 201:104340, 2021

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.684719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 694baa4c-93e1-405f-bb84-6608eef0665c · outbound

This paper cites an unresolved cited work.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.779166Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c126650-c0c8-4143-be14-8d5995f64b52 · outbound

This paper cites Experimental realization of continuous-time quantum walks on directed graphs and their application in pagerank.Optica, 7(11):1524– 1530, 2020.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Experimental realization of continuous-time quantum walks on directed graphs and their application in pagerank.Optica, 7(11):1524– 1530, 2020

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:32.912491Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49aedc5f-3224-41ce-85b3-bb3e55de2773 · outbound

This paper cites Continuous-time quantum walk based centrality testing on weighted graphs.Scientific Reports, 12(1):6001, 2022.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Continuous-time quantum walk based centrality testing on weighted graphs.Scientific Reports, 12(1):6001, 2022

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:33.051842Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82706fa1-0dca-49ff-8be6-a22705c24a5d · outbound

This paper cites Transport and quantum walk of nonclassical light in cou- pled waveguides.Physical Review A—Atomic, Molecular, and Optical Physics, 78(4):042304, 2008.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Transport and quantum walk of nonclassical light in cou- pled waveguides.Physical Review A—Atomic, Molecular, and Optical Physics, 78(4):042304, 2008

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:33.198312Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 227151eb-0b29-4ba0-aea9-6a05b33eb21a · outbound

This paper cites Re- alization of quantum walks with negligible decoher- ence in waveguide lattices.Physical review letters, 100(17):170506, 2008.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Re- alization of quantum walks with negligible decoher- ence in waveguide lattices.Physical review letters, 100(17):170506, 2008

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:33.373785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cad2cbf6-89b6-4bea-9485-bd420db67873 · outbound

This paper cites Experimental perfect state transfer of an entangled photonic qubit.Na- ture communications, 7(1):11339, 2016.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Experimental perfect state transfer of an entangled photonic qubit.Na- ture communications, 7(1):11339, 2016

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:33.498717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1367bf9-82b3-4b8a-9b62-15a58ffe6a7b · outbound

This paper cites Experimental two- dimensional quantum walk on a photonic chip.Science advances, 4(5):eaat3174, 2018.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Experimental two- dimensional quantum walk on a photonic chip.Science advances, 4(5):eaat3174, 2018

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:33.618626Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d785000-58e1-408a-9a11-b2ebdaf4c361 · outbound

This paper cites Implementation of Continuous-Time Quantum Walks on Quantum Computers.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Implementation of Continuous-Time Quantum Walks on Quantum Computers

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:33.750985Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b5cf694-ba9d-4a09-b871-c948e013ff69 · outbound

This paper cites Circuit design for continuous time quantum walks on cycle graph and its experimental demonstration in ibm quantum computer.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Circuit design for continuous time quantum walks on cycle graph and its experimental demonstration in ibm quantum computer

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:33.860586Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 744f8cc1-0622-4fe1-b4ff-fa8385aff930 · outbound

This paper cites Efficient quantum cir- cuits for continuous-time quantum walks on composite graphs.Journal of Physics A: Mathematical and Theo- retical, 50(5):055303, 2017.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Efficient quantum cir- cuits for continuous-time quantum walks on composite graphs.Journal of Physics A: Mathematical and Theo- retical, 50(5):055303, 2017

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:33.988882Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4873a4d-67e8-4438-bc47-89f32f347807 · outbound

This paper cites Deterministic search on star graphs via quantum walks.Physical review letters, 128(5):050501, 2022.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Deterministic search on star graphs via quantum walks.Physical review letters, 128(5):050501, 2022

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:34.101034Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a555dccc-e5d5-450b-9c52-97976a8f76b9 · outbound

This paper cites Efficient quantum cir- cuit implementation of quantum walks.Physical Review A—Atomic, Molecular, and Optical Physics, 79(5):052335, 2009.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Efficient quantum cir- cuit implementation of quantum walks.Physical Review A—Atomic, Molecular, and Optical Physics, 79(5):052335, 2009

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:34.219244Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9847c17-01fb-4134-b966-b8acb09e510f · outbound

This paper cites Quantum computa- tion and decision trees.Physical Review A, 58(2):915, 1998.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Quantum computa- tion and decision trees.Physical Review A, 58(2):915, 1998

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:34.406259Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 606e7a65-f7c0-4c17-b17c-ad25f86e9359 · outbound

This paper cites Quantum circuit model for continuous-time quantum walks on random graphs.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Quantum circuit model for continuous-time quantum walks on random graphs

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:34.541794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36754c00-6fca-42ea-a7ab-296c099c9c95 · outbound

This paper cites Isolated vertices in continuous-time quantum walks on dynamic graphs.Physical Review A, 100(6):062325, 2019.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Isolated vertices in continuous-time quantum walks on dynamic graphs.Physical Review A, 100(6):062325, 2019

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:34.647404Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 443b1247-f63d-498a-922a-e36c6be86da8 · outbound

This paper cites Simplify- ing continuous-time quantum walks on dynamic graphs.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Simplify- ing continuous-time quantum walks on dynamic graphs

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:34.726645Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e37cfbc4-250d-4861-a74e-950d2e36f998 · outbound

This paper cites Imple- menting quantum gates using length-3 dynamic quantum walks.Physical Review A, 104(4):042604, 2021.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Imple- menting quantum gates using length-3 dynamic quantum walks.Physical Review A, 104(4):042604, 2021

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:34.869486Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b6a4996-8dfc-40d4-8a18-1d7f3efb18e1 · outbound

This paper cites Relating the multi-angle quantum approximate optimization algorithm and continuous-time quantum walks on dynamic graphs.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Relating the multi-angle quantum approximate optimization algorithm and continuous-time quantum walks on dynamic graphs

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:34.976211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a6330b8d-c1c5-4d50-b5bf-4a2ff6dbc382 · outbound

This paper cites A Quantum Approximate Optimization Algorithm.

A matching decomposition algorithm for simulating quantum walk Hamiltonians A Quantum Approximate Optimization Algorithm

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:35.122555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e1fc1d9-a871-4db5-8099-ae29826abbf3 · outbound

This paper cites Analyzing the quan- tum approximate optimization algorithm: ans¨ atze, sym- metries, and lie algebras.PRX Quantum, 6(4):040345, 2025.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Analyzing the quan- tum approximate optimization algorithm: ans¨ atze, sym- metries, and lie algebras.PRX Quantum, 6(4):040345, 2025

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:35.245714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bb35581-9d9c-437d-acba-7f7c8613144a · outbound

This paper cites Quantum approximate optimization algorithm with random and subgraph phase operators.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Quantum approximate optimization algorithm with random and subgraph phase operators

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:35.367988Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c1b3cfc-5e18-41a1-a58a-5ad9673a3cd4 · outbound

This paper cites The symmetry-based expressive qaoa for the maxcut problem.Advanced Quantum Tech- nologies, page 2500199, 2025.

A matching decomposition algorithm for simulating quantum walk Hamiltonians The symmetry-based expressive qaoa for the maxcut problem.Advanced Quantum Tech- nologies, page 2500199, 2025

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:35.484147Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27aa056d-87fc-4016-9ec9-9f6bb75de787 · outbound

This paper cites Preparing angular momentum eigen- states using engineered quantum walks.Physical Review A, 110(6):062214, 2024.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Preparing angular momentum eigen- states using engineered quantum walks.Physical Review A, 110(6):062214, 2024

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:35.609859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bac03bf6-5fa4-4a56-a90a-a539ec73544e · outbound

This paper cites Imple- 14 mentation of a continuous-time quantum walk on a sparse graph.Physical Review A, 110(5), November 2024.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Imple- 14 mentation of a continuous-time quantum walk on a sparse graph.Physical Review A, 110(5), November 2024

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:35.731838Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0732ebdc-8405-49f8-acc4-0bd5e38f28ac · outbound

This paper cites Generalized trotter’s formula and sys- tematic approximants of exponential operators and inner derivations with applications to many-body problems.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Generalized trotter’s formula and sys- tematic approximants of exponential operators and inner derivations with applications to many-body problems

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:35.857131Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4bcdc7b-bded-4b85-b0f7-6fd28d8a59f8 · outbound

This paper cites Quclear: Clifford extrac- tion and absorption for quantum circuit optimization.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Quclear: Clifford extrac- tion and absorption for quantum circuit optimization

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:35.982199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d876210-19b6-49fc-82e6-cd9f6a86a9fe · outbound

This paper cites Sparsepauliop.https://docs.quantum.ibm.com/ api/qiskit/qiskit.quantum_info.SparsePauliOp.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Sparsepauliop.https://docs.quantum.ibm.com/ api/qiskit/qiskit.quantum_info.SparsePauliOp

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:36.104370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e62b2718-81c1-4129-ba90-eb1277a5125c · outbound

This paper cites Efficient attributed graph matching and its application to image analysis.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Efficient attributed graph matching and its application to image analysis

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:36.230024Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a30df8a-b0b8-4853-bc52-52db69f90114 · outbound

This paper cites Gpm: A graph pattern matching kernel with diffusion for chem- ical compound classification.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Gpm: A graph pattern matching kernel with diffusion for chem- ical compound classification

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:36.340478Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cb933f2-bef8-487d-a519-fda64e63a95e · outbound

This paper cites An optimal algorithm for on-line bipartite match- ing.

A matching decomposition algorithm for simulating quantum walk Hamiltonians An optimal algorithm for on-line bipartite match- ing

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:36.556768Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5866eeb6-3a8c-43f6-9546-44135703eed8 · outbound

This paper cites Matching algorithms: Fundamentals, ap- plications and challenges.IEEE Transactions on Emerg- ing Topics in Computational Intelligence, 5(3):332–350, 2021.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Matching algorithms: Fundamentals, ap- plications and challenges.IEEE Transactions on Emerg- ing Topics in Computational Intelligence, 5(3):332–350, 2021

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:36.751443Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 188e78a5-2532-48ac-ae39-4ecacfcf83d2 · outbound

This paper cites Paths, trees, and flowers.Canadian Jour- nal of mathematics, 17:449–467, 1965.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Paths, trees, and flowers.Canadian Jour- nal of mathematics, 17:449–467, 1965

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:36.891636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2ccf9de-808d-42b3-a7a0-1d3f14a465c4 · outbound

This paper cites An efficient implementation of ed- monds’ algorithm for maximum matching on graphs.

A matching decomposition algorithm for simulating quantum walk Hamiltonians An efficient implementation of ed- monds’ algorithm for maximum matching on graphs

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:37.113101Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4ebdedb-bd42-4886-8493-b95f410cda2f · outbound

This paper cites An nˆ5/2 algo- rithm for maximum matchings in bipartite graphs.SIAM Journal on computing, 2(4):225–231, 1973.

A matching decomposition algorithm for simulating quantum walk Hamiltonians An nˆ5/2 algo- rithm for maximum matchings in bipartite graphs.SIAM Journal on computing, 2(4):225–231, 1973

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:37.237240Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38987339-ea5c-4f54-9d6a-b07d04627e5c · outbound

This paper cites Ano( p |v||e|) algo- ithm for finding maximum matching in general graphs.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Ano( p |v||e|) algo- ithm for finding maximum matching in general graphs

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:37.408931Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e24c1653-36fc-4b56-9ae7-2a272cd4450f · outbound

This paper cites A new approach to maximum matching in general graphs.

A matching decomposition algorithm for simulating quantum walk Hamiltonians A new approach to maximum matching in general graphs

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:37.514836Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fbe94afb-8bea-4860-8db4-2cf5581f669a · outbound

This paper cites Faster scaling algorithms for general graph matching problems.Journal of the ACM (JACM), 38(4):815–853, 1991.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Faster scaling algorithms for general graph matching problems.Journal of the ACM (JACM), 38(4):815–853, 1991

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:37.744198Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f042598-9e8f-4e96-9836-3003b51c59ca · outbound

This paper cites Generalization of the trotter-lie for- mula.Integral Equations and Operator Theory, 4:366– 415, 1981.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Generalization of the trotter-lie for- mula.Integral Equations and Operator Theory, 4:366– 415, 1981

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:37.919660Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86480468-9537-4074-b00e-fdf852cb01cf · outbound

This paper cites Paulievolutiongate.https://docs.quantum.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Paulievolutiongate.https://docs.quantum

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:38.148292Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 26909497-f829-4abc-b30a-387f984c44a5 · outbound

This paper cites Qiskit transpiler.https://docs.quantum.ibm.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Qiskit transpiler.https://docs.quantum.ibm

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:38.307103Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38cfe624-0eb5-432e-a225-8454c6328957 · outbound

This paper cites net- workx.generators.random graphs.gnp random graph.

A matching decomposition algorithm for simulating quantum walk Hamiltonians net- workx.generators.random graphs.gnp random graph

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:38.474606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eed49b8f-5e0a-4cdf-85fa-6f8f359e50fc · outbound

This paper cites Commuting decom- positions of complete graphs.Journal of Combinatorial Designs, 15(2):133–142, 2007.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Commuting decom- positions of complete graphs.Journal of Combinatorial Designs, 15(2):133–142, 2007

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:38.622181Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2696ace-94a6-4da6-9fa1-356d89c08400 · outbound

This paper cites Semi-perfect 1-factorizations of the hypercube.Discrete Mathematics, 342(6):1696–1702, 2019.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Semi-perfect 1-factorizations of the hypercube.Discrete Mathematics, 342(6):1696–1702, 2019

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:38.772648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a10e1046-b8d2-4d5d-b1db-e86082038af1 · outbound

This paper cites On strongly hamiltonian complete bipartite graphs.Ars Combin, 9:43–46, 1980.

A matching decomposition algorithm for simulating quantum walk Hamiltonians On strongly hamiltonian complete bipartite graphs.Ars Combin, 9:43–46, 1980

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:38.919519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19a9c225-c293-4ab7-9041-8a775eea4045 · outbound

This paper cites Com- mutativity of the adjacency matrices of graphs.Discrete mathematics, 309(3):595–600, 2009.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Com- mutativity of the adjacency matrices of graphs.Discrete mathematics, 309(3):595–600, 2009

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:39.091725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86f66da6-fa21-4cd5-aded-8474a9d51e13 · outbound

This paper cites Random compiler for fast hamiltonian simulation.Physical review letters, 123(7):070503, 2019.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Random compiler for fast hamiltonian simulation.Physical review letters, 123(7):070503, 2019

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:39.262294Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f856fcb7-425a-40dd-9a2a-1fdc21bb501c · outbound

This paper cites Decomposition of Sparse Amplitude Permutation Gates with Application to Preparation of Sparse Clustered Quantum States.

A matching decomposition algorithm for simulating quantum walk Hamiltonians Decomposition of Sparse Amplitude Permutation Gates with Application to Preparation of Sparse Clustered Quantum States

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-03T10:08:39.368614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers