Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0109088 · Physical Review A

Simulating Hamiltonians in quantum networks: Efficient schemes and complexity bounds

Paweł Wocjan, Martin Rötteler, Dominik Janzing, Thomas Beth

Published Mar 29, 2002• 57 citations
arXivHTMLPDF

Abstract

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. Conditions on time optimal simulation are formulated in terms of spectral majorization of matrices characterizing the coupling parameters. Efficient schemes for decoupling and time reversal can be constructed from orthogonal arrays provided that the dimensions of all nodes are equal to the same prime power. 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 interaction we present optimal schemes for inversion.

DOI
10.1103/physreva.65.042309

Related papers

Efficient Decoupling Schemes Based on Hamilton Cycles

Martin Roetteler

Decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian is a well-studied problem. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed which use selective pulses. In this paper we consider an additional requirement on these pulse sequences: as few {\em different} control operations as possible should be used. This requirement is motivated by the fact that optimizing each individual selective pulse will be expensive, i. e., it is desirable to use as few different selective pulses as possible. For an arbitrary $d$-dimensional system we show that the ability to implement only two control operations is sufficient to turn off the time evolution. In case of a bipartite system with local control we show that four different control operations are sufficient. Turning to networks consisting of several $d$-dimensional nodes which are governed by a pair-interaction Hamiltonian, we show that decoupling can be achieved if one is able to control a number of different control operations which is logarithmic in the number of nodes.

arXiv:quant-ph/0408078•Aug 11, 2004•1 citation

Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity

Paweł Wocjan, Dominik Janzing, T. Beth

We consider a quantum computer consisting of n spins with an arbitrary but fixed pair-interaction Hamiltonian and describe how to simulate other pair-interactions by interspersing the natural time evolution with fast local transformations. Calculating the minimal time overhead of such a simulation leads to a convex optimization problem. Lower and upper bounds on the minimal time overhead are derived in terms of chromatic indices of interaction graphs and spectral majorization criteria. These results classify Hamiltonians with respect to their computational power. For a specific Hamiltonian, namely \sigma_z\otimes\sigma_z-interactions between all spins, the optimization is mathematically equivalent to a separability problem of n-qubit density matrices. We compare the complexity defined by such a quantum computer with the usual gate complexity.

arXiv:quant-ph/0106077•Quantum Information and Computation•Feb 1, 2002•50 citations

Dynamical decoupling schemes derived from Hamilton cycles

Martin Rötteler

We address the problem of decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed, which use selective pulses. In this paper, we consider an additional requirement on these pulse sequences: as few different control operations as possible should be used. This requirement is motivated by the fact that to find an optimal implementation of each individual selective pulse will be expensive since it requires to solve a pulse shaping problem. Hence, it is desirable to use as few different selective pulses as possible. As a first result, we show that for d-dimensional systems, where d⩾2, the ability to implement only two control operations is sufficient to turn off the time evolution. Next, we address the case of a bipartite system with local control and show that four different control operations are sufficient. Finally, turning to networks consisting of several d-dimensional nodes, we show that decoupling can be achieved if one is able to control a number of different control operations, which is logarithmic in the number of nodes. We give an explicit family of efficient decoupling schemes with logarithmic number of different pulses based on the classic Hamming codes. We also provide a table of the best known decoupling schemes for small networks of qubits.

Journal of Mathematical Physics•Apr 1, 2008•6 citations

Combinatorial approaches to dynamical decoupling

Martin Rötteler, Paweł Wocjan

Introduction In this chapter we continue the introduction to dynamical decoupling techniques for open quantum systems that was started in Chapter 4. Here we focus on the construction of efficient schemes for dynamical decoupling and we highlight some combinatorial constructions. Efficiency of decoupling schemes is measured in terms of the number of control operations to be applied to the system. This number should be small, ideally a polynomial in the number of qubits in the system. If we assume that the quantum system is governed by a general Hamiltonian H S , having interactions involving any subset of the qubits, then any scheme that achieves decoupling of H S is necessarily inefficient in the above sense. The efficient schemes we consider here arise in physically realistic situations where there are much more stringent restrictions on the types of interactions. The most important example is the case of pair-interaction Hamiltonians. These Hamiltonians can be expressed as sums of interaction terms that involve at most two qubits. While there is a large body of work on dynamical decoupling schemes for pair-interaction Hamiltonians [S90, EBW94,WHH68, H76], which historically has been used mainly in the context of nuclear magnetic resonance (NMR) theory, the past few years have seen a development of new techniques for decoupling that are based on group theory. We therefore call such techniques, or rather the pulse sequences that an experimenter can apply to a given Hamiltonian in order to selectively switch off unwanted couplings, combinatorial decoupling schemes.

Cambridge University Press eBooks•Sep 5, 2013•2 citations

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

Dominik Janzing, Paweł Wocjan, Beth, Thomas

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.

arXiv:quant-ph/0203061•Mar 14, 2002•1 citation

ON THE COMPUTATIONAL POWER OF PHYSICAL INTERACTIONS: BOUNDS ON THE NUMBER OF TIME STEPS FOR SIMULATING ARBITRARY INTERACTION GRAPHS

Dominik Janzing, Paweł Wocjan, Thomas Beth

The most popular model of quantum computation is the quantum circuit model using single and two qubit gates as elementary transformations. Definitions of quantum complexity usually refer to this model. In contrast, we consider the physical interactions among the qubits as the basic computational resource that allows to carry out complex transformations on the quantum register. One method to compare the computational power of different interactions is to examine the complexity of the so-called mutual simulation of interaction Hamiltonians. The physical interaction can simulate other interactions by interspersing the natural time evolution with external control operations. 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 simulations of general interaction graphs. 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.

International Journal of Foundations of Computer Science•Oct 1, 2003•1 citation
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. Conditions on time optimal simulation are formulated in terms of spectral majorization of matrices characterizing the coupling parameters. Efficient schemes for decoupling and time reversal can be constructed from orthogonal arrays provided that the dimensions of all nodes are equal to the same prime power. 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 interaction we present optimal schemes for inversion.
Decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian is a well-studied problem. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed which use selective pulses. In this paper we consider an additional requirement on these pulse sequences: as few {\em different} control operations as possible should be used. This requirement is motivated by the fact that optimizing each individual selective pulse will be expensive, i. e., it is desirable to use as few different selective pulses as possible. For an arbitrary ddd-dimensional system we show that the ability to implement only two control operations is sufficient to turn off the time evolution. In case of a bipartite system with local control we show that four different control operations are sufficient. Turning to networks consisting of several ddd-dimensional nodes which are governed by a pair-interaction Hamiltonian, we show that decoupling can be achieved if one is able to control a number of different control operations which is logarithmic in the number of nodes.
We consider a quantum computer consisting of n spins with an arbitrary but fixed pair-interaction Hamiltonian and describe how to simulate other pair-interactions by interspersing the natural time evolution with fast local transformations. Calculating the minimal time overhead of such a simulation leads to a convex optimization problem. Lower and upper bounds on the minimal time overhead are derived in terms of chromatic indices of interaction graphs and spectral majorization criteria. These results classify Hamiltonians with respect to their computational power. For a specific Hamiltonian, namely \sigma_z\otimes\sigma_z-interactions between all spins, the optimization is mathematically equivalent to a separability problem of n-qubit density matrices. We compare the complexity defined by such a quantum computer with the usual gate complexity.
We address the problem of decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed, which use selective pulses. In this paper, we consider an additional requirement on these pulse sequences: as few different control operations as possible should be used. This requirement is motivated by the fact that to find an optimal implementation of each individual selective pulse will be expensive since it requires to solve a pulse shaping problem. Hence, it is desirable to use as few different selective pulses as possible. As a first result, we show that for d-dimensional systems, where d⩾2, the ability to implement only two control operations is sufficient to turn off the time evolution. Next, we address the case of a bipartite system with local control and show that four different control operations are sufficient. Finally, turning to networks consisting of several d-dimensional nodes, we show that decoupling can be achieved if one is able to control a number of different control operations, which is logarithmic in the number of nodes. We give an explicit family of efficient decoupling schemes with logarithmic number of different pulses based on the classic Hamming codes. We also provide a table of the best known decoupling schemes for small networks of qubits.
Introduction In this chapter we continue the introduction to dynamical decoupling techniques for open quantum systems that was started in Chapter 4. Here we focus on the construction of efficient schemes for dynamical decoupling and we highlight some combinatorial constructions. Efficiency of decoupling schemes is measured in terms of the number of control operations to be applied to the system. This number should be small, ideally a polynomial in the number of qubits in the system. If we assume that the quantum system is governed by a general Hamiltonian H S , having interactions involving any subset of the qubits, then any scheme that achieves decoupling of H S is necessarily inefficient in the above sense. The efficient schemes we consider here arise in physically realistic situations where there are much more stringent restrictions on the types of interactions. The most important example is the case of pair-interaction Hamiltonians. These Hamiltonians can be expressed as sums of interaction terms that involve at most two qubits. While there is a large body of work on dynamical decoupling schemes for pair-interaction Hamiltonians [S90, EBW94,WHH68, H76], which historically has been used mainly in the context of nuclear magnetic resonance (NMR) theory, the past few years have seen a development of new techniques for decoupling that are based on group theory. We therefore call such techniques, or rather the pulse sequences that an experimenter can apply to a given Hamiltonian in order to selectively switch off unwanted couplings, combinatorial decoupling schemes.
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.
The most popular model of quantum computation is the quantum circuit model using single and two qubit gates as elementary transformations. Definitions of quantum complexity usually refer to this model. In contrast, we consider the physical interactions among the qubits as the basic computational resource that allows to carry out complex transformations on the quantum register. One method to compare the computational power of different interactions is to examine the complexity of the so-called mutual simulation of interaction Hamiltonians. The physical interaction can simulate other interactions by interspersing the natural time evolution with external control operations. 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 simulations of general interaction graphs. 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.