Related papers: Realization of p_valued Deutsch quantum gates
The basic one-bit gates (X, Y, Z, Hadamard, phase, pi/8) as well as the controlled cnot and Toffoli gates are reformulated in the language of geometric-algebra quantum-like computation. Thus, all the quantum algorithms can be reformulated…
The AND gate is not reversible$\unicode{x2014}$on qubits. However, it is reversible on qutrits, making it a building block for efficient simulation of qubit computation using qutrits. We first observe that there are multiple two-qutrit…
We consider bosonic condensates of exciton-polaritons optically confined in elliptical traps. A superposition of two non-degenerated \textit{p}-type states of the condensate oriented along the two main axes of the trap is represented by a…
Most modern classical processors support so-called von Neumann architecture with program and data registers. In present work is revisited similar approach to models of quantum processors. Deterministic programmable quantum gate arrays are…
Domain walls are the topological defects that mediate polarization reversal in ferroelectrics, and they may exhibit quite different geometric and electronic structures compared to the bulk. Therefore, a detailed atomic-scale understanding…
We propose a continuous variable analog of quantum controlled-NOT gates based on a system of exciton-polaritons in semiconductor microcavities. This can be realized by the engineering of parametric interaction between control and target…
In this paper initial experiments towards constructing simple quantum gates in a solid state material are presented. Instead of using specially tailored materials, the aim is to select a subset of randomly distributed ions in the material,…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…
There are several known schemes for entangling trapped ion quantum bits for large-scale quantum computation. Most are based on an interaction between the ions and external optical fields, coupling internal qubit states of trapped-ions to…
We explore the implementation of hybridly protected quantum operations combining the merits of holonomy, dynamical decoupling approach and dephasing-free feature based on a simple and experimentally achievable spin model. The implementation…
With quantum computing devices increasing in scale and complexity, there is a growing need for tools that obtain precise diagnostic information about quantum operations. However, current quantum devices are only capable of short…
Quantum computing has garnered significant interest for its potential to solve certain computational problems much faster than the best-known classical algorithms. A fully functional and scalable quantum computer could transform various…
We propose deterministic realizations of nonlinear phase gates by repeating non-commuting Rabi interactions feasible between a harmonic oscillator and {\em only} a single two-level ancillary qubit. We show explicitly that the key…
The question of finding a lower bound on the number of Toffoli gates in a classical reversible circuit is addressed. A method based on quantum information concepts is proposed. The method involves solely concepts from quantum information -…
In this paper, we settle the long-standing open problem of the minimum cost of two-qubit gates for simulating a Toffoli gate. More precisely, we show that five two-qubit gates are necessary. Before our work, it is known that five gates are…
Pseudorandom circuits generate quantum states and unitary operators which are approximately distributed according to the unitarily invariant Haar measure. We explore how several design parameters affect the efficiency of pseudo-random…
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm…
We present an n-bit Toffoli gate quantum circuit based on the realization proposed by Barenco, where some of the Toffoli gates in their construction are replaced with Peres gates. This results in a significant cost reduction. Our main…
A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer…
Since the first demonstration of coherent control of a quantum state of a superconducting charge qubit a variety of Josephson-junction-based qubits have been implemented with remarkable progress in coherence time and read-out schemes.…