Related papers: Geometric representations of braid and Yang-Baxter…
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,…
A decision diagram (DD) is a graph-like data structure for homomorphic compression of Boolean and pseudo-Boolean functions. Over the past decades, decision diagrams have been successfully applied to verification, linear algebra, stochastic…
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…
An operator deformed quantum algebra is discovered exploiting the quantum Yang-Baxter equation with trigonometric R-matrix. This novel Hopf algebra along with its $q \to 1$ limit appear to be the most general Yang-Baxter algebra underlying…
Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting…
Birational Yang-Baxter maps (`set-theoretical solutions of the Yang-Baxter equation') are considered. A birational map $(x,y)\mapsto(u,v)$ is called quadrirational, if its graph is also a graph of a birational map $(x,v)\mapsto(u,y)$. We…
We extend our recent work on set-theoretic solutions of the Yang-Baxter or braid relations with new results about their automorphism groups, strong twisted unions of solutions and multipermutation solutions. We introduce and study graphs of…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation…
This work is based on the author's PhD thesis. The main result of the thesis is the use of the boost operator to develop a systematic method to construct new integrable spin chains with nearest-neighbour interaction and characterized by an…
$\mathbb{Z}_d$ Parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case $d=2$. In contrast to Majorana fermions, braiding of parafermions with $d>2$ allows to perform an entangling…
The relationships between quantum entangled states and braid matrices have been well studied in recent years. However, most of the results are based on qubits. In this paper, We investigate the applications of 2-qutrit entanglement in the…
We present a systematic procedure to obtain singular solutions of the constant quantum Yang-Baxter equation in arbitrary dimension. This approach, inspired in the Lie (super)algebra structure, is explicitly applied to the particular case of…
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…
In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some…
We connect properties of set-theoretic solutions to the Yang--Baxter equation to properties of their permutation skew brace. In particular, a variation of the multipermutation level of a solution is presented and we show that it coincides…
Quantum computing is currently limited by the cost of two-qubit entangling operations. In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make…
Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory…
A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily implemented on many fault-tolerant architectures. For qutrits, there is an equivalent T gate, that, like its qubit analogue, makes…
We propose several methods for optimizing the number of qubits in a quantum circuit while preserving the number of non-Clifford gates. One of our approaches consists in reversing, as much as possible, the gadgetization of Hadamard gates,…
The Tracy-Singh product of matrices permits to construct a new gate $c \boxtimes c'$ from two $2$-qudit gates $c$ and $c'$. If $c$ and $c'$ are both Yang-Baxter gates, then $c \boxtimes c'$ is also a Yang-Baxter gate, and if at least one of…