相关论文: Universal Quantum Gate, Yang--Baxterization and Ha…
We present a criterion that serves as the basis for a polynomial-time algorithm to decide whether a finite set of qudit gates exponentiated by some Hamiltonians is universal. Our approach formulates universality in Lie algebraic terms and…
We introduce non-degenerate solutions of the Yang-Baxter equation in the setting of symmetric monoidal categories. Our theory includes non-degenerate set-theoretical solutions as basic examples. However, infinite families of non-degenerate…
For any algebra two families of coloured Yang-Baxter operators are constructed, thus producing solutions to the two-parameter quantum Yang-Baxter equation. An open problem about a system of functional equations is stated. The matrix forms…
Quantum timeless approaches solve the problem of time by recovering the usual unitary evolution of quantum theory relative to a clock in a stationary quantum Universe. For some Hamiltonians of the Universe, such as those including an…
Quantum doubles of finite group algebras form a class of quasi-triangular Hopf algebras which algebraically solve the Yang--Baxter equation. Each representation of the quantum double then gives a matrix solution of the Yang--Baxter…
We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…
Let $V$ be a braided vector space, that is, a vector space together with a solution $\hat{R}\in {\text{End}}(V\otimes V)$ of the Yang--Baxter equation. Denote $T(V):=\bigoplus_k V^{\otimes k}$. We associate to $\hat{R}$ a solution…
In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2+1 dimensional space-time. In…
We recognize quantum circuit model of computation as factorisable scattering model and propose that a quantum computer is associated with a quantum many-body system solved by the Bethe ansatz. As an typical example to support our…
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary…
These are the extended notes of a mini-course given at the school WinterBraids X. We discuss algebras simultaneously related to: the braid group, the Yang-Baxter equation and the representation theory of quantum groups. The main goal is to…
We develop the quantum inverse scattering method for the one-dimensional Hubbard model on the infinite line at zero density. This enables us to diagonalize the Hamiltonian algebraically. The eigenstates can be classified as scattering…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
Set-theoretic solutions of the Yang--Baxter equation form a meeting-ground of mathematical physics, algebra and combinatorics. Such a solution consists of a set $X$ and a function r:X x X --> X x X which satisfies the braid relation. We…
Solutions of the classical Yang-Baxter equation provide a systematic method to construct integrable quantum systems in an algebraic manner. A Lie algebra can be associated with any solution of the classical Yang--Baxter equation, from which…
Integrable quantum computation is defined as quantum computing via the integrable condition, in which two-qubit gates are either nontrivial unitary solutions of the Yang--Baxter equation or the Swap gate (permutation). To make the…
Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…
We derive an explicit formula for the holonomy $R$-matrix of quantum $\mathfrak{sl}_2$ at a root of unity. We show it factorizes into a product of four quantum dilogarithms and satisfies a holonomy Yang-Baxter equation. This factorization…
Several years ago, it was proposed that the usual solutions of the Yang-Baxter equation associated to Lie groups can be deduced in a systematic way from four-dimensional gauge theory. In the present paper, we extend this picture, fill in…