Related papers: Classical simulation of Yang-Baxter gates
Typically, quantum mechanics is thought of as a linear theory with unitary evolution governed by the Schr\"odinger equation. While this is technically true and useful for a physicist, with regards to computation it is an unfortunately…
We develop an approach for constructing the Baxter Q-operators for generic sl(N) spin chains. The key element of our approach is the possibility to represent a solution of the the Yang Baxter equation in the factorized form. We prove that…
Computational methods are an important tool for solving the Yang-Baxter equations(in small dimensions), for classifying (unifying) structures, and for solving related problems. This paper is an account of some of the latest developments on…
One of the features of Baxter's Q-operators for many closed spin chain models is that all transfer matrices arise as products of two Q-operators with shifts in the spectral parameter. In the representation-theoretical approach to…
One of the core research questions in the theory of quantum computing is to find out to what precise extent the classical simulation of a noisy quantum circuits is possible and where potential quantum advantages can set in. In this work, we…
A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
In this note we define geometric classical r-matrices and quantum R-matrices, and show how any geometric classical r-matrix can be quantized to a geometric quantum R-matrix. This is one of the simplest nontrivial examples of quantization of…
Quantum computations that involve only Clifford operations are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
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…
In a recent work arXiv:2201.07655v2 we showed that there is a constant $\lambda >0$ such that it is possible to efficiently classically simulate a quantum system in which (i) qudits are placed on the nodes of a graph, (ii) each qudit…
Many well-known and well-studied four by four universal quantum logic gates in the literature are of a specific form, the so called eight-vertex form \eqref{8vertexform} \cite{kaufman etal 05-1,kaufman etal 05-2}, or {\it similar} to it. We…
We study the classical simulatability of commuting quantum circuits with n input qubits and O(log n) output qubits, where a quantum circuit is classically simulatable if its output probability distribution can be sampled up to an…
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most…
We compute the braided groups and braided matrices $B(R)$ for the solution $R$ of the Yang-Baxter equation associated to the quantum Heisenberg group. We also show that a particular extension of the quantum Heisenberg group is dual to the…
Formulating quantum integrability for nonultralocal models (NM) parallel to the familiar approach of inverse scattering method is a long standing problem. After reviewing our result regarding algebraic structures of ultralocal models, we…
Quantum computing promises exponential improvements in solving large systems of partial differential equations (PDE), which forms a bottleneck in high-resolution computational fluid dynamics (CFD) simulations, in, among others, aerospace…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
In order to examine the simulation of integrable quantum systems using quantum computers, it is crucial to first classify Yang-Baxter operators. Hietarinta was among the first to classify constant Yang-Baxter solutions for a two-dimensional…