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/0408078

Efficient Decoupling Schemes Based on Hamilton Cycles

Martin Roetteler

Published Aug 11, 2004• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0408078

Related papers

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•4 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•1 citation

Simulating Hamiltonians in quantum networks: Efficient schemes and complexity bounds

Paweł Wocjan, Martin Rötteler, Dominik Janzing +1 more

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.

arXiv:quant-ph/0109088•Physical Review A•Mar 29, 2002•50 citations

Efficient decoupling and recoupling in solid state NMR for quantum computation

Fumiko Yamaguchi, Thaddeus D. Ladd, Cyrus P. Master +2 more

A scheme for decoupling and selectively recoupling large networks of dipolar-coupled spins is proposed. The scheme relies on a combination of broadband, decoupling pulse sequences applied to all the nuclear spins with a band-selective pulse sequence for single spin rotations or recoupling. The evolution-time overhead required for selective coupling is independent of the number of spins, subject to time-scale constraints, for which we discuss the feasibility. This scheme may improve the scalability of solid-state-NMR quantum computing architectures.

arXiv:quant-ph/0411099•Nov 15, 2004•3 citations

Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays

Paweł Wocjan

The task of decoupling, i.e., removing unwanted internal couplings of a quantum system and its couplings to an environment, plays an important role in quantum control theory. There are many efficient decoupling schemes based on combinatorial concepts such as orthogonal arrays, difference schemes, and Hadamard matrices. So far these combinatorial decoupling schemes have relied on the ability to effect sequences of instantaneous, arbitrarily strong control Hamiltonians (bang-bang controls). To overcome the shortcomings of bang-bang control, Viola and Knill proposed a method called ``Eulerian decoupling'' that allows the use of bounded-strength controls for decoupling. However, their method was not directly designed to take advantage of the local structure of internal couplings and couplings to an environment that typically occur in multipartite quantum systems. In this paper we define a combinatorial structure called Eulerian orthogonal array. It merges the desirable properties of orthogonal arrays and Eulerian cycles in Cayley graphs (that are the basis of Eulerian decoupling). We show that this structure gives rise to decoupling schemes with bounded-strength control Hamiltonians that can be used to remove both internal couplings and couplings to an environment of a multipartite quantum system. Furthermore, we show how to construct Eulerian orthogonal arrays having good parameters in order to obtain efficient decoupling schemes.

arXiv:quant-ph/0410107•Physical Review A•Jun 13, 2006•18 citations

Suppression of arbitrary internal coupling in a quantum register

Marcus Stollsteimer, Günter Mahler A

For the implementation of a quantum computer it is necessary to exercise complete control over the Hamiltonian of the used physical system. For nuclear magnetic resonance quantum computing the effectively acting Hamiltonian can be manipulated via pulse sequences. Here we examine a register consisting of N selectively addressable spins with pairwise coupling between each spin pair. We show that complete decoupling of the spins is possible, independent of the particular form of the spin-spin interaction. The proposed method based on orthogonal arrays is efficient in the sense that the effort regarding time and amount of pulses increases only polynomially with the size N of the register. However, the effect of external control errors in terms of inaccurate control pulses eventually limits the achievable precision.

arXiv:quant-ph/0107059•Physical Review A•Oct 1, 2001•52 citations
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 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.
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.
A scheme for decoupling and selectively recoupling large networks of dipolar-coupled spins is proposed. The scheme relies on a combination of broadband, decoupling pulse sequences applied to all the nuclear spins with a band-selective pulse sequence for single spin rotations or recoupling. The evolution-time overhead required for selective coupling is independent of the number of spins, subject to time-scale constraints, for which we discuss the feasibility. This scheme may improve the scalability of solid-state-NMR quantum computing architectures.
The task of decoupling, i.e., removing unwanted internal couplings of a quantum system and its couplings to an environment, plays an important role in quantum control theory. There are many efficient decoupling schemes based on combinatorial concepts such as orthogonal arrays, difference schemes, and Hadamard matrices. So far these combinatorial decoupling schemes have relied on the ability to effect sequences of instantaneous, arbitrarily strong control Hamiltonians (bang-bang controls). To overcome the shortcomings of bang-bang control, Viola and Knill proposed a method called ``Eulerian decoupling'' that allows the use of bounded-strength controls for decoupling. However, their method was not directly designed to take advantage of the local structure of internal couplings and couplings to an environment that typically occur in multipartite quantum systems. In this paper we define a combinatorial structure called Eulerian orthogonal array. It merges the desirable properties of orthogonal arrays and Eulerian cycles in Cayley graphs (that are the basis of Eulerian decoupling). We show that this structure gives rise to decoupling schemes with bounded-strength control Hamiltonians that can be used to remove both internal couplings and couplings to an environment of a multipartite quantum system. Furthermore, we show how to construct Eulerian orthogonal arrays having good parameters in order to obtain efficient decoupling schemes.
For the implementation of a quantum computer it is necessary to exercise complete control over the Hamiltonian of the used physical system. For nuclear magnetic resonance quantum computing the effectively acting Hamiltonian can be manipulated via pulse sequences. Here we examine a register consisting of N selectively addressable spins with pairwise coupling between each spin pair. We show that complete decoupling of the spins is possible, independent of the particular form of the spin-spin interaction. The proposed method based on orthogonal arrays is efficient in the sense that the effort regarding time and amount of pulses increases only polynomially with the size N of the register. However, the effect of external control errors in terms of inaccurate control pulses eventually limits the achievable precision.