Optimización de la Transmisión de Estados Cuánticos en Cadenas de Qubits usando Deep Reinforcement Learning y Algoritmos Genéticos

• URL: http://arxiv.org/abs/2510.05010v1
• Date: Mon, 06 Oct 2025 16:52:21 GMT
• Title: Optimización de la Transmisión de Estados Cuánticos en Cadenas de Qubits usando Deep Reinforcement Learning y Algoritmos Genéticos
• Authors: Sofía Perón Santana, Ariel Fiuri, Omar Osenda, Martín Domínguez,
• Abstract summary: Quantum state transfer via homogeneous spin chains plays a crucial role in building scalable quantum hardware.<n>A basic quantum state transmission protocol prepares a state in one qubit and transfers it to another through a channel, seeking to minimize the time and avoid information loss.<n>We approach this optimization problem using constant magnetic pulses and two complementary strategies: deep reinforcement learning and genetic algorithms.
• Score: 0.13999481573773073
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum state transfer (QST) via homogeneous spin chains plays a crucial role in building scalable quantum hardware. A basic quantum state transmission protocol prepares a state in one qubit and transfers it to another through a channel, seeking to minimize the time and avoid information loss. The fidelity of the process is measured by functions proportional to the transition probability between both states. We approach this optimization problem using constant magnetic pulses and two complementary strategies: deep reinforcement learning, where an agent learns pulse sequences through rewards, and genetic algorithms, which develop candidate solutions through selection and mutation. We analyze the efficiency of both methods and their ability to incorporate physical constraints.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Cavity Mediated Two-Qubit Gate: Tuning to Optimal Performance with NISQ Era Quantum Simulations [0.019999259391104387]
  We study the case of cavity mediated two-qubit gates.<n>We implement simulations with quantum circuits that are able to reliably track the dynamics of the system.<n>Our quantum algorithm, compatible with NISQ (Noisy Intermediate Scale Quantum) era systems, allows us to map out the fidelity of the state transfer operation between qubits.
  arXiv  Detail & Related papers  (2025-12-12T20:43:42Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Scalable quantum dynamics compilation via quantum machine learning [7.31922231703204]
  variational quantum compilation (VQC) methods employ variational optimization to reduce gate costs while maintaining high accuracy. We show that our approach exceeds state-of-the-art compilation results in both system size and accuracy in one dimension ($1$D) For the first time, we extend VQC to systems on two-dimensional (2D) strips with a quasi-1D treatment, demonstrating a significant resource advantage over standard Trotterization methods.
  arXiv  Detail & Related papers  (2024-09-24T18:00:00Z)
• 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)
• Attention-Based Deep Reinforcement Learning for Qubit Allocation in Modular Quantum Architectures [1.8781124875646162]
  This research contributes to the advancement of scalable quantum computing systems by introducing a novel learning-based approach for efficient quantum circuit compilation and mapping. In this work, we propose a novel approach employing Deep Reinforcement Learning (DRL) methods to learn theses for a specific multi-core architecture.
  arXiv  Detail & Related papers  (2024-06-17T12:09:11Z)
• Reinforcement Learning to Disentangle Multiqubit Quantum States from Partial Observations [0.0]
  We present a deep reinforcement learning approach to constructing short disentangling circuits for arbitrary 4-, 5-, and 6-qubit states. We demonstrate the agent's ability to identify and exploit the entanglement structure of multiqubit states. We report a general circuit to prepare an arbitrary 4-qubit state using at most 5 two-qubit (10 CNOT) gates.
  arXiv  Detail & Related papers  (2024-06-12T05:23:08Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Optimal remote restoring of quantum states in communication lines via local magnetic field [0.0]
  We study the remote restoring of a quantum state transferred along a spin chain We develop a remote state-restoring protocol which uses an inhomogeneous magnetic field with step-wise time-dependent Larmor frequencies as the state-control tool.
  arXiv  Detail & Related papers  (2024-01-17T19:46:39Z)
• Reinforcement learning pulses for transmon qubit entangling gates [0.0]
  We utilize a continuous-control reinforcement learning algorithm to design entangling two-qubit gates for superconducting qubits. We demonstrate the capability to generate novel pulse sequences that outperform the standard cross-resonance gates.
  arXiv  Detail & Related papers  (2023-11-07T03:19:19Z)
• 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)
• 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 Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)

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.