Recursive Methods for Synthesizing Permutations on Limited-Connectivity Quantum Computers

• URL: http://arxiv.org/abs/2207.06199v2
• Date: Fri, 2 Dec 2022 20:33:12 GMT
• Title: Recursive Methods for Synthesizing Permutations on Limited-Connectivity Quantum Computers
• Authors: Cynthia Chen, Bruno Schmitt, Helena Zhang, Lev S. Bishop, Ali Javadi-Abhari
• Abstract summary: We describe a family of methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Our algorithms are applicable to generic connectivity constraints, scale, and achieve close-to-optimal performance in many cases.
• Score: 1.3392837372242903
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a non-scalable, yet exact, synthesis. Our algorithms are applicable to generic connectivity constraints, scale favorably, and achieve close-to-optimal performance in many cases. We demonstrate the utility of these algorithms by optimizing the compilation of Quantum Volume circuits, and to disprove an old conjecture on reversals being the hardest permutation on a path.

Related papers

• Optimizing Quantum Circuits, Fast and Slow [7.543907169342984]
  We present a framework for thinking of rewriting and resynthesis as abstract circuit transformations. We then present a radically simple algorithm, GUOQ, for optimizing quantum circuits.
  arXiv  Detail & Related papers  (2024-11-06T18:34:35Z)
• Quantum Circuit Optimization with AlphaTensor [47.9303833600197]
  We develop AlphaTensor-Quantum, a method to minimize the number of T gates that are needed to implement a given circuit. Unlike existing methods for T-count optimization, AlphaTensor-Quantum can incorporate domain-specific knowledge about quantum computation and leverage gadgets. Remarkably, it discovers an efficient algorithm akin to Karatsuba's method for multiplication in finite fields.
  arXiv  Detail & Related papers  (2024-02-22T09:20:54Z)
• Global Synthesis of CNOT Circuits with Holes [0.0]
  We propose an alternative approach to generalising resynthesis algorithms to general quantum circuits. Instead of cutting the circuit into slices, we "cut out" the gates we can't resynthesise leaving holes in our quantum circuit. The result is a second-order process called a quantum comb, which can be resynthesised directly.
  arXiv  Detail & Related papers  (2023-08-31T06:58:03Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• Efficiently Solve the Max-cut Problem via a Quantum Qubit Rotation Algorithm [7.581898299650999]
  We introduce a simple yet efficient algorithm named Quantum Qubit Rotation Algorithm (QQRA) The approximate solution of the max-cut problem can be obtained with probability close to 1. We compare it with the well known quantum approximate optimization algorithm and the classical Goemans-Williamson algorithm.
  arXiv  Detail & Related papers  (2021-10-15T11:19:48Z)
• Quantum Error Mitigation Relying on Permutation Filtering [84.66087478797475]
  We propose a general framework termed as permutation filters, which includes the existing permutation-based methods as special cases. We show that the proposed filter design algorithm always converges to the global optimum, and that the optimal filters can provide substantial improvements over the existing permutation-based methods.
  arXiv  Detail & Related papers  (2021-07-03T16:07:30Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications [1.6329956884407544]
  We introduce two ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics. Our technique is generic and can be useful for a wide variety of quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-19T16:20:31Z)
• Efficient CNOT Synthesis for NISQ Devices [1.0152838128195467]
  In the era of noisy intermediate-scale quantum (NISQ), executing quantum algorithms on actual quantum devices faces unique challenges. We propose a CNOT synthesis method called the token reduction method to solve this problem. Our algorithm consistently outperforms the best publicly accessible algorithm for all of the tested quantum architectures.
  arXiv  Detail & Related papers  (2020-11-12T15:13:32Z)
• 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)

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.