Joint Wire Cutting with Non-Maximally Entangled States

• URL: http://arxiv.org/abs/2406.13315v1
• Date: Wed, 19 Jun 2024 08:05:30 GMT
• Title: Joint Wire Cutting with Non-Maximally Entangled States
• Authors: Marvin Bechtold, Johanna Barzen, Frank Leymann, Alexander Mandl, Felix Truger,
• Abstract summary: Wire cutting enables distributed quantum computing. Wire cutting requires additional circuit executions to preserve result accuracy. Our paper investigates the use of NME states for joint wire cuts, aiming to reduce the sampling overhead further. Our three main contributions include (i) determining the minimal sampling overhead for this scenario, (ii) analyzing the overhead when using composite NME states constructed from smaller NME states, and (iii) introducing a wire cutting technique that achieves the optimal sampling overhead with pure NME states.
• Score: 37.89406056766725
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distributed quantum computing leverages the collective power of multiple quantum devices to perform computations exceeding the capabilities of individual quantum devices. A currently studied technique to enable this distributed approach is wire cutting, which decomposes a quantum circuit into smaller subcircuits by cutting their connecting wires. These subcircuits can then be executed on distributed devices, and their results are classically combined to reconstruct the original computation's result. However, wire cutting requires additional circuit executions to preserve result accuracy, with their number growing exponentially with each cut. Thus, minimizing this sampling overhead is crucial for reducing the total execution time. Employing shared non-maximally entangled (NME) states between distributed devices reduces this overhead for single wire cuts, moving closer to ideal teleportation with maximally entangled states. Extending this approach to jointly cutting multiple wires using NME states remained unexplored. Our paper addresses this gap by investigating the use of NME states for joint wire cuts, aiming to reduce the sampling overhead further. Our three main contributions include (i) determining the minimal sampling overhead for this scenario, (ii) analyzing the overhead when using composite NME states constructed from smaller NME states, and (iii) introducing a wire cutting technique that achieves the optimal sampling overhead with pure NME states, paving the way towards wire cutting with arbitrary NME states.

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)
• 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)
• Integrated Qubit Reuse and Circuit Cutting for Large Quantum Circuit Evaluation [9.644229176158465]
  The size of quantum circuits that can run with high fidelity is constrained by the limited quantity and quality of physical qubits. We propose IQRC, an integrated approach that exploits qubit reuse and circuit cutting to run large circuits on small quantum computers.
  arXiv  Detail & Related papers  (2023-12-16T02:49:28Z)
• 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)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Enhancing the Coherence of Superconducting Quantum Bits with Electric Fields [62.997667081978825]
  We show that qubit coherence can be improved by tuning defects away from the qubit resonance using an applied DC-electric field. We also discuss how local gate electrodes can be implemented in superconducting quantum processors to enable simultaneous in-situ coherence optimization of individual qubits.
  arXiv  Detail & Related papers  (2022-08-02T16:18:30Z)
• Federated Learning for Energy-limited Wireless Networks: A Partial Model Aggregation Approach [79.59560136273917]
  limited communication resources, bandwidth and energy, and data heterogeneity across devices are main bottlenecks for federated learning (FL) We first devise a novel FL framework with partial model aggregation (PMA) The proposed PMA-FL improves 2.72% and 11.6% accuracy on two typical heterogeneous datasets.
  arXiv  Detail & Related papers  (2022-04-20T19:09:52Z)

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.