Robust and Resource-Efficient Quantum Circuit Approximation

• URL: http://arxiv.org/abs/2108.12714v1
• Date: Sat, 28 Aug 2021 22:48:25 GMT
• Title: Robust and Resource-Efficient Quantum Circuit Approximation
• Authors: Tirthak Patel, Ed Younis, Costin Iancu, Wibe de Jong, and Devesh Tiwari
• Abstract summary: We present QEst, a procedure to generate approximations for quantum circuits to reduce their CNOT gate count. Overall, the results indicate that QEst can reduce CNOT gate count by 30-80% on ideal systems.
• Score: 3.017562867737193
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present QEst, a procedure to systematically generate approximations for quantum circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for scalability with procedures to 1) reduce circuit length using approximate synthesis, 2) improve fidelity by running circuits that represent key samples in the approximation space, and 3) reason about approximation upper bound. Our evaluation results indicate that our approach of "dissimilar" approximations provides close fidelity to the original circuit. Overall, the results indicate that QEst can reduce CNOT gate count by 30-80% on ideal systems and decrease the impact of noise on existing and near-future quantum systems.

Related papers

• Automated quantum circuit optimization with randomized replacements [0.0]
  We show how to allow approximate local transformations and employ mixed quantum channels to approximate pure circuits.<n>Our protocol converts experimental noise due to gate applications into deliberately engineered random noise.<n>Results highlight the potential of mixed-channel approximations to enhance quantum circuit performance.
  arXiv  Detail & Related papers  (2026-01-22T13:16:05Z)
• Neural Guided Sampling for Quantum Circuit Optimization [26.90377134346014]
  Translating a quantum circuit on a specific hardware topology with a reduced set of available gates, also known as transpilation, comes with a substantial increase in the length of the equivalent circuit.<n>One method to address efficient transpilation is based on approaches known from optimization, e.g. by using random sampling and token replacement strategies.<n>Here, we propose in this work 2D neural guided sampling. Thus, given a 2D representation of a quantum circuit, a neural network predicts groups of gates in the quantum circuit, which are likely reducible.
  arXiv  Detail & Related papers  (2025-10-14T12:09:05Z)
• Quantum Circuit Optimization Based on Dynamic Grouping and ZX-Calculus for Reducing 2-Qubit Gate Count [9.400669963756508]
  Two-qubit gates in quantum circuits are more susceptible to noise than single-qubit gates.<n>This paper proposes a quantum circuit optimization approach based on dynamic grouping and ZX-calculus.
  arXiv  Detail & Related papers  (2025-07-19T02:05:32Z)
• Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks [38.499527873574436]
  We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.<n>By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules.<n>We demonstrate our method's competetiveness with state-of-the-art circuit generalizations and capabilities on large sets of diverse random circuits.
  arXiv  Detail & Related papers  (2025-04-04T13:19:08Z)
• Heuristic and Optimal Synthesis of CNOT and Clifford Circuits [3.1952340441132474]
  Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. We present methods for CNOT and general Clifford circuit synthesis which can be used to minimise either the entangling two-qubit gate count or the circuit depth. The algorithms have been implemented in a GitHub repository for use by the classical and quantum computing community.
  arXiv  Detail & Related papers  (2025-03-18T19:09:58Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality. 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. 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)
• Error filtration from optimized quantum circuit interference [0.0]
  We develop an optimized hardware strategy to mitigate errors in a noisy qubit. Our scheme builds on the physical principle of error filtration and exploits auxiliary qubits.
  arXiv  Detail & Related papers  (2024-09-02T17:58:44Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• 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)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Efficient quantum algorithm to simulate open systems through a single environmental qubit [0.0]
  We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers. Under fixed accuracy conditions, our algorithm enables a reduction in the number of trotter steps compared to other approaches.
  arXiv  Detail & Related papers  (2023-11-16T16:45:30Z)
• Hybrid Gate-Pulse Model for Variational Quantum Algorithms [33.73469431747376]
  Current quantum programs are mostly compiled on the gate-level, where quantum circuits are composed of quantum gates. pulse-level optimization has gained more attention from researchers due to their advantages in terms of circuit duration. We present a hybrid gate-pulse model that can mitigate these problems.
  arXiv  Detail & Related papers  (2022-12-01T17:06:35Z)
• Bayesian Learning of Parameterised Quantum Circuits [0.0]
  We take a probabilistic point of view and reformulate the classical optimisation as an approximation of a Bayesian posterior. We describe a dimension reduction strategy based on a maximum a posteriori point estimate with a Laplace prior. Experiments on the Quantinuum H1-2 computer show that the resulting circuits are faster to execute and less noisy than circuits trained without a gradient.
  arXiv  Detail & Related papers  (2022-06-15T14:20:14Z)
• Circuit connectivity boosts by quantum-classical-quantum interfaces [0.4194295877935867]
  High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. We numerically show the efficacy of our method for a Bell-state circuit for two increasingly distant qubits.
  arXiv  Detail & Related papers  (2022-03-09T19:00:02Z)
• 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)
• On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
  We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
  arXiv  Detail & Related papers  (2021-01-12T21:36:16Z)
• Realization of high-fidelity CZ and ZZ-free iSWAP gates with a tunable coupler [40.456646238780195]
  Two-qubit gates at scale are a key requirement to realize the full promise of quantum computation and simulation. We present a systematic approach that goes beyond the dispersive approximation to exploit the engineered level structure of the coupler and optimize its control. We experimentally demonstrate CZ and $ZZ$-free iSWAP gates with two-qubit interaction fidelities of $99.76 pm 0.07$% and $99.87 pm 0.23$%, respectively.
  arXiv  Detail & Related papers  (2020-11-02T19:09:43Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• 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.