In this paper, we present a learning algorithm aimed at learning states obtained from computational basis states by Clifford circuits doped with a finite number t of T-gates. The algorithm learns an exact tomographic description of t-doped stabilizer states in terms of Pauli observables. This is possible because such states are countable and form a discrete set. To tackle the problem, we introduce a novel algebraic framework for t-doped stabilizer states, which extends beyond Tgates and includes doping with any kind of quires resources of complexity poly(n, 2t) and of failure.
Learning t-doped stabilizer states
Leone, L
;Hamma, A
2024
Abstract
In this paper, we present a learning algorithm aimed at learning states obtained from computational basis states by Clifford circuits doped with a finite number t of T-gates. The algorithm learns an exact tomographic description of t-doped stabilizer states in terms of Pauli observables. This is possible because such states are countable and form a discrete set. To tackle the problem, we introduce a novel algebraic framework for t-doped stabilizer states, which extends beyond Tgates and includes doping with any kind of quires resources of complexity poly(n, 2t) and of failure.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.