Related papers: Learning the stabilizer group of a Matrix Product …
Nonstabilizerness, or `magic', is a critical quantum resource that, together with entanglement, characterizes the non-classical complexity of quantum states. Here, we address the problem of quantifying the average nonstabilizerness of…
Matrix Product States (MPS) are a particular type of one dimensional tensor network states, that have been applied to the study of numerous quantum many body problems. One of their key features is the possibility to describe and encode…
Statistical verification of a quantum state aims to certify whether a given unknown state is close to the target state with confidence. So far, sample-optimal verification protocols based on local measurements have been found only for…
Characterizing large noisy multiparty quantum states using genuine multiparty entanglement is a challenging task. In this paper, we calculate lower bounds of genuine multiparty entanglement localized over a chosen multiparty subsystem of…
In this paper we investigate stabilizer quantum error correction codes using controlled phase rotations of strong coherent probe states. We explicitly describe two methods to measure the Pauli operators which generate the stabilizer group…
We study the classical compilation of quantum circuits for the preparation of matrix product states (MPS), which are quantum states of low entanglement with an efficient classical description. Our algorithm represents a near-term…
Nonstabilizerness, also known as magic, quantifies the number of non-Clifford operations needed in order to prepare a quantum state. As typical measures either involve minimization procedures or a computational cost exponential in the…
We describe generalizations of the Pauli group, the Clifford group and stabilizer states for qudits in a Hilbert space of arbitrary dimension d. We examine a link with modular arithmetic, which yields an efficient way of representing the…
The state hidden subgroup problem (StateHSP) is a recent generalization of the hidden subgroup problem. We present an algorithm that solves the non-abelian StateHSP over $N$ copies of the dihedral group of order $8$ (the symmetries of a…
We find a scaling reduction in the stabilizer rank of the twelve-qubit tensored $T$ gate magic state. This lowers its asymptotic bound to $2^{\sim 0.463 t}$ for multi-Pauli measurements on $t$ magic states, improving over the best…
We introduce a monotone to quantify the amount of non-stabilizerness (or magic for short), in an arbitrary quantum state. The monotone gives a necessary and sufficient criterion for detecting the presence of magic for both pure and mixed…
We propose a framework to describe and simulate a class of many-body quantum states. We do so by considering joint eigenspaces of sets of monomial unitary matrices, called here "M-spaces"; a unitary matrix is monomial if precisely one entry…
We propose a non-commutative extension of the Pauli stabilizer formalism. The aim is to describe a class of many-body quantum states which is richer than the standard Pauli stabilizer states. In our framework, stabilizer operators are…
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits, which aims to replicate their behavior using a classical…
We develop a method for visualizing the internal structure of multipartite entanglement in pure stabilizer states. Our algorithm graphically organizes the many-body correlations in a hierarchical structure. This provides a rich taxonomy…
A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS) and the algorithms thereof. The method is quite versatile and can be…
Let $|\Psi>$ be an arbitrary stabilizer state distributed between three remote parties, such that each party holds several qubits. Let $S$ be a stabilizer group of $|\Psi>$. We show that $|\Psi>$ can be converted by local unitaries into a…
Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem. In this paper, we study the magic of the…
Multipartite entanglement is a natural generalization of bipartite entanglement, but is relatively poorly understood. In this paper, we develop tools to calculate a class of multipartite entanglement measures - known as multi-invariants -…
Identifying the symmetry properties of quantum states is a central theme in quantum information theory and quantum many-body physics. In this work, we investigate quantum learning problems in which the goal is to identify a hidden symmetry…