Terry Rudolph, Jian-Wei Pan
We describe a simple scheme for implementing the non-linear sign gate of Knill, Laflamme and Milburn (Nature, {\bf 409}, 46-52, Jan. 4 (2001)) which forms the basis of an experiment underway at the University of Vienna.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact 2-rebit) gate which is universal for quantum computing, although it cannot be used to perform arbitrary unitary transformations.
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically processed in a nested loop by an electrically programmable gate sequence. This architecture can process any input state and an arbitrary number of modes with almost minimum resources, and offers a universal gate set for both qubits and continuous variables. Furthermore, quantum computing can be performed fault-tolerantly by a known scheme for encoding a qubit …
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed, and if the initial state of the lattice can be suitably chosen, then a quantum computer can be efficiently simulated
We propose a new concept for a two-qubit gate operating on a pair of trapped ions based on laser coherent control techniques. The gate is insensitive to the temperature of the ions, works also outside the Lamb-Dicke regime, requires no individual addressing by lasers, and can be orders of magnitude faster than the trap period.
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…
Universal quantum computing with a single arbitrary gate
本文提出用单个任意门实现通用量子计算，通过改进的蛮力编译方法以对数深度达到目标精度，并结合无测量量子纠错将误差再降低约两个数量级。
The implementation of quantum gates with fidelities that exceed the threshold for reliable quantum computing requires robust gates whose performance is not limited by the precision of the available control fields. The performance of these gates also should not be affected by the noisy environment of the quantum register. Here we use randomized benchmarking of quantum gate operations to compare the performance of different families of gates that compensate errors in the control field amplitudes and decouple the system from the environmental noise. We obtain average fidelities of up to 99.8\%, w…
Tutorial: Gate-based superconducting quantum computing
介绍理解和构建基于门的超导量子计算系统的基本概念元素。
We present a general technique to implement products of many qubit operators communicating via a joint harmonic oscillator degree of freedom in a quantum computer. By conditional displacements and rotations we can implement Hamiltonians which are trigonometric functions of qubit operators. With such operators we can effectively implement higher order gates such as Toffoli gates and C^n-NOT gates, and we show that the entire Grover search algorithm can be implemented in a direct way.
The stored-program architecture is canonical in classical computing, while its power has not been fully recognized for the quantum case. We study quantum information processing with stored quantum program states, i.e., using qubits instead of bits to encode quantum operations. We develop a stored-program model based on Choi states, following from channel-state duality, and a symmetry-based generalization of deterministic gate teleportation. Our model enriches the family of universal models for quantum computing, and can also be employed for tasks including quantum simulation and communication.
We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation. Quantum gate operations are achieved by applying sequences of voltages and magnetic fluxes to single qubits or pairs of qubits. Neither the temporal duration, nor the starting time, of a gate operation is used as a control parameter. As a result, the quantum gates have a constant and known duration, and depend upon standard control parameter sequences regardle…
Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a target unitary. The problem of minimising the number of gates is known as gate-synthesis. The approximation error is a form of coherent noise, which can be significantly more damaging than comparable incoherent noise. We show how mixing over different gate sequences can convert this coherent noise into an incoherent form. As measured by diamond distance, the post-mixing noise is quadratically smaller than before mixing, with no additional resource cost. Equivalently, we can use a shorter gate seq…
We present a composite pulse controlled phase gate which together with a bus architecture improves the feasibility of a recent quantum computing proposal based on rare-earth-ion doped crystals. Our proposed gate operation is tolerant to variations between ions of coupling strengths, pulse lengths, and frequency shifts, and it achieves worst case fidelities above 0.999 with relative variations in coupling strength as high as 10% and frequency shifts up to several percent of the resonant Rabi frequency of the laser used to implement the gate. We outline an experiment to demonstrate the creation …
Quantum computing using two-dimensional NMR has recently been described using scalar coupling evolution technique [J. Chem. Phys.,109,10603 (1998)]. In the present paper, we describe two-dimensional NMR quantum computing with the help of selective pulses. A number of logic gates are implemented using two and three qubits with one extra observer spin. Some many-in-one gates (or Portmanteau gates) are implemented. Toffoli gate (or AND/NAND gate) and OR/NOR gates are implemented on three qubits. Deutsch-Jozsa quantum algorithm for one and two qubits, using one extra work qubit, has also been impl…
Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tolerant to a certain degree. We examine its implementation based on Zeeman coupling with a rotating field and isotropic Heisenberg interaction, which describe NMR and can also be realized in quantum dots and cold atoms. Using a novel physical representation of the qubit basis states, we construct $π/8$ and Hadamard gates based on Berry and Aharonov-Anandan phases. For two interacting qubits in a rotating field, we find that it is always impossible to construct a two-qubit gate based on Berry phases…
The possibility to utilize different types of two-qubit gates on a single quantum computing platform adds flexibility in the decomposition of quantum algorithms. A larger hardware-native gate set may decrease the number of required gates, provided that all gates are realized with high fidelity. Here, we benchmark both controlled-Z (CZ) and exchange-type (iSWAP) gates using a parametrically driven tunable coupler that mediates the interaction between two superconducting qubits. Using randomized benchmarking protocols we estimate an error per gate of $0.9\pm0.03\%$ and $1.3\pm0.4\%$ fidelity for…
We implemented arbitrary single qubit gates of geometric quantum computing for a three-level system in a single-shot manner. The evolution time of the gate has been minimized by considering the shortest trajectory of the state on the Bloch sphere. The duration of gates grows from zero with the rotation angle $γ$, and the tested T gate time can be reduced to $\sim$40\% of those in the traditional orange-sliced-shaped path non-adiabatic holonomic quantum computing (NHQC) scheme by the parametrization of Rabi frequency. We also demonstrated that certain pulses are robust against static detuning e…
Quantum computers based on rare-earth-ion-doped crystals show promising properties in terms of scalability and connectivity if single ions can be used as qubits. Through simulations, we investigate gate operations on such qubits and discuss how gate and system parameters affect gate errors, the required frequency bandwidth per qubit, and the risk of instantaneous spectral diffusion (ISD) occurring. Furthermore, we examine how uncertainties in the system parameters affect the gate errors, and how precisely the system needs to be known. We find gate errors for arbitrary single-qubit gates of $2.…
S-QGPU: Shared Quantum Gate Processing Unit for Distributed Quantum Computing
本研究提出一种基于共享量子门处理单元S-QGPU的分布式量子计算架构，通过集中共享通信量子比特等资源，有效降低系统成本，提升资源利用率与突发远程门操作的支持能力。
Implementing precise operations on quantum systems is one of the biggest challenges for building quantum devices in a noisy environment. Dynamical decoupling (DD) attenuates the destructive effect of the environmental noise, but so far it has been used primarily in the context of quantum memories. Here, we present a general scheme for combining DD with quantum logical gate operations and demonstrate its performance on the example of an electron spin qubit of a single nitrogen-vacancy center in diamond. We achieve process fidelities >98% for gate times that are 2 orders of magnitude longer than…
We propose a set of techniques that enable universal quantum computing to be carried out using dressed states. This applies in particular to the effort of realising quantum computation in trapped ions using long-wavelength radiation, where coupling enhancement is achieved by means of static magnetic-field gradient. We show how the presence of dressing fields enables the construction of robust single and multi-qubit gates despite the unavoidable presence of magnetic noise, an approach that can be generalised to provide shielding in any analogous quantum system that relies on the coupling of ele…
We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations admitting exact decompositions and describe a process for obtaining them systematically. Gates admitting these decompositions can be synthesized exactly, using circuits that are several orders of magnitude smaller than those achievable with previous methods. Our method relies on strategically using unitary conjugation and a lemma to the Baker-Campbell-Hausdorff formula to derive new exact decompositions from previous…
In leading fault-tolerant quantum computing schemes, accurate transformation are obtained by a two-stage process. In a first stage, a discrete, universal set of fault-tolerant operations is obtained by error-correcting noisy transformations and distilling resource states. In a second stage, arbitrary transformations are synthesized to desired accuracy by combining elements of this set into a circuit. Here, we present a scheme which merges these two stages into a single one, directly distilling complex transformations. We find that our scheme can reduce the total overhead to realize certain gat…
We propose a scheme for linear optical quantum Fredkin gate based on the combination of recently experimentally demonstrated linear optical partial SWAP gate and controlled-Z gates. Both heralded gate and simplified postselected gate operating in the coincidence basis are designed. The suggested setups have a simple structure and require stabilization of only a single Mach-Zehnder interferometer. A proof-of-principle experimental demonstration of the postselected Fredkin gate appears to be feasible and within the reach of current technology.
RF-induced micromotion in trapped ion systems is typically minimised or circumvented to avoid off-resonant couplings for adiabatic processes such as multi-ion gate operations. Non-adiabatic entangling gates (so-called `fast gates') do not require resolution of specific motional sidebands, and are therefore not limited to timescales longer than the trapping period. We find that fast gates designed for micromotion-free environments have significantly reduced fidelity in the presence of micromotion. We show that when fast gates are designed to account for the RF-induced micromotion, they can, in …
We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in parity encoding with single-qubit operations. Together with logical $R_x$ rotations, implemented via nearest-neighbor controlled-NOT gates and an $R_x$ rotation, these form a universal gate set. As the controlled phase gate requires only single-qubit rotations, the proposed scheme has advantages for several cornerstone quantum algorithms, e.g., the quantum Fou…
We present an efficient approach to optimising pulse sequences for implementing fast entangling two-qubit gates on trapped ion quantum information processors. We employ a two-phase procedure for optimising gate fidelity, which we demonstrate for multi-ion systems in linear Paul trap and microtrap architectures. The first phase involves a global optimisation over a computationally inexpensive cost function constructed under strong approximations of the gate dynamics. The second phase involves local optimisations that utilise a more precise ODE description of the gate dynamics, which captures th…
Optimal control techniques are applied for the decomposition of unitary quantum operations into a sequence of single-qubit gates and entangling operations. To this end, we modify a gradient-ascent algorithm developed for systems of coupled nuclear spins in molecules to make it suitable for trapped ion quantum computing. We decompose unitary operations into entangling gates that are based on a nonlinear collective spin operator and complemented by global spinflip and local light shift gates. Among others, we provide explicit decompositions of controlled-NOT and Toffoli gates, and a simple quant…
All You Need is pi: Quantum Computing with Hermitian Gates
本文提出了一种仅使用Hermitian门的通用量子计算方案，通过π旋转和CNOT门实现高保真度的单量子比特操作和多控制单元ary转换。
Today ion traps are among the most promising physical systems for constructing a quantum device harnessing the computing power inherent in the laws of quantum physics. The standard circuit model of quantum computing requires a universal set of quantum logic gates for the implementation of arbitrary quantum operations. As in classical models of computation, quantum error correction techniques enable rectification of small imperfections in gate operations, thus allowing for perfect computation in the presence of noise. For fault-tolerant computation, it is commonly believed that error thresholds…
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…
Fraunhofer FIRST develops a computing service and collaborative workspace providing a convenient tool for simulation and investigation of quantum algorithms. To broaden the twenty qubit limit of workstation-based simulations to the next qubit decade we provide a dedicated high memorized Linux cluster with fast Myrinet interconnection network together with a adapted parallel simulator engine. This simulation service supplemented by a collaborative workspace is usable everywhere via web interface and integrates both hardware and software as collaboration and investigation platform for the quantu…
For superconducting qubits, microwave pulses drive rotations around the Bloch sphere. The phase of these drives can be used to generate zero-duration arbitrary "virtual" Z-gates which, combined with two $X_{π/2}$ gates, can generate any SU(2) gate. Here we show how to best utilize these virtual Z-gates to both improve algorithms and correct pulse errors. We perform randomized benchmarking using a Clifford set of Hadamard and Z-gates and show that the error per Clifford is reduced versus a set consisting of standard finite-duration X and Y gates. Z-gates can correct unitary rotation errors for …
In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices called ``gates'' that tend to destroy the fragile quantum states needed for computation. The goal of fault-tolerant quantum computing is to compute accurately even when gates have a high probability of error each time they are used. Here we give evidence that accurate quantum computing is possible with error probabilities above 3% per gate, which is significan…
Fourier states are multi-qubit registers that facilitate phase rotations in fault-tolerant quantum computing. We propose distillation protocols for constructing the fundamental, $n$-qubit Fourier state with error $O(2^{-n})$ at a cost of $O(n \log n)$ Toffoli gates and Clifford gates, or any arbitrary Fourier state using $O(n^2)$ gates. We analyze these protocols with methods from digital signal processing. These results suggest that phase kickback, which uses Fourier states, could be the current lowest-overhead method for generating arbitrary phase rotations.
Universal quantum gates lie at the heart of designing quantum computer. We construct two compact quantum circuits to implement post-selected controlled-phase-flip (CPF) gate and Toffoli gate with linear optics assisted by one and two single photons, respectively. The current existing maximum success probability of 1/4 for linear optical CPF gate is achieved by resorting to an ancillary single photon rather than an entangled photon pair or two single photons. Remarkably, our Toffoli gate is accomplished with current maximum success probability of 1/30 without using additional entangled photon p…
Achieving Sub-Exponential Speedup in Gate-Based Quantum Computing for Quadratic Unconstrained Binary Optimization
本文提出结合模拟退火与Grover算法的混合量子方法，在625位QUBO酶配方优化问题上实现次指数加速，提升工业适用性。
We show that a universal set of gates for quantum computation with optics can be quantum teleported through the use of EPR entangled states, homodyne detection, and linear optics and squeezing operations conditioned on measurement outcomes. This scheme may be used for fault-tolerant quantum computation in any optical scheme (qubit or continuous variable). The teleportation of nondeterministic nonlinear gates employed in linear optics quantum computation is discussed.
Quantum computing architecture with Rydberg gates in trapped ions
提出利用Rydberg态高电极化率实现线性晶体中任意离子对的全连接纠缠门方案，通过态相关频移和电波形实现微秒级操作，并可与可扩展处理器架构结合重新配置量子比特寄存器。
We have found that encapsulated atoms in fullerene molecules, which carry a spin, can be used for fast quantum computing. We describe the scheme for performing quantum computations, going through the preparation of the qubit state and the realization of a two-qubit quantum gate. When we apply a static magnetic field to each encased spin, we find out the ideal design for the preparation of the quantum state. Therefore, adding to our system a time dependent magnetic field, we can perform a phase-gate. The operational time related to a $π-$phase gate is of the order of $ns$. This finding shows th…
We study the class of two qubit gates which can be achieved using only linear optical elements (beam splitters and phase shifters) and post-selection. We are able to exactly characterize this set, and find that it is impossible to implement most two qubit gates in this way. The proof also gives rise to an algorithm for calculating the optimal success probability of those gates which are achievable.
We explore a field theoretical approach to quantum computing and control. This book consists of three parts. The basics of systems theory and field theory are reviewed in Part I. In Part II, a gauge theory is reinterpreted from a systems theoretical perspective and applied to the formulation of quantum gates. Then quantum systems are defined by introducing feedback to the gates. In Part III, quantum gates and systems are reformulated from a quantum field theoretical perspective using S-matrices. We also discuss how gauge fields are related to feedback.
We clarify the connections between the erasure scheme of probabilistic CNOT gate implementation recently proposed by Pittman, Jacobs and Franson [Phys. Rev. A 64, 062311 (2001)] and quantum teleportation.
We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is unavoidable here. We identify rigorous general bounds to the necessary consumption of initially available maximally entangled pairs when building up one-dimensional cluster states with individually acting linear optical quantum gates, entangled pairs and vacuum modes. As the known linear optics gates have a limited maximum success probability, as we show, this …
Trapped-ion quantum computers have demonstrated high-performance gate operations in registers of about ten qubits. However, scaling up and parallelizing quantum computations with long one-dimensional (1D) ion strings is an outstanding challenge due to the global nature of the motional modes of the ions which mediate qubit-qubit couplings. Here, we devise methods to implement scalable and parallel entangling gates by using engineered localized phonon modes. We propose to tailor such localized modes by tuning the local potential of individual ions with programmable optical tweezers. Localized mo…
We propose a deterministic SWAP gate for spatially encoded qubits. The gate is constructed from waveguide crossings, Mach Zender Interferometers and phase shifters providing the gate reconfigurability. Through manipulating the phase of the phase shifters, we can apply either the SWAP or identity gates. As an essential element of nearest neighbor qubit networks, the SWAP gate has a simple structure and presents minimal overhead, making it viable for universal quantum computation.
Recently it was realized that linear optics and photo-detectors with feedback can be used for theoretically efficient quantum information processing. The first of three steps toward efficient linear optics quantum computation (eLOQC) was to design a simple non-deterministic gate, which upon post-selection based on a measurement result implements a non-linear phase shift on one mode. Here a computational strategy is given for finding non-deterministic gates for bosonic qubits with helper photons. A more efficient conditional sign flip gate is obtained.
We consider the realization of quantum Fredkin gate with only linear optics and single photons. First we construct a heralded Fredkin gate using four heralded controlled-not (CNOT) gates. Then we simplify this method to a post-selected one utilizing only two CNOT gates. We also give a possible realization of this method which is feasible with current experimental technology. Another post-selected scheme requires time entanglement of the input photons but needs no ancillary photons.
We report the characterization of a universal set of logic gates for one-way quantum computing using a four-photon `star' cluster state generated by fusing photons from two independent photonic crystal fibre sources. We obtain a fidelity for the cluster state of 0.66 +/- 0.01 with respect to the ideal case. We perform quantum process tomography to completely characterize a controlled-NOT, Hadamard and T gate all on the same compact entangled resource. Together, these operations make up a universal set of gates such that arbitrary quantum logic can be efficiently constructed from combinations o…
We demonstrate a new architecture for an optical entangling gate that is significantly simpler than previous realisations, using partially-polarising beamsplitters so that only a single optical mode-matching condition is required. We demonstrate operation of a controlled-Z gate in both continuous-wave and pulsed regimes of operation, fully characterising it in each case using quantum process tomography. We also demonstrate a fully-resolving, nondeterministic optical Bell-state analyser based on this controlled-Z gate. This new architecture is ideally suited to guided optics implementations of …
We propose a scheme to perform probabilistic quantum gates on remote trapped atom qubits through interference of optical frequency qubits. The method does not require localization of the atoms to the Lamb-Dicke limit, and is not sensitive to interferometer phase instabilities. Such probabilistic gates can be used for scalable quantum computation.
Aiming the construction of quantum computers and quantum communication systems based on optical devices, in this work we present possible implementations of quantum and classical CNOTs gates, as well an optical setup for generation and distribution of bipartite entangled states, using linear optical devices and photon number quantum non-demolition measurement.
We demonstrate the use of optimal control to design two entropy-manipulating quantum gates which are more complex than the corresponding, commonly used, gates, such as CNOT and Toffoli (CCNOT): A 2-qubit gate called PE (polarization exchange) and a 3-qubit gate called COMP (polarization compression) were designed using GRAPE, an optimal control algorithm. Both gates were designed for a three-spin system. Our design provided efficient and robust NMR radio frequency (RF) pulses for 13C2-trichloroethylene (TCE), our chosen three-spin system. We then experimentally applied these two quantum gates …
QSCOUT's Qubit-Boson Gate Set
QSCOUT开发了用于混合CV-DV量子计算的量子比特-玻色子门集，通过Jaqal™阐述在QSCOUT上利用这些门的方法。
Fast, robust and laser-free universal entangling gates for trapped-ion quantum computing
本文提出并验证了一种无需激光的囚禁离子双量子比特纠缠门，通过相位调制连续场实现双重修饰态，兼具高速度与抗噪性，显著提升相干时间且利于大规模扩展。
We describe the construction of a conditional quantum control-not (CNOT) gate from linear optical elements following the program of Knill, Laflamme and Milburn [Nature {\bf 409}, 46 (2001)]. We show that the basic operation of this gate can be tested using current technology. We then simplify the scheme significantly.
We present a linear-optical scheme for a controlled-phase gate with tunable phase shift programmed by a qubit state. In contrast to all previous tunable controlled-phase gates, the phase shift is not hard-coded into the optical setup, but can be tuned to any value from 0 to pi by the state of a so-called program qubit. Our setup is feasible with current level of technology using only linear-optical components. We provide an experimental feasibility study to assess the gate's implementability. We also discuss options for increasing the success probability up to 1/12 which approaches the success…
Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are implemented via single-site measurements on a fixed universal resource state. Here we adapt the randomized benchmarking protocol for a single qubit to a linear cluster state computation, which provides partial, yet efficient characterization of the noise associated with the target gate set. Applying randomized benchmarking to measurement-based quantum computation exh…
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP g…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。