The one-way communication complexity of group membership
This paper studies the one-way communication complexity of the subgroup membership problem, a classical problem closely related to basic questions in quantum computing. Here Alice receives, as input, a subgroup H of a finite group G; Bob receives an element x ∈ G. Alice is permitted to send a singl...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://hdl.handle.net/1721.1/54762 https://orcid.org/0000-0003-1333-4045 |