Efficient Long-Range Entanglement Using Dynamic Circuits

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 nonunitary, 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: controlled- gate teleportation between up to 101 qubits by feeding forward 99 midcircuit measurement outcomes, and the preparation of Greenberger–Horne–Zeilinger 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. Published by the American Physical Society 2024

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2024-08-22
DOI
https://doi.org/10.1103/prxquantum.5.030339
Citations
90
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
29.87
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Long-Range Entanglement Using Dynamic Circuits

V.K. Tripathi, Zlatko Minev, Elisa Bäumer, Swarnadeep Majumder et al.
90 citations
PRX Quantum
Quantum Computing Algorithms and Architecture
29.87
article

Efficient Long-Range Entanglement Using Dynamic Circuits

V.K. Tripathi, Zlatko Minev, Elisa Bäumer, Swarnadeep Majumder, Alireza Seif, Patrick Rall, Derek S. Wang, Edward H. Chen
article en
90 citations

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 nonunitary, 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: controlled- gate teleportation between up to 101 qubits by feeding forward 99 midcircuit measurement outcomes, and the preparation of Greenberger–Horne–Zeilinger 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. Published by the American Physical Society 2024

PRX QuantumVol. 5(3)
University of Southern California (US), Research Triangle Park Foundation (US), IBM (United States) (US), California Southern University (US), IBM Research - Almaden (US), Triangle (US), IBM Research - Zurich (CH)
Openalex Percentile: Top 0%
Quantum Computing Algorithms and Architecture
29.87
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.