Related papers: All You Need is pi: Quantum Computing with Hermiti…
We describe the use of composite rotations to combat systematic errors in single qubit quantum logic gates and discuss three families of composite rotations which can be used to correct off-resonance and pulse length errors. Although…
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…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
We provide a method for compiling approximate multi-controlled single qubit gates into quantum circuits without ancilla qubits. The total number of elementary gates to decompose an n-qubit multi-controlled gate is proportional to 32n, and…
Geometric manipulation of a quantum system offers a method for fast, universal, and robust quantum information processing. Here, we propose a scheme for universal all-geometric quantum computation using non-adiabatic quantum holonomies. We…
High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum…
It is known that a computationally universal gate set $\{H,CCZ\}$ can be transformed to a strictly universal one $\{H, \Lambda(S)\}$ using one maximally imaginary state $|+i \rangle$ and non-imaginary ancillary qubits. We succeed this…
We present a quantum SWAP gate valid for quantum systems of an arbitrary dimension. The gate generalizes the CNOT implementation of the SWAP gate for qubits and keeps its most important properties, like symmetry and simplicity. We only use…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a…
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…
Previous schemes of nonadiabatic holonomic quantum computation were focused mainly on realizing a universal set of elementary gates. Multiqubit controlled gates could be built by decomposing them into a series of the universal gates. In…
A Toffoli gate ($C^{n}$-NOT gate) is regarded as an important unitary gate in quantum computation, and is simulated by a quantum circuit composed of $C^{2}$-NOT gates. This paper presents a quantum circuit with a new configuration of…
For numerous applications of quantum theory it is desirable to be able to apply arbitrary unitary operations on a given quantum system. However, in particular situations only a subset of unitary operations is easily accessible. This raises…
This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit…
This article proposes a formalism which unifies Hamiltonian simulation techniques from different fields. This formalism leads to a competitive method to construct the Hamiltonian simulation with a comprehensible, simple-to-implement circuit…
We propose an all optical quantum computation scheme, with trapped electron spin qubits, using their Coulomb exchange interaction with optically excited microcavity exciton-polaritons. This paper describes a single qubit rotation, which…
Universal quantum gates and quantum error correction~(QEC) lie in the heart of quantum information science. Large-scale quantum computing depends on a universal set of quantum gates, in which some gates may be easily carried out, while…
In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit…