Optimal Two-Qubit Gate-Cutting Cost and Measures of Nonlocality
quant-ph
Submitted: 2026-09-24
Updated: 2026-09-24
Comments: 38 pages, 10 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead.
Terminology
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 entanglement, Schmidt strength, and maximum product-input concurrence. We recast γ as a Rényi- 1/2 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.
Sources
- Sharp Bounds Between Two R'enyi Entropies of Distinct Positive Orders
- Extremal Relations Between Shannon Entropy and $\ell_{\alpha}$-Norm
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians