Related papers: The stabilizer for $n$-qubit symmetric states

Stabilizer states, which are also known as the Clifford states, have been commonly utilized in quantum information, quantum error correction, and quantum circuit simulation due to their simple mathematical structure. In this work, we apply…

Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli…

We study the relation between local unitary (LU) equivalence and local Clifford (LC) equivalence of stabilizer states. We introduce a large subclass of stabilizer states, such that every two LU equivalent states in this class are…

We introduce a new approach to Gottesman-Kitaev-Preskill (GKP) states that treats their finite-energy version in an exact manner. Based on this analysis, we develop new qubit-oscillator circuits that autonomously stabilize a GKP manifold,…

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…

Despite the exponential overhead to describe general multi-qubit quantum states and processes, efficient methods for certain state families and operations have been developed and utilised. The stabilizer formalism and the Gottesman-Knill…

We prove that the vast majority of symmetric states of qubits can be decomposed in a unique way into a superposition of spin 1/2 coherent states. For the case of two qubits, the proposed decomposition reproduces the Schmidt decomposition…

In 1999 V. Ivanov and S. Kerov observed that structure constants of algebras of conjugacy classes of symmetric groups $S_n$ admit a stabilization (in a non-obvious sense) as $n\to \infty$. We extend their construction to a class of pairs of…

A sofic group $G$ is said to be flexibly stable if every sofic approximation to $G$ can converted to a sequence of disjoint unions of Schreier graphs by modifying an asymptotically vanishing proportion of edges. We establish that if…

Encoding a qubit in a larger Hilbert space of an oscillator is an efficient way to protect its quantum information against decoherence. Promising examples of such bosonic encodings are the Gottesman-Kitaev-Preskill (GKP) codes. In this…

We demonstrate that absolutely maximally entangled (AME) states consisting of $N=4n$ qudits with $n\in\{1,2,3,...\}$, each of even local dimension, cannot be realized as graph states. This result imposes strong constraints on AME states in…

We consider a quantum system of n qudits and the Clebsch-Gordan decomposition of the associated Hilbert space. In this decomposition, one of the subspaces is the so-called symmetric subspace or symmetric sector, that is, the subspace of all…

Suppose we have an n-qubit system, and we are given a collection of local density matrices rho_1,...,rho_m, where each rho_i describes some subset of the qubits. We say that rho_1,...,rho_m are "consistent" if there exists a global state…

Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP…

We show that all $2\otimes 4$ states with strong positive partial transposes (SPPT) are separable. We also construct a family of $2\otimes 5$ entangled SPPT states, so the conjecture on the separability of SPPT states are completely…

We develop a framework for the classification of invertible translation-invariant stabilizer codes modulo condensation and stabilization with simple codes. We introduce generalizations of the Pauli groups of local unitaries for quantum…

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and $O(\log n)$ non-Clifford gates. Specifically, for an $n$-qubit state $|\psi\rangle$ prepared with at most $t$ non-Clifford gates, our…

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite almost simple primitive permutation group, with socle $G_0$ and point stabilizer $H$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer is trivial; the base size of $G$,…

A pure quantum state is called $k$-uniform if all its reductions to $k$-qudit are maximally mixed. We investigate the general constructions of $k$-uniform pure quantum states of $n$ subsystems with $d$ levels. We provide one construction…