Benchmarking the algorithmic performance of near-term neutral atom processors

• URL: http://arxiv.org/abs/2402.02127v1
• Date: Sat, 3 Feb 2024 11:55:02 GMT
• Title: Benchmarking the algorithmic performance of near-term neutral atom processors
• Authors: K. McInroy, N. Pearson and J. D. Pritchard
• Abstract summary: We present a characterization of the algorithmic performance of Rydberg atom quantum computers through device simulation. We consider three different quantum algorithm related tests, exploiting the ability to dynamically update qubit connectivity and multi-qubit gates. Our results indicate Rydberg atom processors are a highly competitive near-term platform which, bolstered by the potential for further scalability, can pave the way toward useful quantum computation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Neutral atom quantum processors provide a viable route to scalable quantum computing, with recent demonstrations of high-fidelity and parallel gate operations and initial implementation of quantum algorithms using both physical and logical qubit encodings. In this work we present a characterization of the algorithmic performance of near term Rydberg atom quantum computers through device simulation to enable comparison against competing architectures. We consider three different quantum algorithm related tests, exploiting the ability to dynamically update qubit connectivity and multi-qubit gates. We calculate a quantum volume of $\mathbf{\mathit{V_{Q}}=2^{9}}$ for 9 qubit devices with realistic parameters, which is the maximum achievable value for this device size and establishes a lower bound for larger systems. We also simulate highly efficient implementations of both the Bernstein-Vazirani algorithm with >0.95 success probability for 9 data qubits and 1 ancilla qubit without loss correction, and Grover's search algorithm with a loss-corrected success probability of 0.97 for an implementation of the algorithm using 6 data qubits and 3 ancilla qubits using native multi-qubit $\mathbf{CCZ}$ gates. Our results indicate Rydberg atom processors are a highly competitive near-term platform which, bolstered by the potential for further scalability, can pave the way toward useful quantum computation.

Related papers

• Codesigned counterdiabatic quantum optimization on a photonic quantum processor [6.079051215256144]
  We focus on the counterdiabatic protocol with a codesigned approach to implement this algorithm on a photonic quantum processor. We develop and implement an optimized counterdiabatic method by tackling the higher-order many-body interaction terms. We experimentally demonstrate the advantages of a codesigned mapping of counterdiabatic quantum dynamics for quantum computing on photonic platforms.
  arXiv  Detail & Related papers  (2024-09-26T15:08:19Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• 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)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• On proving the robustness of algorithms for early fault-tolerant quantum computers [0.0]
  We introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.
  arXiv  Detail & Related papers  (2022-09-22T21:28:12Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Quantum Algorithms in Cybernetics [0.0]
  A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. It allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and probability calculations. The choice of the right quantum circuit, based on the available hardware, would be the approach for maximizing the fidelity.
  arXiv  Detail & Related papers  (2021-03-10T09:19:12Z)
• Special-Purpose Quantum Processor Design [2.275405513780208]
  Full connectivity of qubits is necessary for most quantum algorithms. inserting swap gate to enable the two-qubit gates between uncoupled qubits significantly decreases the computation result fidelity. We propose a Special-Purpose Quantum Processor Design method that can design suitable structures for different quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-01T23:26:15Z)
• Scalable evaluation of quantum-circuit error loss using Clifford sampling [8.140947383885262]
  We use the quadratic error loss and the final-state fidelity loss to characterize quantum circuits. It is shown that these loss functions can be efficiently evaluated in a scalable way by sampling from Clifford-dominated circuits. Our results pave the way towards the optimization-based quantum device and algorithm design in the intermediate-scale quantum regime.
  arXiv  Detail & Related papers  (2020-07-20T11:51:36Z)

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.