Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Efficient implementation of Quantum circuits with limited qubit
  interactions   The quantum circuit model allows gates between any pair of qubits yet
physical instantiations allow only limited interactions. We address this
problem by providing an interaction graph together with an efficient method for
compiling quantum circuits so that gates are applied only locally. The graph
requires each qubit to interact with 4 other qubits and yet the time-overhead
for implementing any n-qubit quantum circuit is 6 log n. Building a network of
quantum computing nodes according to this graph enables the network to emulate
a single monolithic device with minimal overhead.

0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th
1
The categories of this paper are: cs
32
The categories of this paper are: atom-ph
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
27
The categories of this paper are: comp-gas
3
The categories of this paper are: physics