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 magnitude and to model a 1000-qubit full adder. (We add a 1000-bit number using 2001 spins.) (ii) We construct the full adder gates directly as sequences of radio-frequency pulses, rather than breaking them down into generalized logical gates, such as Control-Not and one qubit gates. This substantially reduces the number of pulses needed to implement the full adder. [The maximum number of pulses required to add one bit (F-gate) is 15]. (iii) Full adder is realized in a homogeneous spin chain. (iv) The phase error is minimized: the F-gates generate approximately the same phase for different states of the superposition. (v) Modeling of the full adder is performed using quantum maps instead of differential equations. This allows us to reduce the calculation time to a reasonable value.
Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen many great mathematical advances, with experimental demonstrations now catching up. In this study, we examine the viability of implementing Coin Quantum Random Walks using a Quantum Adder based Shift Operator, with quantum circuit designs specifically for superconducting qubits. We focus on the strengths and weaknesses of these walks, particularly circuit de…
Control modular addition is a core arithmetic function, and we must consider the computational cost for actual quantum computers to realize efficient implementation. To achieve a low computational cost in a control modular adder, we focus on minimizing KQ, defined by the product of the number of qubits and the depth of the circuit. In this paper, we construct an efficient control modular adder with small KQ by using relative-phase Toffoli gates in two major types of quantum computers: Fault-Tolerant Quantum Computers (FTQ) on the Logical layer and Noisy Intermediate-Scale Quantum Computers (NI…
We present the design of a quantum carry-lookahead adder using measurement-based quantum computation. The quantum carry-lookahead adder (QCLA) is faster than a quantum ripple-carry adder; QCLA has logarithmic depth while ripple adders have linear depth. Our design is evaluated in terms of number of time steps and the total number of qubits used.
We present an efficient addition circuit, borrowing techniques from the classical carry-lookahead arithmetic circuit. Our quantum carry-lookahead (QCLA) adder accepts two n-bit numbers and adds them in O(log n) depth using O(n) ancillary qubits. We present both in-place and out-of-place versions, as well as versions that add modulo 2^n and modulo 2^n - 1. Previously, the linear-depth ripple-carry addition circuit has been the method of choice. Our work reduces the cost of addition dramatically with only a slight increase in the number of required qubits. The QCLA adder can be used within curre…
We present an arithmetic circuit performing constant modular addition having $\mathcal{O}(n)$ depth of Toffoli gates and using a total of $n+3$ qubits. This is an improvement by a factor of two compared to the width of the state-of-the-art Toffoli-based constant modular adder. The advantage of our adder, compared to the ones operating in the Fourier-basis, is that it does not require small angle rotations and their Clifford+T decomposition. Our circuit uses a recursive adder combined with the modular addition scheme proposed by Vedral et. al. The circuit is implemented and verified exhaustivel…
In this work, we propose an adder for the 2D NTC architecture, designed to match the architectural constraints of many quantum computing technologies. The chosen architecture allows the layout of logical qubits in two dimensions and the concurrent execution of one- and two-qubit gates with nearest-neighbor interaction only. The proposed adder works in three phases. In the first phase, the first column generates the summation output and the other columns do the carry-lookahead operations. In the second phase, these intermediate values are propagated from column to column, preparing for computat…
We present a new linear-depth ripple-carry quantum addition circuit. Previous addition circuits required linearly many ancillary qubits; our new adder uses only a single ancillary qubit. Also, our circuit has lower depth and fewer gates than previous ripple-carry adders.
We improve the Toffoli count of low depth quantum adders, and analyze how their spacetime cost reacts to having a limited number of magic state factories. We present a block lookahead adder that parallelizes across blocks of bits of size $b$, instead of over all bits. The block lookahead adder achieves a Toffoli count of $3n + 5n/b$ for out of place addition (vs $4n$ in previous work by Thapliyal et al) and $5n + 8n/b$ for in place addition (vs $7n$ in previous work by Thapliyal et al). The tradeoff is that the reaction depth of these circuits depends linearly on $b$, and they use additional w…
Quantum circuits of arithmetic operations such as addition are needed to implement quantum algorithms in hardware. Quantum circuits based on Clifford+T gates are used as they can be made tolerant to noise. The tradeoff of gaining fault tolerance from using Clifford+T gates and error correcting codes is the high implementation overhead of the T gate. As a result, the T-count performance measure has become important in quantum circuit design. Due to noise, the risk for errors in a quantum circuit computation increases as the number of gate layers (or depth) in the circuit increases. As a result,…
We present the design of a quantum carry-lookahead adder using measurement-based quantum computation. QCLA utilizes MBQC`s ability to transfer quantum states in unit time to accelerate addition. The quantum carry-lookahead adder (QCLA) is faster than a quantum ripple-carry adder; QCLA has logarithmic depth while ripple adders have linear depth. QCLA is an order of magnitude faster than a ripple-carry adder when adding registers longer than 100 qubits but requires a cluster state that is an order of magnitude larger. Hand optimization results in a $\approx$ 26% reduction in spatial resources fo…
We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well-studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the general theory of quantum multiple access channels, and we may apply the established formulas for the capacity region to it. However, the binary adder channel is of particular interest classically, which motivates our generalizing it to the quantum domain. It turns out to be a very nice case study not only of multi-user quantum information theory, but also …
We improve the number of T gates needed to perform an n-bit adder from 8n + O(1) to 4n + O(1). We do so via a "temporary logical-AND" construction which uses four T gates to store the logical-AND of two qubits into an ancilla and zero T gates to later erase the ancilla. This construction is equivalent to one by Jones, except that our framing makes it clear that the technique is far more widely applicable than previously realized. Temporary logical-ANDs can be applied to integer arithmetic, modular arithmetic, rotation synthesis, the quantum Fourier transform, Shor's algorithm, Grover oracles, …
Optimal labeling schemes lead to efficient experimental protocols for quantum information processing by nuclear magnetic resonance (NMR). A systematic approach of finding optimal labeling schemes for a given computation is described here. The scheme is described for both quadrupolar systems and spin-1/2 systems. Finally, one of the optimal labeling scheme has been used to experimentally implement a quantum full-adder in a 4-qubit system by NMR, using the technique of transition selective pulses.
We present the design and evaluation of a quantum carry-lookahead adder (QCLA) using measurement-based quantum computation (MBQC), called MBQCLA. QCLA was originally designed for an abstract, concurrent architecture supporting long-distance communication, but most realistic architectures heavily constrain communication distances. The quantum carry-lookahead adder is faster than a quantum ripple-carry adder; QCLA has logarithmic depth while ripple adders have linear depth. MBQCLA utilizes MBQC's ability to transfer quantum states in unit time to accelerate addition. MBQCLA breaks the latency li…
Here, we propose a scheme to generate a controllable Ising interaction between superconducting flux qubits. Existing schemes rely on inducting couplings to realize Ising interactions between flux qubits, and the interaction strength is controlled by an applied magnetic field On the other hand, we have found a way to generate an interaction between the flux qubits via capacitive couplings. This has an advantage in individual addressability, because we can control the interaction strength by changing an applied voltage that can be easily localized. This is a crucial step toward the realizing sup…
Shanghai University（上海大学）；University of the Basque Country UPV/EHU（巴斯克地区大学）；IKERBASQUE, Basque Foundation for Science（巴斯克科学基金会）
Quantum autoencoders allow for reducing the amount of resources in a quantum computation by mapping the original Hilbert space onto a reduced space with the relevant information. Recently, it was proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, we carry out the experimental implementation of this proposal in the Rigetti cloud quantum computer employing up to three qubits. The experimental fidelities are in good agreement with the theoretical prediction, thus proving the feasibility to realize quantum autoencoders via quantum adders …
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.
Thermal entanglement of a two-qubit Ising chain subjected to an external magnetic field and Dzialoshinski-Moriya (DM) interaction is examined. The effect of magnetic field, strength of DM interaction and temperature are analyzed by adopting negativity of partial transpose as the measure of entanglement. It is shown that when the DM interaction along the Ising axis is considerable, thermal entanglement can be sustained for higher temperature. The usefulness of longitudinal DM interaction over the one that is perpendicular to the Ising axis, in the manipulation and control of entanglement at a f…
We study entanglement and spin squeezing in the ground state of three qubits interacting via the transverse Ising model. We give analytical results for the entanglement and spin squeezing, and a quantitative relation between the concurrence, quantifying the entanglement of two spins, and the spin squeezing parameter, measuring the degree of squeezing. Finally, by appropriately choosing the exchange interaction and strengths of the transverse field, we propose a scheme for generating entangled W state from an unentangled initial state with all spins down.
Quantum circuits of many qubits are extremely difficult to realize; thus, the number of qubits is an important metric in a quantum circuit design. Further, scalable and reliable quantum circuits are based on Clifford + T gates. An efficient quantum circuit saves quantum hardware resources by reducing the number of T gates without substantially increasing the number of qubits. Recently, the design of a quantum multiplier is presented by Babu [1] which improves the existing works in terms of number of quantum gates, number of qubits, and delay. However, the recent design is not based on fault-to…
We investigate the ground state and the thermal entanglement in the two-qubit Ising model interacting with a site-dependent magnetic field. The degree of entanglement is measured by calculating the concurrence. For zero temperature and for certain direction of the applied magnetic field, the quantum phase transition observed under a uniform external magnetic field disappears once a very small non-uniformity is introduced. Furthermore, we have shown analytically and confirmed numerically that once the direction of one of the magnetic field is along the Ising axis then no entangled states can be…
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 present a novel and efficient in terms of circuit depth design for Shor's quantum factorization algorithm. The circuit effectively utilizes a diverse set of adders based on the quantum Fourier transform (QFT) Draper's adders to build more complex arithmetic blocks: quantum multiplier/accumulators by constants and quantum dividers by constants. These arithmetic blocks are effectively architected into a generic modular quantum multiplier which is the fundamental block for modular exponentiation circuit, the most computational intensive part of Shor's algorithm. The proposed modular exponentia…
Interconversions of $W$ and Greenberger-Horne-Zeilinger states in various physical systems are lately attracting considerable attention. We address this problem in the fairly general physical setting of qubit arrays with long-ranged (all-to-all) Ising-type qubit-qubit interaction, which are simultaneously acted upon by transverse Zeeman-type global control fields. Motivated in part by a recent Lie-algebraic result that implies state-to-state controllability of such a system for an arbitrary pair of states that are invariant with respect to qubit permutations, we present a detailed investigatio…
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…
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 obtain the analytical expression for the Kraus decomposition of the quantum map of an environment modeled by an arbitrary quadratic fermionic Hamiltonian acting on one or two qubits, and derive simple functions to check the non-positivity of the intermediate map. These functions correspond to two different sufficient criteria for non-Markovianity. In the particular case of an environment represented by the Ising Hamiltonian, we discuss the two sources of non-Markovianity in the model, one due to the finite size of the lattice, and another due to the kind of interactions.
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.
Many quantum algorithms make use of ancilla, additional qubits used to store temporary information during computation, to reduce the total execution time. Quantum computers will be resource-constrained for years to come so reducing ancilla requirements is crucial. In this work, we give a method to generate ancilla out of idle qubits by placing some in higher-value states, called qudits. We show how to take a circuit with many $O(n)$ ancilla and design an ancilla-free circuit with the same asymptotic depth. Using this, we give a circuit construction for an in-place adder and a constant adder bo…
We study the analytically solvable Ising model of a single qubit system coupled to a spin bath. The purpose of this study is to analyze and elucidate the performance of Markovian and non-Markovian master equations describing the dynamics of the system qubit, in comparison to the exact solution. We find that the time-convolutionless master equation performs particularly well up to fourth order in the system-bath coupling constant, in comparison to the Nakajima-Zwanzig master equation. Markovian approaches fare poorly due to the infinite bath correlation time in this model. A recently proposed p…
NISQ (Noisy, Intermediate-Scale Quantum) computing requires error mitigation to achieve meaningful computation. Our compilation tool development focuses on the fact that the error rates of individual qubits are not equal, with a goal of maximizing the success probability of real-world subroutines such as an adder circuit. We begin by establishing a metric for choosing among possible paths and circuit alternatives for executing gates between variables placed far apart within the processor, and test our approach on two IBM 20-qubit systems named Tokyo and Poughkeepsie. We find that a single-numb…
Entanglement generated by Ising model has been studied for several authors in order to understand the relation between it and magnetic properties of materials, principally using one or two dimensional models for two or more particles. In this work, Ising model evolution is solved in three dimensions for two parts including an inhomogeneous magnetic field, giving an detailed study of the entanglement properties derived from interaction. Some relations between entanglement and energy or spin are developed specifically to stablish candidates for entanglement witness. Finally, some basic quantum c…
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 consider Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first and second neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations of the external fields. By averaging over many repetitions of the algorithm, the output state becomes effectively a mixed state. We study its overlap with the nominal output state of the algorithm, which is called fidelity. We find either an exponential or a Gaussian decay for the fidelity as a function of the strength of the noise, depending on the type of n…
We propose a scheme to characterize the non-Markovian dynamics and quantify the non-Markovianity via the non-classicality measured by the negativity of quantumness. By considering a qubit in contact with a critical Ising spin bath and introducing an ancilla, we show that revivals of negativity of quantumness indicate the non-Markovian dynamics. Furthermore, a normalized measure of non-Markovianity based on the negativity of quantumness is introduced and the influences of bath criticality, bath temperature and bath size on the non-Markovianity are discussed. It is shown that, at the critical po…
We study the quantum phase transition in a spin chain with variable Ising interaction and position-dependent coupling to a resonator field. Such a complicated model, usually not present in natural physical systems, can be simulated by an array of qubits based on man-made devices and exhibits interesting behavior. We show that, when the coupling between the qubit and field is strong enough, a super-radiant phase transition occurs, and it is possible to pick a particular field mode to undergo this phase transition by properly modulating the strength of the Ising interaction. We also study the im…
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.
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.
A central qubit coupled to an Ising ring of $N$ qubits, operating close to a critical point is investigated as a potential precision quantum magnetometer for estimating an applied transverse magnetic field. We compute the Quantum Fisher information for the central, probe qubit with the Ising chain initialized in its ground state or in a thermal state. The non-unitary evolution of the central qubit due to its interaction with the surrounding Ising ring enhances the accuracy of the magnetic field measurement. Near the critical point of the ring, Heisenberg-like scaling of the precision in estima…
Rydberg-atom quantum simulators are of keen interest because of their possibilities towards high-dimensional qubit architectures. Here we report three-dimensional conformation spectra of quantum-Ising Hamiltonian systems with programmed qubit connections. With a Rydberg-atom quantum simulator, various connected graphs, in which vertices and edges represent atoms and blockaded couplings, respectively, are constructed in two or three-dimensional space and their eigenenergies are probed during their topological transformations. Star, complete, cyclic, and diamond graphs, and their geometric inter…
