Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.30141

Optimal Two-Qubit Gate-Cutting Cost and Measures of Nonlocality

Michael Hart

quant-phSubmitted Sep 24, 2026• Announced Sep 25, 2026• 0 citations
arXivHTMLPDF

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.

AI Summary

The paper asks how much familiar scalar measures of two-qubit nonlocality constrain the optimal quasiprobability gate-cutting extent $\gamma$. It starts from the known optimum $\gamma=2(\sum_j\sqrt{p_j})^2-1=2^{H_{1/2}(\mathbf p)+1}-1$, where $\mathbf p$ is the normalized operator-Schmidt spectrum; standard sampling overhead scales as $\gamma^2$. It derives sharp minimum and maximum extents at fixed entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence. The entangling-power bounds are $1+3\sqrt{2e_{\mathrm p}}\leq\gamma\leq7$, with $0\leq e_{\mathrm p}\leq2/9$. For maximum concurrence, $1+2C_{\max}\leq\gamma\leq7$, implying the attainable perfect-entangler range $3\leq\gamma\leq7$. Controlled gates attain both lower envelopes; the iSWAP–SWAP family attains both upper envelopes. Gate typicality has piecewise envelopes, including an upper-family switch at $g_{\mathrm t}=4/9$. The spectral lower envelopes switch from controlled rank-two to pair-pair spectra at $E_{\mathrm{op}}=1/2$ and Schmidt strength one bit; fractional SWAP supplies both spectral upper envelopes. Proofs combine Cartan-coordinate optimization, existing entropy-extremality results, and the ordered physical-spectrum condition $p_{(1)}p_{(4)}\geq p_{(2)}p_{(3)}$, which excludes rank three and sharpens generic entropy bounds. Explicit gate families establish attainability of every boundary point. The results concern exact cutting of one ideal two-qubit unitary, not multiple gates, higher dimensions, or noisy or approximate decompositions. The envelopes need not describe filled attainable intervals: at zero entangling power or concurrence, only $\gamma\in\{1,7\}$ occurs. Interior attainable-set topology and joint-descriptor constraints remain open extensions.

Little sign of AI-generated textIncremental

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
38 pages, 10 figures

Related papers

Optimal Two-Qubit Gate-Cutting Cost and Measures of Nonlocality — E8 Intelligence Research

Andrew Stewart Caldin

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 character Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 13, 2026•0 citations

Cutting circuits with multiple two-qubit unitaries

Lukas Schmitt, Christophe Piveteau, David Sutter

Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits by replacing non-local gates with probabilistic mixtures of local gates. The cost of this method is a sampling overhead that scales exponentially in the number of cuts. It is crucial to determine the minimal cost for gate cutting and to understand whether allowing for classical communication between subcircuits can improve the sampling overhead. In this work, we derive a closed formula for the optimal sampling overhead for cutting an arbitrary number of two-qubit unitaries and provide the corresponding decomposition. We find that cutting several arbitrary two-qubit unitaries together is cheaper than cutting them individually and classical communication does not give any advantage.

arXiv:2312.11638•Quantum•Feb 18, 2025•39 citations

Optimal joint cutting of two-qubit rotation gates

Christian Ufrecht, Laura S. Herzog, Daniel D. Scherer +4 more

Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit rotation gates based on a virtual gate-teleportation protocol. With that, we significantly lower the previous upper bounds on the sampling overhead and prove the optimality of the scheme. Furthermore, we show that no classical communication between the circuit partitions is required. For parallel two-qubit rotation gates we derive an optimal ancilla-free decomposition, which includes cnot gates as a special case.

arXiv:2312.09679•Physical Review A•May 30, 2024•29 citations

On the Experimental Determination of Nonlocal Characteristics of Two-Qubit Gates

M. Karthick Selvan, S. Balakrishnan

In this paper, we discuss the experimental determination of the nonlocal characteristics of two-qubit gates. Based on the recently derived expressions for the entangling power and gate typicality of two-qubit gates, we construct two-qubit quantum circuits to measure the entangling power and gate typicality of the two-qubit gates, which are generated by the elements of the su(4) Cartan subalgebra. These elements describe the native interactions in many quantum processors. Hence, these circuits can be used to determine the nonlocal characteristics of native gates of many quantum processors. In each circuit, the native gate is applied twice. In addition, each circuit consists of at least one CNOT gate. A set of six two-qubit circuits is constructed to measure the entangling power. The number of circuits is further reduced to three by increasing the nonlocal resources (the number of CNOT gates). To measure the gate typicality, a set of three two-qubit circuits is constructed. Measurement of gate typicality requires more nonlocal resources than the measurement of entangling power.

quant-pharXiv:2607.11973•Jul 14, 2026•0 citations

Decomposition of Multi-Qubit Gates for Circuit Cutting

Ryota Tamura, Tomoya Kashimata, Yohei Hamakawa +2 more

A large-scale quantum circuit can be partitioned into multiple subcircuits through circuit cutting, where each subcircuit is executed multiple times and the expectation value of the original circuit is reconstructed by classical post-processing from their measurement (sampling) results. In this process, appropriate cut locations are identified after the user-designed quantum circuit, including multi-qubit gates that act on three or more qubits, has been decomposed into single-qubit gates and two-qubit gates such as the CNOT gate. Here, we present a method for reducing the sampling overhead, which refers to the increase in the number of samples required due to the cutting process, by modifying the decomposition strategy of multi-qubit gates. Using MCX and CCCX gates as representatives of multi-qubit gates, we demonstrate that the proposed decomposition method, which introduces a small number of ancilla qubits according to the identified cut locations, effectively decreases the sampling overhead.

quant-pharXiv:2603.26278•Mar 30, 2026•1 citation

All this for one qubit? Bounds on local circuit cutting schemes

Simon C. Marshall, Tura, Jordi, Vedran Dunjko

Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller computations. While this work is sometimes called circuit knitting or divide and quantum we generically refer to it as circuit cutting (CC). Much of the existing work has focused on the development of more efficient circuit cutting schemes, leaving open questions on the limits of what theoretically optimal schemes can achieve. We develop bounds by breaking up possible approaches into two distinct regimes: the first, where the input state and measurement are fixed and known, and the second, which requires a given cutting to work for a complete basis of input states and measurements. For the first case, it is easy to see that bounds addressing the efficiency of any approaches to circuit cutting amount to resolving BPP$\stackrel{?}{=}$BQP. We therefore restrict ourselves to a simpler question, asking what \textit{locally-acting} circuit cutting schemes can achieve, a technical restriction which still includes all existing circuit cutting schemes. In our first case we show that the existence of a locally-acting circuit cutting scheme which could efficiently partition even a single qubit from the rest of a circuit would imply BPP$=$BQP. In our second case, we obtain more general results, showing inefficiency unconditionally. We also show that any (local or otherwise) circuit cutting scheme cannot function by only applying unital channels.

arXiv:2303.13422•Mar 23, 2023•6 citations
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/21/21/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.
The paper asks how much familiar scalar measures of two-qubit nonlocality constrain the optimal quasiprobability gate-cutting extent γ\gammaγ. It starts from the known optimum γ=2(∑jpj)2−1=2H1/2(p)+1−1\gamma=2(\sum_j\sqrt{p_j})^2-1=2^{H_{1/2}(\mathbf p)+1}-1γ=2(∑j​pj​​)2−1=2H1/2​(p)+1−1, where p\mathbf pp is the normalized operator-Schmidt spectrum; standard sampling overhead scales as γ2\gamma^2γ2. It derives sharp minimum and maximum extents at fixed entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence.
The entangling-power bounds are 1+32ep≤γ≤71+3\sqrt{2e_{\mathrm p}}\leq\gamma\leq71+32ep​​≤γ≤7, with 0≤ep≤2/90\leq e_{\mathrm p}\leq2/90≤ep​≤2/9. For maximum concurrence, 1+2Cmax⁡≤γ≤71+2C_{\max}\leq\gamma\leq71+2Cmax​≤γ≤7, implying the attainable perfect-entangler range 3≤γ≤73\leq\gamma\leq73≤γ≤7. Controlled gates attain both lower envelopes; the iSWAP–SWAP family attains both upper envelopes. Gate typicality has piecewise envelopes, including an upper-family switch at gt=4/9g_{\mathrm t}=4/9gt​=4/9. The spectral lower envelopes switch from controlled rank-two to pair-pair spectra at Eop=1/2E_{\mathrm{op}}=1/2Eop​=1/2 and Schmidt strength one bit; fractional SWAP supplies both spectral upper envelopes.
Proofs combine Cartan-coordinate optimization, existing entropy-extremality results, and the ordered physical-spectrum condition p(1)p(4)≥p(2)p(3)p_{(1)}p_{(4)}\geq p_{(2)}p_{(3)}p(1)​p(4)​≥p(2)​p(3)​, which excludes rank three and sharpens generic entropy bounds. Explicit gate families establish attainability of every boundary point.
The results concern exact cutting of one ideal two-qubit unitary, not multiple gates, higher dimensions, or noisy or approximate decompositions. The envelopes need not describe filled attainable intervals: at zero entangling power or concurrence, only γ∈{1,7}\gamma\in\{1,7\}γ∈{1,7} occurs. Interior attainable-set topology and joint-descriptor constraints remain open extensions.
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/21/21/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 character Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits by replacing non-local gates with probabilistic mixtures of local gates. The cost of this method is a sampling overhead that scales exponentially in the number of cuts. It is crucial to determine the minimal cost for gate cutting and to understand whether allowing for classical communication between subcircuits can improve the sampling overhead. In this work, we derive a closed formula for the optimal sampling overhead for cutting an arbitrary number of two-qubit unitaries and provide the corresponding decomposition. We find that cutting several arbitrary two-qubit unitaries together is cheaper than cutting them individually and classical communication does not give any advantage.
Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit rotation gates based on a virtual gate-teleportation protocol. With that, we significantly lower the previous upper bounds on the sampling overhead and prove the optimality of the scheme. Furthermore, we show that no classical communication between the circuit partitions is required. For parallel two-qubit rotation gates we derive an optimal ancilla-free decomposition, which includes cnot gates as a special case.
In this paper, we discuss the experimental determination of the nonlocal characteristics of two-qubit gates. Based on the recently derived expressions for the entangling power and gate typicality of two-qubit gates, we construct two-qubit quantum circuits to measure the entangling power and gate typicality of the two-qubit gates, which are generated by the elements of the su(4) Cartan subalgebra. These elements describe the native interactions in many quantum processors. Hence, these circuits can be used to determine the nonlocal characteristics of native gates of many quantum processors. In each circuit, the native gate is applied twice. In addition, each circuit consists of at least one CNOT gate. A set of six two-qubit circuits is constructed to measure the entangling power. The number of circuits is further reduced to three by increasing the nonlocal resources (the number of CNOT gates). To measure the gate typicality, a set of three two-qubit circuits is constructed. Measurement of gate typicality requires more nonlocal resources than the measurement of entangling power.
A large-scale quantum circuit can be partitioned into multiple subcircuits through circuit cutting, where each subcircuit is executed multiple times and the expectation value of the original circuit is reconstructed by classical post-processing from their measurement (sampling) results. In this process, appropriate cut locations are identified after the user-designed quantum circuit, including multi-qubit gates that act on three or more qubits, has been decomposed into single-qubit gates and two-qubit gates such as the CNOT gate. Here, we present a method for reducing the sampling overhead, which refers to the increase in the number of samples required due to the cutting process, by modifying the decomposition strategy of multi-qubit gates. Using MCX and CCCX gates as representatives of multi-qubit gates, we demonstrate that the proposed decomposition method, which introduces a small number of ancilla qubits according to the identified cut locations, effectively decreases the sampling overhead.
Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller computations. While this work is sometimes called circuit knitting or divide and quantum we generically refer to it as circuit cutting (CC). Much of the existing work has focused on the development of more efficient circuit cutting schemes, leaving open questions on the limits of what theoretically optimal schemes can achieve. We develop bounds by breaking up possible approaches into two distinct regimes: the first, where the input state and measurement are fixed and known, and the second, which requires a given cutting to work for a complete basis of input states and measurements. For the first case, it is easy to see that bounds addressing the efficiency of any approaches to circuit cutting amount to resolving BPP=?\stackrel{?}{=}=?BQP. We therefore restrict ourselves to a simpler question, asking what \textit{locally-acting} circuit cutting schemes can achieve, a technical restriction which still includes all existing circuit cutting schemes. In our first case we show that the existence of a locally-acting circuit cutting scheme which could efficiently partition even a single qubit from the rest of a circuit would imply BPP===BQP. In our second case, we obtain more general results, showing inefficiency unconditionally. We also show that any (local or otherwise) circuit cutting scheme cannot function by only applying unital channels.