Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds

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. 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.

19 pages, LaTeX2e

References in corpus (7)

• Simulating Physical Phenomena by Quantum Networks
• Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
• Universal simulation of Hamiltonian dynamics for qudits
• Optimal simulation of two-qubit Hamiltonians using general local operations
• Optimal simulation of nonlocal Hamiltonians using local operations and classical communication
• Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity
• Universal Simulation of Hamiltonians Using a Finite Set of Control Operations

Cited by in corpus (35)

• Quantum Simulation
• Tapering off qubits to simulate fermionic Hamiltonians
• Using Quantum Computers for Quantum Simulation
• Quantum cellular automata quantum computing with endohedral fullerenes
• Preserving qubit coherence by dynamical decoupling
• Combining dynamical decoupling with fault-tolerant quantum computation
• Protection of quantum systems by nested dynamical decoupling
• Empirical Determination of Bang-Bang Operations
• A quantum computer using a trapped-ion spin molecule and microwave radiation
• Quantum simulation of interacting high-dimensional systems: the influence of noise
• Equivalence of Decoupling Schemes and Orthogonal Arrays
• Programmable quantum simulation by dynamic Hamiltonian engineering
• Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer
• Fungible dynamics: there are only two types of entangling multiple-qubit interactions
• Gate simulation and lower bounds on the simulation time
• Unitary Gate Synthesis for Continuous Variable Systems
• Quantum Control via Geometry: An explicit example
• Quantum simulations under translational symmetry
• Pointer States via Engineered Dissipation
• Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays
• Simulating Hamiltonian dynamics using many-qudit Hamiltonians and local unitary control
• Algorithmic independence of initial condition and dynamical law in thermodynamics and causal inference
• Hamiltonian quantum simulation with bounded-strength controls
• Complexity of decoupling and time-reversal for n spins with pair-interactions: Arrow of time in quantum control
• Constructing Pauli pulse schemes for decoupling and quantum simulation
• Effects of Noise, Correlations and errors in the preparation of initial states in Quantum Simulations
• Platonic dynamical decoupling sequences for interacting spin systems
• Entanglement Capacity of Nonlocal Hamiltonians : A Geometric Approach
• Improved bounded-strength decoupling schemes for local Hamiltonians
• Universal quantum processors in spin systems via robust local pulse sequences
• Performing joint measurements and transformations on several qubits by operating on a single control qubit
• Pulse-controlled quantum gate sequences on a strongly coupled qubit chain
• Suppression of effective noise in Hamiltonian simulations
• Randomized control of open quantum systems
• Bounds on the number of time steps for simulating arbitrary interaction graphs