Diagonal operator decomposition on restricted topologies via enumeration of quantum state subsets

• URL: http://arxiv.org/abs/2403.02109v1
• Date: Mon, 4 Mar 2024 15:10:37 GMT
• Title: Diagonal operator decomposition on restricted topologies via enumeration of quantum state subsets
• Authors: Jan Tu{\l}owiecki, {\L}ukasz Czerwi\'nski, Konrad Deka, Jan Gwinner, Witold Jarnicki, Adam Szady
• Abstract summary: We introduce a framework for the analysis of CX-only circuits and through its lens provide solution constructions for several different device topologies. We discuss how to exploit the framework for the decomposition of a particular, rather than general, diagonal operator.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Various quantum algorithms require usage of arbitrary diagonal operators as subroutines. For their execution on a physical hardware, those operators must be first decomposed into target device's native gateset and its qubit connectivity for entangling gates. Here, we assume that the allowed gates are exactly the CX gate and the parameterized phase gate. We introduce a framework for the analysis of CX-only circuits and through its lens provide solution constructions for several different device topologies (fully-connected, linear and circular). We also introduce two additional variants of the problem. Those variants can be used in place of exact decomposition of the diagonal operator when the circuit following it satisfies a set of prerequisites, enabling further reduction in the CX cost of implementation. Finally, we discuss how to exploit the framework for the decomposition of a particular, rather than general, diagonal operator.

Related papers

• Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings [0.0]
  We introduce an algorithm that decomposes the exponential of an arbitrary tensor product of Weyl-Heisenberg operators into single- and two-qutrit gates.<n>We extend this approach to unitaries generated by Gell-Mann string (i.e., a tensor product of Gell-Mann matrices)<n>In particular, we generalize the Steiner-Gauss method, originally developed to reduce CNOT counts in qubit circuit, to optimize gate routing in qutrit-based systems.
  arXiv  Detail & Related papers  (2025-07-13T20:33:48Z)
• Provably optimal exact gate synthesis from a discrete gate set [0.0]
  We propose a method for exact circuit synthesizing using a discrete gate set. Our approach translates the problem of a gate specified by its unitary matrix into a satisfiability (SAT) instance.
  arXiv  Detail & Related papers  (2025-03-19T17:32:29Z)
• Bridging wire and gate cutting with ZX-calculus [45.200826131319815]
  We show how decompositions of ideal, global unitaries can be obtained diagrammatically using ZX-calculus expanding. We obtain improved decompositions for multi-qubit controlled-Z (MCZ) gates with $1$-norm equal to $3$ for any number of qubits and any partition.
  arXiv  Detail & Related papers  (2025-03-14T15:20:47Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• 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)
• Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware [2.536162003546062]
  We present an approach to synthesize multi controlled phase gates using ZX calculus. By representing quantum circuits as graph like ZX diagrams, one can utilize the distinct graph structure of diagonal gates.
  arXiv  Detail & Related papers  (2024-03-16T09:06:49Z)
• Near-optimal quantum circuit construction via Cartan decomposition [4.900041609957432]
  We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation.
  arXiv  Detail & Related papers  (2022-12-25T17:01:13Z)
• 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)
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis [0.8367938108534343]
  We determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. We find that there are a large number of configurations that all produce the desired result, even at the minimum number of gates. In addition to treating the general case of arbitrary target states or unitary operators, we apply the numerical approach to the special case of synthesizing the multi-qubit Toffoli gate.
  arXiv  Detail & Related papers  (2022-04-28T14:20:21Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates [0.0]
  We present explicit canonical forms for all the elements in the two-qubit CNOT-Dihedral group, with minimal numbers of controlled-S (CS) and controlled-X ( CX) gates. We provide an algorithm to successively construct the n-qubit CNOT-Dihedral group, asserting an optimal number of controlled-X ( CX) gates.
  arXiv  Detail & Related papers  (2020-06-22T07:28:15Z)
• 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.