Related papers: Quantum gates and quantum algorithms with Clifford…
IBM has made several quantum computers available to researchers around the world via cloud services. Two architectures with five qubits, one with 16, and one with 20 qubits are available to run experiments. The IBM architectures implement…
We show that qubit stabilizer states can be represented by non-negative quasi-probability distributions associated with a Wigner-Weyl-Moyal formalism where Clifford gates are positive state-independent maps. This is accomplished by…
Scrambling of quantum information is an important feature at the root of randomization and benchmarking protocols, the onset of quantum chaos, and black-hole physics. Unscrambling this information is possible given perfect knowledge of the…
Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near-term. In this…
Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundamental ones such as emulating quantum chaos and establishing…
Using the Clifford algebra formalism we extend the quantum jumps algorithm of the Event Enhanced Quantum Theory (EEQT) to convex state figures other than those stemming from convex hulls of complex projective spaces that form the basis for…
We report the experimental implementation of Grover's quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of $^{13}$C-labeled CHFBr$_2$, in which the three weakly coupled spin-1/2…
Farinholt gives a characterization of Clifford operators for qudits; d both odd and even. In this comment it is shown that the necessary gates for the construction of Clifford operators; N both odd and even, are obtained directly from…
The transition from a classical to quantum theory is investigated within the context of orthogonal and symplectic Clifford algebras, first for particles, and then for fields. It is shown that the generators of Clifford algebras have the…
We introduce Clifford Group Equivariant Neural Networks: a novel approach for constructing $\mathrm{O}(n)$- and $\mathrm{E}(n)$-equivariant models. We identify and study the $\textit{Clifford group}$, a subgroup inside the Clifford algebra…
The theory of representations of Clifford algebras is extended to employ the division algebra of the octonions or Cayley numbers. In particular, questions that arise from the non-associativity and non-commutativity of this division algebra…
It can be shown that it is possible to find a representation of Hecke algebras within Clifford algebras of multivectors. These Clifford algebras possess a unique gradation and a possibly non-symmetric bilinear form. Hecke algebra…
As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized…
One of the most promising routes towards fault-tolerant quantum computation utilizes topological quantum error correcting codes, such as the $\mathbb{Z}_2$ surface code. Logical qubits can be encoded in a variety of ways in the surface…
In order to realize supersymmetric quantum mechanics methods on a four dimensional classical phase-space, the complexified Clifford algebra of this space is extended by deforming it with the Moyal star-product in composing the components of…
The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…
We give a protocol for the delegation of quantum computation on encrypted data. More specifically, we show that in a client-server scenario, where the client holds the encryption key for an encrypted quantum register held by the server, it…
Equational reasoning is central to quantum circuit optimisation and verification: one replaces subcircuits by provably equivalent ones using a fixed set of rewrite rules viewed as equations. A finite rule set is most informative when it…
We introduce a visual representation of qubits to assist in explaining quantum computing to a broad audience. The representation follows from physical devices that we developed to explain superposition, entanglement, measurement, phases,…
One of the main challenges for quantum computation is that while the number of gates required to perform a non-trivial quantum computation may be very large, decoherence and errors in realistic quantum architectures limit the number of…