Reducing the CNOT count for Clifford+T circuits on NISQ architectures

• URL: http://arxiv.org/abs/2011.12191v4
• Date: Mon, 10 Oct 2022 18:11:38 GMT
• Title: Reducing the CNOT count for Clifford+T circuits on NISQ architectures
• Authors: Vlad Gheorghiu, Jiaxin Huang, Sarah Meng Li, Michele Mosca, Priyanka Mukhopadhyay
• Abstract summary: Connectivity of the physical qubits is one such constraint that restricts two-qubit operations, such as CNOT, to "connected" qubits. In this paper we consider the problem of reducing the CNOT-count in Clifford+T circuits on connectivity constrained architectures. We "slice" the circuit at the position of Hadamard gates and "build" the intermediate CNOT,T sub-circuits using Steiner trees.
• Score: 6.964575422457177
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture. Connectivity of the physical qubits is one such constraint that restricts two-qubit operations, such as CNOT, to "connected" qubits. SWAP gates can be used to place the logical qubits on admissible physical qubits, but they entail a significant increase in CNOT-count. In this paper we consider the problem of reducing the CNOT-count in Clifford+T circuits on connectivity constrained architectures, like noisy intermediate-scale quantum (NISQ) computing devices. We "slice" the circuit at the position of Hadamard gates and "build" the intermediate {CNOT,T} sub-circuits using Steiner trees, significantly improving on previous methods. We compared the performance of our algorithms while mapping different benchmark and random circuits to some well-known architectures such as 9-qubit square grid, 16-qubit square grid, Rigetti 16-qubit Aspen, 16-qubit IBM QX5 and 20-qubit IBM Tokyo. Our methods give less CNOT-count compared to Qiskit and TKET transpiler as well as using SWAP gates. Assuming most of the errors in a NISQ circuit implementation are due to CNOT errors, then our method would allow circuits with few times more CNOT gates be reliably implemented than the previous methods would permit.

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)
• A two-circuit approach to reducing quantum resources for the quantum lattice Boltzmann method [41.66129197681683]
  Current quantum algorithms for solving CFD problems use a single quantum circuit and, in some cases, lattice-based methods. We introduce the a novel multiple circuits algorithm that makes use of a quantum lattice Boltzmann method (QLBM) The problem is cast as a stream function--vorticity formulation of the 2D Navier-Stokes equations and verified and tested on a 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes [3.2505361717998227]
  We propose FrozenQubits that freezes the hotspot nodes or qubits and intelligently partitions the state-space of the given problem into several smaller sub-spaces. Unlike prior circuit-cutting approaches, FrozenQubits does not require any exponentially complex post-processing step. Our evaluations with 5,300 QAOA circuits on eight different quantum computers from IBM shows that FrozenQubits can improve the quality of solutions by 8.73x on average.
  arXiv  Detail & Related papers  (2022-10-31T03:20:56Z)
• Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation [0.0]
  We propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically remaps logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss and RowCol.
  arXiv  Detail & Related papers  (2022-05-02T08:20:13Z)
• Circuit knitting with classical communication [1.8311368766923968]
  We study a method of circuit knitting based on quasiprobability simulation of nonlocal gates with operations that act locally on the subcircuits. We provide a positive answer by showing that for circuits containing $n$ nonlocal CNOT gates connecting two circuit parts, the simulation overhead can be reduced from $O(9n)$ to $O(4n)$ if one allows for classical information exchange.
  arXiv  Detail & Related papers  (2022-04-29T18:00:11Z)
• On Actual Preparation of Dicke State on a Quantum Computer [4.098348230722067]
  We study the importance of concise realizations of Partially defined Unitary Transformations for better circuit construction. We provide the most efficient Deterministic Dicke State Preparation Circuit in terms of CNOT and single qubit gate counts. We analyze different ways of distributing the CNOT gates in the circuit and its affect on the induced error.
  arXiv  Detail & Related papers  (2020-07-03T13:40:32Z)

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.