Graphical quantum Clifford-encoder compilers from the ZX calculus

• URL: http://arxiv.org/abs/2301.02356v2
• Date: Thu, 4 Jan 2024 16:05:16 GMT
• Title: Graphical quantum Clifford-encoder compilers from the ZX calculus
• Authors: Andrey Boris Khesin, Jonathan Z. Lu, and Peter W. Shor
• Abstract summary: We present a quantum compilation algorithm that maps Clifford encoders to a unique graphical representation in the ZX calculus. Specifically, we develop a canonical form in the ZX calculus and prove canonicity as well as efficient reducibility of any Clifford encoder into the canonical form.
• Score: 1.6385815610837167
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a quantum compilation algorithm that maps Clifford encoders, encoding maps for stabilizer quantum codes, to a unique graphical representation in the ZX calculus. Specifically, we develop a canonical form in the ZX calculus and prove canonicity as well as efficient reducibility of any Clifford encoder into the canonical form. The diagrams produced by our compiler visualize information propagation and entanglement structure of the encoder, revealing properties that may be obscured in the circuit or stabilizer-tableau representation. Consequently, our canonical representation may be an informative technique for the design of new stabilizer quantum codes via graph theory analysis.

Related papers

• Building holographic code from the boundary [4.443525249044746]
  Holographic quantum error-correcting code, the quantum-information structure hypothesized for the AdS/CFT correspondence, has been attracting increasing attention in new directions. We initiate a novel approach for building holographic code that can be applied in potentially broad and interdisciplinary contexts.
  arXiv  Detail & Related papers  (2024-07-14T16:51:17Z)
• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• Quantum Tutte Embeddings [2.8981045877033993]
  This paper describes how to create a graph-drawing quantum circuit from a given graph. We show how a Tutte embedding can be calculated as a quantum state in this circuit that can then be sampled to extract the embedding.
  arXiv  Detail & Related papers  (2023-07-17T21:23:28Z)
• A ZX-Calculus Approach for the Construction of Graph Codes [2.136983452580014]
  Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for their distinct attributes and promising utility in quantum technologies. This study underscores the significance of devising expansive QECCs and adopts the ZX-calculus a graphical language adept at quantum computational reasoning.
  arXiv  Detail & Related papers  (2023-04-17T15:24:28Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Diagrammatic Differentiation for Quantum Machine Learning [0.19336815376402716]
  We show how to calculate diagrammatically the gradient of a linear map with respect to a phase parameter. For diagrams of parametrised quantum circuits, we get the well-known parameter-shift rule. We then extend our method to the automatic differentation of hybrid classical-quantum circuits.
  arXiv  Detail & Related papers  (2021-03-14T16:04:56Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
  We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer. The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
  arXiv  Detail & Related papers  (2020-03-25T02:46: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.