相关论文: New Structural Quantum Circuit Simulating a Toffol…

Unitary quantum gates constitute the building blocks of Quantum Computing in the circuit paradigm. In this work, we engineer a locally driven two-qubit Hamiltonian whose instantaneous ground-state dynamics generates the controlled-NOT…

We present a novel Clifford+T decomposition of a Toffoli gate. Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits. This decomposition enables shallower, more fault-tolerant quantum…

What is the time-optimal way of realizing quantum operations? Here, we show how important instances of this problem can be related to the study of shortest paths on the surface of a sphere under a special metric. Specifically, we provide an…

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…

Quantum circuit network is a set of circuits that implements a certain computation task. Being at the center of the quantum circuit network, the multi-qubit controlled phase shift is one of the most important quantum gates. In this paper,…

An investigation of an optimal universal unitary Controlled-NOT gate that performs a specific operation on two unknown states of qubits taken from a great circle of the Bloch sphere is presented. The deep analogy between the optimal…

We consider the implementation of two-qubit unitary transformations by means of CNOT gates and single-qubit unitary gates. We show, by means of an explicit quantum circuit, that together with local gates three CNOT gates are necessary and…

We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…

The problem of finding efficient decompositions of multi-qubit gates is of importance for quantum computing, especially, in application to existing noisy intermediate-scale quantum devices, whose resources are substantially limited. Here we…

We show that a superconducting circuit containing two loops, when treated with Macroscopic Quantum Coherence (MQC) theory, constitutes a complete two-bit quantum computer. The manipulation of the system is easily implemented with…

Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One 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,…

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…

This paper presents a method for constructing quantum circuits for schoolbook multiplication using controlled add-subtract circuits, asymptotically halving the Toffoli count compared to traditional controlled-adder-based constructions.…

Spin qubits in semiconductor quantum dots are a promising platform for quantum computing, however scaling to large systems is hampered by crosstalk and charge noise. Crosstalk here refers to the unwanted off-resonant rotation of idle qubits…

Quantum circuit model is the most popular paradigm for implementing complex quantum computation. Based on Cartan decomposition, we show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and…

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…

Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any…

In this paper, we settle the long-standing open problem of the minimum cost of two-qubit gates for simulating a Toffoli gate. More precisely, we show that five two-qubit gates are necessary. Before our work, it is known that five gates are…

We present quantum circuits for comparison and increment operations that achieve an asymptotically optimal gate count of $\Theta(n)$ and depth of $\Theta(\log n)$ over the Clifford+Toffoli gate set, while using a provably minimal number of…