Universal simulation of Hamiltonian dynamics for qudits
arXiv:quant-ph/0109064 · doi:10.1103/PhysRevA.66.022317
Abstract
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.
13 pages, an error in the "Pauli-Euclid-Gottesman Lemma" fixed, main results unchanged
References in corpus (8)
- Elementary gates for quantum computation
- Universality in Quantum Computation
- Entanglement capabilities of non-local Hamiltonians
- Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
- Efficient Refocussing of One Spin and Two Spin Interactions for NMR Quantum Computation
- Efficient implementation of selective recoupling in heteronuclear spin systems using Hadamard matrices
- Universal quantum computation with two-level trapped ions
- Characterizing mixing and measurement in quantum mechanics
Cited by in corpus (66)
- Quantum Simulation
- Quantum Chemistry in the Age of Quantum Computing
- Qudits and high-dimensional quantum computing
- A practical scheme for quantum computation with any two-qubit entangling gate
- Quantum dynamics as a physical resource
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
- Using Quantum Computers for Quantum Simulation
- Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
- Maximizing the Hilbert space for a finite number of distinguishable quantum states
- Optimal Entanglement Generation from Quantum Operations
- Scalable quantum computing with qudits on a graph
- Designing spin-1 lattice models using polar molecules
- Overlap-ADAPT-VQE: Practical Quantum Chemistry on Quantum Computers via Overlap-Guided Compact Ansätze
- Qudit Quantum Computation in the Jaynes-Cummings Model
- Entanglement flow in multipartite systems
- Quantum Walks, Quantum Gates and Quantum Computers
- Dynamical engineering of interactions in qudit ensembles
- Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds
- Decomposing the generalized Toffoli gate with qutrits
- Realizing quantum gates with optically-addressable Yb ion qudits
- Conditions for optimal construction of two-qubit non-local gates
- Error Thresholds for Abelian Quantum Double Models: Increasing the bit-flip Stability of Topological Quantum Memory
- Efficient realization of quantum algorithms with qudits
- Lower bounds on the complexity of simulating quantum gates
- An Ideal Characterization of the Clifford Operators
- Equivalence of Decoupling Schemes and Orthogonal Arrays
- Fungible dynamics: there are only two types of entangling multiple-qubit interactions
- Demonstration of a parity-time symmetry breaking phase transition using superconducting and trapped-ion qutrits
- Gate simulation and lower bounds on the simulation time
- Continuous dynamical decoupling of optical Yb qudits with radiofrequency fields
- Unitary Gate Synthesis for Continuous Variable Systems
- Tripartite Entanglement in Qudit Stabilizer States and Application in Quantum Error Correction
- Quantum simulations under translational symmetry
- Qudit Hypergraph States
- Universal quantum computing with qubits embedded in trapped-ion qudits
- Reversible simulation of bipartite product Hamiltonians
- Multipartite unlockable bound entanglement in the stabilizer formalism
- Simulating Hamiltonian dynamics using many-qudit Hamiltonians and local unitary control
- Generalized Toffoli gate decomposition using ququints: Towards realizing Grover's algorithm with qudits
- Towards multiqudit quantum processor based on a Yb ion string: Realizing basic quantum algorithms
- Complexity of decoupling and time-reversal for n spins with pair-interactions: Arrow of time in quantum control
- Ultrastrong time-dependent light-matter interactions are gauge-relative
- Perfect many-to-one teleportation with stabilizer states
- Local unitary classification for sets of generalized Bell states
- Protecting qudit operations from noise by continuous dynamical decoupling
- Fermionic wave packet scattering: a quantum computing approach
- High-dimensional quantum state transfer in a noisy network environment
- On the practicality of time-optimal two-qubit Hamiltonian simulation
- Constructing Pauli pulse schemes for decoupling and quantum simulation
- Deterministic distributed dense coding with stabilizer states
- The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems
- Effects of Noise, Correlations and errors in the preparation of initial states in Quantum Simulations
- Hybrid algorithms to solve linear systems of equations with limited qubit resources
- Entanglement Capacity of Nonlocal Hamiltonians : A Geometric Approach
- Measurements on Composite Qudits
- Normalizer Circuits and Quantum Computation
- General, efficient, and robust Hamiltonian engineering
- Efficient Chromatic-Number-Based Multi-Qubit Decoherence and Crosstalk Suppression
- A comparison of three ways to measure time-dependent densities with quantum simulators
- Abelian Hypergroups and Quantum Computation
- Efficiently verifiable quantum advantage on near-term analog quantum simulators
- Time-dependent Rabi frequencies to protect quantum operations on an atomic qutrit by continuous dynamical decoupling
- Transpiling quantum assembly language circuits to a qudit form
- Bounds on the number of time steps for simulating arbitrary interaction graphs
- Duality theory for Clifford tensor powers