All-to-all Hamiltonians can simulate any two-qubit gate in about 1/N time and any depth-D circuit in about D/√N time, with polynomially small error.
Demonstration of three- and four-body interactions between trapped-ion spins
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Quantum processors use the native interactions between effective spins to simulate Hamiltonians or execute quantum gates. In most processors, the native interactions are pairwise, limiting the efficiency of controlling entanglement between many qubits. Here we experimentally demonstrate a new class of native interactions between trapped-ion qubits, extending conventional pairwise interactions to higher order. We realize three- and four-body spin interactions as examples, showing that high-order spin polynomials may serve as a new toolbox for quantum information applications.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Fast quantum computation with all-to-all Hamiltonians
All-to-all Hamiltonians can simulate any two-qubit gate in about 1/N time and any depth-D circuit in about D/√N time, with polynomially small error.