Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures

• URL: http://arxiv.org/abs/2201.06457v1
• Date: Mon, 17 Jan 2022 15:11:36 GMT
• Title: Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures
• Authors: Timoth\'ee Goubault de Brugi\`ere, Marc Baboulin, Beno\^it Valiron, Simon Martiel and Cyril Allouche
• Abstract summary: We present a new algorithm for the synthesis of CNOT circuits based on the solution of the syndrome decoding problem. Our method addresses the case of ideal hardware with an all-to-all qubit connectivity and the case of near-term quantum devices with restricted connectivity.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Current proposals for quantum compilers require the synthesis and optimization of linear reversible circuits and among them CNOT circuits. Since these circuits represent a significant part of the cost of running an entire quantum circuit, we aim at reducing their size. In this paper we present a new algorithm for the synthesis of CNOT circuits based on the solution of the syndrome decoding problem. Our method addresses the case of ideal hardware with an all-to-all qubit connectivity and the case of near-term quantum devices with restricted connectivity. For both cases, we present benchmarks showing that our algorithm outperforms existing algorithms.

Related papers

• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Nearest neighbor synthesis of CNOT circuits on general quantum architectures [12.363647205992951]
  This paper addresses the nearest neighbor synthesis of CNOT circuits in the architecture with and without Hamiltonian paths. A key-qubit priority mapping model for the general architecture with and without Hamiltonian paths is proposed. Experimental results show that the proposed method can enhance the fidelity of the CNOT circuit by about 64.7% on a real quantum computing device.
  arXiv  Detail & Related papers  (2023-10-01T06:30:58Z)
• Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus [0.0]
  We contribute to the field of compilation or, more precisely, synthesis by reducing the number of CNOTs in the synthesized quantum circuit. Our method shows to outperform other state-of-the-art synthesis techniques, when executed with respect to a specific hardware.
  arXiv  Detail & Related papers  (2023-09-16T12:11:56Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• 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)
• Architecture aware compilation of quantum circuits via lazy synthesis [0.0]
  We propose a meta-heuristic that couples the iterative approach of SWAP insertion techniques with greedy architecture aware synthesis routines. We show that our algorithms show significant reduction in the entangling gate overhead due to compilation.
  arXiv  Detail & Related papers  (2020-12-17T15:20:02Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• 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)
• Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices [0.0]
  We propose a new algorithm toe quantum circuits for connectivitys, which takes into account the qubit of the quantum computer. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and tket.
  arXiv  Detail & Related papers  (2020-04-13T16:26:14Z)

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.