相关论文: Optimized design of universal two-qubit gates

High-efficiency quantum information processing is equivalent to the fewest quantum resources and the simplest operations by means of logic qubit gates. Based on the reflection geometry of a single photon interacting with a three-level…

We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…

We show an efficient purification protocol in solid-state qubits by replacing the usual bilateral CNOT gate by the bilateral iSWAP gate. We also show that this replacement can be applied to breeding and hashing protocols, which are useful…

We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates…

A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…

CNOT circuits are a common building block of general quantum circuits. The problem of synthesizing and optimizing such circuits has received a lot of attention in the quantum computing literature. This problem is especially challenging for…

The design and architecture of a quantum instruction set are paramount to the performance of a quantum computer. This work introduces a gate scheme for qubits with $XX+YY$ coupling that directly and efficiently realizes any two-qubit gate…

We concretely construct an extension of the controlled-U gate in qudit from some elementary gates. We also construct unitary transformation in two-qudit by means of the extended controlled-U gate and show the universality of it.

We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…

A scalable and programmable quantum computer holds the potential to solve computationally intensive tasks that classical computers cannot accomplish within a reasonable time frame, achieving quantum advantage. However, the vulnerability of…

We present some compact quantum circuits for a deterministic quantum computing on electron-spin qubits assisted by quantum dots inside single-side optical microcavities, including the CNOT, Toffoli, and Fredkin gates. They are constructed…

In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…

The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…

Quantum computers in practice today require strict memory constraints, where 2-qubit operations can only be performed between the qubits closest to each other in a graph structure. So a quantum circuit must undergo a transformation to the…

Current experimental quantum computing devices are limited by noise, mainly originating from entangling gates. If an efficient gate sequence for an operation is unknown, one often employs layered parameterized quantum circuits, especially…

We present a theoretical analysis of the selective darkening method for implementing quantum controlled-NOT (CNOT) gates. This method, which we recently proposed and demonstrated, consists of driving two transversely-coupled quantum bits…

We introduce crosstalk-robust gate sets, which are obtained using a novel, scalable optimal control problem exploiting locality. Through the suppression of pairwise quantum crosstalk, the gate sets enable robustness that extends to…

Current quantum programming is dominated by low-level, circuit-centric approaches that limit the potential for compiler optimization. This work presents how a high-level programming construct provides compilers with the semantic information…

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…

Quantum computers promise to outperform their classical counterparts at certain tasks. However, existing quantum devices are error-prone and restricted in size. Thus, effective compilation methods are crucial to exploit limited quantum…