Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Weighted Quantum Channel Compiling through Proximal Policy Optimization   We propose a general and systematic strategy to compile arbitrary quantum
channels without using ancillary qubits, based on proximal policy optimization
-- a powerful deep reinforcement learning algorithm. We rigorously prove that,
in sharp contrast to the case of compiling unitary gates, it is impossible to
compile an arbitrary channel to arbitrary precision with any given finite
elementary channel set, regardless of the length of the decomposition sequence.
However, for a fixed accuracy $\epsilon$ one can construct a universal set with
constant number of $\epsilon$-dependent elementary channels, such that an
arbitrary quantum channel can be decomposed into a sequence of these elementary
channels followed by a unitary gate, with the sequence length bounded by
$O(\frac{1}{\epsilon}\log\frac{1}{\epsilon})$. Through a concrete example
concerning topological compiling of Majorana fermions, we show that our
proposed algorithm can conveniently and effectively reduce the use of expensive
elementary gates through adding the weighted cost into the reward function of
the proximal policy optimization.

0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
33
The categories of this paper are: plasm-ph
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
15
The categories of this paper are: nucl-ex
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph