BibTeX records: J. Niel de Beaudrap

download as .bib file

@article{DBLP:journals/quantum/BeaudrapH22,
  author       = {Niel de Beaudrap and
                  Steven Herbert},
  title        = {Fast Stabiliser Simulation with Quadratic Form Expansions},
  journal      = {Quantum},
  volume       = {6},
  pages        = {803},
  year         = {2022},
  url          = {https://doi.org/10.22331/q-2022-09-15-803},
  doi          = {10.22331/Q-2022-09-15-803},
  timestamp    = {Thu, 28 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/quantum/BeaudrapH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/BeaudrapKW22,
  author       = {Niel de Beaudrap and
                  Aleks Kissinger and
                  John van de Wetering},
  editor       = {Mikolaj Bojanczyk and
                  Emanuela Merelli and
                  David P. Woodruff},
  title        = {Circuit Extraction for ZX-Diagrams Can Be {\#}P-Hard},
  booktitle    = {49th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2022, July 4-8, 2022, Paris, France},
  series       = {LIPIcs},
  volume       = {229},
  pages        = {119:1--119:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2022.119},
  doi          = {10.4230/LIPICS.ICALP.2022.119},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/BeaudrapKW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2202-09194,
  author       = {Niel de Beaudrap and
                  Aleks Kissinger and
                  John van de Wetering},
  title        = {Circuit Extraction for ZX-diagrams can be {\#}P-hard},
  journal      = {CoRR},
  volume       = {abs/2202.09194},
  year         = {2022},
  url          = {https://arxiv.org/abs/2202.09194},
  eprinttype    = {arXiv},
  eprint       = {2202.09194},
  timestamp    = {Thu, 03 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-09194.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/quantum/BeaudrapH20,
  author       = {Niel de Beaudrap and
                  Dominic Horsman},
  title        = {The {ZX} calculus is a language for surface code lattice surgery},
  journal      = {Quantum},
  volume       = {4},
  pages        = {218},
  year         = {2020},
  url          = {https://doi.org/10.22331/q-2020-01-09-218},
  doi          = {10.22331/Q-2020-01-09-218},
  timestamp    = {Sat, 25 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/quantum/BeaudrapH20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/quantum/BeaudrapH20a,
  author       = {Niel de Beaudrap and
                  Steven Herbert},
  title        = {Quantum linear network coding for entanglement distribution in restricted
                  architectures},
  journal      = {Quantum},
  volume       = {4},
  pages        = {356},
  year         = {2020},
  url          = {https://doi.org/10.22331/q-2020-11-01-356},
  doi          = {10.22331/Q-2020-11-01-356},
  timestamp    = {Mon, 20 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/quantum/BeaudrapH20a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tqc/BeaudrapBW20,
  author       = {Niel de Beaudrap and
                  Xiaoning Bian and
                  Quanlong Wang},
  editor       = {Steven T. Flammia},
  title        = {Fast and Effective Techniques for T-Count Reduction via Spider Nest
                  Identities},
  booktitle    = {15th Conference on the Theory of Quantum Computation, Communication
                  and Cryptography, {TQC} 2020, June 9-12, 2020, Riga, Latvia},
  series       = {LIPIcs},
  volume       = {158},
  pages        = {11:1--11:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.TQC.2020.11},
  doi          = {10.4230/LIPICS.TQC.2020.11},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tqc/BeaudrapBW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/abs-2006-02557,
  author       = {Niel de Beaudrap},
  editor       = {Beno{\^{\i}}t Valiron and
                  Shane Mansfield and
                  Pablo Arrighi and
                  Prakash Panangaden},
  title        = {Well-tempered {ZX} and {ZH} Calculi},
  booktitle    = {Proceedings 17th International Conference on Quantum Physics and Logic,
                  {QPL} 2020, Paris, France, June 2 - 6, 2020},
  series       = {{EPTCS}},
  volume       = {340},
  pages        = {13--45},
  year         = {2020},
  url          = {https://doi.org/10.4204/EPTCS.340.2},
  doi          = {10.4204/EPTCS.340.2},
  timestamp    = {Tue, 24 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-02557.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/abs-2004-06455,
  author       = {Niel de Beaudrap and
                  Aleks Kissinger and
                  Konstantinos Meichanetzidis},
  editor       = {Beno{\^{\i}}t Valiron and
                  Shane Mansfield and
                  Pablo Arrighi and
                  Prakash Panangaden},
  title        = {Tensor Network Rewriting Strategies for Satisfiability and Counting},
  booktitle    = {Proceedings 17th International Conference on Quantum Physics and Logic,
                  {QPL} 2020, Paris, France, June 2 - 6, 2020},
  series       = {{EPTCS}},
  volume       = {340},
  pages        = {46--59},
  year         = {2020},
  url          = {https://doi.org/10.4204/EPTCS.340.3},
  doi          = {10.4204/EPTCS.340.3},
  timestamp    = {Mon, 29 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2004-06455.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/abs-1904-12817,
  author       = {Niel de Beaudrap and
                  Ross Duncan and
                  Dominic Horsman and
                  Simon Perdrix},
  editor       = {Bob Coecke and
                  Matthew Leifer},
  title        = {Pauli Fusion: a Computational Model to Realise Quantum Transformations
                  from {ZX} Terms},
  booktitle    = {Proceedings 16th International Conference on Quantum Physics and Logic,
                  {QPL} 2019, Chapman University, Orange, CA, USA, June 10-14, 2019},
  series       = {{EPTCS}},
  volume       = {318},
  pages        = {85--105},
  year         = {2019},
  url          = {https://doi.org/10.4204/EPTCS.318.6},
  doi          = {10.4204/EPTCS.318.6},
  timestamp    = {Sat, 28 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-12817.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/abs-1911-09039,
  author       = {Niel de Beaudrap and
                  Xiaoning Bian and
                  Quanlong Wang},
  editor       = {Bob Coecke and
                  Matthew Leifer},
  title        = {Techniques to Reduce ({\(\pi\)}/4)-Parity-Phase Circuits, Motivated
                  by the {ZX} Calculus},
  booktitle    = {Proceedings 16th International Conference on Quantum Physics and Logic,
                  {QPL} 2019, Chapman University, Orange, CA, USA, June 10-14, 2019},
  series       = {{EPTCS}},
  volume       = {318},
  pages        = {131--149},
  year         = {2019},
  url          = {https://doi.org/10.4204/EPTCS.318.9},
  doi          = {10.4204/EPTCS.318.9},
  timestamp    = {Tue, 24 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1911-09039.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/AldiBGS18,
  author       = {Marco Aldi and
                  Niel de Beaudrap and
                  Sevag Gharibian and
                  Seyran Saeedi},
  editor       = {Igor Potapov and
                  Paul G. Spirakis and
                  James Worrell},
  title        = {On Efficiently Solvable Cases of Quantum k-SAT},
  booktitle    = {43rd International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series       = {LIPIcs},
  volume       = {117},
  pages        = {38:1--38:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2018.38},
  doi          = {10.4230/LIPICS.MFCS.2018.38},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/AldiBGS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BarrettBHL17,
  author       = {Jonathan Barrett and
                  Niel de Beaudrap and
                  Matty J. Hoban and
                  Ciar{\'{a}}n M. Lee},
  title        = {The computational landscape of general physical theories},
  journal      = {CoRR},
  volume       = {abs/1702.08483},
  year         = {2017},
  url          = {http://arxiv.org/abs/1702.08483},
  eprinttype    = {arXiv},
  eprint       = {1702.08483},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BarrettBHL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BeaudrapH17,
  author       = {Niel de Beaudrap and
                  Dominic Horsman},
  title        = {The {ZX} calculus is a language for surface code lattice surgery},
  journal      = {CoRR},
  volume       = {abs/1704.08670},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.08670},
  eprinttype    = {arXiv},
  eprint       = {1704.08670},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BeaudrapH17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1712-09617,
  author       = {Marco Aldi and
                  Niel de Beaudrap and
                  Sevag Gharibian and
                  Seyran Saeedi},
  title        = {On efficiently solvable cases of Quantum k-SAT},
  journal      = {CoRR},
  volume       = {abs/1712.09617},
  year         = {2017},
  url          = {http://arxiv.org/abs/1712.09617},
  eprinttype    = {arXiv},
  eprint       = {1712.09617},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1712-09617.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BeaudrapG16,
  author       = {J. Niel de Beaudrap and
                  Sevag Gharibian},
  editor       = {Ran Raz},
  title        = {A Linear Time Algorithm for Quantum 2-SAT},
  booktitle    = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
                  June 1, 2016, Tokyo, Japan},
  series       = {LIPIcs},
  volume       = {50},
  pages        = {27:1--27:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2016.27},
  doi          = {10.4230/LIPICS.CCC.2016.27},
  timestamp    = {Thu, 02 Feb 2023 13:27:05 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BeaudrapG16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BeaudrapG15,
  author       = {Niel de Beaudrap and
                  Sevag Gharibian},
  title        = {A linear time algorithm for quantum 2-SAT},
  journal      = {CoRR},
  volume       = {abs/1508.07338},
  year         = {2015},
  url          = {http://arxiv.org/abs/1508.07338},
  eprinttype    = {arXiv},
  eprint       = {1508.07338},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BeaudrapG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Beaudrap15,
  author       = {Niel de Beaudrap},
  title        = {On exact counting and quasi-quantum complexity},
  journal      = {CoRR},
  volume       = {abs/1509.07789},
  year         = {2015},
  url          = {http://arxiv.org/abs/1509.07789},
  eprinttype    = {arXiv},
  eprint       = {1509.07789},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Beaudrap15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tqc/Beaudrap14,
  author       = {Niel de Beaudrap},
  editor       = {Steven T. Flammia and
                  Aram W. Harrow},
  title        = {Difficult Instances of the Counting Problem for 2-quantum-SAT are
                  Very Atypical},
  booktitle    = {9th Conference on the Theory of Quantum Computation, Communication
                  and Cryptography, {TQC} 2014, May 21-23, 2014, Singapore},
  series       = {LIPIcs},
  volume       = {27},
  pages        = {118--140},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2014},
  url          = {https://doi.org/10.4230/LIPIcs.TQC.2014.118},
  doi          = {10.4230/LIPICS.TQC.2014.118},
  timestamp    = {Mon, 12 Jul 2021 09:55:56 +0200},
  biburl       = {https://dblp.org/rec/conf/tqc/Beaudrap14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tqc/BeaudrapR14,
  author       = {Niel de Beaudrap and
                  Martin Roetteler},
  editor       = {Steven T. Flammia and
                  Aram W. Harrow},
  title        = {Quantum Linear Network Coding as One-way Quantum Computation},
  booktitle    = {9th Conference on the Theory of Quantum Computation, Communication
                  and Cryptography, {TQC} 2014, May 21-23, 2014, Singapore},
  series       = {LIPIcs},
  volume       = {27},
  pages        = {217--233},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2014},
  url          = {https://doi.org/10.4230/LIPIcs.TQC.2014.217},
  doi          = {10.4230/LIPICS.TQC.2014.217},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tqc/BeaudrapR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BeaudrapR14,
  author       = {J. Niel de Beaudrap and
                  Martin Roetteler},
  title        = {Quantum linear network coding as one-way quantum computation},
  journal      = {CoRR},
  volume       = {abs/1403.3533},
  year         = {2014},
  url          = {http://arxiv.org/abs/1403.3533},
  eprinttype    = {arXiv},
  eprint       = {1403.3533},
  timestamp    = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BeaudrapR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Beaudrap14,
  author       = {Niel de Beaudrap},
  title        = {On the power of "modal quantum" computation},
  journal      = {CoRR},
  volume       = {abs/1405.7381},
  year         = {2014},
  url          = {http://arxiv.org/abs/1405.7381},
  eprinttype    = {arXiv},
  eprint       = {1405.7381},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Beaudrap14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cjtcs/Beaudrap13,
  author       = {Niel de Beaudrap},
  title        = {On the complexity of solving linear congruences and computing nullspaces
                  modulo a constant},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {2013},
  year         = {2013},
  url          = {http://cjtcs.cs.uchicago.edu/articles/2013/10/contents.html},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/Beaudrap13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/qic/Beaudrap13,
  author       = {Niel de Beaudrap},
  title        = {A linearized stabilizer formalism for systems of finite dimension},
  journal      = {Quantum Inf. Comput.},
  volume       = {13},
  number       = {1-2},
  pages        = {73--115},
  year         = {2013},
  url          = {https://doi.org/10.26421/QIC13.1-2-6},
  doi          = {10.26421/QIC13.1-2-6},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qic/Beaudrap13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1202-3949,
  author       = {Niel de Beaudrap},
  title        = {On the complexity of solving linear congruences and computing nullspaces
                  modulo a constant},
  journal      = {CoRR},
  volume       = {abs/1202.3949},
  year         = {2012},
  url          = {http://arxiv.org/abs/1202.3949},
  eprinttype    = {arXiv},
  eprint       = {1202.3949},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-3949.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/Beaudrap10,
  author       = {Niel de Beaudrap},
  title        = {On Restricted Unitary Cayley Graphs and Symplectic Transformations
                  Modulo n},
  journal      = {Electron. J. Comb.},
  volume       = {17},
  number       = {1},
  year         = {2010},
  url          = {https://doi.org/10.37236/341},
  doi          = {10.37236/341},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/Beaudrap10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/qic/BeaudrapP08,
  author       = {J. Niel de Beaudrap and
                  Martin Pei},
  title        = {An extremal result for geometries in the one-way measurement model},
  journal      = {Quantum Inf. Comput.},
  volume       = {8},
  number       = {5},
  pages        = {430--437},
  year         = {2008},
  url          = {https://doi.org/10.26421/QIC8.5-5},
  doi          = {10.26421/QIC8.5-5},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qic/BeaudrapP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tqc/BeaudrapDKR08,
  author       = {J. Niel de Beaudrap and
                  Vincent Danos and
                  Elham Kashefi and
                  Martin R{\"{o}}tteler},
  editor       = {Yasuhito Kawano and
                  Michele Mosca},
  title        = {Quadratic Form Expansions for Unitaries},
  booktitle    = {Theory of Quantum Computation, Communication, and Cryptography, Third
                  Workshop, {TQC} 2008, Tokyo, Japan, January 30 - February 1, 2008.
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5106},
  pages        = {29--46},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-89304-2\_4},
  doi          = {10.1007/978-3-540-89304-2\_4},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tqc/BeaudrapDKR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BeaudrapCW02,
  author       = {J. Niel de Beaudrap and
                  Richard Cleve and
                  John Watrous},
  title        = {Sharp Quantum versus Classical Query Complexity Separations},
  journal      = {Algorithmica},
  volume       = {34},
  number       = {4},
  pages        = {449--461},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00453-002-0978-1},
  doi          = {10.1007/S00453-002-0978-1},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BeaudrapCW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.