pith. sign in

arxiv: 2406.07884 · v3 · pith:C54UBKKOnew · submitted 2024-06-12 · 🪐 quant-ph · cs.LG

Reinforcement Learning to Disentangle Multiqubit Quantum States from Partial Observations

classification 🪐 quant-ph cs.LG
keywords quantumdisentanglingstatesagentstatecircuitsgatesqubit
0
0 comments X
read the original abstract

Using partial knowledge of a quantum state to control multiqubit entanglement is a largely unexplored paradigm in the emerging field of quantum interactive dynamics with the potential to address outstanding challenges in quantum state preparation and compression, quantum control, and quantum complexity. We present a deep reinforcement learning (RL) approach using an actor-critic algorithm for constructing short disentangling circuits for states with up to 16 qubits. With access to only two-qubit reduced density matrices, our agent decides which pairs of qubits to apply two-qubit gates on; requiring only local information makes it directly applicable on modern NISQ devices, as we demonstrated experimentally on a trapped-ion quantum computer. Utilizing a permutation-equivariant transformer architecture, the agent can autonomously identify qubit permutations within the state, and adjusts the disentangling protocol accordingly. Once trained, it provides circuits from different initial states without further optimization. We demonstrate the agent's ability to identify and exploit the entanglement structure of multi-qubit states. We analyze the disentangling circuits constructed by the agent for 4- and 5-qubit Haar-random states, and observe strong correlations between consecutive gates and among the qubits involved. Through extensive benchmarking, we show the efficacy of the RL approach to find disentangling protocols with minimal gate resources. We explore the resilience of our trained agents to noise, highlighting their potential for real-world quantum computing applications. Analyzing optimal disentangling protocols, we report a general circuit to prepare an arbitrary 4-qubit state using at most 5 two-qubit (10 CNOT) gates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Disentangling strategies and entanglement transitions in unitary circuit games with matchgates

    quant-ph 2025-07 unverdicted novelty 7.0

    Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and gene...

  2. Learning quantum disentanglement scheduling from reduced states via modular hybrid policies

    quant-ph 2026-04 unverdicted novelty 6.0

    A hybrid policy with classical preprocessing and a parameterized quantum circuit learns effective multiqubit disentanglement scheduling from partial two-qubit reduced-state observations, with preprocessing dominating ...