相关论文: Efficient Circuits for Exact-Universal Computation…

We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of Controlled-NOT (C-NOT) gates required (single-qubit gates are free). We consider three…

We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be…

Capacitively coupled semiconductor spin qubits hold promise as the building blocks of a scalable quantum computing architecture with long-range coupling between distant qubits. However, the two-qubit gate fidelities achieved in experiments…

We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as Controlled-Square-Root-of-Not (i.e. Controlled-V). Our approach reduces the synthesis problem to multiple-valued optimization and…

Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit…

Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum…

We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…

This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…

A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…

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…

Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…

As a qubit is a two-level quantum system whose state space is spanned by |0>, |1>, so a qudit is a d-level quantum system whose state space is spanned by |0>,...,|d-1>. Quantum computation has stimulated much recent interest in algorithms…

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…

Quantum circuit synthesis describes the process of converting arbitrary unitary operations into a gate sequence of a fixed universal gate set, usually defined by the operations native to a given hardware platform. Most current synthesis…

A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…

We discuss the characteristics of special perfect entanglers and construct single parameter two-qubit circuits which are locally equivalent to special perfect entanglers. We present the results obtained from the implementation of one of the…

Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…

The primary objective of quantum circuit synthesis is to efficiently and accurately realize specific quantum algorithms or operations utilizing a predefined set of quantum gates, while also optimizing the circuit size. It holds a pivotal…

Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity,…

Recently, the development of quantum chips has made great progress-- the number of qubits is increasing and the fidelity is getting higher. However, qubits of these chips are not always fully connected, which sets additional barriers for…