scientific article; zbMATH DE number 2086394
From MaRDI portal
Publication:4736848
Recommendations
Cited in
(26)- Quantum zero-error algorithms cannot be composed
- Quantum communication and complexity.
- Upper bounds on communication in terms of approximate rank
- Quantum certificate complexity
- Equality, revisited
- New bounds on the classical and quantum communication complexity of some graph properties
- Fooling one-sided quantum protocols
- Quantum weakly nondeterministic communication complexity
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- scientific article; zbMATH DE number 6851887 (Why is no real title available?)
- Quantum communication complexity of symmetric predicates
- Nondeterministic Quantum Query and Communication Complexities
- Improved quantum hypercontractivity inequality for the qubit depolarizing channel
- Quantum advantage for the LOCAL model in distributed computing
- scientific article; zbMATH DE number 7561760 (Why is no real title available?)
- scientific article; zbMATH DE number 7204275 (Why is no real title available?)
- The complexity of quantum disjointness
- Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
- Lower Bounds for Quantum Communication Complexity
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Quantum distributed complexity of set disjointness on a line
- scientific article; zbMATH DE number 7651028 (Why is no real title available?)
- scientific article; zbMATH DE number 7650118 (Why is no real title available?)
- Unbounded-error quantum query complexity
- Upper bounds on communication in terms of approximate rank
- Exponential separation of quantum and classical online space complexity
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 Q4736848)
