PreprintCC BY 4.0arXiv
Quantum circuit knitting using a weak-coupling approximation
Abstract
We present a method for performing distributed quantum computing with controlled approximations for circuits that are weakly coupled via a single qubit. Exact distributed quantum computing requires exponential classical information to reconstruct the quantum process. However, we show how the classical cost is reduced to polynomial if the quantum procedure can be partitioned between a qubit that is weakly coupled to the other qubits. We demonstrate our method for a layered circuit based on the circuits used for the quantum approximate optimization algorithm.
Related
- Harmonic analysis and circuit approximation of Sobolev functions on quantum input spaces
- Quantum spacetime and quantum fluctuations in the IKKT model at weak coupling
- Multimode equilibrium approximations in light-matter systems from weak to strong coupling
- X2C-inspired approximation of the Dirac coupling operator in a multiwavelet basis
- The Back-to-Back Plateau of the Energy-Energy Correlator from Weak to Strong Coupling
BibTeX
@misc{stenger2026quantum,
title = {{Quantum circuit knitting using a weak-coupling approximation}},
author = {John P. T. Stenger and Daniel Gunlycke and Nikos Chrisochoides},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.19035},
eprint = {2606.19035},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.19035},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Quantum circuit knitting using a weak-coupling approximation
AU - John P. T. Stenger
AU - Daniel Gunlycke
AU - Nikos Chrisochoides
PY - 2026
DA - 2026/10/13
PB - arXiv
DO - 10.48550/arxiv.2606.19035
UR - https://arxiv.org/abs/2606.19035
AB - We present a method for performing distributed quantum computing with controlled approximations for circuits that are weakly coupled via a single qubit. Exact distributed quantum computing requires exponential classical information to reconstruct the quantum process. However, we show how the classical cost is reduced to polynomial if the quantum procedure can be partitioned between a qubit that is weakly coupled to the other qubits. We demonstrate our method for a layered circuit based on the circuits used for the quantum approximate optimization algorithm.
ER -