A Cat-State Benchmark on a Seven Bit Quantum Computer

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages with figures

Scientific paper

We propose and experimentally realize an algorithmic benchmark that demonstrates coherent control with a sequence of quantum operations that first generates and then decodes the cat state (|000...>+|111...>)/sqrt(2) to the standard initial state |000...>. This is the first high fidelity experimental quantum algorithm on the currently largest physical quantum register, which has seven quantum bits (qubits) provided by the nuclei of crotonic acid. The experiment has the additional benefit of verifying a seven coherence in a generic system of coupled spins. Our implementation combines numerous nuclear magnetic resonance (NMR) techniques in one experiment and introduces practical methods for translating quantum networks to control operations. The experimental procedure can be used as a reliable and efficient method for creating a standard pseudo-pure state, the first step for implementing traditional quantum algorithms in liquid state NMR. The benchmark and the techniques can be adapted for use on other proposed quantum devices.

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

A Cat-State Benchmark on a Seven Bit Quantum Computer 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 A Cat-State Benchmark on a Seven Bit Quantum Computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Cat-State Benchmark on a Seven Bit Quantum Computer will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-124920

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