Related papers: Results on two-bit gate design for quantum compute…
I give analytical estimates and numerical simulation results for the performance of Kitaev's 2d topological error-correcting codes. By providing methods for the execution of an encoded three-qubit Toffoli gate, I complete a universal gate…
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…
Loss of every bit in traditional logic circuits involves dissipation of power in the form of heat that evolve to the environment. Reversible logic is one of the alternatives that have capabilities to mitigate this dissipation by preventing…
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\log_2(3)$…
Quantum computation using electron spins in three coupled dot with different size is proposed. By using the energy selectivity of both photon assisted tunneling and spin rotation of electrons, logic gates are realized by static and…
It is well known that most of the frequently used reversible logic gates (e.g., NOT, CNOT, SWAP, Toffoli, Fredkin) are self-inverse and are represented by square matrices that are unitary and Hermitian. However, with a simple minded…
Quantum algorithms are a promising framework for unfolding the causal configurations of multiloop Feynman diagrams, which is equivalent to querying the \textit{directed acyclic graph} (DAG) configurations of undirected graphs in graph…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
Quantum computing using two-dimensional NMR has recently been described using scalar coupling evolution technique [J. Chem. Phys.,109,10603 (1998)]. In the present paper, we describe two-dimensional NMR quantum computing with the help of…
We present an idealized model involving interacting quantum dots that can support both the dynamical and geometrical forms of quantum computation. We show that by employing a structure similar to the one used in the Aharonov-Bohm effect we…
Implementations for quantum computing require fast single- and multi-qubit quantum gate operations. In the case of optically controlled quantum dot qubits theoretical designs for long-range two- or multi-qubit operations satisfying all the…
We estimate and analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation. The cat qubits stabilized by two-photon dissipation exhibit an extremely biased…
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…
We design linear optics multiqubit quantum logic gates. We assume the traditional encoding of a qubit onto state of a single photon in two modes (e.g. spatial or polarization). We suggest schemes allowing direct probabilistic realization of…
A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental two-bit gate for quantum computation. This…
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native…
Quantum++ is a modern general-purpose multi-threaded quantum computing library written in C++11 and composed solely of header files. The library is not restricted to qubit systems or specific quantum information processing tasks, being…
Recently an algorithm has been constructed that shows the binary icosahedral group $\2I$ together with a $T$-like gate forms the most efficient single-qubit universal gate set. To carry out the algorithm fault tolerantly requires a code…
We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…
We experimentally demonstrate the underlying physical mechanism of the recently proposed protocol for superreplication of quantum phase gates [W. D\"ur, P. Sekatski, and M. Skotiniotis, Phys. Rev. Lett. 114, 120503 (2015)], which allows to…