Bounds on the number of time steps for simulating arbitrary interaction graphs

Details Bounds on the number of time steps for simulating arbitrary interaction graphs Bounds on the number of time steps for simulating arbitrary interaction graphs

2002-03-14

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

Physics

Quantum Physics

12 pages, 3 figures, some corrections of Theorem 1 and its proof

Scientific paper

In previous papers we have considered mutual simulation of n-partite pair-interaction Hamiltonians. We have focussed on the running time overhead of general simulations, while considering the required number of time steps only for special cases (decoupling and time-reversal). These two complexity measures differ significantly. Here we derive lower bounds on the number of time steps for general simulations. In particular, the simulation of interaction graphs with irrational spectrum requires at least n steps. We discuss as examples graphs that correspond to graph codes and nearest neighbor interactions in 1- and 2-dimensional lattices. In the latter case the lower bounds are almost tight.

Affiliated with

Also associated with

No associations

Rating

Bounds on the number of time steps for simulating arbitrary interaction graphs 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 Bounds on the number of time steps for simulating arbitrary interaction graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the number of time steps for simulating arbitrary interaction graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9739