251 citations · 540 across the 15 of their papers we have counts for
15 papers
Circuit Extraction for ZX-diagrams can be #P-hard
Niel de Beaudrap, Aleks Kissinger, John van de Wetering
The ZX-calculus is a graphical language for reasoning about quantum computation using ZX-diagrams, a certain flexible generalisation of quantum circuits that can be used to represe…
OpenQASM 3: A broader and deeper quantum assembly language
Andrew W. Cross, Ali Javadi-Abhari, Thomas Alexander +8
Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was p…
Tensor Network Rewriting Strategies for Satisfiability and Counting
Niel de Beaudrap, Aleks Kissinger, Konstantinos Meichanetzidis
We provide a graphical treatment of SAT and #SAT on equal footing. Instances of #SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted…
The ZX calculus is a language for surface code lattice surgery
Niel de Beaudrap, Dominic Horsman
A leading choice of error correction for scalable quantum computing is the surface code with lattice surgery. The basic lattice surgery operations, the merging and splitting of log…
The computational landscape of general physical theories
Jonathan Barrett, Niel de Beaudrap, Matty J. Hoban +1
There is good evidence that quantum computers are more powerful than classical computers, and that various simple modifications of quantum theory yield computational power that is…
A linear time algorithm for quantum 2-SAT
Niel de Beaudrap, Sevag Gharibian
The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deter…