Selectively Blind Quantum Computation
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913806908653568 |
|---|---|
| author | Poshtvan, Abbas Lapiha, Oleksandra Doosti, Mina Leichtle, Dominik Music, Luka Kashefi, Elham |
| author_facet | Poshtvan, Abbas Lapiha, Oleksandra Doosti, Mina Leichtle, Dominik Music, Luka Kashefi, Elham |
| contents | Known protocols for secure delegation of quantum computations from a client to a server in an information theoretic setting require quantum communication. In this work, we investigate methods to reduce communication overhead. First, we establish an impossibility result by proving that server-side local processes cannot decrease quantum communication requirements of secure delegation protocols. We develop no-go results that prohibit such processes within an information theoretic framework. Second, we present a possibility result by introducing Selectively Blind Quantum Computing (SBQC), a novel functionality that allows the client to hide one among a known set of possible computations. We characterize how differences between computations in the protected set influence the number of qubits sent during our SBQC implementation, yielding a communication-optimal protocol. This approach reduces qubit communication drastically and demonstrates the trade-off between information leaked to the server and communication cost. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_17612 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Selectively Blind Quantum Computation Poshtvan, Abbas Lapiha, Oleksandra Doosti, Mina Leichtle, Dominik Music, Luka Kashefi, Elham Quantum Physics Known protocols for secure delegation of quantum computations from a client to a server in an information theoretic setting require quantum communication. In this work, we investigate methods to reduce communication overhead. First, we establish an impossibility result by proving that server-side local processes cannot decrease quantum communication requirements of secure delegation protocols. We develop no-go results that prohibit such processes within an information theoretic framework. Second, we present a possibility result by introducing Selectively Blind Quantum Computing (SBQC), a novel functionality that allows the client to hide one among a known set of possible computations. We characterize how differences between computations in the protected set influence the number of qubits sent during our SBQC implementation, yielding a communication-optimal protocol. This approach reduces qubit communication drastically and demonstrates the trade-off between information leaked to the server and communication cost. |
| title | Selectively Blind Quantum Computation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.17612 |