scientific article; zbMATH DE number 6851887

DOI10.4230/LIPICS.MFCS.2016.54MaRDI QIDQ4608617zbMATH OpenFDO

Authors Stacey Jeffery, François Le Gall

Publication date 21 March 2018

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

zbMATH Keywords

database joinsdistributed quantum computingquantum communication complexity

Mathematics Subject Classification ID

Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
• Quantum distributed complexity of set disjointness on a line
• Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
• Investigating the implementation of restricted sets of multiqubit operations on distant qubits: A communication complexity perspective
• Quantum multiparty communication complexity and circuit lower bounds
• Quantum Multiparty Communication Complexity and Circuit Lower Bounds
• scientific article; zbMATH DE number 2086394
• Nondeterministic Quantum Query and Communication Complexities
• Quantum communication complexity
• Expected Communication Cost of Distributed Quantum Tasks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608617)