Grobner Bases for Finite-temperature Quantum Computing and their Complexity

Details Grobner Bases for Finite-temperature Quantum Computing and their Complexity Grobner Bases for Finite-temperature Quantum Computing and their Complexity

2010-08-24

arxiv.org/abs/1008.4055v1

Physics

Quantum Physics

Scientific paper

Following the recent approach of using order domains to construct Grobner bases from general projective varieties, we examine the parity and time-reversal arguments relating de Witt and Lyman's assertion that all path weights associated with homotopy in dimensions d <= 2 form a faithful representation of the fundamental group of a quantum system. We then show how the most general polynomial ring obtained for a fermionic quantum system does not, in fact, admit a faithful representation, and so give a general prescription for calcluating Grobner bases for finite temperature many-body quantum system and show that their complexity class is BQP.

Affiliated with

Also associated with

No associations

Rating

Grobner Bases for Finite-temperature Quantum Computing and their 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 Grobner Bases for Finite-temperature Quantum Computing and their Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grobner Bases for Finite-temperature Quantum Computing and their Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-393968