Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Impossibility of blind quantum sampling for classical client   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.

32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
11
The categories of this paper are: hep-lat
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
18
The categories of this paper are: econ