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

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

Andrew Stewart Caldin

Published Nov 13, 2026• 0 citations
Publisher

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

DOI
10.5281/zenodo.24186741

Related papers

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

Michael Hart

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.

quant-pharXiv:2609.30141•Sep 25, 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

The Minimal Dimension of Entangled-Noise Advantage — E8 Intelligence Research

Andrew Stewart Caldin

Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems. Source: http://arxiv.org/abs/2609.28367v1 (arXiv:2609.28367 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 11, 2026•0 citations

Quantum Non-Locality Unification and Ballistic Electron Test Proposal — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Bell inequality tests confirm quantum non-locality; new generalized rules unify entanglement tests; condensed-matter proposal uses ballistic electrons in quantum wires. MATH: Bell inequality: \(S = E(a,b) - E(a,b') + E(a',b) + E(a',b') \leq 2\) (local hidden variables); quantum violation: \(S_{\text{QM}} = 2\sqrt{2} \approx 2.828\) (CHSH). Buscemi's unification: replaces measurement settings with quantum inputs, yielding "nonlocal" bounds via semidefinite programming — generalized Bell functionals \(B(\rho) \leq \beta_{\text{local}}\) with \(\beta_{\text{local}}\) derived from tensor product structures. Condensed-matter: entangled electron pairs via Coulomb coupling in quantum wires; Bell test with five gates — spin/charge degrees of freedom, violation expected at \(S \approx 2.828\) for singlet state. CONNECTION: The CHSH maximum \(2\sqrt{2}\) relates to the golden ratio via \(2\sqrt{2} = \sqrt{8} \approx 2.828\), and \(\sqrt{2}\) appears in root systems of \(D_4\) (cryst Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 1, 2026•0 citations

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

Multinegativity and single-letter formulas for asymptotic entanglement — E8 Intelligence Research

Andrew Stewart Caldin

The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates $k$-multinegative states, a generalization of binegative states and the associated Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 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 character Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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.
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.
Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems. Source: http://arxiv.org/abs/2609.28367v1 (arXiv:2609.28367 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Bell inequality tests confirm quantum non-locality; new generalized rules unify entanglement tests; condensed-matter proposal uses ballistic electrons in quantum wires. MATH: Bell inequality: S=E(a,b)−E(a,b′)+E(a′,b)+E(a′,b′)≤2S = E(a,b) - E(a,b') + E(a',b) + E(a',b') \leq 2S=E(a,b)−E(a,b′)+E(a′,b)+E(a′,b′)≤2 (local hidden variables); quantum violation: SQM=22≈2.828S_{\text{QM}} = 2\sqrt{2} \approx 2.828SQM​=22​≈2.828 (CHSH). Buscemi's unification: replaces measurement settings with quantum inputs, yielding "nonlocal" bounds via semidefinite programming — generalized Bell functionals B(ρ)≤βlocalB(\rho) \leq \beta_{\text{local}}B(ρ)≤βlocal​ with βlocal\beta_{\text{local}}βlocal​ derived from tensor product structures. Condensed-matter: entangled electron pairs via Coulomb coupling in quantum wires; Bell test with five gates — spin/charge degrees of freedom, violation expected at S≈2.828S \approx 2.828S≈2.828 for singlet state. CONNECTION: The CHSH maximum 222\sqrt{2}22​ relates to the golden ratio via 22=8≈2.8282\sqrt{2} = \sqrt{8} \approx 2.82822​=8​≈2.828, and 2\sqrt{2}2​ appears in root systems of D4D_4D4​ (cryst Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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.
The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates kkk-multinegative states, a generalization of binegative states and the associated Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com