A scheme of universal quantum computation is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are translation invariant.
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme to remove the necessity of switching the couplings between qubits for two bit gates, which are more costly in many cases. Our strategy is to compute with encoded qubits in and out of carefully designed interaction free subspaces analogous to decoherence free subspaces. We give two examples to show how universal quantum computation is realized in our scheme with local manipulations to physical qubits only, for both diagonal and off diagonal interactions.
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally applied transformations. Here we demonstrate the minimum physical requirements for such an approach: a one-dimensional array composed of two alternating ``types'' of two-state system. Each system need be sensitive only to the net state of its nearest neighbors, i.e. the number in state $``\ensuremath{\uparrow}''$ minus the number in $``\ensuremath{\downarrow}.''$ Additionally, we show that all such arrays can perform quite general parallel operations. A broad range of physical systems and interactions is suitable: we highlight two examples.
We present a scheme to perform universal quantum computation using global control with an arbitrary subsystem dimension (not necessarily finite). The scheme is developed over a one spatial dimension N-element array, using only mirror-symmetric logical encoding, global pulses for single subsystem operations, uniform Ising-type interaction, and an all zero initial pure state. A mechanism using ancillary degrees of freedom for subsystem specific measurement is also presented.
We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is required to the computational register and the dynamics of both the register and ancilla are unitary. This scheme is inspired by the measurement-based ancilla-driven quantum computation of Anders et al. [PRA 82, 020301(R), 2010], but does not require measurements of the ancillas, and in this respect is similar to the original gate based model of quantum computation. We consider what possible forms this ancilla-register interaction can take, with a proof that the interaction is necessarily locally equivalent to SWAP combined with an entangling controlled gate. We further show which Hamiltonians can create such interactions and discuss two examples; the two-qubit XY Hamiltonian and a particular case of the XXZ Hamiltonian. We then give an example of a simple, finite and fault tolerant gate set for universal quantum computation in this model.
Recently, fault tolerant quantum computation such as surface coding and topological quantum computation has been paid attention to due to high threshold against computational errors compared with that of conventional gate-model quantum computation.These schemes use a two or three-dimensional cluster state as universal resources for quantum computation.We can generate a cluster state by performing controlled-phase gates on an initial state prepared in |+⟩ state, where the control-phase gates are realized by nearest neighbor Ising type interactions.There are many proposal to realize Ising type interaction such as ultracold atoms in an optical lattice, superconducting charge qubits, superconducting spin qubits, resonator wave guides, nitrogen-vacancy centers, and quantum dots.Among many candidates, we especially discuss superconducting flux qubits.Superconducting flux qubits have a strong anharmonicity, so that we can perform high-speed single-qubit rotation with excellent fidelity.Usually, implementation of high-fidelity two-qubit gates is the hardest part for the realization of quantum computation.Two qubit gates require in-situ turn on/off the interaction between qubits by the external control apparatus.Since imperfection of the interaction control tends to induce spatially correlated errors between qubits, sophisticated technology is required to suppress such error rate below the threshold of fault tolerant quantum computation.Up to now, the generation of a large cluster state using solid-state qubit has not been demonstrated in a scalable manner yet.One of the main obstacles is the requirement for independent control of two-qubit gates that are necessary for the scalable quantum information processing.For a superconducting flux qubit, existing method uses applied magnetic field to control the interaction.It is known that the application of magnetic field to local area is difficult.Thus, it is hard to implement local control of the interaction without cross-talk problem where unwanted errors occurs between qubits.Firstly, we propose a novel way to control a number of two-qubit gates independently without using the on/off switching of locally applied magnetic field.Specifically, we assume the superconducting flux qubits that are inductively coupled with each other via always-on Ising interaction.Unlike the previous method to change the interaction strength with unitary operations, we fully make use of non-unitary properties of projective measurements so that we can effectively turn on/off the interaction via quantum feedforward.Also, we show how to generate a two or three-dimensional cluster state that are universal resource for fault tolerant quantum computation with constant stepsize operations.The on/off switching of locally applied magnetic field is not necessary to First of all, I would like to thank my adviser Professor Hiroshi Imai for his valuable comments and continuous support during the last five years.