Simplifying continuous-time quantum walks on dynamic graphs
From MaRDI portal
Publication:2102270
DOI10.1007/S11128-021-03403-7OpenAlexW3167703481MaRDI QIDQ2102270FDOQ2102270
Authors: Rebekah Herrman, Thomas G. Wong
Publication date: 28 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.06015
Recommendations
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- QUANTUM WALKS ON GENERAL GRAPHS
- Simulating continuous-time Hamiltonian dynamics by way of a discrete-time quantum walk
- On the relationship between continuous- and discrete-time quantum walk
- Quantum walks and the size of the graph
Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum gates (81P65)
Cites Work
Cited In (9)
- Decoherence and classicalization of continuous-time quantum walks on graphs
- Quantum computation in continuous time using dynamic invariants
- Dimerized decomposition of quantum evolution on an arbitrary graph
- Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
- Continuous time quantum walks on graphs: group state transfer
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- \(n\)-qubit operations on sphere and queueing scaling limits for programmable quantum computer
- Time evolution of continuous-time quantum walks on dynamical percolation graphs
This page was built for publication: Simplifying continuous-time quantum walks on dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102270)