Related papers: Real 3-qubit gate decompositions via triality
Quantum computers promise to solve certain problems exponentially faster than possible classically but are challenging to build because of their increased susceptibility to errors. Remarkably, however, it is possible to detect and correct…
We experimentally demonstrate a virtual two-qubit gate and characterize it using quantum process tomography~(QPT). The virtual two-qubit gate decomposes an actual two-qubit gate into single-qubit unitary gates and projection gates in…
The advent of quantum computing processors with possibility to scale beyond experimental capacities magnifies the importance of studying their applications. Combinatorial optimization problems can be one of the promising applications of…
Circuit cutting, the decomposition of a quantum circuit into independent partitions, has become a promising avenue towards experiments with larger quantum circuits in the noisy-intermediate scale quantum (NISQ) era. While previous work…
The composite rotation approach has been used to develop a range of robust quantum logic gates, including single qubit gates and two qubit gates, which are resistant to systematic errors in their implementation. Single qubit gates based on…
The quantum circuit synthesis problem bridges quantum algorithm design and quantum hardware implementation in the Noisy Intermediate-Scale Quantum (NISQ) era. In quantum circuit synthesis problems, diagonal unitary synthesis plays a crucial…
Although single and two-qubit gates are sufficient for universal quantum computation, single-shot three-qubit gates greatly simplify quantum error correction schemes and algorithms. We design fast, high-fidelity three-qubit entangling gates…
In this paper we present the complete simulation of the quantum logic CNOT gate in the one-way model, that consists entirely of one-qubit measurements on a particular class of entangled states.
Multi-controlled gates are fundamental components in the design of quantum algorithms, where efficient decompositions of these operators can enhance algorithm performance. The best asymptotic decomposition of an n-controlled X gate with one…
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many…
In this paper, with the weak cross-Kerr nonlinearity, we first present a special experimental scheme called C-path gate with which the realization of all possible bipartite POVMs of two-photon polarization states can be simpler and nearly…
A single physical interaction might not be universal for quantum computation in general. It has been shown, however, that in some cases it can generate universal quantum computation over a subspace. For example, by encoding logical qubits…
While the question ``how many CNOT gates are needed to simulate an arbitrary two-qubit operator'' has been conclusively answered -- three are necessary and sufficient -- previous work on this topic assumes that one wants to simulate a given…
While quantum computing holds great potential in combinatorial optimization, electronic structure calculation, and number theory, the current era of quantum computing is limited by noisy hardware. Many quantum compilation approaches can…
Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of…
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for…
Controlled gates are key components in various quantum algorithms. Improving on the prior work of Gosset et al., we show that, for an allowed error $\varepsilon$, $3\log_2(1/\varepsilon) + o(\log(1/\varepsilon))$ $T$ gates are sufficient to…
High-fidelity multi-qubit gates are a critical resource for near-term quantum computing, as they underpin the execution of both quantum algorithms and fault-tolerant protocols. The Toffoli gate (CCNOT), in particular, plays a central role…
We study the achievements of quantum circuits comprised of several one- and two-qubit gates. Quantum process matrices are determined for the basic one- and two-qubit gate operations and concatenated to yield the process matrix of the…
Universal quantum entangling gates are a crucial building block in the large-scale quantum computation and quantum communication, and it is an important task to find simple ways to implement them. Here an effective quantum circuit for the…