Cutting circuits with multiple two-qubit unitaries

• URL: http://arxiv.org/abs/2312.11638v3
• Date: Fri, 26 Apr 2024 09:00:31 GMT
• Title: Cutting circuits with multiple two-qubit unitaries
• Authors: Lukas Schmitt, Christophe Piveteau, David Sutter,
• Abstract summary: Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits. 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.
• Score: 1.3791394805787949
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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. Interestingly, cutting several arbitrary two-qubit unitaries together is cheaper than cutting them individually and classical communication does not give any advantage. This is even the case when one cuts multiple non-local gates that are placed far apart in the circuit.

Related papers

• Cutting a Wire with Non-Maximally Entangled States [39.79428554301806]
  Circuit cutting techniques enable the distribution of quantum computations via classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in circuit executions. We present a wire cutting technique employing pure non-maximally entangled states that achieves this optimal sampling overhead.
  arXiv  Detail & Related papers  (2024-02-13T14:12:06Z)
• Optimal joint cutting of two-qubit rotation gates [2.4646794072984477]
  We introduce a scheme for joint cutting of two-qubit rotation gates based on a virtual gate-teleportation protocol. We show that no classical communication between the circuit partitions is required.
  arXiv  Detail & Related papers  (2023-12-15T10:52:04Z)
• Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
  Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. circuit cutting techniques enable the distribution of quantum computations through classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots. We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
  arXiv  Detail & Related papers  (2023-06-21T08:03:34Z)
• All this for one qubit? Bounds on local circuit cutting schemes [0.0]
  We show that a locally-acting circuit cutting scheme can efficiently partition even a single qubit from the rest of a circuit. We also show that any (local or otherwise) circuit cutting scheme cannot function by only applying unital channels.
  arXiv  Detail & Related papers  (2023-03-23T16:44:38Z)
• An alternative approach to optimal wire cutting without ancilla qubits [0.0]
  This paper presents a modified wire-cutting approach for pairs of subcircuits that achieves the same optimal multiplicative factors as wire cutting aided by ancilla qubits. The paper also shows that, while unitary 2-designs provide a sufficient basis for satisfying the decomposition, 2-designs are not mathematically necessary.
  arXiv  Detail & Related papers  (2023-03-15T00:22:29Z)
• Doubly optimal parallel wire cutting without ancilla qubits [0.4394730767364254]
  A restriction in the quality and quantity of available qubits presents a substantial obstacle to the application of near-term and early fault-tolerant quantum computers. This paper studies the problem of decomposing the parallel $n$-qubit identity channel into a set of local operations and classical communication. We give an optimal wire-cutting method comprised of channels based on mutually unbiased bases, that achieves minimal overheads in both the sampling overhead and the number of channels.
  arXiv  Detail & Related papers  (2023-03-13T17:59:18Z)
• Optimal wire cutting with classical communication [3.577310844634503]
  We show that the optimal cost for cutting wires without and with classical communication between the subcircuits scales as $O(16n)$ and $O(4n)$, respectively.
  arXiv  Detail & Related papers  (2023-02-07T10:19:58Z)
• High fidelity two-qubit gates on fluxoniums using a tunable coupler [47.187609203210705]
  Superconducting fluxonium qubits provide a promising alternative to transmons on the path toward large-scale quantum computing. A major challenge for multi-qubit fluxonium devices is the experimental demonstration of a scalable crosstalk-free multi-qubit architecture. Here, we present a two-qubit fluxonium-based quantum processor with a tunable coupler element.
  arXiv  Detail & Related papers  (2022-03-30T13:44:52Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Bayesian Bits: Unifying Quantization and Pruning [73.27732135853243]
  We introduce Bayesian Bits, a practical method for joint mixed precision quantization and pruning through gradient based optimization. We experimentally validate our proposed method on several benchmark datasets and show that we can learn pruned, mixed precision networks.
  arXiv  Detail & Related papers  (2020-05-14T16:00:34Z)

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.