REVIEW 1 cited by
Algebraic Compression of Free Fermionic Quantum Circuits: Particle Creation, Arbitrary Lattices and Controlled Evolution
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Recently we developed a local and constructive algorithm based on Lie algebraic methods for compressing Trotterized evolution under Hamiltonians that can be mapped to free fermions. The compression algorithm yields a circuit which scales linearly in the number of qubits, has a depth independent of evolution time and compresses time-dependent Hamiltonians. The algorithm is limited to simple nearest-neighbor spin interactions and fermionic hopping. In this work, we extend our methods to compress evolution with long-range fermionic hopping, thereby enabling the embedding of arbitrary lattices onto a chain of qubits for fermion models. Moreover, we show that controlled time evolution, as well as fermion creation and annihilation operators can also be compressed. We demonstrate our results by adiabatically preparing the ground state for a half-filled fermionic chain, simulating a $4 \times 4$ tight binding model on ibmq washington, and calculating the topological Zak phase on a Quantinuum H1-1 trapped-ion quantum computer. With these new developments, our results enable the simulation of a wider range of models of interest and the efficient compression of subcircuits.
Forward citations
Cited by 1 Pith paper
-
Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
A classical-reservoir-derived variational circuit achieves at least 0.99 ground-state fidelity for 8- and 10-site 2D Fermi-Hubbard models at U/t=8, using fewer parameters and no fermionic swap network.
Discussion (0). Continue with ORCID to comment.