Nonlinear Addition of Qubit States Using Entangled Quaternionic Powers
of Single-Qubit Gates
- URL: http://arxiv.org/abs/2204.13787v1
- Date: Thu, 28 Apr 2022 21:22:06 GMT
- Title: Nonlinear Addition of Qubit States Using Entangled Quaternionic Powers
of Single-Qubit Gates
- Authors: Dominic Widdows
- Abstract summary: The group of all single-qubit gates is $U(2)$, the unitary transformations of $C2$.
Powers and roots of unit quaternions can be constructed by extending de Moivre's theorem for roots of complex numbers to the quaternions.
An example application for text classification is presented, which uses fractional rotation gates to represent weights.
- Score: 0.15229257192293197
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper presents a novel way to use the algebra of unit quaternions to
express arbitrary roots or fractional powers of single-qubit gates, and to use
such fractional powers as generators for algebras that combine these fractional
input signals, behaving as a kind of nonlinear addition. The method works by
connecting several well-known equivalences. The group of all single-qubit gates
is $U(2)$, the unitary transformations of $C^2$. Using an appropriate phase
multiplier, every element of $U(2)$ can be mapped to a corresponding element of
$SU(2)$ with unit determinant, whose quantum mechanical behavior is identical.
The group $SU(2)$ is isomorphic to the group of unit quaternions. Powers and
roots of unit quaternions can be constructed by extending de Moivre's theorem
for roots of complex numbers to the quaternions by selecting a preferred square
root of -1. Using this chain of equivalences, for any single-qubit gate $A$ and
real exponent $k$, a gate $B$ can be predictably constructed so that $B^k = A$.
Different fractions generated in this way can be combined by connecting the
individually rotated qubits to a common 'sum' qubit using 2-qubit CNOT gates.
Examples of such algebras are explored including those generated by roots of
the quaternion $k$ (which corresponds to and $X$-rotation of the Bloch sphere),
the quaternion $\frac{\sqrt{2}}{2}(i + k)$ (which corresponds to the Hadamard
gate), and a mixture of these. One of the goals of this research is to develop
quantum versions of classical components such as the classifier ensembles and
activation functions used in machine learning and artificial intelligence. An
example application for text classification is presented, which uses fractional
rotation gates to represent classifier weights, and classifies new input by
using CNOT gates to collect the appropriate classifier weights in a
topic-scoring qubit.
Related papers
- Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts.
A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
arXiv Detail & Related papers (2024-10-10T04:07:24Z) - Unitary tetrahedron quantum gates [3.117417023918577]
Quantum simulations of many-body systems using 2-qubit Yang-Baxter gates offer a benchmark for quantum hardware.
This can be extended to the higher dimensional case with $n$-qubit generalisations of Yang-Baxter gates called $n$-simplex operators.
Finding them amounts to identifying unitary solutions of the $n$-simplex equations, the building blocks of higher dimensional integrable systems.
arXiv Detail & Related papers (2024-07-15T13:58:33Z) - Scaling of symmetry-restricted quantum circuits [42.803917477133346]
In this work, we investigate the properties of $mathcalMSU(2N)$, $mathcalM$-invariant subspaces of the special unitary Lie group $SU(2N)$.
arXiv Detail & Related papers (2024-06-14T12:12:15Z) - Block Encodings of Discrete Subgroups on Quantum Computer [23.493000556496376]
We introduce a block encoding method for mapping discrete subgroups to qubits on a quantum computer.
We detail the construction of primitive gates -- the inversion gate, the group multiplication gate, the trace gate, and the group Fourier gate.
The inversion gates for $mathbbBT$ and $mathbbBI$ are benchmarked on the $textttwang$ quantum computer with estimated fidelities of $40+5_-4%$ and $4+5_-3%$ respectively.
arXiv Detail & Related papers (2024-05-21T16:00:04Z) - Architectures and random properties of symplectic quantum circuits [0.0]
Parametrized and random unitary $n$-qubit circuits play a central role in quantum information.
We present a universal set of generators $mathcalG$ for the symplectic algebra $imathfraksp(d/2)$.
We find that the operators in $mathcalG$ cannot generate arbitrary local symplectic unitaries.
We then review the Schur-Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements can converge
arXiv Detail & Related papers (2024-05-16T17:15:39Z) - Primitive Quantum Gates for an $SU(2)$ Discrete Subgroup: Binary
Octahedral [0.0]
We construct a primitive gate set for the digital quantum simulation of the 48-element binary octahedral ($mathbbBO$) group.
This nonabelian discrete group better approximates $SU(2)$ lattice gauge theory than previous work on the binary tetrahedral group.
arXiv Detail & Related papers (2023-12-16T01:46:01Z) - Constant-depth circuits for Uniformly Controlled Gates and Boolean
functions with application to quantum memory circuits [42.979881926959486]
We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates.
We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
arXiv Detail & Related papers (2023-08-16T17:54:56Z) - Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras
from First Principles [55.41644538483948]
We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset.
We use fully connected neural networks to model the transformations symmetry and the corresponding generators.
Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
arXiv Detail & Related papers (2023-01-13T16:25:25Z) - Primitive Quantum Gates for an SU(2) Discrete Subgroup: BT [0.0]
We construct a primitive gate set for the digital quantum simulation of the binary tetrahedral ($mathbbBT$) group on two quantum architectures.
This nonabelian discrete group serves as a crude approximation to $SU(2)$ lattice gauge theory while requiring five qubits or one quicosotetrit per gauge link.
We experimentally benchmark the inversion and trace gates on ibm nairobi, with estimated fidelities between $14-55%$, depending on the input state.
arXiv Detail & Related papers (2022-08-25T19:13:43Z) - Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk.
The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra.
As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
arXiv Detail & Related papers (2022-08-12T15:05:07Z) - Quantum double aspects of surface code models [77.34726150561087]
We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry.
We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
arXiv Detail & Related papers (2021-06-25T17:03:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.