An alternative approach to optimal wire cutting without ancilla qubits

• URL: http://arxiv.org/abs/2303.08287v1
• Date: Wed, 15 Mar 2023 00:22:29 GMT
• Title: An alternative approach to optimal wire cutting without ancilla qubits
• Authors: Edwin Pednault
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Wire cutting is a technique for partitioning large quantum circuits into smaller subcircuits in such a way that observables for the original circuits can be estimated from measurements on the smaller subcircuits. Such techniques provide workarounds for the limited numbers of qubits that are available on near-term quantum devices. Wire cutting, however, introduces multiplicative factors in the number of times such subcircuits need to be executed in order to estimate desired quantum observables to desired levels of statistical accuracy. An optimal wire-cutting methodology has recently been reported that uses ancilla qubits to minimize the multiplicative factors involved as a function of the number of wire cuts. Until just recently, the best-known wire-cutting technique that did not employ ancillas asymptotically converged to the same multiplicative factors, but performed significantly worse for small numbers of cuts. This latter technique also requires inserting measurement and state-preparation subcircuits that are randomly sampled from Clifford 2-designs on a per-shot basis. 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, but without requiring ancillas. The paper also shows that, while unitary 2-designs provide a sufficient basis for satisfying the decomposition, 2-designs are not mathematically necessary and alternative unitary designs can be constructed for the decompositions that are substantially smaller in size than 2-designs. As this paper was just about to be released, a similar result was published, so we also include a comparison of the two approaches.

Related papers

• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery. Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods. Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• 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)
• Cutting circuits with multiple two-qubit unitaries [1.3791394805787949]
  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.
  arXiv  Detail & Related papers  (2023-12-18T19:00:07Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• 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)
• 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)
• 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.