{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:14:56Z","timestamp":1762460096438,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031090042"},{"type":"electronic","value":"9783031090059"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09005-9_6","type":"book-chapter","created":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:05:55Z","timestamp":1656371155000},"page":"75-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Directed Graph Encoding in\u00a0Quantum Computing Supporting Edge-Failures"],"prefix":"10.1007","author":[{"given":"D.","family":"Della Giustina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Piazza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Riccardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Romanello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,28]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 50\u201359 (2001)","DOI":"10.1145\/380752.380758"},{"key":"6_CR2","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows - Theory, Algorithms and Applications. Pearson, London (1993)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ic.2018.04.002","volume":"260","author":"G Alzetta","year":"2018","unstructured":"Alzetta, G., Marin, A., Piazza, C., Rossi, S.: Lumping-based equivalences in markovian automata: algorithms and applications to product-form analyses. Inf. Comput. 260, 99\u2013125 (2018)","journal-title":"Inf. Comput."},{"issue":"04","key":"6_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1142\/S0219749903000383","volume":"1","author":"A Ambainis","year":"2003","unstructured":"Ambainis, A.: Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 1(04), 507\u2013518 (2003)","journal-title":"Int. J. Quantum Inf."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Schulman, L.J., Vazirani, U.V.: Computing with highly mixed states. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 697\u2013704 (2000)","DOI":"10.1145\/335305.335403"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2004.03.041","volume":"320","author":"E Biham","year":"2004","unstructured":"Biham, E., Brassard, G., Kenigsberg, D., Mor, T.: Quantum computing without entanglement. Theor. Comput. Sci. 320(1), 15\u201333 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-005-0237-z","volume":"9","author":"F Chung","year":"2005","unstructured":"Chung, F.: Laplacians and the cheeger inequality for directed graphs. Ann. Comb. 9(1), 1\u201319 (2005)","journal-title":"Ann. Comb."},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"\u00c7inlar, E.: Probability and Stochastics, vol. 261. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-0-387-87859-1","DOI":"10.1007\/978-0-387-87859-1"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00453-012-9667-x","volume":"68","author":"M Cygan","year":"2014","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M., Schlotter, I.: Parameterized complexity of eulerian deletion problems. Algorithmica 68(1), 41\u201361 (2014)","journal-title":"Algorithmica"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. London. Ser. A Math. Phys. Sci. 439(1907), 553\u2013558 (1992)","DOI":"10.1098\/rspa.1992.0167"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, Cambridge (2010)","DOI":"10.1017\/CBO9780511761942"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, euler tours and the Chinese postman. Math. Program. 5(1), 88\u2013124 (1973)","journal-title":"Math. Program."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1103\/PhysRevA.58.915","volume":"58","author":"E Farhi","year":"1998","unstructured":"Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58(2), 915\u2013928 (1998)","journal-title":"Phys. Rev. A"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jcta.2019.05.003","volume":"167","author":"C Godsil","year":"2019","unstructured":"Godsil, C., Zhan, H.: Discrete-time quantum walks and graph structures. J. Comb. Theor. Ser. A 167, 181\u2013212 (2019)","journal-title":"J. Comb. Theor. Ser. A"},{"key":"6_CR15","unstructured":"Harary, F.: Graph Theory. Addison Wesley Series in Mathematics. Addison-Wesley, Boston (1971)"},{"key":"6_CR16","unstructured":"Haykin, S.: Neural Networks and Learning Machines, 3\/E. Pearson Education India, Chennai (2010)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Jozsa, R., Linden, N.: On the role of entanglement in quantum-computational speed-up. Proc. R. Soc. London. Ser. A. Math. Phys. Eng. Sci. 459(2036), 2011\u20132032 (2003)","DOI":"10.1098\/rspa.2002.1097"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"100419","DOI":"10.1016\/j.cosrev.2021.100419","volume":"41","author":"K Kadian","year":"2021","unstructured":"Kadian, K., Garhwal, S., Kumar, A.: Quantum walk and its application domains: a systematic review. Comput. Sci. Rev. 41, 100419 (2021)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1137\/090745854","volume":"40","author":"F Magniez","year":"2011","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. SIAM J. Comput. 40(1), 142\u2013164 (2011)","journal-title":"SIAM J. Comput."},{"key":"6_CR20","volume-title":"Temporal Verification of Reactive Systems: Safety","author":"Z Manna","year":"2012","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (2012)"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"328","DOI":"10.3390\/e21030328","volume":"21","author":"G Minello","year":"2019","unstructured":"Minello, G., Rossi, L., Torsello, A.: Can a quantum walk tell which is which? a study of quantum walk-based graph similarity. Entropy 21(3), 328 (2019)","journal-title":"Entropy"},{"issue":"1","key":"6_CR22","first-page":"93","volume":"7","author":"A Montanaro","year":"2007","unstructured":"Montanaro, A.: Quantum walks on directed graphs. Quantum Inf. Comput. 7(1), 93\u2013102 (2007)","journal-title":"Quantum Inf. Comput."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information (2002)","DOI":"10.1119\/1.1463744"},{"key":"6_CR25","unstructured":"Christos, H.: Papadimitriou. Computational complexity, Pearson, New York (1993)"},{"issue":"1","key":"6_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep00444","volume":"2","author":"GD Paparo","year":"2012","unstructured":"Paparo, G.D., Martin-Delgado, M.A.: Google in a quantum network. Sci. Rep. 2(1), 1\u201312 (2012)","journal-title":"Sci. Rep."},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"104605","DOI":"10.1016\/j.ic.2020.104605","volume":"275","author":"D Qiu","year":"2020","unstructured":"Qiu, D., Zheng, S.: Revisiting deutsch-jozsa algorithm. Inf. Comput. 275, 104605 (2020)","journal-title":"Inf. Comput."},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/S0895479802410293","volume":"25","author":"S Severini","year":"2003","unstructured":"Severini, S.: On the digraph of a unitary matrix. SIAM J. Matrix Anal. Appl. 25(1), 295\u2013300 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"6_CR29","unstructured":"Tanenbaum, A.S., Wetherall, D.: Computer networks, 5th Edition. Pearson, New York (2011)"},{"issue":"5","key":"6_CR30","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1007\/s11128-012-0432-5","volume":"11","author":"Salvador Elias Venegas-Andraca","year":"2012","unstructured":"Salvador Elias Venegas-Andraca: Quantum walks: a comprehensive review. Quantum Inf. Process. 11(5), 1015\u20131106 (2012)","journal-title":"Quantum Inf. Process."},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1109\/TETCI.2019.2952908","volume":"4","author":"F Xia","year":"2020","unstructured":"Xia, F., Liu, J., Nie, H., Yonghao, F., Wan, L., Kong, X.: Random walks: a review of algorithms and applications. IEEE Trans. Emerg. Top. Comput. Intell. 4(2), 95\u2013107 (2020)","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09005-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:07:58Z","timestamp":1656371278000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09005-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031090042","9783031090059"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09005-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Urbino","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation-2022.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"There were 5 sub-reviewers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}