Related papers: Unitary tetrahedron quantum gates
A method of constructing Temperley-Lieb algebras(TLA) representations has been introduced in [Xue \emph{et.al} arXiv:0903.3711]. Using this method, we can obtain another series of $n^{2}\times n^{2}$ matrices $U$ which satisfy the TLA with…
The controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a…
We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity.…
In the framework of quantum groups and additive R-matrices, the fusion procedure allows to construct higher-dimensional solutions of the Yang-Baxter equation. These solutions lead to integrable one-dimensional spin-chain Hamiltonians. Here…
One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose…
Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…
We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…
The quantum Yang-Baxter equation admits generalisations to systems of Yang-Baxter type equations called Yang-Baxter systems. Starting from algebra structures, we propose new constructions of some constant as well as the spectral-parameter…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
We construct quantum circuits for measuring the commuting set of vertex and plaquette operators that appear in the Levin-Wen model for doubled Fibonacci anyons. Such measurements can be viewed as syndrome measurements for the quantum…
According to Shibukawa, ternary systems defined on quasigroups and satisfying certain conditions provide a way of constructing dynamical Yang-Baxter maps. After noticing that these conditions can be interpreted as 3-dimensional…
Quivers over a fixed base set form a monoidal category with tensor product given by pullback. The quantum Yang-Baxter equation, or more properly the braid equation, is investigated in this setting. A solution of the braid equation in this…
The (G, \theta)-Lie algebras are structures which unify the Lie algebras and Lie superalgebras. We use them to produce solutions for the quantum Yang-Baxter equation. The constant and the spectral-parameter Yang-Baxter equations and…
We study geometric consistency relations between angles of 3-dimensional (3D) circular quadrilateral lattices -- lattices whose faces are planar quadrilaterals inscribable into a circle. We show that these relations generate canonical…
For universal quantum computation, a major challenge to overcome for practical implementation is the large amount of resources required for fault-tolerant quantum information processing. An important aspect is implementing arbitrary unitary…
This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a…
In this article, we study unitary rational solutions of the associative Yang-Baxter equation with three spectral parameters. We explain how such solutions arise from the geometry of vector bundles on a cuspidal cubic curve. Moreover, we…
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named…
Superconducting quantum devices are a leading technology for quantum computation, but they suffer from several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular,…
Quantum operations on pure states can be fully represented by unitary matrices. Variational quantum circuits, also known as quantum neural networks, embed data and trainable parameters into gate-based operations and optimize the parameters…