A polynomial size model with implicit SWAP gate counting for exact qubit reordering

• URL: http://arxiv.org/abs/2009.08748v1
• Date: Fri, 18 Sep 2020 11:06:19 GMT
• Title: A polynomial size model with implicit SWAP gate counting for exact qubit reordering
• Authors: Jesse Mulderij and Karen I. Aardal and Irina Chiscop and Frank Phillipson
• Abstract summary: Quantum circuit designers must adhere to the constraints posed by the limited interaction distance of qubits. We consider the Nearest Neighbor Compliance problem on a linear array, where the number of required SWAP gates is to be minimized.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Due to the physics behind quantum computing, quantum circuit designers must adhere to the constraints posed by the limited interaction distance of qubits. Existing circuits need therefore to be modified via the insertion of SWAP gates, which alter the qubit order by interchanging the location of two qubits' quantum states. We consider the Nearest Neighbor Compliance problem on a linear array, where the number of required SWAP gates is to be minimized. We introduce an Integer Linear Programming model of the problem of which the size scales polynomially in the number of qubits and gates. Furthermore, we solve $131$ benchmark instances to optimality using the commercial solver CPLEX. The benchmark instances are substantially larger in comparison to those evaluated with exact methods before. The largest circuits contain up to $18$ qubits or over $100$ quantum gates. This formulation also seems to be suitable for developing heuristic methods since (near) optimal solutions are discovered quickly in the search process.

Related papers

• Efficient Implementation of Multi-Controlled Quantum Gates [0.0]
  We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods. We extend our methods for any number of target qubits, and provide further cost reductions if additional ancilla qubits are available.
  arXiv  Detail & Related papers  (2024-04-02T20:13:18Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [44.99833362998488]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers. The square-lattice surface code has become the workhorse to address this challenge. In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Efficient parallelization of quantum basis state shift [0.0]
  We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.
  arXiv  Detail & Related papers  (2023-04-04T11:01:08Z)
• 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)
• Approximate encoding of quantum states using shallow circuits [0.0]
  A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. Here, we aim at creating an approximate encoding of the target state using a limited number of gates. Our work offers a universal method to prepare target states using local gates and represents a significant improvement over known strategies.
  arXiv  Detail & Related papers  (2022-06-30T18:00:04Z)
• Approaching the theoretical limit in quantum gate decomposition [0.0]
  We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
  arXiv  Detail & Related papers  (2021-09-14T15:36:22Z)
• 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)
• 2D Qubit Placement of Quantum Circuits using LONGPATH [1.6631602844999722]
  Two algorithms are proposed to optimize the number of SWAP gates in any arbitrary quantum circuit. Our approach has a significant reduction in number of SWAP gates in 1D and 2D NTC architecture.
  arXiv  Detail & Related papers  (2020-07-14T04:09:52Z)
• 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.