Toward a M{\o}lmer S{\o}rensen Gate With .9999 Fidelity

• URL: http://arxiv.org/abs/2311.15958v1
• Date: Mon, 27 Nov 2023 16:02:48 GMT
• Title: Toward a M{\o}lmer S{\o}rensen Gate With .9999 Fidelity
• Authors: Reinhold Bl\"umel, Andrii Maksymov, Ming Li
• Abstract summary: Fault-tolerant quantum computing at reasonable overhead requires two-qubit gates with the highest possible fidelity. We show that even under noise-free, ideal conditions, neglecting the carrier term and linearizing the Lamb-Dicke term in the Hamiltonian used for control-pulse construction are not justified.
• Score: 5.830420622355277
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Realistic fault-tolerant quantum computing at reasonable overhead requires two-qubit gates with the highest possible fidelity. Typically, an infidelity of $\lesssim 10^{-4}$ is recommended in the literature. Focusing on the phase-sensitive architecture used in laboratories and by commercial companies to implement quantum computers, we show that even under noise-free, ideal conditions, neglecting the carrier term and linearizing the Lamb-Dicke term in the Hamiltonian used for control-pulse construction for generating M{\o}lmer-S{\o}rensen XX gates based on the Raman scheme are not justified if the goal is an infidelity target of $10^{-4}$. We obtain these results with a gate simulator code that, in addition to the computational space, explicitly takes the most relevant part of the phonon space into account. With the help of a Magnus expansion carried to the third order, keeping terms up to the fourth order in the Lamb-Dicke parameters, we identify the leading sources of coherent errors, which we show can be eliminated by adding a single linear equation to the phase-space closure conditions and subsequently adjusting the amplitude of the control pulse (calibration). This way, we obtain XX gates with infidelities $< 10^{-4}$.

Related papers

• Scalable quantum circuits for exponential of Pauli strings and Hamiltonian simulations [0.0]
  We design quantum circuits for the exponential of scaled $n$-qubit Pauli strings using single-qubit rotation gates, Hadamard gate, and CNOT gates. A key result we derive is that any two Pauli-string operators composed of identity and $X$ gates are permutation similar. We apply these circuit models to approximate unitary evolution for several classes of Hamiltonians using the Suzuki-Trotter approximation.
  arXiv  Detail & Related papers  (2024-05-22T12:57:09Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Quantum control landscape for generation of $H$ and $T$ gates in an open qubit with both coherent and environmental drive [57.70351255180495]
  An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$) Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
  arXiv  Detail & Related papers  (2023-09-05T09:05:27Z)
• Error per single-qubit gate below $10^{-4}$ in a superconducting qubit [14.29906536440178]
  We fabric a transmon qubit with long coherence times and demonstrate single-qubit gates with the average gate error below $10-4$. The demonstration extends the upper limit that the average fidelity of single-qubit gates can reach in a transmon-qubit system.
  arXiv  Detail & Related papers  (2023-02-17T04:43:38Z)
• Gate Error Analysis of Tunable Coupling Architecture in the Large-scale Superconducting Quantum System [1.046632165836774]
  We show that the optimal single- parameter pulse achieved the gate error on the order of $10-4$ for the 40 ns controlled-Z gate in the 4-qubit system. Our study provides software-oriented and hardware-level guidelines for building a large-scale fault-tolerant quantum system.
  arXiv  Detail & Related papers  (2022-12-08T12:43:57Z)
• Robustness of a universal gate set implementation in transmon systems via Chopped Random Basis optimal control [50.591267188664666]
  We numerically study the implementation of a universal two-qubit gate set, composed of CNOT, Hadamard, phase and $pi/8$ gates, for transmon-based systems. The control signals to implement such gates are obtained using the Chopped Random Basis optimal control technique, with a target gate infidelity of $10-2$.
  arXiv  Detail & Related papers  (2022-07-27T10:55:15Z)
• Phase Estimation of Local Hamiltonians on NISQ Hardware [6.0409040218619685]
  We investigate a binned version of Quantum Phase Estimation (QPE) set out by [Somma 2019] and known as the Quantum Eigenvalue Estimation Problem (QEEP) Within this framework, we find that our techniques reduce the threshold at which it becomes possible to perform the minimum two-bin instance of this algorithm by an order of magnitude. We propose an application, which we call Randomized Quantum Eigenvalue Estimation Problem (rQeep)
  arXiv  Detail & Related papers  (2021-10-26T11:33:54Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms [1.9240845160743125]
  We demonstrate a continuous two-qubit gate set that can provide a 3x reduction in circuit depth as compared to a standard decomposition. We benchmark the fidelity of the iSWAP-like and CPHASE gate families as well as 525 other fSim gates spread evenly across the entire fSim parameter space.
  arXiv  Detail & Related papers  (2020-01-23T02:12:45Z)

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.