Circuit Knitting Faces Exponential Sampling Overhead Scaling Bounded by Entanglement Cost
- URL: http://arxiv.org/abs/2404.03619v1
- Date: Thu, 4 Apr 2024 17:41:13 GMT
- Title: Circuit Knitting Faces Exponential Sampling Overhead Scaling Bounded by Entanglement Cost
- Authors: Mingrui Jing, Chengkai Zhu, Xin Wang,
- Abstract summary: We show that the sampling overhead of circuit knitting is exponentially lower bounded by the exact entanglement cost of the target bipartite dynamic.
Our work reveals a profound connection between virtual quantum information processing via quasi-probability decomposition and quantum Shannon theory.
- Score: 5.086696108576776
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Circuit knitting, a method for connecting quantum circuits across multiple processors to simulate nonlocal quantum operations, is a promising approach for distributed quantum computing. While various techniques have been developed for circuit knitting, we uncover fundamental limitations to the scalability of this technology. We prove that the sampling overhead of circuit knitting is exponentially lower bounded by the exact entanglement cost of the target bipartite dynamic, even for asymptotic overhead in the parallel cut regime. Specifically, we prove that the regularized sampling overhead assisted with local operations and classical communication (LOCC), of any bipartite quantum channel is lower bounded by the exponential of its exact entanglement cost under separable preserving operations. Furthermore, we show that the regularized sampling overhead for simulating a general bipartite channel via LOCC is lower bounded by $\kappa$-entanglement and max-Rains information, providing efficiently computable benchmarks. Our work reveals a profound connection between virtual quantum information processing via quasi-probability decomposition and quantum Shannon theory, highlighting the critical role of entanglement in distributed quantum computing.
Related papers
- Syncopated Dynamical Decoupling for Suppressing Crosstalk in Quantum
Circuits [12.29963230632145]
We study the use of dynamical decoupling in characterizing undesired two-qubit couplings and the underlying single-qubit decoherence.
We develop a syncopated decoupling technique which protects against decoherence and selectively targets unwanted two-qubit interactions.
arXiv Detail & Related papers (2024-03-12T17:18:35Z) - Contextual Subspace Variational Quantum Eigensolver Calculation of the Dissociation Curve of Molecular Nitrogen on a Superconducting Quantum Computer [0.06990493129893112]
We present an experimental demonstration of the Contextual Subspace Variational Quantum Eigensolver on superconducting quantum hardware.
In particular, we compute the potential energy curve for molecular nitrogen, where a dominance of static correlation in the dissociation limit proves challenging for many conventional quantum chemistry techniques.
Our quantum simulations retain good agreement with the full configuration interaction energy in the chosen STO-3G basis, outperforming all benchmarked single-reference wavefunction techniques in capturing the bond-breaking appropriately.
arXiv Detail & Related papers (2023-12-07T16:05:52Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - 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) - Universal cost bound of quantum error mitigation based on quantum
estimation theory [0.0]
We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory.
We derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost.
Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
arXiv Detail & Related papers (2022-08-19T15:04:36Z) - Reducing Unitary Coupled Cluster Circuit Depth by Classical Stochastic
Amplitude Pre-Screening [0.0]
Unitary Coupled Cluster (UCC) approaches are an appealing route to utilising quantum hardware to perform quantum chemistry calculations.
We present a combined classical-quantum approach where a classical UCC pre-processing step is used to determine the important excitations in the UCC ansatz.
arXiv Detail & Related papers (2021-08-24T18:34:14Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.