Related papers: Universal Parity Quantum Computing
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…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
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…
One of the limitations to the quantum computing capability of a continuous-variable system is determined by our ability to cool it to the ground state, because pure logical states, in which we accurately encode quantum information, are…
We propose a scheme to implement quantum computation in decoherence-free subspace with superconducting devices inside a cavity by unconventional geometric manipulation. Universal single-qubit gates in encoded qubit can be achieved with…
If suitable quantum optical interactions were available, transforming optical field mode operators in a nonlinear fashion, the all-photonics platform could be one of the strongest contenders for realizing a quantum computer. Unlike other,…
Obtaining high-fidelity and robust quantum gates is the key for scalable quantum computation, and one of the promising ways is to implement quantum gates using geometric phases, where the influence of local noises can be greatly reduced. To…
In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states (e.g., the spin-up and down states of an…
Quantum logic gates must perform properly when operating on their standard input basis states, as well as when operating on complex superpositions of these states. Experiments using superconducting qubits have validated the truth table for…
With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…
We investigate an approach to universal quantum computation based on the modulation of longitudinal qubit-oscillator coupling. We show how to realize a controlled-phase gate by simultaneously modulating the longitudinal coupling of two…
To realize fault-tolerant quantum computing, it is necessary to store quantum information in logical qubits with error correction functions, realized by distributing a logical state among multiple physical qubits or by encoding it in the…
We present a simple quantum circuit that allows for the universal and deterministic manipulation of the quantum state of confined harmonic oscillators. The scheme is based on the selective interactions of the referred oscillator with an…
Native multi-qubit parity gates have various potential quantum computing applications, such as entanglement creation, logical state encoding and parity measurement in quantum error correction. Here, using simultaneous cross-resonance drives…
We propose an experimentally feasible scheme to achieve quantum computation based on a pair of orthogonal cyclic states. In this scheme, quantum gates can be implemented based on the total phase accumulated in cyclic evolutions. In…
We will present a few new generalizations of the multi-controlled X (MCX) gate that uses the quantum Fourier transform (QFT). Firstly, we will optimize QFT-MCX and prove that it is equivalent to a stair MCX gates array. This stair-wise…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…
We consider the model of quantum computer, which is represented as a Ising spin lattice, where qubits (spin-half systems) are separated by the isolators (two spin-half systems). In the idle mode or at the single bit operations the total…