Quantum pseudo-randomness from cluster-state quantum computation

Details Quantum pseudo-randomness from cluster-state quantum computation Quantum pseudo-randomness from cluster-state quantum computation

2008-02-19

arxiv.org/abs/0802.2675v3

Physics

Quantum Physics

4 pages, 4 figures, version appearing in Phys. Rev. A

Scientific paper

10.1103/PhysRevA.77.040303

We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for optimizing pseudo-random circuits by properly choosing single-qubit rotations. A Markov chain analysis provides the tool for analyzing convergence rates to the Haar measure and finding the optimal single-qubit gate distribution. Our results may be viewed as an alternative construction of approximate unitary 2-designs.

Affiliated with

Also associated with

No associations

Rating

Quantum pseudo-randomness from cluster-state 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 Quantum pseudo-randomness from cluster-state quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum pseudo-randomness from cluster-state quantum computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338842