A computational problem fed into a gate-model quantum computer identifies an objective function with a particular computational pathway (objective function connectivity). The solution of the computational problem involves identifying a target objective function value that is the subject to be reached. A bottleneck in a gate-model quantum computer is the requirement of several rounds of quantum state preparations, high-cost run sequences, and multiple rounds of measurements to determine a target (optimal) state of the quantum computer that achieves the target objective function value. Here, we define a method for optimal quantum state determination and computational path evaluation for gate-model quantum computers. We prove a state determination method that finds a target system state for a quantum computer at a given target objective function value. The computational pathway evaluation procedure sets the connectivity of the objective function in the target system state on a fixed hardware architecture of the quantum computer. The proposed solution evolves the target system state without requiring the preparation of intermediate states between the initial and target states of the quantum computer. Our method avoids high-cost system state preparations and expensive running procedures and measurement apparatuses in gate-model quantum computers. The results are convenient for gate-model quantum computations and the near-term quantum devices of the quantum Internet.
We examine the detailed scenario for implementing n-control-qubit Toffoli gates and select gates on ion-trap quantum computers, especially those that shuttle ions into interaction zones. We determine expected performance of these gates with realistic parameters for an ion-trap quantum computer and taking into account the time variation of the exchange integrals. This allows us to estimate the errors due to spin-phonon entanglement as well. While there are challenges with implementing these gates, because their performance always has some degree of error, they should be feasible on current hard…
Local implementation of non-local quantum gates is necessary in a distributed quantum computer. Here, we demonstrate the non-local implementation of controlled-unitary quantum gates proposed by Eisert et al. (Phys Rev A 62:052317, 2000) using the five-qubit IBM quantum computer. We verify the fidelity and accuracy of the implementation through the techniques of quantum state and process tomographies.
The method of iterated resolvents is used to obtain an effective Hamiltonian for neighbouring qubits in the Kane solid state quantum computer. In contrast to the adiabatic gate processes inherent in the Kane proposal we show that free evolution of the qubit-qubit system, as generated by this effective Hamiltonian, combined with single qubit operations, is sufficient to produce a controlled-NOT (c-NOT) gate. Thus the usual set of universal gates can be obtained on the Kane quantum computer without the need for adiabatic switching of the controllable parameters as prescribed by Kane. Both the fi…
We analyze analytically and numerically quantum logic gates in a one-dimensional spin chain with Heisenberg interaction. Analytic solutions for basic one-qubit gates and swap gate are obtained for a quantum computer based on logical qubits. We calculated the errors caused by imperfect pulses which implement the quantum logic gates. It is numerically demonstrated that the probability error is proportional to $ε^4$, while the phase error is proportional to $ε$, where $ε$ is the characteristic deviation from the perfect pulse duration.
We consider one possible implementation of Hadamard gate for optical and ion trap holonomic quantum computers. The expression for its fidelity determining the gate stability with respect to the errors in the single-mode squeezing parameter control is analytically derived. We demonstrate by means of this expression the cancellation of the squeezing control errors up to the fourth order on their magnitude.
CALA-$n$: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts
Entangled resources enable quantum sensing that achieves Heisenberg scaling, a quadratic improvement on the standard quantum limit, but preparing large scale entangled states is challenging in the presence of decoherence. We present a quantum control strategy using highly nonlinear geometric phase gates for preparing entangled states on spin ensembles which can be used for practical precision metrology. The method uses a dispersive coupling of $N$ spins to a common bosonic mode and does not require addressability, special detunings, or interactions between the spins. Using a control sequence t…
In this paper we investigate the effect of dephasing on proposed quantum gates for the solid-state Kane quantum computing architecture. Using a simple model of the decoherence, we find that the typical error in a CNOT gate is $8.3 \times 10^{-5}$. We also compute the fidelities of Z, X, Swap, and Controlled Z operations under a variety of dephasing rates. We show that these numerical results are comparable with the error threshold required for fault tolerant quantum computation.
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 demonstrate the experimental realization of a two-qubit Mølmer-Sørensen gate on a magnetic field-insensitive hyperfine transition in $^9$Be$^+$ ions using microwave-near fields emitted by a single microwave conductor embedded in a surface-electrode ion trap. The design of the conductor was optimized to produce a high oscillating magnetic field gradient at the ion position. The measured gate fidelity is determined to be $98.2\pm1.2\,\%$ and is limited by technical imperfections, as is confirmed by a comprehensive numerical error analysis. The conductor design can potentially simplify the imp…
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.
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.
One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose new protocols to realize a deterministic one-way CNOT gate and one-way $X$-rotations on quantum-computing platforms. By applying a delayed-choice scheme, we overcome a limit of most currently available quantum computers, which are unable to implement further operations on measured qubits or operations conditioned on measurement results from other qubits. Moreover, we decrease the error rate of the one-way logic gates, compared to the original protocol using local operations and classical c…
We study the error rate of CNOT operations in the Kane solid state quantum computer architecture. A spin Hamiltonian is used to describe the system. Dephasing is included as exponential decay of the off diagonal elements of the system's density matrix. Using available spin echo decay data, the CNOT error rate is estimated at approsimately 10^{-3}.
In this paper we generalize the usual model of quantum computer to a model in which the state is an operator of density matrix and the gates are general superoperators (quantum operations), not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum system (open or closed n-qubit system) is considered as an element of $4^{n}$-dimensional operator Hilbert space (Liouville space). It allows to use quantum computer (circuit) model with 4-valued logic. The gates of this model are general superoperators which act on n-ququats state. Ququat is quantum state in a 4-dime…
Crosstalk between target and neighboring spectator qubits due to spillover of control signals represents a major error source limiting the fidelity of two-qubit entangling gates in quantum computers. We show that in our laser-driven trapped-ion system coherent crosstalk error can be modelled as residual $X\hatσ_ϕ$ interaction and can be actively cancelled by single-qubit echoing pulses. We propose and demonstrate a crosstalk suppression scheme that eliminates all first-order crosstalk, yet only requires local control by driving rotations solely on the target qubits. We report a two-qubit Bell …
A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of reach. Hence, the finite error rate limits the use of quantum computers to algorithms with a low number of gates. The variational Hamiltonian ansatz (VHA) has been shown to produce the ground state in good approximation in a manageable number of steps. Here we study explicitly the effect of gate errors on its performance. The VHA is inspired by the adiabatic…
We have studied a system composed by two endohedral fullerene molecules. We have found that this system can be used as good candidate for the realization of Quantum Gates Each of these molecules encapsules an atom carrying a spin,therefore they interact through the spin dipole interaction. We show that a phase gate can be realized if we apply on each encased spin static and time dependent magnetic field. We have evaluated the operational time of a $π$-phase gate, which is of the order of ns. We made a comparison between the theoretical estimation of the gate time and the experimental decoheren…
Most attempts to produce a scalable quantum information processing platform based on ion traps have focused on the shuttling of ions in segmented traps. We show that an architecture based on an array of microtraps with fast gates will outperform architectures based on ion shuttling. This system requires higher power lasers, but does not require the manipulation of potentials or shuttling of ions. This improves optical access, reduces the complexity of the trap, and reduces the number of conductive surfaces close to the ions. The use of fast gates also removes limitations on gate time. The perf…
Two-qubit gates are a fundamental constituent of a quantum computer and typically its most challenging operation. In a trapped-ion quantum computer, this is typically implemented with laser beams which are modulated in amplitude, frequency, phase, or a combination of these. The required modulation becomes increasingly more complex as the quantum computer becomes larger, complicating the control hardware design. Here, we develop a simple method to essentially remove the pulse-modulation complexity by engineering the normal modes of the ion chain. We experimentally demonstrate the required mode …
In this paper, the application of quantum computing (QC) in solving gate insulator Poisson equation is studied, through QC simulator and hardware in IBM. Various gate insulator stacks with and without fixed charges are studied. It is found that by increasing the number of clock bits and by choosing appropriate evolution time, accurate solutions can be obtained in QC simulation. However, when the real quantum hardware is used, the accuracy is substantially reduced. Therefore, a more robust quantum circuit or error correction should be employed and developed.
In recent years qubit designs such as transmons approached the fidelities of up to 0.999. However, even these devices are still insufficient for realizing quantum error correction requiring better than 0.9999 fidelity. Topologically protected superconducting qubits are arguably most prospective for building a realistic quantum computer as they are intrinsically protected from noise and leakage errors that occur in transmons. We propose a topologically protected qubit design based on a $π$-periodic Josephson element and a universal set of gates: protected Clifford group and highly robust (with …
Equivalence of continuous- and discrete-variable gate-based quantum computers with finite energy
Chalmers University of Technology（查尔姆斯理工大学）；Technical University of Denmark（丹麦技术大学）；Johannes-Gutenberg University of Mainz（约翰内斯·古腾堡美因茨大学）；University of Oxford（牛津大学）
We develop in the weak coupling approximation a quasi-non-Markovian master equation and study the phenomenon of decoherence during the operation of a controlled-not (CNOT) quantum gate in a quantum computer model formed by a linear chain of three nuclear spins system with second neighbor Ising interaction between them. We compare with the behavior of the Markovian counterpart for temperature different from zero (thermalization) and at zero temperature for low and high dissipation rates. At low dissipation there is a very small difference between Markovian and quasi no-Markovian at any temperat…
We show how techniques from machine learning and optimization can be used to find circuits of photonic quantum computers that perform a desired transformation between input and output states. In the simplest case of a single input state, our method discovers circuits for preparing a desired quantum state. In the more general case of several input and output relations, our method obtains circuits that reproduce the action of a target unitary transformation. We use a continuous-variable quantum neural network as the circuit architecture. The network is composed of several layers of optical gates…
We study the achievements of quantum circuits comprised of several one- and two-qubit gates. Quantum process matrices are determined for the basic one- and two-qubit gate operations and concatenated to yield the process matrix of the combined quantum circuit. Examples are given of process matrices obtained by a Monte Carlo wave function analysis of Rydberg blockade gates in neutral atoms. Our analysis is ideally suited to compare different implementations of the same process. In particular, we show that the three-qubit Toffoli gate facilitated by the simultaneous interaction between all atoms …
The number of qubits in current quantum computers is a major restriction on their wider application. To address this issue, Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming ([M. S. Ying, Morgan-Kaufmann, 2016]). In doing so, the main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. In this study, we theoretically analyse the (sufficient and necessary) separability conditions of multipartite quantum gates in finite or infinite dim…
Development of Neural Network-Based Optimal Control Pulse Generator for Quantum Logic Gates Using the GRAPE Algorithm in NMR Quantum Computer
Sharif University of Technology（谢里夫理工大学）；Centre for Quantum Engineering and photonics Technology, Sharif University of Technology（谢里夫理工大学量子工程与光子技术中心）；Koc University（科奇大学）
We show how to fully characterize a quantum process in an open quantum system. We particularize the procedure to the case of a universal two-qubit gate in a quantum computer. We illustrate the method with a numerical simulation of a quantum gate in the ion trap quantum computer.
Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation and optimization techniques that massively reduce the entangling-gate counts. We exploit the well-studied non-quantum optimization algorithms to achieve up to 24\% savings over the state of the art for several small-molecule simulations, with no loss of accuracy or hidden costs. Our methodologies straightforwardly generalize to wider classes of near-term simu…
Simulation of quantum matters is a significant application of quantum computers. In contrast to the unitary operation which can be realized naturally on a quantum computer, the implementation of nonunitary operation, widely used in classical approaches, needs special designing. Here, by application of Grover's algorithm, we extend the probabilistic method of implementing nonunitary operation and show that it can promote success probability without fidelity decreasing. This method can be applied to problems of imaginary time evolution and contraction of tensor networks on a quantum computer.
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of coherence is to reduce the number of gates by implementing a gate set that matches the requirements of the specific algorithm of interest directly in hardware. Here, we show that exchange-type gates are a promising choice for simulating molecular eigenstates on near-term quantum devices since these gates preserve the number of excitations in the system. Com…
We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a quantum gate is also described with the Hamilton operator expressed as spin system. Computer algebra implementations are provided.
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such that the desired unitary matrix expressing the algorithm is directly implemented. We demonstrate this by taking the two-qubit Grover's algorithm implemented in NMR quantum computation, whose pseudopure state is generated by cyclic permutations of the state populations. This is the first exact time-optimal solution, to our knowledge, obtained for …
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivity, and coherence times, a quantum circuit optimization is essential to make the best use of near-term quantum devices. We introduce a new circuit optimizer called AQCEL, which aims to remove redundant controlled operations from controlled gates, depending on initial states of the circuit. Especially, the AQCEL can remove unnecessary qubit controls from multi-controlled gates in polynomial computational resources, even when all the relevant qubits are entangled, by identifying zero…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it has recently been theoretically predicted that superimposing quantum circuits, each with a different gate order, could provide quantum computers with an even further computational advantage [3-5]. Here, we experimentally demonstrate this enhancement by applying two quantum gates in a superposition of both possible orders to determine whether the two gates comm…
We present a new implementation of quantum computation that treats quantum computers as a special type of Bayesian Network called a QuDot Net. QuDot Nets allow for the efficient representation of some qubit systems. Single qubit quantum gates can be implemented as edge transformations on QuDot Nets. The X, H, R(k), M and SWAP gates are discussed in detail and results show linear scaling as the number of qubits are increased. We show that measurement and semi-quantum control gates can be efficiently implemented using QuDot Nets and present results from a QuDot Net implementation of the terminal…
Designing a Machine Learning-Driven, Cross-Hardware Emulator for Noisy Quantum Computers with Gate-Based Protocols
Institute of High Performance Computing (IHPC), Agency for Science, Technology and Research (A*STAR)（高性能计算研究所，科学技术研究局）；Dipartimento di Fisica, Università degli Studi di Milano（米兰大学物理系）；INFN, Sezione di Milano（意大利国家核物理研究所，米兰分部）；Theoretical Physics Department, CERN（欧洲核子研究中心理论物理部）；Quantum Research Center, Technology Innovation Institute（技术创新研究所量子研究中心）
We assess routes to a diamond-based quantum computer, where we specifically look towards scalable devices, with at least 10 linked quantum gates. Such a computer should satisfy the deVincenzo rules and might be used at convenient temperatures. The specific examples we examine are based on the optical control of electron spins. For some such devices, nuclear spins give additional advantages. Since there have already been demonstrations of basic initialisation and readout, our emphasis is on routes to two-qubit quantum gate operations and the linking of perhaps 10-20 such gates. We analyse the d…
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the …
Utility of NISQ devices: optimizing experimental parameters for the fabrication of Au atomic junction using gate-based quantum computers
Tokyo University of Agriculture and Technology（东京农工大学）；The Institute of Medical Science, The University of Tokyo（东京大学医学科学研究所）；The University of Tokyo（东京大学）
We propose a gate optimization method, which we call variational quantum gate optimization (VQGO). VQGO is a method to construct a target multi-qubit gate by optimizing a parametrized quantum circuit which consists of tunable single-qubit gates with high fidelities and fixed multi-qubit gates with limited controlabilities. As an example, we apply the proposed scheme to the models relevant to superconducting qubit systems. We show in numerical simulations that the high-fidelity CNOT gate can be constructed with VQGO using cross-resonance gates with finite crosstalk. We also demonstrate that fas…
We study the exact open system dynamics of single qubit gates during a measurement-based quantum computation considering non-Markovian environments. We obtain analytical solutions for the average gate fidelities and analyze it for amplitude damping and dephasing channels. We show that the average fidelity is identical for the X-gate and Z-gate and that neither fast application of the projective measurements necessarily implies high gate fidelity, nor slow application necessarily implies low gate fidelity. Indeed, for highly non-Markovian environments, it is of utmost importance to know the bes…
We propose a method for implementation of a quantum computer using artificial molecules. The artificial molecule consists of two coupled quantum dots stacked along z direction and one single electron. One-qubit and two-qubit gates are constructed by one molecule and two coupled molecules, respectively.The ground state and the first excited state of the molecule are used to encode the |0> and |1> states of a qubit. The qubit is manipulated by a resonant electromagnetic wave that is applied directly to the qubit through a microstrip line. The coupling between two qubits in a quantum controlled N…
We execute the quantum eraser, the Elitzur-Vaidman bomb, and the Hardy's paradox experiment using high-level programming language on a generic, gate-based superconducting quantum processor made publicly available by IBM. The quantum circuits for these experiments use a mixture of one-qubit and multi-qubit gates and require high entanglement gate accuracy. The results aligned with theoretical predictions of quantum mechanics to high confidence on circuits using up to 3 qubits. The power of quantum computers and high-level language as a platform for experimenting and studying quantum phenomena i…
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…
