Quantum encoding of dynamic directed graphs
From MaRDI portal
Cites work
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Computing with highly mixed states
- Directed graph encoding in quantum computing supporting edge-failures
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Laplacians and the Cheeger inequality for directed graphs
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- Matching, Euler tours and the Chinese postman
- Network flows. Theory, algorithms, and applications.
- Networks, crowds and markets. Reasoning about a highly connected world.
- On the Digraph of a Unitary Matrix
- On the role of entanglement in quantum-computational speed-up
- Parameterized complexity of Eulerian deletion problems
- Probability and stochastics.
- Proportional lumpability and proportional bisimilarity
- Quantum computing without entanglement
- Quantum walks on graphs
- Quantum walks: a comprehensive review
- Random Graphs
- Rapid solution of problems by quantum computation
- Revisiting Deutsch-Jozsa algorithm
- Towards quantum programs verification: from Quipper circuits to QPMC
Cited in
(2)
This page was built for publication: Quantum encoding of dynamic directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151614)
