Related papers: Multi-controlled single-qubit unitary gates based …
Quantum logic decomposition refers to decomposing a given quantum gate to a set of physically implementable gates. An approach has been presented to decompose arbitrary diagonal quantum gates to a set of multiplexed-rotation gates around z…
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a…
The prospect of large-scale quantum computation with an integrated chip of spin qubits is imminent as technology improves. This invites us to think beyond the traditional 2-qubit-gate framework and consider a naturally supported…
Measurement-based quantum computation (MBQC) is a universal platform to realize unitary gates, only using measurements which act on a pre-prepared entangled resource state. By deforming the measurement bases, as well as the geometry of the…
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…
A general scheme is presented to decompose a $d$-by-$d$ unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level…
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of…
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…
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…
Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting…
The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator.…
Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in optimisation and simulation of quantum circuits and the theory of measurement-based quantum computation. In this paper we study phase…
Multi-controlled single-target (MC) gates are some of the most crucial building blocks for varied quantum algorithms. How to implement them optimally is thus a pivotal question. To answer this question in an architecture-independent manner,…
In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible…
We show that it is possible to reduce the number of two-qubit gates needed for the construction of an arbitrary controlled-unitary transformation by up to two times using a tunable controlled-phase gate. On the platform of linear optics,…
Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. In many cases, such qubits are actually made out of multilevel systems but with only two states being used for computational purpose.…
This paper introduces an algorithm designed to approximate quantum transformation matrix with a restricted number of gates by using the block decomposition technique. Addressing challenges posed by numerous gates in handling large qubit…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
Superconducting quantum devices are a leading technology for quantum computation, but they suffer from several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular,…
Recently, significant progress has been made in the demonstration of single qutrit and coupled qutrit gates with superconducting circuits. Coupled qutrit gates have significantly lower fidelity than single qutrit gates, owing to long…