251 citations · 540 across the 15 of their papers we have counts for
12 papers · 1 filter
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…
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…
Quantum linear network coding as one-way quantum computation
Niel de Beaudrap, Martin Roetteler
Network coding is a technique to maximize communication rates within a network, in communication protocols for simultaneous multi-party transmission of information. Linear network…
A linearized stabilizer formalism for systems of finite dimension
Niel de Beaudrap
The stabilizer formalism is a scheme, generalizing well-known techniques developed by Gottesman [quant-ph/9705052] in the case of qubits, to efficiently simulate a class of transfo…
Ground states of unfrustrated spin Hamiltonians satisfy an area law
Niel de Beaudrap, Tobias J. Osborne, Jens Eisert
We show that ground states of unfrustrated quantum spin-1/2 systems on general lattices satisfy an entanglement area law, provided that the Hamiltonian can be decomposed into neare…
Solving frustration-free spin systems
N. de Beaudrap, M. Ohliger, T. J. Osborne +1
We identify a large class of quantum many-body systems that can be solved exactly: natural frustration-free spin-1/2 nearest-neighbor Hamiltonians on arbitrary lattices. We show th…
Unitary-circuit semantics for measurement-based computations
Niel de Beaudrap
One-way measurement based quantum computations (1WQC) may describe unitary transformations, via a composition of CPTP maps which are not all unitary themselves. This motivates the…
Quadratic Form Expansions for Unitaries
Niel de Beaudrap, Vincent Danos, Elham Kashefi +1
We introduce techniques to analyze unitary operations in terms of quadratic form expansions, a form similar to a sum over paths in the computational basis when the phase contribute…
One-qubit fingerprinting schemes
J. Niel de Beaudrap
Fingerprinting is a technique in communication complexity in which two parties (Alice and Bob) with large data sets send short messages to a third party (a referee), who attempts t…