Optimal wire cutting with classical communication
- URL: http://arxiv.org/abs/2302.03366v1
- Date: Tue, 7 Feb 2023 10:19:58 GMT
- Title: Optimal wire cutting with classical communication
- Authors: Lukas Brenner, Christophe Piveteau, David Sutter
- Abstract summary: 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.
- Score: 3.577310844634503
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Circuit knitting is the process of partitioning large quantum circuits into
smaller subcircuits such that the result of the original circuits can be
deduced by only running the subcircuits. Such techniques will be crucial for
near-term and early fault-tolerant quantum computers, as the limited number of
qubits is likely to be a major bottleneck for demonstrating quantum advantage.
One typically distinguishes between gate cuts and wire cuts when partitioning a
circuit. The cost for any circuit knitting approach scales exponentially in the
number of cuts. One possibility to realize a cut is via the quasiprobability
simulation technique. In fact, we argue that all existing rigorous circuit
knitting techniques can be understood in this framework. Furthermore, we
characterize the optimal overhead for wire cuts where the subcircuits can
exchange classical information or not. We show that the optimal cost for
cutting $n$ wires without and with classical communication between the
subcircuits scales as $O(16^n)$ and $O(4^n)$, respectively.
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) - 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) - 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) - Circuit knitting with classical communication [1.8311368766923968]
We study a method of circuit knitting based on quasiprobability simulation of nonlocal gates with operations that act locally on the subcircuits.
We provide a positive answer by showing that for circuits containing $n$ nonlocal CNOT gates connecting two circuit parts, the simulation overhead can be reduced from $O(9n)$ to $O(4n)$ if one allows for classical information exchange.
arXiv Detail & Related papers (2022-04-29T18:00:11Z) - 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) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - 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) - Coherent superconducting qubits from a subtractive junction fabrication
process [48.7576911714538]
Josephson tunnel junctions are the centerpiece of almost any superconducting electronic circuit, including qubits.
In recent years, sub-micron scale overlap junctions have started to attract attention.
This work paves the way towards a more standardized process flow with advanced materials and growth processes, and constitutes an important step for large scale fabrication of superconducting quantum circuits.
arXiv Detail & Related papers (2020-06-30T14:52:14Z)
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.