Testing integrability with a single bit of quantum information

Details Testing integrability with a single bit of quantum information Testing integrability with a single bit of quantum information

2003-03-09

arxiv.org/abs/quant-ph/0303042v2

Phys. Rev. A 68, 22302 (2003)

Physics

Quantum Physics

Minor changes taking into account Howard Wiseman's comment: quant-ph/0305153. Accepted for publication in Phys. Rev. A

Scientific paper

10.1103/PhysRevA.68.022302

We show that deterministic quantum computing with a single bit (DQC1) can determine whether the classical limit of a quantum system is chaotic or integrable using O(N) physical resources, where $N$ is the dimension of the Hilbert space of the system under study. This is a square root improvement over all known classical procedures. Our study relies strictly on the random matrix conjecture. We also present numerical results for the nonlinear kicked top.

Affiliated with

Also associated with

No associations

Rating

Testing integrability with a single bit of quantum information 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 Testing integrability with a single bit of quantum information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing integrability with a single bit of quantum information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-446274