Directed graph encoding in quantum computing supporting edge-failures
From MaRDI portal
Publication:2097414
DOI10.1007/978-3-031-09005-9_6OpenAlexW4293210732MaRDI QIDQ2097414
B. Riccardi, R. Romanello, Carla Piazza, D. Della Giustina
Publication date: 11 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09005-9_6
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Revisiting Deutsch-Jozsa algorithm
- Discrete-time quantum walks and graph structures
- Parameterized complexity of Eulerian deletion problems
- Quantum walk and its application domains: a systematic review
- Search via Quantum Walk
- Probability and Stochastics
- Computing with highly mixed states (extended abstract)
- Temporal Verification of Reactive Systems: Response
- 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
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Quantum walks on graphs
This page was built for publication: Directed graph encoding in quantum computing supporting edge-failures
