Scalable quantum computation with fast gates in two-dimensional
microtrap arrays of trapped ions
- URL: http://arxiv.org/abs/2005.00367v2
- Date: Thu, 2 Jul 2020 06:32:24 GMT
- Title: Scalable quantum computation with fast gates in two-dimensional
microtrap arrays of trapped ions
- Authors: Zain Mehdi and Alexander K. Ratcliffe and Joseph J. Hope
- Abstract summary: We investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture.
We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighbouring traps faster than the trapping period.
- Score: 68.8204255655161
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We theoretically investigate the use of fast pulsed two-qubit gates for
trapped ion quantum computing in a two-dimensional microtrap architecture. In
one dimension, such fast gates are optimal when employed between nearest
neighbours, and we examine the generalisation to a two-dimensional geometry. We
demonstrate that fast pulsed gates are capable of implementing high-fidelity
entangling operations between ions in neighbouring traps faster than the
trapping period, with experimentally demonstrated laser repetition rates.
Notably, we find that without increasing the gate duration, high-fidelity gates
are achievable even in large arrays with hundreds of ions. To demonstrate the
usefulness of this proposal, we investigate the application of these gates to
the digital simulation of a 40-mode Fermi-Hubbard model. This also demonstrates
why shorter chains of gates required to connect arbitrary pairs of ions makes
this geometry well suited for large-scale computation.
Related papers
- Pairwise-parallel entangling gates on orthogonal modes in a trapped-ion
chain [0.0]
parallel operations are important for both near-term quantum computers and larger-scale fault-tolerant machines.
We propose and implement a pairwise-parallel gate scheme on a trapped-ion quantum computer.
We demonstrate the utility of this scheme by creating a GHZ state in one step using parallel gates with one overlapping qubit.
arXiv Detail & Related papers (2023-02-17T21:12:14Z) - Fast Ion Gates Outside the Lamb-Dicke Regime by Robust Quantum Optimal
Control [16.769083043152627]
We present a quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.
The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of the ions to create phonon-mediated entangling gates.
Our approach represents a step in speeding up quantum gates to achieve larger quantum circuits for quantum computation and simulation.
arXiv Detail & Related papers (2022-09-20T11:14:00Z) - Extensible circuit-QED architecture via amplitude- and
frequency-variable microwaves [52.77024349608834]
We introduce a circuit-QED architecture combining fixed-frequency qubits and microwave-driven couplers.
Drive parameters appear as tunable knobs enabling selective two-qubit coupling and coherent-error suppression.
arXiv Detail & Related papers (2022-04-17T22:49:56Z) - High fidelity two-qubit gates on fluxoniums using a tunable coupler [47.187609203210705]
Superconducting fluxonium qubits provide a promising alternative to transmons on the path toward large-scale quantum computing.
A major challenge for multi-qubit fluxonium devices is the experimental demonstration of a scalable crosstalk-free multi-qubit architecture.
Here, we present a two-qubit fluxonium-based quantum processor with a tunable coupler element.
arXiv Detail & Related papers (2022-03-30T13:44:52Z) - Coherent effects contribution to a fast gate fidelity in ion quantum
computer [47.187609203210705]
We develop a numerical model for full simulation of coherence effects using a linear ion microtrap array and a 2D microtrap array.
We have also studied the dependency of the gate fidelity on the laser power fluctuations.
arXiv Detail & Related papers (2021-12-12T12:53:00Z) - Fast high-fidelity geometric gates for singlet-triplet qubits [1.0312968200748118]
We show that the fast geometric gate can be realized for singlet-triplet qubits without introducing an extra microwave-driven pulse.
Our scheme is particularly applied to singlet-triplet qubits to obtain fast and high-fidelity geometric gates.
arXiv Detail & Related papers (2021-11-15T12:21:56Z) - Accurate methods for the analysis of strong-drive effects in parametric
gates [94.70553167084388]
We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach.
We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
arXiv Detail & Related papers (2021-07-06T02:02:54Z) - Ultra-fast two-qubit ion gate using sequences of resonant pulses [0.0]
We propose a new protocol to implement ultra-fast two-qubit phase gates with trapped ions using spin-dependent kicks induced by resonant transitions.
Such gates allow us to increase the number of gate operations that can be completed within the coherence time of the ion-qubits.
arXiv Detail & Related papers (2020-07-01T20:14:47Z) - A two-dimensional architecture for fast large-scale trapped-ion quantum
computing [0.0]
We propose an architecture for large-scale quantum computing with a two-dimensional array of atomic ions trapped at such large distance.
Using gate operations far outside of the Lamb-Dicke region, we show that fast and robust entangling gates can be realized in any large ion arrays.
arXiv Detail & Related papers (2020-04-24T09:17:40Z) - Fast entangling gates in long ion chains [62.997667081978825]
We present a model for implementing fast entangling gates with ultra-fast pulses in arbitrarily long ion chains.
We find that achievable gate fidelity is independent of the number of ions in the chain.
We find that population transfer efficiencies of above $99.9%$ from individual ultra-fast pulses is the threshold for realising high-fidelity gates.
arXiv Detail & Related papers (2020-04-09T05:32:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.