Related papers: Realization of permutation groups by quantum circu…
The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum…
A crucial requirement for scalable quantum-information processing is the realization of multiple-qubit quantum gates. Universal multiple-qubit gates can be implemented by a set of universal single qubit gates and any one kind of two-qubit…
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly…
The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the CNOT gate can be realized easily. It can be shown that, e.g., with the XY interaction more than one two-qubit…
We present a universal set of quantum gate operations based on exchange-only spin qubits in a double quantum dot, where each qubit is obtained by three electrons in the (2,1) filling. Gate operations are addressed by modulating…
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales…
CNOT optimization plays a significant role in noise reduction for Quantum Circuits. Several heuristic and exact approaches exist for CNOT optimization. In this paper, we investigate more complicated variations of optimal synthesis by…
Universal gate sets for quantum computation, when single and two qubit operations are accessible, include both Hermitian and non-Hermitian gates. Here we utilize the fact that any single-qubit operator may be implemented as two Hermitian…
A large-scale quantum circuit can be partitioned into multiple subcircuits through circuit cutting, where each subcircuit is executed multiple times and the expectation value of the original circuit is reconstructed by classical…
IBM has made several quantum computers available to researchers around the world via cloud services. Two architectures with five qubits, one with 16, and one with 20 qubits are available to run experiments. The IBM architectures implement…
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…
The Heisenberg exchange interaction is a natural method to implement non-local (i.e., multi-qubit) quantum gates in quantum information processing. We consider quantum circuits comprising of $(SWAP)^\alpha $ gates, which are realized…
Single qubit rotation gate and the controlled-NOT (CNOT) gate constitute a complete set of gates for universal quantum computation. In general the CNOT gate are only for two nearby qubits. For two qubits which are remote from each other, we…
We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…
The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the…
CNOT gates are fundamental to quantum computing, as they facilitate entanglement, a crucial resource for quantum algorithms. Certain classes of quantum circuits are constructed exclusively from CNOT gates. Given their widespread use, it is…
We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the $y$- and $z$-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…
Entangling gates between qubits are a crucial component for performing algorithms in quantum computers. However, any quantum algorithm must ultimately operate on error-protected logical qubits encoded in high-dimensional systems. Typically,…
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…