J. Niel de Beaudrap

Orcid: 0000-0001-9549-5146

Affiliations:
  • University of Sussex, UK


According to our database1, J. Niel de Beaudrap authored at least 23 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Simple Qudit ZX and ZH Calculi, via Integrals.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2022
Fast Stabiliser Simulation with Quadratic Form Expansions.
Quantum, September, 2022

Circuit Extraction for ZX-Diagrams Can Be #P-Hard.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020
Quantum linear network coding for entanglement distribution in restricted architectures.
Quantum, 2020

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

Well-tempered ZX and ZH Calculi.
Proceedings of the Proceedings 17th International Conference on Quantum Physics and Logic, 2020

Tensor Network Rewriting Strategies for Satisfiability and Counting.
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.
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.
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.
Proceedings of the Proceedings 16th International Conference on Quantum Physics and Logic, 2019

2018
On Efficiently Solvable Cases of Quantum k-SAT.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
The computational landscape of general physical theories.
CoRR, 2017

2016
A Linear Time Algorithm for Quantum 2-SAT.
Proceedings of the 31st Conference on Computational Complexity, 2016

2015
On exact counting and quasi-quantum complexity.
CoRR, 2015

2014
On the power of "modal quantum" computation.
CoRR, 2014

Quantum Linear Network Coding as One-way Quantum Computation.
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.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

2013
A linearized stabilizer formalism for systems of finite dimension.
Quantum Inf. Comput., 2013

On the complexity of solving linear congruences and computing nullspaces modulo a constant.
Chic. J. Theor. Comput. Sci., 2013

2010
On Restricted Unitary Cayley Graphs and Symplectic Transformations Modulo n.
Electron. J. Comb., 2010

2008
An extremal result for geometries in the one-way measurement model.
Quantum Inf. Comput., 2008

Quadratic Form Expansions for Unitaries.
Proceedings of the Theory of Quantum Computation, 2008

2002
Sharp Quantum versus Classical Query Complexity Separations.
Algorithmica, 2002


  Loading...