Related papers: Simple Pulses for Universal Quantum Computation wi…
Experiments in coherent nuclear and electron magnetic resonance,and quantum computing in general correspond to control of quantum mechanical systems, guiding them from initial to final target states by unitary transformations. The control…
Spins and oscillators are foundational to much of physics and applied sciences. For quantum information, a spin 1/2 exemplifies the most basic unit, a qubit. High angular momentum spins (HAMSs) and harmonic oscillators provide multi-level…
Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…
New physical implementations of quantum computing elementary operations by pulse manipulations with electron spins of paramagnetic ions having two electrons and spin S=1 in a zero magnetic field are proposed. New type of microwave pulses…
Most quantum processors requires pulse sequences for controlling quantum states. Here, we present an alternative algorithm for computing an optimal pulse sequence in order to perform a specific task, being an implementation of a quantum…
We propose a scheme to implement quantum controlled SWAP gates by directing single-photon pulses to a two-sided cavity with a single trapped atom. The resultant gates can be used to realize quantum fingerprinting and universal photonic…
An architecture for a quantum computer is presented in which spins associated with donors in silicon function as qubits. Quantum operations on the spins are performed using a combination of voltages applied to gates adjacent to the spins…
Using electrostatic gates to control the electron positions, we present a new controlled-NOT gate based on quantum dots. The qubit states are chosen to be the spin states of an excess conductor electron in the quantum dot; and the main…
We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction…
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…
As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we…
We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…
What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a 10-local finite-range interaction among qubits on a…
We present a new approach to scalable quantum computing--a ``qubus computer''--which realises qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be ``static'' matter qubits…
We discuss how to simulate simple quantum logic operations with a large number of qubits. These simulations are needed for experimental testing of scalable solid-state quantum computers. Quantum logic for remote qubits is simulated in a…
Universal quantum computation can be achieved by simply performing single-spin measurements on a highly entangled resource state, such as cluster states. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states has recently been explored;…
Kerr parametric oscillators (KPOs) can stabilize the superpositions of coherent states, which can be utilized as qubits, and are promising candidates for realizing hardware-efficient quantum computers. Although elementary gates for…
We show that a wide range of spin clusters with antiferromagnetic intracluster exchange interaction allows one to define a qubit. For these spin cluster qubits, initialization, quantum gate operation, and readout are possible using the same…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…