A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond

03/22/2021
by   Rachid Echahed, et al.
0

We introduce a class of rooted graphs which allows one to encode various kinds of classical or quantum circuits. We then follow a set-theoretic approach to define rewrite systems over the considered graphs and propose a new complete Superposition callculus which handles sets of formulas consisting of equations or disequations over these graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2017

Quantum programming made easy

We introduce the functional language IQu ("Haiku") which, under the para...
research
10/05/2020

Symbolic Verification of Quantum Circuits

This short note proposes a symbolic approach for representing and reason...
research
04/13/2023

Graph-theoretic insights on the constructability of complex entangled states

The most efficient automated way to construct a large class of quantum p...
research
12/10/2021

Equivariant Quantum Graph Circuits

We investigate quantum circuits for graph representation learning, and p...
research
05/12/2021

Test of Quantumness with Small-Depth Quantum Circuits

Recently Brakerski, Christiano, Mahadev, Vazirani and Vidick (FOCS 2018)...
research
10/26/2020

Quantum superpositions of graphs

We provide a robust notion of quantum superpositions of graphs. Quantum ...
research
02/09/2021

Facial Expression Recognition on a Quantum Computer

We address the problem of facial expression recognition and show a possi...

Please sign up or login with your details

Forgot password? Click here to reset