Simplifying continuous-time quantum walks on dynamic graphs
From MaRDI portal
Publication:2102270
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
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- scientific article; zbMATH DE number 2019633 (Why is no real title available?)
- Discretization of continuous-time quantum walks via the staggered model with Hamiltonians
- Exponential algorithmic speedup by a quantum walk
- Quantum walks on graphs
- Spectra of graphs
Cited in
(10)- Continuous time quantum walks on graphs: group state transfer
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
- \(n\)-qubit operations on sphere and queueing scaling limits for programmable quantum computer
- Quantum computation in continuous time using dynamic invariants
- Dimerized decomposition of quantum evolution on an arbitrary graph
- Decoherence and classicalization of continuous-time quantum walks on graphs
- Time evolution of continuous-time quantum walks on dynamical percolation graphs
- Quantum versus population dynamics over Cayley 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)
