Classical Ising model test for quantum circuits

Details Classical Ising model test for quantum circuits Classical Ising model test for quantum circuits

2009-02-27

arxiv.org/abs/0902.4889v2

New J. Physics 12, 075026 (2010)

Physics

Quantum Physics

17 pages, 2 figures. v2: main result strengthened by removing oracular setting

Scientific paper

10.1088/1367-2630/12/7/075026

We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model partition function in terms of quadratically signed weight enumerators (QWGTs), which are polynomials that arise naturally in an expansion of quantum circuits in terms of rotations involving Pauli matrices. We combine this expression with a known efficient classical algorithm for the Ising partition function of any planar graph in the absence of an external magnetic field, and the Robertson-Seymour theorem from graph theory. We give as an example a set of quantum circuits with a small number of non-nearest neighbor gates which admit an efficient classical simulation.

Affiliated with

Also associated with

No associations

Rating

Classical Ising model test for quantum circuits 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 Classical Ising model test for quantum circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical Ising model test for quantum circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572870