Quantum encoding of dynamic directed graphs
From MaRDI portal
Publication:6151614
DOI10.1016/j.jlamp.2023.100925MaRDI QIDQ6151614
C. Londero, R. Romanello, D. Della Giustina, Carla Piazza, B. Riccardi
Publication date: 12 February 2024
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum computing without entanglement
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- Quantum walks: a comprehensive review
- Laplacians and the Cheeger inequality for directed graphs
- Directed graph encoding in quantum computing supporting edge-failures
- Proportional lumpability and proportional bisimilarity
- Revisiting Deutsch-Jozsa algorithm
- Parameterized complexity of Eulerian deletion problems
- Probability and Stochastics
- Towards Quantum Programs Verification: From Quipper Circuits to QPMC
- Computing with highly mixed states
- Rapid solution of problems by quantum computation
- On the Digraph of a Unitary Matrix
- On the role of entanglement in quantum-computational speed-up
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Quantum walks on graphs
- Random Graphs
This page was built for publication: Quantum encoding of dynamic directed graphs
