Related papers: Generators and Relations for Real Stabilizer Opera…
We introduce a complete equational theory for the fragment of quantum circuits generated by the real Clifford gates plus the two-qubit controlled-Hadamard gate. That is, we give a simple set of equalities between circuits of this fragment,…
A notion of super operator system is defined which generalizes the usual notion of operator systems to include certain unital involutive operator spaces which cannot be represented completely isometric as a concrete operator system on some…
We study measurement-induced symmetry-protected topological (SPT) order in a wide class of quantum random circuit models by combining calculations within the stabilizer formalism with tensor network simulations. We construct a family of…
Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP…
The Clifford group is the set of gates generated by the CZ gate, and the two local gates: the Hadamard and the Pi/2 phase shift gate. It is known that, for a two qubit system, the Clifford group C2 is a subgroup of order 92160 of the group…
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic…
The one-dimensional Hubbard model is integrable in the sense that it has an infinite family of conserved currents. We explicitly construct a ladder operator which can be used to iteratively generate all of the conserved current operators.…
We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable…
We describe stabilizer states and Clifford group operations using linear operations and quadratic forms over binary vector spaces. We show how the n-qubit Clifford group is isomorphic to a group with an operation that is defined in terms of…
By defining projective error models we study the mathematical structure of Clifford codes and stabilizer codes using tools from projective representation theory. Furthermore, we introduce a new class of codes which we have called weak…
One may obtain, using operator transformations, algebraic relations between the Fourier transforms of the causal propagators of different exactly solvable potentials. These relations are derived for the shape invariant potentials. Also,…
In this work we make use of deformed operators to construct the coherent states of some nonlinear systems by generalization of two definitions: i) As eigenstates of a deformed annihilation operator and ii) by application of a deformed…
We investigate the generation of quantum states and unitary operations that are ``random'' in certain respects. We show how to use such states to estimate the average fidelity, an important measure in the study of implementations of quantum…
Clifford codes are a class of quantum error control codes that form a natural generalization of stabilizer codes. These codes were introduced in 1996 by Knill, but only a single Clifford code was known, which is not already a stabilizer…
Clifford codes can be understood as a generalization of stabilizer codes. To show the existence of a true Clifford code which is better than any stabilizer code is a well known open problem in the theory of Clifford codes. One of the main…
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…
Generalizing the case of the usual harmonic oscillator, we look for Bargmann representations corresponding to deformed harmonic oscillators. Deformed harmonic oscillator algebras are generated by four operators $a, a^\dagger, N$ and the…
We introduce the notion of dismagicker: non-Clifford unitary gate designed to reduce the non-stabilizerness (also called magic) of quantum many-body states. Although both entanglement and non-stabilizerness are fundamental quantum…
We investigate the problem of evaluating the output probabilities of Clifford circuits with nonstabilizer product input states. First, we consider the case when the input state is mixed, and give an efficient classical algorithm to…
Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and…