The reviewed record of science sign in
Pith

arxiv: 2308.13065 · v2 · pith:RMZ5QM2C · submitted 2023-08-24 · quant-ph

Efficient Long-Range Entanglement using Dynamic Circuits

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:RMZ5QM2Crecord.jsonopen to challenge →

classification quant-ph
keywords circuitsdynamicentanglementlong-rangequantumdevicesefficientforward
0
0 comments X
read the original abstract

Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by non-unitary, dynamic circuits. These circuits exploit measurements alongside conditional feed-forward operations, providing a promising approach for long-range entangling gates, higher effective connectivity of near-term hardware, and more efficient state preparations. Here, we explore the utility of shallow dynamic circuits for creating long-range entanglement on large-scale quantum devices. Specifically, we study two tasks: CNOT gate teleportation between up to 101 qubits by feeding forward 99 mid-circuit measurement outcomes, and the preparation of Greenberger-Horne-Zeilinger (GHZ) states with genuine entanglement. In the former, we observe that dynamic circuits can outperform their unitary counterparts. In the latter, by tallying instructions of compiled quantum circuits, we provide an error budget detailing the obstacles that must be addressed to unlock the full potential of dynamic circuits. Looking forward, we expect dynamic circuits to be useful for generating long-range entanglement in the near term on large-scale quantum devices.

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 3 Pith papers

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

  1. Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

    quant-ph 2026-04 unverdicted novelty 6.0

    A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the...

  2. Quantum computation at the edge of chaos

    quant-ph 2026-04 unverdicted novelty 6.0

    Topological entanglement entropy regularizes variational quantum algorithms to enforce quantum sparsity and operate at the edge of chaos for better trainability.

  3. Quantum computing with Qiskit

    quant-ph 2024-05 unverdicted novelty 1.0

    Qiskit is an open-source SDK that supports quantum circuit design, optimization at multiple abstraction levels, execution on hardware, and dynamic quantum-classical computations.