Circuit cutting with classical side information

• URL: http://arxiv.org/abs/2503.22384v1
• Date: Fri, 28 Mar 2025 12:43:34 GMT
• Title: Circuit cutting with classical side information
• Authors: Christophe Piveteau, Lukas Schmitt, David Sutter,
• Abstract summary: We provide a formalization of general circuit cutting techniques utilizing side information through quantum instruments.<n>We find that in certain scenarios, side information does not yield any reduction in sampling overhead, whereas in others it is essential for circuit cutting to be feasible at all.
• Score: 1.3791394805787949
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Circuit cutting is a technique for simulating large quantum circuits by partitioning them into smaller subcircuits, which can be executed on smaller quantum devices. The results from these subcircuits are then combined in classical post-processing to accurately reconstruct the expectation value of the original circuit. Circuit cutting introduces a sampling overhead that grows exponentially with the number of gates and qubit wires that are cut. Many recently developed quasiprobabilistic circuit cutting techniques leverage classical side information, obtained from intermediate measurements within the subcircuits, to enhance the post-processing step. In this work, we provide a formalization of general circuit cutting techniques utilizing side information through quantum instruments. With this framework, we analyze the advantage that classical side information provides in reducing the sampling overhead of circuit cutting. Surprisingly, we find that in certain scenarios, side information does not yield any reduction in sampling overhead, whereas in others it is essential for circuit cutting to be feasible at all. Furthermore, we present a lower bound for the optimal sampling overhead with side information that can be evaluated efficiently via semidefinite programming and improves on all previously known lower bounds.

Related papers

• A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting [0.9968037829925942]
  Circuit knitting emerges as a promising technique to overcome the limitation of the few physical qubits in near-term quantum hardware. We propose a hardware-aware framework aiming to advance the practicability of circuit knitting. We show that our framework reduces total subcircuits depth by up to 64% (48% on average) compared to the state-of-the-art approach.
  arXiv  Detail & Related papers  (2024-09-05T19:18:30Z)
• Adaptive Planning Search Algorithm for Analog Circuit Verification [53.97809573610992]
  We propose a machine learning (ML) approach, which uses less simulations. We show that the proposed approach is able to provide OCCs closer to the specifications for all circuits.
  arXiv  Detail & Related papers  (2023-06-23T12:57:46Z)
• 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)
• 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)
• Approximate Quantum Circuit Cutting [4.3186101474291325]
  Current and imminent quantum hardware lacks reliability and applicability due to noise and limited qubit counts. Quantum circuit cutting -- a technique dividing large quantum circuits into smaller subcircuits with sizes appropriate for the limited quantum resource at hand -- is used to mitigate these problems. This article introduces the notion of approximate circuit reconstruction.
  arXiv  Detail & Related papers  (2022-12-02T16:04:52Z)
• Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
  We design quantum circuits by using the standard cell approach borrowed from classical circuit design. We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
  arXiv  Detail & Related papers  (2022-06-10T10:54:46Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
  We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
  arXiv  Detail & Related papers  (2021-01-12T21:36:16Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)

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.