Communication Complexity of Entanglement-Assisted Multi-Party Computation
We consider a quantum and a classical version of a multi-party function computation problem with <i>n</i> players, where players <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-10-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/26/11/896 |