Related papers: Universal quantum computation with spin-1/2 pairs …
We analyse recently proposed physical implementations of a quantum computer based on polar molecules. A set of general requirements for a molecular system is presented, which would provide an optimal combination of quantum gate times,…
We describe and discuss a solid state proposal for quantum computation with mobile spin qubits in one-dimensional systems, based on recent advances in spintronics. Static electric fields are used to implement a universal set of quantum…
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…
A dipolar gate alternative to the exchange gate based Kane quantum computer is proposed where the qubits are electron spins of shallow group V donors in silicon. Residual exchange coupling is treated as gate error amenable to quantum error…
Qubits encoded in a decoherence-free subsystem and realized in exchange-coupled silicon quantum dots are promising candidates for fault-tolerant quantum computing. Benefits of this approach include excellent coherence, low control…
Quantum computation requires many qubits that can be coherently controlled and coupled to each other. Qubits that are defined using lithographic techniques are often argued to be promising platforms for scalability, since they can be…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…
Heisenberg exchange coupling between neighboring electron spins in semiconductor quantum dots provides a powerful tool for quantum information processing and simulation. Although so far unrealized, extended Heisenberg spin chains can enable…
Systems of interacting quantum spins show a rich spectrum of quantum phases and display interesting many-body dynamics. Computing characteristics of even small systems on conventional computers poses significant challenges. A quantum…
We have developed methods for performing qudit quantum computation in the Jaynes-Cummings model with the qudits residing in a finite subspace of individual harmonic oscillator modes, resonantly coupled to a spin-1/2 system. The first method…
The nonadiabatic holonomic quantum computation based on the geometric phase is robust against the built-in noise and decoherence. In this work, we theoretically propose a scheme to realize nonadiabatic holonomic quantum gates in a surface…
Simple constructions and protocols are demonstrated to allow the implementation of universal quantum computation on an arbitrarily large quantum system by controlling a fixed number of spins, vastly reducing the engineering requirements in…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
It is shown that anisotropic spin chains with gapped bulk excitations and magnetically ordered ground states offer a promising platform for quantum computation, which bridges the conventional single-spin-based qubit concept with recently…
Decoherence in quantum computers is formulated within the Semigroup approach. The error generators are identified with the generators of a Lie algebra. This allows for a comprehensive description which includes as a special case the…
We combine elements of the 1998 quantum computing proposals by Privman, Vagner and Kventsel, and by Kane, with the new idea of nuclear-spin qubit interactions mediated indirectly via the bound outer electrons of impurity atoms whose nuclear…
We show that, for any n > 0, the Heisenberg interaction among 2n qubits (as spin-1/2 particles) can be used to exactly implement an n-qubit parity gate, which is equivalent in constant depth to an n-qubit fanout gate. Either isotropic or…
The ability to perform high-precision one- and two-qubit operations is sufficient for universal quantum computation. For the Loss-DiVincenzo proposal to use single electron spins confned to quantum dots as qubits, it is therefore sufficient…
We present a solid-state implementation of ultrafast conditional quantum gates. Our proposal for a quantum-computing device is based on the spin degrees of freedom of electrons confined in semiconductor quantum dots, thus benefiting from…
Quantum information science has the potential to revolutionize modern technology by providing resource-efficient approaches to computing, communication, and sensing. Although the physical qubits in a realistic quantum device will inevitably…