Vanishing 2-Qubit Gates with Non-Simplification ZX-Rules
- URL: http://arxiv.org/abs/2209.06874v1
- Date: Wed, 14 Sep 2022 18:43:21 GMT
- Title: Vanishing 2-Qubit Gates with Non-Simplification ZX-Rules
- Authors: Ryan Krueger
- Abstract summary: A quantum circuit can be translated to a ZX-diagram which can be simplified using the rules of the ZX-calculus.
The best-known extraction procedures can drastically increase the number of 2-qubit gates.
We take advantage of the fact that local changes in a ZX-diagram can drastically affect the complexity of the extracted circuit.
- Score: 1.0089382889894247
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Traditional quantum circuit optimization is performed directly at the circuit
level. Alternatively, a quantum circuit can be translated to a ZX-diagram which
can be simplified using the rules of the ZX-calculus, after which a simplified
circuit can be extracted. However, the best-known extraction procedures can
drastically increase the number of 2-qubit gates. In this work, we take
advantage of the fact that local changes in a ZX-diagram can drastically affect
the complexity of the extracted circuit. We use a pair of congruences (i.e.,
non-simplification rewrite rules) based on the graph-theoretic notions of local
complementation and pivoting to generate local variants of a simplified
ZX-diagram. We explore the space of equivalent ZX-diagrams generated by these
congruences using simulated annealing and genetic algorithms to obtain a
simplified circuit with fewer 2-qubit gates. On randomly generated circuits,
our method can outperform state-of-the-art optimization techniques for
low-qubit (<10) circuits. On a set of previously reported benchmark circuits
with <=14 qubits, our method outperforms off-the-shelf methods in 87% of cases,
consistently reducing overall circuit complexity by an additional ~15-30% and
eliminating up to 46% of 2-qubit gates. These preliminary results serve as a
proof-of-concept for a new circuit optimization strategy in the ZX-calculus.
Related papers
- Causal flow preserving optimisation of quantum circuits in the
ZX-calculus [0.0]
This paper introduces an optimisation algorithm aiming to minimise non-Clifford gate count and two-qubit gate count.
By translating a circuit into a ZX-diagram it can be simplified before being extracted back into a circuit.
A particularly effective strategy for optimising QFT circuits is also noted, resulting in exactly one two-qubit gate per non-Clifford gate.
arXiv Detail & Related papers (2023-12-05T14:24:44Z) - CktGNN: Circuit Graph Neural Network for Electronic Design Automation [67.29634073660239]
This paper presents a Circuit Graph Neural Network (CktGNN) that simultaneously automates the circuit topology generation and device sizing.
We introduce Open Circuit Benchmark (OCB), an open-sourced dataset that contains $10$K distinct operational amplifiers.
Our work paves the way toward a learning-based open-sourced design automation for analog circuits.
arXiv Detail & Related papers (2023-08-31T02:20:25Z) - Speeding up quantum circuits simulation using ZX-Calculus [0.0]
We find that optimizing graph-like ZX-diagrams improves existing state of the art contraction cost by several order of magnitude.
In particular, we demonstrate an average contraction cost 1180 times better for Sycamore circuits of depth 20, and up to 4200 times better at peak performance.
arXiv Detail & Related papers (2023-05-04T09:26:46Z) - 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) - Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
We design quantum circuits by using the standard cell approach borrowed from classical circuit design.
We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
arXiv Detail & Related papers (2022-06-10T10:54:46Z) - Efficient quantum gate decomposition via adaptive circuit compression [0.0]
The utilization of parametric two-qubit gates in the circuit design allows us to transform the discrete problem of circuit synthesis into an optimization problem over continuous variables.
We implemented the algorithm in the SQUANDER software package and benchmarked it against several state-of-the-art quantum gate synthesis tools.
arXiv Detail & Related papers (2022-03-08T22:29:31Z) - Circuit Extraction for ZX-diagrams can be #P-hard [0.0]
Some applications for the ZX-calculus rely on being able to efficiently translate a ZX-diagram back into a quantum circuit of comparable size.
In this paper we show that the circuit extraction problem is #P-hard, and so is itself at least as hard as strong simulation of quantum circuits.
arXiv Detail & Related papers (2022-02-18T13:50:24Z) - Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing.
But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications.
We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z) - Hybrid quantum-classical circuit simplification with the ZX-calculus [0.0]
This work uses an extension of the formal graphical ZX-calculus called ZX-ground as an intermediary representation of the hybrid circuits.
We derive a number of gFlow-preserving optimization rules for ZX-ground diagrams that reduce the size of the graph.
We present a general procedure for detecting segments of circuit-like ZX-ground diagrams which can be implemented with classical gates in the extracted circuit.
arXiv Detail & Related papers (2021-09-13T15:45:56Z) - 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) - 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.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.