Related papers: Unitary tetrahedron quantum gates
An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…
Braid theories are applied to quantum computation processes, where to each crossing in the Braid diagram a unitary Yang-Baxter operator R is associated, representing either a Braiding matrix or a universal quantum gate. By operating with…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
We present a systematic technique to construct solutions to the Yang-Baxter equation which depend not only on a spectral parameter but in addition on further continuous parameters. These extra parameters enter the Yang-Baxter equation in a…
Qutrit (or ternary) structures arise naturally in many quantum systems, particularly in certain non-abelian anyon systems. We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of…
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…
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…
Simple periodic 3d->2d compactification of the tetrahedron equations gives the Yang-Baxter equations for various evaluation representations of U_q(sl_n). In this paper we construct an example of fixed non-periodic 3d boundary conditions…
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
It is known that a solution of the tetrahedron equation generates infinitely many solutions of the Yang-Baxter equation via suitable reductions. In this paper this scheme is applied to an oscillator solution of the tetrahedron equation…
Given a unitary operator in a finite dimensional complex Hilbert space, its unitary reduction to a subspace is defined. The application to quantum graphs is discussed. It is shown how the reduction allows to generate the scattering matrices…
In this paper, we present the experimental realization of multi-qubit gates $% \Lambda_n(not) $ in macroscopic ensemble of three-qubit and four-qubit molecules. Instead of depending heavily on the two-bit universal gate, which served as the…
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native…
The tetrahedron equation is a three-dimensional generalization of the Yang-Baxter equation. Its solutions define integrable three-dimensional lattice models of statistical mechanics and quantum field theory. Their integrability is not…
Any solution to the Yang-Baxter equation yields a family of representations of braid groups. Under certain conditions, identified by Turaev, the appropriately normalized trace of these representations yields a link invariant. Any…
We propose a new method for the computation of quantum three-point functions for operators in su(2) sectors of N=4 super Yang-Mills theory. The method is based on the existence of a unitary transformation relating inhomogeneous and…
Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
We derive a family of solutions to the tetrahedron equation using the RTT presentation of a two parametric quantized algebra of regular functions on an upper triangular subgroup of GL(n). The key ingredients of the construction are the…