Sharp Quantum versus Classical Query Complexity Separations. - J. Niel de Beaudrap; Richard Cleve; John Watrous (Algorithmica, 2002)

Quadratic Form Expansions for Unitaries. - J. Niel de Beaudrap; Vincent Danos; Elham Kashefi; Martin Rötteler (TQC, 2008)

An extremal result for geometries in the one-way measurement model. - J. Niel de Beaudrap; Martin Pei (Quantum Inf. Comput., 2008)

On Restricted Unitary Cayley Graphs and Symplectic Transformations Modulo n. - Niel de Beaudrap (Electron. J. Comb., 2010)

On the complexity of solving linear congruences and computing nullspaces modulo a constant. - Niel de Beaudrap (Chic. J. Theor. Comput. Sci., 2013)

A linearized stabilizer formalism for systems of finite dimension. - Niel de Beaudrap (Quantum Inf. Comput., 2013)

Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical. - Niel de Beaudrap (TQC, 2014)

Quantum Linear Network Coding as One-way Quantum Computation. - Niel de Beaudrap; Martin Roetteler (TQC, 2014)

On the power of "modal quantum" computation. - Niel de Beaudrap (CoRR, 2014)

On exact counting and quasi-quantum complexity. - Niel de Beaudrap (CoRR, 2015)

A Linear Time Algorithm for Quantum 2-SAT. - J. Niel de Beaudrap; Sevag Gharibian (CCC, 2016)

The computational landscape of general physical theories. - Jonathan Barrett; Niel de Beaudrap; Matty J. Hoban; Ciarán M. Lee (CoRR, 2017)

On Efficiently Solvable Cases of Quantum k-SAT. - Marco Aldi; Niel de Beaudrap; Sevag Gharibian; Seyran Saeedi (MFCS, 2018)

Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms. - Niel de Beaudrap; Ross Duncan; Dominic Horsman; Simon Perdrix (QPL, 2019)

Techniques to Reduce (π/4)-Parity-Phase Circuits, Motivated by the ZX Calculus. - Niel de Beaudrap; Xiaoning Bian; Quanlong Wang (QPL, 2019)

Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities. - Niel de Beaudrap; Xiaoning Bian; Quanlong Wang (TQC, 2020)

Tensor Network Rewriting Strategies for Satisfiability and Counting. - Niel de Beaudrap; Aleks Kissinger; Konstantinos Meichanetzidis (QPL, 2020)

Well-tempered ZX and ZH Calculi. - Niel de Beaudrap (QPL, 2020)

The ZX calculus is a language for surface code lattice surgery. - Niel de Beaudrap; Dominic Horsman (Quantum, 2020)

Quantum linear network coding for entanglement distribution in restricted architectures. - Niel de Beaudrap; Steven Herbert (Quantum, 2020)

Circuit Extraction for ZX-Diagrams Can Be #P-Hard. - Niel de Beaudrap; Aleks Kissinger; John van de Wetering (ICALP, 2022)

Fast Stabiliser Simulation with Quadratic Form Expansions. - Niel de Beaudrap; Steven Herbert (Quantum, 2022)

OpenQASM 3: A Broader and Deeper Quantum Assembly Language. - Andrew W. Cross; Ali Javadi-Abhari; Thomas Alexander; Niel de Beaudrap; Lev S. Bishop; Steven Heidel; Colm A. Ryan; Prasahnt Sivarajah; John A. Smolin; Jay M. Gambetta; Blake R. Johnson (ACM Trans. Quantum Comput., 2022)

Simple Qudit ZX and ZH Calculi, via Integrals. - Niel de Beaudrap; Richard D. P. East (MFCS, 2024)

String Diagrams for Defect-Based Surface Code Computing. - Mateusz Kupper; Dominic Horsman; Chris Heunen; Niel de Beaudrap (QPL, 2025)