Related papers: Quantum Computing in Arrays Coupled by 'Always On'…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
We suggest using the method of quantum annealing for computing the ground state of the Heisenberg spin chains. Our initial Hamiltonian describes a spin system in a highly non-uniform magnetic field. The initial Hamiltonian gradually…
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…
We show that quantum computation can be performed in a system at thermal equilibrium if a spontaneous symmetry breaking occurs. The computing process is associated to the time evolution of the statistical average of the qubit coherence…
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms can be performed with the help of appropriate radio-frequency pulses. In addition to the standard…
We report on the emergence of a highly non-classical collective behavior in quantum parametric oscillators, which we name quantum hyperspin, induced by a tailored nonlinear interaction. This is the second quantized version of classical…
We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local NOT gates. This methodology is well-known in…
We investigate the non-nearest-neighbor interaction effect in 1-D spin-1/2 chain model. In many previous schemes this long-range coupling is omitted because of its relative weak strength compared with the nearest-neighbor coupling. We show…
Motivated by some recent results of quantum control theory, we discuss the feasibility of local operator control in arrays of interacting qubits modeled as isotropic Heisenberg spin chains. Acting on one of the end spins, we aim at finding…
We show, for the first time, that continuous dynamical decoupling can preserve the coherence of a two-qubit state as it evolves during a SWAP quantum operation. Hence, because the Heisenberg exchange interaction alone can be used for…
Graph structure of quantum spin networks plays an essential role in applying quantum annealing (QA). The Ising model is the typical choice to describe the interactions between the spins in the networks. Here, we explore the interplay of…
Quantum computation is a continuously growing research area which is based on nature and resources of quantum mechanics, as superposition and entanglement. In its quantum circuits version, the use of convenient and appropriate gates is…
Here, we propose a way to control the interaction between qubits with always-on Ising interaction. Unlike the standard method to change the interaction strength with unitary operations, we fully make use of non-unitary properties of…
Controlling long-range quantum correlations is central to quantum computation and simulation. In quantum dot arrays, experiments so far rely on nearest-neighbour couplings only, and inducing long-range correlations requires sequential local…
We show how the quantum Zeno effect can be exploited to control quantum many-body dynamics for quantum information and computation purposes. In particular, we consider a one dimensional array of three level systems interacting via a…
Large quantum simulators, with sufficiently many qubits to be impossible to simulate classically, become hard to experimentally validate. We propose two tests of a quantum simulator with Heisenberg interaction in a linear chain of spins. In…
The primary objective of this paper is to present an exact and general procedure for mapping any sequence of quantum gates onto a network of probabilistic p-bits which can take on one of two values 0 and 1. The first $n$ p-bits represent…
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum…
Quantum-optical techniques allow for generating controllable spin-spin interactions between ions, making trapped ions an ideal quantum simulator of Heisenberg chains. A single parameter, the detuning of the Raman coupling, allows to switch…