default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Niel de Beaudrap
Person information
- affiliation: University of Sussex, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j8]Niel de Beaudrap, Steven Herbert:
Fast Stabiliser Simulation with Quadratic Form Expansions. Quantum 6: 803 (2022)- 2020
- [j7]Niel de Beaudrap
, Dominic Horsman:
The ZX calculus is a language for surface code lattice surgery. Quantum 4: 218 (2020) - [j6]Niel de Beaudrap, Steven Herbert:
Quantum linear network coding for entanglement distribution in restricted architectures. Quantum 4: 356 (2020) - 2013
- [j5]Niel de Beaudrap:
On the complexity of solving linear congruences and computing nullspaces modulo a constant. Chic. J. Theor. Comput. Sci. 2013 (2013) - [j4]Niel de Beaudrap:
A linearized stabilizer formalism for systems of finite dimension. Quantum Inf. Comput. 13(1-2): 73-115 (2013) - 2010
- [j3]Niel de Beaudrap:
On Restricted Unitary Cayley Graphs and Symplectic Transformations Modulo n. Electron. J. Comb. 17(1) (2010) - 2008
- [j2]J. Niel de Beaudrap, Martin Pei:
An extremal result for geometries in the one-way measurement model. Quantum Inf. Comput. 8(5): 430-437 (2008) - 2002
- [j1]J. Niel de Beaudrap, Richard Cleve, John Watrous:
Sharp Quantum versus Classical Query Complexity Separations. Algorithmica 34(4): 449-461 (2002)
Conference and Workshop Papers
- 2024
- [c12]Niel de Beaudrap, Richard D. P. East:
Simple Qudit ZX and ZH Calculi, via Integrals. MFCS 2024: 20:1-20:20 - 2022
- [c11]Niel de Beaudrap, Aleks Kissinger, John van de Wetering:
Circuit Extraction for ZX-Diagrams Can Be #P-Hard. ICALP 2022: 119:1-119:19 - 2020
- [c10]Niel de Beaudrap, Xiaoning Bian, Quanlong Wang:
Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities. TQC 2020: 11:1-11:23 - [c9]Niel de Beaudrap:
Well-tempered ZX and ZH Calculi. QPL 2020: 13-45 - [c8]Niel de Beaudrap, Aleks Kissinger, Konstantinos Meichanetzidis:
Tensor Network Rewriting Strategies for Satisfiability and Counting. QPL 2020: 46-59 - 2019
- [c7]Niel de Beaudrap, Ross Duncan, Dominic Horsman, Simon Perdrix:
Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms. QPL 2019: 85-105 - [c6]Niel de Beaudrap, Xiaoning Bian, Quanlong Wang:
Techniques to Reduce (π/4)-Parity-Phase Circuits, Motivated by the ZX Calculus. QPL 2019: 131-149 - 2018
- [c5]Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi:
On Efficiently Solvable Cases of Quantum k-SAT. MFCS 2018: 38:1-38:16 - 2016
- [c4]J. Niel de Beaudrap, Sevag Gharibian:
A Linear Time Algorithm for Quantum 2-SAT. CCC 2016: 27:1-27:21 - 2014
- [c3]Niel de Beaudrap:
Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical. TQC 2014: 118-140 - [c2]Niel de Beaudrap, Martin Roetteler:
Quantum Linear Network Coding as One-way Quantum Computation. TQC 2014: 217-233 - 2008
- [c1]J. Niel de Beaudrap, Vincent Danos, Elham Kashefi, Martin Rötteler:
Quadratic Form Expansions for Unitaries. TQC 2008: 29-46
Informal and Other Publications
- 2022
- [i9]Niel de Beaudrap, Aleks Kissinger, John van de Wetering:
Circuit Extraction for ZX-diagrams can be #P-hard. CoRR abs/2202.09194 (2022) - 2017
- [i8]Jonathan Barrett, Niel de Beaudrap, Matty J. Hoban, Ciarán M. Lee:
The computational landscape of general physical theories. CoRR abs/1702.08483 (2017) - [i7]Niel de Beaudrap, Dominic Horsman:
The ZX calculus is a language for surface code lattice surgery. CoRR abs/1704.08670 (2017) - [i6]Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi:
On efficiently solvable cases of Quantum k-SAT. CoRR abs/1712.09617 (2017) - 2015
- [i5]Niel de Beaudrap, Sevag Gharibian:
A linear time algorithm for quantum 2-SAT. CoRR abs/1508.07338 (2015) - [i4]Niel de Beaudrap:
On exact counting and quasi-quantum complexity. CoRR abs/1509.07789 (2015) - 2014
- [i3]J. Niel de Beaudrap, Martin Roetteler:
Quantum linear network coding as one-way quantum computation. CoRR abs/1403.3533 (2014) - [i2]Niel de Beaudrap:
On the power of "modal quantum" computation. CoRR abs/1405.7381 (2014) - 2012
- [i1]Niel de Beaudrap:
On the complexity of solving linear congruences and computing nullspaces modulo a constant. CoRR abs/1202.3949 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
