Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimal universal programming of unitary gates   A universal quantum processor is a device that takes as input a (quantum)
program, containing an encoding of an arbitrary unitary gate, and a (quantum)
data register, on which the encoded gate is applied. While no perfect universal
quantum processor can exist, approximate processors have been proposed in the
past two decades. A fundamental open question is how the size of the smallest
quantum program scales with the approximation error. Here we answer the
question, by proving a bound on the size of the program and designing a
concrete protocol that attains the bound in the asymptotic limit. Our result is
based on a connection between optimal programming and the Heisenberg limit of
quantum metrology, and establishes an asymptotic equivalence between the tasks
of programming, learning, and estimating unitary gates.

17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
10
The categories of this paper are: q-bio
1
The categories of this paper are: cs
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an