Related papers: Nonlinear Addition of Qubit States Using Entangled…
We study non-associative twisted group algebras over $(\Z_2)^n$ with cubic twisting functions. We construct a series of algebras that extend the classical algebra of octonions in the same way as the Clifford algebras extend the algebra of…
Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of…
All quantum gates with one and two qubits may be described by elements of $Spin$ groups due to isomorphisms $Spin(3) \simeq SU(2)$ and $Spin(6) \simeq SU(4)$. However, the group of $n$-qubit gates $SU(2^n)$ for $n > 2$ has bigger dimension…
Based on a quantum analysis of two capacitively coupled current-biased Josephson junctions, we propose two fundamental two-qubit quantum logic gates. Each of these gates, when supplemented by single-qubit operations, is sufficient for…
Error mitigation schemes and error-correcting codes have been the center of much effort in quantum information processing research over the last few decades. While most of the successful proposed schemes for error mitigation are…
We study single-qutrit gates composed of Clifford and $T$ gates, using the qutrit version of the $T$ gate proposed by Howard and Vala. We propose a normal form for single-qutrit gates analogous to the Matsumoto-Amano normal form for qubits.…
We develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. A qubit has dependence on a 1-qubit unitary…
We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it…
In this work we present a method of decomposition of arbitrary unitary matrix $U\in\mathbf U(2^k)$ into a product of single-qubit negator and controlled-$\sqrt{\mbox{NOT}}$ gates. Since the product results with negator matrix, which can be…
We show that two electrons confined in a square semiconductor quantum dot have two isolated low-lying energy eigenstates, which have the potential to form the basis of scalable computing elements (qubits). Initialisation, one-qubit and…
Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more…
We study the scaling of the convergence of several statistical properties of a recently introduced random unitary circuit ensemble towards their limits given by the circular unitary ensemble (CUE). Our study includes the full distribution…
The two-qubit controlled-not (C-NOT) gate is an essential component for gate-based quantum circuits. In fact, its operation, combined with single qubit rotations allows to realise any quantum circuit. Several strategies have been adopted in…
The AND gate is not reversible$\unicode{x2014}$on qubits. However, it is reversible on qutrits, making it a building block for efficient simulation of qubit computation using qutrits. We first observe that there are multiple two-qutrit…
We consider a new class of non-Hermitian random matrices, namely the ones which have the form of sums of freely independent terms involving unitary matrices. To deal with them, we exploit the recently developed quaternion technique. After…
Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalization leads to quantum computing with hybrid qudits where two…
Quaternions provide a unified algebraic and geometric framework for representing three-dimensional rotations without the singularities that afflict Euler-angle parametrisations. This article develops a pedagogical and conceptual analysis of…
We use our Clifford algebra technique, that is nilpotents and projectors which are binomials of the Clifford algebra objects $\gamma^a$ with the property $\{\gamma^a,\gamma^b\}_+ = 2 \eta^{ab}$, for representing quantum gates and quantum…
In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…