NDLI: Can quantum communication speed up distributed computation?

Please wait, while we are loading the content...

Rational and resilient protocols

Signature-free asynchronous byzantine consensus with t < n/3 and $o(n^{2})$ messages

The future(s) of shared data structures

Multi-message broadcast with abstract MAC layers and unreliable links

Anonymous networks: randomization = 2-hop coloring

Estimation for monotone sampling: competitiveness and customization

Coding theory for scalable media delivery

Distributed connectivity decomposition

Complexity tradeoffs for read and update operations

Software-improved hardware lock elision

Trade-offs between selection complexity and performance when searching the plane without communication

An incomplete history of concurrency chapter 1. 1965--1977

Rigorous system design

How to withstand mobile virus attacks, revisited

Efficient lock-free binary search trees

Beyond geometry: towards fully realistic wireless models

Making objects writable

Asynchronous MPC with a strict honest majority using non-equivocation

A paradox of eventual linearizability in shared memory

Consensus with an abstract MAC layer

Beyond set disjointness: the communication complexity of finding the intersection

Distributed algorithms for the Lovász local lemma and graph coloring

Can quantum communication speed up distributed computation?

Concurrent updates with RCU: search tree as an example

A generalized asynchronous computability theorem

Improved distributed steiner forest construction

Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares

The amortized complexity of non-blocking binary search trees

On the impact of geometry on ad hoc communication in wireless networks

Asynchronous convex hull consensus in the presence of crash faults

Distributing the setup in universally composable multi-party computation

Brief announcement: are lock-free concurrent algorithms practically wait-free?

Simple and efficient local codes for distributed stable network construction

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication

Brief announcement: towards security and privacy for outsourced data in the multi-party setting

Optimal gossip with direct addressing

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties

Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems

Spanners and sparsifiers in dynamic streams

Fast and unconditionally secure anonymous channel

Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures

On the power of the congested clique model

Distributed computing building blocks for rational agents

Brief announcement: a generic construction for nonblocking dual containers

Linear-in-delta lower bounds in the LOCAL model

Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networks

Brief announcement: concurrency-aware linearizability

Dynamic-sized nonblocking hash tables

Time versus cost tradeoffs for deterministic rendezvous in networks

Brief announcement: local approximability of minimum dominating set on planar graphs

Brief announcement: Linial's lower bound made easy

Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions

Brief announcement: Super-fast t-ruling sets

Brief announcement: almost-tight approximation distributed algorithm for minimum cut

Can quantum communication speed up distributed computation?

Content Provider	ACM Digital Library
Author	Pandurangan, Gopal Klauck, Hartmut Elkin, Michael Nanongkai, Danupon
Abstract	The focus of this paper is on quantum distributed computation, where we investigate whether quantum communication can help in speeding up distributed network algorithms. Our main result is that for certain fundamental network problems such as minimum spanning tree, minimum cut, and shortest paths, quantum communication does not help in substantially speeding up distributed algorithms for these problems compared to the classical setting. In order to obtain this result, we extend the technique of Das Sarma et al. [SICOMP 2012] to obtain a uniform approach to prove non-trivial lower bounds for quantum distributed algorithms for several graph optimization (both exact and approximate versions) as well as verification problems, some of which are new even in the classical setting, e.g. tight randomized lower bounds for Hamiltonian cycle and spanning tree verification, answering an open problem of Das Sarma et al., and a lower bound in terms of the weight aspect ratio, matching the upper bounds of Elkin [STOC 2004]. Our approach introduces the Server model and Quantum Simulation Theorem which together provide a connection between distributed algorithms and communication complexity. The Server model is the standard two-party communication complexity model augmented with additional power; yet, most of the hardness in the two-party model is carried over to this new model. The Quantum Simulation Theorem carries this hardness further to quantum distributed computing. Our techniques, except the proof of the hardness in the Server model, require very little knowledge in quantum computing, and this can help overcoming a usual impediment in proving bounds on quantum distributed algorithms. In particular, if one can prove a lower bound for distributed algorithms for a certain problem using the technique of Das Sarma et al., it is likely that such lower bound can be extended to the quantum setting using tools provided in this paper and without the need of knowledge in quantum computing.
Starting Page	166
Ending Page	175
Page Count	10
File Format	PDF
ISBN	9781450329446
DOI	10.1145/2611462.2611488
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-07-15
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Congest model Lower bound Graph algorithms Distributed computing Time complexity Quantum communication
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Distributed approximation algorithms for weighted shortest paths

A tight unconditional lower bound on distributed randomwalk computation

Brief announcement: almost-tight approximation distributed algorithm for minimum cut

Can Quantum Communication Speed Up Distributed Computation?

Distributed verification and hardness of distributed approximation

Distributed Approximate Maximum Matching in the CONGEST Model

Can Quantum Communication Speed Up Distributed Computation?

The round complexity of distributed sorting: extended abstract

Hardness of Approximation Across Different Models of Computation

Can quantum communication speed up distributed computation?

Similar Documents

Distributed approximation algorithms for weighted shortest paths

A tight unconditional lower bound on distributed randomwalk computation

Brief announcement: almost-tight approximation distributed algorithm for minimum cut

Can Quantum Communication Speed Up Distributed Computation?

Distributed verification and hardness of distributed approximation

Distributed Approximate Maximum Matching in the CONGEST Model

Can Quantum Communication Speed Up Distributed Computation?

The round complexity of distributed sorting: extended abstract

Hardness of Approximation Across Different Models of Computation

Can quantum communication speed up distributed computation?