We present general mappings between classical spin systems and quantum physics. More precisely, we show how to express partition functions and correlation functions of arbitrary classical spin models as inner products between quantum stabilizer states and product states, thereby generalizing mappings for some specific models established in [Phys. Rev. Lett. 98, 117207 (2007)]. For Ising- and Potts-type models with and without external magnetic field, we show how the entanglement features of the corresponding stabilizer states are related to the interaction pattern of the classical model, while the choice of product states encodes the details of interaction. These mappings establish a link between the fields of classical statistical mechanics and quantum information theory, which we utilize to transfer techniques and methods developed in one field to gain insight into the other. For example, we use quantum information techniques to recover well known duality relations and local symmetries of classical models in a simple way, and provide new classical simulation methods to simulate certain types of classical spin models. We show that in this way all inhomogeneous models of q-dimensional spins with pairwise interaction pattern specified by a graph of bounded tree-width can be simulated efficiently. Finally, we show relations between classical spin models and measurement-based quantum computation.
We define a multi-partite entanglement measure for stabilizer states, which can be computed efficiently from a set of generators of the stabilizer group. Our measure applies to qubits, qudits and continuous variables.
Entropic uncertainty relations express the quantum mechanical uncertainty principle by quantifying uncertainty in terms of entropy. Central questions include the derivation of lower bounds on the total uncertainty for given observables, the characterization of observables that allow strong uncertainty relations, and the construction of such relations for the case of several observables. We demonstrate how the stabilizer formalism can be applied to these questions. We show that the Maassen-Uffink entropic uncertainty relation is tight for the measurement in any pair of stabilizer bases. We comp…
We propose a framework to analyze linear optical circuits based on an analogy with stabilizer formalism in quantum circuits, which provides efficiently computable formulas related to state discriminations. Hence, we analyze a Bell-state discrimination scheme with linear optics and ancillary single photons. With an increasing number of ancilla photons, the success probability of Bell-state discrimination has a maximum of $\frac{403}{512} \simeq 0.787$ at $28$ ancilla photons. By contrast, the corresponding two-qubit measurement asymptotically approaches a maximally entangling measurement.
We find an interesting relationship between multipartite bound entangled states and the stabilizer formalism. We prove that if a set of commuting operators from the generalized Pauli group on $n$ qudits satisfy certain constraints, then the maximally mixed state over the subspace stabilized by them is an unlockable bound entangled state. Moreover, the properties of this state, such as symmetry under permutations of parties, undistillability and unlockability, can be easily explained from the stabilizer formalism without tedious calculation. In particular, the four-qubit Smolin state and its re…
Operator quantum error correction is a recently developed theory that provides a generalized framework for active error correction and passive error avoiding schemes. In this paper, we describe these codes in the stabilizer formalism of standard quantum error correction theory. This is achieved by adding a "gauge" group to the standard stabilizer definition of a code that defines an equivalence class between encoded states. Gauge transformations leave the encoded information unchanged; their effect is absorbed by virtual gauge qubits that do not carry useful information. We illustrate the cons…
Suppose in a quantum network, there are $n$ qubits hold by Alice, Bob and Charlie, denoted by systems $A$, $B$ and $C$, respectively. We require the qubits to be described by a stabilizer state and assume the system $A$ is entangled with the combined system $BC$. An interesting question to ask is when it is possible to transfer all the entanglement to system $A$ and $B$ by local operation on $C$ and classical communication to $AB$, namely \textit{entanglement trimming}. We find a necessary and sufficient condition and prove constructively for this entanglement trimming, which we name it as "th…
Contextuality, a generalization of non-locality, has been proposed as the resource that provides the computational speed-up for quantum computation. For universal quantum computation using qudits, of odd-prime dimension, contextuality has been shown to be a necessary and possibly sufficient resource. However, the role of contextuality in quantum computation with qubits remains open. The $n$-qubit stabilizer formalism, which by itself cannot provide a quantum computer super-polynomial computational advantage over a classical counterpart, is contextual. Therefore contextuality cannot be identifi…
Complexity of quantum states in the stabilizer formalism
School of Mathematics and Physics, University of Science and Technology Beijing（北京科技大学数学与物理学院）；State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院数学科学重点实验室）；School of Mathematical Sciences, University of Chinese Academy of Sciences（中国科学院大学数学科学学院）
We investigate how stabilizer theory can be used for constructing sufficient conditions for entanglement. First, we show how entanglement witnesses can be derived for a given state, provided some stabilizing operators of the state are known. These witnesses require only a small effort for an experimental implementation and are robust against noise. Second, we demonstrate that also nonlinear criteria based on uncertainty relations can be derived from stabilizing operators. These criteria can sometimes improve the witnesses by adding nonlinear correction terms. All our criteria detect states clo…
We show that qubit stabilizer states can be represented by non-negative quasi-probability distributions associated with a Wigner-Weyl-Moyal formalism where Clifford gates are positive state-independent maps. This is accomplished by generalizing the Wigner-Weyl-Moyal formalism to three generators instead of two---producing an exterior, or Grassmann, algebra---which results in Clifford group gates for qubits that act as a permutation on the finite Weyl phase space points naturally associated with stabilizer states. As a result, a non-negative probability distribution can be associated with each …
The stabilizer formalism is a scheme, generalizing well-known techniques developed by Gottesman [quant-ph/9705052] in the case of qubits, to efficiently simulate a class of transformations ("stabilizer circuits", which include the quantum Fourier transform and highly entangling operations) on standard basis states of d-dimensional qudits. To determine the state of a simulated system, existing treatments involve the computation of cumulative phase factors which involve quadratic dependencies. We present a simple formalism in which Pauli operators are represented using displacement operators in …
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 tensor products of single-qubit operators drawn from the group $\langle αI, X,S\rangle$, where $α=e^{iπ/4}$ and $S=\operatorname{diag}(1,i)$. We provide techniques to efficiently compute various properties related to bipartite entanglement, expectation values of local observables, preparation by means of quantum circuits, parent Hamiltonians etc. We also highligh…
Improving the simulation of quantum circuits on classical computers is important for understanding quantum advantage and increasing development speed. In this paper, we explore a new way to express stabilizer states and further improve the speed of simulating stabilizer circuits with a current existing approach. First, we discover a unique and elegant canonical form for stabilizer states based on graph states to better represent stabilizer states and show how to efficiently simplify stabilizer states to canonical form. Second, we develop an improved algorithm for graph state stabilizer simulat…
Contextuality is a fundamental non-classical property of quantum theory, which has recently been proven to be a key resource for achieving quantum speed-ups in some leading models of quantum computation. However, which of the forms of contextuality, and how much thereof, are required to obtain a speed-up in an arbitrary model of quantum computation remains unclear. In this paper, we show that the relation between contextuality and a compuational advantage is more complicated than previously thought. We achieve this by proving that generalized contextuality is present even within the simplest s…
Self-testing was originally introduced as a device-independent method of certification of entangled quantum states and local measurements performed on them. Recently, in [F. Baccari \textit{et al.}, arXiv:2003.02285] the notion of state self-testing has been generalized to entangled subspaces and the first self-testing strategies for exemplary genuinely entangled subspaces have been given. The main aim of our work is to pursue this line of research and to address the question how "large" (in terms of dimension) are genuinely entangled subspaces that can be self-tested, concentrating on the mul…
How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all qudits simultaneously, and local white noise, where a single qudit depolarizing channel is applied to every qudit individually. Using a unitary generalization of the Pauli group, I derive noise thresholds for stabilizer states, with an emphasis on graph states, and compare different entanglement criteria. The PPT and reduction criteria generally provide high nois…
We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. More precisely, we show how to express partition functions as inner products between certain quantum stabilizer states and product states. This connection allows us to use powerful techniques developed in quantum information theory, such as the stabilizer formalism and classical simulation techniques, to gain general insights into these models in a unified way. We recover and generalize several symmetries and high-low…
The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum coset codes. This formalism offers a new perspective for GCQCs and enables us to derive a lower bound on the code distance of stabilizer GCQCs from component codes parameters,for both non-degenerate and degenerate component codes. Our formalism also shows how to exploit the error-correcting capacity of component codes to design good GCQCs efficiently.
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum entanglement in quantum programs is necessary. Several papers studied the problem. They decided qubits were entangled if multiple qubits unitary gates are applied to them, and some refined this reasoning using information about the state of each separated qubit. However, they do not care about the fact that unitary gate undoes entanglement and that measurement may …
Fermion-to-qubit mappings that preserve geometric locality are especially useful for simulating lattice fermion models (e.g., the Hubbard model) on a quantum computer. They avoid the overhead associated with geometric non-local parity terms in mappings such as the Jordan-Wigner transformation and the Bravyi-Kitaev transformation. As a result, they often provide quantum circuits with lower depth and gate complexity. In such encodings, fermionic states are encoded in the common +1 eigenspace of a set of stabilizers, akin to stabilizer quantum error-correcting codes. Here, we discuss several know…
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we represent states as a linear combination of graphs with Clifford operations on their vertices. We show how a $\mathcal{C}_3$ gate such as the Toffoli gate or $\frac\pi8$ gate acting on a stabilizer state splits it into two stabilizer states. We also describe conditions for merging two stabilizer states into one. We discuss applications of our algorithm to circuit identities and finding low stabilizer rank representations of magic states.
The determination of many special types of quantum states has been studied thoroughly, such as the generalized |GHZ> states, |W> states equivalent under stochastic local operations and classical communication and Dicke states. In this paper, we are going to study another special entanglement states which is stabilizer states. The stabilizer states and their subset graph states play an important role in quantum error correcting codes, multipartite purification and so on. We show that all n- qubit stabilizer states are uniquely determined (among arbitrary states, pure or mixed) by their reduced …
According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the graph-state formalism. It shows significant improvement in comparison to an existing algorithm, given by Gottesman and Aaronson, in terms of speed and of the number of qubits the simulator can handle. We also present an implementation.
We study, by means of the stabilizer formalism, a quantum error correcting code which is alternative to the standard block codes since it embeds a qubit into a qudit. The code exploits the non-commutative geometry of discrete phase space to protect the qubit against both amplitude and phase errors. The performance of such code is evaluated on Weyl channels by means of the entanglement fidelity as function of the error probability. A comparison with standard block codes, like five and seven qubit stabilizer codes, shows its superiority.
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In th…
We propose a randomized variant of the stabilizer rewiring algorithm (SRA), a method for constructing a transversal circuit mapping between any pair of stabilizer codes. As gates along this circuit are applied, the initial code is deformed through a series of intermediate codes before reaching the final code. With this randomized variant, we show that there always exists a path of deformations which preserves the code distance throughout the circuit, while using at most linear overhead in the distance. Furthermore, we show that a random path will almost always suffice, and discuss prospects fo…
Spekkens has introduced a toy theory [Phys. Rev. A, 75, 032110 (2007)] in order to argue for an epistemic view of quantum states. I describe a notation for the theory (excluding certain joint measurements) which makes its similarities and differences with the quantum mechanics of stabilizer states clear. Given an application of the qubit stabilizer formalism, it is often entirely straightforward to construct an analogous application of the notation to the toy theory. This assists calculations within the toy theory, for example of the number of possible states and transformations, and enables s…
Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles
Joint Quantum Institute, NIST/University of Maryland（联合量子研究所，美国国家标准与技术研究院/马里兰大学）；Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（量子信息与计算机科学联合中心，美国国家标准与技术研究院/马里兰大学）；School of Physics, The University of Sydney（悉尼大学物理学院）；Institute for Physical Sciences and Technology, University of Maryland（马里兰大学物理科学与工程技术研究所）；Condensed Matter Theory Center and Joint Quantum Institute, Department of Physics, University of Maryland（马里兰大学物理系凝聚态理论中心与联合量子研究所）
该文提出 $X\mathcal C^{(k)}_d$ 稳定子形式体系，推广 Pauli 稳定子以涵盖扭曲量子双重模型，证明其可规避 Bravyi-Koenig 界，并展示通过测量该稳定子可确定性制备逻辑魔法态。
The Pauli groups are ubiquitous in quantum information theory because of their usefulness in describing quantum states and operations and their readily understood symmetry properties. In addition, the most well-understood quantum error correcting codes -- stabilizer codes -- are built using Pauli operators. The eigenstates of these operators -- stabilizer states -- display a structure (e.g., mutual orthogonality relationships) that has made them useful in examples of multi-qubit non-locality and contextuality. Here, we apply the graph-theoretical contextuality formalism of Cabello, Severini an…
A generalization of the stabilizer code construction presented by Gottesman is described, which allows for the construction of quantum error-correcting codes for continuous-variable systems. This formalism describes all continuous-variable codes presented to date, and can be used to construct new codes based on discrete-variable codes or classical codes. We use it to describe the nine-mode code given by Lloyd and Slotine, and a five-mode code described by Braunstein. In addition, we construct a new continuous-variable code based an code of Gottesman which encodes three logical modes of informa…
The stabilizer ground state and applications to quantum simulation
School of Science, Huzhou University（湖州学院理学院）；New York University Shanghai（纽约大学上海分校；纽约大学上海NYU-ECNU物理研究所）；NYU-ECNU Institute of Physics at NYU Shanghai（华东师范大学物理与材料科学学院精密光谱科学国家重点实验室）；State Key Laboratory of Precision Spectroscopy, School of Physical and Material Sciences, East China Normal University（纽约大学阿布扎比分校NYUAD研究院量子与拓扑系统中心）；Center for Quantum and Topological Systems (CQTS), NYUAD Research Institute, New York University Abu Dhabi（纽约大学物理系）；Department of Physics, New York University
The generation and verification of large-scale entanglement are essential to the development of quantum technologies. In this paper, we present an efficient scheme to generate genuine multipartite entanglement of a large number of qubits by using the Heisenberg interaction. This method can be conveniently implemented in various physical platforms, including superconducting, trapped-ion, and cold-atom systems. In order to characterize the entanglement of the output quantum state, we generalize the stabilizer formalism and develop an entanglement witness method. In particular, we design a generi…
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 pure state $ψ$ is defined to be the smallest integer $χ$ such that $ψ$ is a superposition of $χ$ stabilizer states. Here we develop a comprehensive mathematical theory of the stabilizer rank and the related approximate stabilizer rank. We also present a suite of classical simulation algorithms with broader applicability and significantly improved performance …
This is a short review on an interdisciplinary field of quantum information science and statistical mechanics. We first give a pedagogical introduction to the stabilizer formalism, which is an efficient way to describe an important class of quantum states, the so-called stabilizer states, and quantum operations on them. Furthermore, graph states, which are a class of stabilizer states associated with graphs, and their applications for measurement-based quantum computation are also mentioned. Based on the stabilizer formalism, we review two interdisciplinary topics. One is the relation between …
MPStab: an hybrid stabilizers tensor-network quantum circuit simulator
University of Trieste（的里雅斯特大学）；Istituto Nazionale di Fisica Nucleare, Trieste Section（意大利国家核物理研究所的里雅斯特分部）；University of Helsinki（赫尔辛基大学）；European Organization for Nuclear Research (CERN)（欧洲核子研究组织（日内瓦））；Chalmers University of Technology（查尔姆斯理工大学）
Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing
NSF-ERC Center for Quantum Networks, Wyant College of Optical Sciences, The University of Arizona（亚利桑那大学怀特光学科学学院量子网络 NSF-ERC 中心）
In this work, we study the Wigner phase-space representation of qubit states encoded in continuous variables (CV) by using the Gottesman-Kitaev-Preskill (GKP) mapping. We explore a possible connection between resources for universal quantum computation in discrete-variable (DV) systems, i.e. non-stabilizer states, and negativity of the Wigner function in CV architectures, which is a necessary requirement for quantum advantage. In particular, we show that the lowest Wigner logarithmic negativity of qubit states encoded in CV with the GKP mapping corresponds to encoded stabilizer states, while t…
