Niel de Beaudrap

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 15

Top Topics

Quantum Computation

Satisfiability Problem

Top Venues

Publications

Niel de Beaudrap, Richard D. P. East
Simple Qudit ZX and ZH Calculi, via Integrals. MFCS (2024)
Niel de Beaudrap, Aleks Kissinger, John van de Wetering
Circuit Extraction for ZX-Diagrams Can Be #P-Hard. ICALP (2022)
Niel de Beaudrap, Steven Herbert
Fast Stabiliser Simulation with Quadratic Form Expansions. Quantum 6 (2022)
Niel de Beaudrap, Aleks Kissinger, John van de Wetering
Circuit Extraction for ZX-diagrams can be #P-hard. CoRR (2022)
Niel de Beaudrap
Well-tempered ZX and ZH Calculi. QPL (2020)
Niel de Beaudrap, Xiaoning Bian, Quanlong Wang
Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities. TQC (2020)
Niel de Beaudrap, Steven Herbert
Quantum linear network coding for entanglement distribution in restricted architectures. Quantum 4 (2020)
Niel de Beaudrap, Dominic Horsman
The ZX calculus is a language for surface code lattice surgery. Quantum 4 (2020)
Niel de Beaudrap, Aleks Kissinger, Konstantinos Meichanetzidis
Tensor Network Rewriting Strategies for Satisfiability and Counting. QPL (2020)
Niel de Beaudrap, Ross Duncan, Dominic Horsman, Simon Perdrix
Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms. QPL (2019)
Niel de Beaudrap, Xiaoning Bian, Quanlong Wang
Techniques to Reduce (π/4)-Parity-Phase Circuits, Motivated by the ZX Calculus. QPL (2019)
Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi
On Efficiently Solvable Cases of Quantum k-SAT. MFCS (2018)
Niel de Beaudrap, Dominic Horsman
The ZX calculus is a language for surface code lattice surgery. CoRR (2017)
Jonathan Barrett, Niel de Beaudrap, Matty J. Hoban, Ciarán M. Lee
The computational landscape of general physical theories. CoRR (2017)
Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi
On efficiently solvable cases of Quantum k-SAT. CoRR (2017)
Niel de Beaudrap, Sevag Gharibian
A linear time algorithm for quantum 2-SAT. CoRR (2015)
Niel de Beaudrap
On exact counting and quasi-quantum complexity. CoRR (2015)
Niel de Beaudrap
Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical. TQC (2014)
Niel de Beaudrap, Martin Roetteler
Quantum Linear Network Coding as One-way Quantum Computation. TQC (2014)
Niel de Beaudrap
On the power of "modal quantum" computation. CoRR (2014)
Niel de Beaudrap
A linearized stabilizer formalism for systems of finite dimension. Quantum Inf. Comput. 13 (1-2) (2013)
Niel de Beaudrap
On the complexity of solving linear congruences and computing nullspaces modulo a constant. Chic. J. Theor. Comput. Sci. 2013 (2013)
Niel de Beaudrap
On the complexity of solving linear congruences and computing nullspaces modulo a constant CoRR (2012)
Niel de Beaudrap
On Restricted Unitary Cayley Graphs and Symplectic Transformations Modulo n. Electron. J. Comb. 17 (1) (2010)