Optimal Two-Qubit Gate-Cutting Cost and Measures of Nonlocality
Abstract
Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead. Gate-cutting provides one such approach by replacing nonlocal gates with quasiprobability decompositions of local operations. Starting from the known optimal two-qubit gate-cutting formula, we derive complete sharp lower and upper envelopes relating the quasiprobability extent $γ$ to five established descriptors: entangling power, gate typicality, operator entanglem...
Description / Details
Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead. Gate-cutting provides one such approach by replacing nonlocal gates with quasiprobability decompositions of local operations. Starting from the known optimal two-qubit gate-cutting formula, we derive complete sharp lower and upper envelopes relating the quasiprobability extent to five established descriptors: entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence. We recast as a Rényi- functional of the operator-Schmidt spectrum and show how the physical constraints on two-qubit spectra sharpen generic entropy bounds and select a small set of recurring extremal Cartan families. None of the five descriptors generically determines alone, but each imposes exact constraints, revealing how substantially the optimal gate-cutting cost can vary between gates with similar nonlocal characteristics.
Source: arXiv:2609.30141v1 - http://arxiv.org/abs/2609.30141v1 PDF: https://arxiv.org/pdf/2609.30141v1 Original Link: http://arxiv.org/abs/2609.30141v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Sep 25, 2026
Quantum Computing
Quantum Physics
0