most citedExponential distillation of dominant eigenproperties

2 citations · 4 across the 9 of their papers we have counts for

collaborators
Showing quant-phShow all

9 papers · 1 filter

quant-ph2026

Nearly Optimal Amplitude Estimation at any Depth

Jona Erle, Bálint Koczor

We develop a class of amplitude estimation algorithms with tunable circuit depth and circuit repetitions , requiring neither ancilla qubits nor controlled Grover operations.…

quant-ph2026

Eigenstate Preparation Through Near-Optimal Eigenprobability Filtering

Po-Wei Huang, Bence Bakó, Bálint Koczor

Quantum simulation is expected to be a main application of quantum computers with realistic utility in quantum chemistry, materials science and beyond. However, preparing excited o…

quant-ph2026

Nanostructure modelling with early fault tolerant quantum computers

Zhu Sun, Christian Binder, Balint Koczor +1

Semiconductor nanostructures are central to many developing technologies. Notably, double quantum dots are especially important for semiconductor spin-qubit architectures, quantum…

quant-ph2026

Quantum-inspired classical simulation through randomized time evolution

Fredrik Hasselgren, Bálint Koczor

Tensor-network simulations of quantum many-body dynamics are fundamentally limited by entanglement build-up, which leads to exponentially growing computational costs. Furthermore,…

quant-ph2026

Low-depth amplitude estimation via statistical eigengap estimation

Po-Wei Huang, Bálint Koczor

Amplitude estimation, in its original form, is formulated as phase estimation upon the Grover iterate. Subsequent improvements to the algorithm have eliminated the need for phase e…

quant-ph2026

A Shadow Enhanced Greedy Quantum Eigensolver

Jona Erle, Balint Koczor

While ground-state preparation is expected to be a primary application of quantum computers, it is also an essential subroutine for many fault-tolerant algorithms. In early fault-t…

quant-ph2026

Stratified Sampling for Quasi-Probability Decompositions

Joshua W. Dai, Bálint Koczor

Quasi-probability decompositions (QPDs) have proven essential in many quantum algorithms and protocols -- one replaces a ``difficult'' quantum circuit with an ensemble of ``easier'…

quant-ph2025★ 2 cited

Exponential distillation of dominant eigenproperties

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…

quant-ph2025★ 2 cited

Space-time tradeoff in networked virtual distillation

Tenzan Araki, Joseph F. Goodwin, Bálint Koczor

In contrast to monolithic devices, modular, networked quantum architectures are based on interconnecting smaller quantum hardware nodes using quantum communication links, and offer…