Non-Pauli topological stabilizer codes from twisted quantum doubles
Julio Carlos Magdalena de la Fuente, Nicolas Tarantino, Jens Eisert
备注：
v1: 18 pages, 3 figures, v2: stabilizer group explanation added, calculations and results unchanged, v3: extended last section for submission, v4: minor changes for published version
It has long been known that long-ranged entangled topological phases can be exploited to protect quantum information against unwanted local errors. Indeed, conditions for intrinsic topological order are reminiscent of criteria for faithful quantum error correction. At the same time, the promise of using general topological orders for practical error correction remains largely unfulfilled to date. In this work, we significantly contribute to establishing such a connection by showing that Abelian twisted quantum double models can be used for quantum error correction. By exploiting the group cohomological data sitting at the heart of these lattice models, we transmute the terms of these Hamiltonians into full-rank, pairwise commuting operators, defining commuting stabilizers. The resulting codes are defined by non-Pauli commuting stabilizers, with local systems that can either be qubits or higher dimensional quantum systems. Thus, this work establishes a new connection between condensed matter physics and quantum information theory, and constructs tools to systematically devise new topological quantum error correcting codes beyond toric or surface code models.
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…
We use a graphical representation of stabilizer states to describe, simply and efficiently, the effect of measurements of Pauli products on stabilizer states. This work complements our earlier work [Phys. Rev. A 77, 042307 (2008)], which described in graphical terms the action of Clifford operations on stabilizer states.
We construct a Pauli stabilizer model for every two-dimensional Abelian topological order that admits a gapped boundary. Our primary example is a Pauli stabilizer model on four-dimensional qudits that belongs to the double semion (DS) phase of matter. The DS stabilizer Hamiltonian is constructed by condensing an emergent boson in a $\mathbb{Z}_4$ toric code, where the condensation is implemented by making certain two-body measurements. We rigorously verify the topological order of the DS stabilizer model by identifying an explicit finite-depth quantum circuit (with ancillary qubits) that maps …
We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford circuit of constant depth into a finite number of copies of the toric code (abelian discrete gauge theory) stabilizer group. This means that under local Clifford circuits the number of toric code copies is the complete invariant of topological Pauli stabilizer codes. Previously, the same conclusion was obtained under the assumption of nonchirality for qubit cod…
Hypergraph states of many quantum bits share the rich interplay between simple combinatorial description and nontrivial entanglement properties enjoyed by the graph states that they generalize. In this paper, we consider hypergraph states that are also permutationally invariant. We characterize the states in this class that have nontrivial local Pauli stabilizers and give applications to nonlocality and error correction.
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 界，并展示通过测量该稳定子可确定性制备逻辑魔法态。
In this paper we study the quantum graphs of mixed-unitary channels generated by tensor products of Pauli operators, which we call Pauli channels. We show that most quantum graphs arising from Pauli channels have non-trivial quantum cliques or quantum anticliques which are stabilizer codes. However, a reformulation of Nik Weaver's quantum Ramsey theorem in terms of stabilizer codes and Pauli channels fails. Specifically, for every positive integer $n$, there exists an $n$-qubit Pauli channel for which any non-trivial quantum clique or quantum anticlique fails to be a stabilizer code.
Majorana-Pauli stabilizer codes and duality webs of fermionic topological phases
International Center for Quantum Materials, School of Physics, Peking University（北京大学物理学院量子材料国际中心）；C. N. Yang Institute for Theoretical Physics, Stony Brook University（石溪大学陈省身理论物理研究所）
SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates
University of Edinburgh（爱丁堡大学）；Arclight Quantum Computing Inc.（Arclight量子计算公司）；Institute of Computing Technology, Chinese Academy of Sciences（中国科学院计算技术研究所）
Mapping an error syndrome to the error operator is the core of quantum decoding network and is also the key step of recovery. The definitions of the bit-flip error syndrome matrix and the phase-flip error syndrome matrix were presented, and then the error syndromes of quantum errors were expressed in terms of the columns of the bit-flip error syndrome matrix and the phase-flip error syndrome matrix. It also showed that the error syndrome matrices of a stabilizer code are determined by its check matrix, which is similar to the classical case. So, the error-detection and recovery techniques of c…
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 Pauli group and the Clifford group with matrices over the integers modulo d. We further show how a Clifford operation can be efficiently decomposed into one and two-qudit operations. We also focus in detail on standard basis expansions of stabilizer states.
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…
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 of a quantum code. First, we show how to measure a Pauli operator acting on physical qubits using a single coherent state with large average photon number, displacement operations, and photon detection. Second, we show how to measure the stabilizer operators fault-tolerantly by the deterministic preparation of coherent cat states along with one-bit teleportat…
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the protocol can efficiently simulate a large set of multi-qubit mixed states that are not mixtures of stabilizer states. The existence of these 'bound states' was previously only known for odd-dimensional systems like qutrits. The algorithm also has the favorable property that circuits with depolarizing noise are simulated much faster than unitary circuits. Th…
Many-body quantum states, as a matter of fact, are extremely essential to solve certain mathematical problems or simulate quantum systems in measurement-based quantum computation. However, how to verify large scale quantum states, such as hypergraph states, is an exceedingly hard task for multi-body quantum systems. Here, we propose a novel fault-tolerant solution for verification of colorable hypergraph states by using stabilizer test. Compared with the adaptive stabilizer test, our protocol is dramatically facilitating by making only Pauli-X and Pauli-Z measurement. As to appliance, it will …
Clifford circuits play an important role in quantum computation. Gottesman and Chuang proposed a gate teleportation protocol so that a quantum circuit can be implemented by the teleportation circuit with specific ancillary qubits. In particular, an $n$-qubit Clifford circuit $U$ can be implemented by preparing an ancillary stabilizer state $(I\otimes U)|Φ^+\rangle^{\otimes n}$ for teleportation and doing a Pauli correction conditioned on the measurement. In this paper, we provide an alternative procedure to implement a Clifford circuit through Pauli measurements, by preparing $O(1)$ ancillas t…
A strong converse for stabilizer codes over Pauli channels via the blowing-up lemma
Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；Department of Electrical and Computer Engineering, National University of Singapore（新加坡国立大学电气与计算机工程系）
We investigate two dimensional compactifications of three dimensional fractonic stabilizer models. We find the two dimensional topological phases produced as a function of compactification radius for the X-cube model and Haah's cubic code. Furthermore, we uncover translation symmetry-enrichment in the compactified cubic code that leads to twisted boundary conditions.
Learning Noise-Robust Stabilizer Structure via Bell Sampling
Joint Center for Quantum Information and Computer Science, University of Maryland and NIST（马里兰大学与国家标准与技术研究院量子信息与计算科学联合中心）；Department of Physics, University of Maryland（马里兰大学物理系）；Department of Physics, Carnegie Mellon University（卡内基梅隆大学物理系）；Department of Computer Science, Carnegie Mellon University（卡内基梅隆大学计算机科学系）；Joint Quantum Institute, University of Maryland and NIST（马里兰大学与国家标准与技术研究院联合量子研究所）
The Gottesman-Knill theorem allows for the efficient simulation of stabilizer-based quantum error-correction circuits. Errors in these circuits are commonly modeled as depolarizing channels by using Monte Carlo methods to insert Pauli gates randomly throughout the circuit. Although convenient, these channels are poor approximations of common, realistic channels like amplitude damping. Here we analyze a larger set of efficiently simulable error channels by allowing the random insertion of any one-qubit gate or measurement that can be efficiently simulated within the stabilizer formalism. Our ne…
We present novel algorithms to estimate outcomes for qubit quantum circuits. Notably, these methods can simulate a Clifford circuit in linear time without ever writing down stabilizer states explicitly. These algorithms outperform previous noisy near-Clifford techniques for most circuits. We identify a large class of input states that can be efficiently simulated despite not being stabilizer states. The algorithms leverage probability distributions constructed from Bloch vectors, paralleling previously known algorithms that use the discrete Wigner function for qutrits.
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…
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 disparate groups of states: bipartite pure states, GHZ states, and antisymmetric basis states. In this work, we investigate systematically optimal verification of entangled stabilizer states using Pauli measurements. First, we provide a lower bound on the sample complexity of any verification protocol based on separable measurements, which is independent of the n…
Pauli stabilizer formalism for topological quantum field theories and generalized statistics
International Center for Quantum Materials, School of Physics, Peking University（北京大学物理学院量子材料国际中心）；Department of Physics, Massachusetts Institute of Technology（麻省理工学院物理系）；School of Natural Sciences, Institute for Advanced Study, Princeton（普林斯顿高等研究院自然科学院）；Department of Mathematics, King’s College London（伦敦国王学院数学系）
Realistic Gottesman-Kitaev-Preskill stabilizer states enable universal quantum computation
Institute for Quantum Science and Technology, and Department of Physics and Astronomy, University of Calgary（卡尔加里大学量子科学与技术研究所及物理与天文学系）；Xanadu Quantum Technologies Inc.（Xanadu量子技术有限公司）
Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes
International Center for Quantum Materials, School of Physics, Peking University（北京大学物理学院量子材料国际中心）；Center of Mathematical Sciences and Applications, Harvard University（哈佛大学数学科学应用中心）；Joint Center for Quantum Information and Computer Science, University of Maryland（马里兰大学量子信息与计算机科学联合中心）
Simulating general noise nearly as cheaply as Pauli noise
National University of Singapore（新加坡国立大学）；Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；University of Chicago（芝加哥大学）；University of Illinois Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）；Entropica Labs（熵实验室）；Department of Physics, National University of Singapore（新加坡国立大学物理系）
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 previously found bound of $2^{\sim 0.468 t}$. We numerically demonstrate this reduction. This constructively produces the most efficient strong simulation algorithm of the Clifford+$T$ gateset to relative or multiplicative error. We then examine the cost of Pauli measurement in terms of its Gauss sum rank, which is a slight generalization of the stabilizer rank and i…
We prove a general lower bound to the spectral gap of the Davies generator for Hamiltonians that can be written as the sum of commuting Pauli operators. These Hamiltonians, defined on the Hilbert space of $N$-qubits, serve as one of the most frequently considered candidates for a self-correcting quantum memory. A spectral gap bound on the Davies generator establishes an upper limit on the life time of such a quantum memory and can be used to estimate the time until the system relaxes to thermal equilibrium when brought into contact with a thermal heat bath. The bound can be shown to behave as …
On Error Thresholds for Pauli Channels: Some answers with many more questions
Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）；David R. Cheriton School of Computer Science, University of Waterloo（滑铁卢大学大卫·R·切里顿计算机科学学院）；Department of Physics, Harvard University（哈佛大学物理系）；Perimeter Institute for Theoretical Physics（基础物理珀尔迈特研究所）；Department of Combinatorics and Optimization, University of Waterloo（滑铁卢大学组合数学与优化系）；Department of Applied Mathematics, University of Waterloo（滑铁卢大学应用数学系）
Pauli spectrum and nonstabilizerness of random fermionic Gaussian states
Universität zu Köln（科隆大学）；Barcelona Supercomputing Center（巴塞罗那超级计算中心）；Technical University of Munich（慕尼黑工业大学）；Munich Center for Quantum Science and Technology (MCQST)（慕尼黑量子科学与工程中心）
Stabilizer Statistical Mechanics: A Framework for Efficient Quantification and Classification of Magic States
LG Electronics Toronto AI Lab（LG电子多伦多人工智能实验室）；Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；MajuLab, CNRS-UNS-NUS-NTU International Joint Research Unit, UMI 3654（MajuLab，CNRS-UNS-NUS-NTU国际联合研究单元，UMI 3654）；National Institute of Education, Nanyang Technological University（南洋理工大学国立教育学院）
We present a general protocol for stabilizer measurements and pumping in a system of N superconducting qubits. We assume always-on, equal dispersive couplings to a single mode of a high-Q microwave resonator in the ultra-strong dispersive limit where the dispersive shifts largely exceed the spectral linewidth. In this limit, we show how to map the two eigenvalues of an arbitrary weight M < N Pauli operator, onto two quasi-orthogonal coherent states of the cavity. Together with a fast cavity readout, this enables the efficient measurement of stabilizer operators.
A topological defect network (TDN) is formed by a network of topological defects embedded within a topological quantum field theory (TQFT). TDNs were introduced recently for the purpose of describing fracton topological phases of matter using the framework of defect TQFT. Their effectiveness has been demonstrated through numerous examples, yet a systematic construction was lacking. Here we solve this problem by formulating a method to construct TDNs for a wide range of lattice Hamiltonians. Our method takes a lattice Hamiltonian as input, applies an ungauging procedure, then creates a refined …
