Relating computational complexity and quantum spectral complexity

Details Relating computational complexity and quantum spectral complexity Relating computational complexity and quantum spectral complexity

2008-11-12

arxiv.org/abs/0811.1801v3

Physics

Quantum Physics

5 pages, 2 figures

Scientific paper

It is found that the statistical level fluctuations of the AQC 3-SAT problem undergo a transition from a poisson (regular) fluctuation form to a form consistent with the predictions of Random Matrix Theory. We present data which suggests this transition correlates with the computational phase transition in the classical 3-SAT problem. Application to Gaussian Processes and implication for experiment is discussed.

Affiliated with

Also associated with

No associations

Rating

Relating computational complexity and quantum spectral complexity 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 Relating computational complexity and quantum spectral complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relating computational complexity and quantum spectral complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100363