Efficient implementation of selective recoupling in heteronuclear spin systems using Hadamard matrices

Abstract

We present an efficient scheme which couples any designated pair of spins in heteronuclear spin systems. The scheme is based on the existence of Hadamard matrices. For a system of $n$ spins with pairwise coupling, the scheme concatenates $cn$ intervals of system evolution and uses at most $c{n}^2$ pulses where $c\approx 1$. Our results demonstrate that, in many systems, selective recoupling is possible with linear overhead, contrary to common speculation that exponential effort is always required.

7 pages, 4 figures, mypsfig2, revtex, submitted April 27, 1999

Cited by in corpus (59)

• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Quantum computation with trapped polar molecules
• Cold and Ultracold Molecules: Science, Technology, and Applications
• NMR Techniques for Quantum Control and Computation
• The Variational Quantum Eigensolver: a review of methods and best practices
• Measuring out-of-time-order correlators on a nuclear magnetic resonance quantum simulator
• An all silicon quantum computer
• Quantum Computing with NMR
• Experimental implementation of an adiabatic quantum optimization algorithm
• Quantum dynamics as a physical resource
• Coherence Time of a Solid-State Nuclear Qubit
• Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
• Liquid State NMR as a Test-bed for Developing Quantum Control Methods
• Universal simulation of Hamiltonian dynamics for qudits
• Optimal simulation of two-qubit Hamiltonians using general local operations
• Reducing Constraints on Quantum Computer Design by Encoded Selective Recoupling
• Polynomial-Time Simulation of Pairing Models on a Quantum Computer
• Silicon quantum computation based on magnetic dipolar coupling
• Transmon platform for quantum computing challenged by chaotic fluctuations
• On Quantum Control via Encoded Dynamical Decoupling
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions
• Two-dimensional cluster-state preparation with linear ion traps
• NMR quantum computation with indirectly coupled gates
• Suppression of arbitrary internal coupling in a quantum register
• Quantum Computation with Diatomic Bits in Optical Lattices
• Versatile microwave-driven trapped ion spin system for quantum information processing
• Dynamical decoupling and dephasing in interacting two-level systems
• Lower bounds on the complexity of simulating quantum gates
• The Reservoir Learning Power across Quantum Many-Boby Localization Transition
• Quantum computing with magnetically interacting atoms
• Compiling gate networks on an Ising quantum computer
• Equivalence of Decoupling Schemes and Orthogonal Arrays
• Entanglement generation by adiabatic navigation in the space of symmetric multi-particle states
• Programmable quantum simulation by dynamic Hamiltonian engineering
• Gate simulation and lower bounds on the simulation time
• Array of planar Penning traps as a nuclear magnetic resonance molecule for quantum computation
• Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays
• Complexity of decoupling and time-reversal for n spins with pair-interactions: Arrow of time in quantum control
• Controlling NMR spin systems for quantum computation
• Compilation of selective pulse network on liquid-state nuclear magnetic resonance system
• On the practicality of time-optimal two-qubit Hamiltonian simulation
• Selective recoupling and stochastic dynamical decoupling
• Efficient Hamiltonian programming in qubit arrays with nearest-neighbour couplings
• Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings
• Rescaling interactions for quantum control
• Quantum simulation of fermionic systems using hybrid digital-analog quantum computing approach
• Design method of dynamical decoupling sequences integrated with optimal control theory
• Hybrid paramagnetic-ferromagnetic quantum computer design based on electron spin arrays and a ferromagnetic nanostripe
• Quantum simulation dynamics and circuit synthesis of FMO complex on an NMR quantum computer
• Universal quantum processors in spin systems via robust local pulse sequences
• General, efficient, and robust Hamiltonian engineering
• Quantum Simulation of Pairing Hamiltonians with Nearest-Neighbor Interacting Qubits
• Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity
• Optimal generation of single-qubit operation from an always-on interaction by algebraic decoupling
• Quantum algorithm for finding periodicities in the spectrum of a black-box Hamiltonian or unitary transformation
• A functional basis for efficient physical-layer classical control in quantum processors
• Performing joint measurements and transformations on several qubits by operating on a single control qubit
• Quantum Computing with Global One-and Two-Qubit Gates
• Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing