Multilevel Circuit Optimization in Quantum Compilers: A Case Study
- URL: http://arxiv.org/abs/2505.09320v2
- Date: Fri, 16 May 2025 00:39:43 GMT
- Title: Multilevel Circuit Optimization in Quantum Compilers: A Case Study
- Authors: Tamiya Onodera, Yuki Sato, Toshinari Itoko, Naoki Yamamoto,
- Abstract summary: We explore multilevel circuit optimization (MLCO), where we deploy multiple gate sets and progressively lower the source circuit through the gate sets to the target circuit.<n>We demonstrate its effectiveness, using as a case study the source circuit for Hamiltonian simulation to solve a partial differential equation.<n>MLCO makes visible higher-level circuit structures, providing us with insights about how to simplify the circuits and how to decompose the gates.
- Score: 0.6954287924634025
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we explore multilevel circuit optimization (MLCO), where we deploy multiple gate sets and progressively lower the source circuit through the gate sets to the target circuit. At each level, we first perform an appropriate set of circuit simplifications and then lower the simplified circuit into the next level, decomposing the gates not supported there. We demonstrate its effectiveness, using as a case study the source circuit for Hamiltonian simulation to solve a partial differential equation, which is densely populated with multi-controlled gates and is transformed by the state-of-the-art circuit compiler to the target circuit with the quadratic number of CX gates in the number of qubits. MLCO makes visible higher-level circuit structures, providing us with insights about how to simplify the circuits and how to decompose the gates. By putting the right circuit structure in place and selecting the right decomposition algorithm, we could cause massive cancellation of entangling gates, thereby having achieved the quadratic reduction in the number of CX gates.
Related papers
- Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
arXiv Detail & Related papers (2025-07-28T10:25:31Z) - SSR: A Swapping-Sweeping-and-Rewriting Optimizer for Quantum Circuit Transformation [6.585746777304379]
We propose a Swapping-Sweeping-and-Rewriting algorithm to minimize the depth of QCT circuits.<n>The experimental results demonstrate that our algorithm can significantly reduce the depth of QCT circuits, 26.68% at most and 12.18% on average, across all benchmark circuits.
arXiv Detail & Related papers (2025-03-05T06:52:14Z) - Optimization Driven Quantum Circuit Reduction [20.697821016522358]
We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality.<n>The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support.<n>We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
arXiv Detail & Related papers (2025-02-20T16:41:10Z) - Multi-controlled single-qubit unitary gates based on the quantum Fourier transform and deep decomposition [0.0]
We will present a few new generalizations of the multi-controlled X (MCX) gate that uses the quantum Fourier transform (QFT)<n>First, we will optimize QFT-MCX and prove that it is equivalent to a stair MCX gates array.<n>The supremacy of our implementations over the best-known optimized algorithm will be demonstrated.
arXiv Detail & Related papers (2024-08-01T21:56:02Z) - Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware [2.536162003546062]
We present an approach to synthesize multi controlled phase gates using ZX calculus.
By representing quantum circuits as graph like ZX diagrams, one can utilize the distinct graph structure of diagonal gates.
arXiv Detail & Related papers (2024-03-16T09:06:49Z) - 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) - Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence.
We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
arXiv Detail & Related papers (2023-03-07T22:15:43Z) - Vanishing 2-Qubit Gates with Non-Simplification ZX-Rules [1.0089382889894247]
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.
arXiv Detail & Related papers (2022-09-14T18:43:21Z) - 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) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - 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) - 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.