Related papers: A SWAP gate for qudits
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…
A novel approach is proposed for realizing an arbitrary-operation gate with a SQUID qubit via pulsed-microwave manipulation. In this approach, the two logical states of the qubit are represented by the two lowest levels of the SQUID and an…
Although the quality of quantum bits (qubits) and quantum gates has been steadily improving, the available quantity of qubits has increased quite slowly. To address this important issue in quantum computing, we have demonstrated arbitrary…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
Rapid development in quantum computing leads to the appearance of several quantum applications. Quantum Fourier Transformation (QFT) sits at the heart of many of these applications. Existing work leverages SAT solver or heuristics to…
Based on a quantum analysis of two capacitively coupled current-biased Josephson junctions, we propose two fundamental two-qubit quantum logic gates. Each of these gates, when supplemented by single-qubit operations, is sufficient for…
Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite…
Quantum computing algorithms using the quantum Fourier transform require repeated use of a phase shift gate. In the case of qubits using optical photons for operation, this gate can be implemented using single-photon beams focused close to…
There are many cases where the interaction between two qubits is not precisely known, but single qubit operations are available. In this paper we show how, regardless of an incomplete knowledge of the strength or form of the interaction…
We propose a set of universal gate operations for the singlet-triplet qubit realized by two electron spins in a double quantum dot, in the presence of a fixed inhomogeneous magnetic field. All gate operations are achieved by switching the…
We theoretically study specific schemes for performing a fundamental two-qubit quantum gate via controlled atomic collisions by switching microscopic potentials. In particular we calculate the fidelity of a gate operation for a…
We propose how to realize a three-step controlled-phase gate of one qubit simultaneously controlling $n$ qubits in a cavity or coupled to a resonator. The $n$ two-qubit controlled-phase gates, forming this multiqubit phase gate, can be…
We propose a new way of implementing several elementary quantum gates for qubits in the coherent state basis. The operations are probabilistic and employ single photon subtractions as the driving force. Our schemes for single-qubit phase…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
Non-Gaussian operations are essential for most bosonic quantum technologies. Yet, realizable non-Gaussian gates are rather limited in type and generally suffer from accuracy-duration trade-offs. In this work, we propose to use quantum…
Recent investigations show that conservation laws limit the accuracy of gate operations in quantum computing. The inevitable error under the angular momentum conservation law has been evaluated so far for the CNOT, Hadamard, and NOT gates…
Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum…
The number of two-qubit gates required to transform deterministically a three-qubit pure quantum state into another is discussed. We show that any state can be prepared from a product state using at most three CNOT gates, and that, starting…
We derive a set of composite pulse sequences that generates CNOT gates and correct all systematic errors within the logical subspace to arbitrary order. These sequences are applicable for any two-qubit interaction Hamiltonian, and make no…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…