Quantum Algorithms and Oracles with the Scalable ZX-calculus

• URL: http://arxiv.org/abs/2104.01043v2
• Date: Mon, 13 Sep 2021 02:08:00 GMT
• Title: Quantum Algorithms and Oracles with the Scalable ZX-calculus
• Authors: Titouan Carette, Yohann D'Anello and Simon Perdrix
• Abstract summary: We show that the scalable ZX-calculus provides a formal, intuitive, and compact framework to describe and prove quantum algorithms. We consider the standard oracle-based quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon, and Grover algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical possibility of a purely graphical description of quantum processes. However, in practice, such approaches are limited by the intrinsic low level nature of ZX calculus. The scalable notations have been proposed as an attempt to recover an higher level point of view while maintaining the topological rewriting rules of a graphical language. We demonstrate that the scalable ZX-calculus provides a formal, intuitive, and compact framework to describe and prove quantum algorithms. As a proof of concept, we consider the standard oracle-based quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon, and Grover algorithms, and we show they can be described and proved graphically.

Related papers

• ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces [0.09831489366502298]
  The ZX-calculus is a graphical language for quantum computing and quantum information theory. We prove completeness of finite-dimensional ZX-calculus, incorporating only the mixed-dimensional Z-spider and the qudit X-spider as generators. Our approach builds on the completeness of another graphical language, the finite-dimensional ZW-calculus, with direct translations between these two calculi.
  arXiv  Detail & Related papers  (2024-05-17T16:35:07Z)
• Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory [0.11049608786515838]
  We introduce the qufinite ZXW calculus - a graphical language for reasoning about finite-dimensional quantum theory. We prove the completeness of this calculus by demonstrating that any qufinite ZXW diagram can be rewritten into its normal form. Our work paves the way for a comprehensive diagrammatic description of quantum physics, opening the doors of this area to the wider public.
  arXiv  Detail & Related papers  (2023-09-22T17:23:58Z)
• 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)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• 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)
• 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)
• Qufinite ZX-calculus: a unified framework of qudit ZX-calculi [0.3655021726150367]
  We generalise qubit ZX-calculus to qudit ZX-calculus in any finite dimension. We propose a graphical formalism called qufinite ZX-calculus as a unified framework for all qudit ZX-calculi.
  arXiv  Detail & Related papers  (2021-04-13T18:10:13Z)
• Simplification Strategies for the Qutrit ZX-Calculus [0.0]
  The ZX-calculus is a graphical language for suitably represented tensor networks, called ZX-diagrams. The ZX-calculus has found applications in reasoning about quantum circuits, condensed matter systems, quantum algorithms, quantum error codes, and counting problems.
  arXiv  Detail & Related papers  (2021-03-11T19:17:28Z)
• 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)
• ZX-calculus for the working quantum computer scientist [0.0]
  The ZX-calculus is a graphical language for reasoning about quantum computation. This review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The latter sections give a condensed overview of the literature on the ZX-calculus.
  arXiv  Detail & Related papers  (2020-12-27T15:54:25Z)
• PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
  We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
  arXiv  Detail & Related papers  (2020-02-21T16:15:58Z)

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.