I describe the use of techniques based on composite rotations to combat systematic errors in controlled phase gates, which form the basis of two qubit quantum logic gates. Although developed and described within the context of Nuclear Magnetic Resonanace (NMR) quantum computing these sequences should be applicable to any implementation of quantum computation based on Ising couplings. In combination with existing single qubit gates this provides a universal set of robust quantum logic gates.
I describe the use of techniques based on composite rotations to develop controlled phase gates in which the effects of weak Ising couplings are suppressed. A tailored composite phase gate is described which both suppresses weak couplings and is relatively insensitive to systematic errors in the size of strong couplings.
The physical implementation of the quantum Control-Not gate for a two-spin system is investigated numerically. The concept of a generalized quantum Control-Not gate, with arbitrary phase shift, is introduced. It is shown that a resonant $π$-pulse provides a simple example of a generalized quantum Control-Not gate.
We exactly construct one- and two-qubit holonomic quantum gates in terms of isospectral deformations of an Ising model Hamiltonian. A single logical qubit is constructed out of two spin-1/2 particles; the qubit is a dimer. We find that the holonomic gates obtained are discrete but dense in the unitary group. Therefore an approximate gate for a desired one can be constructed with arbitrary accuracy.
We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number (N=3) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust SWAP gate cannot be constructed with N=3, but requires N=6 elementary two-qubit gates.
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating classical computer gates. As for optical as well as magnetic systems, those gates are obtained as quantum evolutions. Despite, in certain cases they are attained as an asymptotic series of evolution effects. The current work exploits the direct sum of the evolution operator on a non-local basis for the driven bipartite Heisenberg-Ising model to construct a set o…
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising interaction between the neighboring spins. The selective excitations of the spins are provided by the gradient of the external magnetic field. The protocols are built of rectangular radio-frequency pulses. The phase and probability errors caused by unwanted transitions are minimized and computed numerically.
Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but rather to develop an efficient compilation algorithm that can be easily implemented in large spin systems. The key observation is that it is not always necessary to refocus all the undesired couplings in a spin system. Instead the coupling evolution can simply be tracked and then corrected at some later time. Although described within the language of NMR the alg…
We consider the model of quantum computer, which is represented as a Ising spin lattice, where qubits (spin-half systems) are separated by the isolators (two spin-half systems). In the idle mode or at the single bit operations the total spin of isolators is 0. There are no need of complicated protocols for correcting the phase and probability errors due to permanent interaction between the qubits. We present protocols for implementation of universal quantum gates with the rectangular radio-frequency pulses.
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 essential. But while those gates adopt convenient forms for computational algorithms, their design depends on specific quantum systems and stu? being used. These gates need manage quantum systems based on physical interactions ruled by quantum Hamiltonians. With this, gates design is restricted to properties and limitations of interactions and physical elements …
It is imperative to compile quantum circuits for Noisy Intermediate-Scale Quantum (NISQ) devices because of the limited connectivity of physical qubits and the high error rates of gate operations. One of the most critical steps in quantum circuit compilation is qubit routing, an NP-Hard problem that involves placing and moving logical qubits to minimize compilation overhead. In this study, we propose ISing mAchine Assisted Quantum compiler (ISAAQ) to perform qubit routing with Ising machines, which can efficiently solve Quadratic Unconstrained Binary Optimization (QUBO) problems. ISAAQ accurat…
We analytically determine the minimal time and the optimal control laws required for the realization, up to an assigned fidelity and with a fixed energy available, of entangling quantum gates ($\mathrm{CNOT}$) between indirectly coupled qubits of a trilinear Ising chain. The control is coherent and open loop, and it is represented by a local and continuous magnetic field acting on the intermediate qubit. The time cost of this local quantum operation is not restricted to be zero. When the matching with the target gate is perfect (fidelity equal to one) we provide exact solutions for the case of…
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n \geq 3 qubits we prove that the the image of the braid group is a non-trivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We als…
Ising-type non-Abelian anyons are likely to occur in a number of physical systems, including quantum Hall systems, where recent experiments support their existence. In general, non-Abelian anyons may be utilized to provide a topologically error-protected medium for quantum information processing. However, the topologically protected operations that may be obtained by braiding and measuring topological charge of Ising anyons are precisely the Clifford gates, which are not computationally universal. The Clifford gate set can be made universal by supplementing it with single-qubit pi/8-phase gate…
We propose a Lyapunov control design to achieve specific (or a family of) unitary time-evolution operators, i.e., quantum gates in the Schrödinger picture by tracking control. Two examples are presented. In the first, we illustrate how to realize the Hadamard gate in a single-qubit system, while in the second, the controlled-NOT (CNOT) gate is implemented in two-qubit systems with the Ising and Heisenberg interactions. Furthermore, we demonstrate that the control can drive the time-evolution operator into the local equivalence class of the CNOT gate and the operator keeps in this class forever…
We propose a simplified mathematical construction of the quantum Fourier transform which is suited for systems described by Ising-type Hamiltonians. By contrast to the standard Cooley-Tuckey scheme, which prescribes sequences of CPHASE gates, our implementation is based on one-qubit gates and a free evolution process. We also show how to obtain a quadratic speed-up by applying the conditional interactions simultaneously. Thus rather than O($N^2$) our implementation time scales as O($N$). Finally, we show a realization of our method with homogeneous microwave driven ion traps in a magnetic fiel…
Recent proposals using heterostructures of superconducting and either topologically insulating or semiconducting layers have been put forth as possible platforms for topological quantum computation. These systems are predicted to contain Ising anyons and share the feature of having only neutral edge excitations. In this note, we show that these proposals can be combined with the recently proposed "sack geometry" for implementation of a phase gate in order to conduct robust universal quantum computation. In addition, we propose a general method for adjusting edge tunneling rates in such systems…
Conditional multi-qubit gates are a key component for elaborate quantum algorithms. In a recent work, Rasmussen et al. (Phys. Rev. A 101, 022308) proposed an efficient single-step method for a prototypical multi-qubit gate, a Toffoli gate, based on a combination of Ising interactions between control qubits and an appropriate driving field on a target qubit. Trapped ions are a natural platform to implement this method, since Ising interactions mediated by phonons have been demonstrated in increasingly large ion crystals. However, the simultaneous application of these interactions and the drivin…
The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising-spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features: (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitu…
One of the major problems of most quantum computing applications is that the required number of qubits to solve a practical problem is much larger than that of today's quantum hardware. We propose an algorithm, called large-system sampling approximation (LSSA), to solve Ising problems with sizes up to $N_{\rm{gb}}2^{N_{\rm{gb}}}$ by an $N_{\rm{gb}}$-qubit gate-based quantum computer, and with sizes up to $N_{\rm{an}}2^{N_{\rm{gb}}}$ by a hybrid computational architecture of an $N_{\rm{an}}$-qubit quantum annealer and an $N_{\rm{gb}}$-qubit gate-based quantum computer. By dividing the full-syst…
We describe how a universal set of dynamically-corrected quantum gates can be implemented using sequences of shaped decoupling pulses on any qubit network forming a sparse bipartite graph with always-on Ising interactions. These interactions are constantly decoupled except when they are needed for two-qubit gates. We analytically study the error operators associated with the constructed gates up to third order in the Magnus expansion, analyze these errors numerically in the unitary time evolution of small qubit clusters, and give a bound on high-order errors for qubits on a large square lattic…
The ferromagnetic state of an Ising chain can represent a two-fold degenerate subspace or equivalently a logical qubit which is protected from excitations by an energy gap. We study a a braiding-like exchange operation through the movement of the state in the qubit subspace which resembles that of the localized edge modes in a Kitaev chain. The system consists of two Ising chains in a 1D geometry where the operation is simulated through the adiabatic time evolution of the ground state. The time evolution is implemented via the Suzuki-Trotter expansion on basic single- and two-qubit quantum gat…
What is the time-optimal way of realizing quantum operations? Here, we show how important instances of this problem can be related to the study of shortest paths on the surface of a sphere under a special metric. Specifically, we provide an efficient synthesis of a controlled NOT (CNOT) gate between qubits coupled indirectly via Ising-type couplings to a third spin. Our implementation of the CNOT gate is more than twice as fast as conventional approaches. The pulse sequences for efficient manipulation of our coupled spin system are obtained by explicit computation of geodesics on a sphere unde…
We formulate binary optimization functions for single-vehicle routing, travelling salesperson and collision-free multi-vehicle routing with significant improvements in the number of variables over existing formulations. The provided functions are readily implemented on gate-based quantum computers using variational algorithms and on adiabatic quantum hardware.
Optimally mapping a parallel application to compute and communication resources is increasingly important as both system size and heterogeneity increase. A similar mapping problem exists in gate-based quantum computing where the objective is to map tasks to gates in a topology-aware fashion. This is an NP-complete graph isomorphism problem, and existing task assignment approaches are either heuristic or based on physical optimization algorithms, providing different speed and solution quality trade-offs. Ising machines such as quantum and digital annealers have recently become available and off…
An approach to the construction of the CNOT quantum logic gate for a 4-dimensional coupled-qubit model with weak but otherwise arbitrary coupling has been given recently [M. R. Geller et al., Phys. Rev. A, 012320 (2010)]. How does the resulting fidelity depend on the form of qubit-qubit coupling? In this paper we calculate intrinsic fidelity curves (fidelity in the absence of decoherence versus total gate time) for a variety of qubit-qubit interactions, including the commonly occurring isotropic Heisenberg and XY models, as well as randomly generated ones. For interactions not too close to tha…
It is shown that certain natural quantum logic gates, {\it i.e.} unitary time evolution matrices for spin-\frac{1}{2} quantum spins, can be represented as sums, with appropriate phases, over classical logic gates, in a direct analogy with the Feynman path integral representation of quantum mechanics. On the other hand, it is shown that a natural quantum gate obtained by analytically continuing the transfer matrix of the anisotropic nearest-neighbour Ising model to imaginary time, does not admit such a representation.
Possibly, teleportation is the most representative quantum algorithm in the public domain. Nevertheless than this quantum procedure transmits only information than objects, its coverage is still very limited and easily subject to errors. Based on a fine control of quantum resources, particularly those entangled, the research to extend its coverage and flexibility is open, in particular on matter based quantum systems. This work shows how anisotropic Ising interactions could be used as natural basis for this procedure, based on a sequence of magnetic pulses driving Ising interaction, stating re…
Control of quantum entanglement has been considered as elemental physical resource for quantum applications in Quantum Information and Quantum Computation. Control of entangled states on a couple of atoms, ions or quantum dots are milestones in almost all quantum applications towards a scalable spin-based quantum computers or quantum devices. For magnetic systems, Ising model is an interaction which generates and modifies entanglement properties of quantum systems based on matter. In addition, when this interaction includes driven magnetic fields, it can be controlled to sustain, characterize …
We investigate numerically a single-pulse implementation of a quantum Control-Not (CN) gate for an ensemble of Ising spin systems at room temperature. For an ensemble of four-spin ``molecules'' we simulate the time-evolution of the density matrix, for both digital and superpositional initial conditions. Our numerical calculations confirm the feasibility of implementation of quantum CN gate in this system at finite temperature, using electromagnetic $π$-pulse.
In [R. Jozsa, B. Kraus, A. Miyake, J. Watrous, Proc. R. Soc. A {\bf 466}, 809-830 (2010)] it has been shown that a match gate circuit running on n qubits can be compressed to a universal quantum computation on \log(n)+3 qubits. Here, we show how this compression can be employed to simulate the Ising interaction of a 1D--chain consisting out of n qubits using a universal quantum computer running on log(n) qubits. We demonstrate how the adiabatic evolution can be realized on this exponentially smaller system and how the magnetization, which shows a quantum phase transition, can be measured.
We present an approximate analytical solution to the dynamic equation of two Ising-coupled qubits with oscillating classical control fields that are nonperpendicular to the static drift fields. This is a situation that has recently arisen in some solid-state experiments. With our solution we derive the analytical expressions for the local invariants as well as the local rotations needed to isolate a purely nonlocal gate. This determines the set of parameters that are required to generate any entangling gate. Moreover, we use our results to describe a recent experimental work on capacitively co…
We give analytical solutions for the time-optimal synthesis of entangling gates between indirectly coupled qubits 1 and 3 in a linear spin chain of three qubits subject to an Ising Hamiltonian interaction with equal coupling $J$ plus a local magnetic field acting on the intermediate qubit. The energy available is fixed, but we relax the standard assumption of instantaneous unitary operations acting on single qubits. The time required for performing an entangling gate which is equivalent, modulo local unitary operations, to the $\mathrm{CNOT}(1, 3)$ between the indirectly coupled qubits 1 and 3…
We briefly describe the use of GRAPE pulses to implement quantum logic gates in NMR quantum computers, and discuss a range of simple extensions to the core technique. We then consider a range of difficulties which can arise in practical implementations of GRAPE sequences, reflecting non-idealities in the experimental systems used.
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into statistically independent reservoirs. The proposed universal quantum gates are constructed with the help of Heisenberg- and Ising-type Hamiltonians acting on these physical qubits. This way it is guaranteed that the relevant error correcting code space is not left at any time even during the application of one of these quantum gates. The proposed entanglement gate is…
We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model partition function in terms of quadratically signed weight enumerators (QWGTs), which are polynomials that arise naturally in an expansion of quantum circuits in terms of rotations involving Pauli matrices. We combine this expression with a known efficient classical algorithm for the Ising partition function of any planar graph in the absence of an external …
We present the study of a quantum Controlled-Controlled-Not gate, implemented in a chain of three nuclear spins weakly Ising interacting between all of them, that is, taking into account first and second neighbor spin interactions. This implementation is done using a single resonant $π$-pulse on the initial state of the system (digital and superposition). The fidelity parameter is used to determine the behavior of the CCN quantum gate as a function of the ratio of the second neighbor interaction coupling constant to the first neighbor interaction coupling constant ($J'/J$). We found that for $…
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. Here we present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this important result for systems of arbitrary finite dimension has been provided by J. L. and R. Brylinski [arXiv:q…
We present a solvable model of iterating cluster state protocols that lead to entanglement production, between contiguous blocks, of 1 ebit per iteration. This continues till the blocks are maximally entangled at which stage an unravelling begins at the same rate till the blocks are unentangled. The model is a variant of the transverse field Ising model and can be implemented with CNOT and single qubit gates. The inter qubit entanglement as measured by the concurrence is shown to be zero for periodic chain realizations while for open boundaries there are very specific instances at which these …
We study the simulation of a single qubit rotation and Controlled-Not gate in a solid state one-dimensional chain of nuclear spins system interacting weakly through an Ising type of interaction with a modular component of the magnetic field in the z-direction, characterized by $B_z(z,t)=Bo(z)\cosδt$. These qubits are subjected to electromagnetic pulses which determine the transition in the one or two qubits system. We use the fidelity parameter to determine the performance of the Not (N) gate and Controlled-Not (CNOT) gate as a function of the frequency parameter $δ$. We found that for $|δ|\le…
In quantum information processing, one of the most useful interaction between qubits is the Ising type interaction. We propose a scheme to implement the exact Ising interaction through magnetic dipole-dipole interaction. Although magnetic dipolar interaction is Heisenberg type in general, this interaction can bring about the exact mathematical form of the Ising interaction if qubit levels are chosen among the highest magnetic quantum number states. Real physical systems to which our scheme can be applied include rotational states of molecules, hyperfine states of atoms, or electronic states of…
We characterize the set of ground states that can be synthesized by classical 2-body Ising Hamiltonians. We then construct simple Ising planar blocks that simulates efficiently a universal set of logic gates and connections, and hence any boolean function. We therefore provide a new method of encoding universal computation in the ground states of Ising lattices, and a simpler alternative demonstration of the known fact that finding the ground state of a finite Ising spin glass model is NP complete. We relate this with our previous result about emergence properties in infinite lattices.
The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle of quantum annealing, which implies that a carefully controlled energy solution is optimal and corresponds to minimizing a discrete function. The input function can be influenced by rewards and penalties to favor a solution that meets restrictions that are imposed by the problem. We show how to accomplish this influence for gates in adiabatic quantum computing, particularly the controlled-NOT gate (CNOT gate) which is fundamental to all quantum gates on two or…
We model repetitive quantum error correction (QEC) with the single-error-correcting five-qubit code on a network of individually-controlled qubits with always-on Ising couplings, using our previously designed universal set of quantum gates based on sequences of shaped decoupling pulses. In addition to serving as accurate quantum gates, the sequences also provide dynamical decoupling (DD) of low-frequency phase noise. The simulation involves integrating unitary dynamics of six qubits over the duration of tens of thousands of control pulses, using classical stochastic phase noise as a source of …
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we recover and generalize the simulability of Valiant's match-gates by invoking the solvability of the free-fermion eight-vertex model. Our mappings furthermore provide a systematic formalism to obtain simple quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. For example, we present an efficient quantum algo…
We have studied ${\rm SU}(2)_k$ anyon models, assessing their prospects for topological quantum computation. In particular, we have compared the Ising ($k=2$) anyon and Fibonacci ($k=3$) anyon models, motivated by their potential for future realizations based on Majorana fermion quasiparticles or exotic fractional quantum-Hall states, respectively. The quantum computational performance of the different anyon models is quantified at single qubit level by the difference between a target unitary operator and its approximation realised by anyon braiding. To facilitate efficient comparisons, we hav…
