Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation

• URL: http://arxiv.org/abs/2205.02600v2
• Date: Mon, 7 Nov 2022 10:21:55 GMT
• Title: Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation
• Authors: Renaud Vilmart
• Abstract summary: "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems. We show that it is complete for "Toffoli-Hadamard", the simplest approximately universal fragment of quantum mechanics.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We give here a new set of rewrite rules for the formalism, and show that it is complete for "Toffoli-Hadamard", the simplest approximately universal fragment of quantum mechanics. We show that the rewriting is terminating, but not confluent (which is expected from the universality of the fragment). We do so using the connection between Sum-over-Paths and graphical language ZH-Calculus, and also show how the axiomatisation translates into the latter. Finally, we show how to enrich the rewrite system to reach completeness for the dyadic fragments of quantum computation -- obtained by adding phase gates with dyadic multiples of $\pi$ to the Toffoli-Hadamard gate-set -- used in particular in the Quantum Fourier Transform.

Related papers

• Quantum Circuits, Feature Maps, and Expanded Pseudo-Entropy: A Categorical Theoretic Analysis of Encoding Real-World Data into a Quantum Computer [0.0]
  The aim of this paper is to determine the efficacy of an encoding scheme to map real-world data into a quantum circuit. The method calculates the Shannon entropy of each of the data points from a point-cloud, hence, samples from an embedded manifold.
  arXiv  Detail & Related papers  (2024-10-29T14:38:01Z)
• Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer [0.5064404027153093]
  We introduce an object called a emphsubspace graph that formalizes the technique of multidimensional quantum walks. We show how to combine a emphswitching network with arbitrary quantum subroutines, to compute a composed function.
  arXiv  Detail & Related papers  (2024-01-16T13:32:04Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information [0.9208007322096533]
  We study representation theory of the partially transposed permutation matrix algebra. We show how to simplify semidefinite optimization problems over unitary-equivariant quantum channels. We derive an efficient quantum circuit for implementing the optimal port-based quantum teleportation protocol.
  arXiv  Detail & Related papers  (2023-10-03T17:55:10Z)
• Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing [0.0]
  We give here a new set of rewrite rules for the formalism "Sum-Over-Paths" We show that it is complete for "Toffoli-Hadamard", the simplest approximately universal fragment of quantum mechanics. We also show how to perform sums and concatenation of arbitrary terms.
  arXiv  Detail & Related papers  (2023-07-26T14:40:21Z)
• The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality [0.0]
  We show how to generalise all the phase-free qudit rules to qudits. We prove that circuits of |0>-controlled X and Hadamard gates are approximately universal for qudit quantum computing for any odd prime d.
  arXiv  Detail & Related papers  (2023-07-19T16:09:48Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits [58.720142291102135]
  We introduce the LOv-calculus, a graphical language for reasoning about linear optical quantum circuits. Two LOv-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the LOv-calculus.
  arXiv  Detail & Related papers  (2022-04-25T16:59:26Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• 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.