Recognition: unknown
Learning stabilizer states by Bell sampling
read the original abstract
We show that measuring pairs of qubits in the Bell basis can be used to obtain a simple quantum algorithm for efficiently identifying an unknown stabilizer state of n qubits. The algorithm uses O(n) copies of the input state and fails with exponentially small probability.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Heisenberg-limited Hamiltonian learning without short-time control
Heisenberg-limited Hamiltonian learning is achievable with any constant minimum evolution time T per query, attaining optimal 1/ε total-time scaling for logarithmically sparse Hamiltonians.
-
Cloning is as Hard as Learning for Stabilizer States
For n-qubit stabilizer states the optimal sample complexity of approximate cloning is Θ(n), matching the complexity of learning.
-
Single-copy stabilizer learning: average case and worst case
Log-depth circuits suffice for average-case single-copy stabilizer learning with t=O(log n), but worst-case adaptive single-copy learning requires exp(t) samples.
-
Sector length distributions of recursively definable graph states through analytic combinatorics
Closed-form sector length distributions for recursively definable graph states (paths, cycles, stars, grids) via generating functions, yielding analytical concentratable entanglement, depolarizing fidelity bounds, and...
-
Optimal detection of dissipation in Lindbladian dynamics
A randomized algorithm detects dissipation of magnitude at least epsilon in unknown Lindbladian dynamics with optimal total evolution time O(epsilon^{-1}) under bounded strength and locality assumptions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.