Related papers: Optimal two-qubit quantum circuits using exchange …
As the effort to scale up existing quantum hardware proceeds, it becomes necessary to schedule quantum gates in a way that minimizes the number of operations. There are three constraints that have to be satisfied: the order or dependency of…
Key to realising quantum computers is minimising the resources required to build logic gates into useful processing circuits. While the salient features of a quantum computer have been shown in proof-of-principle experiments, difficulties…
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…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…
A quantum algorithm can be decomposed into a sequence consisting of single qubit and 2-qubit entangling gates. To optimize the decomposition and achieve more efficient construction of the quantum circuit, we can replace multiple 2-qubit…
We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. Two low-energy hyperfine states in each of the atoms represent the logical qubit and a Rydberg state acts as an auxiliary state to induce qubit…
We analyze analytically and numerically quantum logic gates in a one-dimensional spin chain with Heisenberg interaction. Analytic solutions for basic one-qubit gates and swap gate are obtained for a quantum computer based on logical qubits.…
We numerically study protocols consisting of repeated applications of two qubit gates used for generating random pure states. A necessary number of steps needed in order to generate states displaying bipartite entanglement typical of random…
Quantum information science addresses how the processing and transmission of information are affected by uniquely quantum mechanical phenomena. Combination of two-qubit gates has been used to realize quantum circuits, however, scalability…
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…
In near-term quantum computing devices, connectivity between qubits remain limited by architectural constraints. A computational circuit with given connectivity requirements necessary for multi-qubit gates have to be embedded within…
The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets…
Full connectivity of qubits is necessary for most quantum algorithms, which is difficult to directly implement on Noisy Intermediate-Scale Quantum processors. However, inserting swap gate to enable the two-qubit gates between uncoupled…
We study the two-qubit controlled-not gate operating on qubits encoded in the spin state of a pair of electrons in a double quantum dot. We assume that the electrons can tunnel between the two quantum dots encoding a single qubit, while…
A spin qubit in semiconductor quantum dots holds promise for quantum information processing for scalability and long coherence time. An important semiconductor qubit system is a double quantum dot trapping two electrons or holes, whose spin…
The number of superconducting qubits contained in a single quantum processor is increasing steadily. However, to realize a truly useful quantum computer, it is inevitable to increase the number of qubits much further by distributing quantum…
In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
Effective quantum information processing is tantamount in part to the minimization the quantum resources needed by quantum logic gates. Here, we propose an optimization of an n-controlled-qubit Fredkin gate with a maximum of 2n+1 two-qubit…
We study the occurrence of errors in a continuously decoupled two-qubit state during a $\sqrt{SWAP}$ quantum operation under decoherence. We consider a realization of this quantum gate based on the Heisenberg exchange interaction, which…