Programmable Quantum Matter: Heralding Large Cluster States in Driven Inhomogeneous Spin Ensembles

• URL: http://arxiv.org/abs/2509.02992v1
• Date: Wed, 03 Sep 2025 03:59:22 GMT
• Title: Programmable Quantum Matter: Heralding Large Cluster States in Driven Inhomogeneous Spin Ensembles
• Authors: Pratyush Anand, Louis Follet, Odiel Hooybergs, Dirk R. Englund,
• Abstract summary: Atom-like emitters in solids are promising platforms for quantum sensing and information processing.<n>We present a framework that leverages this diversity to reduce the resources for generating optically heralded spin cluster states.<n>An optimized pulse sequence simultaneously corrects pulse-length and detuning errors, achieving single-qubit gate fidelities exceeding $99.99%$ for errors.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Atom-like emitters in solids are promising platforms for quantum sensing and information processing, but inhomogeneities in the emitter fine structure complicate quantum control. We present a framework that leverages this diversity to reduce the resources for generating optically heralded spin cluster states across $N_q$ emitters from the conventional order $O(N_q)$ to $O(1)$ in ensembles of $N_q \sim 10$-$100$. An optimized pulse sequence simultaneously corrects pulse-length and detuning errors, achieving single-qubit gate fidelities exceeding $99.99\%$ for errors (normalized relative to the Rabi drive strength) up to 0.3, while maintaining fidelities above $99\%$ for errors as large as 0.4. Applied as a Carr-Purcell-Meiboom-Gill (CPMG) dynamical decoupling protocol to the dominant noise spectrum of silicon-vacancy centers in diamond, it enhances ensemble coherence times by over $7\times$ compared to interleaved bang-bang based CPMG. For state-of-the-art dilution refrigerators, global resonant optimal decoupling across $N_q$ spins sharply reduces heating, addressing the trade-off between the spin coherence and scaling to $N_q \gg 1$. We further introduce a modified single-photon entanglement protocol with an efficient algorithm for deterministic entanglement compilation. Depending on the decoupling time window, our method yields order $O(10^2$-$10^4)$ more entanglement links than bang-bang sequences, with theoretical guarantees of order $\Omega(N_q)$ unique links, improvable by control tuning. Together, these techniques provide scalable tools - including global control, phase denoising, remote entanglement, and compilation - for robust quantum computing architectures with heterogeneous spin ensembles.

Related papers

• Intelligent Control of Collisional Architectures for Deterministic Multipartite State Engineering [0.0]
  We introduce an intelligent, constraint-aware control framework for deterministic generation of symmetric Dicke states $|D_n(m)rangle$ in repeated excitation-within-interaction architectures.<n>The protocol employs partialSWAP collisions between two disjoint qubit registers, mediated by $m$ ancillary shuttle'' qubits, and poses Dickestate preparation as a emph-loop design problem.
  arXiv  Detail & Related papers  (2026-02-09T11:15:32Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency [52.60557300927007]
  We present a $textbfMA-OSMA$ algorithm to transfer the discrete submodular problem into a continuous optimization.<n>We also introduce a projection-free $textbfMA-OSEA$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution.<n>Our algorithms significantly improve the $(frac11+c)$-approximation provided by the state-of-the-art OSG algorithm.
  arXiv  Detail & Related papers  (2025-02-07T15:57:56Z)
• Non-Iterative Disentangled Unitary Coupled-Cluster based on Lie-algebraic structure [0.0]
  Fixed Unitary Coupled-Cluster (UCC) ans"atze are attractive for performing quantum chemistry Variational Quantumsolver (VQE) computations.<n>We introduce $k$-NI-DUCC, a fixed and Non-iterative Disentangled Unitary Coupled-Cluster compact ansatz.
  arXiv  Detail & Related papers  (2024-08-26T14:19:53Z)
• 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)
• High-rate and high-fidelity modular interconnects between neutral atom quantum processors [0.0]
  We propose an experimental protocol for generating entanglement between neutral ytterbium atom qubits using an optical cavity. A twisted ring cavity geometry suppresses many sources of error, allowing high fidelity entanglement generation. We estimate a spin-photon entanglement rate of $5 times 105$ s$-1$, and a Bell pair rate of $1.0times 105$ s$-1$, with an average fidelity near $0.999$.
  arXiv  Detail & Related papers  (2024-01-08T18:26:19Z)
• $N$ Scaling of Large-Sample Collective Decay in Inhomogeneous Ensembles [44.99833362998488]
  We experimentally study collective decay of an extended disordered ensemble of $N$ atoms inside a hollow-core fiber. We observe up to $300$-fold enhanced decay rates, strong optical bursts and a coherent ringing.
  arXiv  Detail & Related papers  (2023-07-21T14:43:29Z)
• Universal logic with encoded spin qubits in silicon [1.5796098351442824]
  Qubits encoded in a decoherence-free subsystem and realized in exchange-coupled silicon quantum dots are promising candidates for fault-tolerant quantum computing. Key difficulties are that encoded entangling gates require a large number of control pulses and high-yielding quantum dot arrays. Here we show a device made using the single-layer etch-defined gate architecture that achieves both the required functional yield needed for full control and the coherence necessary for thousands of exchange pulses to be applied.
  arXiv  Detail & Related papers  (2022-02-08T02:23:46Z)
• Permutation Compressors for Provably Faster Distributed Nonconvex Optimization [68.8204255655161]
  We show that the MARINA method of Gorbunov et al (2021) can be considered as a state-of-the-art method in terms of theoretical communication complexity. Theory of MARINA to support the theory of potentially em correlated compressors, extends to the method beyond the classical independent compressors setting.
  arXiv  Detail & Related papers  (2021-10-07T09:38:15Z)

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.