Related papers: Optimizing Gate Decomposition for High-Level Quant…
Quantum information is very fragile to environmentally and operationally induced imperfections. Therefore, the construction of practical quantum computers requires quantum error-correction techniques to protect quantum information. In…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…
Quantum circuit transformation (QCT), necessary for adapting any quantum circuit to the qubit connectivity constraints of the NISQ device, often introduces numerous additional SWAP gates into the original circuit, increasing the circuit…
We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed…
In this paper, we propose a scheme to realize three-qubit controlled phase gate and multiqubit controlled-NOT gate of one qubit simultaneously controlling n target qubit with four level quantum system in a cavity. Adjustment of level…
The simplest decomposition of a Toffoli gate acting on three qubits requires {\em five} 2-qubit gates. If we restrict ourselves to controlled-sign (or controlled-NOT) gates this number climbs to six. We show that the number of…
We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of…
Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate…
Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. In…
In this paper we apply the canonical decomposition of two qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the CNOT, swap, square root of swap and controlled Z…
We develop a systematic method of performing corrected gate operations on an array of exchange-coupled singlet-triplet qubits in the presence of both fluctuating nuclear Overhauser field gradients and charge noise. The single-qubit control…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
Optical qubits uniquely combine information transfer in optical fibers with a good processing capability and are therefore attractive tools for quantum technologies. A large challenge, however, is to overcome the low efficiency of two-qubit…
The three-input TOFFOLI gate is the workhorse of circuit synthesis for classical logic operations on quantum data, e.g., reversible arithmetic circuits. In physical implementations, however, TOFFOLI gates are decomposed into six CNOT gates…
Quantum computation with $d$-level quantum systems, also known as qudits, benefits from the possibility to use a richer computational space compared to qubits. However, for an arbitrary qudit-based hardware platform, the issue is that a…
Controlled operations are fundamental building blocks of quantum algorithms. Decomposing $n$-control-NOT gates ($C^n(X)$) into arbitrary single-qubit and CNOT gates, is a crucial but non-trivial task. This study introduces $C^n(X)$ circuits…
This paper presents a highly efficient decomposition scheme and its associated Mathematica notebook for the analysis of complicated quantum circuits comprised of single/multiple qubit and qudit quantum gates. In particular, this scheme…
In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled…
In the era of noisy intermediate-scale quantum (NISQ), executing quantum algorithms on actual quantum devices faces unique challenges. One such challenge is that quantum devices in this era have restricted connectivity: quantum gates are…
Translating a general quantum circuit on a specific hardware topology with a reduced set of available gates, also known as transpilation, comes with a substantial increase in the length of the equivalent circuit. Due to decoherence, the…