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:2610.14580

Entanglement-Capability-Aware Finite-Bond Circuit Cutting for Distributed Quantum Computing

Weidong Liu, Qingqing Jiang, Yufu Liu, Ruiqing He, Jiandong Shang, Hengliang Guo, Qiang Chen

quant-phcs.DCmath.OCSubmitted Oct 10, 2026• Announced Oct 13, 2026• 0 citations
arXivHTMLPDF

Abstract

Distributed quantum computing distributes workloads that exceed a single processor's capacity across resource-constrained components. Circuit cutting enables this decomposition, but its effectiveness depends on partition choice. We present SACE, a Simulation-Aware Circuit Partitioning framework with Entanglement-Capability-Aware Screening. EP-Cost screens partitions using a parameter-dependent entanglement-capability proxy and native implementation cost. Under reconstruction constraints, finite-bond refinement selects the candidate that minimizes the worst-subcircuit discrepancy between normalized MPS simulations at bond dimensions $χ$ and $2χ$. Across 14 exhaustively enumerated small-scale candidate spaces, EP-Cost-guided genetic algorithm selections attain co-optimal native quasiprobability decomposition (QPD) overhead, with a median within-circuit Spearman correlation of 0.9965 between EP-Cost and QPD overhead. At matched cut counts, EP-Cost reduces QPD overhead by $25.20\times$ and $16.89\times$ for 8- and 9-qubit QFT circuits, respectively, and improves sampled reconstruction. On 12-qubit approximate QFT, deterministic reconstruction reduces Pauli-observable mean absolute error in all six low-bond conditions and total-variation distance in five. With five cuts and 7,776 QPD terms, SACE is best on all four reconstruction metrics in four of six conditions. At 24 qubits, SACE improves exact-local QFT accuracy in all 30 instance-bond-dimension conditions against each EP-Cost-only, Kernighan-Lin, and spectral baseline. The 50-qubit QFT comparisons remain favorable as reference convergence improves. Weighted QAOA circuits provide complementary, more bond-sensitive evidence. Refinement benefits persist across three search methods; larger candidate panels improve the optimized proxy without guaranteeing lower exact-local error.

AI Summary

The paper studies circuit-cutting partition selection when both reconstruction overhead and finite-bond classical simulation accuracy matter. It introduces SACE, a two-stage heuristic for capacity-constrained bipartitions. EP-Cost screens boundaries using gate-parameter-dependent squared maximal product-input concurrence and native implementation cost. Among the top candidates (normally 32), SACE minimizes the worst-block infidelity between normalized isolated-subcircuit MPS simulations at bond dimensions $\chi$ and $2\chi$. Optional cut-count, QPD-term-count, and overhead budgets restrict feasibility. Across 14 exhaustively enumerated 8–9-qubit candidate spaces, EP-Cost-guided genetic searches select QPD-overhead-co-optimal partitions; median within-circuit Spearman correlation between EP-Cost and overhead is 0.9965. At matched cut counts, QFT-8 and QFT-9 overhead decreases by factors of 25.20 and 16.89 versus selected graph baselines, with lower sampled reconstruction errors. Complete deterministic QPD reconstruction on one 12-qubit approximate-QFT topology lowers Pauli-observable MAE in all six low-bond conditions and TVD in five. Among three five-cut partitions, each requiring 7,776 QPD terms, SACE is best on all four reconstruction metrics in four conditions. At 24 qubits, exact isolated-subcircuit validation favors SACE over EP-only, Kernighan–Lin, and spectral baselines in all 30 QFT instance–bond conditions; weighted-QAOA results are less uniform. Refinement benefits also occur with simulated annealing and particle-swarm searches. Larger-width results measure local accuracy, not global reconstruction fidelity. At 50 qubits, validation uses finite-resource MPS references, with particularly weak convergence for QAOA. Larger candidate panels do not guarantee lower exact-local error. Physical-QPU noise, communication, scheduling, and hardware-specific cutting costs remain outside scope.

Little sign of AI-generated textIncrementalMissing comparison

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

Related papers

Quantum Circuit Partitioning For Effective Utilization of Quantum Resources

Connor Howe, Cristina Radian, Justin Woodring +2 more

Near-term hardware is constrained by high error rates, small qubit counts, and relatively low output fidelity, making the execution of large, high performance quantum circuits difficult. Circuit partitioning (or circuit cutting) has emerged as a promising approach to circumvent these limitations by decomposing circuits into smaller subcircuits at two-qubit interaction points. However, it remains unclear which classes of circuits benefit the most from partitioning and under what hardware conditions it is most effective. In this work, we evaluate the suitability of quantum circuits for partitioning from three perspectives: improving fidelity, enabling distributed execution, and scaling to larger circuit sizes. Specifically, we compare uncut circuit execution against two circuit partitioning approaches: Qiskit's automatic cut finding technique and a custom performance optimized circuit cutting method. We also measure these across GHZ, QFT, brickwork, and random quantum circuits ranging from 4 to 14 qubits, using mean absolute error of expectation values and overall output fidelity. Our results show that partitioning benefits larger, highly interconnected circuits, with our custom method reducing error by up to 55\% and improve fidelity for GHZ circuits, but degrading performance for brickwork circuits at larger scales.

quant-pharXiv:2604.22664•Apr 27, 2026•0 citations

Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning

Gregory Morse, Muhammad Al Farizi, Jakab Nádori +3 more

We introduce a scalable framework for globally optimal quantum-circuit partitioning and entanglement-aware block resynthesis. The partitioning problem is formulated as an integer linear program over qubit-feasible convex subcircuits, supporting objectives such as minimizing the number of partitions or a weighted execution cost. The resulting partition selection is exact over the enumerated feasible candidates and their computed costs when the ILP is solved to proven optimality. The selected partitions are resynthesized using an operator-Schmidt rank (OSR) based synthesis technique, which exploits their internal entanglement structure. We compare the end-to-end integer linear programming (ILP)--OSR workflow with BQSKit while identifying their different routing methods, and separately compare local OSR and BQSKit synthesis on matched three- and four-qubit unitaries. On the frozen sample of 772 local unitary targets, OSR produces 741 verified syntheses versus 617 for BQSKit, and matches or improves the CNOT count in all 617 jointly verified pairs. These results demonstrate that globally optimal partition selection combined with entanglement-aware resynthesis improves circuit quality and extends block-based optimization to problem sizes that are impractical for existing optimization workflows.

quant-pharXiv:2611.03845•Nov 4, 2026•0 citations

MOSAIQC: Mixed-topology-aware Optimization for Scalable Approximate noise-Informed Quantum circuit Cutting

Koen Mesman, Yinglu Tang, Matthias Moller +2 more

Current quantum computers do not yet have the required qubit resources to meet the demands of most practical quantum algorithms. To circumvent this constraint, the practice of dividing these algorithms into parts through quantum circuit cutting has been explored. Many of these works either show exponential scaling or are far from optimal solutions. In this paper, MosaiQC is presented as a novel framework to improve upon existing circuit cutting frameworks. A hybrid warmstart with refinement optimization is used to find cutting solutions, allowing the combination of both wire and gate cuts. Additionally, MosaiQC enables hardware partitions of mixed sizes. Furthermore, the refinement stage incorporates a fast approximate quadratic assignment solver to better place hardware partitions, demonstrating a mean local fidelity improvement of $19.56 \% \pm 6.17\%$ over the baseline algorithm. In runtime and sampling overhead costs, improvements of $2.88 \times$ and an average of $16.84\%$ cut reduction (resulting in an average $5.83 \cdot 10^{11} \times$ overhead reduction) are observed. MosaiQC demonstrates a superior trade-off for run speed and solution quality, while adding fundamental features excluded by most competitors. With this, MosaiQC demonstrates that scalable heuristic optimization can substantially reduce the computational overhead of circuit-cut placement for increasingly large quantum circuits.

quant-pharXiv:2607.18888•Jul 22, 2026•0 citations

Resource-Aware Scheduling for Distributed Quantum Computing

Connor Howe, Raghav Mundada, Jake O'Shaughnessy +2 more

Distributed quantum computing (DQC) is a promising near-term approach for executing circuits that exceed the capacity of a single quantum processing unit (QPU). Prior work has made significant progress on circuit partitioning and reconstruction, but practical DQC requires more than cutting a circuit into smaller pieces. A runtime system must determine whether to execute the circuit intact, cut it for sequential execution on one QPU, or distribute it across multiple QPUs, while accounting for queueing, communication, reconstruction, and hardware constraints. We present a resource-aware scheduler for DQC that compares these execution alternatives at runtime using explicit models of QPU execution, communication, and host-side reconstruction, together with hardware-informed timing derived from simulated IBM QPUs. By treating communication and reconstruction as first-class scheduling costs, the scheduler selects execution plans using a more realistic view of end-to-end overhead than cutting-only approaches. Across our experiments, reconstruction accounts for over 83% of cutting overhead, distributed execution reduces P90 latency by up to 39% relative to uncut single-QPU execution, and scheduling overhead itself remains negligible, never exceeding 0.038% of end-to-end job latency. Together, these results show that DQC must be treated as a runtime scheduling problem over both quantum and classical resources, not just circuit partitioning.

arXiv:2610.30482•Oct 21, 2026•0 citations

Treewidth-Aware Gate Cut Selection for Reducing Transpilation Overhead on Superconducting Quantum Devices

Hana Ebi, Shin Nishio, Takahiko Satoh

On superconducting quantum devices with sparse qubit connectivity, transpilation of long-range two-qubit interactions inserts additional SWAP gates, increasing hardware cost and execution error. Gate cutting via quasi-probability decomposition (QPD) can remove a selected two-qubit gate and thereby reduce routing overhead, but its sampling cost makes cut placement critical. We propose TW2S, a graph-only two-stage gate-cut selection method that operates on the circuit interaction graph without backend-specific transpilation at selection time. Stage 1 analyzes a min-fill elimination trace and scores edges by their contribution to a treewidth upper bound. Stage 2 ranks the resulting candidates by edge betweenness centrality with a degree penalty to identify routing bottlenecks. Across grid, Watts-Strogatz, barbell, and stochastic block model benchmarks transpiled to IBM's FakeSherbrooke backend, TW2S consistently outperforms random cut selection when the interaction graph contains identifiable sparse cuts. The advantage is governed not by absolute graph density but by moderate community structure and accessible inter-community edges. We further derive a mean-squared-error breakeven condition showing that, under a shared total shot budget, QPD is beneficial only when the ECR reduction is large enough and the signal strength is sufficient. Under an expanded per-subcircuit budget the signal-strength requirement is substantially relaxed. In noisy simulations of the J1-J2 transverse-field Ising model, TW2S achieves $Δ$ECR = 47 for n = 8, compared with approximately 9 for random selection, and yields lower estimation error than the uncut baseline in the tested strong-signal regime, with larger gains at increased shot budgets. These results position graph-structural cut selection as a practical compiler-side tool for turning circuit cutting into a targeted routing-reduction strategy.

quant-pharXiv:2605.29723•May 29, 2026•0 citations

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
Distributed quantum computing distributes workloads that exceed a single processor's capacity across resource-constrained components. Circuit cutting enables this decomposition, but its effectiveness depends on partition choice. We present SACE, a Simulation-Aware Circuit Partitioning framework with Entanglement-Capability-Aware Screening. EP-Cost screens partitions using a parameter-dependent entanglement-capability proxy and native implementation cost. Under reconstruction constraints, finite-bond refinement selects the candidate that minimizes the worst-subcircuit discrepancy between normalized MPS simulations at bond dimensions χχχ and 2χ2χ2χ. Across 14 exhaustively enumerated small-scale candidate spaces, EP-Cost-guided genetic algorithm selections attain co-optimal native quasiprobability decomposition (QPD) overhead, with a median within-circuit Spearman correlation of 0.9965 between EP-Cost and QPD overhead. At matched cut counts, EP-Cost reduces QPD overhead by 25.20×25.20\times25.20× and 16.89×16.89\times16.89× for 8- and 9-qubit QFT circuits, respectively, and improves sampled reconstruction. On 12-qubit approximate QFT, deterministic reconstruction reduces Pauli-observable mean absolute error in all six low-bond conditions and total-variation distance in five. With five cuts and 7,776 QPD terms, SACE is best on all four reconstruction metrics in four of six conditions. At 24 qubits, SACE improves exact-local QFT accuracy in all 30 instance-bond-dimension conditions against each EP-Cost-only, Kernighan-Lin, and spectral baseline. The 50-qubit QFT comparisons remain favorable as reference convergence improves. Weighted QAOA circuits provide complementary, more bond-sensitive evidence. Refinement benefits persist across three search methods; larger candidate panels improve the optimized proxy without guaranteeing lower exact-local error.
The paper studies circuit-cutting partition selection when both reconstruction overhead and finite-bond classical simulation accuracy matter. It introduces SACE, a two-stage heuristic for capacity-constrained bipartitions. EP-Cost screens boundaries using gate-parameter-dependent squared maximal product-input concurrence and native implementation cost. Among the top candidates (normally 32), SACE minimizes the worst-block infidelity between normalized isolated-subcircuit MPS simulations at bond dimensions χ\chiχ and 2χ2\chi2χ. Optional cut-count, QPD-term-count, and overhead budgets restrict feasibility.
Across 14 exhaustively enumerated 8–9-qubit candidate spaces, EP-Cost-guided genetic searches select QPD-overhead-co-optimal partitions; median within-circuit Spearman correlation between EP-Cost and overhead is 0.9965. At matched cut counts, QFT-8 and QFT-9 overhead decreases by factors of 25.20 and 16.89 versus selected graph baselines, with lower sampled reconstruction errors. Complete deterministic QPD reconstruction on one 12-qubit approximate-QFT topology lowers Pauli-observable MAE in all six low-bond conditions and TVD in five. Among three five-cut partitions, each requiring 7,776 QPD terms, SACE is best on all four reconstruction metrics in four conditions.
At 24 qubits, exact isolated-subcircuit validation favors SACE over EP-only, Kernighan–Lin, and spectral baselines in all 30 QFT instance–bond conditions; weighted-QAOA results are less uniform. Refinement benefits also occur with simulated annealing and particle-swarm searches. Larger-width results measure local accuracy, not global reconstruction fidelity. At 50 qubits, validation uses finite-resource MPS references, with particularly weak convergence for QAOA. Larger candidate panels do not guarantee lower exact-local error. Physical-QPU noise, communication, scheduling, and hardware-specific cutting costs remain outside scope.
Near-term hardware is constrained by high error rates, small qubit counts, and relatively low output fidelity, making the execution of large, high performance quantum circuits difficult. Circuit partitioning (or circuit cutting) has emerged as a promising approach to circumvent these limitations by decomposing circuits into smaller subcircuits at two-qubit interaction points. However, it remains unclear which classes of circuits benefit the most from partitioning and under what hardware conditions it is most effective. In this work, we evaluate the suitability of quantum circuits for partitioning from three perspectives: improving fidelity, enabling distributed execution, and scaling to larger circuit sizes. Specifically, we compare uncut circuit execution against two circuit partitioning approaches: Qiskit's automatic cut finding technique and a custom performance optimized circuit cutting method. We also measure these across GHZ, QFT, brickwork, and random quantum circuits ranging from 4 to 14 qubits, using mean absolute error of expectation values and overall output fidelity. Our results show that partitioning benefits larger, highly interconnected circuits, with our custom method reducing error by up to 55\% and improve fidelity for GHZ circuits, but degrading performance for brickwork circuits at larger scales.
We introduce a scalable framework for globally optimal quantum-circuit partitioning and entanglement-aware block resynthesis. The partitioning problem is formulated as an integer linear program over qubit-feasible convex subcircuits, supporting objectives such as minimizing the number of partitions or a weighted execution cost. The resulting partition selection is exact over the enumerated feasible candidates and their computed costs when the ILP is solved to proven optimality. The selected partitions are resynthesized using an operator-Schmidt rank (OSR) based synthesis technique, which exploits their internal entanglement structure. We compare the end-to-end integer linear programming (ILP)--OSR workflow with BQSKit while identifying their different routing methods, and separately compare local OSR and BQSKit synthesis on matched three- and four-qubit unitaries. On the frozen sample of 772 local unitary targets, OSR produces 741 verified syntheses versus 617 for BQSKit, and matches or improves the CNOT count in all 617 jointly verified pairs. These results demonstrate that globally optimal partition selection combined with entanglement-aware resynthesis improves circuit quality and extends block-based optimization to problem sizes that are impractical for existing optimization workflows.
Current quantum computers do not yet have the required qubit resources to meet the demands of most practical quantum algorithms. To circumvent this constraint, the practice of dividing these algorithms into parts through quantum circuit cutting has been explored. Many of these works either show exponential scaling or are far from optimal solutions. In this paper, MosaiQC is presented as a novel framework to improve upon existing circuit cutting frameworks. A hybrid warmstart with refinement optimization is used to find cutting solutions, allowing the combination of both wire and gate cuts. Additionally, MosaiQC enables hardware partitions of mixed sizes. Furthermore, the refinement stage incorporates a fast approximate quadratic assignment solver to better place hardware partitions, demonstrating a mean local fidelity improvement of 19.56%±6.17%19.56 \% \pm 6.17\%19.56%±6.17% over the baseline algorithm. In runtime and sampling overhead costs, improvements of 2.88×2.88 \times2.88× and an average of 16.84%16.84\%16.84% cut reduction (resulting in an average 5.83⋅1011×5.83 \cdot 10^{11} \times5.83⋅1011× overhead reduction) are observed. MosaiQC demonstrates a superior trade-off for run speed and solution quality, while adding fundamental features excluded by most competitors. With this, MosaiQC demonstrates that scalable heuristic optimization can substantially reduce the computational overhead of circuit-cut placement for increasingly large quantum circuits.
Distributed quantum computing (DQC) is a promising near-term approach for executing circuits that exceed the capacity of a single quantum processing unit (QPU). Prior work has made significant progress on circuit partitioning and reconstruction, but practical DQC requires more than cutting a circuit into smaller pieces. A runtime system must determine whether to execute the circuit intact, cut it for sequential execution on one QPU, or distribute it across multiple QPUs, while accounting for queueing, communication, reconstruction, and hardware constraints. We present a resource-aware scheduler for DQC that compares these execution alternatives at runtime using explicit models of QPU execution, communication, and host-side reconstruction, together with hardware-informed timing derived from simulated IBM QPUs. By treating communication and reconstruction as first-class scheduling costs, the scheduler selects execution plans using a more realistic view of end-to-end overhead than cutting-only approaches. Across our experiments, reconstruction accounts for over 83% of cutting overhead, distributed execution reduces P90 latency by up to 39% relative to uncut single-QPU execution, and scheduling overhead itself remains negligible, never exceeding 0.038% of end-to-end job latency. Together, these results show that DQC must be treated as a runtime scheduling problem over both quantum and classical resources, not just circuit partitioning.
On superconducting quantum devices with sparse qubit connectivity, transpilation of long-range two-qubit interactions inserts additional SWAP gates, increasing hardware cost and execution error. Gate cutting via quasi-probability decomposition (QPD) can remove a selected two-qubit gate and thereby reduce routing overhead, but its sampling cost makes cut placement critical. We propose TW2S, a graph-only two-stage gate-cut selection method that operates on the circuit interaction graph without backend-specific transpilation at selection time. Stage 1 analyzes a min-fill elimination trace and scores edges by their contribution to a treewidth upper bound. Stage 2 ranks the resulting candidates by edge betweenness centrality with a degree penalty to identify routing bottlenecks. Across grid, Watts-Strogatz, barbell, and stochastic block model benchmarks transpiled to IBM's FakeSherbrooke backend, TW2S consistently outperforms random cut selection when the interaction graph contains identifiable sparse cuts. The advantage is governed not by absolute graph density but by moderate community structure and accessible inter-community edges. We further derive a mean-squared-error breakeven condition showing that, under a shared total shot budget, QPD is beneficial only when the ECR reduction is large enough and the signal strength is sufficient. Under an expanded per-subcircuit budget the signal-strength requirement is substantially relaxed. In noisy simulations of the J1-J2 transverse-field Ising model, TW2S achieves ΔΔΔECR = 47 for n = 8, compared with approximately 9 for random selection, and yields lower estimation error than the uncut baseline in the tested strong-signal regime, with larger gains at increased shot budgets. These results position graph-structural cut selection as a practical compiler-side tool for turning circuit cutting into a targeted routing-reduction strategy.
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.