Parametrized multiqubit gate design for neutral-atom based quantum platforms

• URL: http://arxiv.org/abs/2411.19785v1
• Date: Fri, 29 Nov 2024 15:47:19 GMT
• Title: Parametrized multiqubit gate design for neutral-atom based quantum platforms
• Authors: Madhav Mohan, Julius de Hond, Servaas Kokkelmans,
• Abstract summary: A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. Parametrized gates in particular have found use in both near-term algorithms and circuit compilation.
• Score: 0.0
• License:
• Abstract: A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer from various sources of error that propagate with the circuit depth. Parametrized gates in particular have found use in both near-term algorithms and circuit compilation. The one- and two-qubit versions of these gates have been demonstrated on various computing architectures. The neutral atom platform has the capability to implement native $N$-qubit gates (for $N \geq 2$). However, one needs to first find the control functions that implement these gates on the hardware. We study the numerical optimization of neural networks towards obtaining families of controls $-$ laser pulses to excite an atom to Rydberg states $-$ that implement phase gates with one and two controls, the $\mathrm{C_1P}$ and $\mathrm{C_2P}$ gates respectively, on neutral atom hardware. The pulses we obtain have a duration significantly shorter than the loss time scale, set by decay from the Rydberg state. Further, they do not require single-site addressability and are smooth. Hence, we expect our gates to have immediate benefits for quantum algorithms implemented on current neutral atom hardware.

Related papers

• Efficient compilation of quantum circuits using multi-qubit gates [0.0]
  We present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit entangling gates. We numerically test our compilation and show that, compared to conventional realizations with two-qubit gates, our compilations improves the logarithm of quantum volume by $20%$ to $25%$.
  arXiv  Detail & Related papers  (2025-01-28T19:08:13Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing [8.478982715648547]
  Scheme for qubits with $XX+YY$ coupling realizes any two-qubit gate up to single-qubit gates. We observe marked improvements across various applications, including generic $n$-qubit gate synthesis, quantum volume, and qubit routing.
  arXiv  Detail & Related papers  (2023-12-09T19:30:31Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Approaching the theoretical limit in quantum gate decomposition [0.0]
  We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
  arXiv  Detail & Related papers  (2021-09-14T15:36:22Z)
• Systematic error tolerant multiqubit holonomic entangling gates [11.21912040660678]
  We propose to realize high-fidelity holonomic $(N+1)$-qubit controlled gates using Rydberg atoms confined in optical arrays or superconducting circuits. Our study paves a new route to build robust multiqubit gates with Rydberg atoms trapped in optical arrays or with superconducting circuits.
  arXiv  Detail & Related papers  (2020-12-05T03:00:47Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.