A five-qubit codeword stabilized quantum code is implemented in a seven-qubit system using nuclear magnetic resonance (NMR). Our experiment implements a good nonadditive quantum code which encodes a larger Hilbert space than any stabilizer code with the same length and capable of correcting the same kind of errors. The experimentally measured quantum coherence is shown to be robust against artificially introduced errors, benchmarking the success in implementing the quantum error correction code. Given the typical decoherence time of the system, our experiment illustrates the ability of coherent control to implement complex quantum circuits for demonstrating interesting results in spin qubits for quantum computing.
Codeword stabilized quantum codes provide a unified approach to constructing quantum error-correcting codes, including both additive and non-additive quantum codes. Standard codeword stabilized quantum codes encode quantum information into subspaces. The more general notion of encoding quantum information into a subsystem is known as an operator (or subsystem) quantum error correcting code. Most operator codes studied to date are based in the usual stabilizer formalism. We introduce operator quantum codes based on the codeword stabilized quantum code framework. Based on the necessary and suffi…
In this work, we study the Codeword Stabilized Quantum Codes (CWS codes) a generalization of the stabilizers quantum codes using a new approach, the algebraic structure of modules, a generalization of linear spaces. We show then a new result that relates CWS codes with stabilizer codes generalizing results in the literature.
Codeword stabilized (CWS) codes are a general class of quantum codes that includes stabilizer codes and many families of non-additive codes with good parameters. For such a non-additive code correcting all t-qubit errors, we propose an algorithm that employs a single measurement to test all errors located on a given set of t qubits. Compared with exhaustive error screening, this reduces the total number of measurements required for error recovery by a factor of about 3^t.
Entangled qubit can increase the capacity of quantum error correcting codes based on stabilizer codes. In addition, by using entanglement quantum stabilizer codes can be construct from classical linear codes that do not satisfy the dual-containing constraint. We show that it is possible to construct both additive and non-additive quantum codes using the codeword stabilized quantum code framework. Nonadditive codes may offer improved performance over the more common sta- bilizer codes. Like other entanglement-assisted codes, the encoding procedure acts only the qubits on Alice's side, and only …
In this paper, we introduce a unified framework to construct entanglement-assisted quantum error-correcting codes, including additive and nonadditive codes, based on the codeword stabilized framework on subsystems. The codeword stabilized (CWS) framework is a scheme to construct quantum error-correcting codes (QECCs) including both additive and nonadditive codes, and gives a method to construct a QECC from a classical error-correcting code in standard form. Entangled pairs of qubits (ebits) can be used to improve capacity of quantum error correction. In addition, it gives a method to overcome …
We discuss a method to adapt the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. We focus on the corresponding Pauli error models for amplitude damping noise and phase damping noise. In particular, we look at codes for Pauli error models that correct one or two amplitude damping errors. Applying local Clifford operations on graph states, we are able to exhaustively search for all possible codes up to length $9$. With a similar method, we also look at codes for the Pauli error model that detect a single amplitude error and detect multiple pha…
We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or non-additive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cycl…
Quantum error correcting codes (QECCs) in quantum communi- cation systems has been known to exhibit improved performance with the use of error-free entanglement bits (ebits). In practical situations, ebits inevitably suffer from errors, and as a result, the error-correcting capability of the code is diminished. Prior studies have proposed two different schemes as a solu- tion. One uses only one QECC to correct errors on the receiver's side (i.e., Bob) and on the sender's side (i.e., Alice). The other uses different QECCs on each side. In this paper, we present a method to correct errors on bot…
We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with superior parameters to any previously known. In particular, we find ((10,18,3)) and ((10,20,3)) codes. We also show how to construct encoding circuits for all codes within our framework.
The codeword stabilized ("CWS") quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021). This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we prove three structure theorems which reduc…
The codeword stabilized (CWS) quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021 [quant-ph]), but only for binary states. Here we generalize the CWS framework to the nonbinary case (of both prime and nonprime dimension) and map the search for nonbinary quantum codes to a corresponding search problem for classical nonbinary codes with specific error patterns. We show that while the additivity properties of nonbinary CWS codes are similar to the binary case, the structural properties of the nonbinary codes differ …
The family of codeword stabilized codes encompasses the stabilizer codes as well as many of the best known nonadditive codes. However, constructing optimal $n$-qubit codeword stabilized codes is made difficult by two main factors. The first of these is the exponential growth with $n$ of the number of graphs on which a code can be based. The second is the NP-hardness of the maximum clique search required to construct a code from a given graph. We address the second of these issues through the use of a heuristic clique finding algorithm. This approach has allowed us to find $((9,97\leq K\leq100,…
Quantifying Nonstabilizerness of Codeword-Stabilized Codes
MIIT Key Laboratory of Complex-field Intelligent Exploration, School of Optics and Photonics, Beijing Institute of Technology（工业和信息化部复杂场智能探测重点实验室，光电学院，北京理工大学）
Codeword stabilized (CWS) codes are, in general, non-additive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical non-linear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less, and employs a separate n-qubit measurement in each test. In this paper, we suggest an error grouping technique that allows to simultaneously test large groups of errors in a single measurement. This structured error recovery technique e…
Symmetry is at the heart of coding theory. Codes with symmetry, especially cyclic codes, play an essential role in both theory and practical applications of classical error-correcting codes. Here we examine symmetry properties for codeword stabilized (CWS) quantum codes, which is the most general framework for constructing quantum error-correcting codes known to date. A CWS code Q can be represented by a self-dual additive code S and a classical code C, i.,e., Q=(S,C), however this representation is in general not unique. We show that for any CWS code Q with certain permutation symmetry, one c…
The quantum states of two laser pulses---coherent states---are never mutually orthogonal, making perfect discrimination impossible. Even so, coherent states can achieve the ultimate quantum limit for capacity of a classical channel, the Holevo capacity. Attaining this requires the receiver to make joint-detection measurements on long codeword blocks, optical implementations of which remain unknown. We report the first experimental demonstration of a joint-detection receiver, demodulating quaternary pulse-position-modulation (PPM) codewords at a word error rate of up to 40% (2.2 dB) below that …
We show that one of the Shor-Laflamme weight enumerators of a codeword stabilized quantum code may be interpreted as the distance enumerator of an associated classical code.
The diamond and completely bounded norms for linear maps play an increasingly important role in quantum information science, providing fundamental stabilized distance measures for differences of quantum operations. Based on the theory of completely bounded maps, we formulate an algorithm to compute the norm of an arbitrary linear map. We present an implementation of the algorithm via Maple, discuss its efficiency, and consider the case of differences of unitary maps.
We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear error-correcting codes for classical asymmetric channels, with which we systematically construct quantum amplitude damping codes with parameters better than any prior construction known for any block length n > 7 except n=2^r-1. We generalize this construction to employ classical codes over GF(3) with which we numerically obtain better performing codes up to len…
We provide a theoretical framework for encoding arbitrary logical states of a quantum bit (qubit) into a continuous-variable quantum mode through quantum walks. Starting with a squeezed-vacuum state of the quantum mode, we show that quantum walks of the state in phase space can generate output states that are variants of codeword states originally put forward by Gottesman, Kitaev, and Preskill (GKP) [Phys. Rev. A {\bf 64}, 012310 (2001)]. In particular, with a coin-toss transformation that projects the quantum coin onto the diagonal coin-state, we show that the resulting {\em dissipative} quan…
Stabilized cat codes can provide a biased noise channel with a set of bias-preserving (BP) gates, which can significantly reduce the resource overhead for fault-tolerant quantum computing. All existing schemes of BP gates, however, require adiabatic quantum evolution, with performance limited by excitation loss and non-adiabatic errors during the adiabatic gates. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors, so that we can implement fast BP gates on Kerr-cat qubits with improved gate fidelity while maintaining high noise bias. When ap…
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code; second, the canonical form of the CWS code is uncovered; third, the input vertices are attached to the graphs. To check the effectiveness of the scheme, we discuss several graphical constructions of various useful stabilizer codes characterized by single and multi-qubit encoding operators. In particular, the error-correcting capabilities of such quantum codes ar…
Quantum optical Fredkin gate is an indispensable resource for networkable quantum applications. Its performance in practical implementations, however, is limited fundamentally by the inherent quantum fluctuations of the pump waves. We demonstrate a method to overcome this drawback by exploiting stimulated Raman scattering in fiber-based implementations. Using a Sagnac fiber-loop switch as a specific example, we show that high switching contrast can be maintained even in the presence of significant pump fluctuations. This unique feature of self-stabilization, together with high-speed and low-lo…
Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on "graph concatenation", where graphs representing the inner and outer codes are concatenated via a simple graph operation called "generalized local complem…
It is known that nonadditive quantum codes are more optimal for error correction when compared to stabilizer codes. The class of codeword stabilized codes (CWS) provides tools to obtain new nonadditive quantum codes by reducing the problem to finding nonlinear classical codes. In this work, we establish some results on the kind of non-Pauli operators that can be used as decoding observables for CWS codes and describe a procedure to obtain these observables.
We propose a systematic procedure for the construction of graphs associated with binary quantum stabilizer codes. The procedure is characterized by means of the following three step process. First, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code. Second, the canonical form of the CWS code is determined and third, the input vertices are attached to the graphs. In order to verify the effectiveness of the procedure, we implement the Gottesman stabilizer code characterized by multi-qubit encoding operators for the resource-efficient error correction of arbitrary single-…
The Gottesman-Kitaev-Preskill (GKP) code was proposed in 2001 by Daniel Gottesman, Alexei Kitaev, and John Preskill as a way to encode a qubit in an oscillator. The GKP codewords are coherent superpositions of periodically displaced squeezed vacuum states. Because of the challenge of merely preparing the codewords, the GKP code was for a long time considered to be impractical. However, the remarkable developments in quantum hardware and control technology in the last two decades has made the GKP code a frontrunner in the race to build practical, fault-tolerant bosonic quantum technology. In th…
Harvard University（哈佛大学）；Harvard Quantum Initiative, Harvard University（哈佛量子倡议，哈佛大学）；Lincoln Laboratory, Massachusetts Institute of Technology（林肯实验室，麻省理工学院）；University of Maryland（马里兰大学）
To achieve scalable quantum computing, improving entangling-gate fidelity and its implementation-efficiency are of utmost importance. We present here a linear method to construct provably power-optimal entangling gates on an arbitrary pair of qubits on a trapped-ion quantum computer. This method leverages simultaneous modulation of amplitude, frequency, and phase of the beams that illuminate the ions and, unlike the state of the art, does not require any search in the parameter space. The linear method is extensible, enabling stabilization against external parameter fluctuations to an arbitrar…
The code capacity threshold for error correction using qubits which exhibit asymmetric or biased noise channels is known to be much higher than with qubits without such structured noise. However, it is unclear how much this improvement persists when realistic circuit level noise is taken into account. This is because implementations of gates which do not commute with the dominant error un-bias the noise channel. In particular, a native bias-preserving controlled-NOT (CX) gate, which is an essential ingredient of stabilizer codes, is not possible in strictly two-level systems. Here we overcome …
We propose an autonomous quantum error correction scheme using squeezed cat (SC) code against the dominant error source, excitation loss, in continuous-variable systems. Through reservoir engineering, we show that a structured dissipation can stabilize a two-component SC while autonomously correcting the errors. The implementation of such dissipation only requires low-order nonlinear couplings among three bosonic modes or between a bosonic mode and a qutrit. While our proposed scheme is device independent, it is readily implementable with current experimental platforms such as superconducting …
The implementation of a combination of continuous weak measurement and classical feedback provides a powerful tool for controlling the evolution of quantum systems. In this work, we investigate the potential of this approach from three perspectives. First, we consider a double-well system in the classical large-atom-number limit, deriving the exact equations of motion in the presence of feedback. Second, we consider the same system in the limit of small atom number, revealing the effect that quantum fluctuations have on the feedback scheme. Finally, we explore the behavior of modest sized Hubb…
The Gottesman-Kitaev-Preskill (GKP) quantum error-correcting code has emerged as a key technique in achieving fault-tolerant quantum computation using photonic systems. Whereas [Baragiola et al., Phys. Rev. Lett. 123, 200502 (2019)] showed that experimentally tractable Gaussian operations combined with preparing a GKP codeword $\lvert 0\rangle$ suffice to implement universal quantum computation, this implementation scheme involves a distillation of a logical magic state $\lvert H\rangle$ of the GKP code, which inevitably imposes a trade-off between implementation cost and fidelity. In contrast…
Approximate quantum error correction theory of non-isometric codes
Shanghai Institute for Mathematics and Interdisciplinary Sciences (SIMIS)（上海数学与交叉学科研究院）；Joint Center for Quantum Information and Computer Science, University of Maryland（马里兰大学量子信息与计算机科学联合中心）；Yau Mathematical Sciences Center, Tsinghua University（清华大学丘成桐数学科学中心）
Photon-mediated coupling between distant matter qubits may enable secure communication over long distances, the implementation of distributed quantum computing schemes, and the exploration of new regimes of many-body quantum dynamics. Nanophotonic devices coupled to solid-state quantum emitters represent a promising approach towards realization of these goals, as they combine strong light-matter interaction and high photon collection efficiencies. However, the scalability of these approaches is limited by the frequency mismatch between solid-state emitters and the instability of their optical …
We describe the design and implementation of a stable high-power 1064 nm laser system to generate optical lattices for experiments with ultracold quantum gases. The system is based on a low-noise laser amplified by an array of four heavily modified, high-power fiber amplifiers. The beam intensity is stabilized and controlled with a nonlinear feedback loop. Using real-time monitoring of the resulting optical lattice, we find the stability of the lattice site positions to be well below the lattice spacing over the course of hours. The position of the harmonic trap produced by the Gaussian envelo…
Noise-stabilized discrete time crystals on digital quantum processors
RIKEN Center for Emergent Matter Science (CEMS)（RIKEN 新兴物质科学中心）；RIKEN Center for Quantum Computing (RQC)（RIKEN 量子计算中心）；RIKEN Center for Computational Science (R-CCS)（RIKEN 计算科学中心）；RIKEN Pioneering Research Institute (PRI)（RIKEN 先驱研究所）
One of the most important properties of quantum information, and the one ultimately responsible for its cryptographic applications, is that it can't be copied. That statement, however, is not completely accurate. While the no-cloning theorem of quantum mechanics prevents quantum information from being copied in space, the reversibility of microscopic physics actually requires that the information be copied in time. In spacetime as a whole, therefore, quantum information is widely replicated but in a restricted fashion. We fully characterize which regions of spacetime can all hold the same quan…
