Related papers: Clifford operations and homological codes for roto…
The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of…
We use the Lewis and Riesenfeld invariant method [\textit{J. Math. Phys.} \textbf{10}, 1458 (1969)] and a unitary transformation to obtain the exact Schr\"{o}dinger wave functions for time-dependent harmonic oscillators exhibiting…
We suggest Clifford algebra as a useful simplifying language for present quantum dynamics. Clifford algebras arise from representations of the permutation groups as they arise from representations of the rotation groups. Aggregates using…
Requirements of a conjugate operator are emphasized, especially in its role in uncertainty relations.It is argued that in many contexts it is necessary to extend the Hilbert space in order to define a conjugate operator as in gauge…
It shown that if a vector space carries commuting actions of two Clifford algebras, then the quadratic monomials using generators from either Clifford algebra determine a spinor representation of an orthogonal Lie algebra. Examples of this…
We introduce a new family of quantum circuits for which the scrambling of a subspace of non-local operators is classically simulable. We call these circuits `super-Clifford circuits', since the Heisenberg time evolution of these operators…
We introduce the Umbral calculus into Clifford analysis starting from the abstract of the Heisenberg commutation relation $[\frac{d}{dx}, x] = {\bf id}$. The Umbral Clifford analysis provides an effective framework in continuity and…
The commutative depth model allows gates that commute with each other to be performed in parallel. We show how to compute Clifford operations in constant commutative depth more efficiently than was previously known. Bravyi, Maslov, and Nam…
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
The recent proposal (M Planat and M Kibler, Preprint 0807.3650 [quantph]) of representing Clifford quantum gates in terms of unitary reflections is revisited. In this essay, the geometry of a Clifford group G is expressed as a BN-pair, i.e.…
Non-linearities are a key feature allowing non-classical control of quantum harmonic oscillators. However, when non-linearities are strong, designing protocols for control is often difficult, placing a barrier to exploiting these properties…
We show that the time-resolved dynamics of an underdamped harmonic oscillator can be used to do multifunctional computation, performing distinct computations at distinct times within a single dynamical trajectory. We consider the amplitude…
We translate the action of local Clifford operations on graph states into transformations on their associated graphs - i.e. we provide transformation rules, stated in purely graph theoretical terms, which completely characterize the…
On the basis of the f-deformed oscillator formalism, we propose to construct nonlinear coherent states for Hamiltonian systems having linear and quadratic terms in the the number operator by means of the two following definitions: i) as…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
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…
We construct stabilizer states and error-correcting codes on combinations of discrete- and continuous-variable systems, generalizing the Gottesman-Kitaev-Preskill (GKP) quantum lattice formalism. Our framework absorbs the discrete phase…
An important topic in quantum information is the theory of error correction codes. Practical situations often involve quantum systems with states in an infinite dimensional Hilbert space, for example coherent states. Motivated by these…