Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer

• URL: http://arxiv.org/abs/2112.14589v3
• Date: Fri, 11 Feb 2022 04:09:31 GMT
• Title: Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
• Authors: T. M. Graham, Y. Song, J. Scott, C. Poole, L. Phuttitarn, K. Jooya, P. Eichler, X. Jiang, A. Marra, B. Grinkemeyer, M. Kwon, M. Ebert, J. Cherek, M. T. Lichtman, M. Gillette, J. Gilbert, D. Bowman, T. Ballance, C. Campbell, E. D. Dahl, O. Crawford, N. S. Blunt, B. Rogers, T. Noel, and M. Saffman
• Abstract summary: Neutral atom hyperfine qubits provide inherent scalability due to their identical characteristics, long coherence times, and ability to be trapped in dense multi-dimensional arrays. We demonstrate several quantum algorithms on a programmable gate model neutral atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to their identical characteristics, long coherence times, and ability to be trapped in dense multi-dimensional arrays\cite{Saffman2010}. Combined with the strong entangling interactions provided by Rydberg states\cite{Jaksch2000,Gaetan2009,Urban2009}, all the necessary characteristics for quantum computation are available. Here we demonstrate several quantum algorithms on a programmable gate model neutral atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits. Preparation of entangled Greenberger-Horne-Zeilinger (GHZ) states\cite{Greenberger1989} with up to 6 qubits, quantum phase estimation for a chemistry problem\cite{Aspuru-Guzik2005}, and the Quantum Approximate Optimization Algorithm (QAOA)\cite{Farhi2014} for the MaxCut graph problem are demonstrated. These results highlight the emergent capability of neutral atom qubit arrays for universal, programmable quantum computation, as well as preparation of non-classical states of use for quantum enhanced sensing.

Related papers

• Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
  Quantum computers have the potential to solve intractable problems. One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems. In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
  arXiv  Detail & Related papers  (2024-06-05T18:00:01Z)
• 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)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Stochastic emulation of quantum algorithms [0.0]
  We introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares basic properties of quantum mechanical states needed for a quantum algorithm. We prove that the propagation via the map built from those universal maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of emulation.
  arXiv  Detail & Related papers  (2021-09-16T07:54:31Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Numerical hardware-efficient variational quantum simulation of a soliton solution [0.0]
  We discuss the capabilities of quantum algorithms with special attention paid to a hardware-efficient variational eigensolver. A delicate interplay between magnetic interactions allows one to stabilize a chiral state that destroys the homogeneity of magnetic ordering. We argue that, while being capable of correctly reproducing a uniform magnetic configuration, the hardware-efficient ansatz meets difficulties in providing a detailed description to a noncollinear magnetic structure.
  arXiv  Detail & Related papers  (2021-05-13T11:58:18Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator [41.74498230885008]
  We demonstrate a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms. We benchmark the system by creating and characterizing high-fidelity antiferromagnetically ordered states. We then create and study several new quantum phases that arise from the interplay between interactions and coherent laser excitation.
  arXiv  Detail & Related papers  (2020-12-22T19:00:04Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Quantum computing with neutral atoms [0.0]
  We review the main characteristics of neutral atom quantum processors from atoms / qubits to application interfaces. We show how applications ranging from optimization challenges to simulation of quantum systems can be explored. We give evidence of the intrinsic scalability of neutral atom quantum processors in the 100-1,000 qubits range.
  arXiv  Detail & Related papers  (2020-06-22T15:09:01Z)

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.