From bound (6.25), we have max ( |Zi|,| ~Zi| ) ≤NδT/2, ∀i (6.32) when choosing each data qubit Zj =±1 in completely random, with exponentially small failure probability e−Ω(NδT)

Define HY = ∑ N i=1HY i similarly with HY i = i 2 √ 2 √ N ~Zi⊗X+ i + H

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

citation-role summary

other 1

unclear 1

quant-ph · 2025-09-29 · conditional · novelty 8.0

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.

Showing 1 of 1 citing paper.

Fast quantum computation with all-to-all Hamiltonians quant-ph · 2025-09-29 · conditional · none · ref 2
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.