Circuit knitting with classical communication

Piveteau, Christophe; Sutter, David

doi:10.48550/arxiv.2205.00016

Cited by 10 publications

(15 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This additional cost is also manifested in our experiments by the higher shot noise, i.e., more shots are needed for convergence. This observation is consistent with theoretical considerations of circuit cutting in other work [24,35] and, in general, the applicability of circuit cutting to suppress errors and tackle NIBPs depends on structural properties of the circuits that determine the number of cuts and therefore the required overhead.…”

Section: Discussionsupporting

confidence: 90%

“…The cost of circuit cutting grows in the worst case exponentially with the number of cuts [34]. Since the introduction of the first gate-cutting technique [13], various methods and adaptions that lower the cost have been developed [14,15,24,34,35]. Peng et al [14] present the first wire cut, which cost is reduced by Lowe et al [34] via randomized measurements.…”

Section: Related Workmentioning

confidence: 99%

“…Mitarai and Fujii [15,24] lower the cost of a gate cut. Moreover, based on gate teleportation [36], Piveteau and Sutter [35] show that extending gate-cutting with classical communication between subcircuits and shared entanglement can reduce the overhead further, although the overhead is still exponential.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices

Bechtold¹,

Barzen²,

Leymann³

et al. 2023

Preprint

View full text Add to dashboard Cite

Noisy Intermediate-Scale Quantum (NISQ) devices are restricted by their limited number of qubits and their short decoherence times. An approach addressing these problems is quantum circuit cutting. It decomposes the execution of a large quantum circuit into the execution of multiple smaller quantum circuits with additional classical postprocessing. Since these smaller quantum circuits require fewer qubits and gates, they are more suitable for NISQ devices. To investigate the effect of quantum circuit cutting in a quantum algorithm targeting NISQ devices, we design two experiments using the Quantum Approximate Optimization Algorithm (QAOA) for the Maximum Cut (MaxCut) problem and conduct them on state-of-the-art superconducting devices. Our first experiment studies the influence of circuit cutting on the objective function of QAOA, and the second evaluates the quality of results obtained by the whole algorithm with circuit cutting. The results show that circuit cutting can reduce the effects of noise in QAOA, and therefore, the algorithm yields better solutions on NISQ devices.

show abstract

Section: Discussionsupporting

confidence: 90%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices

Bechtold¹,

Barzen²,

Leymann³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…The maximum number of qubits is currently 433, in the Osprey QPU [177]. Osprey will be operated as a system of small parallel QPUs to achieve a computational advantage in the near term by combining multiple QPUs through circuit knitting techniques [19,178], improving the quality of solutions through error suppression and mitigation, and focusing on heuristic versions of quantum algorithms with asymptotic speedups. The IBM Q Experience has created an ecosystem based on Qiskit, providing a versatile programming and testbed environment [19,179], beginning to look like an industry standard.…”

Section: 32mentioning

confidence: 99%

Quantum information processing with superconducting circuits: a perspective

Wendin¹

2023

Preprint

View full text Add to dashboard Cite

The last five years have seen a dramatic evolution of platforms for quantum computing, taking the field from physics experiments to quantum hardware and software engineering. Nevertheless, despite this progress of quantum processors, the field is still in the noisy intermediate-scale quantum (NISQ) regime, seriously limiting the performance of software applications. Key issues involve how to achieve quantum advantage in useful applications for quantum optimization and materials science, connected to the concept of quantum supremacy first demonstrated by Google in 2019. In this article we will describe recent work to establish relevant benchmarks for quantum supremacy and quantum advantage, present recent work on applications of variational quantum algorithms for optimization and electronic structure determination, discuss how to achieve practical quantum advantage, and finally outline current work and ideas about how to scale up to competitive quantum systems.

show abstract

“…Methods such as entanglement forging and circuit knitting [39][40][41] attempt to overcome the absence of entanglement at the cost of running narrow circuits more times. If the QIB is ignored, an interconnected approach is favorable since it requires exponentially fewer shots.…”

mentioning

confidence: 99%

Variational Quantum Eigensolvers in the Era of Distributed Quantum Computers

Khait¹,

Tham²,

Segal³

et al. 2023

Preprint

View full text Add to dashboard Cite

The computational power of a quantum computer is limited by the number of qubits available for information processing. Increasing this number within a single device is difficult; it is widely accepted that distributed modular architectures are the solution to large scale quantum computing. The major challenge in implementing such architectures is the need to exchange quantum information between modules. In this work, we show that a distributed quantum computing architecture with limited capacity to exchange information between modules can accurately solve quantum computational problems. Using the example of a variational quantum eignesolver with an ansatz designed for a two-module (dual-core) architecture, we show that three inter-module operations provide a significant advantage over no inter-module (or serially executed) operations. These results provide a strong indication that near-term modular quantum processors can be an effective alternative to their monolithic counterparts.

show abstract

Circuit knitting with classical communication

Cited by 10 publications

References 24 publications

Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices

Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices

Quantum information processing with superconducting circuits: a perspective

Variational Quantum Eigensolvers in the Era of Distributed Quantum Computers

Contact Info

Product

Resources

About