Estimating gate complexities for the site-by-site preparation of fermionic vacua

In this paper, we study the scaling of the overlap between an $N$- and $(N+1)$-site ground state, as a function of the number of sites $N$, for a range of quadratic fermionic Hamiltonians.

Quantum routing with teleportation

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC).

April 8, 2022 · Dhruv Devulapalli, Eddie Schoute, Aniruddha Bapat, Andrew M Childs, Alexey V Gorshkov