Effective Pure States for Bulk Quantum Computation

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

24 pages in LaTex, 14 figures, the paper is also avalaible at http://qso.lanl.gov/qc/

Scientific paper

10.1103/PhysRevA.57.3348

In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial averaging) for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla qubits and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyze the signal to noise behavior of each.

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

Effective Pure States for Bulk Quantum Computation 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 Effective Pure States for Bulk Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effective Pure States for Bulk Quantum Computation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-149430

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