All Or Nothing: No-Downfolding Theorems For Quantum Simulation
Troy Van Voorhis

TL;DR
This paper proves that exact downfolding of quantum Hamiltonians into lower dimensions, which would simplify quantum simulations, is fundamentally impossible for the most common formulations, impacting future quantum information research.
Contribution
The paper establishes a no-go theorem showing the impossibility of exact eigenvalue-preserving downfolding for parameter-dependent Hamiltonians in quantum systems.
Findings
Exact quantum downfolding cannot recover all eigenvalue functions.
The result applies to Hamiltonians of the form A + xB with parameter x.
Implications for quantum simulation and information processing.
Abstract
The physics of a quantum system with many degrees of freedom is often approximated by downfolding: most of the degrees of freedom are "folded into" a much smaller number of degrees of freedom, resulting in an effective Hamiltonian that still captures the essential physics. Approaches of this sort are particularly relevant for quantum information, where exact downfolding would allow eigenstates in a large Hilbert space to be simulated with fewer qubits. Very little work has been done to prove the existence of such an exact downfolding for general systems or even particular cases. In this letter we prove that exact quantum downfolding is impossible for what is perhaps the most commonly-used formulation of the task. Specifically, for a non-trivial Hamiltonian that depends on some parameter (e.g. an electric field, bond length or interaction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum chaos and dynamical systems
