Randomized Benchmarking of Multi-Qubit Gates

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

As experimental platforms for quantum information processing continue to mature, characterization of the quality of unitary gates that can be applied to their quantum bits (qubits) becomes essential. Eventually, the quality must be sufficiently high to support arbitrarily long quantum computations. Randomized benchmarking already provides a platform-independent method for assessing the quality of one-qubit rotations. Here we describe an extension of this method to multi-qubit gates. We provide a platform-independent protocol for evaluating the performance of experimental Clifford unitaries, which form the basis of fault-tolerant quantum computing. We implemented the benchmarking protocol with trapped-ion two-qubit phase gates and one-qubit gates and found an error per random two-qubit Clifford unitary of $0.162 \pm 0.008$, thus setting the first benchmark for such unitaries. By implementing a second set of sequences with an extra two-qubit phase gate at each step, we extracted an error per phase gate of $0.069 \pm 0.017$. We conducted these experiments with movable, sympathetically cooled ions in a multi-zone Paul trap - a system that can in principle be scaled to larger numbers of ions.

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

Randomized Benchmarking of Multi-Qubit Gates 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 Randomized Benchmarking of Multi-Qubit Gates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized Benchmarking of Multi-Qubit Gates will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-352039

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