57,143 research outputs found
Quantum Computing with Globally Controlled Exchange-type Interactions
If the interaction between qubits in a quantum computer has a non-diagonal
form (e.g. the Heisenberg interaction), then one must be able to "switch it
off" in order to prevent uncontrolled propagation of states. Therefore, such QC
schemes typically demand local control of the interaction strength between each
pair of neighboring qubits. Here we demonstrate that this degree of control is
not necessary: it suffices to switch the interaction collectively - something
that can in principle be achieved by global fields rather than with local
manipulations. This observation may offer a significant simplification for
various solid state, optical lattice and NMR implementations.Comment: 3 pages inc. 3 figure
Quantum Computing in Arrays Coupled by 'Always On' Interactions
It has recently been shown that one can perform quantum computation in a
Heisenberg chain in which the interactions are 'always on', provided that one
can abruptly tune the Zeeman energies of the individual (pseudo-)spins. Here we
provide a more complete analysis of this scheme, including several
generalizations. We generalize the interaction to an anisotropic form
(incorporating the XY, or Forster, interaction as a limit), providing a proof
that a chain coupled in this fashion tends to an effective Ising chain in the
limit of far off-resonant spins. We derive the primitive two-qubit gate that
results from exploiting abrupt Zeeman tuning with such an interaction. We also
demonstrate, via numerical simulation, that the same basic scheme functions in
the case of smoothly shifted Zeeman energies. We conclude with some remarks
regarding generalisations to two- and three-dimensional arrays.Comment: 16 pages (preprint format) inc. 3 figure
High threshold distributed quantum computing with three-qubit nodes
In the distributed quantum computing paradigm, well-controlled few-qubit
`nodes' are networked together by connections which are relatively noisy and
failure prone. A practical scheme must offer high tolerance to errors while
requiring only simple (i.e. few-qubit) nodes. Here we show that relatively
modest, three-qubit nodes can support advanced purification techniques and so
offer robust scalability: the infidelity in the entanglement channel may be
permitted to approach 10% if the infidelity in local operations is of order
0.1%. Our tolerance of network noise is therefore a order of magnitude beyond
prior schemes, and our architecture remains robust even in the presence of
considerable decoherence rates (memory errors). We compare the performance with
that of schemes involving nodes of lower and higher complexity. Ion traps, and
NV- centres in diamond, are two highly relevant emerging technologies.Comment: 5 figures, 12 pages in single column format. Revision has more
detailed comparison with prior scheme
Efficient Graph State Construction Under the Barrett and Kok Scheme
Recently Barrett and Kok (BK) proposed an elegant method for entangling
separated matter qubits. They outlined a strategy for using their entangling
operation (EO) to build graph states, the resource for one-way quantum
computing. However by viewing their EO as a graph fusion event, one perceives
that each successful event introduces an ideal redundant graph edge, which
growth strategies should exploit. For example, if each EO succeeds with
probability p=0.4 then a highly connected graph can be formed with an overhead
of only about ten EO attempts per graph edge. The BK scheme then becomes
competitive with the more elaborate entanglement procedures designed to permit
p to approach unity.Comment: 3 pages, 3 figures. Small refinement
- …