Related papers: Cutting multi-control quantum gates with ZX calculus

Cutting multi-control quantum gates with ZX calculus

URL: http://arxiv.org/abs/2302.00387v2
Date: Mon, 9 Oct 2023 09:28:16 GMT
Title: Cutting multi-control quantum gates with ZX calculus
Authors: Christian Ufrecht, Maniraman Periyasamy, Sebastian Rietsch, Daniel D. Scherer, Axel Plinge, Christopher Mutschler
Abstract summary: We introduce a method for cutting multi-controlled Z gates. We evaluate our proposal on IBM hardware and experimentally show noise resilience due to the strong reduction of CNOT gates in the cut circuits.
Score: 2.7425745251534064
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Circuit cutting, the decomposition of a quantum circuit into independent partitions, has become a promising avenue towards experiments with larger quantum circuits in the noisy-intermediate scale quantum (NISQ) era. While previous work focused on cutting qubit wires or two-qubit gates, in this work we introduce a method for cutting multi-controlled Z gates. We construct a decomposition and prove the upper bound $\mathcal{O}(6^{2K})$ on the associated sampling overhead, where $K$ is the number of cuts in the circuit. This bound is independent of the number of control qubits but can be further reduced to $\mathcal{O}(4.5^{2K})$ for the special case of CCZ gates. Furthermore, we evaluate our proposal on IBM hardware and experimentally show noise resilience due to the strong reduction of CNOT gates in the cut circuits.

Related papers

Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
arXiv Detail & Related papers (2024-08-07T19:51:22Z)
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)
Optimal joint cutting of two-qubit rotation gates [2.4646794072984477]
We introduce a scheme for joint cutting of two-qubit rotation gates based on a virtual gate-teleportation protocol. We show that no classical communication between the circuit partitions is required.
arXiv Detail & Related papers (2023-12-15T10:52:04Z)
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)
Universal qudit gate synthesis for transmons [44.22241766275732]
We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
arXiv Detail & Related papers (2022-12-08T18:59:53Z)
High fidelity two-qubit gates on fluxoniums using a tunable coupler [47.187609203210705]
Superconducting fluxonium qubits provide a promising alternative to transmons on the path toward large-scale quantum computing. A major challenge for multi-qubit fluxonium devices is the experimental demonstration of a scalable crosstalk-free multi-qubit architecture. Here, we present a two-qubit fluxonium-based quantum processor with a tunable coupler element.
arXiv Detail & Related papers (2022-03-30T13:44:52Z)
Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z)
Halving the cost of quantum multiplexed rotations [0.0]
We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
arXiv Detail & Related papers (2021-10-26T06:49:44Z)
Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z)
Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.