Unbounded-Error One-Way Classical and Quantum Communication Complexity

DOI10.1007/978-3-540-73420-8_12zbMath1171.68483arXiv0706.3265OpenAlexW1929816335MaRDI QIDQ5428802

Rudy Raymond, Shigeru Yamashita, Harumichi Nishimura, Kazuo Iwama

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Expanding the sharpness parameter area based on sequential \(3 \rightarrow 1\) parity-oblivious quantum random access code ⋮ Unbounded-error quantum query complexity ⋮ Unbounded-Error Classical and Quantum Communication Complexity ⋮ Some algebraic properties of measure-once two-way quantum finite automata ⋮ Optimal bounds for parity-oblivious random access codes ⋮ The geometry of Bloch space in the context of quantum random access codes

This page was built for publication: Unbounded-Error One-Way Classical and Quantum Communication Complexity