Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology

• URL: http://arxiv.org/abs/2608.13543v1
• Date: Thu, 13 Aug 2026 17:55:40 GMT
• Title: Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology
• Abstract summary: We show how to implement CNOT circuits in a CSS code encoding n logical qubits in k blocks using O(nk) inter-block CNOTs and intra-block Pauli measurements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: To achieve large-scale fault-tolerant quantum computation, it may be easier to combine many small sets of qubits than to construct a single large set. For example via quantum error correction with block codes, or distributed quantum processors utilizing shared entanglement. In these regimes, the time or error budget of the overall quantum computation may be dominated by non-local operations. Hence, it is worthwhile to minimize the number of these operations. We consider the case where both non-local and local connectivity may be arbitrarily restricted, and give an asymptotically optimal synthesis method for distributed CNOT and Clifford circuits, based on block-matrix Gaussian elimination. We extend this to all Clifford+RZ circuits by generalizing the Pauli exponential circuit representation; this naturally integrates with existing methods for optimizing T-count. As an application, we show how to implement CNOT circuits in a CSS code encoding n logical qubits in k blocks using O(nk) inter-block transversal CNOTs and intra-block Pauli measurements.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Asymptotically Optimal Quantum Circuits for Comparators and Incrementers [2.488003578430483]
  We present quantum circuits for comparison and increment operations that achieve anally optimal gate count of $(n)$ and depth of $(log n)$ over the Clifford+Toffoli gate set.<n>We extend these results to classical-quantum comparators, yielding an improved classical-quantum adder with an optimal qubit count.
  arXiv  Detail & Related papers  (2026-03-13T11:41:14Z)
• Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries [5.016480897268685]
  We present an equivalence-checking method for circuits formed by arbitrary single-qubit layers interleaved with Clifford layers.<n>This pattern is common in variational quantum algorithms and Hamiltonian simulation via Trotter decomposition.<n>We prove the existence of an efficient classical algorithm that determines whether a pair of circuits with shared single-qubit layers are equivalent for every possible choice of the shared single-qubit unitaries.
  arXiv  Detail & Related papers  (2026-03-13T06:25:26Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
  We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary.<n>We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
  arXiv  Detail & Related papers  (2025-04-22T16:10:34Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Single-shot error mitigation by coherent Pauli checks [6.992823294269743]
  We show how to generate samples from the output distribution of a quantum circuit without full-blown error correction. Our approach is based on Coherent Pauli Checks that detect errors in a Clifford circuit.
  arXiv  Detail & Related papers  (2022-12-07T20:03:07Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation [0.0]
  We propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically remaps logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss and RowCol.
  arXiv  Detail & Related papers  (2022-05-02T08:20:13Z)
• Quantum circuit compilation and hybrid computation using Pauli-based computation [0.0]
  Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. We propose practical ways of implementing PBC as adaptive quantum circuits and provide code to do the required classical side-processing.
  arXiv  Detail & Related papers  (2022-03-03T16:01:55Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.