Rigorous Bounds on the Performance of a Hybrid Dynamical Decoupling-Quantum Computing Scheme

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages

Scientific paper

10.1103/PhysRevA.78.012355

We study dynamical decoupling in a multi-qubit setting, where it is combined with quantum logic gates. This is illustrated in terms of computation using Heisenberg interactions only, where global decoupling pulses commute with the computation. We derive a rigorous error bound on the trace distance or fidelity between the desired computational state and the actual time-evolved state, for a system subject to coupling to a bounded-strength bath. The bound is expressed in terms of the operator norm of the effective Hamiltonian generating the evolution in the presence of decoupling and logic operations. We apply the bound to the case of periodic pulse sequences and find that in order maintain a constant trace distance or fidelity, the number of cycles -- at fixed pulse interval and width -- scales in inverse proportion to the square of the number of qubits. This sets a scalability limit on the protection of quantum computation using periodic dynamical decoupling.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Rigorous Bounds on the Performance of a Hybrid Dynamical Decoupling-Quantum Computing Scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rigorous Bounds on the Performance of a Hybrid Dynamical Decoupling-Quantum Computing Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rigorous Bounds on the Performance of a Hybrid Dynamical Decoupling-Quantum Computing Scheme will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-511838

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.