Papers
qcr:2609.49906.1

Exponential Distillation of Dominant Eigenproperties

APS

Bence Bakó, Tenzan Araki, Bálint Koczor

Estimating observable expectation values in eigenstates of quantum systems has a broad range of applications and is an area where early fault-tolerant quantum computers may provide practical quantum advantage. We develop a hybrid quantum-classical algorithm that enables the estimation of an arbitrary observable expectation value in an eigenstate, given an initial state is supplied that has dominant overlap with the targeted eigenstate—but may overlap with any other eigenstates. Our approach builds on and is conceptually similar to purification-based error mitigation techniques; however, it achieves exponential suppression of algorithmic errors using only a single copy of the quantum state. The key innovation is that random time evolution is applied in the quantum computer to create an average mixed quantum state, which is then virtually purified with exponential efficacy. We prove rigorous performance guarantees and conclude that the complexity of our approach depends directly on the energy gap in the problem Hamiltonian and remarkably, can be compared to phase estimation combined with amplitude estimation in terms of its scaling with respect to a target precision. We demonstrate in a broad range of numerical simulations the applicability of our framework in near-term and early fault-tolerant settings. Furthermore, we demonstrate in a 100-qubit example that direct classical simulation of our approach enables the prediction of ground and excited state properties of quantum systems using tensor-network techniques, which we recognize as a quantum-inspired classical approach.
Quantum Simulation
10.1103/bglh-9snd
Published 2026
Uploaded 2 weeks ago
14
Views
View Publication
Citing this entry? Use this QCR ID
Uploaded by
BB
Bence Bakó

Overview

Join the Discussion

Comments (0)

No comments yet. Be the first to share your thoughts!

Related Code0

No implementations yet. Add an implementation →

Related Tutorials0

No tutorials cover this paper yet. Add a tutorial →

Versions

v1 Latest
Sep 11, 2026
qcr:2609.49906.1

Cite all versions? Use the base QCR ID to always reference the latest version of this entry.

You may also like1