Related papers: Single-copy stabilizer testing
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. Our bounds apply to adaptive computations using measurements…
It is well known that Grover's algorithm asymptotically transforms an equal superposition state into an eigenstate (of a given basis). Here, we demonstrate a verification algorithm based on weak measurement which can achieve the same…
A fundamental problem in quantum physics is to establish whether a multiparticle quantum state can be uniquely determined from its local marginals. In theory, this problem has been addressed in the exact case where the marginals are…
We classify, up to local unitary equivalence, the set of $n$-qubit states that is stabilized by the diagonal subgroup of the local unitary group. We exhibit a basis for this set, parameterized by diagrams of nonintersecting chords…
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-outcome measurements, can distinguish between the case that at least one of the measurements accepts the state with high probability, and…
Tree tensor network states (TTNS) generalize the notion of having low Schmidt-rank to multipartite quantum states, through a parameter known as the bond dimension. This leads to succinct representations of quantum many-body systems with a…
It is a fundamental problem to decide how many copies of an unknown mixed quantum state are necessary and sufficient to determine the state. Previously, it was known only that estimating states to error $\epsilon$ in trace distance required…
The stabilizer group of an n-qubit state \psi is the set of all matrices of the form g=g_1\otimes\cdots\otimes g_n, with g_1,...,g_n being any 2x2 invertible complex matrices, that satisfy g\psi=\psi. We show that for 5 or more qubits,…
Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement--based quantum computation, and quantum communication. Central in these applications are the local symmetries of these…
The entropy of a quantum system is a measure of its randomness, and has applications in measuring quantum entanglement. We study the problem of measuring the von Neumann entropy, $S(\rho)$, and R\'enyi entropy, $S_\alpha(\rho)$ of an…
The classification of stabilizer states under local Clifford (LC) equivalence is of particular importance in quantum error-correction and measurement-based quantum computation. Two stabilizer states are called LC equivalent if there exists…
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of stabilizer rank, which for a…
Typical stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system. By incorporating a broader representation-theoretic perspective, we provide a generalized framework that…
It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. This property ensures the security of quantum key distribution. It is therefore an important task in quantum communication to design and…
We describe a simple quantum algorithm for preparing $K$ copies of an $N$-dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous work of Grover, who showed how to prepare one copy in time…
We study the problem of quantum-state tomography under the assumption that the state of the system is close to pure. In this context, an efficient measurements that one typically formulates uniquely identify a pure state from within the set…
We investigate sampling procedures that certify that an arbitrary quantum state on $n$ subsystems is close to an ideal mixed state $\varphi^{\otimes n}$ for a given reference state $\varphi$, up to errors on a few positions. This task makes…
We present a novel classical algorithm designed to learn the stabilizer group -- namely the group of Pauli strings for which a state is a $\pm 1$ eigenvector -- of a given Matrix Product State (MPS). The algorithm is based on a clever and…
We give a new algorithm for computing the robustness of magic - a measure of the utility of quantum states as a computational resource. Our work is motivated by the magic state model of fault-tolerant quantum computation. In this model, all…
Non-stabilizerness (colloquially "magic") characterizes genuinely quantum (beyond-Clifford) operations necessary for preparation of quantum states, and can be measured by stabilizer R\'enyi entropy (SRE). For permutationally symmetric…