Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity

Details Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity

2001-06-13

arxiv.org/abs/quant-ph/0106077v1

Physics

Quantum Physics

12 pages

Scientific paper

We use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathematically equivalent to a separability problem of n-qubit density matrices. We derive lower and upper bounds in terms of chromatic index and the spectrum of the interaction graph. The complexity measure defined by such a computational model is related to gate complexity and a continuous complexity measure introduced in a former paper. We use majorization of graph spectra for classifying Hamiltonians with respect to their computational power.

Affiliated with

Also associated with

No associations

Rating

Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time 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 Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507559