English
Related papers

Related papers: On Local Equivalence, Surface Code States and Matr…

200 papers

The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of…

Information Theory · Computer Science 2021-09-28 Hanson Hao

Ground states of local Hamiltonians can be generally highly entangled: any quantum circuit that generates them (even approximately) must be sufficiently deep to allow coupling (entanglement) between any pair of qubits. Until now this…

Quantum Physics · Physics 2019-07-22 Lior Eldar , Aram W. Harrow

We study questions in incidence geometry where the precise position of points is `blurry' (e.g. due to noise, inaccuracy or error). Thus lines are replaced by narrow tubes, and more generally affine subspaces are replaced by their small…

Combinatorics · Mathematics 2012-11-05 Albert Ai , Zeev Dvir , Shubhangi Saraf , Avi Wigderson

A fundamental distinction between many-body quantum states are those with short- and long-range entanglement (SRE and LRE). The latter cannot be created by finite-depth circuits, underscoring the nonlocal nature of Schr\"odinger cat states,…

Strongly Correlated Electrons · Physics 2024-06-11 Nathanan Tantivasadakarn , Ryan Thorngren , Ashvin Vishwanath , Ruben Verresen

The compass model on a square lattice provides a natural template for building subsystem stabilizer codes. The surface code and the Bacon-Shor code represent two extremes of possible codes depending on how many gauge qubits are fixed. We…

Quantum Physics · Physics 2019-06-05 Muyuan Li , Daniel Miller , Michael Newman , Yukai Wu , Kenneth R. Brown

In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…

Information Theory · Computer Science 2025-09-23 Eduardo Camps-Moreno , Elisa Gorla , Hiram H. López

Majorana Representation (MR) of symmetric $ N $-qubit pure states has been used successfully in entanglement classification. Generalization of this has been a long standing open problem due to the difficulties faced in the construction of a…

Quantum Physics · Physics 2013-10-29 Sakineh Ashourisheikhi , Swarnamala Sirsi

The study of state transformations under local operations and classical communication (LOCC) plays a crucial role in entanglement theory. While this has been long ago characterized for pure bipartite states, the situation is drastically…

The stabilizer group for an $n$-qubit state $\ket{\phi}$ is the set of all invertible local operators (ILO) $g=g_1\otimes g_2\otimes \cdots\otimes g_n,$ $ g_i\in \mathcal{GL}(2,\mathbb{C})$ such that $\ket{\phi}=g\ket{\phi}.$ Recently, G.…

Quantum Physics · Physics 2019-04-30 Xian Shi

We investigate the behavior of quantum states under stochastic local quantum operations and classical communication (SLOCC) for fixed numbers of qubits. We explicitly exhibit the homomorphism between complex and real groups for two-qubits,…

Stabilizer states admit compact classical descriptions, but many downstream tasks still require their full amplitude vectors. Since the output itself has size $2^n$, the main algorithmic question is whether one can materialize an $n$-qubit…

Quantum Physics · Physics 2026-04-20 Hyunho Cha , Jungwoo Lee

Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum…

Quantum Physics · Physics 2014-10-20 Sergey Bravyi , Matthew B. Hastings

Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…

Quantum Physics · Physics 2015-02-06 David W. Lyons , Daniel J. Upchurch , Scott N. Walck , Chase D. Yetter

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…

Quantum Physics · Physics 2009-11-11 Sergey Bravyi , David Fattal , Daniel Gottesman

There is a rich connection between classical error-correcting codes, Euclidean lattices, and chiral conformal field theories. Here we show that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices…

High Energy Physics - Theory · Physics 2021-06-24 Anatoly Dymarsky , Alfred Shapere

Bivariate bicycle codes are promising candidates for high-threshold, low-overhead fault-tolerant quantum memories. Meanwhile, color codes are the most prominent self-dual CSS codes, supporting transversal Clifford gates that have been…

Quantum Physics · Physics 2026-01-13 Zijian Liang , Yu-An Chen

Invertible local transformations of a multipartite system are used to define equivalence classes in the set of entangled states. This classification concerns the entanglement properties of a single copy of the state. Accordingly, we say…

Quantum Physics · Physics 2009-11-06 W. Dür , G. Vidal , J. I. Cirac

We point out an important difference between continuum relativistic quantum field theory (QFT) and lattice models with dramatic consequences for the theory of multi-partite entanglement. On a lattice given a collection of density matrices…

High Energy Physics - Theory · Physics 2021-04-26 Nima Lashkari

We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group,…

Quantum Physics · Physics 2025-05-12 Hasan Sayginel , Stergios Koutsioumpas , Mark Webster , Abhishek Rajput , Dan E Browne

We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an $n$-qubit pure state $|\psi\rangle$, we give an efficient algorithm that distinguishes whether…

Quantum Physics · Physics 2025-09-18 Sabee Grewal , Vishnu Iyer , William Kretschmer , Daniel Liang