scientific article; zbMATH DE number 7559158

DOI10.4230/LIPIcs.STACS.2019.49MaRDI QIDQ5090500

Ansis Rosmanis, François Le Gall, Harumichi Nishimura

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1810.10838

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum computingdistributed computingLOCAL model

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum communication and complexity.
• Optimal distributed all pairs shortest paths and applications
• Can quantum communication speed up distributed computation?
• Exact Quantum Algorithms for the Leader Election Problem
• Quantum Computation and Quantum Information
• Multiparty entanglement in graph states
• Distributed Algorithms for Network Diameter and Girth
• Fast quantum byzantine agreement
• What Can Be Observed Locally?
• Locality in Distributed Graph Algorithms
• Distributed Computing: A Locality-Sensitive Approach
• Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
• Quantum advantage with shallow circuits

This page was built for publication: