An Orbit-qubit Quantum Processor of Ultracold Atoms

• URL: http://arxiv.org/abs/2509.10797v2
• Date: Sat, 20 Sep 2025 03:04:00 GMT
• Title: An Orbit-qubit Quantum Processor of Ultracold Atoms
• Authors: Ming-Gen He, Wei-Yong Zhang, Zhen-Sheng Yuan, Jian-Wei Pan,
• Abstract summary: We introduce a new quantum processor incorporating orbit-qubit encoding and internal states.<n>We generate one-dimensional and two-dimensional cluster states using minimal layers of controlled-Z gates.<n>Our results establish orbit-qubit optical lattices as a scalable quantum processing architecture.
• Score: 0.1399948157377307
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is challenging to build scalable quantum processors capable of both parallel control and local operation. As a promising platform to overcome this challenge, optical lattices offer exceptional parallelism. However, it has been struggling with precise local operations due to relatively narrow lattice spacings. Here, we introduce a new quantum processor incorporating orbit-qubit encoding and internal states (as auxiliary degrees of freedom) to achieve spatially selective operations together with parallel control. With this processor, we generate one-dimensional and two-dimensional cluster states using minimal layers of controlled-Z gates. We experimentally detect the multipartite entanglement of a two-dimensional cluster state involving 123 orbit qubits through direct stabilizer measurements, verifying the full bipartite non-separability. Furthermore, we demonstrate measurement-based quantum computation by implementing single-qubit and two-qubit logical gates, highlighting the flexibility of orbit-qubit operations. Our results establish orbit-qubit optical lattices as a scalable quantum processing architecture, opening new pathways for quantum computation applications.

Related papers

• Parallel Quantum Gates via Scalable Subsystem-Optimized Robust Control [9.72599396930123]
  Crosstalk between qubits impedes the achievement of high gate fidelities and renders full Hilbert-space control optimization prohibitively difficult.<n>Here, we overcome this challenge by reducing the full-system optimization to crosstalk-robust control over constant-sized subsystems.<n>Within this framework, we construct analytical pulse solutions for parallel single-qubit gates and numerical pulses for parallel multi-qubit operations.
  arXiv  Detail & Related papers  (2026-01-05T10:50:40Z)
• Realization of Thread Level Parallelism on Quantum Devices [0.052118759008482306]
  We introduce a classical linkage scheme that merges multiple independent quantum processing units (QPUs) into a single logical device.<n>We validate this architecture on clusters comprising up to sixteen benchtop nuclear magnetic resonance (NMR) quantum nodes.<n>Our results demonstrate that classical links suffice to scale up the logical size of quantum computations and realize general, non-unitary channels on today's hardware.
  arXiv  Detail & Related papers  (2025-11-07T17:12:41Z)
• Scalable modular architecture for universal quantum computation [49.1574468325115]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>Our proof provides a template to build up modular QPUs from smaller building blocks with reduced numbers of local controls and couplings.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• Scalable quantum simulator with an extended gate set in giant atoms [0.0]
  We propose a scalable quantum simulator with an extended gate set based on giant-atom three-level systems.<n>By leveraging this tunability, our setup supports both CZ and iSWAP gates through simple frequency adjustments.<n>As a demonstration, we showcase the simulation of spin dynamics in dissipative Heisenberg XXZ spin chains.
  arXiv  Detail & Related papers  (2025-03-06T15:22:37Z)
• Bidirectional controlled quantum state preparation in high-dimensional quantum system [0.0]
  High-dimensional quantum system exhibits unique advantages over the qubit system in some quantum information processing tasks.<n>We present a program for implementing bidirectional deterministic controlled remote quantum state preparation.<n>The evaluation of the performance shows that if the quNit is encoded in the spatial mode of single photons, our scheme can be accomplished solely using only linear optical elements.
  arXiv  Detail & Related papers  (2025-01-06T12:54:02Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Experimental Realization of Two Qutrits Gate with Tunable Coupling in Superconducting Circuits [11.881366909450376]
  Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. One of the essential elements for qutrit-based quantum computation, two-qutrit quantum gate, remains a major challenge. We propose and demonstrate a highly efficient and scalable two-qutrit quantum gate in superconducting quantum circuits.
  arXiv  Detail & Related papers  (2022-06-22T16:33:58Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• 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)
• 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)

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.