A Set-Transformer architecture with self-attention encodes Pauli-string correlations, optimizes via commutation objective, and finds symmetries with near-deterministic success on physical models like Ising and Toric code.
An Error-aware and Adaptive Method for the Estimation of Quantum Observables on Qudit-Based Quantum Computers
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
The accurate estimation of observables is a crucial task in quantum computing. Recent advances have highlighted the need for (a) specialized protocols for qudit-based devices, that include (b) error-aware strategies. Here, we present AQUIRE, the first protocol that can (a) accurately estimate both the mean and the error of an observable on qudit-based quantum computers. AQUIRE achieves this by constructing a Bayesian model to accommodate generalized Pauli operators. It is designed to continuously monitor the estimated average and the associated error of the observable, adjusting the subsequent measurements in real-time. Additionally, AQUIRE is (b) device- and experiment-specific error-aware, and accounts for hardware imperfections and experimental noise during the estimation process. We demonstrate AQUIRE's advantage via numerical simulations and showcase its ability to quantify the noise affecting the estimation by implementing it on a trapped-ion qudit quantum processor. By exploiting general commutation relations and overlap grouping measurements, our protocol is state-of-the-art when restricted to qubit-based quantum computers and extends this advantage to the qudit case.
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
An algorithm encodes Clifford invariants of qudit Hamiltonians as graph properties so graph automorphisms yield Clifford symmetries up to phase checks, tested on models and extended to open systems.
citing papers explorer
-
Attention-based optimizer for symmetry finding
A Set-Transformer architecture with self-attention encodes Pauli-string correlations, optimizes via commutation objective, and finds symmetries with near-deterministic success on physical models like Ising and Toric code.
-
Graph automorphisms to obtain Clifford symmetries in open and closed qudit models
An algorithm encodes Clifford invariants of qudit Hamiltonians as graph properties so graph automorphisms yield Clifford symmetries up to phase checks, tested on models and extended to open systems.