| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Circuit Extraction for ZX-Diagrams Can Be #P-Hard | de Beaudrap, Niel et al. | 2022 |
| 2 | Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities | de Beaudrap, Niel et al. | 2020 |
| 3 | On Efficiently Solvable Cases of Quantum k-SAT | Aldi, Marco et al. | 2018 |
| 4 | A Linear Time Algorithm for Quantum 2-SAT | de Beaudrap, Niel et al. | 2016 |
| 5 | Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical | de Beaudrap, Niel | 2014 |
| 6 | Quantum Linear Network Coding as One-way Quantum Computation | de Beaudrap, Niel et al. | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |