J. Niel de Beaudrap

According to our database, J. Niel de Beaudrap authored at least 22 papers between 2002 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Fast Stabiliser Simulation with Quadratic Form Expansions.

Niel de Beaudrap, Steven Herbert

Quantum, September, 2022

Circuit Extraction for ZX-Diagrams Can Be #P-Hard.

Niel de Beaudrap, Aleks Kissinger, John van de Wetering

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020

Quantum linear network coding for entanglement distribution in restricted architectures.

Niel de Beaudrap, Steven Herbert

Quantum, 2020

The ZX calculus is a language for surface code lattice surgery.

Niel de Beaudrap, Dominic Horsman

Quantum, 2020

Well-tempered ZX and ZH Calculi.

Niel de Beaudrap

Proceedings of the Proceedings 17th International Conference on Quantum Physics and Logic, 2020

Tensor Network Rewriting Strategies for Satisfiability and Counting.

Niel de Beaudrap, Aleks Kissinger, Konstantinos Meichanetzidis

Proceedings of the Proceedings 17th International Conference on Quantum Physics and Logic, 2020

Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities.

Niel de Beaudrap, Xiaoning Bian, Quanlong Wang

Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

2019

Techniques to Reduce (π/4)-Parity-Phase Circuits, Motivated by the ZX Calculus.

Niel de Beaudrap, Xiaoning Bian, Quanlong Wang

Proceedings of the Proceedings 16th International Conference on Quantum Physics and Logic, 2019

Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms.

Niel de Beaudrap, Ross Duncan, Dominic Horsman, Simon Perdrix

Proceedings of the Proceedings 16th International Conference on Quantum Physics and Logic, 2019

2018

On Efficiently Solvable Cases of Quantum k-SAT.

Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

The computational landscape of general physical theories.

Jonathan Barrett, Niel de Beaudrap, Matty J. Hoban, Ciarán M. Lee

CoRR, 2017

2016

A Linear Time Algorithm for Quantum 2-SAT.

J. Niel de Beaudrap, Sevag Gharibian

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

On exact counting and quasi-quantum complexity.

Niel de Beaudrap

CoRR, 2015

2014

On the power of "modal quantum" computation.

Niel de Beaudrap

CoRR, 2014

Quantum Linear Network Coding as One-way Quantum Computation.

Niel de Beaudrap, Martin Roetteler

Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical.

Niel de Beaudrap

Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

2013

A linearized stabilizer formalism for systems of finite dimension.

Niel de Beaudrap

Quantum Inf. Comput., 2013

On the complexity of solving linear congruences and computing nullspaces modulo a constant.

Niel de Beaudrap

Chic. J. Theor. Comput. Sci., 2013

2010

On Restricted Unitary Cayley Graphs and Symplectic Transformations Modulo n.

Niel de Beaudrap

Electron. J. Comb., 2010

2008

An extremal result for geometries in the one-way measurement model.

J. Niel de Beaudrap, Martin Pei

Quantum Inf. Comput., 2008

Quadratic Form Expansions for Unitaries.

J. Niel de Beaudrap, Vincent Danos, Elham Kashefi, Martin Rötteler

Proceedings of the Theory of Quantum Computation, 2008

2002

Sharp Quantum versus Classical Query Complexity Separations.

J. Niel de Beaudrap, Richard Cleve, John Watrous

Algorithmica, 2002