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/0107059 · Physical Review A

Suppression of arbitrary internal coupling in a quantum register

Marcus Stollsteimer, Günter Mahler A

Published Oct 1, 2001• 52 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.64.052301

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•0 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•4 citations

Efficient synthesis of quantum gates on indirectly coupled spins

Haidong Yuan, Daxiu Wei, Yajuan Zhang +2 more

Experiments in coherent nuclear and electron magnetic resonance and quantum computing in general correspond to control of quantum-mechanical systems, guiding them from initial to final target states by unitary transformations. The control inputs (pulse sequences) that accomplish these unitary transformations should take as little time as possible so as to minimize the effects of relaxation and decoherence and to optimize the sensitivity of the experiments. Here, we derive a time-optimal sequences as fundamental building blocks to synthesize unitary transformations. Such sequences can be widely implemented on various physical systems, including the simulation of effective Hamiltonians for topological quantum computing on spin lattices. Experimental demonstrations are provided for a system consisting of three nuclear spins.

arXiv:1309.3837•Physical Review A•Apr 17, 2014•14 citations

Pulse sequences for controlled two- and three-qubit gates in a hybrid quantum register

Jingfu Zhang, Swathi S. Hegde, Dieter Suter

We propose and demonstrate a quantum control scheme for hybrid quantum registers that can reduce the operation time, and therefore the effects of relaxation, compared to existing implementations. It combines resonant excitation pulses with periods of free precession under the internal Hamiltonian of the qubit system. We use this scheme to implement quantum gates like controlled-NOT operations on electronic and nuclear spins of the nitrogen-vacancy center in diamond. As a specific application, we transfer population between electronic and nuclear spin qubits and use it to measure the Rabi oscillations of a nuclear spin in a system with multiple coupled spins.

arXiv:1806.08408•Physical Review A•Oct 2, 2018•9 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

Experimental implementation of quantum gates through actuator qubits

Jingfu Zhang, Daniel Klaus Burgarth, Raymond Laflamme +1 more

Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations. In combination with a drift Hamiltonian containing interactions between the qubits, this allows the implementation of arbitrary gate operations. Here, we demonstrate an alternative scheme that does not require local control for all qubits: we implement one- and two-qubit gate operations on a set of target qubits indirectly, through a combination of gates on directly controlled actuator qubits with a drift Hamiltonian that couples actuator and target qubits. Experiments are performed on nuclear spins, using radio-frequency pulses as gate operations and magnetic-dipole couplings for the drift Hamiltonian.

arXiv:1405.7169•Physical Review A•Jan 22, 2015•8 citations
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.
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.
Experiments in coherent nuclear and electron magnetic resonance and quantum computing in general correspond to control of quantum-mechanical systems, guiding them from initial to final target states by unitary transformations. The control inputs (pulse sequences) that accomplish these unitary transformations should take as little time as possible so as to minimize the effects of relaxation and decoherence and to optimize the sensitivity of the experiments. Here, we derive a time-optimal sequences as fundamental building blocks to synthesize unitary transformations. Such sequences can be widely implemented on various physical systems, including the simulation of effective Hamiltonians for topological quantum computing on spin lattices. Experimental demonstrations are provided for a system consisting of three nuclear spins.
We propose and demonstrate a quantum control scheme for hybrid quantum registers that can reduce the operation time, and therefore the effects of relaxation, compared to existing implementations. It combines resonant excitation pulses with periods of free precession under the internal Hamiltonian of the qubit system. We use this scheme to implement quantum gates like controlled-NOT operations on electronic and nuclear spins of the nitrogen-vacancy center in diamond. As a specific application, we transfer population between electronic and nuclear spin qubits and use it to measure the Rabi oscillations of a nuclear spin in a system with multiple coupled spins.
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.
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations. In combination with a drift Hamiltonian containing interactions between the qubits, this allows the implementation of arbitrary gate operations. Here, we demonstrate an alternative scheme that does not require local control for all qubits: we implement one- and two-qubit gate operations on a set of target qubits indirectly, through a combination of gates on directly controlled actuator qubits with a drift Hamiltonian that couples actuator and target qubits. Experiments are performed on nuclear spins, using radio-frequency pulses as gate operations and magnetic-dipole couplings for the drift Hamiltonian.