Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds

Details Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds

2001-09-18

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

Physics

Quantum Physics

19 pages, LaTeX2e

Scientific paper

10.1103/PhysRevA.65.042309

We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by applying sequences of appropriate local control sequences. Efficient schemes for decoupling and time reversal can be constructed from orthogonal arrays. Conditions on time optimal simulation are formulated in terms of spectral majorization of matrices characterizing the coupling parameters. Moreover, we consider a specific system of n harmonic oscillators with bilinear interaction. In this case, decoupling can efficiently be achieved using the combinatorial concept of difference schemes. For this type of interactions we present optimal schemes for inversion.

Affiliated with

Also associated with

No associations

Rating

Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds 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 Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-622254