Pith. sign in

REVIEW 2 cited by

Measurement-Based Long-Range Entangling Gates in Constant Depth

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.03064 v1 pith:THIIOCRN submitted 2024-08-06 quant-ph

classification quant-ph
keywords quantumdepthlong-rangecnotcomputationsconstantfan-outgate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices due to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time, thus, also benefiting fault-tolerant quantum computations. Here, we show how to reduce the depth of quantum sub-routines that typically scale linearly with the number of qubits, such as quantum fan-out and long-range CNOT gates, to a constant depth using mid-circuit measurements and feed-forward operations, while only requiring a 1D line topology. We compare our protocols with existing ones to highlight their advantages. Additionally, we verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware, demonstrating significant improvements over their unitary implementations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Improving Quantum Optimization to Achieve Quadratic Time Complexity

    quant-ph 2025-01 conditional novelty 6.0 of 10

    Penta-O sets QAOA parameters level by level using five energy measurements per level, cutting parameter-setting cost to O(p^2) circuit executions for depth p.

  2. AC/DC: Automated Compilation for Dynamic Circuits

    quant-ph 2024-12 conditional novelty 6.0 of 10

    A numerical optimization framework automatically synthesizes dynamic quantum circuits for state and unitary preparation, achieving shallower circuits at the cost of extra ancillas and mid-circuit measurement errors.

Pith tools