SearcharxivSearch

arXiv · 2204.13787

Nonlinear Addition of Qubit States Using Entangled Quaternionic Powers of Single-Qubit Gates

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Dominic Widdows. 2022-04-28. Nonlinear Addition of Qubit States Using Entangled Quaternionic Powers of Single-Qubit Gates. https://arxiv.org/abs/2204.13787

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph