Related papers: On The Stabilizer Formalism And Its Generalization
Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical $T$ and $T^{-1}$ gates. For example, this could…
In this paper, we give a constructive proof to show that if there exist a classical linear code C is a subset of F_q^n of dimension k and a classical linear code D is a subset of F_q^k^m of dimension s, where q is a power of a prime number…
We employ the machinery of smooth scaling and coarse-graining of observables, developed recently by us in the context of so-called fluctuation operators (inspired by prior work of Verbeure et al) to make a rigorous renormalisation group…
We consider discretizations of the Einstein action of general relativity such that the resulting discrete equations of motion form a consistent constrained system. Upon ``spin foam'' quantization of the system, consistency allows a natural…
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…
In this work, we show that it is possible to define a classical system associated with a Generalized Uncertainty Principle (GUP) theory via the implementation of a consistent symplectic structure. This provides a solid framework for the…
We study general maps from the space of rational CFTs with a fixed chiral algebra and associated Chern-Simons (CS) theories to the space of qudit stabilizer codes with a fixed generalized Pauli group. We consider certain natural constraints…
We present a new method for the quantization of totally constrained systems including general relativity. The method consists in constructing discretized theories that have a well defined and controlled continuum limit. The discrete…
Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all known algorithms at constant rate require exponential time.…
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…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for…
Gibbons et al. [Phys. Rev. A 70, 062101(2004)] have recently defined a class of discrete Wigner functions W to represent quantum states in a Hilbert space with finite dimension. We show that the only pure states having non-negative W for…
A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is $2^\nu$ for a positive integer $\nu$, then one can construct a Calderbank-Shor-Steane (CSS) code, where…
Utilizing a quantum system for reservoir computing has recently received a lot of attention. Key challenges are related to how on can optimally en- and decode classical information, as well as what constitutes a good reservoir. Our main…
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;…
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…
Renormalization group limit cycles may be a commonplace for quantum Hamiltonians requiring renormalization, in contrast to experience to date with classical models of critical points, where fixed points are far more common. We discuss the…
We study single-copy stabilizer learning, the problem of identifying a stabilizer group of dimension $n-t$ from an $n$-qubit quantum state $\rho$. We obtain two complementary results. First, in the average case, logarithmic-depth local…
Non-stabilizerness, alongside entanglement, is a crucial ingredient for fault-tolerant quantum computation and achieving a genuine quantum advantage. Despite recent progress, a complete understanding of the generation and thermalization of…
We study a generic family of Lindblad master equations modeling bipartite open quantum systems, where one tries to stabilize a quantum system by carefully designing its interaction with another, dissipative, quantum system-a strategy known…