Spin Chains for Quantum Information Processing

• URL: http://arxiv.org/abs/2605.08402v1
• Date: Fri, 08 May 2026 19:09:02 GMT
• Title: Spin Chains for Quantum Information Processing
• Abstract summary: We show that a protocol based on virtual excitations and optimized boundary couplings consistently outperforms its counterpart in speed, achieved entanglement, and robustness against fabrication imperfections and noise.<n>The characteristics of the virtual-coupling protocol highlight its potential for experimental implementation in scalable quantum technologies.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical computation relies heavily on information manipulation. Each component of a hardware needs to communicate with others, and this is done by encoding information into strings of bits and application of logical operations. When dealing with quantum technologies, there arises a new set of paradigms and devices, based on manipulations of qubits, the quantum analogues of conventional bits. This work investigates the generation and distribution of quantum entanglement, a uniquely non-classical correlation, across spin chains, which serve as promising platforms for quantum information processing. We systematically compare two distinct entanglement generation protocols: Protocol 1 (P1), based on alternating weak and strong couplings that create a band structure enabling an effective trimer-model approximation, and Protocol 2 (P2), which employs symmetric boundary couplings and virtual excitations to establish a direct effective interaction between the chain ends. Our results demonstrate that a protocol based on virtual excitations and optimized boundary couplings consistently outperforms its counterpart in speed, achieved entanglement, and robustness against fabrication imperfections and noise. Furthermore, by employing effective model reductions and open quantum systems techniques we provide a comprehensive framework for understanding the resilience of distributed entanglement in solid-state quantum devices. The characteristics of the virtual-coupling protocol highlight its potential for experimental implementation in scalable quantum technologies.

Related papers

• Spin Chain Quantum Communication on a Trapped-Ion Processor [0.0]
  We experimentally realize engineered quantum communication protocols through digitally simulated spin Hamiltonian on IonQ's Forte 1/ Forte Enterprise 1 processor.<n>We show that engineered interactions significantly enhance the fidelity of quantum state transfer.<n>Our results demonstrate that programmable quantum processors can effectively realize and efficiently implement quantum communication protocols.
  arXiv  Detail & Related papers  (2026-07-14T17:48:53Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States [1.589509357008938]
  We introduce four metrics which ascertain the quality of genuine multipartite quantum entanglement, along with circuit-level fidelity measures.<n>We devise simulations which combine expected hardware characteristics of spin-qubit devices with appropriate compilation techniques.<n>We find that sparsely-connected spin-qubit lattices can approach comparable values of our metrics to those of the most highly-connected device architecture.
  arXiv  Detail & Related papers  (2024-12-17T12:55:40Z)
• Benchmarking Emerging Cavity-Mediated Quantum Interconnect Technologies for Modular Quantum Computers [1.0653685964361501]
  This work presents a comparative analysis of the cavity-mediated interconnect technologies according to a defined figure of merit. We identify the configurations related to the cavity and atomic decay rates as well as the qubit-cavity coupling strength that meet the efficiency thresholds.
  arXiv  Detail & Related papers  (2024-07-22T14:11:20Z)
• Syncopated Dynamical Decoupling for Suppressing Crosstalk in Quantum Circuits [2.6107310251235876]
  We study the use of dynamical decoupling in characterizing and suppressing undesired two-qubit couplings.<n>We find sequences that protect against decoherence and selectively target unwanted two-qubit interactions.<n>The syncopated decoupling technique significantly boosts performance in a realistic algorithmic quantum circuit.
  arXiv  Detail & Related papers  (2024-03-12T17:18:35Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Characterizing crosstalk of superconducting transmon processors [0.0]
  We show how to efficiently and systematically characterize the magnitude of crosstalk effects on an entire quantum chip. We propose more accurate means to simulate noisy quantum hardware by devising an appropriate crosstalk-aware noise model.
  arXiv  Detail & Related papers  (2023-03-24T16:11:28Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• 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.