|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Impossibility of blind quantum sampling for classical client | | Tomoyuki Morimae
; Harumichi Nishimura
; Yuki Takeuchi
; Seiichiro Tani
; | | Date: |
10 Dec 2018 | | Abstract: | Blind quantum computing enables a client, who can only generate or measure
single-qubit states, to delegate quantum computing to a remote quantum server
in such a way that the input, output, and program are hidden from the server.
It is an open problem whether a completely classical client can delegate
quantum computing blindly. In this paper, we show that if a completely
classical client can blindly delegate sampling of subuniversal models, such as
the DQC1 model and the IQP model, then the polynomial-time hierarchy collapses
to the third level. Our delegation protocol is the one where the client first
sends a polynomial-length bit string to the server and then the server returns
a single bit to the client. Generalizing the no-go result to more general
setups is an open problem. | | Source: | arXiv, 1812.3703 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER